Wikiversity:Colloquium

<mediawiki xmlns="http://www.mediawiki.org/xml/export-0.11/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.mediawiki.org/xml/export-0.11/ http://www.mediawiki.org/xml/export-0.11.xsd" version="0.11" xml:lang="en">
  <siteinfo>
    <sitename>Wikiversity</sitename>
    <dbname>enwikiversity</dbname>
    <base>https://en.wikiversity.org/wiki/Wikiversity:Main_Page</base>
    <generator>MediaWiki 1.47.0-wmf.2</generator>
    <case>first-letter</case>
    <namespaces>
      <namespace key="-2" case="first-letter">Media</namespace>
      <namespace key="-1" case="first-letter">Special</namespace>
      <namespace key="0" case="first-letter" />
      <namespace key="1" case="first-letter">Talk</namespace>
      <namespace key="2" case="first-letter">User</namespace>
      <namespace key="3" case="first-letter">User talk</namespace>
      <namespace key="4" case="first-letter">Wikiversity</namespace>
      <namespace key="5" case="first-letter">Wikiversity talk</namespace>
      <namespace key="6" case="first-letter">File</namespace>
      <namespace key="7" case="first-letter">File talk</namespace>
      <namespace key="8" case="first-letter">MediaWiki</namespace>
      <namespace key="9" case="first-letter">MediaWiki talk</namespace>
      <namespace key="10" case="first-letter">Template</namespace>
      <namespace key="11" case="first-letter">Template talk</namespace>
      <namespace key="12" case="first-letter">Help</namespace>
      <namespace key="13" case="first-letter">Help talk</namespace>
      <namespace key="14" case="first-letter">Category</namespace>
      <namespace key="15" case="first-letter">Category talk</namespace>
      <namespace key="100" case="first-letter">School</namespace>
      <namespace key="101" case="first-letter">School talk</namespace>
      <namespace key="102" case="first-letter">Portal</namespace>
      <namespace key="103" case="first-letter">Portal talk</namespace>
      <namespace key="104" case="first-letter">Topic</namespace>
      <namespace key="105" case="first-letter">Topic talk</namespace>
      <namespace key="106" case="first-letter">Collection</namespace>
      <namespace key="107" case="first-letter">Collection talk</namespace>
      <namespace key="118" case="first-letter">Draft</namespace>
      <namespace key="119" case="first-letter">Draft talk</namespace>
      <namespace key="710" case="first-letter">TimedText</namespace>
      <namespace key="711" case="first-letter">TimedText talk</namespace>
      <namespace key="828" case="first-letter">Module</namespace>
      <namespace key="829" case="first-letter">Module talk</namespace>
      <namespace key="1728" case="first-letter">Event</namespace>
      <namespace key="1729" case="first-letter">Event talk</namespace>
    </namespaces>
  </siteinfo>
  <page>
    <title>Wikiversity:Colloquium</title>
    <ns>4</ns>
    <id>28</id>
    <revision>
      <id>2809651</id>
      <parentid>2809629</parentid>
      <timestamp>2026-05-16T15:13:37Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Curator inactivity review */ reply ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809651</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="79288" sha1="p0hnc98dhzgbmciz7y0psarxf86k7v2" xml:space="preserve">{{Wikiversity:Colloquium/Header}}
&lt;!-- MESSAGES GO BELOW --&gt;
== New titles for user right nominations ==
&lt;div class=&quot;cd-moveMark&quot;&gt;''Moved from [[Wikiversity talk:Candidates for Custodianship#New titles for user right nominations]].  [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 23:20, 17 April 2026 (UTC)''&lt;/div&gt;

I would like to propose the following retitles should a user be nominated for any of the following user rights:
* Curator: Candidates for Curatorship
* Bureaucrat: Candidates for Bureaucratship
The reason is that many curator (and probably bureaucrat) requests have run solely under {{tq|Candidates for Custodianship}}, but that title might sound misleading (especially in regards to the permission a user is requesting). CheckUser and Oversight (suppressor) are not included above since no user was nominated for these sensitive permissions, probably. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 01:30, 19 March 2026 (UTC)

:And it's not that when someone at the beginning misplaced the request, no one thought to move it and the others copied it. Even today, it would be possible to simply take it all and move it. Otherwise, for me, the more fundamental problem is that there is [[Wikiversity:Curators|no approved policy for curators]] than where the requests are based. Curators then operate in a certain vacuum and if one of them &quot;breaks out of the chain&quot;, the average user doesn't have many transparent tools to deal with it, because there is no policy. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:02, 19 March 2026 (UTC)
::I am not talking about the curator page (policy proposal). [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 19:08, 21 March 2026 (UTC)
: @[[User:Juandev|Juandev]] I'll see if I can do an overhaul of [[Wikiversity:Candidates for Custodianship]], just like I recently did with the Requests for adminship page on English Wikiquote. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 22:17, 18 April 2026 (UTC)
:Yes, great idea - ideally there will be separate &quot;Candidates for ...&quot; pages for each user right group. The most important for now is to separate curator and custodian pages as CN suggests. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:39, 1 May 2026 (UTC)
:So maybe I previously misunderstood. Are you proposing separated pages for nominations (i.e. [[Wikiversity:Candidates for Curatorship]], [[Wikiversity:Candidates for Bureaucratship]], [[Wikiversity:Candidates for Custodianship]])? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:30, 5 May 2026 (UTC)
:: Yes. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:33, 5 May 2026 (UTC)
:::I see, then I am fine with that @[[User:Codename Noreste|Codename Noreste]]. Sorry for misunderstanding. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:35, 9 May 2026 (UTC)

I've split the user rights nomination pages into:
* [[Wikiversity:Candidates for CheckUser]]
* [[Wikiversity:Candidates for Curatorship]]
* [[Wikiversity:Candidates for Custodianship]]
* [[Wikiversity:Candidates for Bureaucratship]]

Please review. There are likely several links to update, text to adjust, categories to manage, short-cuts to fix etc. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:22, 10 May 2026 (UTC)

:Thanks, great job @[[User:Jtneill|Jtneill]]. I am wondering if we need to move archived nominations too, or if we are OK with the actual state. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:08, 10 May 2026 (UTC)
::Yes, I think that would be helpful. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:46, 10 May 2026 (UTC)
:::I can do it @[[User:Jtneill|Jtneill]], I am just looking what system is there. I can see [[Wikiversity:Candidates for Custodianship/Archive of nominations for full custodianship]] which is a good complementary overview to the subpages with full history. The name of the pages is probably stably, but I would consider to create more specific redirect like [[Wikiversity:Candidates for Custodianship/Overview of staff nominations]], which would link to the above one. Then there is a [[Wikiversity:Candidates for Custodianship/Archived]], which are probably incomplete nominations, right? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:37, 11 May 2026 (UTC)
::::Tx @[[User:Juandev|Juandev]]. Yes, this makes sense. And maybe we move:
::::* archived '''curator''' nominations from [[Wikiversity:Candidates for Custodianship/Archive of nominations for full custodianship]] to e.g., [[Wikiversity:Candidates for Curatorship/Archive of nominations]]
::::* archived '''bureaucrat''' nominations from [[Wikiversity:Candidates for Custodianship/Archive of nominations for full custodianship ]] to e.g., [[Wikiversity:Candidates for Bureaucratship/Archive of nominations]]
::::-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:12, 11 May 2026 (UTC)
:::::OK. That sounds good. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:25, 12 May 2026 (UTC)
:An svg icon for [[Wikiversity:Curatorship|curators]] would also be helpful. We have them for other user rights: [[c:Category:Wikiversity user rights icons]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:54, 10 May 2026 (UTC)
::Done: [[Wikiversity:Curators]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 01:44, 11 May 2026 (UTC)

== Technical Request:  Courtesy link.. ==

[[Template_talk:Information#Background_must_have_color_defined_as_well]] [[User:ShakespeareFan00|ShakespeareFan00]] ([[User talk:ShakespeareFan00|discuss]] • [[Special:Contributions/ShakespeareFan00|contribs]]) 11:43, 20 March 2026 (UTC)
: I can't edit the template directly as it need an sysop/interface admin to do it. [[User:ShakespeareFan00|ShakespeareFan00]] ([[User talk:ShakespeareFan00|discuss]] • [[Special:Contributions/ShakespeareFan00|contribs]]) 11:43, 20 March 2026 (UTC)
:: Also if the Template field of - https://en.wikiversity.org/wiki/Special:LintErrors/night-mode-unaware-background-color is examined, there is poential for an admin to clear a substantial proportion of these by implmenting a simmilar fix to the indciated templates (and underlying stylesheets). It would be nice to clear things like Project box and others, as many other templates (and thus pages depend on them.) :)
[[User:ShakespeareFan00|ShakespeareFan00]] ([[User talk:ShakespeareFan00|discuss]] • [[Special:Contributions/ShakespeareFan00|contribs]]) 11:43, 20 March 2026 (UTC)

:I think it would be best to grant you interface admin rights for a short period of time to make these changes. However, I still have doubts about the suitability of this solution, which may cause other problems and no one has explained to me why dark mode has to be implemented this way @[[User:ShakespeareFan00|ShakespeareFan00]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:43, 20 March 2026 (UTC)

: I would have reservations about holding such rights, which is why I was trying to do what I could without needing them. However if it is the only way to get the required changes made, I would suggest asking on Wikipedia to find technical editors, willing to undertake the changes needed. [[User:ShakespeareFan00|ShakespeareFan00]] ([[User talk:ShakespeareFan00|discuss]] • [[Special:Contributions/ShakespeareFan00|contribs]]) 09:32, 21 March 2026 (UTC)

== WikiEducator has closed ==

Some of you may know of a similar project to Wikiversity, called [https://wikieducator.org/Main_Page WikiEducator], championed by [https://oerfoundation.org/about/staff/wayne-mackintosh/ Wayne Mackintosh][https://www.linkedin.com/posts/waynemackintosh_important-notice-about-the-oer-foundation-activity-7405113051688931329-Nhm9/][https://openeducation.nz/killed-not-starved/].

It seems [https://openeducation.nz/terminating-oer-foundation their foundation has closed] and they are no longer operating.

They had done quite a bit of outreach (e.g., in the Pacific and Africa) to get educators using wiki.

The WikiEducator content is still available in MediaWiki - and potentially could be imported to Wikiversity ([https://wikieducator.org/WikiEducator:Copyrights CC-BY-SA] is the default license).

The closing of WikiEducator arguably makes the nurturing of Wikiversity even more important.

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:09, 1 April 2026 (UTC)

:I was never active there. If anyone has an account or is otherwise in contact, we may want to copy relevant information here or even at [[:outreach:]]. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 04:46, 1 April 2026 (UTC)

:: I reached out to [[User:Mackiwg~enwikiversity|Wayne]] in January, and he responded briefly but positively (while travelling).  I wrote to the low-traffic wikieducator mailing list today and got a nice [https://groups.google.com/g/wikieducator/c/r_yIyUw6ZIA reply] from [[user:SteveFoerster|Steve Foerster]] who's interested in helping. If we can figure out a migration path it would be great to adopt at least the main namespace pages here.  
:: A few questions that come to mind: 
:: - would people want to create matching user accounts
:: - are there any namespaces (user/talk?) that should not be moved over
:: We could look at how this was done for the [[m:Wikivoyage/Migration]] wikivoyage migration. &lt;span style=&quot;padding:0 2px 0 2px;background-color:white;color:#bbb;&quot;&gt;&amp;ndash;[[User:Sj|SJ]][[User Talk:Sj|&lt;span style=&quot;color:#ff9900;&quot;&gt;+&lt;/span&gt;]]&lt;/span&gt; 04:27, 1 May 2026 (UTC)
:::That's fantastic, SJ, that you've reached out and that Wayne, Steve, and Jim are receptive—and that you can help! -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:52, 1 May 2026 (UTC)
::::A matching accound makes sense to give credits to the original authors and keep a clean chain of versions. The initial commit into wikiversity could have a &quot;marker with timestamp&quot; similar to signature with a reference where the content's source or a Web archive. This would allow authors to continue there work on wikiversity if they wish. [[User:Bert Niehaus|Bert Niehaus]] ([[User talk:Bert Niehaus|discuss]] • [[Special:Contributions/Bert Niehaus|contribs]]) 06:30, 15 May 2026 (UTC)

== Wikinews is ending ==

Apparently mainly due to low editorial activity, low public interest, but also failure to achieve the goals from the proposal for the creation of the project, the Wikinews project is ending after years of discussions ([[Meta:Proposal for Closing Wikinews|some reading]]).

And I would be interested to see how Wikiversity is doing in the monitored metrics. We probably have more editors than Wikinews had, but what about consumers and achieving the goals? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 19:14, 1 April 2026 (UTC)

:Wikiversity's biggest issue in recent times was the hosting of low-quality, trash content. Thankfully we've done a great job in removing pseudoscience and other embarrassingly trash content (Wikidebates, for example), but the biggest concern moving forward is proper maintenance IMO. I've caught several pseudoscience pages being created within the last few months that could easily have flown under the radar (ex, [[The Kelemen Dilemma: Causal Collapse and Axiomatic Instability]]), so I'd urge our custodians/curators to be on the lookout for this type of content. Usually an AI-overview can point this type of content out relatively well.
:In terms of visibility, I believe Wikiversity is a high-traffic project. I remember my [[Mathematical Properties]] showing up on the first page of Google when searching up &quot;math properties&quot; for the longest time (and is still showing up in the first page 'till this day!). Besides, Wikinews hosted a lot of short-term content (the nature of news articles), while Wikiversity hosts content that can still be useful a decade later (ex, [[A Reader's Guide to Annotation]]). 
:I think we are on a better path than we were a few months ago, and I do want to thank everyone here who has been helping out with maintaining our website! —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 20:48, 1 April 2026 (UTC)
:For what it's worth, the group that did that study has since disbanded, so no one is monitoring the other sister projects in the same way. Additionally, Wikinews had some catastrophic server issues due to the maintenance of [[:m:Extension:DynamicPageList]] which don't apply here. Your questions are still worth addressing, but I just wanted to cut off any concern at the pass about Wikiversity being in the same precarious situation. Wikiversity is definitely the biggest &quot;lagging behind&quot; or &quot;failure&quot; project now that Wikinews is being shuttered, but I don't see any near- or medium-term pathway to closing Wikiversity. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 00:46, 2 April 2026 (UTC)

:[[w:en:Wikipedia:Wikipedia Signpost/2026-03-31/News and notes|Entirety of Wikinews to be shut down]] (Wikipedia Signpost) -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:03, 11 April 2026 (UTC)

== Action Required: Update templates/modules for electoral maps (Migrating from P1846 to P14226) ==

Hello everyone,

This is a notice regarding an ongoing data migration on Wikidata that may affect your election-related templates and Lua modules (such as &lt;code&gt;Module:Itemgroup/list&lt;/code&gt;).

'''The Change:'''&lt;br /&gt;
Currently, many templates pull electoral maps from Wikidata using the property [[:d:Property:P1846|P1846]], combined with the qualifier [[:d:Property:P180|P180]]: [[:d:Q19571328|Q19571328]]. 

We are migrating this data (across roughly 4,000 items) to a newly created, dedicated property: '''[[:d:Property:P14226|P14226]]'''.

'''What You Need To Do:'''&lt;br /&gt;
To ensure your templates and infoboxes do not break or lose their maps, please update your local code to fetch data from [[:d:Property:P14226|P14226]] instead of the old [[:d:Property:P1846|P1846]] + [[:d:Property:P180|P180]] structure. A [[m:Wikidata/Property Migration: P1846 to P14226/List|list of pages]] was generated using Wikimedia Global Search.

'''Deadline:'''&lt;br /&gt;
We are temporarily retaining the old data on [[:d:Property:P1846|P1846]] to allow for a smooth transition. However, to complete the data cleanup on Wikidata, the old [[:d:Property:P1846|P1846]] statements will be removed after '''May 1, 2026'''. Please update your modules and templates before this date to prevent any disruption to your wiki's election articles.

Let us know if you have any questions or need assistance with the query logic. Thank you for your help! [[User:ZI Jony|ZI Jony]] using [[User:MediaWiki message delivery|MediaWiki message delivery]] ([[User talk:MediaWiki message delivery|discuss]] • [[Special:Contributions/MediaWiki message delivery|contribs]]) 17:11, 3 April 2026 (UTC)
&lt;!-- Message sent by User:ZI Jony@metawiki using the list at https://meta.wikimedia.org/w/index.php?title=Distribution_list/Non-Technical_Village_Pumps_distribution_list&amp;oldid=29941252 --&gt;
:I didnt find such properties, so we are probably fine. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:00, 12 April 2026 (UTC)
:: +1 (agreed). [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 22:19, 12 April 2026 (UTC)

== Enable the abuse filter block action? ==

In light of [[Special:AbuseLog/80178]] (coupon spam), I would like to propose enabling the block action for the abuse filter. Only custodians will be able to enable and disable that action on an abuse filter, and it is useful to block ongoing vandalism. Thoughts? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 19:12, 13 April 2026 (UTC)

:Seems like a good idea, almost all of the users which create such pages are spambots so this shouldn’t be a problem. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 23:41, 13 April 2026 (UTC)
:Can you explain some more (I am new to abuse filters)? It looks like the attempted edit was prevented? Which abuse filter?
:Note on your suggestion, have also reactivated Antispam Filter 12 - see [[WV:RCA]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:45, 15 April 2026 (UTC)
:: I am proposing that we activate the abuse filter block action, which if a user triggers an abuse filter, it would actually block the user in question - the same mechanism that a custodian would use to block users. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:11, 15 April 2026 (UTC)
:::OK, thankyou, that makes sense. And, reviewing the abuse filter 12 log, it would be helpful because it would prevent the need for manual blocking. But I don't see a setting for autoblocking? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 23:14, 15 April 2026 (UTC)
:::: I think it probably adds an autoblock. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 00:43, 16 April 2026 (UTC)
: [[User:Jtneill|Jtneill]] and [[User:PieWriter|PieWriter]], given that a little bit more than a week has passed and there is minimal consensus to activate the abuse filter block action, I filed [[phab:T424053]]. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:05, 21 April 2026 (UTC)
::Thank-you for doing this. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 08:03, 24 April 2026 (UTC)

== Advice needed: A Neurodiversity-inspired Idea/observation ==

If I want the greatest participation of others to &quot;provide constructive criticism to my idea&quot; or to &quot;shoot down my idea&quot; or &quot;idea&quot;.

What I've called it so far is &quot;The Neurodiversity-inspired Idea&quot;. At other times I used more sensationalist wording but here on Wikiversity I don't dare do that. I actually woke up with thinking about putting this into my userspace draft: &quot;Personal Observations Made By Meeting Autistic and Non-Autistic Adults&quot;.

My ultimate goal is to stop blathering about my &quot;idea&quot; to friend and family without feeling my &quot;methodology&quot; is going into any progressive direction whatsoever. My latest encounter was somewhat constructive though. A friend of a friend who worked with people presenting ideas in attempting to getting grants. I don't want a grant. I just want to figure out how I can express my &quot;idea&quot; in a way so that I can more clearly figure out what flaws it got.

At the same time I tend to overthink. If anyone thinks etherpad might be a good place and considering Wikimedia already got an etherpad at https://etherpad.wikimedia.org/ if anyone feels like they know me better in the future feel free to suggest a &quot;session&quot; on etherpad.

'''If I don't receive a reply to this in 1 week's time I will begin to explore this &quot;idea&quot; into my userspace''' unless you replied and refrained me from doing so, of course. Then maybe after &quot;developing it there&quot; I might reference it to you another future time here in the Colloquium, with my &quot;idea&quot; still in my userspace draft. This &quot;idea&quot; is sort of a burden, I'm happy I've made the choice to get rid of it and hopefully move on with my life, unless there is something to this &quot;idea&quot;. 

My failure is probably evident: I feel I haven't told you anything. Same happened to when I talked to friends and family. In danger of overthinking it further I'll publish this right now. I need to &quot;keep it together&quot; [[User:ThinkingScience|ThinkingScience]] ([[User talk:ThinkingScience|discuss]] • [[Special:Contributions/ThinkingScience|contribs]]) 10:36, 16 April 2026 (UTC)

:Good on you putting it out there ... and hitting publish :). I'd say go for it (no need to wait), give birth to your idea and share about it here and elsewhere. Let it take shape and see where it might go. In many ways, this is exactly what an open collaborative learning community should be doing. Others might not know well how to respond, so perhaps consider creating some questions to accompany the idea. Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:21, 16 April 2026 (UTC)
::Thank you for encouraging me in developing the idea.
::I have created a &quot;questions&quot; section in the draft which is visible in the table of contents now. My brain was &quot;frozen&quot; today metaphorically speaking in that I felt I had like a &quot;writer's block&quot; so the draft has more &quot;AI/LLM&quot; content than before. I used the LLM for generating questions. The answers are so far human-only.
::I've also created a subsection where I could add the prompts that made the LLM generate the questions. That could help people make better prompts perhaps. I've described what it is about inside of it and there are some chaotically written notes.
::[[Draft:The_Neurodiversity-inspired_Idea#Questions_that_might_encourage_the_development_of_this_idea_and_its_methodology]]
::My draft is missing stuff. Any questions that you contribute to my draft will probably help me and if I don't understand the questions I'll probably notify you and also at the same time &quot;feed them&quot; to an LLM and ask in my input like &quot;explain in simple words what this question means, what is it searching for?&quot; etc. while I wait for an answer. If you have any more feedback please give it to me here or on the Draft page, its talk page or my user talk page. Thank you for helping me! [[User:ThinkingScience|ThinkingScience]] ([[User talk:ThinkingScience|discuss]] • [[Special:Contributions/ThinkingScience|contribs]]) 21:20, 18 April 2026 (UTC)
::Today I woke up with not only thinking about supplying questions along with the &quot;idea&quot; but also answers. ie. Is it possible to &quot;test&quot; this idea? Is it possible to create one or multiple hypotheses based on this &quot;idea&quot;?(etc.) I've thought about this before in this &quot;idea&quot; but since I'm beginning to add to Wikiversity what was previously 'locked in my mind' it's also easier for me to see what I've done so far. Thank you for this comment! [[User:ThinkingScience|ThinkingScience]] ([[User talk:ThinkingScience|discuss]] • [[Special:Contributions/ThinkingScience|contribs]]) 09:11, 23 April 2026 (UTC)
:May I think that you should not add deadlines ; being read, and rising interest for collaboration, or even simply for exchange of thoughts, such an effective meeting event loads a huge bunch of unprobability, which time can help to… somehow diminish. Maybe, I would advice you having a central place for developping your ideas, your needs, your advances, maybe a page in your own user zone, and from time to time, depending your feeling, it could be every trimester or so, or more frequently, you could write a short account of progress (or even of no progress), or a call for participation, in such a place as this present one ; I think that will increase much exposure of your projet. Maybe also, if you can find a project name, not necessarily very meaningfull by itseilf (at least it will gain signification with time, as your project develops), that will serve as a kind-of hook, and make your announcement titles more visible. Best regards (and my excuses for my poor command of English, which seems to be unplease an anti-abuse filter, &quot;Questionable Language (profanity)&quot;, which I don't understand…). My few cents. --  [[User:Eric.LEWIN|Eric.LEWIN]] ([[User talk:Eric.LEWIN|discussion]] • [[Special:Contributions/Eric.LEWIN|contributions]]) 10:06, 17 April 2026 (UTC)
::Sorry about the false positive on the profanity filter - I've fixed it. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:26, 17 April 2026 (UTC)
:::&quot;May I think that you should not add deadlines ; being read, and rising interest for collaboration, or even simply for exchange of thoughts, such an effective meeting event loads a huge bunch of unprobability, which time can help to… somehow diminish.&quot;
::Thank you Eric for this comment. Trust in time is how I interpret it. I should not feel like I need to be in a hurry. I'll try to give this time. Thank you!
:::&quot;Maybe, I would advice you having a central place for developping your ideas, your needs, your advances, maybe a page in your own user zone, and from time to time, depending your feeling, it could be every trimester or so, or more frequently, you could write a short account of progress (or even of no progress), or a call for participation, in such a place as this present one ; I think that will increase much exposure of your projet.&quot;
::A central place for developing or making &quot;project notes&quot; regarding the Neurodiversity idea on my userspace, I might need that, like a diary or &quot;project notes&quot; of the Neurodiversity idea similar to my course notes regarding my experience with Coursera.
::Any actions I take are going to be related to my Userspace from now on but I'll also update the draft when necessary. Now in the beginning I might be working daily to once every 3 days on both the draft and the daily notes I plan to make.
:::&quot;Maybe also, if you can find a project name, not necessarily very meaningfull by itseilf (at least it will gain signification with time, as your project develops), that will serve as a kind-of hook, and make your announcement titles more visible.&quot;
::Thank you for the advice. I was brainstorming yesterday about it. I concluded that since I've not yet developed a methodology that adheres to &quot;Do no harm&quot; and this is my first time working my &quot;idea&quot; into a way that is compatible with how projects develop on English Wikiversity this is new to me. My methodology isn't developed and therefore trying to get attention to my project through a name can wait. Yesterday I figured out a silly title that has nothing to do with the project: &quot;Planetary Awareness Potato Cabbage Rolls&quot; or something like that. Google output read that no such thing exists so I wanted it mainly to be unique. I don't want to raise attention that I'm unsure whether I'll actually be capable of developing a methodology for but project notes is my best bet so far in tracking my progress. Every day I think about this &quot;idea&quot; but I need to improve the important parts.
:::&quot;Best regards (and my excuses for my poor command of English, which seems to be unplease an anti-abuse filter, &quot;Questionable Language (profanity)&quot;, which I don't understand…). My few cents.&quot;
::You added great points and I felt that I was helped by you! I encourage you to post again and I can understand that interacting with any kind of automated filter can be discouraging and can be for me too! Thank you for giving me feedback! [[User:ThinkingScience|ThinkingScience]] ([[User talk:ThinkingScience|discuss]] • [[Special:Contributions/ThinkingScience|contribs]]) 16:01, 18 April 2026 (UTC)

== Add some user rights to the curator user group? ==

By default, only custodians have the ability to mark new pages as patrolled (&lt;code&gt;patrol&lt;/code&gt;) and have their own page creations automatically marked as patrolled (&lt;code&gt;autopatrol&lt;/code&gt;). I am proposing both of the following:
* Curators can mark new pages as patrolled, helping on reducing the backlog of new, unpatrolled pages.
* New pages made by curators will be automatically marked as patrolled by the MediaWiki software.
Before we implement this, I would suggest implementing a proposed guideline for marking new pages as patrolled for curators and custodians.

Thoughts? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 16:32, 17 April 2026 (UTC)

:Agree, &lt;s&gt;also can we also allow curators to undelete pages since they already have the rights to delete them?&lt;/s&gt; [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 02:54, 18 April 2026 (UTC)
::I think the requirement that undelete NOT be included came from above (meta / stewards / central office). Having access to the undelete page gives access to information that is restricted by their policies to admins (custodians and bureaucrats). -- [[User:Dave Braunschweig|Dave Braunschweig]] ([[User talk:Dave Braunschweig|discuss]] • [[Special:Contributions/Dave Braunschweig|contribs]]) 20:12, 18 April 2026 (UTC)
::: [[User:PieWriter|PieWriter]], unless if requests for curator and custodian should be RfA-like processes (that is, including voting and comments), then I have to agree with Dave above. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 22:03, 18 April 2026 (UTC)
::::Oh, I didn’t realise that. Withdrawing my comment.. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:08, 19 April 2026 (UTC)
:{{support}} Seems reasonable and would reduce overhead. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 14:35, 18 April 2026 (UTC)
:'''Agree''', implement it also to [[Wikiversity:Curators]] proposal please. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:11, 18 April 2026 (UTC)
: I went ahead and filed [[phab:T424445]]. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:39, 26 April 2026 (UTC)

== [[Wikiversity:Curators|Curators and curators policy]] ==
{{archive top|There is strong consensus, so [[Wikiversity:Curators]] is now a policy. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:15, 9 May 2026 (UTC)}}
How does it come, that Wikiversity has curators, but Curators policy is still being proposed? How do the curators exists and act if the policy about them havent been approved yet? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:33, 16 October 2025 (UTC)

:It looks as if it is not just curators. The policy on Bureaucratship is still being proposed as well. See [[Wikiversity:Bureaucratship]]. —[[User:RailwayEnthusiast2025|&lt;span style=&quot;font-family:Verdana; color:#008000; text-shadow:gray 0.2em 0.2em 0.4em;&quot;&gt;RailwayEnthusiast2025&lt;/span&gt;]] &lt;sup&gt;[[User talk:RailwayEnthusiast2025|&lt;span style=&quot;color:#59a53f&quot;&gt;''talk with me!''&lt;/span&gt;]]&lt;/sup&gt; 18:33, 27 October 2025 (UTC)

:I think its just the nature of a small WMF sister project in that there are lots of drafts, gaps, and potential improvements. In this case, these community would need to vote on those proposed Wikiversity staff policies if we think they're ready. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:08, 3 December 2025 (UTC)
:What? I thought you were getting it approved, Juandev... :) [[User:I&amp;#39;m Mr. Chris|I&amp;#39;m Mr. Chris]] ([[User talk:I&amp;#39;m Mr. Chris|discuss]] • [[Special:Contributions/I&amp;#39;m Mr. Chris|contribs]]) 14:20, 12 February 2026 (UTC)
::Yeah I think this one is important too and we need to aprove it too @[[User:I'm Mr. Chris|I'm Mr. Chris]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 15:56, 12 February 2026 (UTC)
:::I thinks its ready to made into a policy, it seems to be complete and informative about what the rights does and how to get it. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 03:08, 15 February 2026 (UTC)
::::Agree -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:00, 27 March 2026 (UTC)

Let's make this the official discussion about adopting the [[Wikiversity:Curators|curators policy]] policy. Your comments are invited and welcome. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 08:40, 24 April 2026 (UTC)
: There were two similar Colloquium threads in separate places about the proposed curators policy. So I've moved them to be adjacent. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 12:42, 1 May 2026 (UTC)
{{archive bottom}}

== Wikiversity:Curators to become a policy ==
{{archive top|There is strong consensus, so [[Wikiversity:Curators]] is now a policy. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:16, 9 May 2026 (UTC)}}
I've looked at the discussions about the Curators policy, I've looked at the practices, and it seems to me that there is no dispute about the wording of the policy, and what's more, the community has been using this proposal as if it were an offical policy for several years. Therefore, I propose that [[Wikiversity:Curators]] become a policy. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:35, 18 April 2026 (UTC)

:{{support}} —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:54, 18 April 2026 (UTC)
:{{support}} —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 20:21, 18 April 2026 (UTC)
: {{support|Yes, please}}. Especially after when I and PieWriter proposed above, I agree. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:27, 24 April 2026 (UTC)
:: @[[User:Juandev|Juandev]]; as of now, curators now have the user rights &lt;code&gt;autopatrol&lt;/code&gt; and &lt;code&gt;patrol&lt;/code&gt;. Perhaps we should also include that in [[Wikiversity:Custodianship]]? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 12:07, 30 April 2026 (UTC)
:::You meant [[Wikiversity:Curators]] @[[User:Codename Noreste|Codename Noreste]]? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:15, 5 May 2026 (UTC)
:::: I agree that we must develop what rules curators should follow when marking new pages as patrolled; the same can be added for custodians since they can also mark new pages as patrolled. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:37, 5 May 2026 (UTC)
:::::I see, well I think you can just add this to the policy. It is not major change and it probably reflects actual practice or actual technical possibilities for those flags. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:20, 7 May 2026 (UTC)
:{{support}} -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 12:42, 1 May 2026 (UTC)
:{{Support}} per nom. [[User:PhilDaBirdMan|PhilDaBirdMan]] ([[User talk:PhilDaBirdMan|discuss]] • [[Special:Contributions/PhilDaBirdMan|contribs]]) 13:32, 1 May 2026 (UTC)
{{Archive bottom}}

== Inactive curators ==

Hello, even though [[Wikiversity:Curators]] is not a policy yet, there are curators listed here that have been inactive for two years or more:
* {{user|Cody naccarato}} (last edit on 13 Dec 2022, last logged action on 10 Dec 2022)
* {{user|Praxidicae}} (last edit on 10 Sep 2022, last logged action on 12 Sep 2022)
[[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 21:14, 19 April 2026 (UTC)

:Yup, I would remove the rights. To get the rights back if theyll come back should not be a big deal. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:08, 24 April 2026 (UTC)
:: When they don't reply by May 19, feel free (or any custodian) to do so. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 00:28, 25 April 2026 (UTC)

== Is anyone interested in Neurodiversity? ==

Is anyone interested in Neurodiversity? Is there anyone here who is interested for Neurodiversity to be &quot;something more&quot; than it already is? Does anyone here consider Neurodiversity one of the &quot;harder topics&quot; to work on or discuss? Does anyone here have an opinion about the [[Neurodiversity Movement]]? So these questions don't appear like &quot;out of a vacuum&quot; I can tell you a bit about my background:

Many years ago I got a psychiatric diagnosis &quot;Asperger's&quot;. After I stepped out of the office and my Äsperger's was 'concluded', I stepped out into the street and thought my first negative thought(but the positive thought followed after). The thought was about concentration camps in the second world war and that the world seemed to be going into the direction of &quot;labeling others&quot;. I was unsure whether this was &quot;real science&quot; and sort of &quot;challenged myself&quot; to make up my own mind after meeting people that had been given this diagnosis. The more adults with this diagnosis I met the more I started seeing &quot;patterns&quot;.

Was it a coincidence that the first person with Asperger's I met reminded me about my father later after I had plenty of times of experience with interacting with him? None of the people I interacted with online through IRC text chat...I felt I got any clue about how &quot;their brains work&quot;. Only when I met one person from the Asperger's chat community in person we both realized that whatever we experienced was akin to the &quot;chaos theory&quot;. He told me about &quot;chaos theory&quot; while I didn't know even what that term meant but I guess I 'read between the lines'. My question that I linger on still today is &quot;did he understand about me what I think I understood about him?&quot;? That our brains had the same configuration? Most autistic adults who meet other autistic adults usually get disappointed. They think the diagnosis will help them meet somebody like themselves and then they realize the great diversity in the autistic spectrum created by Psychiatry.

I later stopped interacting with autistic communities that much, I felt that it did not benefit me. Also Neurodiversity's &quot;neurotypes&quot; interested me for a while until I realized I had &quot;misunderstood everything&quot; about them and how they are used in the Neurodiversity Movement or &quot;Neurodiversity community&quot; if that even can precisely be defined? I doubt it but if you want to contribute to the [[Neurodiversity Movement]]. My previous attempts failed as I got more and more confused. I think a community project needs a community. With a lack of that I don't think it is worth my time. If any of you would like to work on that project let me know on my talk page.

So I was kinda lost and was talking to my friend and psychologist and I realized if I never talk about my idea to anyone in a &quot;comprehensive way&quot; or show that it matters to me nothing is going to ever happen. So I started talking about my &quot;idea&quot; more. Nobody could understand the &quot;idea&quot; because I had not developed my skills regarding where to start...although the process had already started &quot;automatically&quot; and that's why I often think of &quot;well my brain sort of activated me&quot;. I don't feel like I did have a plan and this idea happened. It happened &quot;by itself&quot;. My brain reacted to what I was seeing in a video or stream.

I value interaction highly in this idea. I think it would be helpful to make a community of people who are not paranoid about stuff that can express itself like &quot;don't analyze me!&quot;, &quot;don't compare me to anyone!&quot;. 

On the contrary, more often than not those adults who were diagnosed were actually openly comparing themselves with each other and I think that is healthy in a &quot;science&quot; way if done the &quot;right way&quot; which probably means &quot;Do no harm&quot;.

I found video material is important but I'm very unsure if uploading own video material to Wikimedia Commons would constitute a &quot;reasonable&quot; use of the resources there. Maybe somebody here needs to ask more questions to me that I should answer before that happens. I also know the '''be bold''' so I could just do what I think might be ok. Though I work better in a group as long as I know what &quot;group configurations&quot; help me. This is in a non-profit way. Since the state supported me this might be a way I am trying to &quot;give back&quot; to the state and &quot;the world&quot;. May seem overly ambitious and crazy but this thing gives me energy. It gives me hope when trying to develop this idea. [[User:ThinkingScience|ThinkingScience]] ([[User talk:ThinkingScience|discuss]] • [[Special:Contributions/ThinkingScience|contribs]]) 10:47, 23 April 2026 (UTC)

:Thanks for sharing. There is plenty of room for neurodiversity community learning. However, the challenge I think is that the intersection of those interested in (a) ND, and (b) English Wikiversity might be very small (e.g., 1!) at this point in time.
:But don't give up hope. For example, Wikipedia has many more ND-interested editors; maybe consider reaching out to see who might be interested:
:[[w:Category:Wikipedians interested in neurodiversity]]
:You could also start an equivalent category here:
:[[:Category:Wikiversitarians interested in neurodiversity]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:46, 6 May 2026 (UTC)

== Request for comment (global AI policy) ==

&lt;bdi lang=&quot;en&quot; dir=&quot;ltr&quot; class=&quot;mw-content-ltr&quot;&gt;A [[:m:Requests for comment/Artificial intelligence policy|request for comment]] is currently being held to decide on a global AI policy. {{int:Feedback-thanks-title}} [[User:MediaWiki message delivery|MediaWiki message delivery]] ([[User talk:MediaWiki message delivery|discuss]] • [[Special:Contributions/MediaWiki message delivery|contribs]]) 00:58, 26 April 2026 (UTC)&lt;/bdi&gt;
&lt;!-- Message sent by User:Codename Noreste@metawiki using the list at https://meta.wikimedia.org/w/index.php?title=Distribution_list/Global_message_delivery&amp;oldid=30424282 --&gt;

== Language learning  ==

toki! I am trying to add or see what the toki pona language learning stuff on here is but I don't see anything that is language learning for anything. [[User:Jan Imon|Jan Imon]] ([[User talk:Jan Imon|discuss]] • [[Special:Contributions/Jan Imon|contribs]]) 23:13, 2 May 2026 (UTC) —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 17:29, 3 May 2026 (UTC)

:We have language materials ([[:Category:Languages]], [[World Languages]], [[Portal:Foreign Language Learning]], [[Portal:Multilingual Studies]]). They are not as developed as I think we would all like and there's not any coverage of Toki Pona, but in principle, we could and would like that. You can also see [[:b:Subject:Languages]] at our sister project Wikibooks. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 17:33, 3 May 2026 (UTC)

== Timeline format? ==

I’ve been working on the World War II articles, including the [[World War II/Timeline|timeline]], and is there a specific timeline format that should be used? Right now it’s just a table, and there’s no separation between different periods/phases of the war.

I don’t want to use [[mw:Extension:EasyTimeline]] because this will be displaying dates and not time periods. [[User:PhilDaBirdMan|PhilDaBirdMan]] ([[User talk:PhilDaBirdMan|discuss]] • [[Special:Contributions/PhilDaBirdMan|contribs]]) 01:35, 4 May 2026 (UTC)

:I dont think we have a policy or guideline, how to format a timeline. But you may try to browes wikiversity by Google if someone was dealing with this in the past somewhow @[[User:PhilDaBirdMan|PhilDaBirdMan]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:23, 5 May 2026 (UTC)
::+1 - there's no specific guideline on how to format a timeline, it's really up to you. In my opinion I think the timeline is good. I'd personally bold the dates just to make it easier to separate it from the event description, but that's my personal 2 cents. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 14:18, 5 May 2026 (UTC)
:::I’ll probably remove links to the dates/years, they’re just Wikipedia pages that shouldn’t be over linked to. [[User:PhilDaBirdMan|PhilDaBirdMan]] ([[User talk:PhilDaBirdMan|discuss]] • [[Special:Contributions/PhilDaBirdMan|contribs]]) 00:39, 6 May 2026 (UTC)

== Interface administrator for Codename Noreste ==
{{Archive top|After running for a week, there is clear consensus for [[User:Codename Noreste]] to have Interface admin rights for 120 days; implemented until 10 September, 2026 -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 22:36, 12 May 2026 (UTC)}}

Hello, everyone. I am requesting interface administrator access on this wiki.

The main reasoning is that I would benefit from having the user right &lt;code&gt;editinterface&lt;/code&gt;, which would allow me to make dark mode changes to pages in the MediaWiki namespace, add &lt;code&gt;&lt;nowiki&gt;&lt;div class=&quot;mw-parser-output&quot;&gt;&lt;/nowiki&gt;&lt;/code&gt; to some interface pages using templates, handle interface-protected edit requests, and similar stuff. Additionally, I have some knowledge of CSS, and I would like to assist with modifying CSS pages whenever necessary, such as moving MediaWiki common.css code to TemplateStyles CSS pages.

I am requesting the maximum time that is allowed per the [[Wikiversity:Interface administrators|policy]], and I have 2FA enabled on my account. Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 00:55, 6 May 2026 (UTC)

*{{support}} Globally trusted user. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 01:07, 6 May 2026 (UTC)
*{{support}} Trusted and knowledgeable. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:35, 6 May 2026 (UTC)
*{{support}} WV would benefit from this. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 08:32, 6 May 2026 (UTC)
*{{support}} --[[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:13, 7 May 2026 (UTC)

:{{Comment}} Could @[[User:Codename Noreste|Codename Noreste]] delete [[MediaWiki:Gadget-WikiSign.js]], which was requested to be deleted @[[User:Koavf|Justin]], @[[User:Jtneill|Jtneill]], @[[User:Atcovi|Atcovi]]? I dont think we need it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:40, 9 May 2026 (UTC)
::Yes - clearly no longer used -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:18, 9 May 2026 (UTC)
::: I can't delete it because I don't have the required permissions to do so.
::: On a side note, if this project has a need for permanent interface administrators, I would suggest that we have a minimum of two IAs, similar to how there must be two CUs and/or suppressors (or none). Maybe Koavf can be a good candidate if I am elected for permanent interface adminship, and I believe that permission shouldn't be removed from someone's own account. Instead, a bureaucrat should do it. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:20, 9 May 2026 (UTC)
::::I am willing and happy to do it, unfortunately, we do not have an appetite for indef IAs and just had a discussion that resulted in a [https://en.wikiversity.org/w/index.php?title=Wikiversity:Interface_administrators&amp;diff=prev&amp;oldid=2807543 consensus that we can have IAs that have the user rights for 14 to 120 days]. So once you have the rights, please make sure to gopher it. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 17:54, 9 May 2026 (UTC)
:::::@[[User:Koavf|Koavf]] give it time. Look at me, I was in favor of shorter time, now I am looking back to times, when custodians could do it without the need of extra flag. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:31, 9 May 2026 (UTC)
::::::Here's hoping. I think it would reduce administrative overhead, but that's just me and I'm not a bureaucrat here. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:33, 9 May 2026 (UTC)
::::Complicated. Where are the times, admins could do everything! [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:27, 9 May 2026 (UTC)
{{archive bottom}}

== [[Wikiversity:Bureaucratship]] to become a policy ==

Following the recent approval of [[Wikiversity:Curators]] as a policy, I think [[Wikiversity:Bureaucratship]] may also be ready for policy status.

Please share your views about whether bureaucratship is ready to become a policy, or whether further revisions are needed.

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 13:58, 9 May 2026 (UTC)
: I added a logo about that user group, but other than that, it looks good to me. {{support}}. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:38, 9 May 2026 (UTC)
:I think that the consensus on this policy is proven by years of using it without further changes. But I I have to say weather I agree with this to become a policy, than of course {{support}}. It works and there were no major issues with it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:45, 9 May 2026 (UTC)
:{{support}} no issues. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 14:51, 10 May 2026 (UTC)
:{{support}} [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 12:37, 11 May 2026 (UTC)
:{{support}} ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 06:51, 12 May 2026 (UTC)

== Reminder about custodian-related pages ==

I would like to remind the community about what the following custodian pages are:
* [[Wikiversity:Request custodian action]] is for requesting actions to be done by custodians, and
* [[Wikiversity:Notices for custodians]] is for notices of interest to custodians, like an administrator's noticeboard
Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:12, 12 May 2026 (UTC)

:Thanks - I needed this reminder :) -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 22:21, 12 May 2026 (UTC)

== [[MediaWiki:Protectedpagetext#Protected edit request on 11 December 2025]] ==

I posted an edit request there 5 months ago, so I’ll be taking it to this page. [[Special:Contributions/&amp;#126;2026-28640-56|&amp;#126;2026-28640-56]] ([[User talk:&amp;#126;2026-28640-56|talk]]) 23:33, 12 May 2026 (UTC)

:What exactly is the problem? I don't understand what needs to change and why. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 23:35, 12 May 2026 (UTC)
: Pinging @[[User:Atcovi|Atcovi]], @[[User:Jtneill|Jtneill]] and @[[User:Juandev|Juandev]] for further input. Someone is requesting a modification to [[MediaWiki:Protectedpagetext]] to use {{tlx|Protected page text}}, but we might need to discuss whether to use the template. In the meantime, I'll start a sandbox version of the protected page text template. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 23:19, 14 May 2026 (UTC)
::Sounds good -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:13, 15 May 2026 (UTC)

== Create a pseudo-bot user group? ==

I would like to propose adding a new user group to Wikiversity: Pseudo-bot (&lt;code&gt;flood&lt;/code&gt;). This will allow users to perform repetitive actions without flushing the recent changes feed (with only the &lt;code&gt;bot&lt;/code&gt; user right). However, I would suggest that for the pseudo-bot user group:
* It can be granted and revoked by custodians. However, can curators add and remove pseudo-bot from their own accounts (and not others)?
* Users can remove themselves from it.
* A guideline might be necessary about the information and usage of it.
Thoughts? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 03:31, 14 May 2026 (UTC)

:This sounds good. Which other wiki could we model this user group on? e.g., [[b:Wikibooks:Pseudo-bots]]? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:19, 15 May 2026 (UTC)
::@[[User:Jtneill|Jtneill]] Wikiquote has a similar group: [[:wikiquote:Special:ListGroupRights]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 04:25, 15 May 2026 (UTC)

== Coming over From wikinews ==
Any chance someone could help me if you are allowed to write news articles here since wikinews is going read only mode soon, thank you! [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 22:43, 1 May 2026 (UTC)

:The scope of Wikiversity is very broad and is basically about more-or-less any learning material. We have made it a point to not have duplicative content of other WMF projects, but since Wikinews is being shuttered, I personally am fine with writing news articles here. One thing that is not controversial at all is a learning resource &lt;em&gt;about&lt;/em&gt; how to write news: that could be hugely useful here and could involve the process of writing news stories to learn and to share back and forth with an editor or fact-checker. In fact, I'd support an entire namespace dedicated to keeping the notion of Wikinews alive here. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 23:38, 1 May 2026 (UTC)
::Thank you so much! How do I start? Cheers! @[[User:Koavf|Koavf]] [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 01:07, 2 May 2026 (UTC)
:::I think it's premature to start just making news articles en masse, but if you want to start discussing the topic of citizen journalism, you can do that now. [[:Category:Journalism]] already has some material, so you can start by seeing what we already have, how you can refine that, etc. You can definitely have learning resources with collaborators who want to learn about journalism ASAP. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 01:24, 2 May 2026 (UTC)
::::thanks. [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 01:38, 2 May 2026 (UTC)
::::If I could try and start one News Article could you please tell me how to go about it? Like what style of writing like Wikinews or something else? Thank you Justin! @[[User:Koavf|Koavf]] [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 01:48, 2 May 2026 (UTC)
:::::Honestly, there are very few policies and guidelines here. I think the best way to write a news story would be in a manner that is obvious and instructive. So, for instance, it's common to use the &quot;pyramid style&quot; when you're writing news, so if you were to write a story that makes it very clear that you are using that approach, that would be helpful. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 02:08, 2 May 2026 (UTC)
::::::cool thanks. [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 02:13, 2 May 2026 (UTC)
::::::im ready to write @[[User:Koavf|Koavf]] [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 21:30, 13 May 2026 (UTC)
:::::::I think we should get more local consensus for a big project like including the entirety of the scope of Wikinews here. Again, I support it personally. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 21:55, 13 May 2026 (UTC)
::::::::ok lets begin. [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 22:15, 13 May 2026 (UTC)

== Proposal to rehost Wikinews here ==

As many of you know, and mentioned here at the Colloquium, our sister project Wikinews recently closed, with all 31 active editions made read-only. [[User:BigKrow]] has asked about the prospect of writing news stories here and I suggested that since we already have [[School:Journalism]] and some resources related to the [[:Category:Journalism|broader topic of journalism]]. I would like to propose that we have continued and indefinite space for {{w|citizen journalism}} by essentially repurposing Wikinews into a sub-project here. The only special infrastructure that Wikinews required was [[:mw:Extension:DynamicPageList]], which was deactivated and caused issues due to a lack of maintenance.

I will add this proposal to the site banner, but I recognize that that may be a conflict of interest, so if anyone requests that I remove it, I will. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:30, 14 May 2026 (UTC)
:I would like to see this conversation go for at least 30 days to establish a consensus. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:35, 14 May 2026 (UTC)

===Votes===
*{{support}} as proposer (with BK's inspiration). I think that an ongoing experiment in citizen journalism is a fit and appropriate use of this site. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:35, 14 May 2026 (UTC)
*{{support}}, hope to seeing ideas about this, and thank you @[[User:Koavf|Koavf]] [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 11:08, 14 May 2026 (UTC)
*{{support}} Other than perhaps inflating the total number of pages reported, I see the idea of &quot;practicing journalism&quot; a worthy and relevant activity within the domain of Wikiversity. [[User:IanVG|IanVG]] ([[User talk:IanVG|discuss]] • [[Special:Contributions/IanVG|contribs]]) 21:41, 14 May 2026 (UTC)
*{{support}} Conditional on development of (a) community guidelines that ensure alignment with Wikiversity's purpose, and (b) clear, nested page-naming structures for projects. More detail below. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:48, 15 May 2026 (UTC)
*{{contra}} This proposal doesn't seem interested in expanding educational materials in journalism, but rather in providing space and protection for Wikinews contributors. But this is contrary to the goals of Wikiversity, and I'm not sure it's a good idea, even with regard to WMF. If WMF decides to close a project and another community lets it run on its domain, that's a bit of an undermining of WMF's and the community's decisions. Given that Wikiversity has had several conflicts with other communities and WMF in its history, I'm against it.--[[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:59, 15 May 2026 (UTC)

===Comments and questions===
:Definitely worthy of discussion, so I have no problem with the proposal in the sitenotice.
:Initial questions:
:* Does this proposal include importing English Wikinews content e.g., to [[Wikinews]] subpages?
:* What are &quot;active editions&quot;?
:* How can Wikiversity navigate the concerns that lead to the closure of Wikinews?
:* Are any changes to the scope of Wikinews proposed?
:* How does [[Wikinews]] fit with the [[Wikiversity:Mission]]? What aligns well? Where might there be tension?
:** e.g., I'm not sure that a page like [[Story/Manchester City moves two points behind Arsenal]] in and of itself will serve as an educational resource.
:-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 05:52, 14 May 2026 (UTC)
:* Does this proposal include importing English Wikinews content e.g., to [[Wikinews]] subpages?
::*No, not at this time.
:* What are &quot;active editions&quot;?
::*There were 30 other active editions of Wikinews in addition to English (e.g. [[:n:es:]]) at the time of universal closure (2026-05-04).
:* How can Wikiversity navigate the concerns that lead to the closure of Wikinews?
::*One of the biggest issues was the problems with DPL, which is now irrelevant. Another was the lack of activity, which can be ameliorated by having it be part of an existing project instead of its own domain (e.g. some editions of Wikipedia host their own Wikinews already and those projects were not impacted by the closure).
:* Are any changes to the scope of Wikinews proposed?
::*Not at this juncture. I would also propose as far as implemention goes that we would request a new namespace and that the material be more-or-less sequestered into its own ongoing project, like Wikijournal is or like the Cookbook and Wikijunior are at our sister [[:b:]].
:* How does [[Wikinews]] fit with the [[Wikiversity:Mission]]? What aligns well? Where might there be tension?
:** e.g., I'm not sure that a page like [[Story/Manchester City moves two points behind Arsenal]] in and of itself will serve as an educational resource.
::*The process of citizen journalists practicing their craft in real-time and collaborating with others to do so is itself an education activity. We would essentially be hosting a real-time experiment in citizen journalism, online communities, and collaborative learning in addition to the prospect of spreading educational information from someone actually reading the news. I would propose that we could also make a more deliberate attempt to engage with learning &lt;em&gt;about&lt;/em&gt; what does and doesn't work with collaborative news writing by experimentation (e.g. audio news, syndicating to other sites, incorporating freely-licensed news from other sources, writing hyper-local news, writing briefs versus longer-term reportage) and also seeing if the problems noted in the Task Force report that recommended closure can be overcome. Note that we have already done some local investigation about and learning about wiki-based journalism on Wikinews here at [[Journalism studies and Wikinews]]. We could continue that learning and refine the process, including incorporating journalism students from universities. As for tensions, Wikinews is the only sister project that must be done with a quick turn-around: if you take a long time to [[:s:|transcribe a book]], that's just how long it takes, but if you take a long time to write news, it ceases to be news entirely. Wikiversity has been a very slow-growing project that has definitely had some successes but has generally come together over a long period with most learning resources being individual passion projects (or sometimes, frankly, crankery) which would not work with collaborative news that requires more than just a single editor writing whatever he feels like.
::Please let me know any other questions/concerns and any other editors feel free to give your own perspective. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 06:13, 14 May 2026 (UTC)
:::Thanks, Justin — it is food for thought.
:::In attempting to understand how we've arrived here, I've summarised some of the background on this page: [[Wikinews]].
:::Perhaps it could be helpful to flesh out more of the vision / ideas / possibilities / challenges on that page? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:49, 14 May 2026 (UTC)

:::*Having given it some thought, in principle, I support hosting [[citizen journalism]] on Wikiversity where it is clearly connected to a learning project and/or constitutes original research, both of which align strongly with [[Wikiversity:Mission|Wikiversity’s educational mission]].
:::*My chief concern is the potential for news content that is not clearly linked to the purpose of Wikiversity. To avoid this, some community-agreed guidelines would be prudent. These need not be overly restrictive; they should support boldness and experimentation while helping ensure alignment with Wikiversity's purpose.
:::*Given the reported low and declining activity on Wikinews, it seems unlikely that English Wikiversity would be overwhelmed by an influx of news-related editing. My impression is that English Wikinews was the most active edition, but even so, many contributors are likely to disperse to other projects or cease editing altogether. A modest migration of interested editors to Wikiversity seems manageable.
:::*At this stage, I do not think a dedicated namespace is necessary. Subpages under [[Wikinews]] or nested pages under relevant learning or research projects, or user-space draft pages should be suitable. I agree that [[Wikijournal]] offers a useful model, as do several existing course structures on Wikiversity.
:::*I support [[User:Koavf]]’s suggestions about framing Wikinews activity explicitly around learning. This would create a distinctive space for experimenting with collaborative news production in ways that are pedagogically meaningful. I agree that the [[journalism studies and Wikinews]] project developed by David and Leigh Blackall through the University of Wollongong is an excellent example of the intersection between Wikiversity and Wikinews. The [[Wikinews]] page could evolve into a hub for such projects.
:::*I've tidied the [[:Category:Wikinews|Wikinews category]] and merged some content into the [[Wikinews]] page. As part of a reinvigoration effort, please review these and related resources such as [[:Category:Journalism]] and [[School:Journalism]].
:::*A further argument in favour of this initiative is that Wikipedia explicitly excludes both news reporting and original research. So, there is value in maintaining spaces within the Wikimedia ecosystem where these forms of knowledge production can be openly developed and curated. Such work can, in turn, generate valuable evidence and source material that may later inform Wikipedia articles.
:::*The closure of WMF-hosted Wikinews does not imply that open wiki-based news curation lacks value. Indeed, the closure documentation appears supportive of experimentation with alternative news models across Wikimedia projects, including through Wikipedia and Wikidata. In that context, Wikiversity seems a natural home for a Wikinews experiment, provided it is clearly grounded in learning and/or research.
:::-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:39, 15 May 2026 (UTC)
My understanding towards Wikinews' failure is that everything takes too long to be approved for the publish status, which means that any breaking news would have already become days-old stale news. Wikinews has a brand recognition (for right or wrong reasons) than Wikiversity and I wonder how effective Wikiversity can attract the &quot;Wikinews refugees&quot; to edit here. And just a quick note on the governance. Since each Wikiversity language operates independently, each language has to vote &amp; adopt this proposal independently. [[User:OhanaUnited|&lt;b&gt;&lt;span style=&quot;color: #0000FF;&quot;&gt;OhanaUnited&lt;/span&gt;&lt;/b&gt;]][[User talk:OhanaUnited|&lt;b&gt;&lt;span style=&quot;color: green;&quot;&gt;&lt;sup&gt;Talk page&lt;/sup&gt;&lt;/span&gt;&lt;/b&gt;]] 13:47, 15 May 2026 (UTC)

:Your assessment about Wikinews is partially correct. I referenced it earlier, but to be explicit, there is a [[:m:Proposal for Closing Wikinews|report by a task force on sister projects]] that outlines their concerns. There are a few, one of which was the nature of the staleness of news. Thanks also for clarifying that this proposal is only relevant to en.wv and is not binding or even proposed for other editions of Wikiversity. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:54, 15 May 2026 (UTC)

== Inactivity policy for Curators ==

I was wondering if there is a specific inactivity polity for curators (semi-admins) as I am pretty sure the global policy does not apply to them as they are not ''fully'' sysops. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 03:20, 15 February 2026 (UTC)

:Unfortunately, I don't see an inactivity policy, but if we were to create such a new policy for curators, it should be the same for custodians (administrators). [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 18:45, 15 February 2026 (UTC)
::@[[User:Codename Noreste|Codename Noreste]] There is currently none, that I could find, for custodians either. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:47, 17 February 2026 (UTC)
:::I think we should propose a local inactivity policy for custodians (and by extension, curators), which should be at least one year without any edits ''and'' logged actions. However, I don't know which page should it be when the inactivity removal procedure starts. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 00:53, 17 February 2026 (UTC)
::::@[[User:Codename Noreste|Codename Noreste]] In theory, there should be a section added at [[WV:Candidates for custodianship]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:55, 17 February 2026 (UTC)
::::: To be consistent with the [[meta:Admin activity review|global period of 2 years inactivity]] for en.wv  [[Wikiversity:Custodianship#Notes|Custodians]] and [[Wikiversity:Bureaucratship#How are bureaucrats removed?|Bureaucrats]] we could add something like this to [[Wikiversity:Curators]]:
::::::The maximum time period of inactivity &lt;u&gt;without community review&lt;/u&gt; for curators is two years (consistent with  the [[:meta:Category:Global policies|global policy]] described at [[meta:Admin activity review|Admin activity review]] which applies for [[Wikiversity:Custodianship#Notes|Custodians]] and [[Wikiversity:Bureaucratship|Bureaucrats]]). After that time a custodian will remove the rights.
::::: -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:51, 27 March 2026 (UTC)
:::::Yup, I agree with Jtneill, there is a policy proposal for Wikiversity:Curators, where it should be logically deployed. The question is if we are ready to aprove the policy. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:43, 17 April 2026 (UTC)
:::::: I agree, but we should notify the colloquium about inactive curators, just like a steward would do for inactive custodians and bureaucrats per [[:m:Admin activity review|AAR]]. What is the minimum timeframe an inactive curator should receive so they can respond they would keep their rights? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 17:49, 17 April 2026 (UTC)
:I incorporated these suggestions into the proposed curators policy. Please review/comment/improve. Summary: 2 years, notify curator's user page, then remove rights after 1 month: [[Wikiversity:Curators#Inactivity]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 08:59, 24 April 2026 (UTC)
:: @[[User:Jtneill|Jtneill]] I created [[Template:Inactive curator]] for this. Feel free to make any changes or improvements. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:29, 24 April 2026 (UTC)
:::Wondering, should we also have:
:::* {{tl|Inactive custodian}}
:::* {{tl|Inactive bureaucrat}}
:::or perhaps just a single template with a parameter(s) for the user right(s)/role(s)? e.g., 
:::* if a custodian is inactive for 2 years, then custodian and curator rights are to be removed and 
:::* if a bureaucrat is inactive for 2 years, then bureaucrat, custodian, and curator rights are to to be removed.
:::-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:58, 13 May 2026 (UTC)
:::: I would probably modify that template when we actually develop our own inactivity policy, because we're currently under the AAR (a steward notifies the colloquium with [[m:Admin activity review/Notice to communities]], and inactive advanced right holders with [[m:Admin activity review/Notice to inactive right holders]]). [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:16, 13 May 2026 (UTC)
:::::Ah, I see. Yes, that makes sense. Thankyou. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:21, 15 May 2026 (UTC)

==Curator inactivity review==
These curators haven't been active for &gt; 2 years. As per the [[Wikiversity:Curatorship|curatorship policy]]:
* [[Special:Log/Cody naccarato]] was notified on their talk page by [[User:Codename Noreste|Codename Noreste]] on 24 Apr 2026
* [[Special:Log/Praxidicae]] was notified on their talk page by [[User:Codename Noreste|Codename Noreste]] on 24 Apr 2026
* [[Special:Log/Tegel]] was notified on their talk page by [[User:Jtneill|Jtneill]] notified their talk page on 16 May 2026

The policy allows a month to hear from these users. If no response, a custodian will remove their curator rights.

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 06:14, 16 May 2026 (UTC)
: For Cody naccarato and Praxidicae, their rights are to be removed by the 19th of May if they don't respond either here or on their talk page. For Tegel, the removal will happen on the 16th of June, probably. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:13, 16 May 2026 (UTC)</text>
      <sha1>p0hnc98dhzgbmciz7y0psarxf86k7v2</sha1>
    </revision>
    <revision>
      <id>2809652</id>
      <parentid>2809651</parentid>
      <timestamp>2026-05-16T15:30:26Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Inactivity policy for Curators */ reply ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809652</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="79760" sha1="bhnaetk4repbo1dtui05sdgkzobma77" xml:space="preserve">{{Wikiversity:Colloquium/Header}}
&lt;!-- MESSAGES GO BELOW --&gt;
== New titles for user right nominations ==
&lt;div class=&quot;cd-moveMark&quot;&gt;''Moved from [[Wikiversity talk:Candidates for Custodianship#New titles for user right nominations]].  [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 23:20, 17 April 2026 (UTC)''&lt;/div&gt;

I would like to propose the following retitles should a user be nominated for any of the following user rights:
* Curator: Candidates for Curatorship
* Bureaucrat: Candidates for Bureaucratship
The reason is that many curator (and probably bureaucrat) requests have run solely under {{tq|Candidates for Custodianship}}, but that title might sound misleading (especially in regards to the permission a user is requesting). CheckUser and Oversight (suppressor) are not included above since no user was nominated for these sensitive permissions, probably. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 01:30, 19 March 2026 (UTC)

:And it's not that when someone at the beginning misplaced the request, no one thought to move it and the others copied it. Even today, it would be possible to simply take it all and move it. Otherwise, for me, the more fundamental problem is that there is [[Wikiversity:Curators|no approved policy for curators]] than where the requests are based. Curators then operate in a certain vacuum and if one of them &quot;breaks out of the chain&quot;, the average user doesn't have many transparent tools to deal with it, because there is no policy. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:02, 19 March 2026 (UTC)
::I am not talking about the curator page (policy proposal). [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 19:08, 21 March 2026 (UTC)
: @[[User:Juandev|Juandev]] I'll see if I can do an overhaul of [[Wikiversity:Candidates for Custodianship]], just like I recently did with the Requests for adminship page on English Wikiquote. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 22:17, 18 April 2026 (UTC)
:Yes, great idea - ideally there will be separate &quot;Candidates for ...&quot; pages for each user right group. The most important for now is to separate curator and custodian pages as CN suggests. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:39, 1 May 2026 (UTC)
:So maybe I previously misunderstood. Are you proposing separated pages for nominations (i.e. [[Wikiversity:Candidates for Curatorship]], [[Wikiversity:Candidates for Bureaucratship]], [[Wikiversity:Candidates for Custodianship]])? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:30, 5 May 2026 (UTC)
:: Yes. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:33, 5 May 2026 (UTC)
:::I see, then I am fine with that @[[User:Codename Noreste|Codename Noreste]]. Sorry for misunderstanding. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:35, 9 May 2026 (UTC)

I've split the user rights nomination pages into:
* [[Wikiversity:Candidates for CheckUser]]
* [[Wikiversity:Candidates for Curatorship]]
* [[Wikiversity:Candidates for Custodianship]]
* [[Wikiversity:Candidates for Bureaucratship]]

Please review. There are likely several links to update, text to adjust, categories to manage, short-cuts to fix etc. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:22, 10 May 2026 (UTC)

:Thanks, great job @[[User:Jtneill|Jtneill]]. I am wondering if we need to move archived nominations too, or if we are OK with the actual state. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:08, 10 May 2026 (UTC)
::Yes, I think that would be helpful. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:46, 10 May 2026 (UTC)
:::I can do it @[[User:Jtneill|Jtneill]], I am just looking what system is there. I can see [[Wikiversity:Candidates for Custodianship/Archive of nominations for full custodianship]] which is a good complementary overview to the subpages with full history. The name of the pages is probably stably, but I would consider to create more specific redirect like [[Wikiversity:Candidates for Custodianship/Overview of staff nominations]], which would link to the above one. Then there is a [[Wikiversity:Candidates for Custodianship/Archived]], which are probably incomplete nominations, right? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:37, 11 May 2026 (UTC)
::::Tx @[[User:Juandev|Juandev]]. Yes, this makes sense. And maybe we move:
::::* archived '''curator''' nominations from [[Wikiversity:Candidates for Custodianship/Archive of nominations for full custodianship]] to e.g., [[Wikiversity:Candidates for Curatorship/Archive of nominations]]
::::* archived '''bureaucrat''' nominations from [[Wikiversity:Candidates for Custodianship/Archive of nominations for full custodianship ]] to e.g., [[Wikiversity:Candidates for Bureaucratship/Archive of nominations]]
::::-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:12, 11 May 2026 (UTC)
:::::OK. That sounds good. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:25, 12 May 2026 (UTC)
:An svg icon for [[Wikiversity:Curatorship|curators]] would also be helpful. We have them for other user rights: [[c:Category:Wikiversity user rights icons]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:54, 10 May 2026 (UTC)
::Done: [[Wikiversity:Curators]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 01:44, 11 May 2026 (UTC)

== Technical Request:  Courtesy link.. ==

[[Template_talk:Information#Background_must_have_color_defined_as_well]] [[User:ShakespeareFan00|ShakespeareFan00]] ([[User talk:ShakespeareFan00|discuss]] • [[Special:Contributions/ShakespeareFan00|contribs]]) 11:43, 20 March 2026 (UTC)
: I can't edit the template directly as it need an sysop/interface admin to do it. [[User:ShakespeareFan00|ShakespeareFan00]] ([[User talk:ShakespeareFan00|discuss]] • [[Special:Contributions/ShakespeareFan00|contribs]]) 11:43, 20 March 2026 (UTC)
:: Also if the Template field of - https://en.wikiversity.org/wiki/Special:LintErrors/night-mode-unaware-background-color is examined, there is poential for an admin to clear a substantial proportion of these by implmenting a simmilar fix to the indciated templates (and underlying stylesheets). It would be nice to clear things like Project box and others, as many other templates (and thus pages depend on them.) :)
[[User:ShakespeareFan00|ShakespeareFan00]] ([[User talk:ShakespeareFan00|discuss]] • [[Special:Contributions/ShakespeareFan00|contribs]]) 11:43, 20 March 2026 (UTC)

:I think it would be best to grant you interface admin rights for a short period of time to make these changes. However, I still have doubts about the suitability of this solution, which may cause other problems and no one has explained to me why dark mode has to be implemented this way @[[User:ShakespeareFan00|ShakespeareFan00]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:43, 20 March 2026 (UTC)

: I would have reservations about holding such rights, which is why I was trying to do what I could without needing them. However if it is the only way to get the required changes made, I would suggest asking on Wikipedia to find technical editors, willing to undertake the changes needed. [[User:ShakespeareFan00|ShakespeareFan00]] ([[User talk:ShakespeareFan00|discuss]] • [[Special:Contributions/ShakespeareFan00|contribs]]) 09:32, 21 March 2026 (UTC)

== WikiEducator has closed ==

Some of you may know of a similar project to Wikiversity, called [https://wikieducator.org/Main_Page WikiEducator], championed by [https://oerfoundation.org/about/staff/wayne-mackintosh/ Wayne Mackintosh][https://www.linkedin.com/posts/waynemackintosh_important-notice-about-the-oer-foundation-activity-7405113051688931329-Nhm9/][https://openeducation.nz/killed-not-starved/].

It seems [https://openeducation.nz/terminating-oer-foundation their foundation has closed] and they are no longer operating.

They had done quite a bit of outreach (e.g., in the Pacific and Africa) to get educators using wiki.

The WikiEducator content is still available in MediaWiki - and potentially could be imported to Wikiversity ([https://wikieducator.org/WikiEducator:Copyrights CC-BY-SA] is the default license).

The closing of WikiEducator arguably makes the nurturing of Wikiversity even more important.

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:09, 1 April 2026 (UTC)

:I was never active there. If anyone has an account or is otherwise in contact, we may want to copy relevant information here or even at [[:outreach:]]. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 04:46, 1 April 2026 (UTC)

:: I reached out to [[User:Mackiwg~enwikiversity|Wayne]] in January, and he responded briefly but positively (while travelling).  I wrote to the low-traffic wikieducator mailing list today and got a nice [https://groups.google.com/g/wikieducator/c/r_yIyUw6ZIA reply] from [[user:SteveFoerster|Steve Foerster]] who's interested in helping. If we can figure out a migration path it would be great to adopt at least the main namespace pages here.  
:: A few questions that come to mind: 
:: - would people want to create matching user accounts
:: - are there any namespaces (user/talk?) that should not be moved over
:: We could look at how this was done for the [[m:Wikivoyage/Migration]] wikivoyage migration. &lt;span style=&quot;padding:0 2px 0 2px;background-color:white;color:#bbb;&quot;&gt;&amp;ndash;[[User:Sj|SJ]][[User Talk:Sj|&lt;span style=&quot;color:#ff9900;&quot;&gt;+&lt;/span&gt;]]&lt;/span&gt; 04:27, 1 May 2026 (UTC)
:::That's fantastic, SJ, that you've reached out and that Wayne, Steve, and Jim are receptive—and that you can help! -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:52, 1 May 2026 (UTC)
::::A matching accound makes sense to give credits to the original authors and keep a clean chain of versions. The initial commit into wikiversity could have a &quot;marker with timestamp&quot; similar to signature with a reference where the content's source or a Web archive. This would allow authors to continue there work on wikiversity if they wish. [[User:Bert Niehaus|Bert Niehaus]] ([[User talk:Bert Niehaus|discuss]] • [[Special:Contributions/Bert Niehaus|contribs]]) 06:30, 15 May 2026 (UTC)

== Wikinews is ending ==

Apparently mainly due to low editorial activity, low public interest, but also failure to achieve the goals from the proposal for the creation of the project, the Wikinews project is ending after years of discussions ([[Meta:Proposal for Closing Wikinews|some reading]]).

And I would be interested to see how Wikiversity is doing in the monitored metrics. We probably have more editors than Wikinews had, but what about consumers and achieving the goals? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 19:14, 1 April 2026 (UTC)

:Wikiversity's biggest issue in recent times was the hosting of low-quality, trash content. Thankfully we've done a great job in removing pseudoscience and other embarrassingly trash content (Wikidebates, for example), but the biggest concern moving forward is proper maintenance IMO. I've caught several pseudoscience pages being created within the last few months that could easily have flown under the radar (ex, [[The Kelemen Dilemma: Causal Collapse and Axiomatic Instability]]), so I'd urge our custodians/curators to be on the lookout for this type of content. Usually an AI-overview can point this type of content out relatively well.
:In terms of visibility, I believe Wikiversity is a high-traffic project. I remember my [[Mathematical Properties]] showing up on the first page of Google when searching up &quot;math properties&quot; for the longest time (and is still showing up in the first page 'till this day!). Besides, Wikinews hosted a lot of short-term content (the nature of news articles), while Wikiversity hosts content that can still be useful a decade later (ex, [[A Reader's Guide to Annotation]]). 
:I think we are on a better path than we were a few months ago, and I do want to thank everyone here who has been helping out with maintaining our website! —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 20:48, 1 April 2026 (UTC)
:For what it's worth, the group that did that study has since disbanded, so no one is monitoring the other sister projects in the same way. Additionally, Wikinews had some catastrophic server issues due to the maintenance of [[:m:Extension:DynamicPageList]] which don't apply here. Your questions are still worth addressing, but I just wanted to cut off any concern at the pass about Wikiversity being in the same precarious situation. Wikiversity is definitely the biggest &quot;lagging behind&quot; or &quot;failure&quot; project now that Wikinews is being shuttered, but I don't see any near- or medium-term pathway to closing Wikiversity. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 00:46, 2 April 2026 (UTC)

:[[w:en:Wikipedia:Wikipedia Signpost/2026-03-31/News and notes|Entirety of Wikinews to be shut down]] (Wikipedia Signpost) -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:03, 11 April 2026 (UTC)

== Action Required: Update templates/modules for electoral maps (Migrating from P1846 to P14226) ==

Hello everyone,

This is a notice regarding an ongoing data migration on Wikidata that may affect your election-related templates and Lua modules (such as &lt;code&gt;Module:Itemgroup/list&lt;/code&gt;).

'''The Change:'''&lt;br /&gt;
Currently, many templates pull electoral maps from Wikidata using the property [[:d:Property:P1846|P1846]], combined with the qualifier [[:d:Property:P180|P180]]: [[:d:Q19571328|Q19571328]]. 

We are migrating this data (across roughly 4,000 items) to a newly created, dedicated property: '''[[:d:Property:P14226|P14226]]'''.

'''What You Need To Do:'''&lt;br /&gt;
To ensure your templates and infoboxes do not break or lose their maps, please update your local code to fetch data from [[:d:Property:P14226|P14226]] instead of the old [[:d:Property:P1846|P1846]] + [[:d:Property:P180|P180]] structure. A [[m:Wikidata/Property Migration: P1846 to P14226/List|list of pages]] was generated using Wikimedia Global Search.

'''Deadline:'''&lt;br /&gt;
We are temporarily retaining the old data on [[:d:Property:P1846|P1846]] to allow for a smooth transition. However, to complete the data cleanup on Wikidata, the old [[:d:Property:P1846|P1846]] statements will be removed after '''May 1, 2026'''. Please update your modules and templates before this date to prevent any disruption to your wiki's election articles.

Let us know if you have any questions or need assistance with the query logic. Thank you for your help! [[User:ZI Jony|ZI Jony]] using [[User:MediaWiki message delivery|MediaWiki message delivery]] ([[User talk:MediaWiki message delivery|discuss]] • [[Special:Contributions/MediaWiki message delivery|contribs]]) 17:11, 3 April 2026 (UTC)
&lt;!-- Message sent by User:ZI Jony@metawiki using the list at https://meta.wikimedia.org/w/index.php?title=Distribution_list/Non-Technical_Village_Pumps_distribution_list&amp;oldid=29941252 --&gt;
:I didnt find such properties, so we are probably fine. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:00, 12 April 2026 (UTC)
:: +1 (agreed). [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 22:19, 12 April 2026 (UTC)

== Enable the abuse filter block action? ==

In light of [[Special:AbuseLog/80178]] (coupon spam), I would like to propose enabling the block action for the abuse filter. Only custodians will be able to enable and disable that action on an abuse filter, and it is useful to block ongoing vandalism. Thoughts? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 19:12, 13 April 2026 (UTC)

:Seems like a good idea, almost all of the users which create such pages are spambots so this shouldn’t be a problem. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 23:41, 13 April 2026 (UTC)
:Can you explain some more (I am new to abuse filters)? It looks like the attempted edit was prevented? Which abuse filter?
:Note on your suggestion, have also reactivated Antispam Filter 12 - see [[WV:RCA]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:45, 15 April 2026 (UTC)
:: I am proposing that we activate the abuse filter block action, which if a user triggers an abuse filter, it would actually block the user in question - the same mechanism that a custodian would use to block users. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:11, 15 April 2026 (UTC)
:::OK, thankyou, that makes sense. And, reviewing the abuse filter 12 log, it would be helpful because it would prevent the need for manual blocking. But I don't see a setting for autoblocking? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 23:14, 15 April 2026 (UTC)
:::: I think it probably adds an autoblock. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 00:43, 16 April 2026 (UTC)
: [[User:Jtneill|Jtneill]] and [[User:PieWriter|PieWriter]], given that a little bit more than a week has passed and there is minimal consensus to activate the abuse filter block action, I filed [[phab:T424053]]. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:05, 21 April 2026 (UTC)
::Thank-you for doing this. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 08:03, 24 April 2026 (UTC)

== Advice needed: A Neurodiversity-inspired Idea/observation ==

If I want the greatest participation of others to &quot;provide constructive criticism to my idea&quot; or to &quot;shoot down my idea&quot; or &quot;idea&quot;.

What I've called it so far is &quot;The Neurodiversity-inspired Idea&quot;. At other times I used more sensationalist wording but here on Wikiversity I don't dare do that. I actually woke up with thinking about putting this into my userspace draft: &quot;Personal Observations Made By Meeting Autistic and Non-Autistic Adults&quot;.

My ultimate goal is to stop blathering about my &quot;idea&quot; to friend and family without feeling my &quot;methodology&quot; is going into any progressive direction whatsoever. My latest encounter was somewhat constructive though. A friend of a friend who worked with people presenting ideas in attempting to getting grants. I don't want a grant. I just want to figure out how I can express my &quot;idea&quot; in a way so that I can more clearly figure out what flaws it got.

At the same time I tend to overthink. If anyone thinks etherpad might be a good place and considering Wikimedia already got an etherpad at https://etherpad.wikimedia.org/ if anyone feels like they know me better in the future feel free to suggest a &quot;session&quot; on etherpad.

'''If I don't receive a reply to this in 1 week's time I will begin to explore this &quot;idea&quot; into my userspace''' unless you replied and refrained me from doing so, of course. Then maybe after &quot;developing it there&quot; I might reference it to you another future time here in the Colloquium, with my &quot;idea&quot; still in my userspace draft. This &quot;idea&quot; is sort of a burden, I'm happy I've made the choice to get rid of it and hopefully move on with my life, unless there is something to this &quot;idea&quot;. 

My failure is probably evident: I feel I haven't told you anything. Same happened to when I talked to friends and family. In danger of overthinking it further I'll publish this right now. I need to &quot;keep it together&quot; [[User:ThinkingScience|ThinkingScience]] ([[User talk:ThinkingScience|discuss]] • [[Special:Contributions/ThinkingScience|contribs]]) 10:36, 16 April 2026 (UTC)

:Good on you putting it out there ... and hitting publish :). I'd say go for it (no need to wait), give birth to your idea and share about it here and elsewhere. Let it take shape and see where it might go. In many ways, this is exactly what an open collaborative learning community should be doing. Others might not know well how to respond, so perhaps consider creating some questions to accompany the idea. Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:21, 16 April 2026 (UTC)
::Thank you for encouraging me in developing the idea.
::I have created a &quot;questions&quot; section in the draft which is visible in the table of contents now. My brain was &quot;frozen&quot; today metaphorically speaking in that I felt I had like a &quot;writer's block&quot; so the draft has more &quot;AI/LLM&quot; content than before. I used the LLM for generating questions. The answers are so far human-only.
::I've also created a subsection where I could add the prompts that made the LLM generate the questions. That could help people make better prompts perhaps. I've described what it is about inside of it and there are some chaotically written notes.
::[[Draft:The_Neurodiversity-inspired_Idea#Questions_that_might_encourage_the_development_of_this_idea_and_its_methodology]]
::My draft is missing stuff. Any questions that you contribute to my draft will probably help me and if I don't understand the questions I'll probably notify you and also at the same time &quot;feed them&quot; to an LLM and ask in my input like &quot;explain in simple words what this question means, what is it searching for?&quot; etc. while I wait for an answer. If you have any more feedback please give it to me here or on the Draft page, its talk page or my user talk page. Thank you for helping me! [[User:ThinkingScience|ThinkingScience]] ([[User talk:ThinkingScience|discuss]] • [[Special:Contributions/ThinkingScience|contribs]]) 21:20, 18 April 2026 (UTC)
::Today I woke up with not only thinking about supplying questions along with the &quot;idea&quot; but also answers. ie. Is it possible to &quot;test&quot; this idea? Is it possible to create one or multiple hypotheses based on this &quot;idea&quot;?(etc.) I've thought about this before in this &quot;idea&quot; but since I'm beginning to add to Wikiversity what was previously 'locked in my mind' it's also easier for me to see what I've done so far. Thank you for this comment! [[User:ThinkingScience|ThinkingScience]] ([[User talk:ThinkingScience|discuss]] • [[Special:Contributions/ThinkingScience|contribs]]) 09:11, 23 April 2026 (UTC)
:May I think that you should not add deadlines ; being read, and rising interest for collaboration, or even simply for exchange of thoughts, such an effective meeting event loads a huge bunch of unprobability, which time can help to… somehow diminish. Maybe, I would advice you having a central place for developping your ideas, your needs, your advances, maybe a page in your own user zone, and from time to time, depending your feeling, it could be every trimester or so, or more frequently, you could write a short account of progress (or even of no progress), or a call for participation, in such a place as this present one ; I think that will increase much exposure of your projet. Maybe also, if you can find a project name, not necessarily very meaningfull by itseilf (at least it will gain signification with time, as your project develops), that will serve as a kind-of hook, and make your announcement titles more visible. Best regards (and my excuses for my poor command of English, which seems to be unplease an anti-abuse filter, &quot;Questionable Language (profanity)&quot;, which I don't understand…). My few cents. --  [[User:Eric.LEWIN|Eric.LEWIN]] ([[User talk:Eric.LEWIN|discussion]] • [[Special:Contributions/Eric.LEWIN|contributions]]) 10:06, 17 April 2026 (UTC)
::Sorry about the false positive on the profanity filter - I've fixed it. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:26, 17 April 2026 (UTC)
:::&quot;May I think that you should not add deadlines ; being read, and rising interest for collaboration, or even simply for exchange of thoughts, such an effective meeting event loads a huge bunch of unprobability, which time can help to… somehow diminish.&quot;
::Thank you Eric for this comment. Trust in time is how I interpret it. I should not feel like I need to be in a hurry. I'll try to give this time. Thank you!
:::&quot;Maybe, I would advice you having a central place for developping your ideas, your needs, your advances, maybe a page in your own user zone, and from time to time, depending your feeling, it could be every trimester or so, or more frequently, you could write a short account of progress (or even of no progress), or a call for participation, in such a place as this present one ; I think that will increase much exposure of your projet.&quot;
::A central place for developing or making &quot;project notes&quot; regarding the Neurodiversity idea on my userspace, I might need that, like a diary or &quot;project notes&quot; of the Neurodiversity idea similar to my course notes regarding my experience with Coursera.
::Any actions I take are going to be related to my Userspace from now on but I'll also update the draft when necessary. Now in the beginning I might be working daily to once every 3 days on both the draft and the daily notes I plan to make.
:::&quot;Maybe also, if you can find a project name, not necessarily very meaningfull by itseilf (at least it will gain signification with time, as your project develops), that will serve as a kind-of hook, and make your announcement titles more visible.&quot;
::Thank you for the advice. I was brainstorming yesterday about it. I concluded that since I've not yet developed a methodology that adheres to &quot;Do no harm&quot; and this is my first time working my &quot;idea&quot; into a way that is compatible with how projects develop on English Wikiversity this is new to me. My methodology isn't developed and therefore trying to get attention to my project through a name can wait. Yesterday I figured out a silly title that has nothing to do with the project: &quot;Planetary Awareness Potato Cabbage Rolls&quot; or something like that. Google output read that no such thing exists so I wanted it mainly to be unique. I don't want to raise attention that I'm unsure whether I'll actually be capable of developing a methodology for but project notes is my best bet so far in tracking my progress. Every day I think about this &quot;idea&quot; but I need to improve the important parts.
:::&quot;Best regards (and my excuses for my poor command of English, which seems to be unplease an anti-abuse filter, &quot;Questionable Language (profanity)&quot;, which I don't understand…). My few cents.&quot;
::You added great points and I felt that I was helped by you! I encourage you to post again and I can understand that interacting with any kind of automated filter can be discouraging and can be for me too! Thank you for giving me feedback! [[User:ThinkingScience|ThinkingScience]] ([[User talk:ThinkingScience|discuss]] • [[Special:Contributions/ThinkingScience|contribs]]) 16:01, 18 April 2026 (UTC)

== Add some user rights to the curator user group? ==

By default, only custodians have the ability to mark new pages as patrolled (&lt;code&gt;patrol&lt;/code&gt;) and have their own page creations automatically marked as patrolled (&lt;code&gt;autopatrol&lt;/code&gt;). I am proposing both of the following:
* Curators can mark new pages as patrolled, helping on reducing the backlog of new, unpatrolled pages.
* New pages made by curators will be automatically marked as patrolled by the MediaWiki software.
Before we implement this, I would suggest implementing a proposed guideline for marking new pages as patrolled for curators and custodians.

Thoughts? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 16:32, 17 April 2026 (UTC)

:Agree, &lt;s&gt;also can we also allow curators to undelete pages since they already have the rights to delete them?&lt;/s&gt; [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 02:54, 18 April 2026 (UTC)
::I think the requirement that undelete NOT be included came from above (meta / stewards / central office). Having access to the undelete page gives access to information that is restricted by their policies to admins (custodians and bureaucrats). -- [[User:Dave Braunschweig|Dave Braunschweig]] ([[User talk:Dave Braunschweig|discuss]] • [[Special:Contributions/Dave Braunschweig|contribs]]) 20:12, 18 April 2026 (UTC)
::: [[User:PieWriter|PieWriter]], unless if requests for curator and custodian should be RfA-like processes (that is, including voting and comments), then I have to agree with Dave above. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 22:03, 18 April 2026 (UTC)
::::Oh, I didn’t realise that. Withdrawing my comment.. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:08, 19 April 2026 (UTC)
:{{support}} Seems reasonable and would reduce overhead. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 14:35, 18 April 2026 (UTC)
:'''Agree''', implement it also to [[Wikiversity:Curators]] proposal please. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:11, 18 April 2026 (UTC)
: I went ahead and filed [[phab:T424445]]. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:39, 26 April 2026 (UTC)

== [[Wikiversity:Curators|Curators and curators policy]] ==
{{archive top|There is strong consensus, so [[Wikiversity:Curators]] is now a policy. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:15, 9 May 2026 (UTC)}}
How does it come, that Wikiversity has curators, but Curators policy is still being proposed? How do the curators exists and act if the policy about them havent been approved yet? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:33, 16 October 2025 (UTC)

:It looks as if it is not just curators. The policy on Bureaucratship is still being proposed as well. See [[Wikiversity:Bureaucratship]]. —[[User:RailwayEnthusiast2025|&lt;span style=&quot;font-family:Verdana; color:#008000; text-shadow:gray 0.2em 0.2em 0.4em;&quot;&gt;RailwayEnthusiast2025&lt;/span&gt;]] &lt;sup&gt;[[User talk:RailwayEnthusiast2025|&lt;span style=&quot;color:#59a53f&quot;&gt;''talk with me!''&lt;/span&gt;]]&lt;/sup&gt; 18:33, 27 October 2025 (UTC)

:I think its just the nature of a small WMF sister project in that there are lots of drafts, gaps, and potential improvements. In this case, these community would need to vote on those proposed Wikiversity staff policies if we think they're ready. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:08, 3 December 2025 (UTC)
:What? I thought you were getting it approved, Juandev... :) [[User:I&amp;#39;m Mr. Chris|I&amp;#39;m Mr. Chris]] ([[User talk:I&amp;#39;m Mr. Chris|discuss]] • [[Special:Contributions/I&amp;#39;m Mr. Chris|contribs]]) 14:20, 12 February 2026 (UTC)
::Yeah I think this one is important too and we need to aprove it too @[[User:I'm Mr. Chris|I'm Mr. Chris]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 15:56, 12 February 2026 (UTC)
:::I thinks its ready to made into a policy, it seems to be complete and informative about what the rights does and how to get it. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 03:08, 15 February 2026 (UTC)
::::Agree -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:00, 27 March 2026 (UTC)

Let's make this the official discussion about adopting the [[Wikiversity:Curators|curators policy]] policy. Your comments are invited and welcome. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 08:40, 24 April 2026 (UTC)
: There were two similar Colloquium threads in separate places about the proposed curators policy. So I've moved them to be adjacent. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 12:42, 1 May 2026 (UTC)
{{archive bottom}}

== Wikiversity:Curators to become a policy ==
{{archive top|There is strong consensus, so [[Wikiversity:Curators]] is now a policy. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:16, 9 May 2026 (UTC)}}
I've looked at the discussions about the Curators policy, I've looked at the practices, and it seems to me that there is no dispute about the wording of the policy, and what's more, the community has been using this proposal as if it were an offical policy for several years. Therefore, I propose that [[Wikiversity:Curators]] become a policy. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:35, 18 April 2026 (UTC)

:{{support}} —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:54, 18 April 2026 (UTC)
:{{support}} —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 20:21, 18 April 2026 (UTC)
: {{support|Yes, please}}. Especially after when I and PieWriter proposed above, I agree. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:27, 24 April 2026 (UTC)
:: @[[User:Juandev|Juandev]]; as of now, curators now have the user rights &lt;code&gt;autopatrol&lt;/code&gt; and &lt;code&gt;patrol&lt;/code&gt;. Perhaps we should also include that in [[Wikiversity:Custodianship]]? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 12:07, 30 April 2026 (UTC)
:::You meant [[Wikiversity:Curators]] @[[User:Codename Noreste|Codename Noreste]]? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:15, 5 May 2026 (UTC)
:::: I agree that we must develop what rules curators should follow when marking new pages as patrolled; the same can be added for custodians since they can also mark new pages as patrolled. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:37, 5 May 2026 (UTC)
:::::I see, well I think you can just add this to the policy. It is not major change and it probably reflects actual practice or actual technical possibilities for those flags. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:20, 7 May 2026 (UTC)
:{{support}} -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 12:42, 1 May 2026 (UTC)
:{{Support}} per nom. [[User:PhilDaBirdMan|PhilDaBirdMan]] ([[User talk:PhilDaBirdMan|discuss]] • [[Special:Contributions/PhilDaBirdMan|contribs]]) 13:32, 1 May 2026 (UTC)
{{Archive bottom}}

== Inactive curators ==

Hello, even though [[Wikiversity:Curators]] is not a policy yet, there are curators listed here that have been inactive for two years or more:
* {{user|Cody naccarato}} (last edit on 13 Dec 2022, last logged action on 10 Dec 2022)
* {{user|Praxidicae}} (last edit on 10 Sep 2022, last logged action on 12 Sep 2022)
[[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 21:14, 19 April 2026 (UTC)

:Yup, I would remove the rights. To get the rights back if theyll come back should not be a big deal. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:08, 24 April 2026 (UTC)
:: When they don't reply by May 19, feel free (or any custodian) to do so. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 00:28, 25 April 2026 (UTC)

== Is anyone interested in Neurodiversity? ==

Is anyone interested in Neurodiversity? Is there anyone here who is interested for Neurodiversity to be &quot;something more&quot; than it already is? Does anyone here consider Neurodiversity one of the &quot;harder topics&quot; to work on or discuss? Does anyone here have an opinion about the [[Neurodiversity Movement]]? So these questions don't appear like &quot;out of a vacuum&quot; I can tell you a bit about my background:

Many years ago I got a psychiatric diagnosis &quot;Asperger's&quot;. After I stepped out of the office and my Äsperger's was 'concluded', I stepped out into the street and thought my first negative thought(but the positive thought followed after). The thought was about concentration camps in the second world war and that the world seemed to be going into the direction of &quot;labeling others&quot;. I was unsure whether this was &quot;real science&quot; and sort of &quot;challenged myself&quot; to make up my own mind after meeting people that had been given this diagnosis. The more adults with this diagnosis I met the more I started seeing &quot;patterns&quot;.

Was it a coincidence that the first person with Asperger's I met reminded me about my father later after I had plenty of times of experience with interacting with him? None of the people I interacted with online through IRC text chat...I felt I got any clue about how &quot;their brains work&quot;. Only when I met one person from the Asperger's chat community in person we both realized that whatever we experienced was akin to the &quot;chaos theory&quot;. He told me about &quot;chaos theory&quot; while I didn't know even what that term meant but I guess I 'read between the lines'. My question that I linger on still today is &quot;did he understand about me what I think I understood about him?&quot;? That our brains had the same configuration? Most autistic adults who meet other autistic adults usually get disappointed. They think the diagnosis will help them meet somebody like themselves and then they realize the great diversity in the autistic spectrum created by Psychiatry.

I later stopped interacting with autistic communities that much, I felt that it did not benefit me. Also Neurodiversity's &quot;neurotypes&quot; interested me for a while until I realized I had &quot;misunderstood everything&quot; about them and how they are used in the Neurodiversity Movement or &quot;Neurodiversity community&quot; if that even can precisely be defined? I doubt it but if you want to contribute to the [[Neurodiversity Movement]]. My previous attempts failed as I got more and more confused. I think a community project needs a community. With a lack of that I don't think it is worth my time. If any of you would like to work on that project let me know on my talk page.

So I was kinda lost and was talking to my friend and psychologist and I realized if I never talk about my idea to anyone in a &quot;comprehensive way&quot; or show that it matters to me nothing is going to ever happen. So I started talking about my &quot;idea&quot; more. Nobody could understand the &quot;idea&quot; because I had not developed my skills regarding where to start...although the process had already started &quot;automatically&quot; and that's why I often think of &quot;well my brain sort of activated me&quot;. I don't feel like I did have a plan and this idea happened. It happened &quot;by itself&quot;. My brain reacted to what I was seeing in a video or stream.

I value interaction highly in this idea. I think it would be helpful to make a community of people who are not paranoid about stuff that can express itself like &quot;don't analyze me!&quot;, &quot;don't compare me to anyone!&quot;. 

On the contrary, more often than not those adults who were diagnosed were actually openly comparing themselves with each other and I think that is healthy in a &quot;science&quot; way if done the &quot;right way&quot; which probably means &quot;Do no harm&quot;.

I found video material is important but I'm very unsure if uploading own video material to Wikimedia Commons would constitute a &quot;reasonable&quot; use of the resources there. Maybe somebody here needs to ask more questions to me that I should answer before that happens. I also know the '''be bold''' so I could just do what I think might be ok. Though I work better in a group as long as I know what &quot;group configurations&quot; help me. This is in a non-profit way. Since the state supported me this might be a way I am trying to &quot;give back&quot; to the state and &quot;the world&quot;. May seem overly ambitious and crazy but this thing gives me energy. It gives me hope when trying to develop this idea. [[User:ThinkingScience|ThinkingScience]] ([[User talk:ThinkingScience|discuss]] • [[Special:Contributions/ThinkingScience|contribs]]) 10:47, 23 April 2026 (UTC)

:Thanks for sharing. There is plenty of room for neurodiversity community learning. However, the challenge I think is that the intersection of those interested in (a) ND, and (b) English Wikiversity might be very small (e.g., 1!) at this point in time.
:But don't give up hope. For example, Wikipedia has many more ND-interested editors; maybe consider reaching out to see who might be interested:
:[[w:Category:Wikipedians interested in neurodiversity]]
:You could also start an equivalent category here:
:[[:Category:Wikiversitarians interested in neurodiversity]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:46, 6 May 2026 (UTC)

== Request for comment (global AI policy) ==

&lt;bdi lang=&quot;en&quot; dir=&quot;ltr&quot; class=&quot;mw-content-ltr&quot;&gt;A [[:m:Requests for comment/Artificial intelligence policy|request for comment]] is currently being held to decide on a global AI policy. {{int:Feedback-thanks-title}} [[User:MediaWiki message delivery|MediaWiki message delivery]] ([[User talk:MediaWiki message delivery|discuss]] • [[Special:Contributions/MediaWiki message delivery|contribs]]) 00:58, 26 April 2026 (UTC)&lt;/bdi&gt;
&lt;!-- Message sent by User:Codename Noreste@metawiki using the list at https://meta.wikimedia.org/w/index.php?title=Distribution_list/Global_message_delivery&amp;oldid=30424282 --&gt;

== Language learning  ==

toki! I am trying to add or see what the toki pona language learning stuff on here is but I don't see anything that is language learning for anything. [[User:Jan Imon|Jan Imon]] ([[User talk:Jan Imon|discuss]] • [[Special:Contributions/Jan Imon|contribs]]) 23:13, 2 May 2026 (UTC) —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 17:29, 3 May 2026 (UTC)

:We have language materials ([[:Category:Languages]], [[World Languages]], [[Portal:Foreign Language Learning]], [[Portal:Multilingual Studies]]). They are not as developed as I think we would all like and there's not any coverage of Toki Pona, but in principle, we could and would like that. You can also see [[:b:Subject:Languages]] at our sister project Wikibooks. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 17:33, 3 May 2026 (UTC)

== Timeline format? ==

I’ve been working on the World War II articles, including the [[World War II/Timeline|timeline]], and is there a specific timeline format that should be used? Right now it’s just a table, and there’s no separation between different periods/phases of the war.

I don’t want to use [[mw:Extension:EasyTimeline]] because this will be displaying dates and not time periods. [[User:PhilDaBirdMan|PhilDaBirdMan]] ([[User talk:PhilDaBirdMan|discuss]] • [[Special:Contributions/PhilDaBirdMan|contribs]]) 01:35, 4 May 2026 (UTC)

:I dont think we have a policy or guideline, how to format a timeline. But you may try to browes wikiversity by Google if someone was dealing with this in the past somewhow @[[User:PhilDaBirdMan|PhilDaBirdMan]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:23, 5 May 2026 (UTC)
::+1 - there's no specific guideline on how to format a timeline, it's really up to you. In my opinion I think the timeline is good. I'd personally bold the dates just to make it easier to separate it from the event description, but that's my personal 2 cents. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 14:18, 5 May 2026 (UTC)
:::I’ll probably remove links to the dates/years, they’re just Wikipedia pages that shouldn’t be over linked to. [[User:PhilDaBirdMan|PhilDaBirdMan]] ([[User talk:PhilDaBirdMan|discuss]] • [[Special:Contributions/PhilDaBirdMan|contribs]]) 00:39, 6 May 2026 (UTC)

== Interface administrator for Codename Noreste ==
{{Archive top|After running for a week, there is clear consensus for [[User:Codename Noreste]] to have Interface admin rights for 120 days; implemented until 10 September, 2026 -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 22:36, 12 May 2026 (UTC)}}

Hello, everyone. I am requesting interface administrator access on this wiki.

The main reasoning is that I would benefit from having the user right &lt;code&gt;editinterface&lt;/code&gt;, which would allow me to make dark mode changes to pages in the MediaWiki namespace, add &lt;code&gt;&lt;nowiki&gt;&lt;div class=&quot;mw-parser-output&quot;&gt;&lt;/nowiki&gt;&lt;/code&gt; to some interface pages using templates, handle interface-protected edit requests, and similar stuff. Additionally, I have some knowledge of CSS, and I would like to assist with modifying CSS pages whenever necessary, such as moving MediaWiki common.css code to TemplateStyles CSS pages.

I am requesting the maximum time that is allowed per the [[Wikiversity:Interface administrators|policy]], and I have 2FA enabled on my account. Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 00:55, 6 May 2026 (UTC)

*{{support}} Globally trusted user. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 01:07, 6 May 2026 (UTC)
*{{support}} Trusted and knowledgeable. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:35, 6 May 2026 (UTC)
*{{support}} WV would benefit from this. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 08:32, 6 May 2026 (UTC)
*{{support}} --[[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:13, 7 May 2026 (UTC)

:{{Comment}} Could @[[User:Codename Noreste|Codename Noreste]] delete [[MediaWiki:Gadget-WikiSign.js]], which was requested to be deleted @[[User:Koavf|Justin]], @[[User:Jtneill|Jtneill]], @[[User:Atcovi|Atcovi]]? I dont think we need it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:40, 9 May 2026 (UTC)
::Yes - clearly no longer used -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:18, 9 May 2026 (UTC)
::: I can't delete it because I don't have the required permissions to do so.
::: On a side note, if this project has a need for permanent interface administrators, I would suggest that we have a minimum of two IAs, similar to how there must be two CUs and/or suppressors (or none). Maybe Koavf can be a good candidate if I am elected for permanent interface adminship, and I believe that permission shouldn't be removed from someone's own account. Instead, a bureaucrat should do it. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:20, 9 May 2026 (UTC)
::::I am willing and happy to do it, unfortunately, we do not have an appetite for indef IAs and just had a discussion that resulted in a [https://en.wikiversity.org/w/index.php?title=Wikiversity:Interface_administrators&amp;diff=prev&amp;oldid=2807543 consensus that we can have IAs that have the user rights for 14 to 120 days]. So once you have the rights, please make sure to gopher it. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 17:54, 9 May 2026 (UTC)
:::::@[[User:Koavf|Koavf]] give it time. Look at me, I was in favor of shorter time, now I am looking back to times, when custodians could do it without the need of extra flag. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:31, 9 May 2026 (UTC)
::::::Here's hoping. I think it would reduce administrative overhead, but that's just me and I'm not a bureaucrat here. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:33, 9 May 2026 (UTC)
::::Complicated. Where are the times, admins could do everything! [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:27, 9 May 2026 (UTC)
{{archive bottom}}

== [[Wikiversity:Bureaucratship]] to become a policy ==

Following the recent approval of [[Wikiversity:Curators]] as a policy, I think [[Wikiversity:Bureaucratship]] may also be ready for policy status.

Please share your views about whether bureaucratship is ready to become a policy, or whether further revisions are needed.

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 13:58, 9 May 2026 (UTC)
: I added a logo about that user group, but other than that, it looks good to me. {{support}}. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:38, 9 May 2026 (UTC)
:I think that the consensus on this policy is proven by years of using it without further changes. But I I have to say weather I agree with this to become a policy, than of course {{support}}. It works and there were no major issues with it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:45, 9 May 2026 (UTC)
:{{support}} no issues. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 14:51, 10 May 2026 (UTC)
:{{support}} [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 12:37, 11 May 2026 (UTC)
:{{support}} ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 06:51, 12 May 2026 (UTC)

== Reminder about custodian-related pages ==

I would like to remind the community about what the following custodian pages are:
* [[Wikiversity:Request custodian action]] is for requesting actions to be done by custodians, and
* [[Wikiversity:Notices for custodians]] is for notices of interest to custodians, like an administrator's noticeboard
Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:12, 12 May 2026 (UTC)

:Thanks - I needed this reminder :) -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 22:21, 12 May 2026 (UTC)

== [[MediaWiki:Protectedpagetext#Protected edit request on 11 December 2025]] ==

I posted an edit request there 5 months ago, so I’ll be taking it to this page. [[Special:Contributions/&amp;#126;2026-28640-56|&amp;#126;2026-28640-56]] ([[User talk:&amp;#126;2026-28640-56|talk]]) 23:33, 12 May 2026 (UTC)

:What exactly is the problem? I don't understand what needs to change and why. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 23:35, 12 May 2026 (UTC)
: Pinging @[[User:Atcovi|Atcovi]], @[[User:Jtneill|Jtneill]] and @[[User:Juandev|Juandev]] for further input. Someone is requesting a modification to [[MediaWiki:Protectedpagetext]] to use {{tlx|Protected page text}}, but we might need to discuss whether to use the template. In the meantime, I'll start a sandbox version of the protected page text template. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 23:19, 14 May 2026 (UTC)
::Sounds good -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:13, 15 May 2026 (UTC)

== Create a pseudo-bot user group? ==

I would like to propose adding a new user group to Wikiversity: Pseudo-bot (&lt;code&gt;flood&lt;/code&gt;). This will allow users to perform repetitive actions without flushing the recent changes feed (with only the &lt;code&gt;bot&lt;/code&gt; user right). However, I would suggest that for the pseudo-bot user group:
* It can be granted and revoked by custodians. However, can curators add and remove pseudo-bot from their own accounts (and not others)?
* Users can remove themselves from it.
* A guideline might be necessary about the information and usage of it.
Thoughts? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 03:31, 14 May 2026 (UTC)

:This sounds good. Which other wiki could we model this user group on? e.g., [[b:Wikibooks:Pseudo-bots]]? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:19, 15 May 2026 (UTC)
::@[[User:Jtneill|Jtneill]] Wikiquote has a similar group: [[:wikiquote:Special:ListGroupRights]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 04:25, 15 May 2026 (UTC)

== Coming over From wikinews ==
Any chance someone could help me if you are allowed to write news articles here since wikinews is going read only mode soon, thank you! [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 22:43, 1 May 2026 (UTC)

:The scope of Wikiversity is very broad and is basically about more-or-less any learning material. We have made it a point to not have duplicative content of other WMF projects, but since Wikinews is being shuttered, I personally am fine with writing news articles here. One thing that is not controversial at all is a learning resource &lt;em&gt;about&lt;/em&gt; how to write news: that could be hugely useful here and could involve the process of writing news stories to learn and to share back and forth with an editor or fact-checker. In fact, I'd support an entire namespace dedicated to keeping the notion of Wikinews alive here. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 23:38, 1 May 2026 (UTC)
::Thank you so much! How do I start? Cheers! @[[User:Koavf|Koavf]] [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 01:07, 2 May 2026 (UTC)
:::I think it's premature to start just making news articles en masse, but if you want to start discussing the topic of citizen journalism, you can do that now. [[:Category:Journalism]] already has some material, so you can start by seeing what we already have, how you can refine that, etc. You can definitely have learning resources with collaborators who want to learn about journalism ASAP. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 01:24, 2 May 2026 (UTC)
::::thanks. [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 01:38, 2 May 2026 (UTC)
::::If I could try and start one News Article could you please tell me how to go about it? Like what style of writing like Wikinews or something else? Thank you Justin! @[[User:Koavf|Koavf]] [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 01:48, 2 May 2026 (UTC)
:::::Honestly, there are very few policies and guidelines here. I think the best way to write a news story would be in a manner that is obvious and instructive. So, for instance, it's common to use the &quot;pyramid style&quot; when you're writing news, so if you were to write a story that makes it very clear that you are using that approach, that would be helpful. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 02:08, 2 May 2026 (UTC)
::::::cool thanks. [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 02:13, 2 May 2026 (UTC)
::::::im ready to write @[[User:Koavf|Koavf]] [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 21:30, 13 May 2026 (UTC)
:::::::I think we should get more local consensus for a big project like including the entirety of the scope of Wikinews here. Again, I support it personally. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 21:55, 13 May 2026 (UTC)
::::::::ok lets begin. [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 22:15, 13 May 2026 (UTC)

== Proposal to rehost Wikinews here ==

As many of you know, and mentioned here at the Colloquium, our sister project Wikinews recently closed, with all 31 active editions made read-only. [[User:BigKrow]] has asked about the prospect of writing news stories here and I suggested that since we already have [[School:Journalism]] and some resources related to the [[:Category:Journalism|broader topic of journalism]]. I would like to propose that we have continued and indefinite space for {{w|citizen journalism}} by essentially repurposing Wikinews into a sub-project here. The only special infrastructure that Wikinews required was [[:mw:Extension:DynamicPageList]], which was deactivated and caused issues due to a lack of maintenance.

I will add this proposal to the site banner, but I recognize that that may be a conflict of interest, so if anyone requests that I remove it, I will. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:30, 14 May 2026 (UTC)
:I would like to see this conversation go for at least 30 days to establish a consensus. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:35, 14 May 2026 (UTC)

===Votes===
*{{support}} as proposer (with BK's inspiration). I think that an ongoing experiment in citizen journalism is a fit and appropriate use of this site. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:35, 14 May 2026 (UTC)
*{{support}}, hope to seeing ideas about this, and thank you @[[User:Koavf|Koavf]] [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 11:08, 14 May 2026 (UTC)
*{{support}} Other than perhaps inflating the total number of pages reported, I see the idea of &quot;practicing journalism&quot; a worthy and relevant activity within the domain of Wikiversity. [[User:IanVG|IanVG]] ([[User talk:IanVG|discuss]] • [[Special:Contributions/IanVG|contribs]]) 21:41, 14 May 2026 (UTC)
*{{support}} Conditional on development of (a) community guidelines that ensure alignment with Wikiversity's purpose, and (b) clear, nested page-naming structures for projects. More detail below. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:48, 15 May 2026 (UTC)
*{{contra}} This proposal doesn't seem interested in expanding educational materials in journalism, but rather in providing space and protection for Wikinews contributors. But this is contrary to the goals of Wikiversity, and I'm not sure it's a good idea, even with regard to WMF. If WMF decides to close a project and another community lets it run on its domain, that's a bit of an undermining of WMF's and the community's decisions. Given that Wikiversity has had several conflicts with other communities and WMF in its history, I'm against it.--[[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:59, 15 May 2026 (UTC)

===Comments and questions===
:Definitely worthy of discussion, so I have no problem with the proposal in the sitenotice.
:Initial questions:
:* Does this proposal include importing English Wikinews content e.g., to [[Wikinews]] subpages?
:* What are &quot;active editions&quot;?
:* How can Wikiversity navigate the concerns that lead to the closure of Wikinews?
:* Are any changes to the scope of Wikinews proposed?
:* How does [[Wikinews]] fit with the [[Wikiversity:Mission]]? What aligns well? Where might there be tension?
:** e.g., I'm not sure that a page like [[Story/Manchester City moves two points behind Arsenal]] in and of itself will serve as an educational resource.
:-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 05:52, 14 May 2026 (UTC)
:* Does this proposal include importing English Wikinews content e.g., to [[Wikinews]] subpages?
::*No, not at this time.
:* What are &quot;active editions&quot;?
::*There were 30 other active editions of Wikinews in addition to English (e.g. [[:n:es:]]) at the time of universal closure (2026-05-04).
:* How can Wikiversity navigate the concerns that lead to the closure of Wikinews?
::*One of the biggest issues was the problems with DPL, which is now irrelevant. Another was the lack of activity, which can be ameliorated by having it be part of an existing project instead of its own domain (e.g. some editions of Wikipedia host their own Wikinews already and those projects were not impacted by the closure).
:* Are any changes to the scope of Wikinews proposed?
::*Not at this juncture. I would also propose as far as implemention goes that we would request a new namespace and that the material be more-or-less sequestered into its own ongoing project, like Wikijournal is or like the Cookbook and Wikijunior are at our sister [[:b:]].
:* How does [[Wikinews]] fit with the [[Wikiversity:Mission]]? What aligns well? Where might there be tension?
:** e.g., I'm not sure that a page like [[Story/Manchester City moves two points behind Arsenal]] in and of itself will serve as an educational resource.
::*The process of citizen journalists practicing their craft in real-time and collaborating with others to do so is itself an education activity. We would essentially be hosting a real-time experiment in citizen journalism, online communities, and collaborative learning in addition to the prospect of spreading educational information from someone actually reading the news. I would propose that we could also make a more deliberate attempt to engage with learning &lt;em&gt;about&lt;/em&gt; what does and doesn't work with collaborative news writing by experimentation (e.g. audio news, syndicating to other sites, incorporating freely-licensed news from other sources, writing hyper-local news, writing briefs versus longer-term reportage) and also seeing if the problems noted in the Task Force report that recommended closure can be overcome. Note that we have already done some local investigation about and learning about wiki-based journalism on Wikinews here at [[Journalism studies and Wikinews]]. We could continue that learning and refine the process, including incorporating journalism students from universities. As for tensions, Wikinews is the only sister project that must be done with a quick turn-around: if you take a long time to [[:s:|transcribe a book]], that's just how long it takes, but if you take a long time to write news, it ceases to be news entirely. Wikiversity has been a very slow-growing project that has definitely had some successes but has generally come together over a long period with most learning resources being individual passion projects (or sometimes, frankly, crankery) which would not work with collaborative news that requires more than just a single editor writing whatever he feels like.
::Please let me know any other questions/concerns and any other editors feel free to give your own perspective. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 06:13, 14 May 2026 (UTC)
:::Thanks, Justin — it is food for thought.
:::In attempting to understand how we've arrived here, I've summarised some of the background on this page: [[Wikinews]].
:::Perhaps it could be helpful to flesh out more of the vision / ideas / possibilities / challenges on that page? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:49, 14 May 2026 (UTC)

:::*Having given it some thought, in principle, I support hosting [[citizen journalism]] on Wikiversity where it is clearly connected to a learning project and/or constitutes original research, both of which align strongly with [[Wikiversity:Mission|Wikiversity’s educational mission]].
:::*My chief concern is the potential for news content that is not clearly linked to the purpose of Wikiversity. To avoid this, some community-agreed guidelines would be prudent. These need not be overly restrictive; they should support boldness and experimentation while helping ensure alignment with Wikiversity's purpose.
:::*Given the reported low and declining activity on Wikinews, it seems unlikely that English Wikiversity would be overwhelmed by an influx of news-related editing. My impression is that English Wikinews was the most active edition, but even so, many contributors are likely to disperse to other projects or cease editing altogether. A modest migration of interested editors to Wikiversity seems manageable.
:::*At this stage, I do not think a dedicated namespace is necessary. Subpages under [[Wikinews]] or nested pages under relevant learning or research projects, or user-space draft pages should be suitable. I agree that [[Wikijournal]] offers a useful model, as do several existing course structures on Wikiversity.
:::*I support [[User:Koavf]]’s suggestions about framing Wikinews activity explicitly around learning. This would create a distinctive space for experimenting with collaborative news production in ways that are pedagogically meaningful. I agree that the [[journalism studies and Wikinews]] project developed by David and Leigh Blackall through the University of Wollongong is an excellent example of the intersection between Wikiversity and Wikinews. The [[Wikinews]] page could evolve into a hub for such projects.
:::*I've tidied the [[:Category:Wikinews|Wikinews category]] and merged some content into the [[Wikinews]] page. As part of a reinvigoration effort, please review these and related resources such as [[:Category:Journalism]] and [[School:Journalism]].
:::*A further argument in favour of this initiative is that Wikipedia explicitly excludes both news reporting and original research. So, there is value in maintaining spaces within the Wikimedia ecosystem where these forms of knowledge production can be openly developed and curated. Such work can, in turn, generate valuable evidence and source material that may later inform Wikipedia articles.
:::*The closure of WMF-hosted Wikinews does not imply that open wiki-based news curation lacks value. Indeed, the closure documentation appears supportive of experimentation with alternative news models across Wikimedia projects, including through Wikipedia and Wikidata. In that context, Wikiversity seems a natural home for a Wikinews experiment, provided it is clearly grounded in learning and/or research.
:::-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:39, 15 May 2026 (UTC)
My understanding towards Wikinews' failure is that everything takes too long to be approved for the publish status, which means that any breaking news would have already become days-old stale news. Wikinews has a brand recognition (for right or wrong reasons) than Wikiversity and I wonder how effective Wikiversity can attract the &quot;Wikinews refugees&quot; to edit here. And just a quick note on the governance. Since each Wikiversity language operates independently, each language has to vote &amp; adopt this proposal independently. [[User:OhanaUnited|&lt;b&gt;&lt;span style=&quot;color: #0000FF;&quot;&gt;OhanaUnited&lt;/span&gt;&lt;/b&gt;]][[User talk:OhanaUnited|&lt;b&gt;&lt;span style=&quot;color: green;&quot;&gt;&lt;sup&gt;Talk page&lt;/sup&gt;&lt;/span&gt;&lt;/b&gt;]] 13:47, 15 May 2026 (UTC)

:Your assessment about Wikinews is partially correct. I referenced it earlier, but to be explicit, there is a [[:m:Proposal for Closing Wikinews|report by a task force on sister projects]] that outlines their concerns. There are a few, one of which was the nature of the staleness of news. Thanks also for clarifying that this proposal is only relevant to en.wv and is not binding or even proposed for other editions of Wikiversity. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:54, 15 May 2026 (UTC)

== Inactivity policy for Curators ==

I was wondering if there is a specific inactivity polity for curators (semi-admins) as I am pretty sure the global policy does not apply to them as they are not ''fully'' sysops. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 03:20, 15 February 2026 (UTC)

:Unfortunately, I don't see an inactivity policy, but if we were to create such a new policy for curators, it should be the same for custodians (administrators). [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 18:45, 15 February 2026 (UTC)
::@[[User:Codename Noreste|Codename Noreste]] There is currently none, that I could find, for custodians either. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:47, 17 February 2026 (UTC)
:::I think we should propose a local inactivity policy for custodians (and by extension, curators), which should be at least one year without any edits ''and'' logged actions. However, I don't know which page should it be when the inactivity removal procedure starts. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 00:53, 17 February 2026 (UTC)
::::@[[User:Codename Noreste|Codename Noreste]] In theory, there should be a section added at [[WV:Candidates for custodianship]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:55, 17 February 2026 (UTC)
::::: To be consistent with the [[meta:Admin activity review|global period of 2 years inactivity]] for en.wv  [[Wikiversity:Custodianship#Notes|Custodians]] and [[Wikiversity:Bureaucratship#How are bureaucrats removed?|Bureaucrats]] we could add something like this to [[Wikiversity:Curators]]:
::::::The maximum time period of inactivity &lt;u&gt;without community review&lt;/u&gt; for curators is two years (consistent with  the [[:meta:Category:Global policies|global policy]] described at [[meta:Admin activity review|Admin activity review]] which applies for [[Wikiversity:Custodianship#Notes|Custodians]] and [[Wikiversity:Bureaucratship|Bureaucrats]]). After that time a custodian will remove the rights.
::::: -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:51, 27 March 2026 (UTC)
:::::Yup, I agree with Jtneill, there is a policy proposal for Wikiversity:Curators, where it should be logically deployed. The question is if we are ready to aprove the policy. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:43, 17 April 2026 (UTC)
:::::: I agree, but we should notify the colloquium about inactive curators, just like a steward would do for inactive custodians and bureaucrats per [[:m:Admin activity review|AAR]]. What is the minimum timeframe an inactive curator should receive so they can respond they would keep their rights? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 17:49, 17 April 2026 (UTC)
:I incorporated these suggestions into the proposed curators policy. Please review/comment/improve. Summary: 2 years, notify curator's user page, then remove rights after 1 month: [[Wikiversity:Curators#Inactivity]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 08:59, 24 April 2026 (UTC)
:: @[[User:Jtneill|Jtneill]] I created [[Template:Inactive curator]] for this. Feel free to make any changes or improvements. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:29, 24 April 2026 (UTC)
:::Wondering, should we also have:
:::* {{tl|Inactive custodian}}
:::* {{tl|Inactive bureaucrat}}
:::or perhaps just a single template with a parameter(s) for the user right(s)/role(s)? e.g., 
:::* if a custodian is inactive for 2 years, then custodian and curator rights are to be removed and 
:::* if a bureaucrat is inactive for 2 years, then bureaucrat, custodian, and curator rights are to to be removed.
:::-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:58, 13 May 2026 (UTC)
:::: I would probably modify that template when we actually develop our own inactivity policy, because we're currently under the AAR (a steward notifies the colloquium with [[m:Admin activity review/Notice to communities]], and inactive advanced right holders with [[m:Admin activity review/Notice to inactive right holders]]). [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:16, 13 May 2026 (UTC)
:::::Ah, I see. Yes, that makes sense. Thankyou. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:21, 15 May 2026 (UTC)
: In that case, should we develop our own inactivity policy (e.g. on [[Wikiversity:Inactivity policy]] or [[Wikiversity:Support staff/Inactivity]])? I would list the general inactivity part, the process, etc. Once it's approved as a policy, I will [[m:Stewards' noticeboard|notify the stewards]]. Thoughts? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:30, 16 May 2026 (UTC)

==Curator inactivity review==
These curators haven't been active for &gt; 2 years. As per the [[Wikiversity:Curatorship|curatorship policy]]:
* [[Special:Log/Cody naccarato]] was notified on their talk page by [[User:Codename Noreste|Codename Noreste]] on 24 Apr 2026
* [[Special:Log/Praxidicae]] was notified on their talk page by [[User:Codename Noreste|Codename Noreste]] on 24 Apr 2026
* [[Special:Log/Tegel]] was notified on their talk page by [[User:Jtneill|Jtneill]] notified their talk page on 16 May 2026

The policy allows a month to hear from these users. If no response, a custodian will remove their curator rights.

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 06:14, 16 May 2026 (UTC)
: For Cody naccarato and Praxidicae, their rights are to be removed by the 19th of May if they don't respond either here or on their talk page. For Tegel, the removal will happen on the 16th of June, probably. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:13, 16 May 2026 (UTC)</text>
      <sha1>bhnaetk4repbo1dtui05sdgkzobma77</sha1>
    </revision>
    <revision>
      <id>2809774</id>
      <parentid>2809652</parentid>
      <timestamp>2026-05-16T23:09:02Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <comment>/* Inactivity policy for Curators */ Reply</comment>
      <origin>2809774</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="81187" sha1="cb74qatd6ip0ste65hgofo3abd62asb" xml:space="preserve">{{Wikiversity:Colloquium/Header}}
&lt;!-- MESSAGES GO BELOW --&gt;
== New titles for user right nominations ==
&lt;div class=&quot;cd-moveMark&quot;&gt;''Moved from [[Wikiversity talk:Candidates for Custodianship#New titles for user right nominations]].  [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 23:20, 17 April 2026 (UTC)''&lt;/div&gt;

I would like to propose the following retitles should a user be nominated for any of the following user rights:
* Curator: Candidates for Curatorship
* Bureaucrat: Candidates for Bureaucratship
The reason is that many curator (and probably bureaucrat) requests have run solely under {{tq|Candidates for Custodianship}}, but that title might sound misleading (especially in regards to the permission a user is requesting). CheckUser and Oversight (suppressor) are not included above since no user was nominated for these sensitive permissions, probably. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 01:30, 19 March 2026 (UTC)

:And it's not that when someone at the beginning misplaced the request, no one thought to move it and the others copied it. Even today, it would be possible to simply take it all and move it. Otherwise, for me, the more fundamental problem is that there is [[Wikiversity:Curators|no approved policy for curators]] than where the requests are based. Curators then operate in a certain vacuum and if one of them &quot;breaks out of the chain&quot;, the average user doesn't have many transparent tools to deal with it, because there is no policy. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:02, 19 March 2026 (UTC)
::I am not talking about the curator page (policy proposal). [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 19:08, 21 March 2026 (UTC)
: @[[User:Juandev|Juandev]] I'll see if I can do an overhaul of [[Wikiversity:Candidates for Custodianship]], just like I recently did with the Requests for adminship page on English Wikiquote. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 22:17, 18 April 2026 (UTC)
:Yes, great idea - ideally there will be separate &quot;Candidates for ...&quot; pages for each user right group. The most important for now is to separate curator and custodian pages as CN suggests. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:39, 1 May 2026 (UTC)
:So maybe I previously misunderstood. Are you proposing separated pages for nominations (i.e. [[Wikiversity:Candidates for Curatorship]], [[Wikiversity:Candidates for Bureaucratship]], [[Wikiversity:Candidates for Custodianship]])? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:30, 5 May 2026 (UTC)
:: Yes. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:33, 5 May 2026 (UTC)
:::I see, then I am fine with that @[[User:Codename Noreste|Codename Noreste]]. Sorry for misunderstanding. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:35, 9 May 2026 (UTC)

I've split the user rights nomination pages into:
* [[Wikiversity:Candidates for CheckUser]]
* [[Wikiversity:Candidates for Curatorship]]
* [[Wikiversity:Candidates for Custodianship]]
* [[Wikiversity:Candidates for Bureaucratship]]

Please review. There are likely several links to update, text to adjust, categories to manage, short-cuts to fix etc. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:22, 10 May 2026 (UTC)

:Thanks, great job @[[User:Jtneill|Jtneill]]. I am wondering if we need to move archived nominations too, or if we are OK with the actual state. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:08, 10 May 2026 (UTC)
::Yes, I think that would be helpful. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:46, 10 May 2026 (UTC)
:::I can do it @[[User:Jtneill|Jtneill]], I am just looking what system is there. I can see [[Wikiversity:Candidates for Custodianship/Archive of nominations for full custodianship]] which is a good complementary overview to the subpages with full history. The name of the pages is probably stably, but I would consider to create more specific redirect like [[Wikiversity:Candidates for Custodianship/Overview of staff nominations]], which would link to the above one. Then there is a [[Wikiversity:Candidates for Custodianship/Archived]], which are probably incomplete nominations, right? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:37, 11 May 2026 (UTC)
::::Tx @[[User:Juandev|Juandev]]. Yes, this makes sense. And maybe we move:
::::* archived '''curator''' nominations from [[Wikiversity:Candidates for Custodianship/Archive of nominations for full custodianship]] to e.g., [[Wikiversity:Candidates for Curatorship/Archive of nominations]]
::::* archived '''bureaucrat''' nominations from [[Wikiversity:Candidates for Custodianship/Archive of nominations for full custodianship ]] to e.g., [[Wikiversity:Candidates for Bureaucratship/Archive of nominations]]
::::-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:12, 11 May 2026 (UTC)
:::::OK. That sounds good. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:25, 12 May 2026 (UTC)
:An svg icon for [[Wikiversity:Curatorship|curators]] would also be helpful. We have them for other user rights: [[c:Category:Wikiversity user rights icons]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:54, 10 May 2026 (UTC)
::Done: [[Wikiversity:Curators]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 01:44, 11 May 2026 (UTC)

== Technical Request:  Courtesy link.. ==

[[Template_talk:Information#Background_must_have_color_defined_as_well]] [[User:ShakespeareFan00|ShakespeareFan00]] ([[User talk:ShakespeareFan00|discuss]] • [[Special:Contributions/ShakespeareFan00|contribs]]) 11:43, 20 March 2026 (UTC)
: I can't edit the template directly as it need an sysop/interface admin to do it. [[User:ShakespeareFan00|ShakespeareFan00]] ([[User talk:ShakespeareFan00|discuss]] • [[Special:Contributions/ShakespeareFan00|contribs]]) 11:43, 20 March 2026 (UTC)
:: Also if the Template field of - https://en.wikiversity.org/wiki/Special:LintErrors/night-mode-unaware-background-color is examined, there is poential for an admin to clear a substantial proportion of these by implmenting a simmilar fix to the indciated templates (and underlying stylesheets). It would be nice to clear things like Project box and others, as many other templates (and thus pages depend on them.) :)
[[User:ShakespeareFan00|ShakespeareFan00]] ([[User talk:ShakespeareFan00|discuss]] • [[Special:Contributions/ShakespeareFan00|contribs]]) 11:43, 20 March 2026 (UTC)

:I think it would be best to grant you interface admin rights for a short period of time to make these changes. However, I still have doubts about the suitability of this solution, which may cause other problems and no one has explained to me why dark mode has to be implemented this way @[[User:ShakespeareFan00|ShakespeareFan00]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:43, 20 March 2026 (UTC)

: I would have reservations about holding such rights, which is why I was trying to do what I could without needing them. However if it is the only way to get the required changes made, I would suggest asking on Wikipedia to find technical editors, willing to undertake the changes needed. [[User:ShakespeareFan00|ShakespeareFan00]] ([[User talk:ShakespeareFan00|discuss]] • [[Special:Contributions/ShakespeareFan00|contribs]]) 09:32, 21 March 2026 (UTC)

== WikiEducator has closed ==

Some of you may know of a similar project to Wikiversity, called [https://wikieducator.org/Main_Page WikiEducator], championed by [https://oerfoundation.org/about/staff/wayne-mackintosh/ Wayne Mackintosh][https://www.linkedin.com/posts/waynemackintosh_important-notice-about-the-oer-foundation-activity-7405113051688931329-Nhm9/][https://openeducation.nz/killed-not-starved/].

It seems [https://openeducation.nz/terminating-oer-foundation their foundation has closed] and they are no longer operating.

They had done quite a bit of outreach (e.g., in the Pacific and Africa) to get educators using wiki.

The WikiEducator content is still available in MediaWiki - and potentially could be imported to Wikiversity ([https://wikieducator.org/WikiEducator:Copyrights CC-BY-SA] is the default license).

The closing of WikiEducator arguably makes the nurturing of Wikiversity even more important.

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:09, 1 April 2026 (UTC)

:I was never active there. If anyone has an account or is otherwise in contact, we may want to copy relevant information here or even at [[:outreach:]]. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 04:46, 1 April 2026 (UTC)

:: I reached out to [[User:Mackiwg~enwikiversity|Wayne]] in January, and he responded briefly but positively (while travelling).  I wrote to the low-traffic wikieducator mailing list today and got a nice [https://groups.google.com/g/wikieducator/c/r_yIyUw6ZIA reply] from [[user:SteveFoerster|Steve Foerster]] who's interested in helping. If we can figure out a migration path it would be great to adopt at least the main namespace pages here.  
:: A few questions that come to mind: 
:: - would people want to create matching user accounts
:: - are there any namespaces (user/talk?) that should not be moved over
:: We could look at how this was done for the [[m:Wikivoyage/Migration]] wikivoyage migration. &lt;span style=&quot;padding:0 2px 0 2px;background-color:white;color:#bbb;&quot;&gt;&amp;ndash;[[User:Sj|SJ]][[User Talk:Sj|&lt;span style=&quot;color:#ff9900;&quot;&gt;+&lt;/span&gt;]]&lt;/span&gt; 04:27, 1 May 2026 (UTC)
:::That's fantastic, SJ, that you've reached out and that Wayne, Steve, and Jim are receptive—and that you can help! -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:52, 1 May 2026 (UTC)
::::A matching accound makes sense to give credits to the original authors and keep a clean chain of versions. The initial commit into wikiversity could have a &quot;marker with timestamp&quot; similar to signature with a reference where the content's source or a Web archive. This would allow authors to continue there work on wikiversity if they wish. [[User:Bert Niehaus|Bert Niehaus]] ([[User talk:Bert Niehaus|discuss]] • [[Special:Contributions/Bert Niehaus|contribs]]) 06:30, 15 May 2026 (UTC)

== Wikinews is ending ==

Apparently mainly due to low editorial activity, low public interest, but also failure to achieve the goals from the proposal for the creation of the project, the Wikinews project is ending after years of discussions ([[Meta:Proposal for Closing Wikinews|some reading]]).

And I would be interested to see how Wikiversity is doing in the monitored metrics. We probably have more editors than Wikinews had, but what about consumers and achieving the goals? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 19:14, 1 April 2026 (UTC)

:Wikiversity's biggest issue in recent times was the hosting of low-quality, trash content. Thankfully we've done a great job in removing pseudoscience and other embarrassingly trash content (Wikidebates, for example), but the biggest concern moving forward is proper maintenance IMO. I've caught several pseudoscience pages being created within the last few months that could easily have flown under the radar (ex, [[The Kelemen Dilemma: Causal Collapse and Axiomatic Instability]]), so I'd urge our custodians/curators to be on the lookout for this type of content. Usually an AI-overview can point this type of content out relatively well.
:In terms of visibility, I believe Wikiversity is a high-traffic project. I remember my [[Mathematical Properties]] showing up on the first page of Google when searching up &quot;math properties&quot; for the longest time (and is still showing up in the first page 'till this day!). Besides, Wikinews hosted a lot of short-term content (the nature of news articles), while Wikiversity hosts content that can still be useful a decade later (ex, [[A Reader's Guide to Annotation]]). 
:I think we are on a better path than we were a few months ago, and I do want to thank everyone here who has been helping out with maintaining our website! —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 20:48, 1 April 2026 (UTC)
:For what it's worth, the group that did that study has since disbanded, so no one is monitoring the other sister projects in the same way. Additionally, Wikinews had some catastrophic server issues due to the maintenance of [[:m:Extension:DynamicPageList]] which don't apply here. Your questions are still worth addressing, but I just wanted to cut off any concern at the pass about Wikiversity being in the same precarious situation. Wikiversity is definitely the biggest &quot;lagging behind&quot; or &quot;failure&quot; project now that Wikinews is being shuttered, but I don't see any near- or medium-term pathway to closing Wikiversity. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 00:46, 2 April 2026 (UTC)

:[[w:en:Wikipedia:Wikipedia Signpost/2026-03-31/News and notes|Entirety of Wikinews to be shut down]] (Wikipedia Signpost) -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:03, 11 April 2026 (UTC)

== Action Required: Update templates/modules for electoral maps (Migrating from P1846 to P14226) ==

Hello everyone,

This is a notice regarding an ongoing data migration on Wikidata that may affect your election-related templates and Lua modules (such as &lt;code&gt;Module:Itemgroup/list&lt;/code&gt;).

'''The Change:'''&lt;br /&gt;
Currently, many templates pull electoral maps from Wikidata using the property [[:d:Property:P1846|P1846]], combined with the qualifier [[:d:Property:P180|P180]]: [[:d:Q19571328|Q19571328]]. 

We are migrating this data (across roughly 4,000 items) to a newly created, dedicated property: '''[[:d:Property:P14226|P14226]]'''.

'''What You Need To Do:'''&lt;br /&gt;
To ensure your templates and infoboxes do not break or lose their maps, please update your local code to fetch data from [[:d:Property:P14226|P14226]] instead of the old [[:d:Property:P1846|P1846]] + [[:d:Property:P180|P180]] structure. A [[m:Wikidata/Property Migration: P1846 to P14226/List|list of pages]] was generated using Wikimedia Global Search.

'''Deadline:'''&lt;br /&gt;
We are temporarily retaining the old data on [[:d:Property:P1846|P1846]] to allow for a smooth transition. However, to complete the data cleanup on Wikidata, the old [[:d:Property:P1846|P1846]] statements will be removed after '''May 1, 2026'''. Please update your modules and templates before this date to prevent any disruption to your wiki's election articles.

Let us know if you have any questions or need assistance with the query logic. Thank you for your help! [[User:ZI Jony|ZI Jony]] using [[User:MediaWiki message delivery|MediaWiki message delivery]] ([[User talk:MediaWiki message delivery|discuss]] • [[Special:Contributions/MediaWiki message delivery|contribs]]) 17:11, 3 April 2026 (UTC)
&lt;!-- Message sent by User:ZI Jony@metawiki using the list at https://meta.wikimedia.org/w/index.php?title=Distribution_list/Non-Technical_Village_Pumps_distribution_list&amp;oldid=29941252 --&gt;
:I didnt find such properties, so we are probably fine. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:00, 12 April 2026 (UTC)
:: +1 (agreed). [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 22:19, 12 April 2026 (UTC)

== Enable the abuse filter block action? ==

In light of [[Special:AbuseLog/80178]] (coupon spam), I would like to propose enabling the block action for the abuse filter. Only custodians will be able to enable and disable that action on an abuse filter, and it is useful to block ongoing vandalism. Thoughts? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 19:12, 13 April 2026 (UTC)

:Seems like a good idea, almost all of the users which create such pages are spambots so this shouldn’t be a problem. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 23:41, 13 April 2026 (UTC)
:Can you explain some more (I am new to abuse filters)? It looks like the attempted edit was prevented? Which abuse filter?
:Note on your suggestion, have also reactivated Antispam Filter 12 - see [[WV:RCA]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:45, 15 April 2026 (UTC)
:: I am proposing that we activate the abuse filter block action, which if a user triggers an abuse filter, it would actually block the user in question - the same mechanism that a custodian would use to block users. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:11, 15 April 2026 (UTC)
:::OK, thankyou, that makes sense. And, reviewing the abuse filter 12 log, it would be helpful because it would prevent the need for manual blocking. But I don't see a setting for autoblocking? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 23:14, 15 April 2026 (UTC)
:::: I think it probably adds an autoblock. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 00:43, 16 April 2026 (UTC)
: [[User:Jtneill|Jtneill]] and [[User:PieWriter|PieWriter]], given that a little bit more than a week has passed and there is minimal consensus to activate the abuse filter block action, I filed [[phab:T424053]]. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:05, 21 April 2026 (UTC)
::Thank-you for doing this. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 08:03, 24 April 2026 (UTC)

== Advice needed: A Neurodiversity-inspired Idea/observation ==

If I want the greatest participation of others to &quot;provide constructive criticism to my idea&quot; or to &quot;shoot down my idea&quot; or &quot;idea&quot;.

What I've called it so far is &quot;The Neurodiversity-inspired Idea&quot;. At other times I used more sensationalist wording but here on Wikiversity I don't dare do that. I actually woke up with thinking about putting this into my userspace draft: &quot;Personal Observations Made By Meeting Autistic and Non-Autistic Adults&quot;.

My ultimate goal is to stop blathering about my &quot;idea&quot; to friend and family without feeling my &quot;methodology&quot; is going into any progressive direction whatsoever. My latest encounter was somewhat constructive though. A friend of a friend who worked with people presenting ideas in attempting to getting grants. I don't want a grant. I just want to figure out how I can express my &quot;idea&quot; in a way so that I can more clearly figure out what flaws it got.

At the same time I tend to overthink. If anyone thinks etherpad might be a good place and considering Wikimedia already got an etherpad at https://etherpad.wikimedia.org/ if anyone feels like they know me better in the future feel free to suggest a &quot;session&quot; on etherpad.

'''If I don't receive a reply to this in 1 week's time I will begin to explore this &quot;idea&quot; into my userspace''' unless you replied and refrained me from doing so, of course. Then maybe after &quot;developing it there&quot; I might reference it to you another future time here in the Colloquium, with my &quot;idea&quot; still in my userspace draft. This &quot;idea&quot; is sort of a burden, I'm happy I've made the choice to get rid of it and hopefully move on with my life, unless there is something to this &quot;idea&quot;. 

My failure is probably evident: I feel I haven't told you anything. Same happened to when I talked to friends and family. In danger of overthinking it further I'll publish this right now. I need to &quot;keep it together&quot; [[User:ThinkingScience|ThinkingScience]] ([[User talk:ThinkingScience|discuss]] • [[Special:Contributions/ThinkingScience|contribs]]) 10:36, 16 April 2026 (UTC)

:Good on you putting it out there ... and hitting publish :). I'd say go for it (no need to wait), give birth to your idea and share about it here and elsewhere. Let it take shape and see where it might go. In many ways, this is exactly what an open collaborative learning community should be doing. Others might not know well how to respond, so perhaps consider creating some questions to accompany the idea. Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:21, 16 April 2026 (UTC)
::Thank you for encouraging me in developing the idea.
::I have created a &quot;questions&quot; section in the draft which is visible in the table of contents now. My brain was &quot;frozen&quot; today metaphorically speaking in that I felt I had like a &quot;writer's block&quot; so the draft has more &quot;AI/LLM&quot; content than before. I used the LLM for generating questions. The answers are so far human-only.
::I've also created a subsection where I could add the prompts that made the LLM generate the questions. That could help people make better prompts perhaps. I've described what it is about inside of it and there are some chaotically written notes.
::[[Draft:The_Neurodiversity-inspired_Idea#Questions_that_might_encourage_the_development_of_this_idea_and_its_methodology]]
::My draft is missing stuff. Any questions that you contribute to my draft will probably help me and if I don't understand the questions I'll probably notify you and also at the same time &quot;feed them&quot; to an LLM and ask in my input like &quot;explain in simple words what this question means, what is it searching for?&quot; etc. while I wait for an answer. If you have any more feedback please give it to me here or on the Draft page, its talk page or my user talk page. Thank you for helping me! [[User:ThinkingScience|ThinkingScience]] ([[User talk:ThinkingScience|discuss]] • [[Special:Contributions/ThinkingScience|contribs]]) 21:20, 18 April 2026 (UTC)
::Today I woke up with not only thinking about supplying questions along with the &quot;idea&quot; but also answers. ie. Is it possible to &quot;test&quot; this idea? Is it possible to create one or multiple hypotheses based on this &quot;idea&quot;?(etc.) I've thought about this before in this &quot;idea&quot; but since I'm beginning to add to Wikiversity what was previously 'locked in my mind' it's also easier for me to see what I've done so far. Thank you for this comment! [[User:ThinkingScience|ThinkingScience]] ([[User talk:ThinkingScience|discuss]] • [[Special:Contributions/ThinkingScience|contribs]]) 09:11, 23 April 2026 (UTC)
:May I think that you should not add deadlines ; being read, and rising interest for collaboration, or even simply for exchange of thoughts, such an effective meeting event loads a huge bunch of unprobability, which time can help to… somehow diminish. Maybe, I would advice you having a central place for developping your ideas, your needs, your advances, maybe a page in your own user zone, and from time to time, depending your feeling, it could be every trimester or so, or more frequently, you could write a short account of progress (or even of no progress), or a call for participation, in such a place as this present one ; I think that will increase much exposure of your projet. Maybe also, if you can find a project name, not necessarily very meaningfull by itseilf (at least it will gain signification with time, as your project develops), that will serve as a kind-of hook, and make your announcement titles more visible. Best regards (and my excuses for my poor command of English, which seems to be unplease an anti-abuse filter, &quot;Questionable Language (profanity)&quot;, which I don't understand…). My few cents. --  [[User:Eric.LEWIN|Eric.LEWIN]] ([[User talk:Eric.LEWIN|discussion]] • [[Special:Contributions/Eric.LEWIN|contributions]]) 10:06, 17 April 2026 (UTC)
::Sorry about the false positive on the profanity filter - I've fixed it. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:26, 17 April 2026 (UTC)
:::&quot;May I think that you should not add deadlines ; being read, and rising interest for collaboration, or even simply for exchange of thoughts, such an effective meeting event loads a huge bunch of unprobability, which time can help to… somehow diminish.&quot;
::Thank you Eric for this comment. Trust in time is how I interpret it. I should not feel like I need to be in a hurry. I'll try to give this time. Thank you!
:::&quot;Maybe, I would advice you having a central place for developping your ideas, your needs, your advances, maybe a page in your own user zone, and from time to time, depending your feeling, it could be every trimester or so, or more frequently, you could write a short account of progress (or even of no progress), or a call for participation, in such a place as this present one ; I think that will increase much exposure of your projet.&quot;
::A central place for developing or making &quot;project notes&quot; regarding the Neurodiversity idea on my userspace, I might need that, like a diary or &quot;project notes&quot; of the Neurodiversity idea similar to my course notes regarding my experience with Coursera.
::Any actions I take are going to be related to my Userspace from now on but I'll also update the draft when necessary. Now in the beginning I might be working daily to once every 3 days on both the draft and the daily notes I plan to make.
:::&quot;Maybe also, if you can find a project name, not necessarily very meaningfull by itseilf (at least it will gain signification with time, as your project develops), that will serve as a kind-of hook, and make your announcement titles more visible.&quot;
::Thank you for the advice. I was brainstorming yesterday about it. I concluded that since I've not yet developed a methodology that adheres to &quot;Do no harm&quot; and this is my first time working my &quot;idea&quot; into a way that is compatible with how projects develop on English Wikiversity this is new to me. My methodology isn't developed and therefore trying to get attention to my project through a name can wait. Yesterday I figured out a silly title that has nothing to do with the project: &quot;Planetary Awareness Potato Cabbage Rolls&quot; or something like that. Google output read that no such thing exists so I wanted it mainly to be unique. I don't want to raise attention that I'm unsure whether I'll actually be capable of developing a methodology for but project notes is my best bet so far in tracking my progress. Every day I think about this &quot;idea&quot; but I need to improve the important parts.
:::&quot;Best regards (and my excuses for my poor command of English, which seems to be unplease an anti-abuse filter, &quot;Questionable Language (profanity)&quot;, which I don't understand…). My few cents.&quot;
::You added great points and I felt that I was helped by you! I encourage you to post again and I can understand that interacting with any kind of automated filter can be discouraging and can be for me too! Thank you for giving me feedback! [[User:ThinkingScience|ThinkingScience]] ([[User talk:ThinkingScience|discuss]] • [[Special:Contributions/ThinkingScience|contribs]]) 16:01, 18 April 2026 (UTC)

== Add some user rights to the curator user group? ==

By default, only custodians have the ability to mark new pages as patrolled (&lt;code&gt;patrol&lt;/code&gt;) and have their own page creations automatically marked as patrolled (&lt;code&gt;autopatrol&lt;/code&gt;). I am proposing both of the following:
* Curators can mark new pages as patrolled, helping on reducing the backlog of new, unpatrolled pages.
* New pages made by curators will be automatically marked as patrolled by the MediaWiki software.
Before we implement this, I would suggest implementing a proposed guideline for marking new pages as patrolled for curators and custodians.

Thoughts? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 16:32, 17 April 2026 (UTC)

:Agree, &lt;s&gt;also can we also allow curators to undelete pages since they already have the rights to delete them?&lt;/s&gt; [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 02:54, 18 April 2026 (UTC)
::I think the requirement that undelete NOT be included came from above (meta / stewards / central office). Having access to the undelete page gives access to information that is restricted by their policies to admins (custodians and bureaucrats). -- [[User:Dave Braunschweig|Dave Braunschweig]] ([[User talk:Dave Braunschweig|discuss]] • [[Special:Contributions/Dave Braunschweig|contribs]]) 20:12, 18 April 2026 (UTC)
::: [[User:PieWriter|PieWriter]], unless if requests for curator and custodian should be RfA-like processes (that is, including voting and comments), then I have to agree with Dave above. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 22:03, 18 April 2026 (UTC)
::::Oh, I didn’t realise that. Withdrawing my comment.. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:08, 19 April 2026 (UTC)
:{{support}} Seems reasonable and would reduce overhead. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 14:35, 18 April 2026 (UTC)
:'''Agree''', implement it also to [[Wikiversity:Curators]] proposal please. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:11, 18 April 2026 (UTC)
: I went ahead and filed [[phab:T424445]]. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:39, 26 April 2026 (UTC)

== [[Wikiversity:Curators|Curators and curators policy]] ==
{{archive top|There is strong consensus, so [[Wikiversity:Curators]] is now a policy. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:15, 9 May 2026 (UTC)}}
How does it come, that Wikiversity has curators, but Curators policy is still being proposed? How do the curators exists and act if the policy about them havent been approved yet? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:33, 16 October 2025 (UTC)

:It looks as if it is not just curators. The policy on Bureaucratship is still being proposed as well. See [[Wikiversity:Bureaucratship]]. —[[User:RailwayEnthusiast2025|&lt;span style=&quot;font-family:Verdana; color:#008000; text-shadow:gray 0.2em 0.2em 0.4em;&quot;&gt;RailwayEnthusiast2025&lt;/span&gt;]] &lt;sup&gt;[[User talk:RailwayEnthusiast2025|&lt;span style=&quot;color:#59a53f&quot;&gt;''talk with me!''&lt;/span&gt;]]&lt;/sup&gt; 18:33, 27 October 2025 (UTC)

:I think its just the nature of a small WMF sister project in that there are lots of drafts, gaps, and potential improvements. In this case, these community would need to vote on those proposed Wikiversity staff policies if we think they're ready. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:08, 3 December 2025 (UTC)
:What? I thought you were getting it approved, Juandev... :) [[User:I&amp;#39;m Mr. Chris|I&amp;#39;m Mr. Chris]] ([[User talk:I&amp;#39;m Mr. Chris|discuss]] • [[Special:Contributions/I&amp;#39;m Mr. Chris|contribs]]) 14:20, 12 February 2026 (UTC)
::Yeah I think this one is important too and we need to aprove it too @[[User:I'm Mr. Chris|I'm Mr. Chris]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 15:56, 12 February 2026 (UTC)
:::I thinks its ready to made into a policy, it seems to be complete and informative about what the rights does and how to get it. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 03:08, 15 February 2026 (UTC)
::::Agree -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:00, 27 March 2026 (UTC)

Let's make this the official discussion about adopting the [[Wikiversity:Curators|curators policy]] policy. Your comments are invited and welcome. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 08:40, 24 April 2026 (UTC)
: There were two similar Colloquium threads in separate places about the proposed curators policy. So I've moved them to be adjacent. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 12:42, 1 May 2026 (UTC)
{{archive bottom}}

== Wikiversity:Curators to become a policy ==
{{archive top|There is strong consensus, so [[Wikiversity:Curators]] is now a policy. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:16, 9 May 2026 (UTC)}}
I've looked at the discussions about the Curators policy, I've looked at the practices, and it seems to me that there is no dispute about the wording of the policy, and what's more, the community has been using this proposal as if it were an offical policy for several years. Therefore, I propose that [[Wikiversity:Curators]] become a policy. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:35, 18 April 2026 (UTC)

:{{support}} —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:54, 18 April 2026 (UTC)
:{{support}} —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 20:21, 18 April 2026 (UTC)
: {{support|Yes, please}}. Especially after when I and PieWriter proposed above, I agree. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:27, 24 April 2026 (UTC)
:: @[[User:Juandev|Juandev]]; as of now, curators now have the user rights &lt;code&gt;autopatrol&lt;/code&gt; and &lt;code&gt;patrol&lt;/code&gt;. Perhaps we should also include that in [[Wikiversity:Custodianship]]? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 12:07, 30 April 2026 (UTC)
:::You meant [[Wikiversity:Curators]] @[[User:Codename Noreste|Codename Noreste]]? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:15, 5 May 2026 (UTC)
:::: I agree that we must develop what rules curators should follow when marking new pages as patrolled; the same can be added for custodians since they can also mark new pages as patrolled. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:37, 5 May 2026 (UTC)
:::::I see, well I think you can just add this to the policy. It is not major change and it probably reflects actual practice or actual technical possibilities for those flags. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:20, 7 May 2026 (UTC)
:{{support}} -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 12:42, 1 May 2026 (UTC)
:{{Support}} per nom. [[User:PhilDaBirdMan|PhilDaBirdMan]] ([[User talk:PhilDaBirdMan|discuss]] • [[Special:Contributions/PhilDaBirdMan|contribs]]) 13:32, 1 May 2026 (UTC)
{{Archive bottom}}

== Inactive curators ==

Hello, even though [[Wikiversity:Curators]] is not a policy yet, there are curators listed here that have been inactive for two years or more:
* {{user|Cody naccarato}} (last edit on 13 Dec 2022, last logged action on 10 Dec 2022)
* {{user|Praxidicae}} (last edit on 10 Sep 2022, last logged action on 12 Sep 2022)
[[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 21:14, 19 April 2026 (UTC)

:Yup, I would remove the rights. To get the rights back if theyll come back should not be a big deal. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:08, 24 April 2026 (UTC)
:: When they don't reply by May 19, feel free (or any custodian) to do so. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 00:28, 25 April 2026 (UTC)

== Is anyone interested in Neurodiversity? ==

Is anyone interested in Neurodiversity? Is there anyone here who is interested for Neurodiversity to be &quot;something more&quot; than it already is? Does anyone here consider Neurodiversity one of the &quot;harder topics&quot; to work on or discuss? Does anyone here have an opinion about the [[Neurodiversity Movement]]? So these questions don't appear like &quot;out of a vacuum&quot; I can tell you a bit about my background:

Many years ago I got a psychiatric diagnosis &quot;Asperger's&quot;. After I stepped out of the office and my Äsperger's was 'concluded', I stepped out into the street and thought my first negative thought(but the positive thought followed after). The thought was about concentration camps in the second world war and that the world seemed to be going into the direction of &quot;labeling others&quot;. I was unsure whether this was &quot;real science&quot; and sort of &quot;challenged myself&quot; to make up my own mind after meeting people that had been given this diagnosis. The more adults with this diagnosis I met the more I started seeing &quot;patterns&quot;.

Was it a coincidence that the first person with Asperger's I met reminded me about my father later after I had plenty of times of experience with interacting with him? None of the people I interacted with online through IRC text chat...I felt I got any clue about how &quot;their brains work&quot;. Only when I met one person from the Asperger's chat community in person we both realized that whatever we experienced was akin to the &quot;chaos theory&quot;. He told me about &quot;chaos theory&quot; while I didn't know even what that term meant but I guess I 'read between the lines'. My question that I linger on still today is &quot;did he understand about me what I think I understood about him?&quot;? That our brains had the same configuration? Most autistic adults who meet other autistic adults usually get disappointed. They think the diagnosis will help them meet somebody like themselves and then they realize the great diversity in the autistic spectrum created by Psychiatry.

I later stopped interacting with autistic communities that much, I felt that it did not benefit me. Also Neurodiversity's &quot;neurotypes&quot; interested me for a while until I realized I had &quot;misunderstood everything&quot; about them and how they are used in the Neurodiversity Movement or &quot;Neurodiversity community&quot; if that even can precisely be defined? I doubt it but if you want to contribute to the [[Neurodiversity Movement]]. My previous attempts failed as I got more and more confused. I think a community project needs a community. With a lack of that I don't think it is worth my time. If any of you would like to work on that project let me know on my talk page.

So I was kinda lost and was talking to my friend and psychologist and I realized if I never talk about my idea to anyone in a &quot;comprehensive way&quot; or show that it matters to me nothing is going to ever happen. So I started talking about my &quot;idea&quot; more. Nobody could understand the &quot;idea&quot; because I had not developed my skills regarding where to start...although the process had already started &quot;automatically&quot; and that's why I often think of &quot;well my brain sort of activated me&quot;. I don't feel like I did have a plan and this idea happened. It happened &quot;by itself&quot;. My brain reacted to what I was seeing in a video or stream.

I value interaction highly in this idea. I think it would be helpful to make a community of people who are not paranoid about stuff that can express itself like &quot;don't analyze me!&quot;, &quot;don't compare me to anyone!&quot;. 

On the contrary, more often than not those adults who were diagnosed were actually openly comparing themselves with each other and I think that is healthy in a &quot;science&quot; way if done the &quot;right way&quot; which probably means &quot;Do no harm&quot;.

I found video material is important but I'm very unsure if uploading own video material to Wikimedia Commons would constitute a &quot;reasonable&quot; use of the resources there. Maybe somebody here needs to ask more questions to me that I should answer before that happens. I also know the '''be bold''' so I could just do what I think might be ok. Though I work better in a group as long as I know what &quot;group configurations&quot; help me. This is in a non-profit way. Since the state supported me this might be a way I am trying to &quot;give back&quot; to the state and &quot;the world&quot;. May seem overly ambitious and crazy but this thing gives me energy. It gives me hope when trying to develop this idea. [[User:ThinkingScience|ThinkingScience]] ([[User talk:ThinkingScience|discuss]] • [[Special:Contributions/ThinkingScience|contribs]]) 10:47, 23 April 2026 (UTC)

:Thanks for sharing. There is plenty of room for neurodiversity community learning. However, the challenge I think is that the intersection of those interested in (a) ND, and (b) English Wikiversity might be very small (e.g., 1!) at this point in time.
:But don't give up hope. For example, Wikipedia has many more ND-interested editors; maybe consider reaching out to see who might be interested:
:[[w:Category:Wikipedians interested in neurodiversity]]
:You could also start an equivalent category here:
:[[:Category:Wikiversitarians interested in neurodiversity]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:46, 6 May 2026 (UTC)

== Request for comment (global AI policy) ==

&lt;bdi lang=&quot;en&quot; dir=&quot;ltr&quot; class=&quot;mw-content-ltr&quot;&gt;A [[:m:Requests for comment/Artificial intelligence policy|request for comment]] is currently being held to decide on a global AI policy. {{int:Feedback-thanks-title}} [[User:MediaWiki message delivery|MediaWiki message delivery]] ([[User talk:MediaWiki message delivery|discuss]] • [[Special:Contributions/MediaWiki message delivery|contribs]]) 00:58, 26 April 2026 (UTC)&lt;/bdi&gt;
&lt;!-- Message sent by User:Codename Noreste@metawiki using the list at https://meta.wikimedia.org/w/index.php?title=Distribution_list/Global_message_delivery&amp;oldid=30424282 --&gt;

== Language learning  ==

toki! I am trying to add or see what the toki pona language learning stuff on here is but I don't see anything that is language learning for anything. [[User:Jan Imon|Jan Imon]] ([[User talk:Jan Imon|discuss]] • [[Special:Contributions/Jan Imon|contribs]]) 23:13, 2 May 2026 (UTC) —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 17:29, 3 May 2026 (UTC)

:We have language materials ([[:Category:Languages]], [[World Languages]], [[Portal:Foreign Language Learning]], [[Portal:Multilingual Studies]]). They are not as developed as I think we would all like and there's not any coverage of Toki Pona, but in principle, we could and would like that. You can also see [[:b:Subject:Languages]] at our sister project Wikibooks. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 17:33, 3 May 2026 (UTC)

== Timeline format? ==

I’ve been working on the World War II articles, including the [[World War II/Timeline|timeline]], and is there a specific timeline format that should be used? Right now it’s just a table, and there’s no separation between different periods/phases of the war.

I don’t want to use [[mw:Extension:EasyTimeline]] because this will be displaying dates and not time periods. [[User:PhilDaBirdMan|PhilDaBirdMan]] ([[User talk:PhilDaBirdMan|discuss]] • [[Special:Contributions/PhilDaBirdMan|contribs]]) 01:35, 4 May 2026 (UTC)

:I dont think we have a policy or guideline, how to format a timeline. But you may try to browes wikiversity by Google if someone was dealing with this in the past somewhow @[[User:PhilDaBirdMan|PhilDaBirdMan]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:23, 5 May 2026 (UTC)
::+1 - there's no specific guideline on how to format a timeline, it's really up to you. In my opinion I think the timeline is good. I'd personally bold the dates just to make it easier to separate it from the event description, but that's my personal 2 cents. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 14:18, 5 May 2026 (UTC)
:::I’ll probably remove links to the dates/years, they’re just Wikipedia pages that shouldn’t be over linked to. [[User:PhilDaBirdMan|PhilDaBirdMan]] ([[User talk:PhilDaBirdMan|discuss]] • [[Special:Contributions/PhilDaBirdMan|contribs]]) 00:39, 6 May 2026 (UTC)

== Interface administrator for Codename Noreste ==
{{Archive top|After running for a week, there is clear consensus for [[User:Codename Noreste]] to have Interface admin rights for 120 days; implemented until 10 September, 2026 -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 22:36, 12 May 2026 (UTC)}}

Hello, everyone. I am requesting interface administrator access on this wiki.

The main reasoning is that I would benefit from having the user right &lt;code&gt;editinterface&lt;/code&gt;, which would allow me to make dark mode changes to pages in the MediaWiki namespace, add &lt;code&gt;&lt;nowiki&gt;&lt;div class=&quot;mw-parser-output&quot;&gt;&lt;/nowiki&gt;&lt;/code&gt; to some interface pages using templates, handle interface-protected edit requests, and similar stuff. Additionally, I have some knowledge of CSS, and I would like to assist with modifying CSS pages whenever necessary, such as moving MediaWiki common.css code to TemplateStyles CSS pages.

I am requesting the maximum time that is allowed per the [[Wikiversity:Interface administrators|policy]], and I have 2FA enabled on my account. Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 00:55, 6 May 2026 (UTC)

*{{support}} Globally trusted user. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 01:07, 6 May 2026 (UTC)
*{{support}} Trusted and knowledgeable. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:35, 6 May 2026 (UTC)
*{{support}} WV would benefit from this. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 08:32, 6 May 2026 (UTC)
*{{support}} --[[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:13, 7 May 2026 (UTC)

:{{Comment}} Could @[[User:Codename Noreste|Codename Noreste]] delete [[MediaWiki:Gadget-WikiSign.js]], which was requested to be deleted @[[User:Koavf|Justin]], @[[User:Jtneill|Jtneill]], @[[User:Atcovi|Atcovi]]? I dont think we need it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:40, 9 May 2026 (UTC)
::Yes - clearly no longer used -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:18, 9 May 2026 (UTC)
::: I can't delete it because I don't have the required permissions to do so.
::: On a side note, if this project has a need for permanent interface administrators, I would suggest that we have a minimum of two IAs, similar to how there must be two CUs and/or suppressors (or none). Maybe Koavf can be a good candidate if I am elected for permanent interface adminship, and I believe that permission shouldn't be removed from someone's own account. Instead, a bureaucrat should do it. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:20, 9 May 2026 (UTC)
::::I am willing and happy to do it, unfortunately, we do not have an appetite for indef IAs and just had a discussion that resulted in a [https://en.wikiversity.org/w/index.php?title=Wikiversity:Interface_administrators&amp;diff=prev&amp;oldid=2807543 consensus that we can have IAs that have the user rights for 14 to 120 days]. So once you have the rights, please make sure to gopher it. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 17:54, 9 May 2026 (UTC)
:::::@[[User:Koavf|Koavf]] give it time. Look at me, I was in favor of shorter time, now I am looking back to times, when custodians could do it without the need of extra flag. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:31, 9 May 2026 (UTC)
::::::Here's hoping. I think it would reduce administrative overhead, but that's just me and I'm not a bureaucrat here. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:33, 9 May 2026 (UTC)
::::Complicated. Where are the times, admins could do everything! [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:27, 9 May 2026 (UTC)
{{archive bottom}}

== [[Wikiversity:Bureaucratship]] to become a policy ==

Following the recent approval of [[Wikiversity:Curators]] as a policy, I think [[Wikiversity:Bureaucratship]] may also be ready for policy status.

Please share your views about whether bureaucratship is ready to become a policy, or whether further revisions are needed.

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 13:58, 9 May 2026 (UTC)
: I added a logo about that user group, but other than that, it looks good to me. {{support}}. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:38, 9 May 2026 (UTC)
:I think that the consensus on this policy is proven by years of using it without further changes. But I I have to say weather I agree with this to become a policy, than of course {{support}}. It works and there were no major issues with it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:45, 9 May 2026 (UTC)
:{{support}} no issues. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 14:51, 10 May 2026 (UTC)
:{{support}} [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 12:37, 11 May 2026 (UTC)
:{{support}} ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 06:51, 12 May 2026 (UTC)

== Reminder about custodian-related pages ==

I would like to remind the community about what the following custodian pages are:
* [[Wikiversity:Request custodian action]] is for requesting actions to be done by custodians, and
* [[Wikiversity:Notices for custodians]] is for notices of interest to custodians, like an administrator's noticeboard
Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:12, 12 May 2026 (UTC)

:Thanks - I needed this reminder :) -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 22:21, 12 May 2026 (UTC)

== [[MediaWiki:Protectedpagetext#Protected edit request on 11 December 2025]] ==

I posted an edit request there 5 months ago, so I’ll be taking it to this page. [[Special:Contributions/&amp;#126;2026-28640-56|&amp;#126;2026-28640-56]] ([[User talk:&amp;#126;2026-28640-56|talk]]) 23:33, 12 May 2026 (UTC)

:What exactly is the problem? I don't understand what needs to change and why. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 23:35, 12 May 2026 (UTC)
: Pinging @[[User:Atcovi|Atcovi]], @[[User:Jtneill|Jtneill]] and @[[User:Juandev|Juandev]] for further input. Someone is requesting a modification to [[MediaWiki:Protectedpagetext]] to use {{tlx|Protected page text}}, but we might need to discuss whether to use the template. In the meantime, I'll start a sandbox version of the protected page text template. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 23:19, 14 May 2026 (UTC)
::Sounds good -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:13, 15 May 2026 (UTC)

== Create a pseudo-bot user group? ==

I would like to propose adding a new user group to Wikiversity: Pseudo-bot (&lt;code&gt;flood&lt;/code&gt;). This will allow users to perform repetitive actions without flushing the recent changes feed (with only the &lt;code&gt;bot&lt;/code&gt; user right). However, I would suggest that for the pseudo-bot user group:
* It can be granted and revoked by custodians. However, can curators add and remove pseudo-bot from their own accounts (and not others)?
* Users can remove themselves from it.
* A guideline might be necessary about the information and usage of it.
Thoughts? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 03:31, 14 May 2026 (UTC)

:This sounds good. Which other wiki could we model this user group on? e.g., [[b:Wikibooks:Pseudo-bots]]? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:19, 15 May 2026 (UTC)
::@[[User:Jtneill|Jtneill]] Wikiquote has a similar group: [[:wikiquote:Special:ListGroupRights]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 04:25, 15 May 2026 (UTC)

== Coming over From wikinews ==
Any chance someone could help me if you are allowed to write news articles here since wikinews is going read only mode soon, thank you! [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 22:43, 1 May 2026 (UTC)

:The scope of Wikiversity is very broad and is basically about more-or-less any learning material. We have made it a point to not have duplicative content of other WMF projects, but since Wikinews is being shuttered, I personally am fine with writing news articles here. One thing that is not controversial at all is a learning resource &lt;em&gt;about&lt;/em&gt; how to write news: that could be hugely useful here and could involve the process of writing news stories to learn and to share back and forth with an editor or fact-checker. In fact, I'd support an entire namespace dedicated to keeping the notion of Wikinews alive here. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 23:38, 1 May 2026 (UTC)
::Thank you so much! How do I start? Cheers! @[[User:Koavf|Koavf]] [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 01:07, 2 May 2026 (UTC)
:::I think it's premature to start just making news articles en masse, but if you want to start discussing the topic of citizen journalism, you can do that now. [[:Category:Journalism]] already has some material, so you can start by seeing what we already have, how you can refine that, etc. You can definitely have learning resources with collaborators who want to learn about journalism ASAP. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 01:24, 2 May 2026 (UTC)
::::thanks. [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 01:38, 2 May 2026 (UTC)
::::If I could try and start one News Article could you please tell me how to go about it? Like what style of writing like Wikinews or something else? Thank you Justin! @[[User:Koavf|Koavf]] [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 01:48, 2 May 2026 (UTC)
:::::Honestly, there are very few policies and guidelines here. I think the best way to write a news story would be in a manner that is obvious and instructive. So, for instance, it's common to use the &quot;pyramid style&quot; when you're writing news, so if you were to write a story that makes it very clear that you are using that approach, that would be helpful. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 02:08, 2 May 2026 (UTC)
::::::cool thanks. [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 02:13, 2 May 2026 (UTC)
::::::im ready to write @[[User:Koavf|Koavf]] [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 21:30, 13 May 2026 (UTC)
:::::::I think we should get more local consensus for a big project like including the entirety of the scope of Wikinews here. Again, I support it personally. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 21:55, 13 May 2026 (UTC)
::::::::ok lets begin. [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 22:15, 13 May 2026 (UTC)

== Proposal to rehost Wikinews here ==

As many of you know, and mentioned here at the Colloquium, our sister project Wikinews recently closed, with all 31 active editions made read-only. [[User:BigKrow]] has asked about the prospect of writing news stories here and I suggested that since we already have [[School:Journalism]] and some resources related to the [[:Category:Journalism|broader topic of journalism]]. I would like to propose that we have continued and indefinite space for {{w|citizen journalism}} by essentially repurposing Wikinews into a sub-project here. The only special infrastructure that Wikinews required was [[:mw:Extension:DynamicPageList]], which was deactivated and caused issues due to a lack of maintenance.

I will add this proposal to the site banner, but I recognize that that may be a conflict of interest, so if anyone requests that I remove it, I will. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:30, 14 May 2026 (UTC)
:I would like to see this conversation go for at least 30 days to establish a consensus. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:35, 14 May 2026 (UTC)

===Votes===
*{{support}} as proposer (with BK's inspiration). I think that an ongoing experiment in citizen journalism is a fit and appropriate use of this site. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:35, 14 May 2026 (UTC)
*{{support}}, hope to seeing ideas about this, and thank you @[[User:Koavf|Koavf]] [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 11:08, 14 May 2026 (UTC)
*{{support}} Other than perhaps inflating the total number of pages reported, I see the idea of &quot;practicing journalism&quot; a worthy and relevant activity within the domain of Wikiversity. [[User:IanVG|IanVG]] ([[User talk:IanVG|discuss]] • [[Special:Contributions/IanVG|contribs]]) 21:41, 14 May 2026 (UTC)
*{{support}} Conditional on development of (a) community guidelines that ensure alignment with Wikiversity's purpose, and (b) clear, nested page-naming structures for projects. More detail below. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:48, 15 May 2026 (UTC)
*{{contra}} This proposal doesn't seem interested in expanding educational materials in journalism, but rather in providing space and protection for Wikinews contributors. But this is contrary to the goals of Wikiversity, and I'm not sure it's a good idea, even with regard to WMF. If WMF decides to close a project and another community lets it run on its domain, that's a bit of an undermining of WMF's and the community's decisions. Given that Wikiversity has had several conflicts with other communities and WMF in its history, I'm against it.--[[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:59, 15 May 2026 (UTC)

===Comments and questions===
:Definitely worthy of discussion, so I have no problem with the proposal in the sitenotice.
:Initial questions:
:* Does this proposal include importing English Wikinews content e.g., to [[Wikinews]] subpages?
:* What are &quot;active editions&quot;?
:* How can Wikiversity navigate the concerns that lead to the closure of Wikinews?
:* Are any changes to the scope of Wikinews proposed?
:* How does [[Wikinews]] fit with the [[Wikiversity:Mission]]? What aligns well? Where might there be tension?
:** e.g., I'm not sure that a page like [[Story/Manchester City moves two points behind Arsenal]] in and of itself will serve as an educational resource.
:-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 05:52, 14 May 2026 (UTC)
:* Does this proposal include importing English Wikinews content e.g., to [[Wikinews]] subpages?
::*No, not at this time.
:* What are &quot;active editions&quot;?
::*There were 30 other active editions of Wikinews in addition to English (e.g. [[:n:es:]]) at the time of universal closure (2026-05-04).
:* How can Wikiversity navigate the concerns that lead to the closure of Wikinews?
::*One of the biggest issues was the problems with DPL, which is now irrelevant. Another was the lack of activity, which can be ameliorated by having it be part of an existing project instead of its own domain (e.g. some editions of Wikipedia host their own Wikinews already and those projects were not impacted by the closure).
:* Are any changes to the scope of Wikinews proposed?
::*Not at this juncture. I would also propose as far as implemention goes that we would request a new namespace and that the material be more-or-less sequestered into its own ongoing project, like Wikijournal is or like the Cookbook and Wikijunior are at our sister [[:b:]].
:* How does [[Wikinews]] fit with the [[Wikiversity:Mission]]? What aligns well? Where might there be tension?
:** e.g., I'm not sure that a page like [[Story/Manchester City moves two points behind Arsenal]] in and of itself will serve as an educational resource.
::*The process of citizen journalists practicing their craft in real-time and collaborating with others to do so is itself an education activity. We would essentially be hosting a real-time experiment in citizen journalism, online communities, and collaborative learning in addition to the prospect of spreading educational information from someone actually reading the news. I would propose that we could also make a more deliberate attempt to engage with learning &lt;em&gt;about&lt;/em&gt; what does and doesn't work with collaborative news writing by experimentation (e.g. audio news, syndicating to other sites, incorporating freely-licensed news from other sources, writing hyper-local news, writing briefs versus longer-term reportage) and also seeing if the problems noted in the Task Force report that recommended closure can be overcome. Note that we have already done some local investigation about and learning about wiki-based journalism on Wikinews here at [[Journalism studies and Wikinews]]. We could continue that learning and refine the process, including incorporating journalism students from universities. As for tensions, Wikinews is the only sister project that must be done with a quick turn-around: if you take a long time to [[:s:|transcribe a book]], that's just how long it takes, but if you take a long time to write news, it ceases to be news entirely. Wikiversity has been a very slow-growing project that has definitely had some successes but has generally come together over a long period with most learning resources being individual passion projects (or sometimes, frankly, crankery) which would not work with collaborative news that requires more than just a single editor writing whatever he feels like.
::Please let me know any other questions/concerns and any other editors feel free to give your own perspective. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 06:13, 14 May 2026 (UTC)
:::Thanks, Justin — it is food for thought.
:::In attempting to understand how we've arrived here, I've summarised some of the background on this page: [[Wikinews]].
:::Perhaps it could be helpful to flesh out more of the vision / ideas / possibilities / challenges on that page? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:49, 14 May 2026 (UTC)

:::*Having given it some thought, in principle, I support hosting [[citizen journalism]] on Wikiversity where it is clearly connected to a learning project and/or constitutes original research, both of which align strongly with [[Wikiversity:Mission|Wikiversity’s educational mission]].
:::*My chief concern is the potential for news content that is not clearly linked to the purpose of Wikiversity. To avoid this, some community-agreed guidelines would be prudent. These need not be overly restrictive; they should support boldness and experimentation while helping ensure alignment with Wikiversity's purpose.
:::*Given the reported low and declining activity on Wikinews, it seems unlikely that English Wikiversity would be overwhelmed by an influx of news-related editing. My impression is that English Wikinews was the most active edition, but even so, many contributors are likely to disperse to other projects or cease editing altogether. A modest migration of interested editors to Wikiversity seems manageable.
:::*At this stage, I do not think a dedicated namespace is necessary. Subpages under [[Wikinews]] or nested pages under relevant learning or research projects, or user-space draft pages should be suitable. I agree that [[Wikijournal]] offers a useful model, as do several existing course structures on Wikiversity.
:::*I support [[User:Koavf]]’s suggestions about framing Wikinews activity explicitly around learning. This would create a distinctive space for experimenting with collaborative news production in ways that are pedagogically meaningful. I agree that the [[journalism studies and Wikinews]] project developed by David and Leigh Blackall through the University of Wollongong is an excellent example of the intersection between Wikiversity and Wikinews. The [[Wikinews]] page could evolve into a hub for such projects.
:::*I've tidied the [[:Category:Wikinews|Wikinews category]] and merged some content into the [[Wikinews]] page. As part of a reinvigoration effort, please review these and related resources such as [[:Category:Journalism]] and [[School:Journalism]].
:::*A further argument in favour of this initiative is that Wikipedia explicitly excludes both news reporting and original research. So, there is value in maintaining spaces within the Wikimedia ecosystem where these forms of knowledge production can be openly developed and curated. Such work can, in turn, generate valuable evidence and source material that may later inform Wikipedia articles.
:::*The closure of WMF-hosted Wikinews does not imply that open wiki-based news curation lacks value. Indeed, the closure documentation appears supportive of experimentation with alternative news models across Wikimedia projects, including through Wikipedia and Wikidata. In that context, Wikiversity seems a natural home for a Wikinews experiment, provided it is clearly grounded in learning and/or research.
:::-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:39, 15 May 2026 (UTC)
My understanding towards Wikinews' failure is that everything takes too long to be approved for the publish status, which means that any breaking news would have already become days-old stale news. Wikinews has a brand recognition (for right or wrong reasons) than Wikiversity and I wonder how effective Wikiversity can attract the &quot;Wikinews refugees&quot; to edit here. And just a quick note on the governance. Since each Wikiversity language operates independently, each language has to vote &amp; adopt this proposal independently. [[User:OhanaUnited|&lt;b&gt;&lt;span style=&quot;color: #0000FF;&quot;&gt;OhanaUnited&lt;/span&gt;&lt;/b&gt;]][[User talk:OhanaUnited|&lt;b&gt;&lt;span style=&quot;color: green;&quot;&gt;&lt;sup&gt;Talk page&lt;/sup&gt;&lt;/span&gt;&lt;/b&gt;]] 13:47, 15 May 2026 (UTC)

:Your assessment about Wikinews is partially correct. I referenced it earlier, but to be explicit, there is a [[:m:Proposal for Closing Wikinews|report by a task force on sister projects]] that outlines their concerns. There are a few, one of which was the nature of the staleness of news. Thanks also for clarifying that this proposal is only relevant to en.wv and is not binding or even proposed for other editions of Wikiversity. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:54, 15 May 2026 (UTC)

== Inactivity policy for Curators ==

I was wondering if there is a specific inactivity polity for curators (semi-admins) as I am pretty sure the global policy does not apply to them as they are not ''fully'' sysops. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 03:20, 15 February 2026 (UTC)

:Unfortunately, I don't see an inactivity policy, but if we were to create such a new policy for curators, it should be the same for custodians (administrators). [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 18:45, 15 February 2026 (UTC)
::@[[User:Codename Noreste|Codename Noreste]] There is currently none, that I could find, for custodians either. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:47, 17 February 2026 (UTC)
:::I think we should propose a local inactivity policy for custodians (and by extension, curators), which should be at least one year without any edits ''and'' logged actions. However, I don't know which page should it be when the inactivity removal procedure starts. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 00:53, 17 February 2026 (UTC)
::::@[[User:Codename Noreste|Codename Noreste]] In theory, there should be a section added at [[WV:Candidates for custodianship]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:55, 17 February 2026 (UTC)
::::: To be consistent with the [[meta:Admin activity review|global period of 2 years inactivity]] for en.wv  [[Wikiversity:Custodianship#Notes|Custodians]] and [[Wikiversity:Bureaucratship#How are bureaucrats removed?|Bureaucrats]] we could add something like this to [[Wikiversity:Curators]]:
::::::The maximum time period of inactivity &lt;u&gt;without community review&lt;/u&gt; for curators is two years (consistent with  the [[:meta:Category:Global policies|global policy]] described at [[meta:Admin activity review|Admin activity review]] which applies for [[Wikiversity:Custodianship#Notes|Custodians]] and [[Wikiversity:Bureaucratship|Bureaucrats]]). After that time a custodian will remove the rights.
::::: -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:51, 27 March 2026 (UTC)
:::::Yup, I agree with Jtneill, there is a policy proposal for Wikiversity:Curators, where it should be logically deployed. The question is if we are ready to aprove the policy. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:43, 17 April 2026 (UTC)
:::::: I agree, but we should notify the colloquium about inactive curators, just like a steward would do for inactive custodians and bureaucrats per [[:m:Admin activity review|AAR]]. What is the minimum timeframe an inactive curator should receive so they can respond they would keep their rights? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 17:49, 17 April 2026 (UTC)
:I incorporated these suggestions into the proposed curators policy. Please review/comment/improve. Summary: 2 years, notify curator's user page, then remove rights after 1 month: [[Wikiversity:Curators#Inactivity]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 08:59, 24 April 2026 (UTC)
:: @[[User:Jtneill|Jtneill]] I created [[Template:Inactive curator]] for this. Feel free to make any changes or improvements. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:29, 24 April 2026 (UTC)
:::Wondering, should we also have:
:::* {{tl|Inactive custodian}}
:::* {{tl|Inactive bureaucrat}}
:::or perhaps just a single template with a parameter(s) for the user right(s)/role(s)? e.g., 
:::* if a custodian is inactive for 2 years, then custodian and curator rights are to be removed and 
:::* if a bureaucrat is inactive for 2 years, then bureaucrat, custodian, and curator rights are to to be removed.
:::-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:58, 13 May 2026 (UTC)
:::: I would probably modify that template when we actually develop our own inactivity policy, because we're currently under the AAR (a steward notifies the colloquium with [[m:Admin activity review/Notice to communities]], and inactive advanced right holders with [[m:Admin activity review/Notice to inactive right holders]]). [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:16, 13 May 2026 (UTC)
:::::Ah, I see. Yes, that makes sense. Thankyou. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:21, 15 May 2026 (UTC)
: In that case, should we develop our own inactivity policy (e.g. on [[Wikiversity:Inactivity policy]] or [[Wikiversity:Support staff/Inactivity]])? I would list the general inactivity part, the process, etc. Once it's approved as a policy, I will [[m:Stewards' noticeboard|notify the stewards]]. Thoughts? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:30, 16 May 2026 (UTC)
::Originally, I would have thought that, for a small wiki like en.wv, it made sense to leave inactivity monitoring to the stewards. However, with the creation of the curator user group, we have already taken on local responsibility for monitoring inactivity in at least one advanced-rights group. Extending this to custodians and bureaucrats would not add much additional overhead and would provide a more consistent and transparent local administrative process.
::One option would be to develop a single, centralised policy covering all advanced-rights groups.
::An alternative would be to include an ==Inactivity== section on each relevant policy page (e.g., we already have [[Wikiversity:Curatorship#Inactivity]], but not yet in the custodianship, and bureaucratship policy pages). This approach would allow some flexibility because different user groups may warrant different criteria (such as inactivity thresholds, qualifying activity, or review procedures).
::A hybrid approach may be best: maintain separate inactivity sections within each user-group policy page, while transcluding these into a central overview page such as Codename Noreste suggests. This would preserve clarity at the local policy level while also providing a single reference point for consistency and oversight. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 23:09, 16 May 2026 (UTC)

==Curator inactivity review==
These curators haven't been active for &gt; 2 years. As per the [[Wikiversity:Curatorship|curatorship policy]]:
* [[Special:Log/Cody naccarato]] was notified on their talk page by [[User:Codename Noreste|Codename Noreste]] on 24 Apr 2026
* [[Special:Log/Praxidicae]] was notified on their talk page by [[User:Codename Noreste|Codename Noreste]] on 24 Apr 2026
* [[Special:Log/Tegel]] was notified on their talk page by [[User:Jtneill|Jtneill]] notified their talk page on 16 May 2026

The policy allows a month to hear from these users. If no response, a custodian will remove their curator rights.

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 06:14, 16 May 2026 (UTC)
: For Cody naccarato and Praxidicae, their rights are to be removed by the 19th of May if they don't respond either here or on their talk page. For Tegel, the removal will happen on the 16th of June, probably. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:13, 16 May 2026 (UTC)</text>
      <sha1>cb74qatd6ip0ste65hgofo3abd62asb</sha1>
    </revision>
    <revision>
      <id>2809776</id>
      <parentid>2809774</parentid>
      <timestamp>2026-05-16T23:11:00Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <comment>/* Curator inactivity review */ Reply</comment>
      <origin>2809776</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="81376" sha1="4x78sgfe5ala2smrircyc78mam0foba" xml:space="preserve">{{Wikiversity:Colloquium/Header}}
&lt;!-- MESSAGES GO BELOW --&gt;
== New titles for user right nominations ==
&lt;div class=&quot;cd-moveMark&quot;&gt;''Moved from [[Wikiversity talk:Candidates for Custodianship#New titles for user right nominations]].  [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 23:20, 17 April 2026 (UTC)''&lt;/div&gt;

I would like to propose the following retitles should a user be nominated for any of the following user rights:
* Curator: Candidates for Curatorship
* Bureaucrat: Candidates for Bureaucratship
The reason is that many curator (and probably bureaucrat) requests have run solely under {{tq|Candidates for Custodianship}}, but that title might sound misleading (especially in regards to the permission a user is requesting). CheckUser and Oversight (suppressor) are not included above since no user was nominated for these sensitive permissions, probably. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 01:30, 19 March 2026 (UTC)

:And it's not that when someone at the beginning misplaced the request, no one thought to move it and the others copied it. Even today, it would be possible to simply take it all and move it. Otherwise, for me, the more fundamental problem is that there is [[Wikiversity:Curators|no approved policy for curators]] than where the requests are based. Curators then operate in a certain vacuum and if one of them &quot;breaks out of the chain&quot;, the average user doesn't have many transparent tools to deal with it, because there is no policy. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:02, 19 March 2026 (UTC)
::I am not talking about the curator page (policy proposal). [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 19:08, 21 March 2026 (UTC)
: @[[User:Juandev|Juandev]] I'll see if I can do an overhaul of [[Wikiversity:Candidates for Custodianship]], just like I recently did with the Requests for adminship page on English Wikiquote. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 22:17, 18 April 2026 (UTC)
:Yes, great idea - ideally there will be separate &quot;Candidates for ...&quot; pages for each user right group. The most important for now is to separate curator and custodian pages as CN suggests. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:39, 1 May 2026 (UTC)
:So maybe I previously misunderstood. Are you proposing separated pages for nominations (i.e. [[Wikiversity:Candidates for Curatorship]], [[Wikiversity:Candidates for Bureaucratship]], [[Wikiversity:Candidates for Custodianship]])? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:30, 5 May 2026 (UTC)
:: Yes. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:33, 5 May 2026 (UTC)
:::I see, then I am fine with that @[[User:Codename Noreste|Codename Noreste]]. Sorry for misunderstanding. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:35, 9 May 2026 (UTC)

I've split the user rights nomination pages into:
* [[Wikiversity:Candidates for CheckUser]]
* [[Wikiversity:Candidates for Curatorship]]
* [[Wikiversity:Candidates for Custodianship]]
* [[Wikiversity:Candidates for Bureaucratship]]

Please review. There are likely several links to update, text to adjust, categories to manage, short-cuts to fix etc. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:22, 10 May 2026 (UTC)

:Thanks, great job @[[User:Jtneill|Jtneill]]. I am wondering if we need to move archived nominations too, or if we are OK with the actual state. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:08, 10 May 2026 (UTC)
::Yes, I think that would be helpful. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:46, 10 May 2026 (UTC)
:::I can do it @[[User:Jtneill|Jtneill]], I am just looking what system is there. I can see [[Wikiversity:Candidates for Custodianship/Archive of nominations for full custodianship]] which is a good complementary overview to the subpages with full history. The name of the pages is probably stably, but I would consider to create more specific redirect like [[Wikiversity:Candidates for Custodianship/Overview of staff nominations]], which would link to the above one. Then there is a [[Wikiversity:Candidates for Custodianship/Archived]], which are probably incomplete nominations, right? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:37, 11 May 2026 (UTC)
::::Tx @[[User:Juandev|Juandev]]. Yes, this makes sense. And maybe we move:
::::* archived '''curator''' nominations from [[Wikiversity:Candidates for Custodianship/Archive of nominations for full custodianship]] to e.g., [[Wikiversity:Candidates for Curatorship/Archive of nominations]]
::::* archived '''bureaucrat''' nominations from [[Wikiversity:Candidates for Custodianship/Archive of nominations for full custodianship ]] to e.g., [[Wikiversity:Candidates for Bureaucratship/Archive of nominations]]
::::-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:12, 11 May 2026 (UTC)
:::::OK. That sounds good. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:25, 12 May 2026 (UTC)
:An svg icon for [[Wikiversity:Curatorship|curators]] would also be helpful. We have them for other user rights: [[c:Category:Wikiversity user rights icons]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:54, 10 May 2026 (UTC)
::Done: [[Wikiversity:Curators]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 01:44, 11 May 2026 (UTC)

== Technical Request:  Courtesy link.. ==

[[Template_talk:Information#Background_must_have_color_defined_as_well]] [[User:ShakespeareFan00|ShakespeareFan00]] ([[User talk:ShakespeareFan00|discuss]] • [[Special:Contributions/ShakespeareFan00|contribs]]) 11:43, 20 March 2026 (UTC)
: I can't edit the template directly as it need an sysop/interface admin to do it. [[User:ShakespeareFan00|ShakespeareFan00]] ([[User talk:ShakespeareFan00|discuss]] • [[Special:Contributions/ShakespeareFan00|contribs]]) 11:43, 20 March 2026 (UTC)
:: Also if the Template field of - https://en.wikiversity.org/wiki/Special:LintErrors/night-mode-unaware-background-color is examined, there is poential for an admin to clear a substantial proportion of these by implmenting a simmilar fix to the indciated templates (and underlying stylesheets). It would be nice to clear things like Project box and others, as many other templates (and thus pages depend on them.) :)
[[User:ShakespeareFan00|ShakespeareFan00]] ([[User talk:ShakespeareFan00|discuss]] • [[Special:Contributions/ShakespeareFan00|contribs]]) 11:43, 20 March 2026 (UTC)

:I think it would be best to grant you interface admin rights for a short period of time to make these changes. However, I still have doubts about the suitability of this solution, which may cause other problems and no one has explained to me why dark mode has to be implemented this way @[[User:ShakespeareFan00|ShakespeareFan00]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:43, 20 March 2026 (UTC)

: I would have reservations about holding such rights, which is why I was trying to do what I could without needing them. However if it is the only way to get the required changes made, I would suggest asking on Wikipedia to find technical editors, willing to undertake the changes needed. [[User:ShakespeareFan00|ShakespeareFan00]] ([[User talk:ShakespeareFan00|discuss]] • [[Special:Contributions/ShakespeareFan00|contribs]]) 09:32, 21 March 2026 (UTC)

== WikiEducator has closed ==

Some of you may know of a similar project to Wikiversity, called [https://wikieducator.org/Main_Page WikiEducator], championed by [https://oerfoundation.org/about/staff/wayne-mackintosh/ Wayne Mackintosh][https://www.linkedin.com/posts/waynemackintosh_important-notice-about-the-oer-foundation-activity-7405113051688931329-Nhm9/][https://openeducation.nz/killed-not-starved/].

It seems [https://openeducation.nz/terminating-oer-foundation their foundation has closed] and they are no longer operating.

They had done quite a bit of outreach (e.g., in the Pacific and Africa) to get educators using wiki.

The WikiEducator content is still available in MediaWiki - and potentially could be imported to Wikiversity ([https://wikieducator.org/WikiEducator:Copyrights CC-BY-SA] is the default license).

The closing of WikiEducator arguably makes the nurturing of Wikiversity even more important.

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:09, 1 April 2026 (UTC)

:I was never active there. If anyone has an account or is otherwise in contact, we may want to copy relevant information here or even at [[:outreach:]]. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 04:46, 1 April 2026 (UTC)

:: I reached out to [[User:Mackiwg~enwikiversity|Wayne]] in January, and he responded briefly but positively (while travelling).  I wrote to the low-traffic wikieducator mailing list today and got a nice [https://groups.google.com/g/wikieducator/c/r_yIyUw6ZIA reply] from [[user:SteveFoerster|Steve Foerster]] who's interested in helping. If we can figure out a migration path it would be great to adopt at least the main namespace pages here.  
:: A few questions that come to mind: 
:: - would people want to create matching user accounts
:: - are there any namespaces (user/talk?) that should not be moved over
:: We could look at how this was done for the [[m:Wikivoyage/Migration]] wikivoyage migration. &lt;span style=&quot;padding:0 2px 0 2px;background-color:white;color:#bbb;&quot;&gt;&amp;ndash;[[User:Sj|SJ]][[User Talk:Sj|&lt;span style=&quot;color:#ff9900;&quot;&gt;+&lt;/span&gt;]]&lt;/span&gt; 04:27, 1 May 2026 (UTC)
:::That's fantastic, SJ, that you've reached out and that Wayne, Steve, and Jim are receptive—and that you can help! -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:52, 1 May 2026 (UTC)
::::A matching accound makes sense to give credits to the original authors and keep a clean chain of versions. The initial commit into wikiversity could have a &quot;marker with timestamp&quot; similar to signature with a reference where the content's source or a Web archive. This would allow authors to continue there work on wikiversity if they wish. [[User:Bert Niehaus|Bert Niehaus]] ([[User talk:Bert Niehaus|discuss]] • [[Special:Contributions/Bert Niehaus|contribs]]) 06:30, 15 May 2026 (UTC)

== Wikinews is ending ==

Apparently mainly due to low editorial activity, low public interest, but also failure to achieve the goals from the proposal for the creation of the project, the Wikinews project is ending after years of discussions ([[Meta:Proposal for Closing Wikinews|some reading]]).

And I would be interested to see how Wikiversity is doing in the monitored metrics. We probably have more editors than Wikinews had, but what about consumers and achieving the goals? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 19:14, 1 April 2026 (UTC)

:Wikiversity's biggest issue in recent times was the hosting of low-quality, trash content. Thankfully we've done a great job in removing pseudoscience and other embarrassingly trash content (Wikidebates, for example), but the biggest concern moving forward is proper maintenance IMO. I've caught several pseudoscience pages being created within the last few months that could easily have flown under the radar (ex, [[The Kelemen Dilemma: Causal Collapse and Axiomatic Instability]]), so I'd urge our custodians/curators to be on the lookout for this type of content. Usually an AI-overview can point this type of content out relatively well.
:In terms of visibility, I believe Wikiversity is a high-traffic project. I remember my [[Mathematical Properties]] showing up on the first page of Google when searching up &quot;math properties&quot; for the longest time (and is still showing up in the first page 'till this day!). Besides, Wikinews hosted a lot of short-term content (the nature of news articles), while Wikiversity hosts content that can still be useful a decade later (ex, [[A Reader's Guide to Annotation]]). 
:I think we are on a better path than we were a few months ago, and I do want to thank everyone here who has been helping out with maintaining our website! —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 20:48, 1 April 2026 (UTC)
:For what it's worth, the group that did that study has since disbanded, so no one is monitoring the other sister projects in the same way. Additionally, Wikinews had some catastrophic server issues due to the maintenance of [[:m:Extension:DynamicPageList]] which don't apply here. Your questions are still worth addressing, but I just wanted to cut off any concern at the pass about Wikiversity being in the same precarious situation. Wikiversity is definitely the biggest &quot;lagging behind&quot; or &quot;failure&quot; project now that Wikinews is being shuttered, but I don't see any near- or medium-term pathway to closing Wikiversity. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 00:46, 2 April 2026 (UTC)

:[[w:en:Wikipedia:Wikipedia Signpost/2026-03-31/News and notes|Entirety of Wikinews to be shut down]] (Wikipedia Signpost) -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:03, 11 April 2026 (UTC)

== Action Required: Update templates/modules for electoral maps (Migrating from P1846 to P14226) ==

Hello everyone,

This is a notice regarding an ongoing data migration on Wikidata that may affect your election-related templates and Lua modules (such as &lt;code&gt;Module:Itemgroup/list&lt;/code&gt;).

'''The Change:'''&lt;br /&gt;
Currently, many templates pull electoral maps from Wikidata using the property [[:d:Property:P1846|P1846]], combined with the qualifier [[:d:Property:P180|P180]]: [[:d:Q19571328|Q19571328]]. 

We are migrating this data (across roughly 4,000 items) to a newly created, dedicated property: '''[[:d:Property:P14226|P14226]]'''.

'''What You Need To Do:'''&lt;br /&gt;
To ensure your templates and infoboxes do not break or lose their maps, please update your local code to fetch data from [[:d:Property:P14226|P14226]] instead of the old [[:d:Property:P1846|P1846]] + [[:d:Property:P180|P180]] structure. A [[m:Wikidata/Property Migration: P1846 to P14226/List|list of pages]] was generated using Wikimedia Global Search.

'''Deadline:'''&lt;br /&gt;
We are temporarily retaining the old data on [[:d:Property:P1846|P1846]] to allow for a smooth transition. However, to complete the data cleanup on Wikidata, the old [[:d:Property:P1846|P1846]] statements will be removed after '''May 1, 2026'''. Please update your modules and templates before this date to prevent any disruption to your wiki's election articles.

Let us know if you have any questions or need assistance with the query logic. Thank you for your help! [[User:ZI Jony|ZI Jony]] using [[User:MediaWiki message delivery|MediaWiki message delivery]] ([[User talk:MediaWiki message delivery|discuss]] • [[Special:Contributions/MediaWiki message delivery|contribs]]) 17:11, 3 April 2026 (UTC)
&lt;!-- Message sent by User:ZI Jony@metawiki using the list at https://meta.wikimedia.org/w/index.php?title=Distribution_list/Non-Technical_Village_Pumps_distribution_list&amp;oldid=29941252 --&gt;
:I didnt find such properties, so we are probably fine. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:00, 12 April 2026 (UTC)
:: +1 (agreed). [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 22:19, 12 April 2026 (UTC)

== Enable the abuse filter block action? ==

In light of [[Special:AbuseLog/80178]] (coupon spam), I would like to propose enabling the block action for the abuse filter. Only custodians will be able to enable and disable that action on an abuse filter, and it is useful to block ongoing vandalism. Thoughts? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 19:12, 13 April 2026 (UTC)

:Seems like a good idea, almost all of the users which create such pages are spambots so this shouldn’t be a problem. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 23:41, 13 April 2026 (UTC)
:Can you explain some more (I am new to abuse filters)? It looks like the attempted edit was prevented? Which abuse filter?
:Note on your suggestion, have also reactivated Antispam Filter 12 - see [[WV:RCA]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:45, 15 April 2026 (UTC)
:: I am proposing that we activate the abuse filter block action, which if a user triggers an abuse filter, it would actually block the user in question - the same mechanism that a custodian would use to block users. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:11, 15 April 2026 (UTC)
:::OK, thankyou, that makes sense. And, reviewing the abuse filter 12 log, it would be helpful because it would prevent the need for manual blocking. But I don't see a setting for autoblocking? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 23:14, 15 April 2026 (UTC)
:::: I think it probably adds an autoblock. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 00:43, 16 April 2026 (UTC)
: [[User:Jtneill|Jtneill]] and [[User:PieWriter|PieWriter]], given that a little bit more than a week has passed and there is minimal consensus to activate the abuse filter block action, I filed [[phab:T424053]]. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:05, 21 April 2026 (UTC)
::Thank-you for doing this. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 08:03, 24 April 2026 (UTC)

== Advice needed: A Neurodiversity-inspired Idea/observation ==

If I want the greatest participation of others to &quot;provide constructive criticism to my idea&quot; or to &quot;shoot down my idea&quot; or &quot;idea&quot;.

What I've called it so far is &quot;The Neurodiversity-inspired Idea&quot;. At other times I used more sensationalist wording but here on Wikiversity I don't dare do that. I actually woke up with thinking about putting this into my userspace draft: &quot;Personal Observations Made By Meeting Autistic and Non-Autistic Adults&quot;.

My ultimate goal is to stop blathering about my &quot;idea&quot; to friend and family without feeling my &quot;methodology&quot; is going into any progressive direction whatsoever. My latest encounter was somewhat constructive though. A friend of a friend who worked with people presenting ideas in attempting to getting grants. I don't want a grant. I just want to figure out how I can express my &quot;idea&quot; in a way so that I can more clearly figure out what flaws it got.

At the same time I tend to overthink. If anyone thinks etherpad might be a good place and considering Wikimedia already got an etherpad at https://etherpad.wikimedia.org/ if anyone feels like they know me better in the future feel free to suggest a &quot;session&quot; on etherpad.

'''If I don't receive a reply to this in 1 week's time I will begin to explore this &quot;idea&quot; into my userspace''' unless you replied and refrained me from doing so, of course. Then maybe after &quot;developing it there&quot; I might reference it to you another future time here in the Colloquium, with my &quot;idea&quot; still in my userspace draft. This &quot;idea&quot; is sort of a burden, I'm happy I've made the choice to get rid of it and hopefully move on with my life, unless there is something to this &quot;idea&quot;. 

My failure is probably evident: I feel I haven't told you anything. Same happened to when I talked to friends and family. In danger of overthinking it further I'll publish this right now. I need to &quot;keep it together&quot; [[User:ThinkingScience|ThinkingScience]] ([[User talk:ThinkingScience|discuss]] • [[Special:Contributions/ThinkingScience|contribs]]) 10:36, 16 April 2026 (UTC)

:Good on you putting it out there ... and hitting publish :). I'd say go for it (no need to wait), give birth to your idea and share about it here and elsewhere. Let it take shape and see where it might go. In many ways, this is exactly what an open collaborative learning community should be doing. Others might not know well how to respond, so perhaps consider creating some questions to accompany the idea. Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:21, 16 April 2026 (UTC)
::Thank you for encouraging me in developing the idea.
::I have created a &quot;questions&quot; section in the draft which is visible in the table of contents now. My brain was &quot;frozen&quot; today metaphorically speaking in that I felt I had like a &quot;writer's block&quot; so the draft has more &quot;AI/LLM&quot; content than before. I used the LLM for generating questions. The answers are so far human-only.
::I've also created a subsection where I could add the prompts that made the LLM generate the questions. That could help people make better prompts perhaps. I've described what it is about inside of it and there are some chaotically written notes.
::[[Draft:The_Neurodiversity-inspired_Idea#Questions_that_might_encourage_the_development_of_this_idea_and_its_methodology]]
::My draft is missing stuff. Any questions that you contribute to my draft will probably help me and if I don't understand the questions I'll probably notify you and also at the same time &quot;feed them&quot; to an LLM and ask in my input like &quot;explain in simple words what this question means, what is it searching for?&quot; etc. while I wait for an answer. If you have any more feedback please give it to me here or on the Draft page, its talk page or my user talk page. Thank you for helping me! [[User:ThinkingScience|ThinkingScience]] ([[User talk:ThinkingScience|discuss]] • [[Special:Contributions/ThinkingScience|contribs]]) 21:20, 18 April 2026 (UTC)
::Today I woke up with not only thinking about supplying questions along with the &quot;idea&quot; but also answers. ie. Is it possible to &quot;test&quot; this idea? Is it possible to create one or multiple hypotheses based on this &quot;idea&quot;?(etc.) I've thought about this before in this &quot;idea&quot; but since I'm beginning to add to Wikiversity what was previously 'locked in my mind' it's also easier for me to see what I've done so far. Thank you for this comment! [[User:ThinkingScience|ThinkingScience]] ([[User talk:ThinkingScience|discuss]] • [[Special:Contributions/ThinkingScience|contribs]]) 09:11, 23 April 2026 (UTC)
:May I think that you should not add deadlines ; being read, and rising interest for collaboration, or even simply for exchange of thoughts, such an effective meeting event loads a huge bunch of unprobability, which time can help to… somehow diminish. Maybe, I would advice you having a central place for developping your ideas, your needs, your advances, maybe a page in your own user zone, and from time to time, depending your feeling, it could be every trimester or so, or more frequently, you could write a short account of progress (or even of no progress), or a call for participation, in such a place as this present one ; I think that will increase much exposure of your projet. Maybe also, if you can find a project name, not necessarily very meaningfull by itseilf (at least it will gain signification with time, as your project develops), that will serve as a kind-of hook, and make your announcement titles more visible. Best regards (and my excuses for my poor command of English, which seems to be unplease an anti-abuse filter, &quot;Questionable Language (profanity)&quot;, which I don't understand…). My few cents. --  [[User:Eric.LEWIN|Eric.LEWIN]] ([[User talk:Eric.LEWIN|discussion]] • [[Special:Contributions/Eric.LEWIN|contributions]]) 10:06, 17 April 2026 (UTC)
::Sorry about the false positive on the profanity filter - I've fixed it. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:26, 17 April 2026 (UTC)
:::&quot;May I think that you should not add deadlines ; being read, and rising interest for collaboration, or even simply for exchange of thoughts, such an effective meeting event loads a huge bunch of unprobability, which time can help to… somehow diminish.&quot;
::Thank you Eric for this comment. Trust in time is how I interpret it. I should not feel like I need to be in a hurry. I'll try to give this time. Thank you!
:::&quot;Maybe, I would advice you having a central place for developping your ideas, your needs, your advances, maybe a page in your own user zone, and from time to time, depending your feeling, it could be every trimester or so, or more frequently, you could write a short account of progress (or even of no progress), or a call for participation, in such a place as this present one ; I think that will increase much exposure of your projet.&quot;
::A central place for developing or making &quot;project notes&quot; regarding the Neurodiversity idea on my userspace, I might need that, like a diary or &quot;project notes&quot; of the Neurodiversity idea similar to my course notes regarding my experience with Coursera.
::Any actions I take are going to be related to my Userspace from now on but I'll also update the draft when necessary. Now in the beginning I might be working daily to once every 3 days on both the draft and the daily notes I plan to make.
:::&quot;Maybe also, if you can find a project name, not necessarily very meaningfull by itseilf (at least it will gain signification with time, as your project develops), that will serve as a kind-of hook, and make your announcement titles more visible.&quot;
::Thank you for the advice. I was brainstorming yesterday about it. I concluded that since I've not yet developed a methodology that adheres to &quot;Do no harm&quot; and this is my first time working my &quot;idea&quot; into a way that is compatible with how projects develop on English Wikiversity this is new to me. My methodology isn't developed and therefore trying to get attention to my project through a name can wait. Yesterday I figured out a silly title that has nothing to do with the project: &quot;Planetary Awareness Potato Cabbage Rolls&quot; or something like that. Google output read that no such thing exists so I wanted it mainly to be unique. I don't want to raise attention that I'm unsure whether I'll actually be capable of developing a methodology for but project notes is my best bet so far in tracking my progress. Every day I think about this &quot;idea&quot; but I need to improve the important parts.
:::&quot;Best regards (and my excuses for my poor command of English, which seems to be unplease an anti-abuse filter, &quot;Questionable Language (profanity)&quot;, which I don't understand…). My few cents.&quot;
::You added great points and I felt that I was helped by you! I encourage you to post again and I can understand that interacting with any kind of automated filter can be discouraging and can be for me too! Thank you for giving me feedback! [[User:ThinkingScience|ThinkingScience]] ([[User talk:ThinkingScience|discuss]] • [[Special:Contributions/ThinkingScience|contribs]]) 16:01, 18 April 2026 (UTC)

== Add some user rights to the curator user group? ==

By default, only custodians have the ability to mark new pages as patrolled (&lt;code&gt;patrol&lt;/code&gt;) and have their own page creations automatically marked as patrolled (&lt;code&gt;autopatrol&lt;/code&gt;). I am proposing both of the following:
* Curators can mark new pages as patrolled, helping on reducing the backlog of new, unpatrolled pages.
* New pages made by curators will be automatically marked as patrolled by the MediaWiki software.
Before we implement this, I would suggest implementing a proposed guideline for marking new pages as patrolled for curators and custodians.

Thoughts? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 16:32, 17 April 2026 (UTC)

:Agree, &lt;s&gt;also can we also allow curators to undelete pages since they already have the rights to delete them?&lt;/s&gt; [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 02:54, 18 April 2026 (UTC)
::I think the requirement that undelete NOT be included came from above (meta / stewards / central office). Having access to the undelete page gives access to information that is restricted by their policies to admins (custodians and bureaucrats). -- [[User:Dave Braunschweig|Dave Braunschweig]] ([[User talk:Dave Braunschweig|discuss]] • [[Special:Contributions/Dave Braunschweig|contribs]]) 20:12, 18 April 2026 (UTC)
::: [[User:PieWriter|PieWriter]], unless if requests for curator and custodian should be RfA-like processes (that is, including voting and comments), then I have to agree with Dave above. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 22:03, 18 April 2026 (UTC)
::::Oh, I didn’t realise that. Withdrawing my comment.. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:08, 19 April 2026 (UTC)
:{{support}} Seems reasonable and would reduce overhead. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 14:35, 18 April 2026 (UTC)
:'''Agree''', implement it also to [[Wikiversity:Curators]] proposal please. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:11, 18 April 2026 (UTC)
: I went ahead and filed [[phab:T424445]]. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:39, 26 April 2026 (UTC)

== [[Wikiversity:Curators|Curators and curators policy]] ==
{{archive top|There is strong consensus, so [[Wikiversity:Curators]] is now a policy. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:15, 9 May 2026 (UTC)}}
How does it come, that Wikiversity has curators, but Curators policy is still being proposed? How do the curators exists and act if the policy about them havent been approved yet? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:33, 16 October 2025 (UTC)

:It looks as if it is not just curators. The policy on Bureaucratship is still being proposed as well. See [[Wikiversity:Bureaucratship]]. —[[User:RailwayEnthusiast2025|&lt;span style=&quot;font-family:Verdana; color:#008000; text-shadow:gray 0.2em 0.2em 0.4em;&quot;&gt;RailwayEnthusiast2025&lt;/span&gt;]] &lt;sup&gt;[[User talk:RailwayEnthusiast2025|&lt;span style=&quot;color:#59a53f&quot;&gt;''talk with me!''&lt;/span&gt;]]&lt;/sup&gt; 18:33, 27 October 2025 (UTC)

:I think its just the nature of a small WMF sister project in that there are lots of drafts, gaps, and potential improvements. In this case, these community would need to vote on those proposed Wikiversity staff policies if we think they're ready. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:08, 3 December 2025 (UTC)
:What? I thought you were getting it approved, Juandev... :) [[User:I&amp;#39;m Mr. Chris|I&amp;#39;m Mr. Chris]] ([[User talk:I&amp;#39;m Mr. Chris|discuss]] • [[Special:Contributions/I&amp;#39;m Mr. Chris|contribs]]) 14:20, 12 February 2026 (UTC)
::Yeah I think this one is important too and we need to aprove it too @[[User:I'm Mr. Chris|I'm Mr. Chris]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 15:56, 12 February 2026 (UTC)
:::I thinks its ready to made into a policy, it seems to be complete and informative about what the rights does and how to get it. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 03:08, 15 February 2026 (UTC)
::::Agree -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:00, 27 March 2026 (UTC)

Let's make this the official discussion about adopting the [[Wikiversity:Curators|curators policy]] policy. Your comments are invited and welcome. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 08:40, 24 April 2026 (UTC)
: There were two similar Colloquium threads in separate places about the proposed curators policy. So I've moved them to be adjacent. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 12:42, 1 May 2026 (UTC)
{{archive bottom}}

== Wikiversity:Curators to become a policy ==
{{archive top|There is strong consensus, so [[Wikiversity:Curators]] is now a policy. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:16, 9 May 2026 (UTC)}}
I've looked at the discussions about the Curators policy, I've looked at the practices, and it seems to me that there is no dispute about the wording of the policy, and what's more, the community has been using this proposal as if it were an offical policy for several years. Therefore, I propose that [[Wikiversity:Curators]] become a policy. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:35, 18 April 2026 (UTC)

:{{support}} —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:54, 18 April 2026 (UTC)
:{{support}} —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 20:21, 18 April 2026 (UTC)
: {{support|Yes, please}}. Especially after when I and PieWriter proposed above, I agree. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:27, 24 April 2026 (UTC)
:: @[[User:Juandev|Juandev]]; as of now, curators now have the user rights &lt;code&gt;autopatrol&lt;/code&gt; and &lt;code&gt;patrol&lt;/code&gt;. Perhaps we should also include that in [[Wikiversity:Custodianship]]? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 12:07, 30 April 2026 (UTC)
:::You meant [[Wikiversity:Curators]] @[[User:Codename Noreste|Codename Noreste]]? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:15, 5 May 2026 (UTC)
:::: I agree that we must develop what rules curators should follow when marking new pages as patrolled; the same can be added for custodians since they can also mark new pages as patrolled. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:37, 5 May 2026 (UTC)
:::::I see, well I think you can just add this to the policy. It is not major change and it probably reflects actual practice or actual technical possibilities for those flags. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:20, 7 May 2026 (UTC)
:{{support}} -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 12:42, 1 May 2026 (UTC)
:{{Support}} per nom. [[User:PhilDaBirdMan|PhilDaBirdMan]] ([[User talk:PhilDaBirdMan|discuss]] • [[Special:Contributions/PhilDaBirdMan|contribs]]) 13:32, 1 May 2026 (UTC)
{{Archive bottom}}

== Inactive curators ==

Hello, even though [[Wikiversity:Curators]] is not a policy yet, there are curators listed here that have been inactive for two years or more:
* {{user|Cody naccarato}} (last edit on 13 Dec 2022, last logged action on 10 Dec 2022)
* {{user|Praxidicae}} (last edit on 10 Sep 2022, last logged action on 12 Sep 2022)
[[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 21:14, 19 April 2026 (UTC)

:Yup, I would remove the rights. To get the rights back if theyll come back should not be a big deal. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:08, 24 April 2026 (UTC)
:: When they don't reply by May 19, feel free (or any custodian) to do so. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 00:28, 25 April 2026 (UTC)

== Is anyone interested in Neurodiversity? ==

Is anyone interested in Neurodiversity? Is there anyone here who is interested for Neurodiversity to be &quot;something more&quot; than it already is? Does anyone here consider Neurodiversity one of the &quot;harder topics&quot; to work on or discuss? Does anyone here have an opinion about the [[Neurodiversity Movement]]? So these questions don't appear like &quot;out of a vacuum&quot; I can tell you a bit about my background:

Many years ago I got a psychiatric diagnosis &quot;Asperger's&quot;. After I stepped out of the office and my Äsperger's was 'concluded', I stepped out into the street and thought my first negative thought(but the positive thought followed after). The thought was about concentration camps in the second world war and that the world seemed to be going into the direction of &quot;labeling others&quot;. I was unsure whether this was &quot;real science&quot; and sort of &quot;challenged myself&quot; to make up my own mind after meeting people that had been given this diagnosis. The more adults with this diagnosis I met the more I started seeing &quot;patterns&quot;.

Was it a coincidence that the first person with Asperger's I met reminded me about my father later after I had plenty of times of experience with interacting with him? None of the people I interacted with online through IRC text chat...I felt I got any clue about how &quot;their brains work&quot;. Only when I met one person from the Asperger's chat community in person we both realized that whatever we experienced was akin to the &quot;chaos theory&quot;. He told me about &quot;chaos theory&quot; while I didn't know even what that term meant but I guess I 'read between the lines'. My question that I linger on still today is &quot;did he understand about me what I think I understood about him?&quot;? That our brains had the same configuration? Most autistic adults who meet other autistic adults usually get disappointed. They think the diagnosis will help them meet somebody like themselves and then they realize the great diversity in the autistic spectrum created by Psychiatry.

I later stopped interacting with autistic communities that much, I felt that it did not benefit me. Also Neurodiversity's &quot;neurotypes&quot; interested me for a while until I realized I had &quot;misunderstood everything&quot; about them and how they are used in the Neurodiversity Movement or &quot;Neurodiversity community&quot; if that even can precisely be defined? I doubt it but if you want to contribute to the [[Neurodiversity Movement]]. My previous attempts failed as I got more and more confused. I think a community project needs a community. With a lack of that I don't think it is worth my time. If any of you would like to work on that project let me know on my talk page.

So I was kinda lost and was talking to my friend and psychologist and I realized if I never talk about my idea to anyone in a &quot;comprehensive way&quot; or show that it matters to me nothing is going to ever happen. So I started talking about my &quot;idea&quot; more. Nobody could understand the &quot;idea&quot; because I had not developed my skills regarding where to start...although the process had already started &quot;automatically&quot; and that's why I often think of &quot;well my brain sort of activated me&quot;. I don't feel like I did have a plan and this idea happened. It happened &quot;by itself&quot;. My brain reacted to what I was seeing in a video or stream.

I value interaction highly in this idea. I think it would be helpful to make a community of people who are not paranoid about stuff that can express itself like &quot;don't analyze me!&quot;, &quot;don't compare me to anyone!&quot;. 

On the contrary, more often than not those adults who were diagnosed were actually openly comparing themselves with each other and I think that is healthy in a &quot;science&quot; way if done the &quot;right way&quot; which probably means &quot;Do no harm&quot;.

I found video material is important but I'm very unsure if uploading own video material to Wikimedia Commons would constitute a &quot;reasonable&quot; use of the resources there. Maybe somebody here needs to ask more questions to me that I should answer before that happens. I also know the '''be bold''' so I could just do what I think might be ok. Though I work better in a group as long as I know what &quot;group configurations&quot; help me. This is in a non-profit way. Since the state supported me this might be a way I am trying to &quot;give back&quot; to the state and &quot;the world&quot;. May seem overly ambitious and crazy but this thing gives me energy. It gives me hope when trying to develop this idea. [[User:ThinkingScience|ThinkingScience]] ([[User talk:ThinkingScience|discuss]] • [[Special:Contributions/ThinkingScience|contribs]]) 10:47, 23 April 2026 (UTC)

:Thanks for sharing. There is plenty of room for neurodiversity community learning. However, the challenge I think is that the intersection of those interested in (a) ND, and (b) English Wikiversity might be very small (e.g., 1!) at this point in time.
:But don't give up hope. For example, Wikipedia has many more ND-interested editors; maybe consider reaching out to see who might be interested:
:[[w:Category:Wikipedians interested in neurodiversity]]
:You could also start an equivalent category here:
:[[:Category:Wikiversitarians interested in neurodiversity]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:46, 6 May 2026 (UTC)

== Request for comment (global AI policy) ==

&lt;bdi lang=&quot;en&quot; dir=&quot;ltr&quot; class=&quot;mw-content-ltr&quot;&gt;A [[:m:Requests for comment/Artificial intelligence policy|request for comment]] is currently being held to decide on a global AI policy. {{int:Feedback-thanks-title}} [[User:MediaWiki message delivery|MediaWiki message delivery]] ([[User talk:MediaWiki message delivery|discuss]] • [[Special:Contributions/MediaWiki message delivery|contribs]]) 00:58, 26 April 2026 (UTC)&lt;/bdi&gt;
&lt;!-- Message sent by User:Codename Noreste@metawiki using the list at https://meta.wikimedia.org/w/index.php?title=Distribution_list/Global_message_delivery&amp;oldid=30424282 --&gt;

== Language learning  ==

toki! I am trying to add or see what the toki pona language learning stuff on here is but I don't see anything that is language learning for anything. [[User:Jan Imon|Jan Imon]] ([[User talk:Jan Imon|discuss]] • [[Special:Contributions/Jan Imon|contribs]]) 23:13, 2 May 2026 (UTC) —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 17:29, 3 May 2026 (UTC)

:We have language materials ([[:Category:Languages]], [[World Languages]], [[Portal:Foreign Language Learning]], [[Portal:Multilingual Studies]]). They are not as developed as I think we would all like and there's not any coverage of Toki Pona, but in principle, we could and would like that. You can also see [[:b:Subject:Languages]] at our sister project Wikibooks. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 17:33, 3 May 2026 (UTC)

== Timeline format? ==

I’ve been working on the World War II articles, including the [[World War II/Timeline|timeline]], and is there a specific timeline format that should be used? Right now it’s just a table, and there’s no separation between different periods/phases of the war.

I don’t want to use [[mw:Extension:EasyTimeline]] because this will be displaying dates and not time periods. [[User:PhilDaBirdMan|PhilDaBirdMan]] ([[User talk:PhilDaBirdMan|discuss]] • [[Special:Contributions/PhilDaBirdMan|contribs]]) 01:35, 4 May 2026 (UTC)

:I dont think we have a policy or guideline, how to format a timeline. But you may try to browes wikiversity by Google if someone was dealing with this in the past somewhow @[[User:PhilDaBirdMan|PhilDaBirdMan]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:23, 5 May 2026 (UTC)
::+1 - there's no specific guideline on how to format a timeline, it's really up to you. In my opinion I think the timeline is good. I'd personally bold the dates just to make it easier to separate it from the event description, but that's my personal 2 cents. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 14:18, 5 May 2026 (UTC)
:::I’ll probably remove links to the dates/years, they’re just Wikipedia pages that shouldn’t be over linked to. [[User:PhilDaBirdMan|PhilDaBirdMan]] ([[User talk:PhilDaBirdMan|discuss]] • [[Special:Contributions/PhilDaBirdMan|contribs]]) 00:39, 6 May 2026 (UTC)

== Interface administrator for Codename Noreste ==
{{Archive top|After running for a week, there is clear consensus for [[User:Codename Noreste]] to have Interface admin rights for 120 days; implemented until 10 September, 2026 -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 22:36, 12 May 2026 (UTC)}}

Hello, everyone. I am requesting interface administrator access on this wiki.

The main reasoning is that I would benefit from having the user right &lt;code&gt;editinterface&lt;/code&gt;, which would allow me to make dark mode changes to pages in the MediaWiki namespace, add &lt;code&gt;&lt;nowiki&gt;&lt;div class=&quot;mw-parser-output&quot;&gt;&lt;/nowiki&gt;&lt;/code&gt; to some interface pages using templates, handle interface-protected edit requests, and similar stuff. Additionally, I have some knowledge of CSS, and I would like to assist with modifying CSS pages whenever necessary, such as moving MediaWiki common.css code to TemplateStyles CSS pages.

I am requesting the maximum time that is allowed per the [[Wikiversity:Interface administrators|policy]], and I have 2FA enabled on my account. Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 00:55, 6 May 2026 (UTC)

*{{support}} Globally trusted user. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 01:07, 6 May 2026 (UTC)
*{{support}} Trusted and knowledgeable. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:35, 6 May 2026 (UTC)
*{{support}} WV would benefit from this. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 08:32, 6 May 2026 (UTC)
*{{support}} --[[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:13, 7 May 2026 (UTC)

:{{Comment}} Could @[[User:Codename Noreste|Codename Noreste]] delete [[MediaWiki:Gadget-WikiSign.js]], which was requested to be deleted @[[User:Koavf|Justin]], @[[User:Jtneill|Jtneill]], @[[User:Atcovi|Atcovi]]? I dont think we need it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:40, 9 May 2026 (UTC)
::Yes - clearly no longer used -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:18, 9 May 2026 (UTC)
::: I can't delete it because I don't have the required permissions to do so.
::: On a side note, if this project has a need for permanent interface administrators, I would suggest that we have a minimum of two IAs, similar to how there must be two CUs and/or suppressors (or none). Maybe Koavf can be a good candidate if I am elected for permanent interface adminship, and I believe that permission shouldn't be removed from someone's own account. Instead, a bureaucrat should do it. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:20, 9 May 2026 (UTC)
::::I am willing and happy to do it, unfortunately, we do not have an appetite for indef IAs and just had a discussion that resulted in a [https://en.wikiversity.org/w/index.php?title=Wikiversity:Interface_administrators&amp;diff=prev&amp;oldid=2807543 consensus that we can have IAs that have the user rights for 14 to 120 days]. So once you have the rights, please make sure to gopher it. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 17:54, 9 May 2026 (UTC)
:::::@[[User:Koavf|Koavf]] give it time. Look at me, I was in favor of shorter time, now I am looking back to times, when custodians could do it without the need of extra flag. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:31, 9 May 2026 (UTC)
::::::Here's hoping. I think it would reduce administrative overhead, but that's just me and I'm not a bureaucrat here. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:33, 9 May 2026 (UTC)
::::Complicated. Where are the times, admins could do everything! [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:27, 9 May 2026 (UTC)
{{archive bottom}}

== [[Wikiversity:Bureaucratship]] to become a policy ==

Following the recent approval of [[Wikiversity:Curators]] as a policy, I think [[Wikiversity:Bureaucratship]] may also be ready for policy status.

Please share your views about whether bureaucratship is ready to become a policy, or whether further revisions are needed.

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 13:58, 9 May 2026 (UTC)
: I added a logo about that user group, but other than that, it looks good to me. {{support}}. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:38, 9 May 2026 (UTC)
:I think that the consensus on this policy is proven by years of using it without further changes. But I I have to say weather I agree with this to become a policy, than of course {{support}}. It works and there were no major issues with it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:45, 9 May 2026 (UTC)
:{{support}} no issues. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 14:51, 10 May 2026 (UTC)
:{{support}} [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 12:37, 11 May 2026 (UTC)
:{{support}} ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 06:51, 12 May 2026 (UTC)

== Reminder about custodian-related pages ==

I would like to remind the community about what the following custodian pages are:
* [[Wikiversity:Request custodian action]] is for requesting actions to be done by custodians, and
* [[Wikiversity:Notices for custodians]] is for notices of interest to custodians, like an administrator's noticeboard
Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:12, 12 May 2026 (UTC)

:Thanks - I needed this reminder :) -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 22:21, 12 May 2026 (UTC)

== [[MediaWiki:Protectedpagetext#Protected edit request on 11 December 2025]] ==

I posted an edit request there 5 months ago, so I’ll be taking it to this page. [[Special:Contributions/&amp;#126;2026-28640-56|&amp;#126;2026-28640-56]] ([[User talk:&amp;#126;2026-28640-56|talk]]) 23:33, 12 May 2026 (UTC)

:What exactly is the problem? I don't understand what needs to change and why. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 23:35, 12 May 2026 (UTC)
: Pinging @[[User:Atcovi|Atcovi]], @[[User:Jtneill|Jtneill]] and @[[User:Juandev|Juandev]] for further input. Someone is requesting a modification to [[MediaWiki:Protectedpagetext]] to use {{tlx|Protected page text}}, but we might need to discuss whether to use the template. In the meantime, I'll start a sandbox version of the protected page text template. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 23:19, 14 May 2026 (UTC)
::Sounds good -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:13, 15 May 2026 (UTC)

== Create a pseudo-bot user group? ==

I would like to propose adding a new user group to Wikiversity: Pseudo-bot (&lt;code&gt;flood&lt;/code&gt;). This will allow users to perform repetitive actions without flushing the recent changes feed (with only the &lt;code&gt;bot&lt;/code&gt; user right). However, I would suggest that for the pseudo-bot user group:
* It can be granted and revoked by custodians. However, can curators add and remove pseudo-bot from their own accounts (and not others)?
* Users can remove themselves from it.
* A guideline might be necessary about the information and usage of it.
Thoughts? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 03:31, 14 May 2026 (UTC)

:This sounds good. Which other wiki could we model this user group on? e.g., [[b:Wikibooks:Pseudo-bots]]? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:19, 15 May 2026 (UTC)
::@[[User:Jtneill|Jtneill]] Wikiquote has a similar group: [[:wikiquote:Special:ListGroupRights]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 04:25, 15 May 2026 (UTC)

== Coming over From wikinews ==
Any chance someone could help me if you are allowed to write news articles here since wikinews is going read only mode soon, thank you! [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 22:43, 1 May 2026 (UTC)

:The scope of Wikiversity is very broad and is basically about more-or-less any learning material. We have made it a point to not have duplicative content of other WMF projects, but since Wikinews is being shuttered, I personally am fine with writing news articles here. One thing that is not controversial at all is a learning resource &lt;em&gt;about&lt;/em&gt; how to write news: that could be hugely useful here and could involve the process of writing news stories to learn and to share back and forth with an editor or fact-checker. In fact, I'd support an entire namespace dedicated to keeping the notion of Wikinews alive here. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 23:38, 1 May 2026 (UTC)
::Thank you so much! How do I start? Cheers! @[[User:Koavf|Koavf]] [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 01:07, 2 May 2026 (UTC)
:::I think it's premature to start just making news articles en masse, but if you want to start discussing the topic of citizen journalism, you can do that now. [[:Category:Journalism]] already has some material, so you can start by seeing what we already have, how you can refine that, etc. You can definitely have learning resources with collaborators who want to learn about journalism ASAP. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 01:24, 2 May 2026 (UTC)
::::thanks. [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 01:38, 2 May 2026 (UTC)
::::If I could try and start one News Article could you please tell me how to go about it? Like what style of writing like Wikinews or something else? Thank you Justin! @[[User:Koavf|Koavf]] [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 01:48, 2 May 2026 (UTC)
:::::Honestly, there are very few policies and guidelines here. I think the best way to write a news story would be in a manner that is obvious and instructive. So, for instance, it's common to use the &quot;pyramid style&quot; when you're writing news, so if you were to write a story that makes it very clear that you are using that approach, that would be helpful. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 02:08, 2 May 2026 (UTC)
::::::cool thanks. [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 02:13, 2 May 2026 (UTC)
::::::im ready to write @[[User:Koavf|Koavf]] [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 21:30, 13 May 2026 (UTC)
:::::::I think we should get more local consensus for a big project like including the entirety of the scope of Wikinews here. Again, I support it personally. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 21:55, 13 May 2026 (UTC)
::::::::ok lets begin. [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 22:15, 13 May 2026 (UTC)

== Proposal to rehost Wikinews here ==

As many of you know, and mentioned here at the Colloquium, our sister project Wikinews recently closed, with all 31 active editions made read-only. [[User:BigKrow]] has asked about the prospect of writing news stories here and I suggested that since we already have [[School:Journalism]] and some resources related to the [[:Category:Journalism|broader topic of journalism]]. I would like to propose that we have continued and indefinite space for {{w|citizen journalism}} by essentially repurposing Wikinews into a sub-project here. The only special infrastructure that Wikinews required was [[:mw:Extension:DynamicPageList]], which was deactivated and caused issues due to a lack of maintenance.

I will add this proposal to the site banner, but I recognize that that may be a conflict of interest, so if anyone requests that I remove it, I will. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:30, 14 May 2026 (UTC)
:I would like to see this conversation go for at least 30 days to establish a consensus. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:35, 14 May 2026 (UTC)

===Votes===
*{{support}} as proposer (with BK's inspiration). I think that an ongoing experiment in citizen journalism is a fit and appropriate use of this site. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:35, 14 May 2026 (UTC)
*{{support}}, hope to seeing ideas about this, and thank you @[[User:Koavf|Koavf]] [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 11:08, 14 May 2026 (UTC)
*{{support}} Other than perhaps inflating the total number of pages reported, I see the idea of &quot;practicing journalism&quot; a worthy and relevant activity within the domain of Wikiversity. [[User:IanVG|IanVG]] ([[User talk:IanVG|discuss]] • [[Special:Contributions/IanVG|contribs]]) 21:41, 14 May 2026 (UTC)
*{{support}} Conditional on development of (a) community guidelines that ensure alignment with Wikiversity's purpose, and (b) clear, nested page-naming structures for projects. More detail below. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:48, 15 May 2026 (UTC)
*{{contra}} This proposal doesn't seem interested in expanding educational materials in journalism, but rather in providing space and protection for Wikinews contributors. But this is contrary to the goals of Wikiversity, and I'm not sure it's a good idea, even with regard to WMF. If WMF decides to close a project and another community lets it run on its domain, that's a bit of an undermining of WMF's and the community's decisions. Given that Wikiversity has had several conflicts with other communities and WMF in its history, I'm against it.--[[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:59, 15 May 2026 (UTC)

===Comments and questions===
:Definitely worthy of discussion, so I have no problem with the proposal in the sitenotice.
:Initial questions:
:* Does this proposal include importing English Wikinews content e.g., to [[Wikinews]] subpages?
:* What are &quot;active editions&quot;?
:* How can Wikiversity navigate the concerns that lead to the closure of Wikinews?
:* Are any changes to the scope of Wikinews proposed?
:* How does [[Wikinews]] fit with the [[Wikiversity:Mission]]? What aligns well? Where might there be tension?
:** e.g., I'm not sure that a page like [[Story/Manchester City moves two points behind Arsenal]] in and of itself will serve as an educational resource.
:-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 05:52, 14 May 2026 (UTC)
:* Does this proposal include importing English Wikinews content e.g., to [[Wikinews]] subpages?
::*No, not at this time.
:* What are &quot;active editions&quot;?
::*There were 30 other active editions of Wikinews in addition to English (e.g. [[:n:es:]]) at the time of universal closure (2026-05-04).
:* How can Wikiversity navigate the concerns that lead to the closure of Wikinews?
::*One of the biggest issues was the problems with DPL, which is now irrelevant. Another was the lack of activity, which can be ameliorated by having it be part of an existing project instead of its own domain (e.g. some editions of Wikipedia host their own Wikinews already and those projects were not impacted by the closure).
:* Are any changes to the scope of Wikinews proposed?
::*Not at this juncture. I would also propose as far as implemention goes that we would request a new namespace and that the material be more-or-less sequestered into its own ongoing project, like Wikijournal is or like the Cookbook and Wikijunior are at our sister [[:b:]].
:* How does [[Wikinews]] fit with the [[Wikiversity:Mission]]? What aligns well? Where might there be tension?
:** e.g., I'm not sure that a page like [[Story/Manchester City moves two points behind Arsenal]] in and of itself will serve as an educational resource.
::*The process of citizen journalists practicing their craft in real-time and collaborating with others to do so is itself an education activity. We would essentially be hosting a real-time experiment in citizen journalism, online communities, and collaborative learning in addition to the prospect of spreading educational information from someone actually reading the news. I would propose that we could also make a more deliberate attempt to engage with learning &lt;em&gt;about&lt;/em&gt; what does and doesn't work with collaborative news writing by experimentation (e.g. audio news, syndicating to other sites, incorporating freely-licensed news from other sources, writing hyper-local news, writing briefs versus longer-term reportage) and also seeing if the problems noted in the Task Force report that recommended closure can be overcome. Note that we have already done some local investigation about and learning about wiki-based journalism on Wikinews here at [[Journalism studies and Wikinews]]. We could continue that learning and refine the process, including incorporating journalism students from universities. As for tensions, Wikinews is the only sister project that must be done with a quick turn-around: if you take a long time to [[:s:|transcribe a book]], that's just how long it takes, but if you take a long time to write news, it ceases to be news entirely. Wikiversity has been a very slow-growing project that has definitely had some successes but has generally come together over a long period with most learning resources being individual passion projects (or sometimes, frankly, crankery) which would not work with collaborative news that requires more than just a single editor writing whatever he feels like.
::Please let me know any other questions/concerns and any other editors feel free to give your own perspective. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 06:13, 14 May 2026 (UTC)
:::Thanks, Justin — it is food for thought.
:::In attempting to understand how we've arrived here, I've summarised some of the background on this page: [[Wikinews]].
:::Perhaps it could be helpful to flesh out more of the vision / ideas / possibilities / challenges on that page? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:49, 14 May 2026 (UTC)

:::*Having given it some thought, in principle, I support hosting [[citizen journalism]] on Wikiversity where it is clearly connected to a learning project and/or constitutes original research, both of which align strongly with [[Wikiversity:Mission|Wikiversity’s educational mission]].
:::*My chief concern is the potential for news content that is not clearly linked to the purpose of Wikiversity. To avoid this, some community-agreed guidelines would be prudent. These need not be overly restrictive; they should support boldness and experimentation while helping ensure alignment with Wikiversity's purpose.
:::*Given the reported low and declining activity on Wikinews, it seems unlikely that English Wikiversity would be overwhelmed by an influx of news-related editing. My impression is that English Wikinews was the most active edition, but even so, many contributors are likely to disperse to other projects or cease editing altogether. A modest migration of interested editors to Wikiversity seems manageable.
:::*At this stage, I do not think a dedicated namespace is necessary. Subpages under [[Wikinews]] or nested pages under relevant learning or research projects, or user-space draft pages should be suitable. I agree that [[Wikijournal]] offers a useful model, as do several existing course structures on Wikiversity.
:::*I support [[User:Koavf]]’s suggestions about framing Wikinews activity explicitly around learning. This would create a distinctive space for experimenting with collaborative news production in ways that are pedagogically meaningful. I agree that the [[journalism studies and Wikinews]] project developed by David and Leigh Blackall through the University of Wollongong is an excellent example of the intersection between Wikiversity and Wikinews. The [[Wikinews]] page could evolve into a hub for such projects.
:::*I've tidied the [[:Category:Wikinews|Wikinews category]] and merged some content into the [[Wikinews]] page. As part of a reinvigoration effort, please review these and related resources such as [[:Category:Journalism]] and [[School:Journalism]].
:::*A further argument in favour of this initiative is that Wikipedia explicitly excludes both news reporting and original research. So, there is value in maintaining spaces within the Wikimedia ecosystem where these forms of knowledge production can be openly developed and curated. Such work can, in turn, generate valuable evidence and source material that may later inform Wikipedia articles.
:::*The closure of WMF-hosted Wikinews does not imply that open wiki-based news curation lacks value. Indeed, the closure documentation appears supportive of experimentation with alternative news models across Wikimedia projects, including through Wikipedia and Wikidata. In that context, Wikiversity seems a natural home for a Wikinews experiment, provided it is clearly grounded in learning and/or research.
:::-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:39, 15 May 2026 (UTC)
My understanding towards Wikinews' failure is that everything takes too long to be approved for the publish status, which means that any breaking news would have already become days-old stale news. Wikinews has a brand recognition (for right or wrong reasons) than Wikiversity and I wonder how effective Wikiversity can attract the &quot;Wikinews refugees&quot; to edit here. And just a quick note on the governance. Since each Wikiversity language operates independently, each language has to vote &amp; adopt this proposal independently. [[User:OhanaUnited|&lt;b&gt;&lt;span style=&quot;color: #0000FF;&quot;&gt;OhanaUnited&lt;/span&gt;&lt;/b&gt;]][[User talk:OhanaUnited|&lt;b&gt;&lt;span style=&quot;color: green;&quot;&gt;&lt;sup&gt;Talk page&lt;/sup&gt;&lt;/span&gt;&lt;/b&gt;]] 13:47, 15 May 2026 (UTC)

:Your assessment about Wikinews is partially correct. I referenced it earlier, but to be explicit, there is a [[:m:Proposal for Closing Wikinews|report by a task force on sister projects]] that outlines their concerns. There are a few, one of which was the nature of the staleness of news. Thanks also for clarifying that this proposal is only relevant to en.wv and is not binding or even proposed for other editions of Wikiversity. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:54, 15 May 2026 (UTC)

== Inactivity policy for Curators ==

I was wondering if there is a specific inactivity polity for curators (semi-admins) as I am pretty sure the global policy does not apply to them as they are not ''fully'' sysops. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 03:20, 15 February 2026 (UTC)

:Unfortunately, I don't see an inactivity policy, but if we were to create such a new policy for curators, it should be the same for custodians (administrators). [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 18:45, 15 February 2026 (UTC)
::@[[User:Codename Noreste|Codename Noreste]] There is currently none, that I could find, for custodians either. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:47, 17 February 2026 (UTC)
:::I think we should propose a local inactivity policy for custodians (and by extension, curators), which should be at least one year without any edits ''and'' logged actions. However, I don't know which page should it be when the inactivity removal procedure starts. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 00:53, 17 February 2026 (UTC)
::::@[[User:Codename Noreste|Codename Noreste]] In theory, there should be a section added at [[WV:Candidates for custodianship]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:55, 17 February 2026 (UTC)
::::: To be consistent with the [[meta:Admin activity review|global period of 2 years inactivity]] for en.wv  [[Wikiversity:Custodianship#Notes|Custodians]] and [[Wikiversity:Bureaucratship#How are bureaucrats removed?|Bureaucrats]] we could add something like this to [[Wikiversity:Curators]]:
::::::The maximum time period of inactivity &lt;u&gt;without community review&lt;/u&gt; for curators is two years (consistent with  the [[:meta:Category:Global policies|global policy]] described at [[meta:Admin activity review|Admin activity review]] which applies for [[Wikiversity:Custodianship#Notes|Custodians]] and [[Wikiversity:Bureaucratship|Bureaucrats]]). After that time a custodian will remove the rights.
::::: -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:51, 27 March 2026 (UTC)
:::::Yup, I agree with Jtneill, there is a policy proposal for Wikiversity:Curators, where it should be logically deployed. The question is if we are ready to aprove the policy. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:43, 17 April 2026 (UTC)
:::::: I agree, but we should notify the colloquium about inactive curators, just like a steward would do for inactive custodians and bureaucrats per [[:m:Admin activity review|AAR]]. What is the minimum timeframe an inactive curator should receive so they can respond they would keep their rights? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 17:49, 17 April 2026 (UTC)
:I incorporated these suggestions into the proposed curators policy. Please review/comment/improve. Summary: 2 years, notify curator's user page, then remove rights after 1 month: [[Wikiversity:Curators#Inactivity]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 08:59, 24 April 2026 (UTC)
:: @[[User:Jtneill|Jtneill]] I created [[Template:Inactive curator]] for this. Feel free to make any changes or improvements. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:29, 24 April 2026 (UTC)
:::Wondering, should we also have:
:::* {{tl|Inactive custodian}}
:::* {{tl|Inactive bureaucrat}}
:::or perhaps just a single template with a parameter(s) for the user right(s)/role(s)? e.g., 
:::* if a custodian is inactive for 2 years, then custodian and curator rights are to be removed and 
:::* if a bureaucrat is inactive for 2 years, then bureaucrat, custodian, and curator rights are to to be removed.
:::-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:58, 13 May 2026 (UTC)
:::: I would probably modify that template when we actually develop our own inactivity policy, because we're currently under the AAR (a steward notifies the colloquium with [[m:Admin activity review/Notice to communities]], and inactive advanced right holders with [[m:Admin activity review/Notice to inactive right holders]]). [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:16, 13 May 2026 (UTC)
:::::Ah, I see. Yes, that makes sense. Thankyou. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:21, 15 May 2026 (UTC)
: In that case, should we develop our own inactivity policy (e.g. on [[Wikiversity:Inactivity policy]] or [[Wikiversity:Support staff/Inactivity]])? I would list the general inactivity part, the process, etc. Once it's approved as a policy, I will [[m:Stewards' noticeboard|notify the stewards]]. Thoughts? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:30, 16 May 2026 (UTC)
::Originally, I would have thought that, for a small wiki like en.wv, it made sense to leave inactivity monitoring to the stewards. However, with the creation of the curator user group, we have already taken on local responsibility for monitoring inactivity in at least one advanced-rights group. Extending this to custodians and bureaucrats would not add much additional overhead and would provide a more consistent and transparent local administrative process.
::One option would be to develop a single, centralised policy covering all advanced-rights groups.
::An alternative would be to include an ==Inactivity== section on each relevant policy page (e.g., we already have [[Wikiversity:Curatorship#Inactivity]], but not yet in the custodianship, and bureaucratship policy pages). This approach would allow some flexibility because different user groups may warrant different criteria (such as inactivity thresholds, qualifying activity, or review procedures).
::A hybrid approach may be best: maintain separate inactivity sections within each user-group policy page, while transcluding these into a central overview page such as Codename Noreste suggests. This would preserve clarity at the local policy level while also providing a single reference point for consistency and oversight. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 23:09, 16 May 2026 (UTC)

==Curator inactivity review==
These curators haven't been active for &gt; 2 years. As per the [[Wikiversity:Curatorship|curatorship policy]]:
* [[Special:Log/Cody naccarato]] was notified on their talk page by [[User:Codename Noreste|Codename Noreste]] on 24 Apr 2026
* [[Special:Log/Praxidicae]] was notified on their talk page by [[User:Codename Noreste|Codename Noreste]] on 24 Apr 2026
* [[Special:Log/Tegel]] was notified on their talk page by [[User:Jtneill|Jtneill]] notified their talk page on 16 May 2026

The policy allows a month to hear from these users. If no response, a custodian will remove their curator rights.

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 06:14, 16 May 2026 (UTC)
: For Cody naccarato and Praxidicae, their rights are to be removed by the 19th of May if they don't respond either here or on their talk page. For Tegel, the removal will happen on the 16th of June, probably. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:13, 16 May 2026 (UTC)
::Should be 24 May for Cody naccarato and Praxidicae? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 23:11, 16 May 2026 (UTC)</text>
      <sha1>4x78sgfe5ala2smrircyc78mam0foba</sha1>
    </revision>
    <revision>
      <id>2809823</id>
      <parentid>2809776</parentid>
      <timestamp>2026-05-17T03:18:05Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Curator inactivity review */ reply to Jtneill ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809823</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="81597" sha1="ek9hssag1if4eum9433jws2ui0poi4f" xml:space="preserve">{{Wikiversity:Colloquium/Header}}
&lt;!-- MESSAGES GO BELOW --&gt;
== New titles for user right nominations ==
&lt;div class=&quot;cd-moveMark&quot;&gt;''Moved from [[Wikiversity talk:Candidates for Custodianship#New titles for user right nominations]].  [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 23:20, 17 April 2026 (UTC)''&lt;/div&gt;

I would like to propose the following retitles should a user be nominated for any of the following user rights:
* Curator: Candidates for Curatorship
* Bureaucrat: Candidates for Bureaucratship
The reason is that many curator (and probably bureaucrat) requests have run solely under {{tq|Candidates for Custodianship}}, but that title might sound misleading (especially in regards to the permission a user is requesting). CheckUser and Oversight (suppressor) are not included above since no user was nominated for these sensitive permissions, probably. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 01:30, 19 March 2026 (UTC)

:And it's not that when someone at the beginning misplaced the request, no one thought to move it and the others copied it. Even today, it would be possible to simply take it all and move it. Otherwise, for me, the more fundamental problem is that there is [[Wikiversity:Curators|no approved policy for curators]] than where the requests are based. Curators then operate in a certain vacuum and if one of them &quot;breaks out of the chain&quot;, the average user doesn't have many transparent tools to deal with it, because there is no policy. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:02, 19 March 2026 (UTC)
::I am not talking about the curator page (policy proposal). [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 19:08, 21 March 2026 (UTC)
: @[[User:Juandev|Juandev]] I'll see if I can do an overhaul of [[Wikiversity:Candidates for Custodianship]], just like I recently did with the Requests for adminship page on English Wikiquote. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 22:17, 18 April 2026 (UTC)
:Yes, great idea - ideally there will be separate &quot;Candidates for ...&quot; pages for each user right group. The most important for now is to separate curator and custodian pages as CN suggests. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:39, 1 May 2026 (UTC)
:So maybe I previously misunderstood. Are you proposing separated pages for nominations (i.e. [[Wikiversity:Candidates for Curatorship]], [[Wikiversity:Candidates for Bureaucratship]], [[Wikiversity:Candidates for Custodianship]])? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:30, 5 May 2026 (UTC)
:: Yes. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:33, 5 May 2026 (UTC)
:::I see, then I am fine with that @[[User:Codename Noreste|Codename Noreste]]. Sorry for misunderstanding. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:35, 9 May 2026 (UTC)

I've split the user rights nomination pages into:
* [[Wikiversity:Candidates for CheckUser]]
* [[Wikiversity:Candidates for Curatorship]]
* [[Wikiversity:Candidates for Custodianship]]
* [[Wikiversity:Candidates for Bureaucratship]]

Please review. There are likely several links to update, text to adjust, categories to manage, short-cuts to fix etc. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:22, 10 May 2026 (UTC)

:Thanks, great job @[[User:Jtneill|Jtneill]]. I am wondering if we need to move archived nominations too, or if we are OK with the actual state. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:08, 10 May 2026 (UTC)
::Yes, I think that would be helpful. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:46, 10 May 2026 (UTC)
:::I can do it @[[User:Jtneill|Jtneill]], I am just looking what system is there. I can see [[Wikiversity:Candidates for Custodianship/Archive of nominations for full custodianship]] which is a good complementary overview to the subpages with full history. The name of the pages is probably stably, but I would consider to create more specific redirect like [[Wikiversity:Candidates for Custodianship/Overview of staff nominations]], which would link to the above one. Then there is a [[Wikiversity:Candidates for Custodianship/Archived]], which are probably incomplete nominations, right? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:37, 11 May 2026 (UTC)
::::Tx @[[User:Juandev|Juandev]]. Yes, this makes sense. And maybe we move:
::::* archived '''curator''' nominations from [[Wikiversity:Candidates for Custodianship/Archive of nominations for full custodianship]] to e.g., [[Wikiversity:Candidates for Curatorship/Archive of nominations]]
::::* archived '''bureaucrat''' nominations from [[Wikiversity:Candidates for Custodianship/Archive of nominations for full custodianship ]] to e.g., [[Wikiversity:Candidates for Bureaucratship/Archive of nominations]]
::::-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:12, 11 May 2026 (UTC)
:::::OK. That sounds good. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:25, 12 May 2026 (UTC)
:An svg icon for [[Wikiversity:Curatorship|curators]] would also be helpful. We have them for other user rights: [[c:Category:Wikiversity user rights icons]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:54, 10 May 2026 (UTC)
::Done: [[Wikiversity:Curators]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 01:44, 11 May 2026 (UTC)

== Technical Request:  Courtesy link.. ==

[[Template_talk:Information#Background_must_have_color_defined_as_well]] [[User:ShakespeareFan00|ShakespeareFan00]] ([[User talk:ShakespeareFan00|discuss]] • [[Special:Contributions/ShakespeareFan00|contribs]]) 11:43, 20 March 2026 (UTC)
: I can't edit the template directly as it need an sysop/interface admin to do it. [[User:ShakespeareFan00|ShakespeareFan00]] ([[User talk:ShakespeareFan00|discuss]] • [[Special:Contributions/ShakespeareFan00|contribs]]) 11:43, 20 March 2026 (UTC)
:: Also if the Template field of - https://en.wikiversity.org/wiki/Special:LintErrors/night-mode-unaware-background-color is examined, there is poential for an admin to clear a substantial proportion of these by implmenting a simmilar fix to the indciated templates (and underlying stylesheets). It would be nice to clear things like Project box and others, as many other templates (and thus pages depend on them.) :)
[[User:ShakespeareFan00|ShakespeareFan00]] ([[User talk:ShakespeareFan00|discuss]] • [[Special:Contributions/ShakespeareFan00|contribs]]) 11:43, 20 March 2026 (UTC)

:I think it would be best to grant you interface admin rights for a short period of time to make these changes. However, I still have doubts about the suitability of this solution, which may cause other problems and no one has explained to me why dark mode has to be implemented this way @[[User:ShakespeareFan00|ShakespeareFan00]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:43, 20 March 2026 (UTC)

: I would have reservations about holding such rights, which is why I was trying to do what I could without needing them. However if it is the only way to get the required changes made, I would suggest asking on Wikipedia to find technical editors, willing to undertake the changes needed. [[User:ShakespeareFan00|ShakespeareFan00]] ([[User talk:ShakespeareFan00|discuss]] • [[Special:Contributions/ShakespeareFan00|contribs]]) 09:32, 21 March 2026 (UTC)

== WikiEducator has closed ==

Some of you may know of a similar project to Wikiversity, called [https://wikieducator.org/Main_Page WikiEducator], championed by [https://oerfoundation.org/about/staff/wayne-mackintosh/ Wayne Mackintosh][https://www.linkedin.com/posts/waynemackintosh_important-notice-about-the-oer-foundation-activity-7405113051688931329-Nhm9/][https://openeducation.nz/killed-not-starved/].

It seems [https://openeducation.nz/terminating-oer-foundation their foundation has closed] and they are no longer operating.

They had done quite a bit of outreach (e.g., in the Pacific and Africa) to get educators using wiki.

The WikiEducator content is still available in MediaWiki - and potentially could be imported to Wikiversity ([https://wikieducator.org/WikiEducator:Copyrights CC-BY-SA] is the default license).

The closing of WikiEducator arguably makes the nurturing of Wikiversity even more important.

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:09, 1 April 2026 (UTC)

:I was never active there. If anyone has an account or is otherwise in contact, we may want to copy relevant information here or even at [[:outreach:]]. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 04:46, 1 April 2026 (UTC)

:: I reached out to [[User:Mackiwg~enwikiversity|Wayne]] in January, and he responded briefly but positively (while travelling).  I wrote to the low-traffic wikieducator mailing list today and got a nice [https://groups.google.com/g/wikieducator/c/r_yIyUw6ZIA reply] from [[user:SteveFoerster|Steve Foerster]] who's interested in helping. If we can figure out a migration path it would be great to adopt at least the main namespace pages here.  
:: A few questions that come to mind: 
:: - would people want to create matching user accounts
:: - are there any namespaces (user/talk?) that should not be moved over
:: We could look at how this was done for the [[m:Wikivoyage/Migration]] wikivoyage migration. &lt;span style=&quot;padding:0 2px 0 2px;background-color:white;color:#bbb;&quot;&gt;&amp;ndash;[[User:Sj|SJ]][[User Talk:Sj|&lt;span style=&quot;color:#ff9900;&quot;&gt;+&lt;/span&gt;]]&lt;/span&gt; 04:27, 1 May 2026 (UTC)
:::That's fantastic, SJ, that you've reached out and that Wayne, Steve, and Jim are receptive—and that you can help! -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:52, 1 May 2026 (UTC)
::::A matching accound makes sense to give credits to the original authors and keep a clean chain of versions. The initial commit into wikiversity could have a &quot;marker with timestamp&quot; similar to signature with a reference where the content's source or a Web archive. This would allow authors to continue there work on wikiversity if they wish. [[User:Bert Niehaus|Bert Niehaus]] ([[User talk:Bert Niehaus|discuss]] • [[Special:Contributions/Bert Niehaus|contribs]]) 06:30, 15 May 2026 (UTC)

== Wikinews is ending ==

Apparently mainly due to low editorial activity, low public interest, but also failure to achieve the goals from the proposal for the creation of the project, the Wikinews project is ending after years of discussions ([[Meta:Proposal for Closing Wikinews|some reading]]).

And I would be interested to see how Wikiversity is doing in the monitored metrics. We probably have more editors than Wikinews had, but what about consumers and achieving the goals? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 19:14, 1 April 2026 (UTC)

:Wikiversity's biggest issue in recent times was the hosting of low-quality, trash content. Thankfully we've done a great job in removing pseudoscience and other embarrassingly trash content (Wikidebates, for example), but the biggest concern moving forward is proper maintenance IMO. I've caught several pseudoscience pages being created within the last few months that could easily have flown under the radar (ex, [[The Kelemen Dilemma: Causal Collapse and Axiomatic Instability]]), so I'd urge our custodians/curators to be on the lookout for this type of content. Usually an AI-overview can point this type of content out relatively well.
:In terms of visibility, I believe Wikiversity is a high-traffic project. I remember my [[Mathematical Properties]] showing up on the first page of Google when searching up &quot;math properties&quot; for the longest time (and is still showing up in the first page 'till this day!). Besides, Wikinews hosted a lot of short-term content (the nature of news articles), while Wikiversity hosts content that can still be useful a decade later (ex, [[A Reader's Guide to Annotation]]). 
:I think we are on a better path than we were a few months ago, and I do want to thank everyone here who has been helping out with maintaining our website! —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 20:48, 1 April 2026 (UTC)
:For what it's worth, the group that did that study has since disbanded, so no one is monitoring the other sister projects in the same way. Additionally, Wikinews had some catastrophic server issues due to the maintenance of [[:m:Extension:DynamicPageList]] which don't apply here. Your questions are still worth addressing, but I just wanted to cut off any concern at the pass about Wikiversity being in the same precarious situation. Wikiversity is definitely the biggest &quot;lagging behind&quot; or &quot;failure&quot; project now that Wikinews is being shuttered, but I don't see any near- or medium-term pathway to closing Wikiversity. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 00:46, 2 April 2026 (UTC)

:[[w:en:Wikipedia:Wikipedia Signpost/2026-03-31/News and notes|Entirety of Wikinews to be shut down]] (Wikipedia Signpost) -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:03, 11 April 2026 (UTC)

== Action Required: Update templates/modules for electoral maps (Migrating from P1846 to P14226) ==

Hello everyone,

This is a notice regarding an ongoing data migration on Wikidata that may affect your election-related templates and Lua modules (such as &lt;code&gt;Module:Itemgroup/list&lt;/code&gt;).

'''The Change:'''&lt;br /&gt;
Currently, many templates pull electoral maps from Wikidata using the property [[:d:Property:P1846|P1846]], combined with the qualifier [[:d:Property:P180|P180]]: [[:d:Q19571328|Q19571328]]. 

We are migrating this data (across roughly 4,000 items) to a newly created, dedicated property: '''[[:d:Property:P14226|P14226]]'''.

'''What You Need To Do:'''&lt;br /&gt;
To ensure your templates and infoboxes do not break or lose their maps, please update your local code to fetch data from [[:d:Property:P14226|P14226]] instead of the old [[:d:Property:P1846|P1846]] + [[:d:Property:P180|P180]] structure. A [[m:Wikidata/Property Migration: P1846 to P14226/List|list of pages]] was generated using Wikimedia Global Search.

'''Deadline:'''&lt;br /&gt;
We are temporarily retaining the old data on [[:d:Property:P1846|P1846]] to allow for a smooth transition. However, to complete the data cleanup on Wikidata, the old [[:d:Property:P1846|P1846]] statements will be removed after '''May 1, 2026'''. Please update your modules and templates before this date to prevent any disruption to your wiki's election articles.

Let us know if you have any questions or need assistance with the query logic. Thank you for your help! [[User:ZI Jony|ZI Jony]] using [[User:MediaWiki message delivery|MediaWiki message delivery]] ([[User talk:MediaWiki message delivery|discuss]] • [[Special:Contributions/MediaWiki message delivery|contribs]]) 17:11, 3 April 2026 (UTC)
&lt;!-- Message sent by User:ZI Jony@metawiki using the list at https://meta.wikimedia.org/w/index.php?title=Distribution_list/Non-Technical_Village_Pumps_distribution_list&amp;oldid=29941252 --&gt;
:I didnt find such properties, so we are probably fine. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:00, 12 April 2026 (UTC)
:: +1 (agreed). [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 22:19, 12 April 2026 (UTC)

== Enable the abuse filter block action? ==

In light of [[Special:AbuseLog/80178]] (coupon spam), I would like to propose enabling the block action for the abuse filter. Only custodians will be able to enable and disable that action on an abuse filter, and it is useful to block ongoing vandalism. Thoughts? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 19:12, 13 April 2026 (UTC)

:Seems like a good idea, almost all of the users which create such pages are spambots so this shouldn’t be a problem. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 23:41, 13 April 2026 (UTC)
:Can you explain some more (I am new to abuse filters)? It looks like the attempted edit was prevented? Which abuse filter?
:Note on your suggestion, have also reactivated Antispam Filter 12 - see [[WV:RCA]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:45, 15 April 2026 (UTC)
:: I am proposing that we activate the abuse filter block action, which if a user triggers an abuse filter, it would actually block the user in question - the same mechanism that a custodian would use to block users. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:11, 15 April 2026 (UTC)
:::OK, thankyou, that makes sense. And, reviewing the abuse filter 12 log, it would be helpful because it would prevent the need for manual blocking. But I don't see a setting for autoblocking? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 23:14, 15 April 2026 (UTC)
:::: I think it probably adds an autoblock. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 00:43, 16 April 2026 (UTC)
: [[User:Jtneill|Jtneill]] and [[User:PieWriter|PieWriter]], given that a little bit more than a week has passed and there is minimal consensus to activate the abuse filter block action, I filed [[phab:T424053]]. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:05, 21 April 2026 (UTC)
::Thank-you for doing this. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 08:03, 24 April 2026 (UTC)

== Advice needed: A Neurodiversity-inspired Idea/observation ==

If I want the greatest participation of others to &quot;provide constructive criticism to my idea&quot; or to &quot;shoot down my idea&quot; or &quot;idea&quot;.

What I've called it so far is &quot;The Neurodiversity-inspired Idea&quot;. At other times I used more sensationalist wording but here on Wikiversity I don't dare do that. I actually woke up with thinking about putting this into my userspace draft: &quot;Personal Observations Made By Meeting Autistic and Non-Autistic Adults&quot;.

My ultimate goal is to stop blathering about my &quot;idea&quot; to friend and family without feeling my &quot;methodology&quot; is going into any progressive direction whatsoever. My latest encounter was somewhat constructive though. A friend of a friend who worked with people presenting ideas in attempting to getting grants. I don't want a grant. I just want to figure out how I can express my &quot;idea&quot; in a way so that I can more clearly figure out what flaws it got.

At the same time I tend to overthink. If anyone thinks etherpad might be a good place and considering Wikimedia already got an etherpad at https://etherpad.wikimedia.org/ if anyone feels like they know me better in the future feel free to suggest a &quot;session&quot; on etherpad.

'''If I don't receive a reply to this in 1 week's time I will begin to explore this &quot;idea&quot; into my userspace''' unless you replied and refrained me from doing so, of course. Then maybe after &quot;developing it there&quot; I might reference it to you another future time here in the Colloquium, with my &quot;idea&quot; still in my userspace draft. This &quot;idea&quot; is sort of a burden, I'm happy I've made the choice to get rid of it and hopefully move on with my life, unless there is something to this &quot;idea&quot;. 

My failure is probably evident: I feel I haven't told you anything. Same happened to when I talked to friends and family. In danger of overthinking it further I'll publish this right now. I need to &quot;keep it together&quot; [[User:ThinkingScience|ThinkingScience]] ([[User talk:ThinkingScience|discuss]] • [[Special:Contributions/ThinkingScience|contribs]]) 10:36, 16 April 2026 (UTC)

:Good on you putting it out there ... and hitting publish :). I'd say go for it (no need to wait), give birth to your idea and share about it here and elsewhere. Let it take shape and see where it might go. In many ways, this is exactly what an open collaborative learning community should be doing. Others might not know well how to respond, so perhaps consider creating some questions to accompany the idea. Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:21, 16 April 2026 (UTC)
::Thank you for encouraging me in developing the idea.
::I have created a &quot;questions&quot; section in the draft which is visible in the table of contents now. My brain was &quot;frozen&quot; today metaphorically speaking in that I felt I had like a &quot;writer's block&quot; so the draft has more &quot;AI/LLM&quot; content than before. I used the LLM for generating questions. The answers are so far human-only.
::I've also created a subsection where I could add the prompts that made the LLM generate the questions. That could help people make better prompts perhaps. I've described what it is about inside of it and there are some chaotically written notes.
::[[Draft:The_Neurodiversity-inspired_Idea#Questions_that_might_encourage_the_development_of_this_idea_and_its_methodology]]
::My draft is missing stuff. Any questions that you contribute to my draft will probably help me and if I don't understand the questions I'll probably notify you and also at the same time &quot;feed them&quot; to an LLM and ask in my input like &quot;explain in simple words what this question means, what is it searching for?&quot; etc. while I wait for an answer. If you have any more feedback please give it to me here or on the Draft page, its talk page or my user talk page. Thank you for helping me! [[User:ThinkingScience|ThinkingScience]] ([[User talk:ThinkingScience|discuss]] • [[Special:Contributions/ThinkingScience|contribs]]) 21:20, 18 April 2026 (UTC)
::Today I woke up with not only thinking about supplying questions along with the &quot;idea&quot; but also answers. ie. Is it possible to &quot;test&quot; this idea? Is it possible to create one or multiple hypotheses based on this &quot;idea&quot;?(etc.) I've thought about this before in this &quot;idea&quot; but since I'm beginning to add to Wikiversity what was previously 'locked in my mind' it's also easier for me to see what I've done so far. Thank you for this comment! [[User:ThinkingScience|ThinkingScience]] ([[User talk:ThinkingScience|discuss]] • [[Special:Contributions/ThinkingScience|contribs]]) 09:11, 23 April 2026 (UTC)
:May I think that you should not add deadlines ; being read, and rising interest for collaboration, or even simply for exchange of thoughts, such an effective meeting event loads a huge bunch of unprobability, which time can help to… somehow diminish. Maybe, I would advice you having a central place for developping your ideas, your needs, your advances, maybe a page in your own user zone, and from time to time, depending your feeling, it could be every trimester or so, or more frequently, you could write a short account of progress (or even of no progress), or a call for participation, in such a place as this present one ; I think that will increase much exposure of your projet. Maybe also, if you can find a project name, not necessarily very meaningfull by itseilf (at least it will gain signification with time, as your project develops), that will serve as a kind-of hook, and make your announcement titles more visible. Best regards (and my excuses for my poor command of English, which seems to be unplease an anti-abuse filter, &quot;Questionable Language (profanity)&quot;, which I don't understand…). My few cents. --  [[User:Eric.LEWIN|Eric.LEWIN]] ([[User talk:Eric.LEWIN|discussion]] • [[Special:Contributions/Eric.LEWIN|contributions]]) 10:06, 17 April 2026 (UTC)
::Sorry about the false positive on the profanity filter - I've fixed it. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:26, 17 April 2026 (UTC)
:::&quot;May I think that you should not add deadlines ; being read, and rising interest for collaboration, or even simply for exchange of thoughts, such an effective meeting event loads a huge bunch of unprobability, which time can help to… somehow diminish.&quot;
::Thank you Eric for this comment. Trust in time is how I interpret it. I should not feel like I need to be in a hurry. I'll try to give this time. Thank you!
:::&quot;Maybe, I would advice you having a central place for developping your ideas, your needs, your advances, maybe a page in your own user zone, and from time to time, depending your feeling, it could be every trimester or so, or more frequently, you could write a short account of progress (or even of no progress), or a call for participation, in such a place as this present one ; I think that will increase much exposure of your projet.&quot;
::A central place for developing or making &quot;project notes&quot; regarding the Neurodiversity idea on my userspace, I might need that, like a diary or &quot;project notes&quot; of the Neurodiversity idea similar to my course notes regarding my experience with Coursera.
::Any actions I take are going to be related to my Userspace from now on but I'll also update the draft when necessary. Now in the beginning I might be working daily to once every 3 days on both the draft and the daily notes I plan to make.
:::&quot;Maybe also, if you can find a project name, not necessarily very meaningfull by itseilf (at least it will gain signification with time, as your project develops), that will serve as a kind-of hook, and make your announcement titles more visible.&quot;
::Thank you for the advice. I was brainstorming yesterday about it. I concluded that since I've not yet developed a methodology that adheres to &quot;Do no harm&quot; and this is my first time working my &quot;idea&quot; into a way that is compatible with how projects develop on English Wikiversity this is new to me. My methodology isn't developed and therefore trying to get attention to my project through a name can wait. Yesterday I figured out a silly title that has nothing to do with the project: &quot;Planetary Awareness Potato Cabbage Rolls&quot; or something like that. Google output read that no such thing exists so I wanted it mainly to be unique. I don't want to raise attention that I'm unsure whether I'll actually be capable of developing a methodology for but project notes is my best bet so far in tracking my progress. Every day I think about this &quot;idea&quot; but I need to improve the important parts.
:::&quot;Best regards (and my excuses for my poor command of English, which seems to be unplease an anti-abuse filter, &quot;Questionable Language (profanity)&quot;, which I don't understand…). My few cents.&quot;
::You added great points and I felt that I was helped by you! I encourage you to post again and I can understand that interacting with any kind of automated filter can be discouraging and can be for me too! Thank you for giving me feedback! [[User:ThinkingScience|ThinkingScience]] ([[User talk:ThinkingScience|discuss]] • [[Special:Contributions/ThinkingScience|contribs]]) 16:01, 18 April 2026 (UTC)

== Add some user rights to the curator user group? ==

By default, only custodians have the ability to mark new pages as patrolled (&lt;code&gt;patrol&lt;/code&gt;) and have their own page creations automatically marked as patrolled (&lt;code&gt;autopatrol&lt;/code&gt;). I am proposing both of the following:
* Curators can mark new pages as patrolled, helping on reducing the backlog of new, unpatrolled pages.
* New pages made by curators will be automatically marked as patrolled by the MediaWiki software.
Before we implement this, I would suggest implementing a proposed guideline for marking new pages as patrolled for curators and custodians.

Thoughts? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 16:32, 17 April 2026 (UTC)

:Agree, &lt;s&gt;also can we also allow curators to undelete pages since they already have the rights to delete them?&lt;/s&gt; [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 02:54, 18 April 2026 (UTC)
::I think the requirement that undelete NOT be included came from above (meta / stewards / central office). Having access to the undelete page gives access to information that is restricted by their policies to admins (custodians and bureaucrats). -- [[User:Dave Braunschweig|Dave Braunschweig]] ([[User talk:Dave Braunschweig|discuss]] • [[Special:Contributions/Dave Braunschweig|contribs]]) 20:12, 18 April 2026 (UTC)
::: [[User:PieWriter|PieWriter]], unless if requests for curator and custodian should be RfA-like processes (that is, including voting and comments), then I have to agree with Dave above. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 22:03, 18 April 2026 (UTC)
::::Oh, I didn’t realise that. Withdrawing my comment.. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:08, 19 April 2026 (UTC)
:{{support}} Seems reasonable and would reduce overhead. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 14:35, 18 April 2026 (UTC)
:'''Agree''', implement it also to [[Wikiversity:Curators]] proposal please. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:11, 18 April 2026 (UTC)
: I went ahead and filed [[phab:T424445]]. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:39, 26 April 2026 (UTC)

== [[Wikiversity:Curators|Curators and curators policy]] ==
{{archive top|There is strong consensus, so [[Wikiversity:Curators]] is now a policy. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:15, 9 May 2026 (UTC)}}
How does it come, that Wikiversity has curators, but Curators policy is still being proposed? How do the curators exists and act if the policy about them havent been approved yet? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:33, 16 October 2025 (UTC)

:It looks as if it is not just curators. The policy on Bureaucratship is still being proposed as well. See [[Wikiversity:Bureaucratship]]. —[[User:RailwayEnthusiast2025|&lt;span style=&quot;font-family:Verdana; color:#008000; text-shadow:gray 0.2em 0.2em 0.4em;&quot;&gt;RailwayEnthusiast2025&lt;/span&gt;]] &lt;sup&gt;[[User talk:RailwayEnthusiast2025|&lt;span style=&quot;color:#59a53f&quot;&gt;''talk with me!''&lt;/span&gt;]]&lt;/sup&gt; 18:33, 27 October 2025 (UTC)

:I think its just the nature of a small WMF sister project in that there are lots of drafts, gaps, and potential improvements. In this case, these community would need to vote on those proposed Wikiversity staff policies if we think they're ready. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:08, 3 December 2025 (UTC)
:What? I thought you were getting it approved, Juandev... :) [[User:I&amp;#39;m Mr. Chris|I&amp;#39;m Mr. Chris]] ([[User talk:I&amp;#39;m Mr. Chris|discuss]] • [[Special:Contributions/I&amp;#39;m Mr. Chris|contribs]]) 14:20, 12 February 2026 (UTC)
::Yeah I think this one is important too and we need to aprove it too @[[User:I'm Mr. Chris|I'm Mr. Chris]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 15:56, 12 February 2026 (UTC)
:::I thinks its ready to made into a policy, it seems to be complete and informative about what the rights does and how to get it. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 03:08, 15 February 2026 (UTC)
::::Agree -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:00, 27 March 2026 (UTC)

Let's make this the official discussion about adopting the [[Wikiversity:Curators|curators policy]] policy. Your comments are invited and welcome. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 08:40, 24 April 2026 (UTC)
: There were two similar Colloquium threads in separate places about the proposed curators policy. So I've moved them to be adjacent. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 12:42, 1 May 2026 (UTC)
{{archive bottom}}

== Wikiversity:Curators to become a policy ==
{{archive top|There is strong consensus, so [[Wikiversity:Curators]] is now a policy. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:16, 9 May 2026 (UTC)}}
I've looked at the discussions about the Curators policy, I've looked at the practices, and it seems to me that there is no dispute about the wording of the policy, and what's more, the community has been using this proposal as if it were an offical policy for several years. Therefore, I propose that [[Wikiversity:Curators]] become a policy. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:35, 18 April 2026 (UTC)

:{{support}} —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:54, 18 April 2026 (UTC)
:{{support}} —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 20:21, 18 April 2026 (UTC)
: {{support|Yes, please}}. Especially after when I and PieWriter proposed above, I agree. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:27, 24 April 2026 (UTC)
:: @[[User:Juandev|Juandev]]; as of now, curators now have the user rights &lt;code&gt;autopatrol&lt;/code&gt; and &lt;code&gt;patrol&lt;/code&gt;. Perhaps we should also include that in [[Wikiversity:Custodianship]]? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 12:07, 30 April 2026 (UTC)
:::You meant [[Wikiversity:Curators]] @[[User:Codename Noreste|Codename Noreste]]? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:15, 5 May 2026 (UTC)
:::: I agree that we must develop what rules curators should follow when marking new pages as patrolled; the same can be added for custodians since they can also mark new pages as patrolled. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:37, 5 May 2026 (UTC)
:::::I see, well I think you can just add this to the policy. It is not major change and it probably reflects actual practice or actual technical possibilities for those flags. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:20, 7 May 2026 (UTC)
:{{support}} -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 12:42, 1 May 2026 (UTC)
:{{Support}} per nom. [[User:PhilDaBirdMan|PhilDaBirdMan]] ([[User talk:PhilDaBirdMan|discuss]] • [[Special:Contributions/PhilDaBirdMan|contribs]]) 13:32, 1 May 2026 (UTC)
{{Archive bottom}}

== Inactive curators ==

Hello, even though [[Wikiversity:Curators]] is not a policy yet, there are curators listed here that have been inactive for two years or more:
* {{user|Cody naccarato}} (last edit on 13 Dec 2022, last logged action on 10 Dec 2022)
* {{user|Praxidicae}} (last edit on 10 Sep 2022, last logged action on 12 Sep 2022)
[[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 21:14, 19 April 2026 (UTC)

:Yup, I would remove the rights. To get the rights back if theyll come back should not be a big deal. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:08, 24 April 2026 (UTC)
:: When they don't reply by May 19, feel free (or any custodian) to do so. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 00:28, 25 April 2026 (UTC)

== Is anyone interested in Neurodiversity? ==

Is anyone interested in Neurodiversity? Is there anyone here who is interested for Neurodiversity to be &quot;something more&quot; than it already is? Does anyone here consider Neurodiversity one of the &quot;harder topics&quot; to work on or discuss? Does anyone here have an opinion about the [[Neurodiversity Movement]]? So these questions don't appear like &quot;out of a vacuum&quot; I can tell you a bit about my background:

Many years ago I got a psychiatric diagnosis &quot;Asperger's&quot;. After I stepped out of the office and my Äsperger's was 'concluded', I stepped out into the street and thought my first negative thought(but the positive thought followed after). The thought was about concentration camps in the second world war and that the world seemed to be going into the direction of &quot;labeling others&quot;. I was unsure whether this was &quot;real science&quot; and sort of &quot;challenged myself&quot; to make up my own mind after meeting people that had been given this diagnosis. The more adults with this diagnosis I met the more I started seeing &quot;patterns&quot;.

Was it a coincidence that the first person with Asperger's I met reminded me about my father later after I had plenty of times of experience with interacting with him? None of the people I interacted with online through IRC text chat...I felt I got any clue about how &quot;their brains work&quot;. Only when I met one person from the Asperger's chat community in person we both realized that whatever we experienced was akin to the &quot;chaos theory&quot;. He told me about &quot;chaos theory&quot; while I didn't know even what that term meant but I guess I 'read between the lines'. My question that I linger on still today is &quot;did he understand about me what I think I understood about him?&quot;? That our brains had the same configuration? Most autistic adults who meet other autistic adults usually get disappointed. They think the diagnosis will help them meet somebody like themselves and then they realize the great diversity in the autistic spectrum created by Psychiatry.

I later stopped interacting with autistic communities that much, I felt that it did not benefit me. Also Neurodiversity's &quot;neurotypes&quot; interested me for a while until I realized I had &quot;misunderstood everything&quot; about them and how they are used in the Neurodiversity Movement or &quot;Neurodiversity community&quot; if that even can precisely be defined? I doubt it but if you want to contribute to the [[Neurodiversity Movement]]. My previous attempts failed as I got more and more confused. I think a community project needs a community. With a lack of that I don't think it is worth my time. If any of you would like to work on that project let me know on my talk page.

So I was kinda lost and was talking to my friend and psychologist and I realized if I never talk about my idea to anyone in a &quot;comprehensive way&quot; or show that it matters to me nothing is going to ever happen. So I started talking about my &quot;idea&quot; more. Nobody could understand the &quot;idea&quot; because I had not developed my skills regarding where to start...although the process had already started &quot;automatically&quot; and that's why I often think of &quot;well my brain sort of activated me&quot;. I don't feel like I did have a plan and this idea happened. It happened &quot;by itself&quot;. My brain reacted to what I was seeing in a video or stream.

I value interaction highly in this idea. I think it would be helpful to make a community of people who are not paranoid about stuff that can express itself like &quot;don't analyze me!&quot;, &quot;don't compare me to anyone!&quot;. 

On the contrary, more often than not those adults who were diagnosed were actually openly comparing themselves with each other and I think that is healthy in a &quot;science&quot; way if done the &quot;right way&quot; which probably means &quot;Do no harm&quot;.

I found video material is important but I'm very unsure if uploading own video material to Wikimedia Commons would constitute a &quot;reasonable&quot; use of the resources there. Maybe somebody here needs to ask more questions to me that I should answer before that happens. I also know the '''be bold''' so I could just do what I think might be ok. Though I work better in a group as long as I know what &quot;group configurations&quot; help me. This is in a non-profit way. Since the state supported me this might be a way I am trying to &quot;give back&quot; to the state and &quot;the world&quot;. May seem overly ambitious and crazy but this thing gives me energy. It gives me hope when trying to develop this idea. [[User:ThinkingScience|ThinkingScience]] ([[User talk:ThinkingScience|discuss]] • [[Special:Contributions/ThinkingScience|contribs]]) 10:47, 23 April 2026 (UTC)

:Thanks for sharing. There is plenty of room for neurodiversity community learning. However, the challenge I think is that the intersection of those interested in (a) ND, and (b) English Wikiversity might be very small (e.g., 1!) at this point in time.
:But don't give up hope. For example, Wikipedia has many more ND-interested editors; maybe consider reaching out to see who might be interested:
:[[w:Category:Wikipedians interested in neurodiversity]]
:You could also start an equivalent category here:
:[[:Category:Wikiversitarians interested in neurodiversity]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:46, 6 May 2026 (UTC)

== Request for comment (global AI policy) ==

&lt;bdi lang=&quot;en&quot; dir=&quot;ltr&quot; class=&quot;mw-content-ltr&quot;&gt;A [[:m:Requests for comment/Artificial intelligence policy|request for comment]] is currently being held to decide on a global AI policy. {{int:Feedback-thanks-title}} [[User:MediaWiki message delivery|MediaWiki message delivery]] ([[User talk:MediaWiki message delivery|discuss]] • [[Special:Contributions/MediaWiki message delivery|contribs]]) 00:58, 26 April 2026 (UTC)&lt;/bdi&gt;
&lt;!-- Message sent by User:Codename Noreste@metawiki using the list at https://meta.wikimedia.org/w/index.php?title=Distribution_list/Global_message_delivery&amp;oldid=30424282 --&gt;

== Language learning  ==

toki! I am trying to add or see what the toki pona language learning stuff on here is but I don't see anything that is language learning for anything. [[User:Jan Imon|Jan Imon]] ([[User talk:Jan Imon|discuss]] • [[Special:Contributions/Jan Imon|contribs]]) 23:13, 2 May 2026 (UTC) —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 17:29, 3 May 2026 (UTC)

:We have language materials ([[:Category:Languages]], [[World Languages]], [[Portal:Foreign Language Learning]], [[Portal:Multilingual Studies]]). They are not as developed as I think we would all like and there's not any coverage of Toki Pona, but in principle, we could and would like that. You can also see [[:b:Subject:Languages]] at our sister project Wikibooks. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 17:33, 3 May 2026 (UTC)

== Timeline format? ==

I’ve been working on the World War II articles, including the [[World War II/Timeline|timeline]], and is there a specific timeline format that should be used? Right now it’s just a table, and there’s no separation between different periods/phases of the war.

I don’t want to use [[mw:Extension:EasyTimeline]] because this will be displaying dates and not time periods. [[User:PhilDaBirdMan|PhilDaBirdMan]] ([[User talk:PhilDaBirdMan|discuss]] • [[Special:Contributions/PhilDaBirdMan|contribs]]) 01:35, 4 May 2026 (UTC)

:I dont think we have a policy or guideline, how to format a timeline. But you may try to browes wikiversity by Google if someone was dealing with this in the past somewhow @[[User:PhilDaBirdMan|PhilDaBirdMan]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:23, 5 May 2026 (UTC)
::+1 - there's no specific guideline on how to format a timeline, it's really up to you. In my opinion I think the timeline is good. I'd personally bold the dates just to make it easier to separate it from the event description, but that's my personal 2 cents. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 14:18, 5 May 2026 (UTC)
:::I’ll probably remove links to the dates/years, they’re just Wikipedia pages that shouldn’t be over linked to. [[User:PhilDaBirdMan|PhilDaBirdMan]] ([[User talk:PhilDaBirdMan|discuss]] • [[Special:Contributions/PhilDaBirdMan|contribs]]) 00:39, 6 May 2026 (UTC)

== Interface administrator for Codename Noreste ==
{{Archive top|After running for a week, there is clear consensus for [[User:Codename Noreste]] to have Interface admin rights for 120 days; implemented until 10 September, 2026 -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 22:36, 12 May 2026 (UTC)}}

Hello, everyone. I am requesting interface administrator access on this wiki.

The main reasoning is that I would benefit from having the user right &lt;code&gt;editinterface&lt;/code&gt;, which would allow me to make dark mode changes to pages in the MediaWiki namespace, add &lt;code&gt;&lt;nowiki&gt;&lt;div class=&quot;mw-parser-output&quot;&gt;&lt;/nowiki&gt;&lt;/code&gt; to some interface pages using templates, handle interface-protected edit requests, and similar stuff. Additionally, I have some knowledge of CSS, and I would like to assist with modifying CSS pages whenever necessary, such as moving MediaWiki common.css code to TemplateStyles CSS pages.

I am requesting the maximum time that is allowed per the [[Wikiversity:Interface administrators|policy]], and I have 2FA enabled on my account. Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 00:55, 6 May 2026 (UTC)

*{{support}} Globally trusted user. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 01:07, 6 May 2026 (UTC)
*{{support}} Trusted and knowledgeable. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:35, 6 May 2026 (UTC)
*{{support}} WV would benefit from this. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 08:32, 6 May 2026 (UTC)
*{{support}} --[[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:13, 7 May 2026 (UTC)

:{{Comment}} Could @[[User:Codename Noreste|Codename Noreste]] delete [[MediaWiki:Gadget-WikiSign.js]], which was requested to be deleted @[[User:Koavf|Justin]], @[[User:Jtneill|Jtneill]], @[[User:Atcovi|Atcovi]]? I dont think we need it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:40, 9 May 2026 (UTC)
::Yes - clearly no longer used -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:18, 9 May 2026 (UTC)
::: I can't delete it because I don't have the required permissions to do so.
::: On a side note, if this project has a need for permanent interface administrators, I would suggest that we have a minimum of two IAs, similar to how there must be two CUs and/or suppressors (or none). Maybe Koavf can be a good candidate if I am elected for permanent interface adminship, and I believe that permission shouldn't be removed from someone's own account. Instead, a bureaucrat should do it. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:20, 9 May 2026 (UTC)
::::I am willing and happy to do it, unfortunately, we do not have an appetite for indef IAs and just had a discussion that resulted in a [https://en.wikiversity.org/w/index.php?title=Wikiversity:Interface_administrators&amp;diff=prev&amp;oldid=2807543 consensus that we can have IAs that have the user rights for 14 to 120 days]. So once you have the rights, please make sure to gopher it. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 17:54, 9 May 2026 (UTC)
:::::@[[User:Koavf|Koavf]] give it time. Look at me, I was in favor of shorter time, now I am looking back to times, when custodians could do it without the need of extra flag. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:31, 9 May 2026 (UTC)
::::::Here's hoping. I think it would reduce administrative overhead, but that's just me and I'm not a bureaucrat here. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:33, 9 May 2026 (UTC)
::::Complicated. Where are the times, admins could do everything! [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:27, 9 May 2026 (UTC)
{{archive bottom}}

== [[Wikiversity:Bureaucratship]] to become a policy ==

Following the recent approval of [[Wikiversity:Curators]] as a policy, I think [[Wikiversity:Bureaucratship]] may also be ready for policy status.

Please share your views about whether bureaucratship is ready to become a policy, or whether further revisions are needed.

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 13:58, 9 May 2026 (UTC)
: I added a logo about that user group, but other than that, it looks good to me. {{support}}. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:38, 9 May 2026 (UTC)
:I think that the consensus on this policy is proven by years of using it without further changes. But I I have to say weather I agree with this to become a policy, than of course {{support}}. It works and there were no major issues with it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:45, 9 May 2026 (UTC)
:{{support}} no issues. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 14:51, 10 May 2026 (UTC)
:{{support}} [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 12:37, 11 May 2026 (UTC)
:{{support}} ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 06:51, 12 May 2026 (UTC)

== Reminder about custodian-related pages ==

I would like to remind the community about what the following custodian pages are:
* [[Wikiversity:Request custodian action]] is for requesting actions to be done by custodians, and
* [[Wikiversity:Notices for custodians]] is for notices of interest to custodians, like an administrator's noticeboard
Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:12, 12 May 2026 (UTC)

:Thanks - I needed this reminder :) -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 22:21, 12 May 2026 (UTC)

== [[MediaWiki:Protectedpagetext#Protected edit request on 11 December 2025]] ==

I posted an edit request there 5 months ago, so I’ll be taking it to this page. [[Special:Contributions/&amp;#126;2026-28640-56|&amp;#126;2026-28640-56]] ([[User talk:&amp;#126;2026-28640-56|talk]]) 23:33, 12 May 2026 (UTC)

:What exactly is the problem? I don't understand what needs to change and why. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 23:35, 12 May 2026 (UTC)
: Pinging @[[User:Atcovi|Atcovi]], @[[User:Jtneill|Jtneill]] and @[[User:Juandev|Juandev]] for further input. Someone is requesting a modification to [[MediaWiki:Protectedpagetext]] to use {{tlx|Protected page text}}, but we might need to discuss whether to use the template. In the meantime, I'll start a sandbox version of the protected page text template. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 23:19, 14 May 2026 (UTC)
::Sounds good -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:13, 15 May 2026 (UTC)

== Create a pseudo-bot user group? ==

I would like to propose adding a new user group to Wikiversity: Pseudo-bot (&lt;code&gt;flood&lt;/code&gt;). This will allow users to perform repetitive actions without flushing the recent changes feed (with only the &lt;code&gt;bot&lt;/code&gt; user right). However, I would suggest that for the pseudo-bot user group:
* It can be granted and revoked by custodians. However, can curators add and remove pseudo-bot from their own accounts (and not others)?
* Users can remove themselves from it.
* A guideline might be necessary about the information and usage of it.
Thoughts? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 03:31, 14 May 2026 (UTC)

:This sounds good. Which other wiki could we model this user group on? e.g., [[b:Wikibooks:Pseudo-bots]]? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:19, 15 May 2026 (UTC)
::@[[User:Jtneill|Jtneill]] Wikiquote has a similar group: [[:wikiquote:Special:ListGroupRights]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 04:25, 15 May 2026 (UTC)

== Coming over From wikinews ==
Any chance someone could help me if you are allowed to write news articles here since wikinews is going read only mode soon, thank you! [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 22:43, 1 May 2026 (UTC)

:The scope of Wikiversity is very broad and is basically about more-or-less any learning material. We have made it a point to not have duplicative content of other WMF projects, but since Wikinews is being shuttered, I personally am fine with writing news articles here. One thing that is not controversial at all is a learning resource &lt;em&gt;about&lt;/em&gt; how to write news: that could be hugely useful here and could involve the process of writing news stories to learn and to share back and forth with an editor or fact-checker. In fact, I'd support an entire namespace dedicated to keeping the notion of Wikinews alive here. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 23:38, 1 May 2026 (UTC)
::Thank you so much! How do I start? Cheers! @[[User:Koavf|Koavf]] [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 01:07, 2 May 2026 (UTC)
:::I think it's premature to start just making news articles en masse, but if you want to start discussing the topic of citizen journalism, you can do that now. [[:Category:Journalism]] already has some material, so you can start by seeing what we already have, how you can refine that, etc. You can definitely have learning resources with collaborators who want to learn about journalism ASAP. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 01:24, 2 May 2026 (UTC)
::::thanks. [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 01:38, 2 May 2026 (UTC)
::::If I could try and start one News Article could you please tell me how to go about it? Like what style of writing like Wikinews or something else? Thank you Justin! @[[User:Koavf|Koavf]] [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 01:48, 2 May 2026 (UTC)
:::::Honestly, there are very few policies and guidelines here. I think the best way to write a news story would be in a manner that is obvious and instructive. So, for instance, it's common to use the &quot;pyramid style&quot; when you're writing news, so if you were to write a story that makes it very clear that you are using that approach, that would be helpful. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 02:08, 2 May 2026 (UTC)
::::::cool thanks. [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 02:13, 2 May 2026 (UTC)
::::::im ready to write @[[User:Koavf|Koavf]] [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 21:30, 13 May 2026 (UTC)
:::::::I think we should get more local consensus for a big project like including the entirety of the scope of Wikinews here. Again, I support it personally. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 21:55, 13 May 2026 (UTC)
::::::::ok lets begin. [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 22:15, 13 May 2026 (UTC)

== Proposal to rehost Wikinews here ==

As many of you know, and mentioned here at the Colloquium, our sister project Wikinews recently closed, with all 31 active editions made read-only. [[User:BigKrow]] has asked about the prospect of writing news stories here and I suggested that since we already have [[School:Journalism]] and some resources related to the [[:Category:Journalism|broader topic of journalism]]. I would like to propose that we have continued and indefinite space for {{w|citizen journalism}} by essentially repurposing Wikinews into a sub-project here. The only special infrastructure that Wikinews required was [[:mw:Extension:DynamicPageList]], which was deactivated and caused issues due to a lack of maintenance.

I will add this proposal to the site banner, but I recognize that that may be a conflict of interest, so if anyone requests that I remove it, I will. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:30, 14 May 2026 (UTC)
:I would like to see this conversation go for at least 30 days to establish a consensus. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:35, 14 May 2026 (UTC)

===Votes===
*{{support}} as proposer (with BK's inspiration). I think that an ongoing experiment in citizen journalism is a fit and appropriate use of this site. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:35, 14 May 2026 (UTC)
*{{support}}, hope to seeing ideas about this, and thank you @[[User:Koavf|Koavf]] [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 11:08, 14 May 2026 (UTC)
*{{support}} Other than perhaps inflating the total number of pages reported, I see the idea of &quot;practicing journalism&quot; a worthy and relevant activity within the domain of Wikiversity. [[User:IanVG|IanVG]] ([[User talk:IanVG|discuss]] • [[Special:Contributions/IanVG|contribs]]) 21:41, 14 May 2026 (UTC)
*{{support}} Conditional on development of (a) community guidelines that ensure alignment with Wikiversity's purpose, and (b) clear, nested page-naming structures for projects. More detail below. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:48, 15 May 2026 (UTC)
*{{contra}} This proposal doesn't seem interested in expanding educational materials in journalism, but rather in providing space and protection for Wikinews contributors. But this is contrary to the goals of Wikiversity, and I'm not sure it's a good idea, even with regard to WMF. If WMF decides to close a project and another community lets it run on its domain, that's a bit of an undermining of WMF's and the community's decisions. Given that Wikiversity has had several conflicts with other communities and WMF in its history, I'm against it.--[[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:59, 15 May 2026 (UTC)

===Comments and questions===
:Definitely worthy of discussion, so I have no problem with the proposal in the sitenotice.
:Initial questions:
:* Does this proposal include importing English Wikinews content e.g., to [[Wikinews]] subpages?
:* What are &quot;active editions&quot;?
:* How can Wikiversity navigate the concerns that lead to the closure of Wikinews?
:* Are any changes to the scope of Wikinews proposed?
:* How does [[Wikinews]] fit with the [[Wikiversity:Mission]]? What aligns well? Where might there be tension?
:** e.g., I'm not sure that a page like [[Story/Manchester City moves two points behind Arsenal]] in and of itself will serve as an educational resource.
:-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 05:52, 14 May 2026 (UTC)
:* Does this proposal include importing English Wikinews content e.g., to [[Wikinews]] subpages?
::*No, not at this time.
:* What are &quot;active editions&quot;?
::*There were 30 other active editions of Wikinews in addition to English (e.g. [[:n:es:]]) at the time of universal closure (2026-05-04).
:* How can Wikiversity navigate the concerns that lead to the closure of Wikinews?
::*One of the biggest issues was the problems with DPL, which is now irrelevant. Another was the lack of activity, which can be ameliorated by having it be part of an existing project instead of its own domain (e.g. some editions of Wikipedia host their own Wikinews already and those projects were not impacted by the closure).
:* Are any changes to the scope of Wikinews proposed?
::*Not at this juncture. I would also propose as far as implemention goes that we would request a new namespace and that the material be more-or-less sequestered into its own ongoing project, like Wikijournal is or like the Cookbook and Wikijunior are at our sister [[:b:]].
:* How does [[Wikinews]] fit with the [[Wikiversity:Mission]]? What aligns well? Where might there be tension?
:** e.g., I'm not sure that a page like [[Story/Manchester City moves two points behind Arsenal]] in and of itself will serve as an educational resource.
::*The process of citizen journalists practicing their craft in real-time and collaborating with others to do so is itself an education activity. We would essentially be hosting a real-time experiment in citizen journalism, online communities, and collaborative learning in addition to the prospect of spreading educational information from someone actually reading the news. I would propose that we could also make a more deliberate attempt to engage with learning &lt;em&gt;about&lt;/em&gt; what does and doesn't work with collaborative news writing by experimentation (e.g. audio news, syndicating to other sites, incorporating freely-licensed news from other sources, writing hyper-local news, writing briefs versus longer-term reportage) and also seeing if the problems noted in the Task Force report that recommended closure can be overcome. Note that we have already done some local investigation about and learning about wiki-based journalism on Wikinews here at [[Journalism studies and Wikinews]]. We could continue that learning and refine the process, including incorporating journalism students from universities. As for tensions, Wikinews is the only sister project that must be done with a quick turn-around: if you take a long time to [[:s:|transcribe a book]], that's just how long it takes, but if you take a long time to write news, it ceases to be news entirely. Wikiversity has been a very slow-growing project that has definitely had some successes but has generally come together over a long period with most learning resources being individual passion projects (or sometimes, frankly, crankery) which would not work with collaborative news that requires more than just a single editor writing whatever he feels like.
::Please let me know any other questions/concerns and any other editors feel free to give your own perspective. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 06:13, 14 May 2026 (UTC)
:::Thanks, Justin — it is food for thought.
:::In attempting to understand how we've arrived here, I've summarised some of the background on this page: [[Wikinews]].
:::Perhaps it could be helpful to flesh out more of the vision / ideas / possibilities / challenges on that page? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:49, 14 May 2026 (UTC)

:::*Having given it some thought, in principle, I support hosting [[citizen journalism]] on Wikiversity where it is clearly connected to a learning project and/or constitutes original research, both of which align strongly with [[Wikiversity:Mission|Wikiversity’s educational mission]].
:::*My chief concern is the potential for news content that is not clearly linked to the purpose of Wikiversity. To avoid this, some community-agreed guidelines would be prudent. These need not be overly restrictive; they should support boldness and experimentation while helping ensure alignment with Wikiversity's purpose.
:::*Given the reported low and declining activity on Wikinews, it seems unlikely that English Wikiversity would be overwhelmed by an influx of news-related editing. My impression is that English Wikinews was the most active edition, but even so, many contributors are likely to disperse to other projects or cease editing altogether. A modest migration of interested editors to Wikiversity seems manageable.
:::*At this stage, I do not think a dedicated namespace is necessary. Subpages under [[Wikinews]] or nested pages under relevant learning or research projects, or user-space draft pages should be suitable. I agree that [[Wikijournal]] offers a useful model, as do several existing course structures on Wikiversity.
:::*I support [[User:Koavf]]’s suggestions about framing Wikinews activity explicitly around learning. This would create a distinctive space for experimenting with collaborative news production in ways that are pedagogically meaningful. I agree that the [[journalism studies and Wikinews]] project developed by David and Leigh Blackall through the University of Wollongong is an excellent example of the intersection between Wikiversity and Wikinews. The [[Wikinews]] page could evolve into a hub for such projects.
:::*I've tidied the [[:Category:Wikinews|Wikinews category]] and merged some content into the [[Wikinews]] page. As part of a reinvigoration effort, please review these and related resources such as [[:Category:Journalism]] and [[School:Journalism]].
:::*A further argument in favour of this initiative is that Wikipedia explicitly excludes both news reporting and original research. So, there is value in maintaining spaces within the Wikimedia ecosystem where these forms of knowledge production can be openly developed and curated. Such work can, in turn, generate valuable evidence and source material that may later inform Wikipedia articles.
:::*The closure of WMF-hosted Wikinews does not imply that open wiki-based news curation lacks value. Indeed, the closure documentation appears supportive of experimentation with alternative news models across Wikimedia projects, including through Wikipedia and Wikidata. In that context, Wikiversity seems a natural home for a Wikinews experiment, provided it is clearly grounded in learning and/or research.
:::-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:39, 15 May 2026 (UTC)
My understanding towards Wikinews' failure is that everything takes too long to be approved for the publish status, which means that any breaking news would have already become days-old stale news. Wikinews has a brand recognition (for right or wrong reasons) than Wikiversity and I wonder how effective Wikiversity can attract the &quot;Wikinews refugees&quot; to edit here. And just a quick note on the governance. Since each Wikiversity language operates independently, each language has to vote &amp; adopt this proposal independently. [[User:OhanaUnited|&lt;b&gt;&lt;span style=&quot;color: #0000FF;&quot;&gt;OhanaUnited&lt;/span&gt;&lt;/b&gt;]][[User talk:OhanaUnited|&lt;b&gt;&lt;span style=&quot;color: green;&quot;&gt;&lt;sup&gt;Talk page&lt;/sup&gt;&lt;/span&gt;&lt;/b&gt;]] 13:47, 15 May 2026 (UTC)

:Your assessment about Wikinews is partially correct. I referenced it earlier, but to be explicit, there is a [[:m:Proposal for Closing Wikinews|report by a task force on sister projects]] that outlines their concerns. There are a few, one of which was the nature of the staleness of news. Thanks also for clarifying that this proposal is only relevant to en.wv and is not binding or even proposed for other editions of Wikiversity. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:54, 15 May 2026 (UTC)

== Inactivity policy for Curators ==

I was wondering if there is a specific inactivity polity for curators (semi-admins) as I am pretty sure the global policy does not apply to them as they are not ''fully'' sysops. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 03:20, 15 February 2026 (UTC)

:Unfortunately, I don't see an inactivity policy, but if we were to create such a new policy for curators, it should be the same for custodians (administrators). [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 18:45, 15 February 2026 (UTC)
::@[[User:Codename Noreste|Codename Noreste]] There is currently none, that I could find, for custodians either. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:47, 17 February 2026 (UTC)
:::I think we should propose a local inactivity policy for custodians (and by extension, curators), which should be at least one year without any edits ''and'' logged actions. However, I don't know which page should it be when the inactivity removal procedure starts. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 00:53, 17 February 2026 (UTC)
::::@[[User:Codename Noreste|Codename Noreste]] In theory, there should be a section added at [[WV:Candidates for custodianship]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:55, 17 February 2026 (UTC)
::::: To be consistent with the [[meta:Admin activity review|global period of 2 years inactivity]] for en.wv  [[Wikiversity:Custodianship#Notes|Custodians]] and [[Wikiversity:Bureaucratship#How are bureaucrats removed?|Bureaucrats]] we could add something like this to [[Wikiversity:Curators]]:
::::::The maximum time period of inactivity &lt;u&gt;without community review&lt;/u&gt; for curators is two years (consistent with  the [[:meta:Category:Global policies|global policy]] described at [[meta:Admin activity review|Admin activity review]] which applies for [[Wikiversity:Custodianship#Notes|Custodians]] and [[Wikiversity:Bureaucratship|Bureaucrats]]). After that time a custodian will remove the rights.
::::: -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:51, 27 March 2026 (UTC)
:::::Yup, I agree with Jtneill, there is a policy proposal for Wikiversity:Curators, where it should be logically deployed. The question is if we are ready to aprove the policy. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:43, 17 April 2026 (UTC)
:::::: I agree, but we should notify the colloquium about inactive curators, just like a steward would do for inactive custodians and bureaucrats per [[:m:Admin activity review|AAR]]. What is the minimum timeframe an inactive curator should receive so they can respond they would keep their rights? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 17:49, 17 April 2026 (UTC)
:I incorporated these suggestions into the proposed curators policy. Please review/comment/improve. Summary: 2 years, notify curator's user page, then remove rights after 1 month: [[Wikiversity:Curators#Inactivity]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 08:59, 24 April 2026 (UTC)
:: @[[User:Jtneill|Jtneill]] I created [[Template:Inactive curator]] for this. Feel free to make any changes or improvements. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:29, 24 April 2026 (UTC)
:::Wondering, should we also have:
:::* {{tl|Inactive custodian}}
:::* {{tl|Inactive bureaucrat}}
:::or perhaps just a single template with a parameter(s) for the user right(s)/role(s)? e.g., 
:::* if a custodian is inactive for 2 years, then custodian and curator rights are to be removed and 
:::* if a bureaucrat is inactive for 2 years, then bureaucrat, custodian, and curator rights are to to be removed.
:::-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:58, 13 May 2026 (UTC)
:::: I would probably modify that template when we actually develop our own inactivity policy, because we're currently under the AAR (a steward notifies the colloquium with [[m:Admin activity review/Notice to communities]], and inactive advanced right holders with [[m:Admin activity review/Notice to inactive right holders]]). [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:16, 13 May 2026 (UTC)
:::::Ah, I see. Yes, that makes sense. Thankyou. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:21, 15 May 2026 (UTC)
: In that case, should we develop our own inactivity policy (e.g. on [[Wikiversity:Inactivity policy]] or [[Wikiversity:Support staff/Inactivity]])? I would list the general inactivity part, the process, etc. Once it's approved as a policy, I will [[m:Stewards' noticeboard|notify the stewards]]. Thoughts? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:30, 16 May 2026 (UTC)
::Originally, I would have thought that, for a small wiki like en.wv, it made sense to leave inactivity monitoring to the stewards. However, with the creation of the curator user group, we have already taken on local responsibility for monitoring inactivity in at least one advanced-rights group. Extending this to custodians and bureaucrats would not add much additional overhead and would provide a more consistent and transparent local administrative process.
::One option would be to develop a single, centralised policy covering all advanced-rights groups.
::An alternative would be to include an ==Inactivity== section on each relevant policy page (e.g., we already have [[Wikiversity:Curatorship#Inactivity]], but not yet in the custodianship, and bureaucratship policy pages). This approach would allow some flexibility because different user groups may warrant different criteria (such as inactivity thresholds, qualifying activity, or review procedures).
::A hybrid approach may be best: maintain separate inactivity sections within each user-group policy page, while transcluding these into a central overview page such as Codename Noreste suggests. This would preserve clarity at the local policy level while also providing a single reference point for consistency and oversight. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 23:09, 16 May 2026 (UTC)

==Curator inactivity review==
These curators haven't been active for &gt; 2 years. As per the [[Wikiversity:Curatorship|curatorship policy]]:
* [[Special:Log/Cody naccarato]] was notified on their talk page by [[User:Codename Noreste|Codename Noreste]] on 24 Apr 2026
* [[Special:Log/Praxidicae]] was notified on their talk page by [[User:Codename Noreste|Codename Noreste]] on 24 Apr 2026
* [[Special:Log/Tegel]] was notified on their talk page by [[User:Jtneill|Jtneill]] notified their talk page on 16 May 2026

The policy allows a month to hear from these users. If no response, a custodian will remove their curator rights.

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 06:14, 16 May 2026 (UTC)
: For Cody naccarato and Praxidicae, their rights are to be removed by the 19th of May if they don't respond either here or on their talk page. For Tegel, the removal will happen on the 16th of June, probably. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:13, 16 May 2026 (UTC)
::Should be 24 May for Cody naccarato and Praxidicae? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 23:11, 16 May 2026 (UTC)
::: I made [[#Inactive curators]] on the 19th of April. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 03:18, 17 May 2026 (UTC)</text>
      <sha1>ek9hssag1if4eum9433jws2ui0poi4f</sha1>
    </revision>
    <revision>
      <id>2809871</id>
      <parentid>2809823</parentid>
      <timestamp>2026-05-17T06:36:48Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <comment>Moving inactive curator thread to be adjacent to related topics</comment>
      <origin>2809871</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="81597" sha1="gan90vsl1uz69oh6u3hi5s4tz2q014x" xml:space="preserve">{{Wikiversity:Colloquium/Header}}
&lt;!-- MESSAGES GO BELOW --&gt;
== New titles for user right nominations ==
&lt;div class=&quot;cd-moveMark&quot;&gt;''Moved from [[Wikiversity talk:Candidates for Custodianship#New titles for user right nominations]].  [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 23:20, 17 April 2026 (UTC)''&lt;/div&gt;

I would like to propose the following retitles should a user be nominated for any of the following user rights:
* Curator: Candidates for Curatorship
* Bureaucrat: Candidates for Bureaucratship
The reason is that many curator (and probably bureaucrat) requests have run solely under {{tq|Candidates for Custodianship}}, but that title might sound misleading (especially in regards to the permission a user is requesting). CheckUser and Oversight (suppressor) are not included above since no user was nominated for these sensitive permissions, probably. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 01:30, 19 March 2026 (UTC)

:And it's not that when someone at the beginning misplaced the request, no one thought to move it and the others copied it. Even today, it would be possible to simply take it all and move it. Otherwise, for me, the more fundamental problem is that there is [[Wikiversity:Curators|no approved policy for curators]] than where the requests are based. Curators then operate in a certain vacuum and if one of them &quot;breaks out of the chain&quot;, the average user doesn't have many transparent tools to deal with it, because there is no policy. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:02, 19 March 2026 (UTC)
::I am not talking about the curator page (policy proposal). [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 19:08, 21 March 2026 (UTC)
: @[[User:Juandev|Juandev]] I'll see if I can do an overhaul of [[Wikiversity:Candidates for Custodianship]], just like I recently did with the Requests for adminship page on English Wikiquote. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 22:17, 18 April 2026 (UTC)
:Yes, great idea - ideally there will be separate &quot;Candidates for ...&quot; pages for each user right group. The most important for now is to separate curator and custodian pages as CN suggests. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:39, 1 May 2026 (UTC)
:So maybe I previously misunderstood. Are you proposing separated pages for nominations (i.e. [[Wikiversity:Candidates for Curatorship]], [[Wikiversity:Candidates for Bureaucratship]], [[Wikiversity:Candidates for Custodianship]])? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:30, 5 May 2026 (UTC)
:: Yes. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:33, 5 May 2026 (UTC)
:::I see, then I am fine with that @[[User:Codename Noreste|Codename Noreste]]. Sorry for misunderstanding. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:35, 9 May 2026 (UTC)

I've split the user rights nomination pages into:
* [[Wikiversity:Candidates for CheckUser]]
* [[Wikiversity:Candidates for Curatorship]]
* [[Wikiversity:Candidates for Custodianship]]
* [[Wikiversity:Candidates for Bureaucratship]]

Please review. There are likely several links to update, text to adjust, categories to manage, short-cuts to fix etc. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:22, 10 May 2026 (UTC)

:Thanks, great job @[[User:Jtneill|Jtneill]]. I am wondering if we need to move archived nominations too, or if we are OK with the actual state. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:08, 10 May 2026 (UTC)
::Yes, I think that would be helpful. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:46, 10 May 2026 (UTC)
:::I can do it @[[User:Jtneill|Jtneill]], I am just looking what system is there. I can see [[Wikiversity:Candidates for Custodianship/Archive of nominations for full custodianship]] which is a good complementary overview to the subpages with full history. The name of the pages is probably stably, but I would consider to create more specific redirect like [[Wikiversity:Candidates for Custodianship/Overview of staff nominations]], which would link to the above one. Then there is a [[Wikiversity:Candidates for Custodianship/Archived]], which are probably incomplete nominations, right? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:37, 11 May 2026 (UTC)
::::Tx @[[User:Juandev|Juandev]]. Yes, this makes sense. And maybe we move:
::::* archived '''curator''' nominations from [[Wikiversity:Candidates for Custodianship/Archive of nominations for full custodianship]] to e.g., [[Wikiversity:Candidates for Curatorship/Archive of nominations]]
::::* archived '''bureaucrat''' nominations from [[Wikiversity:Candidates for Custodianship/Archive of nominations for full custodianship ]] to e.g., [[Wikiversity:Candidates for Bureaucratship/Archive of nominations]]
::::-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:12, 11 May 2026 (UTC)
:::::OK. That sounds good. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:25, 12 May 2026 (UTC)
:An svg icon for [[Wikiversity:Curatorship|curators]] would also be helpful. We have them for other user rights: [[c:Category:Wikiversity user rights icons]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:54, 10 May 2026 (UTC)
::Done: [[Wikiversity:Curators]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 01:44, 11 May 2026 (UTC)

== Technical Request:  Courtesy link.. ==

[[Template_talk:Information#Background_must_have_color_defined_as_well]] [[User:ShakespeareFan00|ShakespeareFan00]] ([[User talk:ShakespeareFan00|discuss]] • [[Special:Contributions/ShakespeareFan00|contribs]]) 11:43, 20 March 2026 (UTC)
: I can't edit the template directly as it need an sysop/interface admin to do it. [[User:ShakespeareFan00|ShakespeareFan00]] ([[User talk:ShakespeareFan00|discuss]] • [[Special:Contributions/ShakespeareFan00|contribs]]) 11:43, 20 March 2026 (UTC)
:: Also if the Template field of - https://en.wikiversity.org/wiki/Special:LintErrors/night-mode-unaware-background-color is examined, there is poential for an admin to clear a substantial proportion of these by implmenting a simmilar fix to the indciated templates (and underlying stylesheets). It would be nice to clear things like Project box and others, as many other templates (and thus pages depend on them.) :)
[[User:ShakespeareFan00|ShakespeareFan00]] ([[User talk:ShakespeareFan00|discuss]] • [[Special:Contributions/ShakespeareFan00|contribs]]) 11:43, 20 March 2026 (UTC)

:I think it would be best to grant you interface admin rights for a short period of time to make these changes. However, I still have doubts about the suitability of this solution, which may cause other problems and no one has explained to me why dark mode has to be implemented this way @[[User:ShakespeareFan00|ShakespeareFan00]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:43, 20 March 2026 (UTC)

: I would have reservations about holding such rights, which is why I was trying to do what I could without needing them. However if it is the only way to get the required changes made, I would suggest asking on Wikipedia to find technical editors, willing to undertake the changes needed. [[User:ShakespeareFan00|ShakespeareFan00]] ([[User talk:ShakespeareFan00|discuss]] • [[Special:Contributions/ShakespeareFan00|contribs]]) 09:32, 21 March 2026 (UTC)

== WikiEducator has closed ==

Some of you may know of a similar project to Wikiversity, called [https://wikieducator.org/Main_Page WikiEducator], championed by [https://oerfoundation.org/about/staff/wayne-mackintosh/ Wayne Mackintosh][https://www.linkedin.com/posts/waynemackintosh_important-notice-about-the-oer-foundation-activity-7405113051688931329-Nhm9/][https://openeducation.nz/killed-not-starved/].

It seems [https://openeducation.nz/terminating-oer-foundation their foundation has closed] and they are no longer operating.

They had done quite a bit of outreach (e.g., in the Pacific and Africa) to get educators using wiki.

The WikiEducator content is still available in MediaWiki - and potentially could be imported to Wikiversity ([https://wikieducator.org/WikiEducator:Copyrights CC-BY-SA] is the default license).

The closing of WikiEducator arguably makes the nurturing of Wikiversity even more important.

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:09, 1 April 2026 (UTC)

:I was never active there. If anyone has an account or is otherwise in contact, we may want to copy relevant information here or even at [[:outreach:]]. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 04:46, 1 April 2026 (UTC)

:: I reached out to [[User:Mackiwg~enwikiversity|Wayne]] in January, and he responded briefly but positively (while travelling).  I wrote to the low-traffic wikieducator mailing list today and got a nice [https://groups.google.com/g/wikieducator/c/r_yIyUw6ZIA reply] from [[user:SteveFoerster|Steve Foerster]] who's interested in helping. If we can figure out a migration path it would be great to adopt at least the main namespace pages here.  
:: A few questions that come to mind: 
:: - would people want to create matching user accounts
:: - are there any namespaces (user/talk?) that should not be moved over
:: We could look at how this was done for the [[m:Wikivoyage/Migration]] wikivoyage migration. &lt;span style=&quot;padding:0 2px 0 2px;background-color:white;color:#bbb;&quot;&gt;&amp;ndash;[[User:Sj|SJ]][[User Talk:Sj|&lt;span style=&quot;color:#ff9900;&quot;&gt;+&lt;/span&gt;]]&lt;/span&gt; 04:27, 1 May 2026 (UTC)
:::That's fantastic, SJ, that you've reached out and that Wayne, Steve, and Jim are receptive—and that you can help! -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:52, 1 May 2026 (UTC)
::::A matching accound makes sense to give credits to the original authors and keep a clean chain of versions. The initial commit into wikiversity could have a &quot;marker with timestamp&quot; similar to signature with a reference where the content's source or a Web archive. This would allow authors to continue there work on wikiversity if they wish. [[User:Bert Niehaus|Bert Niehaus]] ([[User talk:Bert Niehaus|discuss]] • [[Special:Contributions/Bert Niehaus|contribs]]) 06:30, 15 May 2026 (UTC)

== Wikinews is ending ==

Apparently mainly due to low editorial activity, low public interest, but also failure to achieve the goals from the proposal for the creation of the project, the Wikinews project is ending after years of discussions ([[Meta:Proposal for Closing Wikinews|some reading]]).

And I would be interested to see how Wikiversity is doing in the monitored metrics. We probably have more editors than Wikinews had, but what about consumers and achieving the goals? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 19:14, 1 April 2026 (UTC)

:Wikiversity's biggest issue in recent times was the hosting of low-quality, trash content. Thankfully we've done a great job in removing pseudoscience and other embarrassingly trash content (Wikidebates, for example), but the biggest concern moving forward is proper maintenance IMO. I've caught several pseudoscience pages being created within the last few months that could easily have flown under the radar (ex, [[The Kelemen Dilemma: Causal Collapse and Axiomatic Instability]]), so I'd urge our custodians/curators to be on the lookout for this type of content. Usually an AI-overview can point this type of content out relatively well.
:In terms of visibility, I believe Wikiversity is a high-traffic project. I remember my [[Mathematical Properties]] showing up on the first page of Google when searching up &quot;math properties&quot; for the longest time (and is still showing up in the first page 'till this day!). Besides, Wikinews hosted a lot of short-term content (the nature of news articles), while Wikiversity hosts content that can still be useful a decade later (ex, [[A Reader's Guide to Annotation]]). 
:I think we are on a better path than we were a few months ago, and I do want to thank everyone here who has been helping out with maintaining our website! —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 20:48, 1 April 2026 (UTC)
:For what it's worth, the group that did that study has since disbanded, so no one is monitoring the other sister projects in the same way. Additionally, Wikinews had some catastrophic server issues due to the maintenance of [[:m:Extension:DynamicPageList]] which don't apply here. Your questions are still worth addressing, but I just wanted to cut off any concern at the pass about Wikiversity being in the same precarious situation. Wikiversity is definitely the biggest &quot;lagging behind&quot; or &quot;failure&quot; project now that Wikinews is being shuttered, but I don't see any near- or medium-term pathway to closing Wikiversity. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 00:46, 2 April 2026 (UTC)

:[[w:en:Wikipedia:Wikipedia Signpost/2026-03-31/News and notes|Entirety of Wikinews to be shut down]] (Wikipedia Signpost) -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:03, 11 April 2026 (UTC)

== Action Required: Update templates/modules for electoral maps (Migrating from P1846 to P14226) ==

Hello everyone,

This is a notice regarding an ongoing data migration on Wikidata that may affect your election-related templates and Lua modules (such as &lt;code&gt;Module:Itemgroup/list&lt;/code&gt;).

'''The Change:'''&lt;br /&gt;
Currently, many templates pull electoral maps from Wikidata using the property [[:d:Property:P1846|P1846]], combined with the qualifier [[:d:Property:P180|P180]]: [[:d:Q19571328|Q19571328]]. 

We are migrating this data (across roughly 4,000 items) to a newly created, dedicated property: '''[[:d:Property:P14226|P14226]]'''.

'''What You Need To Do:'''&lt;br /&gt;
To ensure your templates and infoboxes do not break or lose their maps, please update your local code to fetch data from [[:d:Property:P14226|P14226]] instead of the old [[:d:Property:P1846|P1846]] + [[:d:Property:P180|P180]] structure. A [[m:Wikidata/Property Migration: P1846 to P14226/List|list of pages]] was generated using Wikimedia Global Search.

'''Deadline:'''&lt;br /&gt;
We are temporarily retaining the old data on [[:d:Property:P1846|P1846]] to allow for a smooth transition. However, to complete the data cleanup on Wikidata, the old [[:d:Property:P1846|P1846]] statements will be removed after '''May 1, 2026'''. Please update your modules and templates before this date to prevent any disruption to your wiki's election articles.

Let us know if you have any questions or need assistance with the query logic. Thank you for your help! [[User:ZI Jony|ZI Jony]] using [[User:MediaWiki message delivery|MediaWiki message delivery]] ([[User talk:MediaWiki message delivery|discuss]] • [[Special:Contributions/MediaWiki message delivery|contribs]]) 17:11, 3 April 2026 (UTC)
&lt;!-- Message sent by User:ZI Jony@metawiki using the list at https://meta.wikimedia.org/w/index.php?title=Distribution_list/Non-Technical_Village_Pumps_distribution_list&amp;oldid=29941252 --&gt;
:I didnt find such properties, so we are probably fine. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:00, 12 April 2026 (UTC)
:: +1 (agreed). [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 22:19, 12 April 2026 (UTC)

== Enable the abuse filter block action? ==

In light of [[Special:AbuseLog/80178]] (coupon spam), I would like to propose enabling the block action for the abuse filter. Only custodians will be able to enable and disable that action on an abuse filter, and it is useful to block ongoing vandalism. Thoughts? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 19:12, 13 April 2026 (UTC)

:Seems like a good idea, almost all of the users which create such pages are spambots so this shouldn’t be a problem. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 23:41, 13 April 2026 (UTC)
:Can you explain some more (I am new to abuse filters)? It looks like the attempted edit was prevented? Which abuse filter?
:Note on your suggestion, have also reactivated Antispam Filter 12 - see [[WV:RCA]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:45, 15 April 2026 (UTC)
:: I am proposing that we activate the abuse filter block action, which if a user triggers an abuse filter, it would actually block the user in question - the same mechanism that a custodian would use to block users. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:11, 15 April 2026 (UTC)
:::OK, thankyou, that makes sense. And, reviewing the abuse filter 12 log, it would be helpful because it would prevent the need for manual blocking. But I don't see a setting for autoblocking? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 23:14, 15 April 2026 (UTC)
:::: I think it probably adds an autoblock. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 00:43, 16 April 2026 (UTC)
: [[User:Jtneill|Jtneill]] and [[User:PieWriter|PieWriter]], given that a little bit more than a week has passed and there is minimal consensus to activate the abuse filter block action, I filed [[phab:T424053]]. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:05, 21 April 2026 (UTC)
::Thank-you for doing this. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 08:03, 24 April 2026 (UTC)

== Advice needed: A Neurodiversity-inspired Idea/observation ==

If I want the greatest participation of others to &quot;provide constructive criticism to my idea&quot; or to &quot;shoot down my idea&quot; or &quot;idea&quot;.

What I've called it so far is &quot;The Neurodiversity-inspired Idea&quot;. At other times I used more sensationalist wording but here on Wikiversity I don't dare do that. I actually woke up with thinking about putting this into my userspace draft: &quot;Personal Observations Made By Meeting Autistic and Non-Autistic Adults&quot;.

My ultimate goal is to stop blathering about my &quot;idea&quot; to friend and family without feeling my &quot;methodology&quot; is going into any progressive direction whatsoever. My latest encounter was somewhat constructive though. A friend of a friend who worked with people presenting ideas in attempting to getting grants. I don't want a grant. I just want to figure out how I can express my &quot;idea&quot; in a way so that I can more clearly figure out what flaws it got.

At the same time I tend to overthink. If anyone thinks etherpad might be a good place and considering Wikimedia already got an etherpad at https://etherpad.wikimedia.org/ if anyone feels like they know me better in the future feel free to suggest a &quot;session&quot; on etherpad.

'''If I don't receive a reply to this in 1 week's time I will begin to explore this &quot;idea&quot; into my userspace''' unless you replied and refrained me from doing so, of course. Then maybe after &quot;developing it there&quot; I might reference it to you another future time here in the Colloquium, with my &quot;idea&quot; still in my userspace draft. This &quot;idea&quot; is sort of a burden, I'm happy I've made the choice to get rid of it and hopefully move on with my life, unless there is something to this &quot;idea&quot;. 

My failure is probably evident: I feel I haven't told you anything. Same happened to when I talked to friends and family. In danger of overthinking it further I'll publish this right now. I need to &quot;keep it together&quot; [[User:ThinkingScience|ThinkingScience]] ([[User talk:ThinkingScience|discuss]] • [[Special:Contributions/ThinkingScience|contribs]]) 10:36, 16 April 2026 (UTC)

:Good on you putting it out there ... and hitting publish :). I'd say go for it (no need to wait), give birth to your idea and share about it here and elsewhere. Let it take shape and see where it might go. In many ways, this is exactly what an open collaborative learning community should be doing. Others might not know well how to respond, so perhaps consider creating some questions to accompany the idea. Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:21, 16 April 2026 (UTC)
::Thank you for encouraging me in developing the idea.
::I have created a &quot;questions&quot; section in the draft which is visible in the table of contents now. My brain was &quot;frozen&quot; today metaphorically speaking in that I felt I had like a &quot;writer's block&quot; so the draft has more &quot;AI/LLM&quot; content than before. I used the LLM for generating questions. The answers are so far human-only.
::I've also created a subsection where I could add the prompts that made the LLM generate the questions. That could help people make better prompts perhaps. I've described what it is about inside of it and there are some chaotically written notes.
::[[Draft:The_Neurodiversity-inspired_Idea#Questions_that_might_encourage_the_development_of_this_idea_and_its_methodology]]
::My draft is missing stuff. Any questions that you contribute to my draft will probably help me and if I don't understand the questions I'll probably notify you and also at the same time &quot;feed them&quot; to an LLM and ask in my input like &quot;explain in simple words what this question means, what is it searching for?&quot; etc. while I wait for an answer. If you have any more feedback please give it to me here or on the Draft page, its talk page or my user talk page. Thank you for helping me! [[User:ThinkingScience|ThinkingScience]] ([[User talk:ThinkingScience|discuss]] • [[Special:Contributions/ThinkingScience|contribs]]) 21:20, 18 April 2026 (UTC)
::Today I woke up with not only thinking about supplying questions along with the &quot;idea&quot; but also answers. ie. Is it possible to &quot;test&quot; this idea? Is it possible to create one or multiple hypotheses based on this &quot;idea&quot;?(etc.) I've thought about this before in this &quot;idea&quot; but since I'm beginning to add to Wikiversity what was previously 'locked in my mind' it's also easier for me to see what I've done so far. Thank you for this comment! [[User:ThinkingScience|ThinkingScience]] ([[User talk:ThinkingScience|discuss]] • [[Special:Contributions/ThinkingScience|contribs]]) 09:11, 23 April 2026 (UTC)
:May I think that you should not add deadlines ; being read, and rising interest for collaboration, or even simply for exchange of thoughts, such an effective meeting event loads a huge bunch of unprobability, which time can help to… somehow diminish. Maybe, I would advice you having a central place for developping your ideas, your needs, your advances, maybe a page in your own user zone, and from time to time, depending your feeling, it could be every trimester or so, or more frequently, you could write a short account of progress (or even of no progress), or a call for participation, in such a place as this present one ; I think that will increase much exposure of your projet. Maybe also, if you can find a project name, not necessarily very meaningfull by itseilf (at least it will gain signification with time, as your project develops), that will serve as a kind-of hook, and make your announcement titles more visible. Best regards (and my excuses for my poor command of English, which seems to be unplease an anti-abuse filter, &quot;Questionable Language (profanity)&quot;, which I don't understand…). My few cents. --  [[User:Eric.LEWIN|Eric.LEWIN]] ([[User talk:Eric.LEWIN|discussion]] • [[Special:Contributions/Eric.LEWIN|contributions]]) 10:06, 17 April 2026 (UTC)
::Sorry about the false positive on the profanity filter - I've fixed it. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:26, 17 April 2026 (UTC)
:::&quot;May I think that you should not add deadlines ; being read, and rising interest for collaboration, or even simply for exchange of thoughts, such an effective meeting event loads a huge bunch of unprobability, which time can help to… somehow diminish.&quot;
::Thank you Eric for this comment. Trust in time is how I interpret it. I should not feel like I need to be in a hurry. I'll try to give this time. Thank you!
:::&quot;Maybe, I would advice you having a central place for developping your ideas, your needs, your advances, maybe a page in your own user zone, and from time to time, depending your feeling, it could be every trimester or so, or more frequently, you could write a short account of progress (or even of no progress), or a call for participation, in such a place as this present one ; I think that will increase much exposure of your projet.&quot;
::A central place for developing or making &quot;project notes&quot; regarding the Neurodiversity idea on my userspace, I might need that, like a diary or &quot;project notes&quot; of the Neurodiversity idea similar to my course notes regarding my experience with Coursera.
::Any actions I take are going to be related to my Userspace from now on but I'll also update the draft when necessary. Now in the beginning I might be working daily to once every 3 days on both the draft and the daily notes I plan to make.
:::&quot;Maybe also, if you can find a project name, not necessarily very meaningfull by itseilf (at least it will gain signification with time, as your project develops), that will serve as a kind-of hook, and make your announcement titles more visible.&quot;
::Thank you for the advice. I was brainstorming yesterday about it. I concluded that since I've not yet developed a methodology that adheres to &quot;Do no harm&quot; and this is my first time working my &quot;idea&quot; into a way that is compatible with how projects develop on English Wikiversity this is new to me. My methodology isn't developed and therefore trying to get attention to my project through a name can wait. Yesterday I figured out a silly title that has nothing to do with the project: &quot;Planetary Awareness Potato Cabbage Rolls&quot; or something like that. Google output read that no such thing exists so I wanted it mainly to be unique. I don't want to raise attention that I'm unsure whether I'll actually be capable of developing a methodology for but project notes is my best bet so far in tracking my progress. Every day I think about this &quot;idea&quot; but I need to improve the important parts.
:::&quot;Best regards (and my excuses for my poor command of English, which seems to be unplease an anti-abuse filter, &quot;Questionable Language (profanity)&quot;, which I don't understand…). My few cents.&quot;
::You added great points and I felt that I was helped by you! I encourage you to post again and I can understand that interacting with any kind of automated filter can be discouraging and can be for me too! Thank you for giving me feedback! [[User:ThinkingScience|ThinkingScience]] ([[User talk:ThinkingScience|discuss]] • [[Special:Contributions/ThinkingScience|contribs]]) 16:01, 18 April 2026 (UTC)

== Add some user rights to the curator user group? ==

By default, only custodians have the ability to mark new pages as patrolled (&lt;code&gt;patrol&lt;/code&gt;) and have their own page creations automatically marked as patrolled (&lt;code&gt;autopatrol&lt;/code&gt;). I am proposing both of the following:
* Curators can mark new pages as patrolled, helping on reducing the backlog of new, unpatrolled pages.
* New pages made by curators will be automatically marked as patrolled by the MediaWiki software.
Before we implement this, I would suggest implementing a proposed guideline for marking new pages as patrolled for curators and custodians.

Thoughts? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 16:32, 17 April 2026 (UTC)

:Agree, &lt;s&gt;also can we also allow curators to undelete pages since they already have the rights to delete them?&lt;/s&gt; [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 02:54, 18 April 2026 (UTC)
::I think the requirement that undelete NOT be included came from above (meta / stewards / central office). Having access to the undelete page gives access to information that is restricted by their policies to admins (custodians and bureaucrats). -- [[User:Dave Braunschweig|Dave Braunschweig]] ([[User talk:Dave Braunschweig|discuss]] • [[Special:Contributions/Dave Braunschweig|contribs]]) 20:12, 18 April 2026 (UTC)
::: [[User:PieWriter|PieWriter]], unless if requests for curator and custodian should be RfA-like processes (that is, including voting and comments), then I have to agree with Dave above. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 22:03, 18 April 2026 (UTC)
::::Oh, I didn’t realise that. Withdrawing my comment.. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:08, 19 April 2026 (UTC)
:{{support}} Seems reasonable and would reduce overhead. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 14:35, 18 April 2026 (UTC)
:'''Agree''', implement it also to [[Wikiversity:Curators]] proposal please. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:11, 18 April 2026 (UTC)
: I went ahead and filed [[phab:T424445]]. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:39, 26 April 2026 (UTC)

== [[Wikiversity:Curators|Curators and curators policy]] ==
{{archive top|There is strong consensus, so [[Wikiversity:Curators]] is now a policy. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:15, 9 May 2026 (UTC)}}
How does it come, that Wikiversity has curators, but Curators policy is still being proposed? How do the curators exists and act if the policy about them havent been approved yet? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:33, 16 October 2025 (UTC)

:It looks as if it is not just curators. The policy on Bureaucratship is still being proposed as well. See [[Wikiversity:Bureaucratship]]. —[[User:RailwayEnthusiast2025|&lt;span style=&quot;font-family:Verdana; color:#008000; text-shadow:gray 0.2em 0.2em 0.4em;&quot;&gt;RailwayEnthusiast2025&lt;/span&gt;]] &lt;sup&gt;[[User talk:RailwayEnthusiast2025|&lt;span style=&quot;color:#59a53f&quot;&gt;''talk with me!''&lt;/span&gt;]]&lt;/sup&gt; 18:33, 27 October 2025 (UTC)

:I think its just the nature of a small WMF sister project in that there are lots of drafts, gaps, and potential improvements. In this case, these community would need to vote on those proposed Wikiversity staff policies if we think they're ready. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:08, 3 December 2025 (UTC)
:What? I thought you were getting it approved, Juandev... :) [[User:I&amp;#39;m Mr. Chris|I&amp;#39;m Mr. Chris]] ([[User talk:I&amp;#39;m Mr. Chris|discuss]] • [[Special:Contributions/I&amp;#39;m Mr. Chris|contribs]]) 14:20, 12 February 2026 (UTC)
::Yeah I think this one is important too and we need to aprove it too @[[User:I'm Mr. Chris|I'm Mr. Chris]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 15:56, 12 February 2026 (UTC)
:::I thinks its ready to made into a policy, it seems to be complete and informative about what the rights does and how to get it. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 03:08, 15 February 2026 (UTC)
::::Agree -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:00, 27 March 2026 (UTC)

Let's make this the official discussion about adopting the [[Wikiversity:Curators|curators policy]] policy. Your comments are invited and welcome. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 08:40, 24 April 2026 (UTC)
: There were two similar Colloquium threads in separate places about the proposed curators policy. So I've moved them to be adjacent. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 12:42, 1 May 2026 (UTC)
{{archive bottom}}

== Wikiversity:Curators to become a policy ==
{{archive top|There is strong consensus, so [[Wikiversity:Curators]] is now a policy. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:16, 9 May 2026 (UTC)}}
I've looked at the discussions about the Curators policy, I've looked at the practices, and it seems to me that there is no dispute about the wording of the policy, and what's more, the community has been using this proposal as if it were an offical policy for several years. Therefore, I propose that [[Wikiversity:Curators]] become a policy. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:35, 18 April 2026 (UTC)

:{{support}} —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:54, 18 April 2026 (UTC)
:{{support}} —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 20:21, 18 April 2026 (UTC)
: {{support|Yes, please}}. Especially after when I and PieWriter proposed above, I agree. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:27, 24 April 2026 (UTC)
:: @[[User:Juandev|Juandev]]; as of now, curators now have the user rights &lt;code&gt;autopatrol&lt;/code&gt; and &lt;code&gt;patrol&lt;/code&gt;. Perhaps we should also include that in [[Wikiversity:Custodianship]]? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 12:07, 30 April 2026 (UTC)
:::You meant [[Wikiversity:Curators]] @[[User:Codename Noreste|Codename Noreste]]? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:15, 5 May 2026 (UTC)
:::: I agree that we must develop what rules curators should follow when marking new pages as patrolled; the same can be added for custodians since they can also mark new pages as patrolled. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:37, 5 May 2026 (UTC)
:::::I see, well I think you can just add this to the policy. It is not major change and it probably reflects actual practice or actual technical possibilities for those flags. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:20, 7 May 2026 (UTC)
:{{support}} -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 12:42, 1 May 2026 (UTC)
:{{Support}} per nom. [[User:PhilDaBirdMan|PhilDaBirdMan]] ([[User talk:PhilDaBirdMan|discuss]] • [[Special:Contributions/PhilDaBirdMan|contribs]]) 13:32, 1 May 2026 (UTC)
{{Archive bottom}}

== Is anyone interested in Neurodiversity? ==

Is anyone interested in Neurodiversity? Is there anyone here who is interested for Neurodiversity to be &quot;something more&quot; than it already is? Does anyone here consider Neurodiversity one of the &quot;harder topics&quot; to work on or discuss? Does anyone here have an opinion about the [[Neurodiversity Movement]]? So these questions don't appear like &quot;out of a vacuum&quot; I can tell you a bit about my background:

Many years ago I got a psychiatric diagnosis &quot;Asperger's&quot;. After I stepped out of the office and my Äsperger's was 'concluded', I stepped out into the street and thought my first negative thought(but the positive thought followed after). The thought was about concentration camps in the second world war and that the world seemed to be going into the direction of &quot;labeling others&quot;. I was unsure whether this was &quot;real science&quot; and sort of &quot;challenged myself&quot; to make up my own mind after meeting people that had been given this diagnosis. The more adults with this diagnosis I met the more I started seeing &quot;patterns&quot;.

Was it a coincidence that the first person with Asperger's I met reminded me about my father later after I had plenty of times of experience with interacting with him? None of the people I interacted with online through IRC text chat...I felt I got any clue about how &quot;their brains work&quot;. Only when I met one person from the Asperger's chat community in person we both realized that whatever we experienced was akin to the &quot;chaos theory&quot;. He told me about &quot;chaos theory&quot; while I didn't know even what that term meant but I guess I 'read between the lines'. My question that I linger on still today is &quot;did he understand about me what I think I understood about him?&quot;? That our brains had the same configuration? Most autistic adults who meet other autistic adults usually get disappointed. They think the diagnosis will help them meet somebody like themselves and then they realize the great diversity in the autistic spectrum created by Psychiatry.

I later stopped interacting with autistic communities that much, I felt that it did not benefit me. Also Neurodiversity's &quot;neurotypes&quot; interested me for a while until I realized I had &quot;misunderstood everything&quot; about them and how they are used in the Neurodiversity Movement or &quot;Neurodiversity community&quot; if that even can precisely be defined? I doubt it but if you want to contribute to the [[Neurodiversity Movement]]. My previous attempts failed as I got more and more confused. I think a community project needs a community. With a lack of that I don't think it is worth my time. If any of you would like to work on that project let me know on my talk page.

So I was kinda lost and was talking to my friend and psychologist and I realized if I never talk about my idea to anyone in a &quot;comprehensive way&quot; or show that it matters to me nothing is going to ever happen. So I started talking about my &quot;idea&quot; more. Nobody could understand the &quot;idea&quot; because I had not developed my skills regarding where to start...although the process had already started &quot;automatically&quot; and that's why I often think of &quot;well my brain sort of activated me&quot;. I don't feel like I did have a plan and this idea happened. It happened &quot;by itself&quot;. My brain reacted to what I was seeing in a video or stream.

I value interaction highly in this idea. I think it would be helpful to make a community of people who are not paranoid about stuff that can express itself like &quot;don't analyze me!&quot;, &quot;don't compare me to anyone!&quot;. 

On the contrary, more often than not those adults who were diagnosed were actually openly comparing themselves with each other and I think that is healthy in a &quot;science&quot; way if done the &quot;right way&quot; which probably means &quot;Do no harm&quot;.

I found video material is important but I'm very unsure if uploading own video material to Wikimedia Commons would constitute a &quot;reasonable&quot; use of the resources there. Maybe somebody here needs to ask more questions to me that I should answer before that happens. I also know the '''be bold''' so I could just do what I think might be ok. Though I work better in a group as long as I know what &quot;group configurations&quot; help me. This is in a non-profit way. Since the state supported me this might be a way I am trying to &quot;give back&quot; to the state and &quot;the world&quot;. May seem overly ambitious and crazy but this thing gives me energy. It gives me hope when trying to develop this idea. [[User:ThinkingScience|ThinkingScience]] ([[User talk:ThinkingScience|discuss]] • [[Special:Contributions/ThinkingScience|contribs]]) 10:47, 23 April 2026 (UTC)

:Thanks for sharing. There is plenty of room for neurodiversity community learning. However, the challenge I think is that the intersection of those interested in (a) ND, and (b) English Wikiversity might be very small (e.g., 1!) at this point in time.
:But don't give up hope. For example, Wikipedia has many more ND-interested editors; maybe consider reaching out to see who might be interested:
:[[w:Category:Wikipedians interested in neurodiversity]]
:You could also start an equivalent category here:
:[[:Category:Wikiversitarians interested in neurodiversity]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:46, 6 May 2026 (UTC)

== Request for comment (global AI policy) ==

&lt;bdi lang=&quot;en&quot; dir=&quot;ltr&quot; class=&quot;mw-content-ltr&quot;&gt;A [[:m:Requests for comment/Artificial intelligence policy|request for comment]] is currently being held to decide on a global AI policy. {{int:Feedback-thanks-title}} [[User:MediaWiki message delivery|MediaWiki message delivery]] ([[User talk:MediaWiki message delivery|discuss]] • [[Special:Contributions/MediaWiki message delivery|contribs]]) 00:58, 26 April 2026 (UTC)&lt;/bdi&gt;
&lt;!-- Message sent by User:Codename Noreste@metawiki using the list at https://meta.wikimedia.org/w/index.php?title=Distribution_list/Global_message_delivery&amp;oldid=30424282 --&gt;

== Language learning  ==

toki! I am trying to add or see what the toki pona language learning stuff on here is but I don't see anything that is language learning for anything. [[User:Jan Imon|Jan Imon]] ([[User talk:Jan Imon|discuss]] • [[Special:Contributions/Jan Imon|contribs]]) 23:13, 2 May 2026 (UTC) —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 17:29, 3 May 2026 (UTC)

:We have language materials ([[:Category:Languages]], [[World Languages]], [[Portal:Foreign Language Learning]], [[Portal:Multilingual Studies]]). They are not as developed as I think we would all like and there's not any coverage of Toki Pona, but in principle, we could and would like that. You can also see [[:b:Subject:Languages]] at our sister project Wikibooks. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 17:33, 3 May 2026 (UTC)

== Timeline format? ==

I’ve been working on the World War II articles, including the [[World War II/Timeline|timeline]], and is there a specific timeline format that should be used? Right now it’s just a table, and there’s no separation between different periods/phases of the war.

I don’t want to use [[mw:Extension:EasyTimeline]] because this will be displaying dates and not time periods. [[User:PhilDaBirdMan|PhilDaBirdMan]] ([[User talk:PhilDaBirdMan|discuss]] • [[Special:Contributions/PhilDaBirdMan|contribs]]) 01:35, 4 May 2026 (UTC)

:I dont think we have a policy or guideline, how to format a timeline. But you may try to browes wikiversity by Google if someone was dealing with this in the past somewhow @[[User:PhilDaBirdMan|PhilDaBirdMan]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:23, 5 May 2026 (UTC)
::+1 - there's no specific guideline on how to format a timeline, it's really up to you. In my opinion I think the timeline is good. I'd personally bold the dates just to make it easier to separate it from the event description, but that's my personal 2 cents. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 14:18, 5 May 2026 (UTC)
:::I’ll probably remove links to the dates/years, they’re just Wikipedia pages that shouldn’t be over linked to. [[User:PhilDaBirdMan|PhilDaBirdMan]] ([[User talk:PhilDaBirdMan|discuss]] • [[Special:Contributions/PhilDaBirdMan|contribs]]) 00:39, 6 May 2026 (UTC)

== Interface administrator for Codename Noreste ==
{{Archive top|After running for a week, there is clear consensus for [[User:Codename Noreste]] to have Interface admin rights for 120 days; implemented until 10 September, 2026 -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 22:36, 12 May 2026 (UTC)}}

Hello, everyone. I am requesting interface administrator access on this wiki.

The main reasoning is that I would benefit from having the user right &lt;code&gt;editinterface&lt;/code&gt;, which would allow me to make dark mode changes to pages in the MediaWiki namespace, add &lt;code&gt;&lt;nowiki&gt;&lt;div class=&quot;mw-parser-output&quot;&gt;&lt;/nowiki&gt;&lt;/code&gt; to some interface pages using templates, handle interface-protected edit requests, and similar stuff. Additionally, I have some knowledge of CSS, and I would like to assist with modifying CSS pages whenever necessary, such as moving MediaWiki common.css code to TemplateStyles CSS pages.

I am requesting the maximum time that is allowed per the [[Wikiversity:Interface administrators|policy]], and I have 2FA enabled on my account. Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 00:55, 6 May 2026 (UTC)

*{{support}} Globally trusted user. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 01:07, 6 May 2026 (UTC)
*{{support}} Trusted and knowledgeable. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:35, 6 May 2026 (UTC)
*{{support}} WV would benefit from this. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 08:32, 6 May 2026 (UTC)
*{{support}} --[[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:13, 7 May 2026 (UTC)

:{{Comment}} Could @[[User:Codename Noreste|Codename Noreste]] delete [[MediaWiki:Gadget-WikiSign.js]], which was requested to be deleted @[[User:Koavf|Justin]], @[[User:Jtneill|Jtneill]], @[[User:Atcovi|Atcovi]]? I dont think we need it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:40, 9 May 2026 (UTC)
::Yes - clearly no longer used -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:18, 9 May 2026 (UTC)
::: I can't delete it because I don't have the required permissions to do so.
::: On a side note, if this project has a need for permanent interface administrators, I would suggest that we have a minimum of two IAs, similar to how there must be two CUs and/or suppressors (or none). Maybe Koavf can be a good candidate if I am elected for permanent interface adminship, and I believe that permission shouldn't be removed from someone's own account. Instead, a bureaucrat should do it. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:20, 9 May 2026 (UTC)
::::I am willing and happy to do it, unfortunately, we do not have an appetite for indef IAs and just had a discussion that resulted in a [https://en.wikiversity.org/w/index.php?title=Wikiversity:Interface_administrators&amp;diff=prev&amp;oldid=2807543 consensus that we can have IAs that have the user rights for 14 to 120 days]. So once you have the rights, please make sure to gopher it. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 17:54, 9 May 2026 (UTC)
:::::@[[User:Koavf|Koavf]] give it time. Look at me, I was in favor of shorter time, now I am looking back to times, when custodians could do it without the need of extra flag. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:31, 9 May 2026 (UTC)
::::::Here's hoping. I think it would reduce administrative overhead, but that's just me and I'm not a bureaucrat here. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:33, 9 May 2026 (UTC)
::::Complicated. Where are the times, admins could do everything! [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:27, 9 May 2026 (UTC)
{{archive bottom}}

== [[Wikiversity:Bureaucratship]] to become a policy ==

Following the recent approval of [[Wikiversity:Curators]] as a policy, I think [[Wikiversity:Bureaucratship]] may also be ready for policy status.

Please share your views about whether bureaucratship is ready to become a policy, or whether further revisions are needed.

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 13:58, 9 May 2026 (UTC)
: I added a logo about that user group, but other than that, it looks good to me. {{support}}. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:38, 9 May 2026 (UTC)
:I think that the consensus on this policy is proven by years of using it without further changes. But I I have to say weather I agree with this to become a policy, than of course {{support}}. It works and there were no major issues with it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:45, 9 May 2026 (UTC)
:{{support}} no issues. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 14:51, 10 May 2026 (UTC)
:{{support}} [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 12:37, 11 May 2026 (UTC)
:{{support}} ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 06:51, 12 May 2026 (UTC)

== Reminder about custodian-related pages ==

I would like to remind the community about what the following custodian pages are:
* [[Wikiversity:Request custodian action]] is for requesting actions to be done by custodians, and
* [[Wikiversity:Notices for custodians]] is for notices of interest to custodians, like an administrator's noticeboard
Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:12, 12 May 2026 (UTC)

:Thanks - I needed this reminder :) -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 22:21, 12 May 2026 (UTC)

== [[MediaWiki:Protectedpagetext#Protected edit request on 11 December 2025]] ==

I posted an edit request there 5 months ago, so I’ll be taking it to this page. [[Special:Contributions/&amp;#126;2026-28640-56|&amp;#126;2026-28640-56]] ([[User talk:&amp;#126;2026-28640-56|talk]]) 23:33, 12 May 2026 (UTC)

:What exactly is the problem? I don't understand what needs to change and why. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 23:35, 12 May 2026 (UTC)
: Pinging @[[User:Atcovi|Atcovi]], @[[User:Jtneill|Jtneill]] and @[[User:Juandev|Juandev]] for further input. Someone is requesting a modification to [[MediaWiki:Protectedpagetext]] to use {{tlx|Protected page text}}, but we might need to discuss whether to use the template. In the meantime, I'll start a sandbox version of the protected page text template. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 23:19, 14 May 2026 (UTC)
::Sounds good -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:13, 15 May 2026 (UTC)

== Create a pseudo-bot user group? ==

I would like to propose adding a new user group to Wikiversity: Pseudo-bot (&lt;code&gt;flood&lt;/code&gt;). This will allow users to perform repetitive actions without flushing the recent changes feed (with only the &lt;code&gt;bot&lt;/code&gt; user right). However, I would suggest that for the pseudo-bot user group:
* It can be granted and revoked by custodians. However, can curators add and remove pseudo-bot from their own accounts (and not others)?
* Users can remove themselves from it.
* A guideline might be necessary about the information and usage of it.
Thoughts? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 03:31, 14 May 2026 (UTC)

:This sounds good. Which other wiki could we model this user group on? e.g., [[b:Wikibooks:Pseudo-bots]]? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:19, 15 May 2026 (UTC)
::@[[User:Jtneill|Jtneill]] Wikiquote has a similar group: [[:wikiquote:Special:ListGroupRights]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 04:25, 15 May 2026 (UTC)

== Coming over From wikinews ==
Any chance someone could help me if you are allowed to write news articles here since wikinews is going read only mode soon, thank you! [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 22:43, 1 May 2026 (UTC)

:The scope of Wikiversity is very broad and is basically about more-or-less any learning material. We have made it a point to not have duplicative content of other WMF projects, but since Wikinews is being shuttered, I personally am fine with writing news articles here. One thing that is not controversial at all is a learning resource &lt;em&gt;about&lt;/em&gt; how to write news: that could be hugely useful here and could involve the process of writing news stories to learn and to share back and forth with an editor or fact-checker. In fact, I'd support an entire namespace dedicated to keeping the notion of Wikinews alive here. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 23:38, 1 May 2026 (UTC)
::Thank you so much! How do I start? Cheers! @[[User:Koavf|Koavf]] [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 01:07, 2 May 2026 (UTC)
:::I think it's premature to start just making news articles en masse, but if you want to start discussing the topic of citizen journalism, you can do that now. [[:Category:Journalism]] already has some material, so you can start by seeing what we already have, how you can refine that, etc. You can definitely have learning resources with collaborators who want to learn about journalism ASAP. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 01:24, 2 May 2026 (UTC)
::::thanks. [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 01:38, 2 May 2026 (UTC)
::::If I could try and start one News Article could you please tell me how to go about it? Like what style of writing like Wikinews or something else? Thank you Justin! @[[User:Koavf|Koavf]] [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 01:48, 2 May 2026 (UTC)
:::::Honestly, there are very few policies and guidelines here. I think the best way to write a news story would be in a manner that is obvious and instructive. So, for instance, it's common to use the &quot;pyramid style&quot; when you're writing news, so if you were to write a story that makes it very clear that you are using that approach, that would be helpful. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 02:08, 2 May 2026 (UTC)
::::::cool thanks. [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 02:13, 2 May 2026 (UTC)
::::::im ready to write @[[User:Koavf|Koavf]] [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 21:30, 13 May 2026 (UTC)
:::::::I think we should get more local consensus for a big project like including the entirety of the scope of Wikinews here. Again, I support it personally. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 21:55, 13 May 2026 (UTC)
::::::::ok lets begin. [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 22:15, 13 May 2026 (UTC)

== Proposal to rehost Wikinews here ==

As many of you know, and mentioned here at the Colloquium, our sister project Wikinews recently closed, with all 31 active editions made read-only. [[User:BigKrow]] has asked about the prospect of writing news stories here and I suggested that since we already have [[School:Journalism]] and some resources related to the [[:Category:Journalism|broader topic of journalism]]. I would like to propose that we have continued and indefinite space for {{w|citizen journalism}} by essentially repurposing Wikinews into a sub-project here. The only special infrastructure that Wikinews required was [[:mw:Extension:DynamicPageList]], which was deactivated and caused issues due to a lack of maintenance.

I will add this proposal to the site banner, but I recognize that that may be a conflict of interest, so if anyone requests that I remove it, I will. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:30, 14 May 2026 (UTC)
:I would like to see this conversation go for at least 30 days to establish a consensus. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:35, 14 May 2026 (UTC)

===Votes===
*{{support}} as proposer (with BK's inspiration). I think that an ongoing experiment in citizen journalism is a fit and appropriate use of this site. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:35, 14 May 2026 (UTC)
*{{support}}, hope to seeing ideas about this, and thank you @[[User:Koavf|Koavf]] [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 11:08, 14 May 2026 (UTC)
*{{support}} Other than perhaps inflating the total number of pages reported, I see the idea of &quot;practicing journalism&quot; a worthy and relevant activity within the domain of Wikiversity. [[User:IanVG|IanVG]] ([[User talk:IanVG|discuss]] • [[Special:Contributions/IanVG|contribs]]) 21:41, 14 May 2026 (UTC)
*{{support}} Conditional on development of (a) community guidelines that ensure alignment with Wikiversity's purpose, and (b) clear, nested page-naming structures for projects. More detail below. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:48, 15 May 2026 (UTC)
*{{contra}} This proposal doesn't seem interested in expanding educational materials in journalism, but rather in providing space and protection for Wikinews contributors. But this is contrary to the goals of Wikiversity, and I'm not sure it's a good idea, even with regard to WMF. If WMF decides to close a project and another community lets it run on its domain, that's a bit of an undermining of WMF's and the community's decisions. Given that Wikiversity has had several conflicts with other communities and WMF in its history, I'm against it.--[[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:59, 15 May 2026 (UTC)

===Comments and questions===
:Definitely worthy of discussion, so I have no problem with the proposal in the sitenotice.
:Initial questions:
:* Does this proposal include importing English Wikinews content e.g., to [[Wikinews]] subpages?
:* What are &quot;active editions&quot;?
:* How can Wikiversity navigate the concerns that lead to the closure of Wikinews?
:* Are any changes to the scope of Wikinews proposed?
:* How does [[Wikinews]] fit with the [[Wikiversity:Mission]]? What aligns well? Where might there be tension?
:** e.g., I'm not sure that a page like [[Story/Manchester City moves two points behind Arsenal]] in and of itself will serve as an educational resource.
:-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 05:52, 14 May 2026 (UTC)
:* Does this proposal include importing English Wikinews content e.g., to [[Wikinews]] subpages?
::*No, not at this time.
:* What are &quot;active editions&quot;?
::*There were 30 other active editions of Wikinews in addition to English (e.g. [[:n:es:]]) at the time of universal closure (2026-05-04).
:* How can Wikiversity navigate the concerns that lead to the closure of Wikinews?
::*One of the biggest issues was the problems with DPL, which is now irrelevant. Another was the lack of activity, which can be ameliorated by having it be part of an existing project instead of its own domain (e.g. some editions of Wikipedia host their own Wikinews already and those projects were not impacted by the closure).
:* Are any changes to the scope of Wikinews proposed?
::*Not at this juncture. I would also propose as far as implemention goes that we would request a new namespace and that the material be more-or-less sequestered into its own ongoing project, like Wikijournal is or like the Cookbook and Wikijunior are at our sister [[:b:]].
:* How does [[Wikinews]] fit with the [[Wikiversity:Mission]]? What aligns well? Where might there be tension?
:** e.g., I'm not sure that a page like [[Story/Manchester City moves two points behind Arsenal]] in and of itself will serve as an educational resource.
::*The process of citizen journalists practicing their craft in real-time and collaborating with others to do so is itself an education activity. We would essentially be hosting a real-time experiment in citizen journalism, online communities, and collaborative learning in addition to the prospect of spreading educational information from someone actually reading the news. I would propose that we could also make a more deliberate attempt to engage with learning &lt;em&gt;about&lt;/em&gt; what does and doesn't work with collaborative news writing by experimentation (e.g. audio news, syndicating to other sites, incorporating freely-licensed news from other sources, writing hyper-local news, writing briefs versus longer-term reportage) and also seeing if the problems noted in the Task Force report that recommended closure can be overcome. Note that we have already done some local investigation about and learning about wiki-based journalism on Wikinews here at [[Journalism studies and Wikinews]]. We could continue that learning and refine the process, including incorporating journalism students from universities. As for tensions, Wikinews is the only sister project that must be done with a quick turn-around: if you take a long time to [[:s:|transcribe a book]], that's just how long it takes, but if you take a long time to write news, it ceases to be news entirely. Wikiversity has been a very slow-growing project that has definitely had some successes but has generally come together over a long period with most learning resources being individual passion projects (or sometimes, frankly, crankery) which would not work with collaborative news that requires more than just a single editor writing whatever he feels like.
::Please let me know any other questions/concerns and any other editors feel free to give your own perspective. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 06:13, 14 May 2026 (UTC)
:::Thanks, Justin — it is food for thought.
:::In attempting to understand how we've arrived here, I've summarised some of the background on this page: [[Wikinews]].
:::Perhaps it could be helpful to flesh out more of the vision / ideas / possibilities / challenges on that page? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:49, 14 May 2026 (UTC)

:::*Having given it some thought, in principle, I support hosting [[citizen journalism]] on Wikiversity where it is clearly connected to a learning project and/or constitutes original research, both of which align strongly with [[Wikiversity:Mission|Wikiversity’s educational mission]].
:::*My chief concern is the potential for news content that is not clearly linked to the purpose of Wikiversity. To avoid this, some community-agreed guidelines would be prudent. These need not be overly restrictive; they should support boldness and experimentation while helping ensure alignment with Wikiversity's purpose.
:::*Given the reported low and declining activity on Wikinews, it seems unlikely that English Wikiversity would be overwhelmed by an influx of news-related editing. My impression is that English Wikinews was the most active edition, but even so, many contributors are likely to disperse to other projects or cease editing altogether. A modest migration of interested editors to Wikiversity seems manageable.
:::*At this stage, I do not think a dedicated namespace is necessary. Subpages under [[Wikinews]] or nested pages under relevant learning or research projects, or user-space draft pages should be suitable. I agree that [[Wikijournal]] offers a useful model, as do several existing course structures on Wikiversity.
:::*I support [[User:Koavf]]’s suggestions about framing Wikinews activity explicitly around learning. This would create a distinctive space for experimenting with collaborative news production in ways that are pedagogically meaningful. I agree that the [[journalism studies and Wikinews]] project developed by David and Leigh Blackall through the University of Wollongong is an excellent example of the intersection between Wikiversity and Wikinews. The [[Wikinews]] page could evolve into a hub for such projects.
:::*I've tidied the [[:Category:Wikinews|Wikinews category]] and merged some content into the [[Wikinews]] page. As part of a reinvigoration effort, please review these and related resources such as [[:Category:Journalism]] and [[School:Journalism]].
:::*A further argument in favour of this initiative is that Wikipedia explicitly excludes both news reporting and original research. So, there is value in maintaining spaces within the Wikimedia ecosystem where these forms of knowledge production can be openly developed and curated. Such work can, in turn, generate valuable evidence and source material that may later inform Wikipedia articles.
:::*The closure of WMF-hosted Wikinews does not imply that open wiki-based news curation lacks value. Indeed, the closure documentation appears supportive of experimentation with alternative news models across Wikimedia projects, including through Wikipedia and Wikidata. In that context, Wikiversity seems a natural home for a Wikinews experiment, provided it is clearly grounded in learning and/or research.
:::-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:39, 15 May 2026 (UTC)
My understanding towards Wikinews' failure is that everything takes too long to be approved for the publish status, which means that any breaking news would have already become days-old stale news. Wikinews has a brand recognition (for right or wrong reasons) than Wikiversity and I wonder how effective Wikiversity can attract the &quot;Wikinews refugees&quot; to edit here. And just a quick note on the governance. Since each Wikiversity language operates independently, each language has to vote &amp; adopt this proposal independently. [[User:OhanaUnited|&lt;b&gt;&lt;span style=&quot;color: #0000FF;&quot;&gt;OhanaUnited&lt;/span&gt;&lt;/b&gt;]][[User talk:OhanaUnited|&lt;b&gt;&lt;span style=&quot;color: green;&quot;&gt;&lt;sup&gt;Talk page&lt;/sup&gt;&lt;/span&gt;&lt;/b&gt;]] 13:47, 15 May 2026 (UTC)

:Your assessment about Wikinews is partially correct. I referenced it earlier, but to be explicit, there is a [[:m:Proposal for Closing Wikinews|report by a task force on sister projects]] that outlines their concerns. There are a few, one of which was the nature of the staleness of news. Thanks also for clarifying that this proposal is only relevant to en.wv and is not binding or even proposed for other editions of Wikiversity. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:54, 15 May 2026 (UTC)

== Inactivity policy for Curators ==

I was wondering if there is a specific inactivity polity for curators (semi-admins) as I am pretty sure the global policy does not apply to them as they are not ''fully'' sysops. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 03:20, 15 February 2026 (UTC)

:Unfortunately, I don't see an inactivity policy, but if we were to create such a new policy for curators, it should be the same for custodians (administrators). [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 18:45, 15 February 2026 (UTC)
::@[[User:Codename Noreste|Codename Noreste]] There is currently none, that I could find, for custodians either. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:47, 17 February 2026 (UTC)
:::I think we should propose a local inactivity policy for custodians (and by extension, curators), which should be at least one year without any edits ''and'' logged actions. However, I don't know which page should it be when the inactivity removal procedure starts. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 00:53, 17 February 2026 (UTC)
::::@[[User:Codename Noreste|Codename Noreste]] In theory, there should be a section added at [[WV:Candidates for custodianship]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:55, 17 February 2026 (UTC)
::::: To be consistent with the [[meta:Admin activity review|global period of 2 years inactivity]] for en.wv  [[Wikiversity:Custodianship#Notes|Custodians]] and [[Wikiversity:Bureaucratship#How are bureaucrats removed?|Bureaucrats]] we could add something like this to [[Wikiversity:Curators]]:
::::::The maximum time period of inactivity &lt;u&gt;without community review&lt;/u&gt; for curators is two years (consistent with  the [[:meta:Category:Global policies|global policy]] described at [[meta:Admin activity review|Admin activity review]] which applies for [[Wikiversity:Custodianship#Notes|Custodians]] and [[Wikiversity:Bureaucratship|Bureaucrats]]). After that time a custodian will remove the rights.
::::: -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:51, 27 March 2026 (UTC)
:::::Yup, I agree with Jtneill, there is a policy proposal for Wikiversity:Curators, where it should be logically deployed. The question is if we are ready to aprove the policy. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:43, 17 April 2026 (UTC)
:::::: I agree, but we should notify the colloquium about inactive curators, just like a steward would do for inactive custodians and bureaucrats per [[:m:Admin activity review|AAR]]. What is the minimum timeframe an inactive curator should receive so they can respond they would keep their rights? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 17:49, 17 April 2026 (UTC)
:I incorporated these suggestions into the proposed curators policy. Please review/comment/improve. Summary: 2 years, notify curator's user page, then remove rights after 1 month: [[Wikiversity:Curators#Inactivity]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 08:59, 24 April 2026 (UTC)
:: @[[User:Jtneill|Jtneill]] I created [[Template:Inactive curator]] for this. Feel free to make any changes or improvements. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:29, 24 April 2026 (UTC)
:::Wondering, should we also have:
:::* {{tl|Inactive custodian}}
:::* {{tl|Inactive bureaucrat}}
:::or perhaps just a single template with a parameter(s) for the user right(s)/role(s)? e.g., 
:::* if a custodian is inactive for 2 years, then custodian and curator rights are to be removed and 
:::* if a bureaucrat is inactive for 2 years, then bureaucrat, custodian, and curator rights are to to be removed.
:::-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:58, 13 May 2026 (UTC)
:::: I would probably modify that template when we actually develop our own inactivity policy, because we're currently under the AAR (a steward notifies the colloquium with [[m:Admin activity review/Notice to communities]], and inactive advanced right holders with [[m:Admin activity review/Notice to inactive right holders]]). [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:16, 13 May 2026 (UTC)
:::::Ah, I see. Yes, that makes sense. Thankyou. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:21, 15 May 2026 (UTC)
: In that case, should we develop our own inactivity policy (e.g. on [[Wikiversity:Inactivity policy]] or [[Wikiversity:Support staff/Inactivity]])? I would list the general inactivity part, the process, etc. Once it's approved as a policy, I will [[m:Stewards' noticeboard|notify the stewards]]. Thoughts? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:30, 16 May 2026 (UTC)
::Originally, I would have thought that, for a small wiki like en.wv, it made sense to leave inactivity monitoring to the stewards. However, with the creation of the curator user group, we have already taken on local responsibility for monitoring inactivity in at least one advanced-rights group. Extending this to custodians and bureaucrats would not add much additional overhead and would provide a more consistent and transparent local administrative process.
::One option would be to develop a single, centralised policy covering all advanced-rights groups.
::An alternative would be to include an ==Inactivity== section on each relevant policy page (e.g., we already have [[Wikiversity:Curatorship#Inactivity]], but not yet in the custodianship, and bureaucratship policy pages). This approach would allow some flexibility because different user groups may warrant different criteria (such as inactivity thresholds, qualifying activity, or review procedures).
::A hybrid approach may be best: maintain separate inactivity sections within each user-group policy page, while transcluding these into a central overview page such as Codename Noreste suggests. This would preserve clarity at the local policy level while also providing a single reference point for consistency and oversight. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 23:09, 16 May 2026 (UTC)

== Inactive curators ==

Hello, even though [[Wikiversity:Curators]] is not a policy yet, there are curators listed here that have been inactive for two years or more:
* {{user|Cody naccarato}} (last edit on 13 Dec 2022, last logged action on 10 Dec 2022)
* {{user|Praxidicae}} (last edit on 10 Sep 2022, last logged action on 12 Sep 2022)
[[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 21:14, 19 April 2026 (UTC)

:Yup, I would remove the rights. To get the rights back if theyll come back should not be a big deal. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:08, 24 April 2026 (UTC)
:: When they don't reply by May 19, feel free (or any custodian) to do so. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 00:28, 25 April 2026 (UTC)

==Curator inactivity review==
These curators haven't been active for &gt; 2 years. As per the [[Wikiversity:Curatorship|curatorship policy]]:
* [[Special:Log/Cody naccarato]] was notified on their talk page by [[User:Codename Noreste|Codename Noreste]] on 24 Apr 2026
* [[Special:Log/Praxidicae]] was notified on their talk page by [[User:Codename Noreste|Codename Noreste]] on 24 Apr 2026
* [[Special:Log/Tegel]] was notified on their talk page by [[User:Jtneill|Jtneill]] notified their talk page on 16 May 2026

The policy allows a month to hear from these users. If no response, a custodian will remove their curator rights.

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 06:14, 16 May 2026 (UTC)
: For Cody naccarato and Praxidicae, their rights are to be removed by the 19th of May if they don't respond either here or on their talk page. For Tegel, the removal will happen on the 16th of June, probably. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:13, 16 May 2026 (UTC)
::Should be 24 May for Cody naccarato and Praxidicae? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 23:11, 16 May 2026 (UTC)
::: I made [[#Inactive curators]] on the 19th of April. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 03:18, 17 May 2026 (UTC)</text>
      <sha1>gan90vsl1uz69oh6u3hi5s4tz2q014x</sha1>
    </revision>
    <revision>
      <id>2809873</id>
      <parentid>2809871</parentid>
      <timestamp>2026-05-17T06:44:50Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <comment>/* Curator inactivity review */ Reply</comment>
      <origin>2809873</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="81929" sha1="1c2mg93midu8zg34ov9e2jsihbijsum" xml:space="preserve">{{Wikiversity:Colloquium/Header}}
&lt;!-- MESSAGES GO BELOW --&gt;
== New titles for user right nominations ==
&lt;div class=&quot;cd-moveMark&quot;&gt;''Moved from [[Wikiversity talk:Candidates for Custodianship#New titles for user right nominations]].  [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 23:20, 17 April 2026 (UTC)''&lt;/div&gt;

I would like to propose the following retitles should a user be nominated for any of the following user rights:
* Curator: Candidates for Curatorship
* Bureaucrat: Candidates for Bureaucratship
The reason is that many curator (and probably bureaucrat) requests have run solely under {{tq|Candidates for Custodianship}}, but that title might sound misleading (especially in regards to the permission a user is requesting). CheckUser and Oversight (suppressor) are not included above since no user was nominated for these sensitive permissions, probably. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 01:30, 19 March 2026 (UTC)

:And it's not that when someone at the beginning misplaced the request, no one thought to move it and the others copied it. Even today, it would be possible to simply take it all and move it. Otherwise, for me, the more fundamental problem is that there is [[Wikiversity:Curators|no approved policy for curators]] than where the requests are based. Curators then operate in a certain vacuum and if one of them &quot;breaks out of the chain&quot;, the average user doesn't have many transparent tools to deal with it, because there is no policy. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:02, 19 March 2026 (UTC)
::I am not talking about the curator page (policy proposal). [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 19:08, 21 March 2026 (UTC)
: @[[User:Juandev|Juandev]] I'll see if I can do an overhaul of [[Wikiversity:Candidates for Custodianship]], just like I recently did with the Requests for adminship page on English Wikiquote. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 22:17, 18 April 2026 (UTC)
:Yes, great idea - ideally there will be separate &quot;Candidates for ...&quot; pages for each user right group. The most important for now is to separate curator and custodian pages as CN suggests. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:39, 1 May 2026 (UTC)
:So maybe I previously misunderstood. Are you proposing separated pages for nominations (i.e. [[Wikiversity:Candidates for Curatorship]], [[Wikiversity:Candidates for Bureaucratship]], [[Wikiversity:Candidates for Custodianship]])? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:30, 5 May 2026 (UTC)
:: Yes. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:33, 5 May 2026 (UTC)
:::I see, then I am fine with that @[[User:Codename Noreste|Codename Noreste]]. Sorry for misunderstanding. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:35, 9 May 2026 (UTC)

I've split the user rights nomination pages into:
* [[Wikiversity:Candidates for CheckUser]]
* [[Wikiversity:Candidates for Curatorship]]
* [[Wikiversity:Candidates for Custodianship]]
* [[Wikiversity:Candidates for Bureaucratship]]

Please review. There are likely several links to update, text to adjust, categories to manage, short-cuts to fix etc. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:22, 10 May 2026 (UTC)

:Thanks, great job @[[User:Jtneill|Jtneill]]. I am wondering if we need to move archived nominations too, or if we are OK with the actual state. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:08, 10 May 2026 (UTC)
::Yes, I think that would be helpful. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:46, 10 May 2026 (UTC)
:::I can do it @[[User:Jtneill|Jtneill]], I am just looking what system is there. I can see [[Wikiversity:Candidates for Custodianship/Archive of nominations for full custodianship]] which is a good complementary overview to the subpages with full history. The name of the pages is probably stably, but I would consider to create more specific redirect like [[Wikiversity:Candidates for Custodianship/Overview of staff nominations]], which would link to the above one. Then there is a [[Wikiversity:Candidates for Custodianship/Archived]], which are probably incomplete nominations, right? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:37, 11 May 2026 (UTC)
::::Tx @[[User:Juandev|Juandev]]. Yes, this makes sense. And maybe we move:
::::* archived '''curator''' nominations from [[Wikiversity:Candidates for Custodianship/Archive of nominations for full custodianship]] to e.g., [[Wikiversity:Candidates for Curatorship/Archive of nominations]]
::::* archived '''bureaucrat''' nominations from [[Wikiversity:Candidates for Custodianship/Archive of nominations for full custodianship ]] to e.g., [[Wikiversity:Candidates for Bureaucratship/Archive of nominations]]
::::-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:12, 11 May 2026 (UTC)
:::::OK. That sounds good. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:25, 12 May 2026 (UTC)
:An svg icon for [[Wikiversity:Curatorship|curators]] would also be helpful. We have them for other user rights: [[c:Category:Wikiversity user rights icons]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:54, 10 May 2026 (UTC)
::Done: [[Wikiversity:Curators]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 01:44, 11 May 2026 (UTC)

== Technical Request:  Courtesy link.. ==

[[Template_talk:Information#Background_must_have_color_defined_as_well]] [[User:ShakespeareFan00|ShakespeareFan00]] ([[User talk:ShakespeareFan00|discuss]] • [[Special:Contributions/ShakespeareFan00|contribs]]) 11:43, 20 March 2026 (UTC)
: I can't edit the template directly as it need an sysop/interface admin to do it. [[User:ShakespeareFan00|ShakespeareFan00]] ([[User talk:ShakespeareFan00|discuss]] • [[Special:Contributions/ShakespeareFan00|contribs]]) 11:43, 20 March 2026 (UTC)
:: Also if the Template field of - https://en.wikiversity.org/wiki/Special:LintErrors/night-mode-unaware-background-color is examined, there is poential for an admin to clear a substantial proportion of these by implmenting a simmilar fix to the indciated templates (and underlying stylesheets). It would be nice to clear things like Project box and others, as many other templates (and thus pages depend on them.) :)
[[User:ShakespeareFan00|ShakespeareFan00]] ([[User talk:ShakespeareFan00|discuss]] • [[Special:Contributions/ShakespeareFan00|contribs]]) 11:43, 20 March 2026 (UTC)

:I think it would be best to grant you interface admin rights for a short period of time to make these changes. However, I still have doubts about the suitability of this solution, which may cause other problems and no one has explained to me why dark mode has to be implemented this way @[[User:ShakespeareFan00|ShakespeareFan00]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:43, 20 March 2026 (UTC)

: I would have reservations about holding such rights, which is why I was trying to do what I could without needing them. However if it is the only way to get the required changes made, I would suggest asking on Wikipedia to find technical editors, willing to undertake the changes needed. [[User:ShakespeareFan00|ShakespeareFan00]] ([[User talk:ShakespeareFan00|discuss]] • [[Special:Contributions/ShakespeareFan00|contribs]]) 09:32, 21 March 2026 (UTC)

== WikiEducator has closed ==

Some of you may know of a similar project to Wikiversity, called [https://wikieducator.org/Main_Page WikiEducator], championed by [https://oerfoundation.org/about/staff/wayne-mackintosh/ Wayne Mackintosh][https://www.linkedin.com/posts/waynemackintosh_important-notice-about-the-oer-foundation-activity-7405113051688931329-Nhm9/][https://openeducation.nz/killed-not-starved/].

It seems [https://openeducation.nz/terminating-oer-foundation their foundation has closed] and they are no longer operating.

They had done quite a bit of outreach (e.g., in the Pacific and Africa) to get educators using wiki.

The WikiEducator content is still available in MediaWiki - and potentially could be imported to Wikiversity ([https://wikieducator.org/WikiEducator:Copyrights CC-BY-SA] is the default license).

The closing of WikiEducator arguably makes the nurturing of Wikiversity even more important.

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:09, 1 April 2026 (UTC)

:I was never active there. If anyone has an account or is otherwise in contact, we may want to copy relevant information here or even at [[:outreach:]]. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 04:46, 1 April 2026 (UTC)

:: I reached out to [[User:Mackiwg~enwikiversity|Wayne]] in January, and he responded briefly but positively (while travelling).  I wrote to the low-traffic wikieducator mailing list today and got a nice [https://groups.google.com/g/wikieducator/c/r_yIyUw6ZIA reply] from [[user:SteveFoerster|Steve Foerster]] who's interested in helping. If we can figure out a migration path it would be great to adopt at least the main namespace pages here.  
:: A few questions that come to mind: 
:: - would people want to create matching user accounts
:: - are there any namespaces (user/talk?) that should not be moved over
:: We could look at how this was done for the [[m:Wikivoyage/Migration]] wikivoyage migration. &lt;span style=&quot;padding:0 2px 0 2px;background-color:white;color:#bbb;&quot;&gt;&amp;ndash;[[User:Sj|SJ]][[User Talk:Sj|&lt;span style=&quot;color:#ff9900;&quot;&gt;+&lt;/span&gt;]]&lt;/span&gt; 04:27, 1 May 2026 (UTC)
:::That's fantastic, SJ, that you've reached out and that Wayne, Steve, and Jim are receptive—and that you can help! -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:52, 1 May 2026 (UTC)
::::A matching accound makes sense to give credits to the original authors and keep a clean chain of versions. The initial commit into wikiversity could have a &quot;marker with timestamp&quot; similar to signature with a reference where the content's source or a Web archive. This would allow authors to continue there work on wikiversity if they wish. [[User:Bert Niehaus|Bert Niehaus]] ([[User talk:Bert Niehaus|discuss]] • [[Special:Contributions/Bert Niehaus|contribs]]) 06:30, 15 May 2026 (UTC)

== Wikinews is ending ==

Apparently mainly due to low editorial activity, low public interest, but also failure to achieve the goals from the proposal for the creation of the project, the Wikinews project is ending after years of discussions ([[Meta:Proposal for Closing Wikinews|some reading]]).

And I would be interested to see how Wikiversity is doing in the monitored metrics. We probably have more editors than Wikinews had, but what about consumers and achieving the goals? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 19:14, 1 April 2026 (UTC)

:Wikiversity's biggest issue in recent times was the hosting of low-quality, trash content. Thankfully we've done a great job in removing pseudoscience and other embarrassingly trash content (Wikidebates, for example), but the biggest concern moving forward is proper maintenance IMO. I've caught several pseudoscience pages being created within the last few months that could easily have flown under the radar (ex, [[The Kelemen Dilemma: Causal Collapse and Axiomatic Instability]]), so I'd urge our custodians/curators to be on the lookout for this type of content. Usually an AI-overview can point this type of content out relatively well.
:In terms of visibility, I believe Wikiversity is a high-traffic project. I remember my [[Mathematical Properties]] showing up on the first page of Google when searching up &quot;math properties&quot; for the longest time (and is still showing up in the first page 'till this day!). Besides, Wikinews hosted a lot of short-term content (the nature of news articles), while Wikiversity hosts content that can still be useful a decade later (ex, [[A Reader's Guide to Annotation]]). 
:I think we are on a better path than we were a few months ago, and I do want to thank everyone here who has been helping out with maintaining our website! —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 20:48, 1 April 2026 (UTC)
:For what it's worth, the group that did that study has since disbanded, so no one is monitoring the other sister projects in the same way. Additionally, Wikinews had some catastrophic server issues due to the maintenance of [[:m:Extension:DynamicPageList]] which don't apply here. Your questions are still worth addressing, but I just wanted to cut off any concern at the pass about Wikiversity being in the same precarious situation. Wikiversity is definitely the biggest &quot;lagging behind&quot; or &quot;failure&quot; project now that Wikinews is being shuttered, but I don't see any near- or medium-term pathway to closing Wikiversity. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 00:46, 2 April 2026 (UTC)

:[[w:en:Wikipedia:Wikipedia Signpost/2026-03-31/News and notes|Entirety of Wikinews to be shut down]] (Wikipedia Signpost) -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:03, 11 April 2026 (UTC)

== Action Required: Update templates/modules for electoral maps (Migrating from P1846 to P14226) ==

Hello everyone,

This is a notice regarding an ongoing data migration on Wikidata that may affect your election-related templates and Lua modules (such as &lt;code&gt;Module:Itemgroup/list&lt;/code&gt;).

'''The Change:'''&lt;br /&gt;
Currently, many templates pull electoral maps from Wikidata using the property [[:d:Property:P1846|P1846]], combined with the qualifier [[:d:Property:P180|P180]]: [[:d:Q19571328|Q19571328]]. 

We are migrating this data (across roughly 4,000 items) to a newly created, dedicated property: '''[[:d:Property:P14226|P14226]]'''.

'''What You Need To Do:'''&lt;br /&gt;
To ensure your templates and infoboxes do not break or lose their maps, please update your local code to fetch data from [[:d:Property:P14226|P14226]] instead of the old [[:d:Property:P1846|P1846]] + [[:d:Property:P180|P180]] structure. A [[m:Wikidata/Property Migration: P1846 to P14226/List|list of pages]] was generated using Wikimedia Global Search.

'''Deadline:'''&lt;br /&gt;
We are temporarily retaining the old data on [[:d:Property:P1846|P1846]] to allow for a smooth transition. However, to complete the data cleanup on Wikidata, the old [[:d:Property:P1846|P1846]] statements will be removed after '''May 1, 2026'''. Please update your modules and templates before this date to prevent any disruption to your wiki's election articles.

Let us know if you have any questions or need assistance with the query logic. Thank you for your help! [[User:ZI Jony|ZI Jony]] using [[User:MediaWiki message delivery|MediaWiki message delivery]] ([[User talk:MediaWiki message delivery|discuss]] • [[Special:Contributions/MediaWiki message delivery|contribs]]) 17:11, 3 April 2026 (UTC)
&lt;!-- Message sent by User:ZI Jony@metawiki using the list at https://meta.wikimedia.org/w/index.php?title=Distribution_list/Non-Technical_Village_Pumps_distribution_list&amp;oldid=29941252 --&gt;
:I didnt find such properties, so we are probably fine. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:00, 12 April 2026 (UTC)
:: +1 (agreed). [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 22:19, 12 April 2026 (UTC)

== Enable the abuse filter block action? ==

In light of [[Special:AbuseLog/80178]] (coupon spam), I would like to propose enabling the block action for the abuse filter. Only custodians will be able to enable and disable that action on an abuse filter, and it is useful to block ongoing vandalism. Thoughts? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 19:12, 13 April 2026 (UTC)

:Seems like a good idea, almost all of the users which create such pages are spambots so this shouldn’t be a problem. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 23:41, 13 April 2026 (UTC)
:Can you explain some more (I am new to abuse filters)? It looks like the attempted edit was prevented? Which abuse filter?
:Note on your suggestion, have also reactivated Antispam Filter 12 - see [[WV:RCA]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:45, 15 April 2026 (UTC)
:: I am proposing that we activate the abuse filter block action, which if a user triggers an abuse filter, it would actually block the user in question - the same mechanism that a custodian would use to block users. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:11, 15 April 2026 (UTC)
:::OK, thankyou, that makes sense. And, reviewing the abuse filter 12 log, it would be helpful because it would prevent the need for manual blocking. But I don't see a setting for autoblocking? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 23:14, 15 April 2026 (UTC)
:::: I think it probably adds an autoblock. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 00:43, 16 April 2026 (UTC)
: [[User:Jtneill|Jtneill]] and [[User:PieWriter|PieWriter]], given that a little bit more than a week has passed and there is minimal consensus to activate the abuse filter block action, I filed [[phab:T424053]]. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:05, 21 April 2026 (UTC)
::Thank-you for doing this. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 08:03, 24 April 2026 (UTC)

== Advice needed: A Neurodiversity-inspired Idea/observation ==

If I want the greatest participation of others to &quot;provide constructive criticism to my idea&quot; or to &quot;shoot down my idea&quot; or &quot;idea&quot;.

What I've called it so far is &quot;The Neurodiversity-inspired Idea&quot;. At other times I used more sensationalist wording but here on Wikiversity I don't dare do that. I actually woke up with thinking about putting this into my userspace draft: &quot;Personal Observations Made By Meeting Autistic and Non-Autistic Adults&quot;.

My ultimate goal is to stop blathering about my &quot;idea&quot; to friend and family without feeling my &quot;methodology&quot; is going into any progressive direction whatsoever. My latest encounter was somewhat constructive though. A friend of a friend who worked with people presenting ideas in attempting to getting grants. I don't want a grant. I just want to figure out how I can express my &quot;idea&quot; in a way so that I can more clearly figure out what flaws it got.

At the same time I tend to overthink. If anyone thinks etherpad might be a good place and considering Wikimedia already got an etherpad at https://etherpad.wikimedia.org/ if anyone feels like they know me better in the future feel free to suggest a &quot;session&quot; on etherpad.

'''If I don't receive a reply to this in 1 week's time I will begin to explore this &quot;idea&quot; into my userspace''' unless you replied and refrained me from doing so, of course. Then maybe after &quot;developing it there&quot; I might reference it to you another future time here in the Colloquium, with my &quot;idea&quot; still in my userspace draft. This &quot;idea&quot; is sort of a burden, I'm happy I've made the choice to get rid of it and hopefully move on with my life, unless there is something to this &quot;idea&quot;. 

My failure is probably evident: I feel I haven't told you anything. Same happened to when I talked to friends and family. In danger of overthinking it further I'll publish this right now. I need to &quot;keep it together&quot; [[User:ThinkingScience|ThinkingScience]] ([[User talk:ThinkingScience|discuss]] • [[Special:Contributions/ThinkingScience|contribs]]) 10:36, 16 April 2026 (UTC)

:Good on you putting it out there ... and hitting publish :). I'd say go for it (no need to wait), give birth to your idea and share about it here and elsewhere. Let it take shape and see where it might go. In many ways, this is exactly what an open collaborative learning community should be doing. Others might not know well how to respond, so perhaps consider creating some questions to accompany the idea. Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:21, 16 April 2026 (UTC)
::Thank you for encouraging me in developing the idea.
::I have created a &quot;questions&quot; section in the draft which is visible in the table of contents now. My brain was &quot;frozen&quot; today metaphorically speaking in that I felt I had like a &quot;writer's block&quot; so the draft has more &quot;AI/LLM&quot; content than before. I used the LLM for generating questions. The answers are so far human-only.
::I've also created a subsection where I could add the prompts that made the LLM generate the questions. That could help people make better prompts perhaps. I've described what it is about inside of it and there are some chaotically written notes.
::[[Draft:The_Neurodiversity-inspired_Idea#Questions_that_might_encourage_the_development_of_this_idea_and_its_methodology]]
::My draft is missing stuff. Any questions that you contribute to my draft will probably help me and if I don't understand the questions I'll probably notify you and also at the same time &quot;feed them&quot; to an LLM and ask in my input like &quot;explain in simple words what this question means, what is it searching for?&quot; etc. while I wait for an answer. If you have any more feedback please give it to me here or on the Draft page, its talk page or my user talk page. Thank you for helping me! [[User:ThinkingScience|ThinkingScience]] ([[User talk:ThinkingScience|discuss]] • [[Special:Contributions/ThinkingScience|contribs]]) 21:20, 18 April 2026 (UTC)
::Today I woke up with not only thinking about supplying questions along with the &quot;idea&quot; but also answers. ie. Is it possible to &quot;test&quot; this idea? Is it possible to create one or multiple hypotheses based on this &quot;idea&quot;?(etc.) I've thought about this before in this &quot;idea&quot; but since I'm beginning to add to Wikiversity what was previously 'locked in my mind' it's also easier for me to see what I've done so far. Thank you for this comment! [[User:ThinkingScience|ThinkingScience]] ([[User talk:ThinkingScience|discuss]] • [[Special:Contributions/ThinkingScience|contribs]]) 09:11, 23 April 2026 (UTC)
:May I think that you should not add deadlines ; being read, and rising interest for collaboration, or even simply for exchange of thoughts, such an effective meeting event loads a huge bunch of unprobability, which time can help to… somehow diminish. Maybe, I would advice you having a central place for developping your ideas, your needs, your advances, maybe a page in your own user zone, and from time to time, depending your feeling, it could be every trimester or so, or more frequently, you could write a short account of progress (or even of no progress), or a call for participation, in such a place as this present one ; I think that will increase much exposure of your projet. Maybe also, if you can find a project name, not necessarily very meaningfull by itseilf (at least it will gain signification with time, as your project develops), that will serve as a kind-of hook, and make your announcement titles more visible. Best regards (and my excuses for my poor command of English, which seems to be unplease an anti-abuse filter, &quot;Questionable Language (profanity)&quot;, which I don't understand…). My few cents. --  [[User:Eric.LEWIN|Eric.LEWIN]] ([[User talk:Eric.LEWIN|discussion]] • [[Special:Contributions/Eric.LEWIN|contributions]]) 10:06, 17 April 2026 (UTC)
::Sorry about the false positive on the profanity filter - I've fixed it. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:26, 17 April 2026 (UTC)
:::&quot;May I think that you should not add deadlines ; being read, and rising interest for collaboration, or even simply for exchange of thoughts, such an effective meeting event loads a huge bunch of unprobability, which time can help to… somehow diminish.&quot;
::Thank you Eric for this comment. Trust in time is how I interpret it. I should not feel like I need to be in a hurry. I'll try to give this time. Thank you!
:::&quot;Maybe, I would advice you having a central place for developping your ideas, your needs, your advances, maybe a page in your own user zone, and from time to time, depending your feeling, it could be every trimester or so, or more frequently, you could write a short account of progress (or even of no progress), or a call for participation, in such a place as this present one ; I think that will increase much exposure of your projet.&quot;
::A central place for developing or making &quot;project notes&quot; regarding the Neurodiversity idea on my userspace, I might need that, like a diary or &quot;project notes&quot; of the Neurodiversity idea similar to my course notes regarding my experience with Coursera.
::Any actions I take are going to be related to my Userspace from now on but I'll also update the draft when necessary. Now in the beginning I might be working daily to once every 3 days on both the draft and the daily notes I plan to make.
:::&quot;Maybe also, if you can find a project name, not necessarily very meaningfull by itseilf (at least it will gain signification with time, as your project develops), that will serve as a kind-of hook, and make your announcement titles more visible.&quot;
::Thank you for the advice. I was brainstorming yesterday about it. I concluded that since I've not yet developed a methodology that adheres to &quot;Do no harm&quot; and this is my first time working my &quot;idea&quot; into a way that is compatible with how projects develop on English Wikiversity this is new to me. My methodology isn't developed and therefore trying to get attention to my project through a name can wait. Yesterday I figured out a silly title that has nothing to do with the project: &quot;Planetary Awareness Potato Cabbage Rolls&quot; or something like that. Google output read that no such thing exists so I wanted it mainly to be unique. I don't want to raise attention that I'm unsure whether I'll actually be capable of developing a methodology for but project notes is my best bet so far in tracking my progress. Every day I think about this &quot;idea&quot; but I need to improve the important parts.
:::&quot;Best regards (and my excuses for my poor command of English, which seems to be unplease an anti-abuse filter, &quot;Questionable Language (profanity)&quot;, which I don't understand…). My few cents.&quot;
::You added great points and I felt that I was helped by you! I encourage you to post again and I can understand that interacting with any kind of automated filter can be discouraging and can be for me too! Thank you for giving me feedback! [[User:ThinkingScience|ThinkingScience]] ([[User talk:ThinkingScience|discuss]] • [[Special:Contributions/ThinkingScience|contribs]]) 16:01, 18 April 2026 (UTC)

== Add some user rights to the curator user group? ==

By default, only custodians have the ability to mark new pages as patrolled (&lt;code&gt;patrol&lt;/code&gt;) and have their own page creations automatically marked as patrolled (&lt;code&gt;autopatrol&lt;/code&gt;). I am proposing both of the following:
* Curators can mark new pages as patrolled, helping on reducing the backlog of new, unpatrolled pages.
* New pages made by curators will be automatically marked as patrolled by the MediaWiki software.
Before we implement this, I would suggest implementing a proposed guideline for marking new pages as patrolled for curators and custodians.

Thoughts? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 16:32, 17 April 2026 (UTC)

:Agree, &lt;s&gt;also can we also allow curators to undelete pages since they already have the rights to delete them?&lt;/s&gt; [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 02:54, 18 April 2026 (UTC)
::I think the requirement that undelete NOT be included came from above (meta / stewards / central office). Having access to the undelete page gives access to information that is restricted by their policies to admins (custodians and bureaucrats). -- [[User:Dave Braunschweig|Dave Braunschweig]] ([[User talk:Dave Braunschweig|discuss]] • [[Special:Contributions/Dave Braunschweig|contribs]]) 20:12, 18 April 2026 (UTC)
::: [[User:PieWriter|PieWriter]], unless if requests for curator and custodian should be RfA-like processes (that is, including voting and comments), then I have to agree with Dave above. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 22:03, 18 April 2026 (UTC)
::::Oh, I didn’t realise that. Withdrawing my comment.. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:08, 19 April 2026 (UTC)
:{{support}} Seems reasonable and would reduce overhead. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 14:35, 18 April 2026 (UTC)
:'''Agree''', implement it also to [[Wikiversity:Curators]] proposal please. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:11, 18 April 2026 (UTC)
: I went ahead and filed [[phab:T424445]]. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:39, 26 April 2026 (UTC)

== [[Wikiversity:Curators|Curators and curators policy]] ==
{{archive top|There is strong consensus, so [[Wikiversity:Curators]] is now a policy. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:15, 9 May 2026 (UTC)}}
How does it come, that Wikiversity has curators, but Curators policy is still being proposed? How do the curators exists and act if the policy about them havent been approved yet? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:33, 16 October 2025 (UTC)

:It looks as if it is not just curators. The policy on Bureaucratship is still being proposed as well. See [[Wikiversity:Bureaucratship]]. —[[User:RailwayEnthusiast2025|&lt;span style=&quot;font-family:Verdana; color:#008000; text-shadow:gray 0.2em 0.2em 0.4em;&quot;&gt;RailwayEnthusiast2025&lt;/span&gt;]] &lt;sup&gt;[[User talk:RailwayEnthusiast2025|&lt;span style=&quot;color:#59a53f&quot;&gt;''talk with me!''&lt;/span&gt;]]&lt;/sup&gt; 18:33, 27 October 2025 (UTC)

:I think its just the nature of a small WMF sister project in that there are lots of drafts, gaps, and potential improvements. In this case, these community would need to vote on those proposed Wikiversity staff policies if we think they're ready. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:08, 3 December 2025 (UTC)
:What? I thought you were getting it approved, Juandev... :) [[User:I&amp;#39;m Mr. Chris|I&amp;#39;m Mr. Chris]] ([[User talk:I&amp;#39;m Mr. Chris|discuss]] • [[Special:Contributions/I&amp;#39;m Mr. Chris|contribs]]) 14:20, 12 February 2026 (UTC)
::Yeah I think this one is important too and we need to aprove it too @[[User:I'm Mr. Chris|I'm Mr. Chris]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 15:56, 12 February 2026 (UTC)
:::I thinks its ready to made into a policy, it seems to be complete and informative about what the rights does and how to get it. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 03:08, 15 February 2026 (UTC)
::::Agree -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:00, 27 March 2026 (UTC)

Let's make this the official discussion about adopting the [[Wikiversity:Curators|curators policy]] policy. Your comments are invited and welcome. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 08:40, 24 April 2026 (UTC)
: There were two similar Colloquium threads in separate places about the proposed curators policy. So I've moved them to be adjacent. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 12:42, 1 May 2026 (UTC)
{{archive bottom}}

== Wikiversity:Curators to become a policy ==
{{archive top|There is strong consensus, so [[Wikiversity:Curators]] is now a policy. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:16, 9 May 2026 (UTC)}}
I've looked at the discussions about the Curators policy, I've looked at the practices, and it seems to me that there is no dispute about the wording of the policy, and what's more, the community has been using this proposal as if it were an offical policy for several years. Therefore, I propose that [[Wikiversity:Curators]] become a policy. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:35, 18 April 2026 (UTC)

:{{support}} —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:54, 18 April 2026 (UTC)
:{{support}} —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 20:21, 18 April 2026 (UTC)
: {{support|Yes, please}}. Especially after when I and PieWriter proposed above, I agree. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:27, 24 April 2026 (UTC)
:: @[[User:Juandev|Juandev]]; as of now, curators now have the user rights &lt;code&gt;autopatrol&lt;/code&gt; and &lt;code&gt;patrol&lt;/code&gt;. Perhaps we should also include that in [[Wikiversity:Custodianship]]? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 12:07, 30 April 2026 (UTC)
:::You meant [[Wikiversity:Curators]] @[[User:Codename Noreste|Codename Noreste]]? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:15, 5 May 2026 (UTC)
:::: I agree that we must develop what rules curators should follow when marking new pages as patrolled; the same can be added for custodians since they can also mark new pages as patrolled. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:37, 5 May 2026 (UTC)
:::::I see, well I think you can just add this to the policy. It is not major change and it probably reflects actual practice or actual technical possibilities for those flags. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:20, 7 May 2026 (UTC)
:{{support}} -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 12:42, 1 May 2026 (UTC)
:{{Support}} per nom. [[User:PhilDaBirdMan|PhilDaBirdMan]] ([[User talk:PhilDaBirdMan|discuss]] • [[Special:Contributions/PhilDaBirdMan|contribs]]) 13:32, 1 May 2026 (UTC)
{{Archive bottom}}

== Is anyone interested in Neurodiversity? ==

Is anyone interested in Neurodiversity? Is there anyone here who is interested for Neurodiversity to be &quot;something more&quot; than it already is? Does anyone here consider Neurodiversity one of the &quot;harder topics&quot; to work on or discuss? Does anyone here have an opinion about the [[Neurodiversity Movement]]? So these questions don't appear like &quot;out of a vacuum&quot; I can tell you a bit about my background:

Many years ago I got a psychiatric diagnosis &quot;Asperger's&quot;. After I stepped out of the office and my Äsperger's was 'concluded', I stepped out into the street and thought my first negative thought(but the positive thought followed after). The thought was about concentration camps in the second world war and that the world seemed to be going into the direction of &quot;labeling others&quot;. I was unsure whether this was &quot;real science&quot; and sort of &quot;challenged myself&quot; to make up my own mind after meeting people that had been given this diagnosis. The more adults with this diagnosis I met the more I started seeing &quot;patterns&quot;.

Was it a coincidence that the first person with Asperger's I met reminded me about my father later after I had plenty of times of experience with interacting with him? None of the people I interacted with online through IRC text chat...I felt I got any clue about how &quot;their brains work&quot;. Only when I met one person from the Asperger's chat community in person we both realized that whatever we experienced was akin to the &quot;chaos theory&quot;. He told me about &quot;chaos theory&quot; while I didn't know even what that term meant but I guess I 'read between the lines'. My question that I linger on still today is &quot;did he understand about me what I think I understood about him?&quot;? That our brains had the same configuration? Most autistic adults who meet other autistic adults usually get disappointed. They think the diagnosis will help them meet somebody like themselves and then they realize the great diversity in the autistic spectrum created by Psychiatry.

I later stopped interacting with autistic communities that much, I felt that it did not benefit me. Also Neurodiversity's &quot;neurotypes&quot; interested me for a while until I realized I had &quot;misunderstood everything&quot; about them and how they are used in the Neurodiversity Movement or &quot;Neurodiversity community&quot; if that even can precisely be defined? I doubt it but if you want to contribute to the [[Neurodiversity Movement]]. My previous attempts failed as I got more and more confused. I think a community project needs a community. With a lack of that I don't think it is worth my time. If any of you would like to work on that project let me know on my talk page.

So I was kinda lost and was talking to my friend and psychologist and I realized if I never talk about my idea to anyone in a &quot;comprehensive way&quot; or show that it matters to me nothing is going to ever happen. So I started talking about my &quot;idea&quot; more. Nobody could understand the &quot;idea&quot; because I had not developed my skills regarding where to start...although the process had already started &quot;automatically&quot; and that's why I often think of &quot;well my brain sort of activated me&quot;. I don't feel like I did have a plan and this idea happened. It happened &quot;by itself&quot;. My brain reacted to what I was seeing in a video or stream.

I value interaction highly in this idea. I think it would be helpful to make a community of people who are not paranoid about stuff that can express itself like &quot;don't analyze me!&quot;, &quot;don't compare me to anyone!&quot;. 

On the contrary, more often than not those adults who were diagnosed were actually openly comparing themselves with each other and I think that is healthy in a &quot;science&quot; way if done the &quot;right way&quot; which probably means &quot;Do no harm&quot;.

I found video material is important but I'm very unsure if uploading own video material to Wikimedia Commons would constitute a &quot;reasonable&quot; use of the resources there. Maybe somebody here needs to ask more questions to me that I should answer before that happens. I also know the '''be bold''' so I could just do what I think might be ok. Though I work better in a group as long as I know what &quot;group configurations&quot; help me. This is in a non-profit way. Since the state supported me this might be a way I am trying to &quot;give back&quot; to the state and &quot;the world&quot;. May seem overly ambitious and crazy but this thing gives me energy. It gives me hope when trying to develop this idea. [[User:ThinkingScience|ThinkingScience]] ([[User talk:ThinkingScience|discuss]] • [[Special:Contributions/ThinkingScience|contribs]]) 10:47, 23 April 2026 (UTC)

:Thanks for sharing. There is plenty of room for neurodiversity community learning. However, the challenge I think is that the intersection of those interested in (a) ND, and (b) English Wikiversity might be very small (e.g., 1!) at this point in time.
:But don't give up hope. For example, Wikipedia has many more ND-interested editors; maybe consider reaching out to see who might be interested:
:[[w:Category:Wikipedians interested in neurodiversity]]
:You could also start an equivalent category here:
:[[:Category:Wikiversitarians interested in neurodiversity]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:46, 6 May 2026 (UTC)

== Request for comment (global AI policy) ==

&lt;bdi lang=&quot;en&quot; dir=&quot;ltr&quot; class=&quot;mw-content-ltr&quot;&gt;A [[:m:Requests for comment/Artificial intelligence policy|request for comment]] is currently being held to decide on a global AI policy. {{int:Feedback-thanks-title}} [[User:MediaWiki message delivery|MediaWiki message delivery]] ([[User talk:MediaWiki message delivery|discuss]] • [[Special:Contributions/MediaWiki message delivery|contribs]]) 00:58, 26 April 2026 (UTC)&lt;/bdi&gt;
&lt;!-- Message sent by User:Codename Noreste@metawiki using the list at https://meta.wikimedia.org/w/index.php?title=Distribution_list/Global_message_delivery&amp;oldid=30424282 --&gt;

== Language learning  ==

toki! I am trying to add or see what the toki pona language learning stuff on here is but I don't see anything that is language learning for anything. [[User:Jan Imon|Jan Imon]] ([[User talk:Jan Imon|discuss]] • [[Special:Contributions/Jan Imon|contribs]]) 23:13, 2 May 2026 (UTC) —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 17:29, 3 May 2026 (UTC)

:We have language materials ([[:Category:Languages]], [[World Languages]], [[Portal:Foreign Language Learning]], [[Portal:Multilingual Studies]]). They are not as developed as I think we would all like and there's not any coverage of Toki Pona, but in principle, we could and would like that. You can also see [[:b:Subject:Languages]] at our sister project Wikibooks. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 17:33, 3 May 2026 (UTC)

== Timeline format? ==

I’ve been working on the World War II articles, including the [[World War II/Timeline|timeline]], and is there a specific timeline format that should be used? Right now it’s just a table, and there’s no separation between different periods/phases of the war.

I don’t want to use [[mw:Extension:EasyTimeline]] because this will be displaying dates and not time periods. [[User:PhilDaBirdMan|PhilDaBirdMan]] ([[User talk:PhilDaBirdMan|discuss]] • [[Special:Contributions/PhilDaBirdMan|contribs]]) 01:35, 4 May 2026 (UTC)

:I dont think we have a policy or guideline, how to format a timeline. But you may try to browes wikiversity by Google if someone was dealing with this in the past somewhow @[[User:PhilDaBirdMan|PhilDaBirdMan]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:23, 5 May 2026 (UTC)
::+1 - there's no specific guideline on how to format a timeline, it's really up to you. In my opinion I think the timeline is good. I'd personally bold the dates just to make it easier to separate it from the event description, but that's my personal 2 cents. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 14:18, 5 May 2026 (UTC)
:::I’ll probably remove links to the dates/years, they’re just Wikipedia pages that shouldn’t be over linked to. [[User:PhilDaBirdMan|PhilDaBirdMan]] ([[User talk:PhilDaBirdMan|discuss]] • [[Special:Contributions/PhilDaBirdMan|contribs]]) 00:39, 6 May 2026 (UTC)

== Interface administrator for Codename Noreste ==
{{Archive top|After running for a week, there is clear consensus for [[User:Codename Noreste]] to have Interface admin rights for 120 days; implemented until 10 September, 2026 -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 22:36, 12 May 2026 (UTC)}}

Hello, everyone. I am requesting interface administrator access on this wiki.

The main reasoning is that I would benefit from having the user right &lt;code&gt;editinterface&lt;/code&gt;, which would allow me to make dark mode changes to pages in the MediaWiki namespace, add &lt;code&gt;&lt;nowiki&gt;&lt;div class=&quot;mw-parser-output&quot;&gt;&lt;/nowiki&gt;&lt;/code&gt; to some interface pages using templates, handle interface-protected edit requests, and similar stuff. Additionally, I have some knowledge of CSS, and I would like to assist with modifying CSS pages whenever necessary, such as moving MediaWiki common.css code to TemplateStyles CSS pages.

I am requesting the maximum time that is allowed per the [[Wikiversity:Interface administrators|policy]], and I have 2FA enabled on my account. Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 00:55, 6 May 2026 (UTC)

*{{support}} Globally trusted user. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 01:07, 6 May 2026 (UTC)
*{{support}} Trusted and knowledgeable. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:35, 6 May 2026 (UTC)
*{{support}} WV would benefit from this. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 08:32, 6 May 2026 (UTC)
*{{support}} --[[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:13, 7 May 2026 (UTC)

:{{Comment}} Could @[[User:Codename Noreste|Codename Noreste]] delete [[MediaWiki:Gadget-WikiSign.js]], which was requested to be deleted @[[User:Koavf|Justin]], @[[User:Jtneill|Jtneill]], @[[User:Atcovi|Atcovi]]? I dont think we need it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:40, 9 May 2026 (UTC)
::Yes - clearly no longer used -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:18, 9 May 2026 (UTC)
::: I can't delete it because I don't have the required permissions to do so.
::: On a side note, if this project has a need for permanent interface administrators, I would suggest that we have a minimum of two IAs, similar to how there must be two CUs and/or suppressors (or none). Maybe Koavf can be a good candidate if I am elected for permanent interface adminship, and I believe that permission shouldn't be removed from someone's own account. Instead, a bureaucrat should do it. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:20, 9 May 2026 (UTC)
::::I am willing and happy to do it, unfortunately, we do not have an appetite for indef IAs and just had a discussion that resulted in a [https://en.wikiversity.org/w/index.php?title=Wikiversity:Interface_administrators&amp;diff=prev&amp;oldid=2807543 consensus that we can have IAs that have the user rights for 14 to 120 days]. So once you have the rights, please make sure to gopher it. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 17:54, 9 May 2026 (UTC)
:::::@[[User:Koavf|Koavf]] give it time. Look at me, I was in favor of shorter time, now I am looking back to times, when custodians could do it without the need of extra flag. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:31, 9 May 2026 (UTC)
::::::Here's hoping. I think it would reduce administrative overhead, but that's just me and I'm not a bureaucrat here. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:33, 9 May 2026 (UTC)
::::Complicated. Where are the times, admins could do everything! [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:27, 9 May 2026 (UTC)
{{archive bottom}}

== [[Wikiversity:Bureaucratship]] to become a policy ==

Following the recent approval of [[Wikiversity:Curators]] as a policy, I think [[Wikiversity:Bureaucratship]] may also be ready for policy status.

Please share your views about whether bureaucratship is ready to become a policy, or whether further revisions are needed.

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 13:58, 9 May 2026 (UTC)
: I added a logo about that user group, but other than that, it looks good to me. {{support}}. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:38, 9 May 2026 (UTC)
:I think that the consensus on this policy is proven by years of using it without further changes. But I I have to say weather I agree with this to become a policy, than of course {{support}}. It works and there were no major issues with it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:45, 9 May 2026 (UTC)
:{{support}} no issues. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 14:51, 10 May 2026 (UTC)
:{{support}} [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 12:37, 11 May 2026 (UTC)
:{{support}} ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 06:51, 12 May 2026 (UTC)

== Reminder about custodian-related pages ==

I would like to remind the community about what the following custodian pages are:
* [[Wikiversity:Request custodian action]] is for requesting actions to be done by custodians, and
* [[Wikiversity:Notices for custodians]] is for notices of interest to custodians, like an administrator's noticeboard
Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:12, 12 May 2026 (UTC)

:Thanks - I needed this reminder :) -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 22:21, 12 May 2026 (UTC)

== [[MediaWiki:Protectedpagetext#Protected edit request on 11 December 2025]] ==

I posted an edit request there 5 months ago, so I’ll be taking it to this page. [[Special:Contributions/&amp;#126;2026-28640-56|&amp;#126;2026-28640-56]] ([[User talk:&amp;#126;2026-28640-56|talk]]) 23:33, 12 May 2026 (UTC)

:What exactly is the problem? I don't understand what needs to change and why. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 23:35, 12 May 2026 (UTC)
: Pinging @[[User:Atcovi|Atcovi]], @[[User:Jtneill|Jtneill]] and @[[User:Juandev|Juandev]] for further input. Someone is requesting a modification to [[MediaWiki:Protectedpagetext]] to use {{tlx|Protected page text}}, but we might need to discuss whether to use the template. In the meantime, I'll start a sandbox version of the protected page text template. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 23:19, 14 May 2026 (UTC)
::Sounds good -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:13, 15 May 2026 (UTC)

== Create a pseudo-bot user group? ==

I would like to propose adding a new user group to Wikiversity: Pseudo-bot (&lt;code&gt;flood&lt;/code&gt;). This will allow users to perform repetitive actions without flushing the recent changes feed (with only the &lt;code&gt;bot&lt;/code&gt; user right). However, I would suggest that for the pseudo-bot user group:
* It can be granted and revoked by custodians. However, can curators add and remove pseudo-bot from their own accounts (and not others)?
* Users can remove themselves from it.
* A guideline might be necessary about the information and usage of it.
Thoughts? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 03:31, 14 May 2026 (UTC)

:This sounds good. Which other wiki could we model this user group on? e.g., [[b:Wikibooks:Pseudo-bots]]? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:19, 15 May 2026 (UTC)
::@[[User:Jtneill|Jtneill]] Wikiquote has a similar group: [[:wikiquote:Special:ListGroupRights]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 04:25, 15 May 2026 (UTC)

== Coming over From wikinews ==
Any chance someone could help me if you are allowed to write news articles here since wikinews is going read only mode soon, thank you! [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 22:43, 1 May 2026 (UTC)

:The scope of Wikiversity is very broad and is basically about more-or-less any learning material. We have made it a point to not have duplicative content of other WMF projects, but since Wikinews is being shuttered, I personally am fine with writing news articles here. One thing that is not controversial at all is a learning resource &lt;em&gt;about&lt;/em&gt; how to write news: that could be hugely useful here and could involve the process of writing news stories to learn and to share back and forth with an editor or fact-checker. In fact, I'd support an entire namespace dedicated to keeping the notion of Wikinews alive here. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 23:38, 1 May 2026 (UTC)
::Thank you so much! How do I start? Cheers! @[[User:Koavf|Koavf]] [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 01:07, 2 May 2026 (UTC)
:::I think it's premature to start just making news articles en masse, but if you want to start discussing the topic of citizen journalism, you can do that now. [[:Category:Journalism]] already has some material, so you can start by seeing what we already have, how you can refine that, etc. You can definitely have learning resources with collaborators who want to learn about journalism ASAP. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 01:24, 2 May 2026 (UTC)
::::thanks. [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 01:38, 2 May 2026 (UTC)
::::If I could try and start one News Article could you please tell me how to go about it? Like what style of writing like Wikinews or something else? Thank you Justin! @[[User:Koavf|Koavf]] [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 01:48, 2 May 2026 (UTC)
:::::Honestly, there are very few policies and guidelines here. I think the best way to write a news story would be in a manner that is obvious and instructive. So, for instance, it's common to use the &quot;pyramid style&quot; when you're writing news, so if you were to write a story that makes it very clear that you are using that approach, that would be helpful. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 02:08, 2 May 2026 (UTC)
::::::cool thanks. [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 02:13, 2 May 2026 (UTC)
::::::im ready to write @[[User:Koavf|Koavf]] [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 21:30, 13 May 2026 (UTC)
:::::::I think we should get more local consensus for a big project like including the entirety of the scope of Wikinews here. Again, I support it personally. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 21:55, 13 May 2026 (UTC)
::::::::ok lets begin. [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 22:15, 13 May 2026 (UTC)

== Proposal to rehost Wikinews here ==

As many of you know, and mentioned here at the Colloquium, our sister project Wikinews recently closed, with all 31 active editions made read-only. [[User:BigKrow]] has asked about the prospect of writing news stories here and I suggested that since we already have [[School:Journalism]] and some resources related to the [[:Category:Journalism|broader topic of journalism]]. I would like to propose that we have continued and indefinite space for {{w|citizen journalism}} by essentially repurposing Wikinews into a sub-project here. The only special infrastructure that Wikinews required was [[:mw:Extension:DynamicPageList]], which was deactivated and caused issues due to a lack of maintenance.

I will add this proposal to the site banner, but I recognize that that may be a conflict of interest, so if anyone requests that I remove it, I will. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:30, 14 May 2026 (UTC)
:I would like to see this conversation go for at least 30 days to establish a consensus. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:35, 14 May 2026 (UTC)

===Votes===
*{{support}} as proposer (with BK's inspiration). I think that an ongoing experiment in citizen journalism is a fit and appropriate use of this site. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:35, 14 May 2026 (UTC)
*{{support}}, hope to seeing ideas about this, and thank you @[[User:Koavf|Koavf]] [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 11:08, 14 May 2026 (UTC)
*{{support}} Other than perhaps inflating the total number of pages reported, I see the idea of &quot;practicing journalism&quot; a worthy and relevant activity within the domain of Wikiversity. [[User:IanVG|IanVG]] ([[User talk:IanVG|discuss]] • [[Special:Contributions/IanVG|contribs]]) 21:41, 14 May 2026 (UTC)
*{{support}} Conditional on development of (a) community guidelines that ensure alignment with Wikiversity's purpose, and (b) clear, nested page-naming structures for projects. More detail below. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:48, 15 May 2026 (UTC)
*{{contra}} This proposal doesn't seem interested in expanding educational materials in journalism, but rather in providing space and protection for Wikinews contributors. But this is contrary to the goals of Wikiversity, and I'm not sure it's a good idea, even with regard to WMF. If WMF decides to close a project and another community lets it run on its domain, that's a bit of an undermining of WMF's and the community's decisions. Given that Wikiversity has had several conflicts with other communities and WMF in its history, I'm against it.--[[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:59, 15 May 2026 (UTC)

===Comments and questions===
:Definitely worthy of discussion, so I have no problem with the proposal in the sitenotice.
:Initial questions:
:* Does this proposal include importing English Wikinews content e.g., to [[Wikinews]] subpages?
:* What are &quot;active editions&quot;?
:* How can Wikiversity navigate the concerns that lead to the closure of Wikinews?
:* Are any changes to the scope of Wikinews proposed?
:* How does [[Wikinews]] fit with the [[Wikiversity:Mission]]? What aligns well? Where might there be tension?
:** e.g., I'm not sure that a page like [[Story/Manchester City moves two points behind Arsenal]] in and of itself will serve as an educational resource.
:-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 05:52, 14 May 2026 (UTC)
:* Does this proposal include importing English Wikinews content e.g., to [[Wikinews]] subpages?
::*No, not at this time.
:* What are &quot;active editions&quot;?
::*There were 30 other active editions of Wikinews in addition to English (e.g. [[:n:es:]]) at the time of universal closure (2026-05-04).
:* How can Wikiversity navigate the concerns that lead to the closure of Wikinews?
::*One of the biggest issues was the problems with DPL, which is now irrelevant. Another was the lack of activity, which can be ameliorated by having it be part of an existing project instead of its own domain (e.g. some editions of Wikipedia host their own Wikinews already and those projects were not impacted by the closure).
:* Are any changes to the scope of Wikinews proposed?
::*Not at this juncture. I would also propose as far as implemention goes that we would request a new namespace and that the material be more-or-less sequestered into its own ongoing project, like Wikijournal is or like the Cookbook and Wikijunior are at our sister [[:b:]].
:* How does [[Wikinews]] fit with the [[Wikiversity:Mission]]? What aligns well? Where might there be tension?
:** e.g., I'm not sure that a page like [[Story/Manchester City moves two points behind Arsenal]] in and of itself will serve as an educational resource.
::*The process of citizen journalists practicing their craft in real-time and collaborating with others to do so is itself an education activity. We would essentially be hosting a real-time experiment in citizen journalism, online communities, and collaborative learning in addition to the prospect of spreading educational information from someone actually reading the news. I would propose that we could also make a more deliberate attempt to engage with learning &lt;em&gt;about&lt;/em&gt; what does and doesn't work with collaborative news writing by experimentation (e.g. audio news, syndicating to other sites, incorporating freely-licensed news from other sources, writing hyper-local news, writing briefs versus longer-term reportage) and also seeing if the problems noted in the Task Force report that recommended closure can be overcome. Note that we have already done some local investigation about and learning about wiki-based journalism on Wikinews here at [[Journalism studies and Wikinews]]. We could continue that learning and refine the process, including incorporating journalism students from universities. As for tensions, Wikinews is the only sister project that must be done with a quick turn-around: if you take a long time to [[:s:|transcribe a book]], that's just how long it takes, but if you take a long time to write news, it ceases to be news entirely. Wikiversity has been a very slow-growing project that has definitely had some successes but has generally come together over a long period with most learning resources being individual passion projects (or sometimes, frankly, crankery) which would not work with collaborative news that requires more than just a single editor writing whatever he feels like.
::Please let me know any other questions/concerns and any other editors feel free to give your own perspective. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 06:13, 14 May 2026 (UTC)
:::Thanks, Justin — it is food for thought.
:::In attempting to understand how we've arrived here, I've summarised some of the background on this page: [[Wikinews]].
:::Perhaps it could be helpful to flesh out more of the vision / ideas / possibilities / challenges on that page? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:49, 14 May 2026 (UTC)

:::*Having given it some thought, in principle, I support hosting [[citizen journalism]] on Wikiversity where it is clearly connected to a learning project and/or constitutes original research, both of which align strongly with [[Wikiversity:Mission|Wikiversity’s educational mission]].
:::*My chief concern is the potential for news content that is not clearly linked to the purpose of Wikiversity. To avoid this, some community-agreed guidelines would be prudent. These need not be overly restrictive; they should support boldness and experimentation while helping ensure alignment with Wikiversity's purpose.
:::*Given the reported low and declining activity on Wikinews, it seems unlikely that English Wikiversity would be overwhelmed by an influx of news-related editing. My impression is that English Wikinews was the most active edition, but even so, many contributors are likely to disperse to other projects or cease editing altogether. A modest migration of interested editors to Wikiversity seems manageable.
:::*At this stage, I do not think a dedicated namespace is necessary. Subpages under [[Wikinews]] or nested pages under relevant learning or research projects, or user-space draft pages should be suitable. I agree that [[Wikijournal]] offers a useful model, as do several existing course structures on Wikiversity.
:::*I support [[User:Koavf]]’s suggestions about framing Wikinews activity explicitly around learning. This would create a distinctive space for experimenting with collaborative news production in ways that are pedagogically meaningful. I agree that the [[journalism studies and Wikinews]] project developed by David and Leigh Blackall through the University of Wollongong is an excellent example of the intersection between Wikiversity and Wikinews. The [[Wikinews]] page could evolve into a hub for such projects.
:::*I've tidied the [[:Category:Wikinews|Wikinews category]] and merged some content into the [[Wikinews]] page. As part of a reinvigoration effort, please review these and related resources such as [[:Category:Journalism]] and [[School:Journalism]].
:::*A further argument in favour of this initiative is that Wikipedia explicitly excludes both news reporting and original research. So, there is value in maintaining spaces within the Wikimedia ecosystem where these forms of knowledge production can be openly developed and curated. Such work can, in turn, generate valuable evidence and source material that may later inform Wikipedia articles.
:::*The closure of WMF-hosted Wikinews does not imply that open wiki-based news curation lacks value. Indeed, the closure documentation appears supportive of experimentation with alternative news models across Wikimedia projects, including through Wikipedia and Wikidata. In that context, Wikiversity seems a natural home for a Wikinews experiment, provided it is clearly grounded in learning and/or research.
:::-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:39, 15 May 2026 (UTC)
My understanding towards Wikinews' failure is that everything takes too long to be approved for the publish status, which means that any breaking news would have already become days-old stale news. Wikinews has a brand recognition (for right or wrong reasons) than Wikiversity and I wonder how effective Wikiversity can attract the &quot;Wikinews refugees&quot; to edit here. And just a quick note on the governance. Since each Wikiversity language operates independently, each language has to vote &amp; adopt this proposal independently. [[User:OhanaUnited|&lt;b&gt;&lt;span style=&quot;color: #0000FF;&quot;&gt;OhanaUnited&lt;/span&gt;&lt;/b&gt;]][[User talk:OhanaUnited|&lt;b&gt;&lt;span style=&quot;color: green;&quot;&gt;&lt;sup&gt;Talk page&lt;/sup&gt;&lt;/span&gt;&lt;/b&gt;]] 13:47, 15 May 2026 (UTC)

:Your assessment about Wikinews is partially correct. I referenced it earlier, but to be explicit, there is a [[:m:Proposal for Closing Wikinews|report by a task force on sister projects]] that outlines their concerns. There are a few, one of which was the nature of the staleness of news. Thanks also for clarifying that this proposal is only relevant to en.wv and is not binding or even proposed for other editions of Wikiversity. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:54, 15 May 2026 (UTC)

== Inactivity policy for Curators ==

I was wondering if there is a specific inactivity polity for curators (semi-admins) as I am pretty sure the global policy does not apply to them as they are not ''fully'' sysops. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 03:20, 15 February 2026 (UTC)

:Unfortunately, I don't see an inactivity policy, but if we were to create such a new policy for curators, it should be the same for custodians (administrators). [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 18:45, 15 February 2026 (UTC)
::@[[User:Codename Noreste|Codename Noreste]] There is currently none, that I could find, for custodians either. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:47, 17 February 2026 (UTC)
:::I think we should propose a local inactivity policy for custodians (and by extension, curators), which should be at least one year without any edits ''and'' logged actions. However, I don't know which page should it be when the inactivity removal procedure starts. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 00:53, 17 February 2026 (UTC)
::::@[[User:Codename Noreste|Codename Noreste]] In theory, there should be a section added at [[WV:Candidates for custodianship]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:55, 17 February 2026 (UTC)
::::: To be consistent with the [[meta:Admin activity review|global period of 2 years inactivity]] for en.wv  [[Wikiversity:Custodianship#Notes|Custodians]] and [[Wikiversity:Bureaucratship#How are bureaucrats removed?|Bureaucrats]] we could add something like this to [[Wikiversity:Curators]]:
::::::The maximum time period of inactivity &lt;u&gt;without community review&lt;/u&gt; for curators is two years (consistent with  the [[:meta:Category:Global policies|global policy]] described at [[meta:Admin activity review|Admin activity review]] which applies for [[Wikiversity:Custodianship#Notes|Custodians]] and [[Wikiversity:Bureaucratship|Bureaucrats]]). After that time a custodian will remove the rights.
::::: -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:51, 27 March 2026 (UTC)
:::::Yup, I agree with Jtneill, there is a policy proposal for Wikiversity:Curators, where it should be logically deployed. The question is if we are ready to aprove the policy. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:43, 17 April 2026 (UTC)
:::::: I agree, but we should notify the colloquium about inactive curators, just like a steward would do for inactive custodians and bureaucrats per [[:m:Admin activity review|AAR]]. What is the minimum timeframe an inactive curator should receive so they can respond they would keep their rights? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 17:49, 17 April 2026 (UTC)
:I incorporated these suggestions into the proposed curators policy. Please review/comment/improve. Summary: 2 years, notify curator's user page, then remove rights after 1 month: [[Wikiversity:Curators#Inactivity]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 08:59, 24 April 2026 (UTC)
:: @[[User:Jtneill|Jtneill]] I created [[Template:Inactive curator]] for this. Feel free to make any changes or improvements. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:29, 24 April 2026 (UTC)
:::Wondering, should we also have:
:::* {{tl|Inactive custodian}}
:::* {{tl|Inactive bureaucrat}}
:::or perhaps just a single template with a parameter(s) for the user right(s)/role(s)? e.g., 
:::* if a custodian is inactive for 2 years, then custodian and curator rights are to be removed and 
:::* if a bureaucrat is inactive for 2 years, then bureaucrat, custodian, and curator rights are to to be removed.
:::-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:58, 13 May 2026 (UTC)
:::: I would probably modify that template when we actually develop our own inactivity policy, because we're currently under the AAR (a steward notifies the colloquium with [[m:Admin activity review/Notice to communities]], and inactive advanced right holders with [[m:Admin activity review/Notice to inactive right holders]]). [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:16, 13 May 2026 (UTC)
:::::Ah, I see. Yes, that makes sense. Thankyou. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 04:21, 15 May 2026 (UTC)
: In that case, should we develop our own inactivity policy (e.g. on [[Wikiversity:Inactivity policy]] or [[Wikiversity:Support staff/Inactivity]])? I would list the general inactivity part, the process, etc. Once it's approved as a policy, I will [[m:Stewards' noticeboard|notify the stewards]]. Thoughts? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:30, 16 May 2026 (UTC)
::Originally, I would have thought that, for a small wiki like en.wv, it made sense to leave inactivity monitoring to the stewards. However, with the creation of the curator user group, we have already taken on local responsibility for monitoring inactivity in at least one advanced-rights group. Extending this to custodians and bureaucrats would not add much additional overhead and would provide a more consistent and transparent local administrative process.
::One option would be to develop a single, centralised policy covering all advanced-rights groups.
::An alternative would be to include an ==Inactivity== section on each relevant policy page (e.g., we already have [[Wikiversity:Curatorship#Inactivity]], but not yet in the custodianship, and bureaucratship policy pages). This approach would allow some flexibility because different user groups may warrant different criteria (such as inactivity thresholds, qualifying activity, or review procedures).
::A hybrid approach may be best: maintain separate inactivity sections within each user-group policy page, while transcluding these into a central overview page such as Codename Noreste suggests. This would preserve clarity at the local policy level while also providing a single reference point for consistency and oversight. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 23:09, 16 May 2026 (UTC)

== Inactive curators ==

Hello, even though [[Wikiversity:Curators]] is not a policy yet, there are curators listed here that have been inactive for two years or more:
* {{user|Cody naccarato}} (last edit on 13 Dec 2022, last logged action on 10 Dec 2022)
* {{user|Praxidicae}} (last edit on 10 Sep 2022, last logged action on 12 Sep 2022)
[[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 21:14, 19 April 2026 (UTC)

:Yup, I would remove the rights. To get the rights back if theyll come back should not be a big deal. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:08, 24 April 2026 (UTC)
:: When they don't reply by May 19, feel free (or any custodian) to do so. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 00:28, 25 April 2026 (UTC)

==Curator inactivity review==
These curators haven't been active for &gt; 2 years. As per the [[Wikiversity:Curatorship|curatorship policy]]:
* [[Special:Log/Cody naccarato]] was notified on their talk page by [[User:Codename Noreste|Codename Noreste]] on 24 Apr 2026
* [[Special:Log/Praxidicae]] was notified on their talk page by [[User:Codename Noreste|Codename Noreste]] on 24 Apr 2026
* [[Special:Log/Tegel]] was notified on their talk page by [[User:Jtneill|Jtneill]] notified their talk page on 16 May 2026

The policy allows a month to hear from these users. If no response, a custodian will remove their curator rights.

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 06:14, 16 May 2026 (UTC)
: For Cody naccarato and Praxidicae, their rights are to be removed by the 19th of May if they don't respond either here or on their talk page. For Tegel, the removal will happen on the 16th of June, probably. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:13, 16 May 2026 (UTC)
::Should be 24 May for Cody naccarato and Praxidicae? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 23:11, 16 May 2026 (UTC)
::: I made [[#Inactive curators]] on the 19th of April. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 03:18, 17 May 2026 (UTC)
::::OK, I see (had missed that thread, sorry - I've now moved the the 3 inactivity topics to be adjacent).
::::I'm thinking the curator policy indicates one month from user talk page notification? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 06:44, 17 May 2026 (UTC)</text>
      <sha1>1c2mg93midu8zg34ov9e2jsihbijsum</sha1>
    </revision>
  </page>
  <page>
    <title>Wikiversity:Requests for Deletion</title>
    <ns>4</ns>
    <id>1791</id>
    <revision>
      <id>2809877</id>
      <parentid>2808157</parentid>
      <timestamp>2026-05-17T08:12:32Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <comment>Pages by Harold Foppele</comment>
      <origin>2809877</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="55169" sha1="g2ynwxxy0nmcb67tkpjiiw94jbr6ya4" xml:space="preserve">{{/header}}
[[Category:Wikiversity deletion]]

__TOC__

== [[Korean/Words]] ==
(I go to RfD instead of ''proposed deletion'' since many pages are affected.)

I proposed to quasi-delete, i.e. '''move to userspace''' of the main (or sole?) creator, {{User|KYPark}}.

The page is organized a little bit like a dictionary. It makes it redundant to Wiktionary except that Wikiversity allows original research and there does seem to be original research there. Thus, its being organized as a dictionary would alone not necessarily be a problem.

Where I see a problem is in the organization and execution/implementation. Consider [[Korean/Words/가다]], which seems rather typical of the subpages (some subpages are like categories and transclude the pages for individual words):
* On the putative definition line, there is this: &quot;한곳에서 다른 곳으로 장소를 이동하다&quot;, apparently(?) in Korean. That does not seem to fit well into the ''English'' Wikiversity.
* There seems to be some original research into etymological relations between Korean and European languages in the &quot;Comparatives&quot; section (from what I recall, the English Wiktionary rejected this kind of content from KYPark). Admittedly, it is marked using &quot;This is a primary, secondary and/or original Eurasiatic research project at Wikiversity&quot;, so it could be tolerable, but even so, one has to wonder whether Wikiversity wants this kind of fringe science/research or outright pseudo-science.
** Fringe science: fringe physics has been moved to user space before. This would be fringe etymology. But then, original research is allowed.

Deletion is not required; moving to user space suffices, I think. Alternatively, one could at least rename the pages to make it clear from the title that this is not Wikiversity voice but rather KYPark voice, e.g. &quot;Korean/Words (KYPark)/...&quot; or  &quot;Korean/Words/KYPark/...&quot;  (recall the &quot;Fedosin&quot; pages featuring the name &quot;Fedosin&quot;).

Methodology: I see almost no methodological notes spanning the words at [[Korean/Words]]. And yet, if this is original research inventing new etymological connections, surely there should be some general considerations/analysis on how to proceed and how that manner of procedure differs from mainstream etymology?

Prefix index (max 200 items?):
{{Small START}}
{{Special:Prefixindex/Korean/Words}}
{{Small END}}

--[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 09:33, 24 September 2025 (UTC)

:I would keep it. If there is a course of Korean, why not to have a resesearch on Korean vocabulary? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 19:53, 16 October 2025 (UTC)
:: I propose to dismiss the above input: 1) it does not contain any argument, except for a question, and a question is not an argument (it can be so reinterpreted, but that includes additional burden on the interpreters, in interpreting it the wrong way); 2) it ignores all the issues I have raised, including that there is something like definition lines in Korean, in this ''English'' Wikiversity. To answer the question asked: there can be a research on Korean vocabulary in the mainspace, but not one showing the defects I identified above. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:35, 15 November 2025 (UTC)
:I've reviewed a sample of approximately 20 of the Korean/Words sub-pages and lean towards moving to user space because:
:* The pages appear to be an idiosynchratic collection of etymological pages about Korean language
:* There is minimal English instruction which is problematic for English Wikiversity
:* There is no explanation of research method
:* There is no educational rationale
:-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:31, 22 November 2025 (UTC)
:Well, since the original creator has indef I change my mind and I would '''delete''' it. The case is nobody knows how to continue with the research and if we move it to the userspace, the user cannot improve it eihter. What the original user can do to request admin, to send them a contentent to their email for example if they really want to improve the resource elsewhere. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:38, 11 March 2026 (UTC)

== [[Enhancing Web Browser Security through Cookie Encryption]] ==
To avoid further conflict with the user who entered this text into Wikiversity, I am opening a RFD request.

I am not sure about how to proceed, although I am inclined to move it out of mainspace = quasi-delete. I am looking forward to get input from others, especially curators and custodians. Some considerations:

1) There is perhaps no more appearance/suspicion of copyright violation, now that the ResearchGate (RG) article (of which this is a copy, perhaps an incomplete copy?) carries a license.

2) The article is not a complete replica from RG: at a minimum, it lacks images. The inserter could have continued editing the page in his user space before he uploads images, that is, before he finalizes the page for consumption, but that did not happen. I did not check whether the text is an exact one-to-one match; the article does not indicate anything in that regard.

3) The principle implied seems to be this: users should feel free to duplicate non-peer-reviewed articles from RG in English Wikiversity, perhaps to increase the Google search and LLM yield. I find this problematic, in part for the duplication. I would say: choose a venue and publish it there. If RG is not good enough for you as a publishing venue, choose Wikiversity instead, but not both?

4) There are some features that appear unduly promotional. There is a link to a dot com home page of the inserter of the article. I dot not know how we handle or should handle this, whether prohibit such a link, etc. This is perhaps not so much a call to quasi-deletion but a call to make it less promotional.

5) I cannot determine the value of such an article. It seems to be a pseudo-article describing someone's browser extension. Can someone do a better analysis?

--[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:48, 8 October 2025 (UTC)

:2) Images for Wikicommons are being created, it will take a lot of time. and the text is not an exact one-to-one match
:3) I also mentioned that It was being created so that it is more accessible from mobile phone, which is not possible in RG or in Zenodo
:Let me clarify the purpose of uploading it to different platforms
:Zenodo - registration and to link DOI
:RG - Self Archiving 
:Wikiversity - Accessible by anyone from any device. LLMs may get trained on Wikiversity data or use these data for indexing 
:5) The paper is a result of a research project which involved a browser extension which was built to test the theory.  [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 01:34, 9 October 2025 (UTC)
:: I find the practice here of publishing non-identical but similar text (&quot;the text is not an exact one-to-one match&quot;) with almost the same title to be problematic. I cannot imagine this is a recommended practice in academic publishing. At a minimum, somewhere near the top, the page should say something like the following: &quot;This text is based on article ___ published at ___ but is not identical. The author of the differences/changes is ___.&quot; Everything else leads to an undesirable confusion. In academic publishing, the title of an article serves as key part of identification of the artifact.
:: As I said before, I seen nothing particularly academic article-like about the page except for external/superficial signs. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:30, 9 October 2025 (UTC)
:::That Article has been published under CC BY SA 4.0
:::And I am one of the author of the article. That gives me right to modify text and publish it under a similar name. However, I will add the disclaimer text that you have suggested. I hope that helps.  [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 06:07, 9 October 2025 (UTC)
:::: It may give you that right from the ''copyright'' perspective, but perhaps not from ''academic publishing integrity'' perspective. Unfortunately, I do not have any guideline handy; I am merely following my common (or not so common) sense. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:32, 9 October 2025 (UTC)
:: I would like to ask: was this article guided by someone from an academic institution, such as a university? Is it reviewed at least in some weak sense? --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:39, 9 October 2025 (UTC)
:::Yes, This article has been reviewed by two academic professors, their names are also listed as co authors.
:::First, a project guide would help us with selecting a topic and with the document 
:::Second, an Internal examiner would go through our experiment and approve it
:::Finally, External Examiner would examine the documentation and verify it. 
:::We were required by these professors to put their name under contributions [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 05:48, 9 October 2025 (UTC)
:: Let me explicate the promotional potential of such a page a bit: one can go to the page of the article in Wikiversity --&gt; https://tomjoejames.com/ --&gt; HitMyTarget (a commercial, profit-making entity?) Why would the link be to a commercial web site rather than an academic page, or perhaps a LinkedIn account, which I think the person has? There could also be no link at all; a search for the name would turn out something in Google as well. But providing a direct link would drive users/viewers toward that website much stronger since otherwise the viewer of the page would have to open a new Google search window or the like. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:45, 9 October 2025 (UTC)
:::It is evident that the website is not even close to being complete. 
:::I will be creating a separate page under the same domain name specifically for people to contact me.
:::The url would probably be defined as tomjoejames.com/contact-me/
:::I haven't decided yet. But that is my personal website.
:::If the community requires me to remove it, I will. But personally I think people who are from here most likely to click the link to know more about me or to contact me. Either way I think my personal website serves the purpose. 
:::As for the HitMyTarget, it can be traced from any of my links. From my research gate profile, linkedin page or even my own userpage.
:::On the article I did not add any promotional content about myself, I hyperlinked only my own name. I do not know how that is promotional. [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 06:04, 9 October 2025 (UTC)
:::: I am pausing any further responses from me to see whether anyone else has any input. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:30, 9 October 2025 (UTC)
:What does it mean &quot;There is perhaps no more appearance/suspicion of copyright violation&quot;? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 19:57, 16 October 2025 (UTC)
:I have accepted VRT permission per [[ticket:2025100410001149]] FYI. [[User:Matrix|Matrix]] ([[User talk:Matrix|discuss]] • [[Special:Contributions/Matrix|contribs]]) 11:00, 28 October 2025 (UTC)
::Thank you Matrix [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 12:43, 28 October 2025 (UTC)
:I would '''delete''' it. 1) it states its a learning resource. It could not be a learning resource as not rewieved original research. 2) It is not an ongoing research, nor the research was performed on Wikiversity - wv is not a preprint or article database. Maybe it could be moved elsewhere withn Wikimedia domain, but I dont know where. So I would delete it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:56, 20 November 2025 (UTC)
::I would '''keep it.''' Like Dan had pointed out,  we do have article-like pages in Wikiversity, and this is not just a random pseudo science article but an article that is a report of an final year project, it has been reviewed by 3 professors whose name has been mentioned at the very beginning.   [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 14:50, 21 November 2025 (UTC)
:::I think it is not good to rate pages by appearance. It can be done on other Wikimedia projects, but it cannot be done on Wikiversity, because Wikiversity does not create a static format for presenting information, but is focused on the goal and process. Unfortunately, the goal and process do not have a uniform format. While a target article on Wikipedia or an entry on Wiktionary have some standard target format, Wikiversity does not. That is why I personally rate pages according to the goals and their assessment. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:05, 22 November 2025 (UTC)

Further reading for this nomination: [[S: Wikisource:Proposed_deletions/Archives/2025#Index:Cookie_Encryption.pdf]]; EncycloPetey handled the matter. Let me quote his wisdom on Zenodo (which I lack): &quot;This is tied to a PDF on Commons that was uploaded as &quot;own work&quot; with a CC license and a doi link to Zenodo, with no indication of where this paper was published or if it was published. Zenodo is not a publisher; it is a site for storing research and sharing papers. If Zenodo is the only place this was &quot;published&quot; then it was effectively self-published. --EncycloPetey (talk) 16:14, 15 September 2025 (UTC)&quot;

--[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 08:55, 9 October 2025 (UTC)

:Can you clarify what point are you trying to state? Didn't I already state that the article is published by me? 
:I first created the article in wikisource which I thought would be the perfect place, unfortunately they do not allow self published articles that are not notable. Then I discovered Wikiversity where they allow self published articles. That is why I created the article here. 
:Unlike in wikisource, I did follow guidelines.
:Ever since you deleted the first article, I spent time reading Wikiversity guidelines and I do think that I am following it perfectly.
:I would like to get your suggestions on how should I improve the page,  10 points would be sufficient. 
:Because your goals or intentions are confusing me very much. At first you told me that the article is exactly the same as the preprint in RG and therefore there is no use to it here. And then when I continued to optimize it for Wikiversity, you went ahead and said it is problematic according to recommended academic publishing. 
:Atleast just respond to the points that I have made whether you agree or disagree. So that I clarify and proceed to discuss points that are important and relevant 
:Have you published an research article? If yes, could you send it to me so that I can see the format you have done it [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 10:45, 9 October 2025 (UTC)
:: I am giving a chance/time to other curators/custodians to look at the matter and respond to my inputs. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 11:14, 9 October 2025 (UTC)
:: Incidentally, above I counted 4 questions (or more), 1 request (or more?) and 1 command (or more?). That is a behavior of a commanding entity. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 11:24, 9 October 2025 (UTC)

I would '''delete it''''. It's more like an academic communication than a learning resource or research.--[[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:32, 26 October 2025 (UTC)
:: In the above post, I do not see any valid rationale for deletion: we do have article-like pages, in Wikijournals and also e.g. in [[Physics/Essays/Fedosin/Stellar Stefan–Boltzmann constant]]. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 08:59, 3 November 2025 (UTC)
:::But I do, see above. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:56, 20 November 2025 (UTC)

:it is a '''student research paper''' forming part of a learning resource on web security and encryption.
:The project was conducted as part of a final-year university course and documented as a practical study on cookie encryption and it has been reviewed by three professors. However, I will be creating a sub page for the article to elaborately describe the experiment that we have conducted and the results we got.    [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 15:57, 26 October 2025 (UTC)
::And why should w host research papers? Wikiversity is not an academic Journal nor repository. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:06, 22 November 2025 (UTC)
:::I do not wish to go through this same argument once again, I've already answered to this question several times in Dan's talk page, Colloquium. you can refer them. I am not hosting the research paper here, I have already hosted the pdf in the ResearchGate, I have published a text version in the wikiversity so that it may be useful for others. Unless you can show me how that article is totally useless, I would like to '''keep''' the article in the wikiversity.    [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 10:13, 22 November 2025 (UTC)
::::And thats the point I am having. Wikiversity is not paper repository. The only way is to publish it via WikiJournal, but they want it for Wikipedia usually. Why wikiversity should be a duplication of ResearchGate, Academia or Zenodo?
::::What I can read on [[Wikiversity:What is Wikiversity?]] policy is, that Wikiversity research &quot;...includes interpreting primary sources, forming ideas, or taking observations.&quot; The article doent look to fall into this. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:43, 22 November 2025 (UTC)
:::::Well, then how come you missed the term &quot;Learning Projects&quot;? As Jtneill had pointed out, this is a legitimate learning project. And also, I do have the VRT permission to host this article on Wikiversity.  [[ticket:2025100410001149]] . besides ResearchGate is an self-archiving platform. the document version in it is not accessibly to screen readers (usually disable people use them), Translators, and also for the mobile readers. therefore I do have valid reasons to publish this article on wikiversity. 
:::::# It is a learning project, therefore according to WIkiversity Policy, It qualifies. 
:::::# I have an explicit VRT permission to host this article on Wikiversity
:::::# Versions that are published in RG, Zenodo are documents, and they are not accessible by screen readers or mobile users. Therefore it is imperative that an article version of this paper exist on here. 
:::::Therefore this article qualifies to stay here on Wikiversity.  [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 11:22, 22 November 2025 (UTC)

'''Keep'''. This is a legitimate student learning project that may be of use to others. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:51, 22 November 2025 (UTC)

== [[Pragmatics/History]] ==
Another KYPark page and subpages with unclear organization scheme. Contains fairly many redlinked items. See also [[User:KYPark/Literature]], perhaps a similar concept. Unlikely to be really useful for others but KYPark. '''Move to user space'''.

As an alternative, moving to [[History of Pragmatics (KYPark)]] would make sense to me: the topic is identified using a natural-language phrase (instead of the relatively unnatural slash) and the responsible editor is indicated so that the reader knows whether to look or not. And for those who oppose the brackets (which I like): [[History of Pragmatics/KYPark]]. Or also: [[KYPark/History of Pragmatics]]. But then, searches in mainspace will see that content and the question is whether that is good. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:21, 15 October 2025 (UTC)

:What about to propose the user to write some guidelines, how other can participate instead of deleting it? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:03, 16 October 2025 (UTC)
:: I plan to move the pages to userspace as I proposed. If someone wants to ask KYPark to address the problems, they should feel free. There will be plenty of time for KYPark to address the problems while the material is in user space. After the problems are addressed, the material can be moved back to mainspace. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:38, 15 November 2025 (UTC)
:So I would '''delete''' it. In the blocked user space its useless. The user cannot improve it and Wikiversity is not free hosting service for personal pages. My believe is, that there should be just a few working pages in the users spaces. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:30, 11 March 2026 (UTC)

'''Move'''. Insufficient statement of learning objective or connection to related learning resources with insufficient current activity to stay in main space. The page was originally [[History of pragmatics]] but was moved by Dave B. Therefore, I suggest moving to [[User:KYPark/History of pragmatics]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:57, 22 November 2025 (UTC)

== [[IMHA Research Archives]] ==
I propose to '''move to userspace''', including the subpages. I struggle to understand how Wikiversity readers are supposed to benefit from the material here and in the subpages. In the log, there is e.g. '10 February 2019 Marshallsumter discuss contribs deleted page IMHA Research Archives (content was: &quot;{&lt;nowiki/&gt;{Delete|Author request}} Thanks! -&quot;)', so the page was deleted before, but not the subpages.

We could also delete all the material if we have strong enough suspicion too much of it is copyright violation. In any case, moving to user space improves the matter a little by moving the content away from Google search. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 13:38, 9 November 2025 (UTC)

:Looking at some sub-pages, they can be deleted e.g., because they only consist of broken links or are largely empty. I deleted a couple but haven't been through all to check. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:27, 10 November 2025 (UTC)

As an example, let me give the wikitext content of [[IMHA Research Archives/3. Scientific litterature search, storage and use]]:
&lt;pre&gt;
==[[/Medicina Maritima - the Spanish scientific maritime health journal/]]==

==[[/PubMed/]]==

==[[/Google and Google Scholar/]]==

==[[/Zotero/]]==

==[https://www.dropbox.com/sh/d91z7bcyelfvk42/AAAkIvjtBnnFMbiU9ZLOdVL9a/Andrioti_database%20sources0310.pptx?dl=0 Maritime health web portal ressources ]==
&lt;/pre&gt;
The wikilinks are red; the external link to dropbox says &quot;You don't have access&quot;. This was made in 2016. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 09:04, 11 November 2025 (UTC)

:I suggest delete -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 03:27, 12 November 2025 (UTC)
:: I think we should avoid deletion as much as possible, instead moving to user space (bar copyvio, ethics violation, etc.). This is a good general principle. It greatly improves auditability and makes it so much easier for anyone to request undeletion since they know what content they are requesting for undeletion. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 09:52, 12 November 2025 (UTC)
:::Do not recreate Wikiversity from the educational and research project to the personal blog. That will lead to the cancelation of it by WMF. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:44, 20 November 2025 (UTC)
:::: The English Wikiversity has a long tradition of moving problematic content to user space, as per evidence collected at [[User:Dan_Polansky/About Wikiversity#Moving pages to userspace]]. If Wikimedia Foundation finds this problematic, they can start a discussion in Colloquium and state their concerns. They do not need to make explicit threats at first; they can start a discussion and explain why it is problematic. They can even do it from an anonymous IP and provide a well-articulated reasoning. And anyone else can start a discussion in Colloquium to change this tradition. I do not see why we should not want to change that tradition based on well-articulated, compelling reasoning. I see no reason why Juandev should be making threats instead of them, on a per RFD basis. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:58, 21 November 2025 (UTC)
:::: If Juandev is ''sincere'' about deleting very-low-value items ''from user space'', he should perhaps demonstrate that by asking his pages like [[:cs:Uživatel:Juandev/Problémy/Kov/Repase dvířek elektroskříně]] to be deleted; otherwise, I register a ''glaring inconsistence''. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 07:43, 21 November 2025 (UTC)
::What was the original delate page about @[[User:Jtneill|Jtneill]]? I guess that would be crucial for the decission. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:48, 20 November 2025 (UTC)
:::@[[User:Juandev|Juandev]] the couple of pages I checked and deleted were much like @[[User:Dan Polansky|Dan Polansky]] posted above i.e., headings with empty sections and/or broken links but no substantive content. But I think each sub-page needs checking. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 21:59, 20 November 2025 (UTC)
::::So I'm saying that the main page usually determines what the other pages are for. But if I don't know the page because it's been deleted, or why was deleted (deletion based on the founder's request is probably not the rule), it's hard to judge. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 22:16, 20 November 2025 (UTC)
:::::I've pasted the original content of the root page: [[IMHA Research Archives#Original page]] (i.e., prior to the content being removed and deletion requested) to help understand the context for the sub-pages. In 2018, Saltrabook blanked the page, indicating that the content had been moved elsewhere, and requested page deletion. Marshallsumter then deleted the main page but not the sub-pages. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 01:58, 21 November 2025 (UTC)
::::::I see, so if those subpages are usefull I would keept them, if not I would delete them. I dont see a point of providing free hosting to sombody, by moving many pages to their user space. The question is if we want to host (i.e. to have in the main ns) lists of links elsewhere. I have no opinion on that. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:11, 22 November 2025 (UTC)

: Let me clarify that while many of the subpages are like the example above, [[IMHA Research Archives/Scientific litterature search, storage and use/Zotero]] is different:
:: &quot;A continuous critical and evidence based learning is a core issue in clinical practice, research, teaching, publication and prevention activities. The Zotero Program is just one of many scientific literature management programs, that should be used for these purposes. Of course one can live without such a database but it helps a lot and can save a lot of time that could be used for more interesting issues. Not only that, but it helps to create better publications and knowledge. Without this program it can be very time consuming to publish a scientific article with the requested style for the references. Further in daily practice when you want to collect and cite a few references for a specific evidence in a clinical colloquium and discussion, this program is excellent. Therefore we strongly recommend that all maritime health persons learn how to use this excellent tool in their daily maritime health practice of all different types. There are good online courses for self-instruction on how to use Zotero. For example this one: Zotero fast online course But in order to increase IMHAR´s collective scientific strength in the use of EBM we would like to give training sessions in every possible opportunity, IMHA Symposia, seminars and other types of meetings. The database is useful for personal purposes but especially also for collaborative aims. At the IMHAR meeting in Paris Oct 7th 2016 we will give an introduction to the program by showing how it can be used in the daily practice and discuss strength and weaknesses compared to other similar databases.&quot;
: Even longer is e.g. [[IMHA Research Archives/Scientific litterature search, storage and use/Medicina Maritima - the Spanish scientific maritime health journal]].
: However, that does not mean these should be salvaged. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 07:53, 21 November 2025 (UTC)

== [[Palliative medicine]] ==

Underdeveloped and has not been improved on since 2007. Author inactive. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 21:42, 14 December 2025 (UTC)

:Delete, per nominator [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:16, 22 January 2026 (UTC)
:Yes, I would also expect there to be more and especially that someone would write how to use it. However, it still seems to me to be a useful thing in the sense of a syllabus, so that someone who is interested in the topic knows what information to obtain in order to get a complete picture of the topic. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:55, 16 March 2026 (UTC)

== [[Canadian Wilderness]] ==
This page doesn't seem to belong to wikiversity. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 09:55, 6 February 2026 (UTC)

:In principle there could be some material useful here but in practice, I don't see what this page is adding as an educational resource. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 12:54, 6 February 2026 (UTC)
:I can see this being a useful resource to a bigger project. Maybe we could move it to the &quot;[[Wikiversity:Drafts|Draft]]&quot; namespace vs. deleting it? —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 13:28, 6 February 2026 (UTC)
::Does anyone plan to work on it? [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 01:59, 8 February 2026 (UTC)
:::Next week the page has it's 17th birthday. Ever now and than someone added to it. With a lot of work it could be a nice encyclopedic article but making it educational .... Merging it may take more work than rewriting it. Move to Draft might be the best option. [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 08:58, 12 February 2026 (UTC)

== [[LQR Control for an Inverted Pendulum]] ==
Underdeveloped resource, has not been edited for more than a decade. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 08:03, 16 March 2026 (UTC)

:Looks like a test, '''delete'''. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:30, 27 March 2026 (UTC)

== False flag &quot;authority hack&quot; user page deletion ==
{{archive top|'''Not undeleted''', the requester dropped the request. See Wikiversity:Requests for Deletion v. 2803217.--[[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:36, 10 May 2026 (UTC)}}
'''Undeletion requested'''

Hi, Juandev marked my user page as &quot;spam&quot; and &quot;authority hack&quot;, and deleted it. 

First, I asked him for help with &quot;time limit for new users&quot;, and he replied - I should admit I dont know, what is &quot;new user limit&quot;, but if filter blocks your page because of certain external link, you may force to save anyway and sometimes it works. It should not work, when the website is blacklisted. As of now, I am not seeing you to save page in main namespace, so try to save it without external links first. 

Then he wrote me another message: Well, I have analyzed your contribution to Wikiversity and I should point out here, that this project is not a place for advertising, so there is no way of promoting your books and authority this way. - probably referring to the intro of my About me page where I present me and my work. 

Before I could explain him the difference between the neutral information and advertising and promotion, he deleted my user page. 

Here is my answer I posted to the discussion today: 

: Hi, my About Me page is just an info page with the neutral as possible presentation of my work.
:
: There is a big difference between informing and advertising. Informing is neutrally stating that something exists and requiring no action, while advertising is a special communication form with intent to cause certain action from readers. For example, click here, click there, order this, buy that.
:
: There is no such intention, form, or terms on my info page. Just neutral information. I don't hide and I am not ashamed that I am write and author, and that is a part of the usual bio, including works. I checked your user page: &quot;I graduated from the Czech University of Life Sciences in Prague and studied information science at the Faculty of Arts of Charles University.&quot; I think that if you had written a book on Life Science, you would have mentioned that as well.
:
: Most of the Info page is about my research and AIPA Method which is a valid contribution to psychology, consciousness studies, identity theory, and personality development. Actually, my paper '''AIPA Method: A Cognitive-Phenomenological Model for Identity Reconstruction and Stabilization in Pure Awareness''' is now in the peer review procedure at Journal of Consciousness Studies.
:
: Here is a part from the Wikiversity AIPA Method page in creation (waiting for the end of the time limit for new users):

: == Introduction ==
: The AIPA Method addresses a gap in contemporary personal development and consciousness science: most evidence‑based approaches (CBT, MBSR, MBCT, standard meditation) operate at the level of mental content—reframing thoughts, observing them, or reducing their impact—rather than at the level of identity structure. In contrast, AIPA targets the structural relationship between the self and the mind, aiming at durable identity reconstruction rooted in Pure Awareness rather than symptom management.
:
: The central research question of the primary AIPA preprint is whether a structured, sequentially staged method can produce permanent identity reconstruction rooted in Pure Awareness, and how such a method compares to established approaches in scope, mechanism, and outcome.
:
: == Theoretical foundations ==
: The AIPA framework is grounded in the cognitive‑phenomenological tradition (e.g., McAdams, Varela, Metzinger, Erikson), contemporary consciousness science on minimal phenomenal experience, and qualitative methods advocacy in psychology. It builds directly on:
:* Empirical work on pure awareness and Minimal Phenomenal Experience (MPE), especially Gamma &amp; Metzinger’s large‑scale study of content‑reduced awareness states.
:* Metzinger’s proposal of minimal phenomenal experience as an entry point for a minimal unifying model of consciousness.
:* Narrative identity and partial‑self models within personality and identity theory.
: Within this backdrop, AIPA proposes Pure Awareness as a distinct, operationally specified state that can become a structural ground of identity rather than a transient meditative experience.
:
: == Experiential empiricism ==
: The empirical foundation of the AIPA Method is explicitly first‑person and experiential, combining:
:* A 22‑year longitudinal autoethnographic self‑study (2003–2025) documenting partial personality episodes, protocol use, and outcomes.
:* A 13‑year prospective verification period with zero self‑reported recurrence of targeted harmful behaviors after a dated stabilization point (1 January 2006).
:* A high‑ecological‑validity “stress test” during acute bereavement, used to examine whether non‑reactive awareness remains stable under maximal provocation.
:* Two independent practitioner cases (an Amazon‑verified report and a structured questionnaire case) providing preliminary convergent signals across cognitive, emotional, behavioral, and identity dimensions.
:
: All central constructs (Pure Awareness, partial personalities, the Switch, identity stabilization) are operationalized with explicit phenomenological and behavioral criteria intended to enable replication and future third‑person measurement.
:
: I believe this is a valid contribution to Wikiversity.
:
: Best regards, Senad [[User:Senad Dizdarević|Senad Dizdarević]]


I suggest you check the deleted user page, and see for yourself if it is &quot;spam&quot; and &quot;authority hack&quot;, or a legit author's page with one paragraph short presentation, while the rest of the page is about my research project. 

Thank you for undeleting my user page, so I can use it. 

Best regards, 

Senad Dizdarević [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:26, 2 April 2026 (UTC)

:Hi Senad,
:Welcome to Wikiversity.
:It looks like you tried adding similar content to Wikipedia and ran into similar difficulties over there ([[w:User talk:Senad Dizdarević]])? Perhaps that is what has led to you Wikiversity?
:Basically, if you'd like to collaborate and help build open educational resources, feel free to contribute to Wikiversity. But if the primary motivation is to promote your autobiographical work you're probably going to run into challenges.
:Sincerely,
:James
:-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:11, 3 April 2026 (UTC)
::James, Hi, and thank you for your answer. 
::Yes, in 2025, I created the autobiographic page on Wikipedia, which was removed because of the links to my books on Amazon. To admin, I explained that I did not know the rules, and agreed that page is removed. Now I know that somebody else must write a Wikipedia page for you. 
::On the deleted user page on Wikiversity, there were no links to Amazon or any other form of promotion, just neutral as possible basic presentation of my writing (one sentence) and current project (the rest of the page). 
::I created Wikiversity page to present my AIPA Method project, to invite researchers to read it, give their opinion, and conduct empirical researches in their institutions. Now, it is in a theoretical phase, and needs more empirical testing. 
::Best regards, 
::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:03, 3 April 2026 (UTC)
:::It looks to me like the primary motivation for contributing to Wikiversity is to drive traffic / search engine ranking to your website?
:::* [[User:Senad Dizdarević]]
:::* [[AIPA Method]]
:::-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 01:36, 4 April 2026 (UTC)
::::No, it is not. There is no link to my website, so &quot;driving traffic to my website&quot; is not possible. 
::::For your educational purposes: 
::::Copilot &quot;AI:  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:38, 4 April 2026 (UTC)
:::::So do you still insist of undeleting your former version of your userpage if you have created the new one? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:15, 6 April 2026 (UTC)
::::::No, because in the moment of undeletition, somebody could delete it again, and so on. Thank you for not deleting my new user page, as it is made in your user page image.  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 08:59, 6 April 2026 (UTC)

{{archive bottom}}

== Undeletion request ==

It was deleted by an admin without discussion and with untrue rationale. If people take offense with the question that doesn't mean it's not a valid question and the page was good. Please undelete the Wikidebate page [https://web.archive.org/web/20250810030352/https://en.wikiversity.org/wiki/Is_it_likely_that_Earth_has_been_visited_by_aliens_millions_of_years_ago%3F Is it likely that Earth has been visited by aliens millions of years ago?]

There are lots of sources on the subject, the wikidebate is sourced very well compared to other wikidebates and wikiversity pages, and the page is educational, useful and of good quality. [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 23:57, 10 April 2026 (UTC)

:Page: [[Is it likely that Earth has been visited by aliens millions of years ago?]]
:Ping: [[User:Atcovi|Atcovi]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:21, 11 April 2026 (UTC)
:There is no need for a discussion for straight garbage-level, pseudoscientific content.
:For '''Is it likely that Earth has been visited by aliens millions of years ago?''', the flaws for this page wouldn't even take someone more than a few minutes to assess:
:* Essentially, the &quot;pro&quot; arguments unproven claims being derived from irrelevant, established facts (basically: &quot;it is likely aliens have came because Earth has existed for so long [sources proving Earth's longevity]&quot;). These are not serious, scientifically-backed arguments - these are non sequiturs. It's as if I said Wikipedia has existed longer than my existence on Earth ([https://d1wqtxts1xzle7.cloudfront.net/74351725/eyJoIjogImZiODhmYzNkODU1N2UxMWExYzUyODJiYzgzZTRmZDM4OTBjODY5YWMzMjA3NDNmOWEyZTA0ZTU3ZGYwZjAyYTkiLCAidSI6ICJodHRwczovL3B1cmUuaHZhLm5sL3dz-libre.pdf?1636354596=&amp;response-content-disposition=inline%3B+filename%3DCritical_Point_of_View_A_Wikipedia_Reade.pdf&amp;Expires=1775872055&amp;Signature=GqbUZboYRvUYWi~aW40LT5eZSHrLuDL3o0-DxAH8vSvcJcGAuyByZWLF2oHTY6GlB72TqvZxpE-v9d4gvsA6myriYqO~QQQZgWxjT2JXjUWC-yiPcTF4l~lroJSi4dY0v9eKiBcU03l-aeUdrX8~UPfi0TfW0IhsmzH-VBR6X6FrzRpIqc6uM6n9YXfr5FRB3aCqqokU690af3n0Hguaub1Zgmh9qjYYqzBS0VOOHjKTTEQnDuadX3jl5CQeXYTaeCC3H0hMeVwHlratbrnuFEKC1aN0-5znCUoSzMEg21ECzGPTrSDM1W05dcK-u0ZTCeUGKAuC-2yRFL3sY46MIw__&amp;Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA#page=157 reputable source proving ''this'' fact]), therefore it's likely that my birth took place solely for the sake of me experiencing Wikipedia (0 backing). It makes no sense and no person with at least a high school-level of intelligence would take this seriously. 
:* What is worse is that the user is being misleading with their &quot;[the page is] sourced very well&quot; claim. The sources ''themselves'' don't even back up the claims. It's just used as proof for an established concept, where the user then uses this established concept to jump to an unsupported, laughable conclusion that is pulled out of thin air. It's utterly ridiculous to even consider such a page for mainspace since it clearly violates our [[Wikiversity:Verifiability]] policy. This is, once again, pseudoscientific content that has caused our website to reduce in quality over the last few years. 
:* Going source by source, we can see that:
:#[https://web.archive.org/web/20250918011642/https://timesofindia.indiatimes.com/blogs/thebigd/compress-earths-history-into-24-hrs-humans-came-at-1158-pm-yet-killed-70-of-wildlife/ ‘Compress Earth’s history into 24 hrs. Humans came at 11:58 pm, yet killed 70% of wildlife’] is literally just a blog post which doesn't even mention aliens or extraterrestrial life. It just talks about Earth's history in accordance with the 24-hour metric of time, and the author tries to use this article as a 'piece in the puzzle' of aliens &quot;possibly&quot; visiting Earth... which, once again, is unsupported and is not backed up anywhere in the article.
:#[https://web.archive.org/web/20250808053249/https://news.cornell.edu/stories/2023/11/jurassic-worlds-might-be-easier-spot-modern-earth The Cornell article does not even remotely support the idea that &quot;aliens visited Earth&quot;]. It mentions a ''chance'' of &quot;life there [a habitable exoplanet] might not be limited to microbes, but could include creatures as large and varied as the megalosauruses or microraptors that once roamed Earth.&quot;, but again, no justification to take this article as proof that &quot;aliens may have visited us!&quot;. There's no mention of aliens visiting Earth anywhere in the article. Once again this is only proving the background premise, but not the unsupported, nonsensical &quot;alien likelihood&quot; argument that the author of this garbage page is trying to push so desperately.
:#The Parker Solar Probe WP article does not even mention aliens either. It follows the same issues as the previous argument.
:And the other page this user complained about [https://en.wikiversity.org/wiki/User_talk:Atcovi#Deletion_of_educational_page_because_of_personal_opinion on my talk page] holds almost similar, maybe even more fatal mistakes, than this one. It has nothing to do with &quot;taking offense&quot;, this is just low-quality, garbage content. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 00:56, 11 April 2026 (UTC)
::Why do you think pro claims are required to be proven? It's possible to object to them and these are arguments, not contextualized to be statements of proven facts. And it's not a strange or unreasonable argument to make that since Earth has existed for long, it's more likely that aliens have come here in the past than in recent times or the near future. Instead of insulting others' intelligence, maybe engage with the actual reasoning rather than censoring it away. And there are lots of sources, such as [https://interestingengineering.com/science/alien-civilizations-may-have-visited-earth-millions-of-years-ago-study-says Alien Civilizations May Have Visited Earth Millions of Years Ago, Study Says] etc etc. The sources are used for the arguments themselves individually. [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 12:30, 11 April 2026 (UTC)
:::Because, once again, this is not a site that caters to rampant debating for the sake of &quot;we need to employ rationality and logic to solve the world's problems&quot;, we have policies that we need to fulfill. The claims made in the pro argument clearly do not meet [[Wikiversity:Verifiability]], since you cannot verify these arguments with the sources because they are not relevant. 
:::''&quot;And it's not a strange or unreasonable argument to make that since Earth has existed for long, it's more likely that aliens have come here in the past than in recent times or the near future.&quot;'' The point being is that these arguments are not supported by the sources. Even the article you mention poses the idea as a hypothetical model. This is just you twisting the article to fit your unsupported narrative. I'll bring direct quotes for you to show why the linked article does not help you:
:::* ''One problem the researchers do make sure to point out is that '''they are working with only one data point: our own behaviors and capabilities for space exploration'''. “We tried to come up with a model that would involve the fewest assumptions about sociology that we could,” Carroll-Nellenback told Business Insider. '''We have no real way of knowing the motivations of an alien civilization'''.'' --&gt; proves that this is just speculation and no evidence-based arguments have been provided for the idea that aliens likely visited Earth.
:::And I'm not sure if you read my entire response, but I ''did'' engage with your &quot;actual reasoning&quot; and exposed its weaknesses and lack of adherence to Wikiversity policies. If we allowed content that was just filled with non sequiturs we would have content that fails Wikiversity's educational objectives and reduces the overall quality of this website, hence why such a harsh stance needs to be taken. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 13:50, 11 April 2026 (UTC)
::::Thanks for proving that the Wikimedia ecosystem is unfit to deliberate on controversial topics. The question is entirely valid and the content is far better sourced than nearly all Wikidebates and has no genuine flaws. The only possible issue with it as far as I can see is that now that Wikidebates has been paused people can't add objections if they do have sth specific to say about the topic that's not already included on that page which already had plenty of Cons and objections.
::::The page was more educational than most of Wikiversity and it was well-sourced – wikidebates was for arguments so people were invited to make arguments based on sourced things or outlined logic and the page met [[WV:V]] and most pages on Wikiversity aren't sourced as good. Doesn't look like people can see beyond their biases and personal views here but that's more evident in the marginalization and deletion of wikidebates and the low activity in that project than these selective deletions. A constructive thing to do would be to add reasoned Cons and objections not yet on the page and people had plenty of time to do that. There are and will be other sites for free constructive rational adversarial deliberation (not a big loss in that sense). [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 16:31, 22 April 2026 (UTC)
:::::Thank you for failing to address any of my arguments and going on an unrelated, nonsensical tangent that has nothing to do with the discussion. Once you start producing work that aligns with Wikiversity's content policies instead of typing up laughable, pseudoscientific garbage, then maybe your work can be accepted and not removed. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 16:59, 22 April 2026 (UTC)
::::::I suggest you stop ridiculing things and learn respectfully forming genuine points about the subject at hand. {{tq|the idea as a hypothetical model}} but please learn first about what arguments are and why they're not the same as a statement of objective proven fact. [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 17:18, 22 April 2026 (UTC)

==Pages by Harold Foppele==
[[User:Harold Foppele]] is locally blocked indefinitely and globally banned for sockpuppetry. There were also WMF and local community concerns expressed about copyright violation and AI (over)use. As a result, I think the Wikiversity pages created by this account warrant review with regard what should be deleted, what should be retained etc.:
* [[Completing the square]]
* [[Number of independent spatial modes in a spherical volume]]
* [[Quantum]]
** [[Quantum/Andrew N. Jordan]]
* [[Quantum A Matter Of Size]]
* [[Quantum A Spooky Action at a Distance]]
* [[Quantum: A Walk Through the Universe]]
* [[Quantum Computing Algorithms in the NISQ Era]]
* [[Quantum Formulas Collection]]
* [[Quantum harmonic oscillator]]
* [[Quantum Matter Elements and Particles]]
* [[Quantum mechanics]]
** [[Quantum mechanics/Timeline]]
* [[Quantum mechanics learning module]]
* [[Quantum mechanics measurements]]
* [[Quantum Noisy Qubits]]
* [[Quantum optics beam splitter experiments]]
* [[Quantum: The Secret of Cohesion: How Waves Hold Matter Together]]
* [[Quantum Ultra fast lasers]]
* [[Speed of sound experiments]]
* [[User:Harold Foppele]]
-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 08:12, 17 May 2026 (UTC)</text>
      <sha1>g2ynwxxy0nmcb67tkpjiiw94jbr6ya4</sha1>
    </revision>
    <revision>
      <id>2809878</id>
      <parentid>2809877</parentid>
      <timestamp>2026-05-17T08:27:36Z</timestamp>
      <contributor>
        <username>Koavf</username>
        <id>147</id>
      </contributor>
      <comment>/* Pages by Harold Foppele */ Reply</comment>
      <origin>2809878</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="55462" sha1="2h53dygaazyigrsb6gyd2u3hsshhpxe" xml:space="preserve">{{/header}}
[[Category:Wikiversity deletion]]

__TOC__

== [[Korean/Words]] ==
(I go to RfD instead of ''proposed deletion'' since many pages are affected.)

I proposed to quasi-delete, i.e. '''move to userspace''' of the main (or sole?) creator, {{User|KYPark}}.

The page is organized a little bit like a dictionary. It makes it redundant to Wiktionary except that Wikiversity allows original research and there does seem to be original research there. Thus, its being organized as a dictionary would alone not necessarily be a problem.

Where I see a problem is in the organization and execution/implementation. Consider [[Korean/Words/가다]], which seems rather typical of the subpages (some subpages are like categories and transclude the pages for individual words):
* On the putative definition line, there is this: &quot;한곳에서 다른 곳으로 장소를 이동하다&quot;, apparently(?) in Korean. That does not seem to fit well into the ''English'' Wikiversity.
* There seems to be some original research into etymological relations between Korean and European languages in the &quot;Comparatives&quot; section (from what I recall, the English Wiktionary rejected this kind of content from KYPark). Admittedly, it is marked using &quot;This is a primary, secondary and/or original Eurasiatic research project at Wikiversity&quot;, so it could be tolerable, but even so, one has to wonder whether Wikiversity wants this kind of fringe science/research or outright pseudo-science.
** Fringe science: fringe physics has been moved to user space before. This would be fringe etymology. But then, original research is allowed.

Deletion is not required; moving to user space suffices, I think. Alternatively, one could at least rename the pages to make it clear from the title that this is not Wikiversity voice but rather KYPark voice, e.g. &quot;Korean/Words (KYPark)/...&quot; or  &quot;Korean/Words/KYPark/...&quot;  (recall the &quot;Fedosin&quot; pages featuring the name &quot;Fedosin&quot;).

Methodology: I see almost no methodological notes spanning the words at [[Korean/Words]]. And yet, if this is original research inventing new etymological connections, surely there should be some general considerations/analysis on how to proceed and how that manner of procedure differs from mainstream etymology?

Prefix index (max 200 items?):
{{Small START}}
{{Special:Prefixindex/Korean/Words}}
{{Small END}}

--[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 09:33, 24 September 2025 (UTC)

:I would keep it. If there is a course of Korean, why not to have a resesearch on Korean vocabulary? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 19:53, 16 October 2025 (UTC)
:: I propose to dismiss the above input: 1) it does not contain any argument, except for a question, and a question is not an argument (it can be so reinterpreted, but that includes additional burden on the interpreters, in interpreting it the wrong way); 2) it ignores all the issues I have raised, including that there is something like definition lines in Korean, in this ''English'' Wikiversity. To answer the question asked: there can be a research on Korean vocabulary in the mainspace, but not one showing the defects I identified above. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:35, 15 November 2025 (UTC)
:I've reviewed a sample of approximately 20 of the Korean/Words sub-pages and lean towards moving to user space because:
:* The pages appear to be an idiosynchratic collection of etymological pages about Korean language
:* There is minimal English instruction which is problematic for English Wikiversity
:* There is no explanation of research method
:* There is no educational rationale
:-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:31, 22 November 2025 (UTC)
:Well, since the original creator has indef I change my mind and I would '''delete''' it. The case is nobody knows how to continue with the research and if we move it to the userspace, the user cannot improve it eihter. What the original user can do to request admin, to send them a contentent to their email for example if they really want to improve the resource elsewhere. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:38, 11 March 2026 (UTC)

== [[Enhancing Web Browser Security through Cookie Encryption]] ==
To avoid further conflict with the user who entered this text into Wikiversity, I am opening a RFD request.

I am not sure about how to proceed, although I am inclined to move it out of mainspace = quasi-delete. I am looking forward to get input from others, especially curators and custodians. Some considerations:

1) There is perhaps no more appearance/suspicion of copyright violation, now that the ResearchGate (RG) article (of which this is a copy, perhaps an incomplete copy?) carries a license.

2) The article is not a complete replica from RG: at a minimum, it lacks images. The inserter could have continued editing the page in his user space before he uploads images, that is, before he finalizes the page for consumption, but that did not happen. I did not check whether the text is an exact one-to-one match; the article does not indicate anything in that regard.

3) The principle implied seems to be this: users should feel free to duplicate non-peer-reviewed articles from RG in English Wikiversity, perhaps to increase the Google search and LLM yield. I find this problematic, in part for the duplication. I would say: choose a venue and publish it there. If RG is not good enough for you as a publishing venue, choose Wikiversity instead, but not both?

4) There are some features that appear unduly promotional. There is a link to a dot com home page of the inserter of the article. I dot not know how we handle or should handle this, whether prohibit such a link, etc. This is perhaps not so much a call to quasi-deletion but a call to make it less promotional.

5) I cannot determine the value of such an article. It seems to be a pseudo-article describing someone's browser extension. Can someone do a better analysis?

--[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:48, 8 October 2025 (UTC)

:2) Images for Wikicommons are being created, it will take a lot of time. and the text is not an exact one-to-one match
:3) I also mentioned that It was being created so that it is more accessible from mobile phone, which is not possible in RG or in Zenodo
:Let me clarify the purpose of uploading it to different platforms
:Zenodo - registration and to link DOI
:RG - Self Archiving 
:Wikiversity - Accessible by anyone from any device. LLMs may get trained on Wikiversity data or use these data for indexing 
:5) The paper is a result of a research project which involved a browser extension which was built to test the theory.  [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 01:34, 9 October 2025 (UTC)
:: I find the practice here of publishing non-identical but similar text (&quot;the text is not an exact one-to-one match&quot;) with almost the same title to be problematic. I cannot imagine this is a recommended practice in academic publishing. At a minimum, somewhere near the top, the page should say something like the following: &quot;This text is based on article ___ published at ___ but is not identical. The author of the differences/changes is ___.&quot; Everything else leads to an undesirable confusion. In academic publishing, the title of an article serves as key part of identification of the artifact.
:: As I said before, I seen nothing particularly academic article-like about the page except for external/superficial signs. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:30, 9 October 2025 (UTC)
:::That Article has been published under CC BY SA 4.0
:::And I am one of the author of the article. That gives me right to modify text and publish it under a similar name. However, I will add the disclaimer text that you have suggested. I hope that helps.  [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 06:07, 9 October 2025 (UTC)
:::: It may give you that right from the ''copyright'' perspective, but perhaps not from ''academic publishing integrity'' perspective. Unfortunately, I do not have any guideline handy; I am merely following my common (or not so common) sense. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:32, 9 October 2025 (UTC)
:: I would like to ask: was this article guided by someone from an academic institution, such as a university? Is it reviewed at least in some weak sense? --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:39, 9 October 2025 (UTC)
:::Yes, This article has been reviewed by two academic professors, their names are also listed as co authors.
:::First, a project guide would help us with selecting a topic and with the document 
:::Second, an Internal examiner would go through our experiment and approve it
:::Finally, External Examiner would examine the documentation and verify it. 
:::We were required by these professors to put their name under contributions [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 05:48, 9 October 2025 (UTC)
:: Let me explicate the promotional potential of such a page a bit: one can go to the page of the article in Wikiversity --&gt; https://tomjoejames.com/ --&gt; HitMyTarget (a commercial, profit-making entity?) Why would the link be to a commercial web site rather than an academic page, or perhaps a LinkedIn account, which I think the person has? There could also be no link at all; a search for the name would turn out something in Google as well. But providing a direct link would drive users/viewers toward that website much stronger since otherwise the viewer of the page would have to open a new Google search window or the like. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:45, 9 October 2025 (UTC)
:::It is evident that the website is not even close to being complete. 
:::I will be creating a separate page under the same domain name specifically for people to contact me.
:::The url would probably be defined as tomjoejames.com/contact-me/
:::I haven't decided yet. But that is my personal website.
:::If the community requires me to remove it, I will. But personally I think people who are from here most likely to click the link to know more about me or to contact me. Either way I think my personal website serves the purpose. 
:::As for the HitMyTarget, it can be traced from any of my links. From my research gate profile, linkedin page or even my own userpage.
:::On the article I did not add any promotional content about myself, I hyperlinked only my own name. I do not know how that is promotional. [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 06:04, 9 October 2025 (UTC)
:::: I am pausing any further responses from me to see whether anyone else has any input. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:30, 9 October 2025 (UTC)
:What does it mean &quot;There is perhaps no more appearance/suspicion of copyright violation&quot;? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 19:57, 16 October 2025 (UTC)
:I have accepted VRT permission per [[ticket:2025100410001149]] FYI. [[User:Matrix|Matrix]] ([[User talk:Matrix|discuss]] • [[Special:Contributions/Matrix|contribs]]) 11:00, 28 October 2025 (UTC)
::Thank you Matrix [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 12:43, 28 October 2025 (UTC)
:I would '''delete''' it. 1) it states its a learning resource. It could not be a learning resource as not rewieved original research. 2) It is not an ongoing research, nor the research was performed on Wikiversity - wv is not a preprint or article database. Maybe it could be moved elsewhere withn Wikimedia domain, but I dont know where. So I would delete it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:56, 20 November 2025 (UTC)
::I would '''keep it.''' Like Dan had pointed out,  we do have article-like pages in Wikiversity, and this is not just a random pseudo science article but an article that is a report of an final year project, it has been reviewed by 3 professors whose name has been mentioned at the very beginning.   [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 14:50, 21 November 2025 (UTC)
:::I think it is not good to rate pages by appearance. It can be done on other Wikimedia projects, but it cannot be done on Wikiversity, because Wikiversity does not create a static format for presenting information, but is focused on the goal and process. Unfortunately, the goal and process do not have a uniform format. While a target article on Wikipedia or an entry on Wiktionary have some standard target format, Wikiversity does not. That is why I personally rate pages according to the goals and their assessment. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:05, 22 November 2025 (UTC)

Further reading for this nomination: [[S: Wikisource:Proposed_deletions/Archives/2025#Index:Cookie_Encryption.pdf]]; EncycloPetey handled the matter. Let me quote his wisdom on Zenodo (which I lack): &quot;This is tied to a PDF on Commons that was uploaded as &quot;own work&quot; with a CC license and a doi link to Zenodo, with no indication of where this paper was published or if it was published. Zenodo is not a publisher; it is a site for storing research and sharing papers. If Zenodo is the only place this was &quot;published&quot; then it was effectively self-published. --EncycloPetey (talk) 16:14, 15 September 2025 (UTC)&quot;

--[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 08:55, 9 October 2025 (UTC)

:Can you clarify what point are you trying to state? Didn't I already state that the article is published by me? 
:I first created the article in wikisource which I thought would be the perfect place, unfortunately they do not allow self published articles that are not notable. Then I discovered Wikiversity where they allow self published articles. That is why I created the article here. 
:Unlike in wikisource, I did follow guidelines.
:Ever since you deleted the first article, I spent time reading Wikiversity guidelines and I do think that I am following it perfectly.
:I would like to get your suggestions on how should I improve the page,  10 points would be sufficient. 
:Because your goals or intentions are confusing me very much. At first you told me that the article is exactly the same as the preprint in RG and therefore there is no use to it here. And then when I continued to optimize it for Wikiversity, you went ahead and said it is problematic according to recommended academic publishing. 
:Atleast just respond to the points that I have made whether you agree or disagree. So that I clarify and proceed to discuss points that are important and relevant 
:Have you published an research article? If yes, could you send it to me so that I can see the format you have done it [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 10:45, 9 October 2025 (UTC)
:: I am giving a chance/time to other curators/custodians to look at the matter and respond to my inputs. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 11:14, 9 October 2025 (UTC)
:: Incidentally, above I counted 4 questions (or more), 1 request (or more?) and 1 command (or more?). That is a behavior of a commanding entity. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 11:24, 9 October 2025 (UTC)

I would '''delete it''''. It's more like an academic communication than a learning resource or research.--[[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:32, 26 October 2025 (UTC)
:: In the above post, I do not see any valid rationale for deletion: we do have article-like pages, in Wikijournals and also e.g. in [[Physics/Essays/Fedosin/Stellar Stefan–Boltzmann constant]]. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 08:59, 3 November 2025 (UTC)
:::But I do, see above. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:56, 20 November 2025 (UTC)

:it is a '''student research paper''' forming part of a learning resource on web security and encryption.
:The project was conducted as part of a final-year university course and documented as a practical study on cookie encryption and it has been reviewed by three professors. However, I will be creating a sub page for the article to elaborately describe the experiment that we have conducted and the results we got.    [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 15:57, 26 October 2025 (UTC)
::And why should w host research papers? Wikiversity is not an academic Journal nor repository. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:06, 22 November 2025 (UTC)
:::I do not wish to go through this same argument once again, I've already answered to this question several times in Dan's talk page, Colloquium. you can refer them. I am not hosting the research paper here, I have already hosted the pdf in the ResearchGate, I have published a text version in the wikiversity so that it may be useful for others. Unless you can show me how that article is totally useless, I would like to '''keep''' the article in the wikiversity.    [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 10:13, 22 November 2025 (UTC)
::::And thats the point I am having. Wikiversity is not paper repository. The only way is to publish it via WikiJournal, but they want it for Wikipedia usually. Why wikiversity should be a duplication of ResearchGate, Academia or Zenodo?
::::What I can read on [[Wikiversity:What is Wikiversity?]] policy is, that Wikiversity research &quot;...includes interpreting primary sources, forming ideas, or taking observations.&quot; The article doent look to fall into this. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:43, 22 November 2025 (UTC)
:::::Well, then how come you missed the term &quot;Learning Projects&quot;? As Jtneill had pointed out, this is a legitimate learning project. And also, I do have the VRT permission to host this article on Wikiversity.  [[ticket:2025100410001149]] . besides ResearchGate is an self-archiving platform. the document version in it is not accessibly to screen readers (usually disable people use them), Translators, and also for the mobile readers. therefore I do have valid reasons to publish this article on wikiversity. 
:::::# It is a learning project, therefore according to WIkiversity Policy, It qualifies. 
:::::# I have an explicit VRT permission to host this article on Wikiversity
:::::# Versions that are published in RG, Zenodo are documents, and they are not accessible by screen readers or mobile users. Therefore it is imperative that an article version of this paper exist on here. 
:::::Therefore this article qualifies to stay here on Wikiversity.  [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 11:22, 22 November 2025 (UTC)

'''Keep'''. This is a legitimate student learning project that may be of use to others. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:51, 22 November 2025 (UTC)

== [[Pragmatics/History]] ==
Another KYPark page and subpages with unclear organization scheme. Contains fairly many redlinked items. See also [[User:KYPark/Literature]], perhaps a similar concept. Unlikely to be really useful for others but KYPark. '''Move to user space'''.

As an alternative, moving to [[History of Pragmatics (KYPark)]] would make sense to me: the topic is identified using a natural-language phrase (instead of the relatively unnatural slash) and the responsible editor is indicated so that the reader knows whether to look or not. And for those who oppose the brackets (which I like): [[History of Pragmatics/KYPark]]. Or also: [[KYPark/History of Pragmatics]]. But then, searches in mainspace will see that content and the question is whether that is good. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:21, 15 October 2025 (UTC)

:What about to propose the user to write some guidelines, how other can participate instead of deleting it? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:03, 16 October 2025 (UTC)
:: I plan to move the pages to userspace as I proposed. If someone wants to ask KYPark to address the problems, they should feel free. There will be plenty of time for KYPark to address the problems while the material is in user space. After the problems are addressed, the material can be moved back to mainspace. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:38, 15 November 2025 (UTC)
:So I would '''delete''' it. In the blocked user space its useless. The user cannot improve it and Wikiversity is not free hosting service for personal pages. My believe is, that there should be just a few working pages in the users spaces. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:30, 11 March 2026 (UTC)

'''Move'''. Insufficient statement of learning objective or connection to related learning resources with insufficient current activity to stay in main space. The page was originally [[History of pragmatics]] but was moved by Dave B. Therefore, I suggest moving to [[User:KYPark/History of pragmatics]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:57, 22 November 2025 (UTC)

== [[IMHA Research Archives]] ==
I propose to '''move to userspace''', including the subpages. I struggle to understand how Wikiversity readers are supposed to benefit from the material here and in the subpages. In the log, there is e.g. '10 February 2019 Marshallsumter discuss contribs deleted page IMHA Research Archives (content was: &quot;{&lt;nowiki/&gt;{Delete|Author request}} Thanks! -&quot;)', so the page was deleted before, but not the subpages.

We could also delete all the material if we have strong enough suspicion too much of it is copyright violation. In any case, moving to user space improves the matter a little by moving the content away from Google search. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 13:38, 9 November 2025 (UTC)

:Looking at some sub-pages, they can be deleted e.g., because they only consist of broken links or are largely empty. I deleted a couple but haven't been through all to check. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:27, 10 November 2025 (UTC)

As an example, let me give the wikitext content of [[IMHA Research Archives/3. Scientific litterature search, storage and use]]:
&lt;pre&gt;
==[[/Medicina Maritima - the Spanish scientific maritime health journal/]]==

==[[/PubMed/]]==

==[[/Google and Google Scholar/]]==

==[[/Zotero/]]==

==[https://www.dropbox.com/sh/d91z7bcyelfvk42/AAAkIvjtBnnFMbiU9ZLOdVL9a/Andrioti_database%20sources0310.pptx?dl=0 Maritime health web portal ressources ]==
&lt;/pre&gt;
The wikilinks are red; the external link to dropbox says &quot;You don't have access&quot;. This was made in 2016. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 09:04, 11 November 2025 (UTC)

:I suggest delete -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 03:27, 12 November 2025 (UTC)
:: I think we should avoid deletion as much as possible, instead moving to user space (bar copyvio, ethics violation, etc.). This is a good general principle. It greatly improves auditability and makes it so much easier for anyone to request undeletion since they know what content they are requesting for undeletion. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 09:52, 12 November 2025 (UTC)
:::Do not recreate Wikiversity from the educational and research project to the personal blog. That will lead to the cancelation of it by WMF. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:44, 20 November 2025 (UTC)
:::: The English Wikiversity has a long tradition of moving problematic content to user space, as per evidence collected at [[User:Dan_Polansky/About Wikiversity#Moving pages to userspace]]. If Wikimedia Foundation finds this problematic, they can start a discussion in Colloquium and state their concerns. They do not need to make explicit threats at first; they can start a discussion and explain why it is problematic. They can even do it from an anonymous IP and provide a well-articulated reasoning. And anyone else can start a discussion in Colloquium to change this tradition. I do not see why we should not want to change that tradition based on well-articulated, compelling reasoning. I see no reason why Juandev should be making threats instead of them, on a per RFD basis. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:58, 21 November 2025 (UTC)
:::: If Juandev is ''sincere'' about deleting very-low-value items ''from user space'', he should perhaps demonstrate that by asking his pages like [[:cs:Uživatel:Juandev/Problémy/Kov/Repase dvířek elektroskříně]] to be deleted; otherwise, I register a ''glaring inconsistence''. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 07:43, 21 November 2025 (UTC)
::What was the original delate page about @[[User:Jtneill|Jtneill]]? I guess that would be crucial for the decission. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:48, 20 November 2025 (UTC)
:::@[[User:Juandev|Juandev]] the couple of pages I checked and deleted were much like @[[User:Dan Polansky|Dan Polansky]] posted above i.e., headings with empty sections and/or broken links but no substantive content. But I think each sub-page needs checking. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 21:59, 20 November 2025 (UTC)
::::So I'm saying that the main page usually determines what the other pages are for. But if I don't know the page because it's been deleted, or why was deleted (deletion based on the founder's request is probably not the rule), it's hard to judge. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 22:16, 20 November 2025 (UTC)
:::::I've pasted the original content of the root page: [[IMHA Research Archives#Original page]] (i.e., prior to the content being removed and deletion requested) to help understand the context for the sub-pages. In 2018, Saltrabook blanked the page, indicating that the content had been moved elsewhere, and requested page deletion. Marshallsumter then deleted the main page but not the sub-pages. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 01:58, 21 November 2025 (UTC)
::::::I see, so if those subpages are usefull I would keept them, if not I would delete them. I dont see a point of providing free hosting to sombody, by moving many pages to their user space. The question is if we want to host (i.e. to have in the main ns) lists of links elsewhere. I have no opinion on that. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:11, 22 November 2025 (UTC)

: Let me clarify that while many of the subpages are like the example above, [[IMHA Research Archives/Scientific litterature search, storage and use/Zotero]] is different:
:: &quot;A continuous critical and evidence based learning is a core issue in clinical practice, research, teaching, publication and prevention activities. The Zotero Program is just one of many scientific literature management programs, that should be used for these purposes. Of course one can live without such a database but it helps a lot and can save a lot of time that could be used for more interesting issues. Not only that, but it helps to create better publications and knowledge. Without this program it can be very time consuming to publish a scientific article with the requested style for the references. Further in daily practice when you want to collect and cite a few references for a specific evidence in a clinical colloquium and discussion, this program is excellent. Therefore we strongly recommend that all maritime health persons learn how to use this excellent tool in their daily maritime health practice of all different types. There are good online courses for self-instruction on how to use Zotero. For example this one: Zotero fast online course But in order to increase IMHAR´s collective scientific strength in the use of EBM we would like to give training sessions in every possible opportunity, IMHA Symposia, seminars and other types of meetings. The database is useful for personal purposes but especially also for collaborative aims. At the IMHAR meeting in Paris Oct 7th 2016 we will give an introduction to the program by showing how it can be used in the daily practice and discuss strength and weaknesses compared to other similar databases.&quot;
: Even longer is e.g. [[IMHA Research Archives/Scientific litterature search, storage and use/Medicina Maritima - the Spanish scientific maritime health journal]].
: However, that does not mean these should be salvaged. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 07:53, 21 November 2025 (UTC)

== [[Palliative medicine]] ==

Underdeveloped and has not been improved on since 2007. Author inactive. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 21:42, 14 December 2025 (UTC)

:Delete, per nominator [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:16, 22 January 2026 (UTC)
:Yes, I would also expect there to be more and especially that someone would write how to use it. However, it still seems to me to be a useful thing in the sense of a syllabus, so that someone who is interested in the topic knows what information to obtain in order to get a complete picture of the topic. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:55, 16 March 2026 (UTC)

== [[Canadian Wilderness]] ==
This page doesn't seem to belong to wikiversity. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 09:55, 6 February 2026 (UTC)

:In principle there could be some material useful here but in practice, I don't see what this page is adding as an educational resource. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 12:54, 6 February 2026 (UTC)
:I can see this being a useful resource to a bigger project. Maybe we could move it to the &quot;[[Wikiversity:Drafts|Draft]]&quot; namespace vs. deleting it? —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 13:28, 6 February 2026 (UTC)
::Does anyone plan to work on it? [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 01:59, 8 February 2026 (UTC)
:::Next week the page has it's 17th birthday. Ever now and than someone added to it. With a lot of work it could be a nice encyclopedic article but making it educational .... Merging it may take more work than rewriting it. Move to Draft might be the best option. [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 08:58, 12 February 2026 (UTC)

== [[LQR Control for an Inverted Pendulum]] ==
Underdeveloped resource, has not been edited for more than a decade. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 08:03, 16 March 2026 (UTC)

:Looks like a test, '''delete'''. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:30, 27 March 2026 (UTC)

== False flag &quot;authority hack&quot; user page deletion ==
{{archive top|'''Not undeleted''', the requester dropped the request. See Wikiversity:Requests for Deletion v. 2803217.--[[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:36, 10 May 2026 (UTC)}}
'''Undeletion requested'''

Hi, Juandev marked my user page as &quot;spam&quot; and &quot;authority hack&quot;, and deleted it. 

First, I asked him for help with &quot;time limit for new users&quot;, and he replied - I should admit I dont know, what is &quot;new user limit&quot;, but if filter blocks your page because of certain external link, you may force to save anyway and sometimes it works. It should not work, when the website is blacklisted. As of now, I am not seeing you to save page in main namespace, so try to save it without external links first. 

Then he wrote me another message: Well, I have analyzed your contribution to Wikiversity and I should point out here, that this project is not a place for advertising, so there is no way of promoting your books and authority this way. - probably referring to the intro of my About me page where I present me and my work. 

Before I could explain him the difference between the neutral information and advertising and promotion, he deleted my user page. 

Here is my answer I posted to the discussion today: 

: Hi, my About Me page is just an info page with the neutral as possible presentation of my work.
:
: There is a big difference between informing and advertising. Informing is neutrally stating that something exists and requiring no action, while advertising is a special communication form with intent to cause certain action from readers. For example, click here, click there, order this, buy that.
:
: There is no such intention, form, or terms on my info page. Just neutral information. I don't hide and I am not ashamed that I am write and author, and that is a part of the usual bio, including works. I checked your user page: &quot;I graduated from the Czech University of Life Sciences in Prague and studied information science at the Faculty of Arts of Charles University.&quot; I think that if you had written a book on Life Science, you would have mentioned that as well.
:
: Most of the Info page is about my research and AIPA Method which is a valid contribution to psychology, consciousness studies, identity theory, and personality development. Actually, my paper '''AIPA Method: A Cognitive-Phenomenological Model for Identity Reconstruction and Stabilization in Pure Awareness''' is now in the peer review procedure at Journal of Consciousness Studies.
:
: Here is a part from the Wikiversity AIPA Method page in creation (waiting for the end of the time limit for new users):

: == Introduction ==
: The AIPA Method addresses a gap in contemporary personal development and consciousness science: most evidence‑based approaches (CBT, MBSR, MBCT, standard meditation) operate at the level of mental content—reframing thoughts, observing them, or reducing their impact—rather than at the level of identity structure. In contrast, AIPA targets the structural relationship between the self and the mind, aiming at durable identity reconstruction rooted in Pure Awareness rather than symptom management.
:
: The central research question of the primary AIPA preprint is whether a structured, sequentially staged method can produce permanent identity reconstruction rooted in Pure Awareness, and how such a method compares to established approaches in scope, mechanism, and outcome.
:
: == Theoretical foundations ==
: The AIPA framework is grounded in the cognitive‑phenomenological tradition (e.g., McAdams, Varela, Metzinger, Erikson), contemporary consciousness science on minimal phenomenal experience, and qualitative methods advocacy in psychology. It builds directly on:
:* Empirical work on pure awareness and Minimal Phenomenal Experience (MPE), especially Gamma &amp; Metzinger’s large‑scale study of content‑reduced awareness states.
:* Metzinger’s proposal of minimal phenomenal experience as an entry point for a minimal unifying model of consciousness.
:* Narrative identity and partial‑self models within personality and identity theory.
: Within this backdrop, AIPA proposes Pure Awareness as a distinct, operationally specified state that can become a structural ground of identity rather than a transient meditative experience.
:
: == Experiential empiricism ==
: The empirical foundation of the AIPA Method is explicitly first‑person and experiential, combining:
:* A 22‑year longitudinal autoethnographic self‑study (2003–2025) documenting partial personality episodes, protocol use, and outcomes.
:* A 13‑year prospective verification period with zero self‑reported recurrence of targeted harmful behaviors after a dated stabilization point (1 January 2006).
:* A high‑ecological‑validity “stress test” during acute bereavement, used to examine whether non‑reactive awareness remains stable under maximal provocation.
:* Two independent practitioner cases (an Amazon‑verified report and a structured questionnaire case) providing preliminary convergent signals across cognitive, emotional, behavioral, and identity dimensions.
:
: All central constructs (Pure Awareness, partial personalities, the Switch, identity stabilization) are operationalized with explicit phenomenological and behavioral criteria intended to enable replication and future third‑person measurement.
:
: I believe this is a valid contribution to Wikiversity.
:
: Best regards, Senad [[User:Senad Dizdarević|Senad Dizdarević]]


I suggest you check the deleted user page, and see for yourself if it is &quot;spam&quot; and &quot;authority hack&quot;, or a legit author's page with one paragraph short presentation, while the rest of the page is about my research project. 

Thank you for undeleting my user page, so I can use it. 

Best regards, 

Senad Dizdarević [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:26, 2 April 2026 (UTC)

:Hi Senad,
:Welcome to Wikiversity.
:It looks like you tried adding similar content to Wikipedia and ran into similar difficulties over there ([[w:User talk:Senad Dizdarević]])? Perhaps that is what has led to you Wikiversity?
:Basically, if you'd like to collaborate and help build open educational resources, feel free to contribute to Wikiversity. But if the primary motivation is to promote your autobiographical work you're probably going to run into challenges.
:Sincerely,
:James
:-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:11, 3 April 2026 (UTC)
::James, Hi, and thank you for your answer. 
::Yes, in 2025, I created the autobiographic page on Wikipedia, which was removed because of the links to my books on Amazon. To admin, I explained that I did not know the rules, and agreed that page is removed. Now I know that somebody else must write a Wikipedia page for you. 
::On the deleted user page on Wikiversity, there were no links to Amazon or any other form of promotion, just neutral as possible basic presentation of my writing (one sentence) and current project (the rest of the page). 
::I created Wikiversity page to present my AIPA Method project, to invite researchers to read it, give their opinion, and conduct empirical researches in their institutions. Now, it is in a theoretical phase, and needs more empirical testing. 
::Best regards, 
::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:03, 3 April 2026 (UTC)
:::It looks to me like the primary motivation for contributing to Wikiversity is to drive traffic / search engine ranking to your website?
:::* [[User:Senad Dizdarević]]
:::* [[AIPA Method]]
:::-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 01:36, 4 April 2026 (UTC)
::::No, it is not. There is no link to my website, so &quot;driving traffic to my website&quot; is not possible. 
::::For your educational purposes: 
::::Copilot &quot;AI:  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:38, 4 April 2026 (UTC)
:::::So do you still insist of undeleting your former version of your userpage if you have created the new one? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:15, 6 April 2026 (UTC)
::::::No, because in the moment of undeletition, somebody could delete it again, and so on. Thank you for not deleting my new user page, as it is made in your user page image.  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 08:59, 6 April 2026 (UTC)

{{archive bottom}}

== Undeletion request ==

It was deleted by an admin without discussion and with untrue rationale. If people take offense with the question that doesn't mean it's not a valid question and the page was good. Please undelete the Wikidebate page [https://web.archive.org/web/20250810030352/https://en.wikiversity.org/wiki/Is_it_likely_that_Earth_has_been_visited_by_aliens_millions_of_years_ago%3F Is it likely that Earth has been visited by aliens millions of years ago?]

There are lots of sources on the subject, the wikidebate is sourced very well compared to other wikidebates and wikiversity pages, and the page is educational, useful and of good quality. [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 23:57, 10 April 2026 (UTC)

:Page: [[Is it likely that Earth has been visited by aliens millions of years ago?]]
:Ping: [[User:Atcovi|Atcovi]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:21, 11 April 2026 (UTC)
:There is no need for a discussion for straight garbage-level, pseudoscientific content.
:For '''Is it likely that Earth has been visited by aliens millions of years ago?''', the flaws for this page wouldn't even take someone more than a few minutes to assess:
:* Essentially, the &quot;pro&quot; arguments unproven claims being derived from irrelevant, established facts (basically: &quot;it is likely aliens have came because Earth has existed for so long [sources proving Earth's longevity]&quot;). These are not serious, scientifically-backed arguments - these are non sequiturs. It's as if I said Wikipedia has existed longer than my existence on Earth ([https://d1wqtxts1xzle7.cloudfront.net/74351725/eyJoIjogImZiODhmYzNkODU1N2UxMWExYzUyODJiYzgzZTRmZDM4OTBjODY5YWMzMjA3NDNmOWEyZTA0ZTU3ZGYwZjAyYTkiLCAidSI6ICJodHRwczovL3B1cmUuaHZhLm5sL3dz-libre.pdf?1636354596=&amp;response-content-disposition=inline%3B+filename%3DCritical_Point_of_View_A_Wikipedia_Reade.pdf&amp;Expires=1775872055&amp;Signature=GqbUZboYRvUYWi~aW40LT5eZSHrLuDL3o0-DxAH8vSvcJcGAuyByZWLF2oHTY6GlB72TqvZxpE-v9d4gvsA6myriYqO~QQQZgWxjT2JXjUWC-yiPcTF4l~lroJSi4dY0v9eKiBcU03l-aeUdrX8~UPfi0TfW0IhsmzH-VBR6X6FrzRpIqc6uM6n9YXfr5FRB3aCqqokU690af3n0Hguaub1Zgmh9qjYYqzBS0VOOHjKTTEQnDuadX3jl5CQeXYTaeCC3H0hMeVwHlratbrnuFEKC1aN0-5znCUoSzMEg21ECzGPTrSDM1W05dcK-u0ZTCeUGKAuC-2yRFL3sY46MIw__&amp;Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA#page=157 reputable source proving ''this'' fact]), therefore it's likely that my birth took place solely for the sake of me experiencing Wikipedia (0 backing). It makes no sense and no person with at least a high school-level of intelligence would take this seriously. 
:* What is worse is that the user is being misleading with their &quot;[the page is] sourced very well&quot; claim. The sources ''themselves'' don't even back up the claims. It's just used as proof for an established concept, where the user then uses this established concept to jump to an unsupported, laughable conclusion that is pulled out of thin air. It's utterly ridiculous to even consider such a page for mainspace since it clearly violates our [[Wikiversity:Verifiability]] policy. This is, once again, pseudoscientific content that has caused our website to reduce in quality over the last few years. 
:* Going source by source, we can see that:
:#[https://web.archive.org/web/20250918011642/https://timesofindia.indiatimes.com/blogs/thebigd/compress-earths-history-into-24-hrs-humans-came-at-1158-pm-yet-killed-70-of-wildlife/ ‘Compress Earth’s history into 24 hrs. Humans came at 11:58 pm, yet killed 70% of wildlife’] is literally just a blog post which doesn't even mention aliens or extraterrestrial life. It just talks about Earth's history in accordance with the 24-hour metric of time, and the author tries to use this article as a 'piece in the puzzle' of aliens &quot;possibly&quot; visiting Earth... which, once again, is unsupported and is not backed up anywhere in the article.
:#[https://web.archive.org/web/20250808053249/https://news.cornell.edu/stories/2023/11/jurassic-worlds-might-be-easier-spot-modern-earth The Cornell article does not even remotely support the idea that &quot;aliens visited Earth&quot;]. It mentions a ''chance'' of &quot;life there [a habitable exoplanet] might not be limited to microbes, but could include creatures as large and varied as the megalosauruses or microraptors that once roamed Earth.&quot;, but again, no justification to take this article as proof that &quot;aliens may have visited us!&quot;. There's no mention of aliens visiting Earth anywhere in the article. Once again this is only proving the background premise, but not the unsupported, nonsensical &quot;alien likelihood&quot; argument that the author of this garbage page is trying to push so desperately.
:#The Parker Solar Probe WP article does not even mention aliens either. It follows the same issues as the previous argument.
:And the other page this user complained about [https://en.wikiversity.org/wiki/User_talk:Atcovi#Deletion_of_educational_page_because_of_personal_opinion on my talk page] holds almost similar, maybe even more fatal mistakes, than this one. It has nothing to do with &quot;taking offense&quot;, this is just low-quality, garbage content. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 00:56, 11 April 2026 (UTC)
::Why do you think pro claims are required to be proven? It's possible to object to them and these are arguments, not contextualized to be statements of proven facts. And it's not a strange or unreasonable argument to make that since Earth has existed for long, it's more likely that aliens have come here in the past than in recent times or the near future. Instead of insulting others' intelligence, maybe engage with the actual reasoning rather than censoring it away. And there are lots of sources, such as [https://interestingengineering.com/science/alien-civilizations-may-have-visited-earth-millions-of-years-ago-study-says Alien Civilizations May Have Visited Earth Millions of Years Ago, Study Says] etc etc. The sources are used for the arguments themselves individually. [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 12:30, 11 April 2026 (UTC)
:::Because, once again, this is not a site that caters to rampant debating for the sake of &quot;we need to employ rationality and logic to solve the world's problems&quot;, we have policies that we need to fulfill. The claims made in the pro argument clearly do not meet [[Wikiversity:Verifiability]], since you cannot verify these arguments with the sources because they are not relevant. 
:::''&quot;And it's not a strange or unreasonable argument to make that since Earth has existed for long, it's more likely that aliens have come here in the past than in recent times or the near future.&quot;'' The point being is that these arguments are not supported by the sources. Even the article you mention poses the idea as a hypothetical model. This is just you twisting the article to fit your unsupported narrative. I'll bring direct quotes for you to show why the linked article does not help you:
:::* ''One problem the researchers do make sure to point out is that '''they are working with only one data point: our own behaviors and capabilities for space exploration'''. “We tried to come up with a model that would involve the fewest assumptions about sociology that we could,” Carroll-Nellenback told Business Insider. '''We have no real way of knowing the motivations of an alien civilization'''.'' --&gt; proves that this is just speculation and no evidence-based arguments have been provided for the idea that aliens likely visited Earth.
:::And I'm not sure if you read my entire response, but I ''did'' engage with your &quot;actual reasoning&quot; and exposed its weaknesses and lack of adherence to Wikiversity policies. If we allowed content that was just filled with non sequiturs we would have content that fails Wikiversity's educational objectives and reduces the overall quality of this website, hence why such a harsh stance needs to be taken. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 13:50, 11 April 2026 (UTC)
::::Thanks for proving that the Wikimedia ecosystem is unfit to deliberate on controversial topics. The question is entirely valid and the content is far better sourced than nearly all Wikidebates and has no genuine flaws. The only possible issue with it as far as I can see is that now that Wikidebates has been paused people can't add objections if they do have sth specific to say about the topic that's not already included on that page which already had plenty of Cons and objections.
::::The page was more educational than most of Wikiversity and it was well-sourced – wikidebates was for arguments so people were invited to make arguments based on sourced things or outlined logic and the page met [[WV:V]] and most pages on Wikiversity aren't sourced as good. Doesn't look like people can see beyond their biases and personal views here but that's more evident in the marginalization and deletion of wikidebates and the low activity in that project than these selective deletions. A constructive thing to do would be to add reasoned Cons and objections not yet on the page and people had plenty of time to do that. There are and will be other sites for free constructive rational adversarial deliberation (not a big loss in that sense). [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 16:31, 22 April 2026 (UTC)
:::::Thank you for failing to address any of my arguments and going on an unrelated, nonsensical tangent that has nothing to do with the discussion. Once you start producing work that aligns with Wikiversity's content policies instead of typing up laughable, pseudoscientific garbage, then maybe your work can be accepted and not removed. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 16:59, 22 April 2026 (UTC)
::::::I suggest you stop ridiculing things and learn respectfully forming genuine points about the subject at hand. {{tq|the idea as a hypothetical model}} but please learn first about what arguments are and why they're not the same as a statement of objective proven fact. [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 17:18, 22 April 2026 (UTC)

==Pages by Harold Foppele==
[[User:Harold Foppele]] is locally blocked indefinitely and globally banned for sockpuppetry. There were also WMF and local community concerns expressed about copyright violation and AI (over)use. As a result, I think the Wikiversity pages created by this account warrant review with regard what should be deleted, what should be retained etc.:
* [[Completing the square]]
* [[Number of independent spatial modes in a spherical volume]]
* [[Quantum]]
** [[Quantum/Andrew N. Jordan]]
* [[Quantum A Matter Of Size]]
* [[Quantum A Spooky Action at a Distance]]
* [[Quantum: A Walk Through the Universe]]
* [[Quantum Computing Algorithms in the NISQ Era]]
* [[Quantum Formulas Collection]]
* [[Quantum harmonic oscillator]]
* [[Quantum Matter Elements and Particles]]
* [[Quantum mechanics]]
** [[Quantum mechanics/Timeline]]
* [[Quantum mechanics learning module]]
* [[Quantum mechanics measurements]]
* [[Quantum Noisy Qubits]]
* [[Quantum optics beam splitter experiments]]
* [[Quantum: The Secret of Cohesion: How Waves Hold Matter Together]]
* [[Quantum Ultra fast lasers]]
* [[Speed of sound experiments]]
* [[User:Harold Foppele]]
-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 08:12, 17 May 2026 (UTC)

:'''Delete all''' Not worth keeping. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 08:27, 17 May 2026 (UTC)</text>
      <sha1>2h53dygaazyigrsb6gyd2u3hsshhpxe</sha1>
    </revision>
    <revision>
      <id>2809904</id>
      <parentid>2809878</parentid>
      <timestamp>2026-05-17T11:08:24Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <comment>/* Canadian Wilderness */ Deleted</comment>
      <origin>2809904</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="55649" sha1="76sl3deow70yyjuwpa9m6fbguo8bwi6" xml:space="preserve">{{/header}}
[[Category:Wikiversity deletion]]

__TOC__

== [[Korean/Words]] ==
(I go to RfD instead of ''proposed deletion'' since many pages are affected.)

I proposed to quasi-delete, i.e. '''move to userspace''' of the main (or sole?) creator, {{User|KYPark}}.

The page is organized a little bit like a dictionary. It makes it redundant to Wiktionary except that Wikiversity allows original research and there does seem to be original research there. Thus, its being organized as a dictionary would alone not necessarily be a problem.

Where I see a problem is in the organization and execution/implementation. Consider [[Korean/Words/가다]], which seems rather typical of the subpages (some subpages are like categories and transclude the pages for individual words):
* On the putative definition line, there is this: &quot;한곳에서 다른 곳으로 장소를 이동하다&quot;, apparently(?) in Korean. That does not seem to fit well into the ''English'' Wikiversity.
* There seems to be some original research into etymological relations between Korean and European languages in the &quot;Comparatives&quot; section (from what I recall, the English Wiktionary rejected this kind of content from KYPark). Admittedly, it is marked using &quot;This is a primary, secondary and/or original Eurasiatic research project at Wikiversity&quot;, so it could be tolerable, but even so, one has to wonder whether Wikiversity wants this kind of fringe science/research or outright pseudo-science.
** Fringe science: fringe physics has been moved to user space before. This would be fringe etymology. But then, original research is allowed.

Deletion is not required; moving to user space suffices, I think. Alternatively, one could at least rename the pages to make it clear from the title that this is not Wikiversity voice but rather KYPark voice, e.g. &quot;Korean/Words (KYPark)/...&quot; or  &quot;Korean/Words/KYPark/...&quot;  (recall the &quot;Fedosin&quot; pages featuring the name &quot;Fedosin&quot;).

Methodology: I see almost no methodological notes spanning the words at [[Korean/Words]]. And yet, if this is original research inventing new etymological connections, surely there should be some general considerations/analysis on how to proceed and how that manner of procedure differs from mainstream etymology?

Prefix index (max 200 items?):
{{Small START}}
{{Special:Prefixindex/Korean/Words}}
{{Small END}}

--[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 09:33, 24 September 2025 (UTC)

:I would keep it. If there is a course of Korean, why not to have a resesearch on Korean vocabulary? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 19:53, 16 October 2025 (UTC)
:: I propose to dismiss the above input: 1) it does not contain any argument, except for a question, and a question is not an argument (it can be so reinterpreted, but that includes additional burden on the interpreters, in interpreting it the wrong way); 2) it ignores all the issues I have raised, including that there is something like definition lines in Korean, in this ''English'' Wikiversity. To answer the question asked: there can be a research on Korean vocabulary in the mainspace, but not one showing the defects I identified above. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:35, 15 November 2025 (UTC)
:I've reviewed a sample of approximately 20 of the Korean/Words sub-pages and lean towards moving to user space because:
:* The pages appear to be an idiosynchratic collection of etymological pages about Korean language
:* There is minimal English instruction which is problematic for English Wikiversity
:* There is no explanation of research method
:* There is no educational rationale
:-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:31, 22 November 2025 (UTC)
:Well, since the original creator has indef I change my mind and I would '''delete''' it. The case is nobody knows how to continue with the research and if we move it to the userspace, the user cannot improve it eihter. What the original user can do to request admin, to send them a contentent to their email for example if they really want to improve the resource elsewhere. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:38, 11 March 2026 (UTC)

== [[Enhancing Web Browser Security through Cookie Encryption]] ==
To avoid further conflict with the user who entered this text into Wikiversity, I am opening a RFD request.

I am not sure about how to proceed, although I am inclined to move it out of mainspace = quasi-delete. I am looking forward to get input from others, especially curators and custodians. Some considerations:

1) There is perhaps no more appearance/suspicion of copyright violation, now that the ResearchGate (RG) article (of which this is a copy, perhaps an incomplete copy?) carries a license.

2) The article is not a complete replica from RG: at a minimum, it lacks images. The inserter could have continued editing the page in his user space before he uploads images, that is, before he finalizes the page for consumption, but that did not happen. I did not check whether the text is an exact one-to-one match; the article does not indicate anything in that regard.

3) The principle implied seems to be this: users should feel free to duplicate non-peer-reviewed articles from RG in English Wikiversity, perhaps to increase the Google search and LLM yield. I find this problematic, in part for the duplication. I would say: choose a venue and publish it there. If RG is not good enough for you as a publishing venue, choose Wikiversity instead, but not both?

4) There are some features that appear unduly promotional. There is a link to a dot com home page of the inserter of the article. I dot not know how we handle or should handle this, whether prohibit such a link, etc. This is perhaps not so much a call to quasi-deletion but a call to make it less promotional.

5) I cannot determine the value of such an article. It seems to be a pseudo-article describing someone's browser extension. Can someone do a better analysis?

--[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:48, 8 October 2025 (UTC)

:2) Images for Wikicommons are being created, it will take a lot of time. and the text is not an exact one-to-one match
:3) I also mentioned that It was being created so that it is more accessible from mobile phone, which is not possible in RG or in Zenodo
:Let me clarify the purpose of uploading it to different platforms
:Zenodo - registration and to link DOI
:RG - Self Archiving 
:Wikiversity - Accessible by anyone from any device. LLMs may get trained on Wikiversity data or use these data for indexing 
:5) The paper is a result of a research project which involved a browser extension which was built to test the theory.  [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 01:34, 9 October 2025 (UTC)
:: I find the practice here of publishing non-identical but similar text (&quot;the text is not an exact one-to-one match&quot;) with almost the same title to be problematic. I cannot imagine this is a recommended practice in academic publishing. At a minimum, somewhere near the top, the page should say something like the following: &quot;This text is based on article ___ published at ___ but is not identical. The author of the differences/changes is ___.&quot; Everything else leads to an undesirable confusion. In academic publishing, the title of an article serves as key part of identification of the artifact.
:: As I said before, I seen nothing particularly academic article-like about the page except for external/superficial signs. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:30, 9 October 2025 (UTC)
:::That Article has been published under CC BY SA 4.0
:::And I am one of the author of the article. That gives me right to modify text and publish it under a similar name. However, I will add the disclaimer text that you have suggested. I hope that helps.  [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 06:07, 9 October 2025 (UTC)
:::: It may give you that right from the ''copyright'' perspective, but perhaps not from ''academic publishing integrity'' perspective. Unfortunately, I do not have any guideline handy; I am merely following my common (or not so common) sense. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:32, 9 October 2025 (UTC)
:: I would like to ask: was this article guided by someone from an academic institution, such as a university? Is it reviewed at least in some weak sense? --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:39, 9 October 2025 (UTC)
:::Yes, This article has been reviewed by two academic professors, their names are also listed as co authors.
:::First, a project guide would help us with selecting a topic and with the document 
:::Second, an Internal examiner would go through our experiment and approve it
:::Finally, External Examiner would examine the documentation and verify it. 
:::We were required by these professors to put their name under contributions [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 05:48, 9 October 2025 (UTC)
:: Let me explicate the promotional potential of such a page a bit: one can go to the page of the article in Wikiversity --&gt; https://tomjoejames.com/ --&gt; HitMyTarget (a commercial, profit-making entity?) Why would the link be to a commercial web site rather than an academic page, or perhaps a LinkedIn account, which I think the person has? There could also be no link at all; a search for the name would turn out something in Google as well. But providing a direct link would drive users/viewers toward that website much stronger since otherwise the viewer of the page would have to open a new Google search window or the like. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:45, 9 October 2025 (UTC)
:::It is evident that the website is not even close to being complete. 
:::I will be creating a separate page under the same domain name specifically for people to contact me.
:::The url would probably be defined as tomjoejames.com/contact-me/
:::I haven't decided yet. But that is my personal website.
:::If the community requires me to remove it, I will. But personally I think people who are from here most likely to click the link to know more about me or to contact me. Either way I think my personal website serves the purpose. 
:::As for the HitMyTarget, it can be traced from any of my links. From my research gate profile, linkedin page or even my own userpage.
:::On the article I did not add any promotional content about myself, I hyperlinked only my own name. I do not know how that is promotional. [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 06:04, 9 October 2025 (UTC)
:::: I am pausing any further responses from me to see whether anyone else has any input. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:30, 9 October 2025 (UTC)
:What does it mean &quot;There is perhaps no more appearance/suspicion of copyright violation&quot;? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 19:57, 16 October 2025 (UTC)
:I have accepted VRT permission per [[ticket:2025100410001149]] FYI. [[User:Matrix|Matrix]] ([[User talk:Matrix|discuss]] • [[Special:Contributions/Matrix|contribs]]) 11:00, 28 October 2025 (UTC)
::Thank you Matrix [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 12:43, 28 October 2025 (UTC)
:I would '''delete''' it. 1) it states its a learning resource. It could not be a learning resource as not rewieved original research. 2) It is not an ongoing research, nor the research was performed on Wikiversity - wv is not a preprint or article database. Maybe it could be moved elsewhere withn Wikimedia domain, but I dont know where. So I would delete it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:56, 20 November 2025 (UTC)
::I would '''keep it.''' Like Dan had pointed out,  we do have article-like pages in Wikiversity, and this is not just a random pseudo science article but an article that is a report of an final year project, it has been reviewed by 3 professors whose name has been mentioned at the very beginning.   [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 14:50, 21 November 2025 (UTC)
:::I think it is not good to rate pages by appearance. It can be done on other Wikimedia projects, but it cannot be done on Wikiversity, because Wikiversity does not create a static format for presenting information, but is focused on the goal and process. Unfortunately, the goal and process do not have a uniform format. While a target article on Wikipedia or an entry on Wiktionary have some standard target format, Wikiversity does not. That is why I personally rate pages according to the goals and their assessment. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:05, 22 November 2025 (UTC)

Further reading for this nomination: [[S: Wikisource:Proposed_deletions/Archives/2025#Index:Cookie_Encryption.pdf]]; EncycloPetey handled the matter. Let me quote his wisdom on Zenodo (which I lack): &quot;This is tied to a PDF on Commons that was uploaded as &quot;own work&quot; with a CC license and a doi link to Zenodo, with no indication of where this paper was published or if it was published. Zenodo is not a publisher; it is a site for storing research and sharing papers. If Zenodo is the only place this was &quot;published&quot; then it was effectively self-published. --EncycloPetey (talk) 16:14, 15 September 2025 (UTC)&quot;

--[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 08:55, 9 October 2025 (UTC)

:Can you clarify what point are you trying to state? Didn't I already state that the article is published by me? 
:I first created the article in wikisource which I thought would be the perfect place, unfortunately they do not allow self published articles that are not notable. Then I discovered Wikiversity where they allow self published articles. That is why I created the article here. 
:Unlike in wikisource, I did follow guidelines.
:Ever since you deleted the first article, I spent time reading Wikiversity guidelines and I do think that I am following it perfectly.
:I would like to get your suggestions on how should I improve the page,  10 points would be sufficient. 
:Because your goals or intentions are confusing me very much. At first you told me that the article is exactly the same as the preprint in RG and therefore there is no use to it here. And then when I continued to optimize it for Wikiversity, you went ahead and said it is problematic according to recommended academic publishing. 
:Atleast just respond to the points that I have made whether you agree or disagree. So that I clarify and proceed to discuss points that are important and relevant 
:Have you published an research article? If yes, could you send it to me so that I can see the format you have done it [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 10:45, 9 October 2025 (UTC)
:: I am giving a chance/time to other curators/custodians to look at the matter and respond to my inputs. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 11:14, 9 October 2025 (UTC)
:: Incidentally, above I counted 4 questions (or more), 1 request (or more?) and 1 command (or more?). That is a behavior of a commanding entity. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 11:24, 9 October 2025 (UTC)

I would '''delete it''''. It's more like an academic communication than a learning resource or research.--[[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:32, 26 October 2025 (UTC)
:: In the above post, I do not see any valid rationale for deletion: we do have article-like pages, in Wikijournals and also e.g. in [[Physics/Essays/Fedosin/Stellar Stefan–Boltzmann constant]]. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 08:59, 3 November 2025 (UTC)
:::But I do, see above. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:56, 20 November 2025 (UTC)

:it is a '''student research paper''' forming part of a learning resource on web security and encryption.
:The project was conducted as part of a final-year university course and documented as a practical study on cookie encryption and it has been reviewed by three professors. However, I will be creating a sub page for the article to elaborately describe the experiment that we have conducted and the results we got.    [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 15:57, 26 October 2025 (UTC)
::And why should w host research papers? Wikiversity is not an academic Journal nor repository. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:06, 22 November 2025 (UTC)
:::I do not wish to go through this same argument once again, I've already answered to this question several times in Dan's talk page, Colloquium. you can refer them. I am not hosting the research paper here, I have already hosted the pdf in the ResearchGate, I have published a text version in the wikiversity so that it may be useful for others. Unless you can show me how that article is totally useless, I would like to '''keep''' the article in the wikiversity.    [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 10:13, 22 November 2025 (UTC)
::::And thats the point I am having. Wikiversity is not paper repository. The only way is to publish it via WikiJournal, but they want it for Wikipedia usually. Why wikiversity should be a duplication of ResearchGate, Academia or Zenodo?
::::What I can read on [[Wikiversity:What is Wikiversity?]] policy is, that Wikiversity research &quot;...includes interpreting primary sources, forming ideas, or taking observations.&quot; The article doent look to fall into this. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:43, 22 November 2025 (UTC)
:::::Well, then how come you missed the term &quot;Learning Projects&quot;? As Jtneill had pointed out, this is a legitimate learning project. And also, I do have the VRT permission to host this article on Wikiversity.  [[ticket:2025100410001149]] . besides ResearchGate is an self-archiving platform. the document version in it is not accessibly to screen readers (usually disable people use them), Translators, and also for the mobile readers. therefore I do have valid reasons to publish this article on wikiversity. 
:::::# It is a learning project, therefore according to WIkiversity Policy, It qualifies. 
:::::# I have an explicit VRT permission to host this article on Wikiversity
:::::# Versions that are published in RG, Zenodo are documents, and they are not accessible by screen readers or mobile users. Therefore it is imperative that an article version of this paper exist on here. 
:::::Therefore this article qualifies to stay here on Wikiversity.  [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 11:22, 22 November 2025 (UTC)

'''Keep'''. This is a legitimate student learning project that may be of use to others. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:51, 22 November 2025 (UTC)

== [[Pragmatics/History]] ==
Another KYPark page and subpages with unclear organization scheme. Contains fairly many redlinked items. See also [[User:KYPark/Literature]], perhaps a similar concept. Unlikely to be really useful for others but KYPark. '''Move to user space'''.

As an alternative, moving to [[History of Pragmatics (KYPark)]] would make sense to me: the topic is identified using a natural-language phrase (instead of the relatively unnatural slash) and the responsible editor is indicated so that the reader knows whether to look or not. And for those who oppose the brackets (which I like): [[History of Pragmatics/KYPark]]. Or also: [[KYPark/History of Pragmatics]]. But then, searches in mainspace will see that content and the question is whether that is good. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:21, 15 October 2025 (UTC)

:What about to propose the user to write some guidelines, how other can participate instead of deleting it? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:03, 16 October 2025 (UTC)
:: I plan to move the pages to userspace as I proposed. If someone wants to ask KYPark to address the problems, they should feel free. There will be plenty of time for KYPark to address the problems while the material is in user space. After the problems are addressed, the material can be moved back to mainspace. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:38, 15 November 2025 (UTC)
:So I would '''delete''' it. In the blocked user space its useless. The user cannot improve it and Wikiversity is not free hosting service for personal pages. My believe is, that there should be just a few working pages in the users spaces. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:30, 11 March 2026 (UTC)

'''Move'''. Insufficient statement of learning objective or connection to related learning resources with insufficient current activity to stay in main space. The page was originally [[History of pragmatics]] but was moved by Dave B. Therefore, I suggest moving to [[User:KYPark/History of pragmatics]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:57, 22 November 2025 (UTC)

== [[IMHA Research Archives]] ==
I propose to '''move to userspace''', including the subpages. I struggle to understand how Wikiversity readers are supposed to benefit from the material here and in the subpages. In the log, there is e.g. '10 February 2019 Marshallsumter discuss contribs deleted page IMHA Research Archives (content was: &quot;{&lt;nowiki/&gt;{Delete|Author request}} Thanks! -&quot;)', so the page was deleted before, but not the subpages.

We could also delete all the material if we have strong enough suspicion too much of it is copyright violation. In any case, moving to user space improves the matter a little by moving the content away from Google search. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 13:38, 9 November 2025 (UTC)

:Looking at some sub-pages, they can be deleted e.g., because they only consist of broken links or are largely empty. I deleted a couple but haven't been through all to check. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:27, 10 November 2025 (UTC)

As an example, let me give the wikitext content of [[IMHA Research Archives/3. Scientific litterature search, storage and use]]:
&lt;pre&gt;
==[[/Medicina Maritima - the Spanish scientific maritime health journal/]]==

==[[/PubMed/]]==

==[[/Google and Google Scholar/]]==

==[[/Zotero/]]==

==[https://www.dropbox.com/sh/d91z7bcyelfvk42/AAAkIvjtBnnFMbiU9ZLOdVL9a/Andrioti_database%20sources0310.pptx?dl=0 Maritime health web portal ressources ]==
&lt;/pre&gt;
The wikilinks are red; the external link to dropbox says &quot;You don't have access&quot;. This was made in 2016. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 09:04, 11 November 2025 (UTC)

:I suggest delete -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 03:27, 12 November 2025 (UTC)
:: I think we should avoid deletion as much as possible, instead moving to user space (bar copyvio, ethics violation, etc.). This is a good general principle. It greatly improves auditability and makes it so much easier for anyone to request undeletion since they know what content they are requesting for undeletion. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 09:52, 12 November 2025 (UTC)
:::Do not recreate Wikiversity from the educational and research project to the personal blog. That will lead to the cancelation of it by WMF. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:44, 20 November 2025 (UTC)
:::: The English Wikiversity has a long tradition of moving problematic content to user space, as per evidence collected at [[User:Dan_Polansky/About Wikiversity#Moving pages to userspace]]. If Wikimedia Foundation finds this problematic, they can start a discussion in Colloquium and state their concerns. They do not need to make explicit threats at first; they can start a discussion and explain why it is problematic. They can even do it from an anonymous IP and provide a well-articulated reasoning. And anyone else can start a discussion in Colloquium to change this tradition. I do not see why we should not want to change that tradition based on well-articulated, compelling reasoning. I see no reason why Juandev should be making threats instead of them, on a per RFD basis. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:58, 21 November 2025 (UTC)
:::: If Juandev is ''sincere'' about deleting very-low-value items ''from user space'', he should perhaps demonstrate that by asking his pages like [[:cs:Uživatel:Juandev/Problémy/Kov/Repase dvířek elektroskříně]] to be deleted; otherwise, I register a ''glaring inconsistence''. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 07:43, 21 November 2025 (UTC)
::What was the original delate page about @[[User:Jtneill|Jtneill]]? I guess that would be crucial for the decission. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:48, 20 November 2025 (UTC)
:::@[[User:Juandev|Juandev]] the couple of pages I checked and deleted were much like @[[User:Dan Polansky|Dan Polansky]] posted above i.e., headings with empty sections and/or broken links but no substantive content. But I think each sub-page needs checking. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 21:59, 20 November 2025 (UTC)
::::So I'm saying that the main page usually determines what the other pages are for. But if I don't know the page because it's been deleted, or why was deleted (deletion based on the founder's request is probably not the rule), it's hard to judge. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 22:16, 20 November 2025 (UTC)
:::::I've pasted the original content of the root page: [[IMHA Research Archives#Original page]] (i.e., prior to the content being removed and deletion requested) to help understand the context for the sub-pages. In 2018, Saltrabook blanked the page, indicating that the content had been moved elsewhere, and requested page deletion. Marshallsumter then deleted the main page but not the sub-pages. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 01:58, 21 November 2025 (UTC)
::::::I see, so if those subpages are usefull I would keept them, if not I would delete them. I dont see a point of providing free hosting to sombody, by moving many pages to their user space. The question is if we want to host (i.e. to have in the main ns) lists of links elsewhere. I have no opinion on that. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:11, 22 November 2025 (UTC)

: Let me clarify that while many of the subpages are like the example above, [[IMHA Research Archives/Scientific litterature search, storage and use/Zotero]] is different:
:: &quot;A continuous critical and evidence based learning is a core issue in clinical practice, research, teaching, publication and prevention activities. The Zotero Program is just one of many scientific literature management programs, that should be used for these purposes. Of course one can live without such a database but it helps a lot and can save a lot of time that could be used for more interesting issues. Not only that, but it helps to create better publications and knowledge. Without this program it can be very time consuming to publish a scientific article with the requested style for the references. Further in daily practice when you want to collect and cite a few references for a specific evidence in a clinical colloquium and discussion, this program is excellent. Therefore we strongly recommend that all maritime health persons learn how to use this excellent tool in their daily maritime health practice of all different types. There are good online courses for self-instruction on how to use Zotero. For example this one: Zotero fast online course But in order to increase IMHAR´s collective scientific strength in the use of EBM we would like to give training sessions in every possible opportunity, IMHA Symposia, seminars and other types of meetings. The database is useful for personal purposes but especially also for collaborative aims. At the IMHAR meeting in Paris Oct 7th 2016 we will give an introduction to the program by showing how it can be used in the daily practice and discuss strength and weaknesses compared to other similar databases.&quot;
: Even longer is e.g. [[IMHA Research Archives/Scientific litterature search, storage and use/Medicina Maritima - the Spanish scientific maritime health journal]].
: However, that does not mean these should be salvaged. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 07:53, 21 November 2025 (UTC)

== [[Palliative medicine]] ==

Underdeveloped and has not been improved on since 2007. Author inactive. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 21:42, 14 December 2025 (UTC)

:Delete, per nominator [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:16, 22 January 2026 (UTC)
:Yes, I would also expect there to be more and especially that someone would write how to use it. However, it still seems to me to be a useful thing in the sense of a syllabus, so that someone who is interested in the topic knows what information to obtain in order to get a complete picture of the topic. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:55, 16 March 2026 (UTC)

== [[Canadian Wilderness]] ==
{{archive top|Deleted per nom. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:07, 17 May 2026 (UTC)}}
This page doesn't seem to belong to wikiversity. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 09:55, 6 February 2026 (UTC)

:In principle there could be some material useful here but in practice, I don't see what this page is adding as an educational resource. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 12:54, 6 February 2026 (UTC)
:I can see this being a useful resource to a bigger project. Maybe we could move it to the &quot;[[Wikiversity:Drafts|Draft]]&quot; namespace vs. deleting it? —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 13:28, 6 February 2026 (UTC)
::Does anyone plan to work on it? [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 01:59, 8 February 2026 (UTC)
:::Next week the page has it's 17th birthday. Ever now and than someone added to it. With a lot of work it could be a nice encyclopedic article but making it educational .... Merging it may take more work than rewriting it. Move to Draft might be the best option. [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 08:58, 12 February 2026 (UTC)
{{archive bottom}}

== [[LQR Control for an Inverted Pendulum]] ==
Underdeveloped resource, has not been edited for more than a decade. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 08:03, 16 March 2026 (UTC)

:Looks like a test, '''delete'''. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:30, 27 March 2026 (UTC)

== False flag &quot;authority hack&quot; user page deletion ==
{{archive top|'''Not undeleted''', the requester dropped the request. See Wikiversity:Requests for Deletion v. 2803217.--[[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:36, 10 May 2026 (UTC)}}
'''Undeletion requested'''

Hi, Juandev marked my user page as &quot;spam&quot; and &quot;authority hack&quot;, and deleted it. 

First, I asked him for help with &quot;time limit for new users&quot;, and he replied - I should admit I dont know, what is &quot;new user limit&quot;, but if filter blocks your page because of certain external link, you may force to save anyway and sometimes it works. It should not work, when the website is blacklisted. As of now, I am not seeing you to save page in main namespace, so try to save it without external links first. 

Then he wrote me another message: Well, I have analyzed your contribution to Wikiversity and I should point out here, that this project is not a place for advertising, so there is no way of promoting your books and authority this way. - probably referring to the intro of my About me page where I present me and my work. 

Before I could explain him the difference between the neutral information and advertising and promotion, he deleted my user page. 

Here is my answer I posted to the discussion today: 

: Hi, my About Me page is just an info page with the neutral as possible presentation of my work.
:
: There is a big difference between informing and advertising. Informing is neutrally stating that something exists and requiring no action, while advertising is a special communication form with intent to cause certain action from readers. For example, click here, click there, order this, buy that.
:
: There is no such intention, form, or terms on my info page. Just neutral information. I don't hide and I am not ashamed that I am write and author, and that is a part of the usual bio, including works. I checked your user page: &quot;I graduated from the Czech University of Life Sciences in Prague and studied information science at the Faculty of Arts of Charles University.&quot; I think that if you had written a book on Life Science, you would have mentioned that as well.
:
: Most of the Info page is about my research and AIPA Method which is a valid contribution to psychology, consciousness studies, identity theory, and personality development. Actually, my paper '''AIPA Method: A Cognitive-Phenomenological Model for Identity Reconstruction and Stabilization in Pure Awareness''' is now in the peer review procedure at Journal of Consciousness Studies.
:
: Here is a part from the Wikiversity AIPA Method page in creation (waiting for the end of the time limit for new users):

: == Introduction ==
: The AIPA Method addresses a gap in contemporary personal development and consciousness science: most evidence‑based approaches (CBT, MBSR, MBCT, standard meditation) operate at the level of mental content—reframing thoughts, observing them, or reducing their impact—rather than at the level of identity structure. In contrast, AIPA targets the structural relationship between the self and the mind, aiming at durable identity reconstruction rooted in Pure Awareness rather than symptom management.
:
: The central research question of the primary AIPA preprint is whether a structured, sequentially staged method can produce permanent identity reconstruction rooted in Pure Awareness, and how such a method compares to established approaches in scope, mechanism, and outcome.
:
: == Theoretical foundations ==
: The AIPA framework is grounded in the cognitive‑phenomenological tradition (e.g., McAdams, Varela, Metzinger, Erikson), contemporary consciousness science on minimal phenomenal experience, and qualitative methods advocacy in psychology. It builds directly on:
:* Empirical work on pure awareness and Minimal Phenomenal Experience (MPE), especially Gamma &amp; Metzinger’s large‑scale study of content‑reduced awareness states.
:* Metzinger’s proposal of minimal phenomenal experience as an entry point for a minimal unifying model of consciousness.
:* Narrative identity and partial‑self models within personality and identity theory.
: Within this backdrop, AIPA proposes Pure Awareness as a distinct, operationally specified state that can become a structural ground of identity rather than a transient meditative experience.
:
: == Experiential empiricism ==
: The empirical foundation of the AIPA Method is explicitly first‑person and experiential, combining:
:* A 22‑year longitudinal autoethnographic self‑study (2003–2025) documenting partial personality episodes, protocol use, and outcomes.
:* A 13‑year prospective verification period with zero self‑reported recurrence of targeted harmful behaviors after a dated stabilization point (1 January 2006).
:* A high‑ecological‑validity “stress test” during acute bereavement, used to examine whether non‑reactive awareness remains stable under maximal provocation.
:* Two independent practitioner cases (an Amazon‑verified report and a structured questionnaire case) providing preliminary convergent signals across cognitive, emotional, behavioral, and identity dimensions.
:
: All central constructs (Pure Awareness, partial personalities, the Switch, identity stabilization) are operationalized with explicit phenomenological and behavioral criteria intended to enable replication and future third‑person measurement.
:
: I believe this is a valid contribution to Wikiversity.
:
: Best regards, Senad [[User:Senad Dizdarević|Senad Dizdarević]]


I suggest you check the deleted user page, and see for yourself if it is &quot;spam&quot; and &quot;authority hack&quot;, or a legit author's page with one paragraph short presentation, while the rest of the page is about my research project. 

Thank you for undeleting my user page, so I can use it. 

Best regards, 

Senad Dizdarević [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:26, 2 April 2026 (UTC)

:Hi Senad,
:Welcome to Wikiversity.
:It looks like you tried adding similar content to Wikipedia and ran into similar difficulties over there ([[w:User talk:Senad Dizdarević]])? Perhaps that is what has led to you Wikiversity?
:Basically, if you'd like to collaborate and help build open educational resources, feel free to contribute to Wikiversity. But if the primary motivation is to promote your autobiographical work you're probably going to run into challenges.
:Sincerely,
:James
:-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:11, 3 April 2026 (UTC)
::James, Hi, and thank you for your answer. 
::Yes, in 2025, I created the autobiographic page on Wikipedia, which was removed because of the links to my books on Amazon. To admin, I explained that I did not know the rules, and agreed that page is removed. Now I know that somebody else must write a Wikipedia page for you. 
::On the deleted user page on Wikiversity, there were no links to Amazon or any other form of promotion, just neutral as possible basic presentation of my writing (one sentence) and current project (the rest of the page). 
::I created Wikiversity page to present my AIPA Method project, to invite researchers to read it, give their opinion, and conduct empirical researches in their institutions. Now, it is in a theoretical phase, and needs more empirical testing. 
::Best regards, 
::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:03, 3 April 2026 (UTC)
:::It looks to me like the primary motivation for contributing to Wikiversity is to drive traffic / search engine ranking to your website?
:::* [[User:Senad Dizdarević]]
:::* [[AIPA Method]]
:::-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 01:36, 4 April 2026 (UTC)
::::No, it is not. There is no link to my website, so &quot;driving traffic to my website&quot; is not possible. 
::::For your educational purposes: 
::::Copilot &quot;AI:  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:38, 4 April 2026 (UTC)
:::::So do you still insist of undeleting your former version of your userpage if you have created the new one? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:15, 6 April 2026 (UTC)
::::::No, because in the moment of undeletition, somebody could delete it again, and so on. Thank you for not deleting my new user page, as it is made in your user page image.  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 08:59, 6 April 2026 (UTC)

{{archive bottom}}

== Undeletion request ==

It was deleted by an admin without discussion and with untrue rationale. If people take offense with the question that doesn't mean it's not a valid question and the page was good. Please undelete the Wikidebate page [https://web.archive.org/web/20250810030352/https://en.wikiversity.org/wiki/Is_it_likely_that_Earth_has_been_visited_by_aliens_millions_of_years_ago%3F Is it likely that Earth has been visited by aliens millions of years ago?]

There are lots of sources on the subject, the wikidebate is sourced very well compared to other wikidebates and wikiversity pages, and the page is educational, useful and of good quality. [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 23:57, 10 April 2026 (UTC)

:Page: [[Is it likely that Earth has been visited by aliens millions of years ago?]]
:Ping: [[User:Atcovi|Atcovi]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:21, 11 April 2026 (UTC)
:There is no need for a discussion for straight garbage-level, pseudoscientific content.
:For '''Is it likely that Earth has been visited by aliens millions of years ago?''', the flaws for this page wouldn't even take someone more than a few minutes to assess:
:* Essentially, the &quot;pro&quot; arguments unproven claims being derived from irrelevant, established facts (basically: &quot;it is likely aliens have came because Earth has existed for so long [sources proving Earth's longevity]&quot;). These are not serious, scientifically-backed arguments - these are non sequiturs. It's as if I said Wikipedia has existed longer than my existence on Earth ([https://d1wqtxts1xzle7.cloudfront.net/74351725/eyJoIjogImZiODhmYzNkODU1N2UxMWExYzUyODJiYzgzZTRmZDM4OTBjODY5YWMzMjA3NDNmOWEyZTA0ZTU3ZGYwZjAyYTkiLCAidSI6ICJodHRwczovL3B1cmUuaHZhLm5sL3dz-libre.pdf?1636354596=&amp;response-content-disposition=inline%3B+filename%3DCritical_Point_of_View_A_Wikipedia_Reade.pdf&amp;Expires=1775872055&amp;Signature=GqbUZboYRvUYWi~aW40LT5eZSHrLuDL3o0-DxAH8vSvcJcGAuyByZWLF2oHTY6GlB72TqvZxpE-v9d4gvsA6myriYqO~QQQZgWxjT2JXjUWC-yiPcTF4l~lroJSi4dY0v9eKiBcU03l-aeUdrX8~UPfi0TfW0IhsmzH-VBR6X6FrzRpIqc6uM6n9YXfr5FRB3aCqqokU690af3n0Hguaub1Zgmh9qjYYqzBS0VOOHjKTTEQnDuadX3jl5CQeXYTaeCC3H0hMeVwHlratbrnuFEKC1aN0-5znCUoSzMEg21ECzGPTrSDM1W05dcK-u0ZTCeUGKAuC-2yRFL3sY46MIw__&amp;Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA#page=157 reputable source proving ''this'' fact]), therefore it's likely that my birth took place solely for the sake of me experiencing Wikipedia (0 backing). It makes no sense and no person with at least a high school-level of intelligence would take this seriously. 
:* What is worse is that the user is being misleading with their &quot;[the page is] sourced very well&quot; claim. The sources ''themselves'' don't even back up the claims. It's just used as proof for an established concept, where the user then uses this established concept to jump to an unsupported, laughable conclusion that is pulled out of thin air. It's utterly ridiculous to even consider such a page for mainspace since it clearly violates our [[Wikiversity:Verifiability]] policy. This is, once again, pseudoscientific content that has caused our website to reduce in quality over the last few years. 
:* Going source by source, we can see that:
:#[https://web.archive.org/web/20250918011642/https://timesofindia.indiatimes.com/blogs/thebigd/compress-earths-history-into-24-hrs-humans-came-at-1158-pm-yet-killed-70-of-wildlife/ ‘Compress Earth’s history into 24 hrs. Humans came at 11:58 pm, yet killed 70% of wildlife’] is literally just a blog post which doesn't even mention aliens or extraterrestrial life. It just talks about Earth's history in accordance with the 24-hour metric of time, and the author tries to use this article as a 'piece in the puzzle' of aliens &quot;possibly&quot; visiting Earth... which, once again, is unsupported and is not backed up anywhere in the article.
:#[https://web.archive.org/web/20250808053249/https://news.cornell.edu/stories/2023/11/jurassic-worlds-might-be-easier-spot-modern-earth The Cornell article does not even remotely support the idea that &quot;aliens visited Earth&quot;]. It mentions a ''chance'' of &quot;life there [a habitable exoplanet] might not be limited to microbes, but could include creatures as large and varied as the megalosauruses or microraptors that once roamed Earth.&quot;, but again, no justification to take this article as proof that &quot;aliens may have visited us!&quot;. There's no mention of aliens visiting Earth anywhere in the article. Once again this is only proving the background premise, but not the unsupported, nonsensical &quot;alien likelihood&quot; argument that the author of this garbage page is trying to push so desperately.
:#The Parker Solar Probe WP article does not even mention aliens either. It follows the same issues as the previous argument.
:And the other page this user complained about [https://en.wikiversity.org/wiki/User_talk:Atcovi#Deletion_of_educational_page_because_of_personal_opinion on my talk page] holds almost similar, maybe even more fatal mistakes, than this one. It has nothing to do with &quot;taking offense&quot;, this is just low-quality, garbage content. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 00:56, 11 April 2026 (UTC)
::Why do you think pro claims are required to be proven? It's possible to object to them and these are arguments, not contextualized to be statements of proven facts. And it's not a strange or unreasonable argument to make that since Earth has existed for long, it's more likely that aliens have come here in the past than in recent times or the near future. Instead of insulting others' intelligence, maybe engage with the actual reasoning rather than censoring it away. And there are lots of sources, such as [https://interestingengineering.com/science/alien-civilizations-may-have-visited-earth-millions-of-years-ago-study-says Alien Civilizations May Have Visited Earth Millions of Years Ago, Study Says] etc etc. The sources are used for the arguments themselves individually. [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 12:30, 11 April 2026 (UTC)
:::Because, once again, this is not a site that caters to rampant debating for the sake of &quot;we need to employ rationality and logic to solve the world's problems&quot;, we have policies that we need to fulfill. The claims made in the pro argument clearly do not meet [[Wikiversity:Verifiability]], since you cannot verify these arguments with the sources because they are not relevant. 
:::''&quot;And it's not a strange or unreasonable argument to make that since Earth has existed for long, it's more likely that aliens have come here in the past than in recent times or the near future.&quot;'' The point being is that these arguments are not supported by the sources. Even the article you mention poses the idea as a hypothetical model. This is just you twisting the article to fit your unsupported narrative. I'll bring direct quotes for you to show why the linked article does not help you:
:::* ''One problem the researchers do make sure to point out is that '''they are working with only one data point: our own behaviors and capabilities for space exploration'''. “We tried to come up with a model that would involve the fewest assumptions about sociology that we could,” Carroll-Nellenback told Business Insider. '''We have no real way of knowing the motivations of an alien civilization'''.'' --&gt; proves that this is just speculation and no evidence-based arguments have been provided for the idea that aliens likely visited Earth.
:::And I'm not sure if you read my entire response, but I ''did'' engage with your &quot;actual reasoning&quot; and exposed its weaknesses and lack of adherence to Wikiversity policies. If we allowed content that was just filled with non sequiturs we would have content that fails Wikiversity's educational objectives and reduces the overall quality of this website, hence why such a harsh stance needs to be taken. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 13:50, 11 April 2026 (UTC)
::::Thanks for proving that the Wikimedia ecosystem is unfit to deliberate on controversial topics. The question is entirely valid and the content is far better sourced than nearly all Wikidebates and has no genuine flaws. The only possible issue with it as far as I can see is that now that Wikidebates has been paused people can't add objections if they do have sth specific to say about the topic that's not already included on that page which already had plenty of Cons and objections.
::::The page was more educational than most of Wikiversity and it was well-sourced – wikidebates was for arguments so people were invited to make arguments based on sourced things or outlined logic and the page met [[WV:V]] and most pages on Wikiversity aren't sourced as good. Doesn't look like people can see beyond their biases and personal views here but that's more evident in the marginalization and deletion of wikidebates and the low activity in that project than these selective deletions. A constructive thing to do would be to add reasoned Cons and objections not yet on the page and people had plenty of time to do that. There are and will be other sites for free constructive rational adversarial deliberation (not a big loss in that sense). [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 16:31, 22 April 2026 (UTC)
:::::Thank you for failing to address any of my arguments and going on an unrelated, nonsensical tangent that has nothing to do with the discussion. Once you start producing work that aligns with Wikiversity's content policies instead of typing up laughable, pseudoscientific garbage, then maybe your work can be accepted and not removed. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 16:59, 22 April 2026 (UTC)
::::::I suggest you stop ridiculing things and learn respectfully forming genuine points about the subject at hand. {{tq|the idea as a hypothetical model}} but please learn first about what arguments are and why they're not the same as a statement of objective proven fact. [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 17:18, 22 April 2026 (UTC)

==Pages by Harold Foppele==
[[User:Harold Foppele]] is locally blocked indefinitely and globally banned for sockpuppetry. There were also WMF and local community concerns expressed about copyright violation and AI (over)use. As a result, I think the Wikiversity pages created by this account warrant review with regard what should be deleted, what should be retained etc.:
* [[Completing the square]]
* [[Number of independent spatial modes in a spherical volume]]
* [[Quantum]]
** [[Quantum/Andrew N. Jordan]]
* [[Quantum A Matter Of Size]]
* [[Quantum A Spooky Action at a Distance]]
* [[Quantum: A Walk Through the Universe]]
* [[Quantum Computing Algorithms in the NISQ Era]]
* [[Quantum Formulas Collection]]
* [[Quantum harmonic oscillator]]
* [[Quantum Matter Elements and Particles]]
* [[Quantum mechanics]]
** [[Quantum mechanics/Timeline]]
* [[Quantum mechanics learning module]]
* [[Quantum mechanics measurements]]
* [[Quantum Noisy Qubits]]
* [[Quantum optics beam splitter experiments]]
* [[Quantum: The Secret of Cohesion: How Waves Hold Matter Together]]
* [[Quantum Ultra fast lasers]]
* [[Speed of sound experiments]]
* [[User:Harold Foppele]]
-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 08:12, 17 May 2026 (UTC)

:'''Delete all''' Not worth keeping. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 08:27, 17 May 2026 (UTC)</text>
      <sha1>76sl3deow70yyjuwpa9m6fbguo8bwi6</sha1>
    </revision>
    <revision>
      <id>2809912</id>
      <parentid>2809904</parentid>
      <timestamp>2026-05-17T11:25:02Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <comment>/* Pragmatics/History */ Deleted</comment>
      <origin>2809912</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="55871" sha1="ih7dlhmqlbgdr9prz7yboonc8yhcu23" xml:space="preserve">{{/header}}
[[Category:Wikiversity deletion]]

__TOC__

== [[Korean/Words]] ==
(I go to RfD instead of ''proposed deletion'' since many pages are affected.)

I proposed to quasi-delete, i.e. '''move to userspace''' of the main (or sole?) creator, {{User|KYPark}}.

The page is organized a little bit like a dictionary. It makes it redundant to Wiktionary except that Wikiversity allows original research and there does seem to be original research there. Thus, its being organized as a dictionary would alone not necessarily be a problem.

Where I see a problem is in the organization and execution/implementation. Consider [[Korean/Words/가다]], which seems rather typical of the subpages (some subpages are like categories and transclude the pages for individual words):
* On the putative definition line, there is this: &quot;한곳에서 다른 곳으로 장소를 이동하다&quot;, apparently(?) in Korean. That does not seem to fit well into the ''English'' Wikiversity.
* There seems to be some original research into etymological relations between Korean and European languages in the &quot;Comparatives&quot; section (from what I recall, the English Wiktionary rejected this kind of content from KYPark). Admittedly, it is marked using &quot;This is a primary, secondary and/or original Eurasiatic research project at Wikiversity&quot;, so it could be tolerable, but even so, one has to wonder whether Wikiversity wants this kind of fringe science/research or outright pseudo-science.
** Fringe science: fringe physics has been moved to user space before. This would be fringe etymology. But then, original research is allowed.

Deletion is not required; moving to user space suffices, I think. Alternatively, one could at least rename the pages to make it clear from the title that this is not Wikiversity voice but rather KYPark voice, e.g. &quot;Korean/Words (KYPark)/...&quot; or  &quot;Korean/Words/KYPark/...&quot;  (recall the &quot;Fedosin&quot; pages featuring the name &quot;Fedosin&quot;).

Methodology: I see almost no methodological notes spanning the words at [[Korean/Words]]. And yet, if this is original research inventing new etymological connections, surely there should be some general considerations/analysis on how to proceed and how that manner of procedure differs from mainstream etymology?

Prefix index (max 200 items?):
{{Small START}}
{{Special:Prefixindex/Korean/Words}}
{{Small END}}

--[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 09:33, 24 September 2025 (UTC)

:I would keep it. If there is a course of Korean, why not to have a resesearch on Korean vocabulary? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 19:53, 16 October 2025 (UTC)
:: I propose to dismiss the above input: 1) it does not contain any argument, except for a question, and a question is not an argument (it can be so reinterpreted, but that includes additional burden on the interpreters, in interpreting it the wrong way); 2) it ignores all the issues I have raised, including that there is something like definition lines in Korean, in this ''English'' Wikiversity. To answer the question asked: there can be a research on Korean vocabulary in the mainspace, but not one showing the defects I identified above. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:35, 15 November 2025 (UTC)
:I've reviewed a sample of approximately 20 of the Korean/Words sub-pages and lean towards moving to user space because:
:* The pages appear to be an idiosynchratic collection of etymological pages about Korean language
:* There is minimal English instruction which is problematic for English Wikiversity
:* There is no explanation of research method
:* There is no educational rationale
:-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:31, 22 November 2025 (UTC)
:Well, since the original creator has indef I change my mind and I would '''delete''' it. The case is nobody knows how to continue with the research and if we move it to the userspace, the user cannot improve it eihter. What the original user can do to request admin, to send them a contentent to their email for example if they really want to improve the resource elsewhere. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:38, 11 March 2026 (UTC)

== [[Enhancing Web Browser Security through Cookie Encryption]] ==
To avoid further conflict with the user who entered this text into Wikiversity, I am opening a RFD request.

I am not sure about how to proceed, although I am inclined to move it out of mainspace = quasi-delete. I am looking forward to get input from others, especially curators and custodians. Some considerations:

1) There is perhaps no more appearance/suspicion of copyright violation, now that the ResearchGate (RG) article (of which this is a copy, perhaps an incomplete copy?) carries a license.

2) The article is not a complete replica from RG: at a minimum, it lacks images. The inserter could have continued editing the page in his user space before he uploads images, that is, before he finalizes the page for consumption, but that did not happen. I did not check whether the text is an exact one-to-one match; the article does not indicate anything in that regard.

3) The principle implied seems to be this: users should feel free to duplicate non-peer-reviewed articles from RG in English Wikiversity, perhaps to increase the Google search and LLM yield. I find this problematic, in part for the duplication. I would say: choose a venue and publish it there. If RG is not good enough for you as a publishing venue, choose Wikiversity instead, but not both?

4) There are some features that appear unduly promotional. There is a link to a dot com home page of the inserter of the article. I dot not know how we handle or should handle this, whether prohibit such a link, etc. This is perhaps not so much a call to quasi-deletion but a call to make it less promotional.

5) I cannot determine the value of such an article. It seems to be a pseudo-article describing someone's browser extension. Can someone do a better analysis?

--[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:48, 8 October 2025 (UTC)

:2) Images for Wikicommons are being created, it will take a lot of time. and the text is not an exact one-to-one match
:3) I also mentioned that It was being created so that it is more accessible from mobile phone, which is not possible in RG or in Zenodo
:Let me clarify the purpose of uploading it to different platforms
:Zenodo - registration and to link DOI
:RG - Self Archiving 
:Wikiversity - Accessible by anyone from any device. LLMs may get trained on Wikiversity data or use these data for indexing 
:5) The paper is a result of a research project which involved a browser extension which was built to test the theory.  [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 01:34, 9 October 2025 (UTC)
:: I find the practice here of publishing non-identical but similar text (&quot;the text is not an exact one-to-one match&quot;) with almost the same title to be problematic. I cannot imagine this is a recommended practice in academic publishing. At a minimum, somewhere near the top, the page should say something like the following: &quot;This text is based on article ___ published at ___ but is not identical. The author of the differences/changes is ___.&quot; Everything else leads to an undesirable confusion. In academic publishing, the title of an article serves as key part of identification of the artifact.
:: As I said before, I seen nothing particularly academic article-like about the page except for external/superficial signs. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:30, 9 October 2025 (UTC)
:::That Article has been published under CC BY SA 4.0
:::And I am one of the author of the article. That gives me right to modify text and publish it under a similar name. However, I will add the disclaimer text that you have suggested. I hope that helps.  [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 06:07, 9 October 2025 (UTC)
:::: It may give you that right from the ''copyright'' perspective, but perhaps not from ''academic publishing integrity'' perspective. Unfortunately, I do not have any guideline handy; I am merely following my common (or not so common) sense. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:32, 9 October 2025 (UTC)
:: I would like to ask: was this article guided by someone from an academic institution, such as a university? Is it reviewed at least in some weak sense? --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:39, 9 October 2025 (UTC)
:::Yes, This article has been reviewed by two academic professors, their names are also listed as co authors.
:::First, a project guide would help us with selecting a topic and with the document 
:::Second, an Internal examiner would go through our experiment and approve it
:::Finally, External Examiner would examine the documentation and verify it. 
:::We were required by these professors to put their name under contributions [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 05:48, 9 October 2025 (UTC)
:: Let me explicate the promotional potential of such a page a bit: one can go to the page of the article in Wikiversity --&gt; https://tomjoejames.com/ --&gt; HitMyTarget (a commercial, profit-making entity?) Why would the link be to a commercial web site rather than an academic page, or perhaps a LinkedIn account, which I think the person has? There could also be no link at all; a search for the name would turn out something in Google as well. But providing a direct link would drive users/viewers toward that website much stronger since otherwise the viewer of the page would have to open a new Google search window or the like. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:45, 9 October 2025 (UTC)
:::It is evident that the website is not even close to being complete. 
:::I will be creating a separate page under the same domain name specifically for people to contact me.
:::The url would probably be defined as tomjoejames.com/contact-me/
:::I haven't decided yet. But that is my personal website.
:::If the community requires me to remove it, I will. But personally I think people who are from here most likely to click the link to know more about me or to contact me. Either way I think my personal website serves the purpose. 
:::As for the HitMyTarget, it can be traced from any of my links. From my research gate profile, linkedin page or even my own userpage.
:::On the article I did not add any promotional content about myself, I hyperlinked only my own name. I do not know how that is promotional. [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 06:04, 9 October 2025 (UTC)
:::: I am pausing any further responses from me to see whether anyone else has any input. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:30, 9 October 2025 (UTC)
:What does it mean &quot;There is perhaps no more appearance/suspicion of copyright violation&quot;? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 19:57, 16 October 2025 (UTC)
:I have accepted VRT permission per [[ticket:2025100410001149]] FYI. [[User:Matrix|Matrix]] ([[User talk:Matrix|discuss]] • [[Special:Contributions/Matrix|contribs]]) 11:00, 28 October 2025 (UTC)
::Thank you Matrix [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 12:43, 28 October 2025 (UTC)
:I would '''delete''' it. 1) it states its a learning resource. It could not be a learning resource as not rewieved original research. 2) It is not an ongoing research, nor the research was performed on Wikiversity - wv is not a preprint or article database. Maybe it could be moved elsewhere withn Wikimedia domain, but I dont know where. So I would delete it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:56, 20 November 2025 (UTC)
::I would '''keep it.''' Like Dan had pointed out,  we do have article-like pages in Wikiversity, and this is not just a random pseudo science article but an article that is a report of an final year project, it has been reviewed by 3 professors whose name has been mentioned at the very beginning.   [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 14:50, 21 November 2025 (UTC)
:::I think it is not good to rate pages by appearance. It can be done on other Wikimedia projects, but it cannot be done on Wikiversity, because Wikiversity does not create a static format for presenting information, but is focused on the goal and process. Unfortunately, the goal and process do not have a uniform format. While a target article on Wikipedia or an entry on Wiktionary have some standard target format, Wikiversity does not. That is why I personally rate pages according to the goals and their assessment. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:05, 22 November 2025 (UTC)

Further reading for this nomination: [[S: Wikisource:Proposed_deletions/Archives/2025#Index:Cookie_Encryption.pdf]]; EncycloPetey handled the matter. Let me quote his wisdom on Zenodo (which I lack): &quot;This is tied to a PDF on Commons that was uploaded as &quot;own work&quot; with a CC license and a doi link to Zenodo, with no indication of where this paper was published or if it was published. Zenodo is not a publisher; it is a site for storing research and sharing papers. If Zenodo is the only place this was &quot;published&quot; then it was effectively self-published. --EncycloPetey (talk) 16:14, 15 September 2025 (UTC)&quot;

--[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 08:55, 9 October 2025 (UTC)

:Can you clarify what point are you trying to state? Didn't I already state that the article is published by me? 
:I first created the article in wikisource which I thought would be the perfect place, unfortunately they do not allow self published articles that are not notable. Then I discovered Wikiversity where they allow self published articles. That is why I created the article here. 
:Unlike in wikisource, I did follow guidelines.
:Ever since you deleted the first article, I spent time reading Wikiversity guidelines and I do think that I am following it perfectly.
:I would like to get your suggestions on how should I improve the page,  10 points would be sufficient. 
:Because your goals or intentions are confusing me very much. At first you told me that the article is exactly the same as the preprint in RG and therefore there is no use to it here. And then when I continued to optimize it for Wikiversity, you went ahead and said it is problematic according to recommended academic publishing. 
:Atleast just respond to the points that I have made whether you agree or disagree. So that I clarify and proceed to discuss points that are important and relevant 
:Have you published an research article? If yes, could you send it to me so that I can see the format you have done it [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 10:45, 9 October 2025 (UTC)
:: I am giving a chance/time to other curators/custodians to look at the matter and respond to my inputs. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 11:14, 9 October 2025 (UTC)
:: Incidentally, above I counted 4 questions (or more), 1 request (or more?) and 1 command (or more?). That is a behavior of a commanding entity. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 11:24, 9 October 2025 (UTC)

I would '''delete it''''. It's more like an academic communication than a learning resource or research.--[[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:32, 26 October 2025 (UTC)
:: In the above post, I do not see any valid rationale for deletion: we do have article-like pages, in Wikijournals and also e.g. in [[Physics/Essays/Fedosin/Stellar Stefan–Boltzmann constant]]. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 08:59, 3 November 2025 (UTC)
:::But I do, see above. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:56, 20 November 2025 (UTC)

:it is a '''student research paper''' forming part of a learning resource on web security and encryption.
:The project was conducted as part of a final-year university course and documented as a practical study on cookie encryption and it has been reviewed by three professors. However, I will be creating a sub page for the article to elaborately describe the experiment that we have conducted and the results we got.    [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 15:57, 26 October 2025 (UTC)
::And why should w host research papers? Wikiversity is not an academic Journal nor repository. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:06, 22 November 2025 (UTC)
:::I do not wish to go through this same argument once again, I've already answered to this question several times in Dan's talk page, Colloquium. you can refer them. I am not hosting the research paper here, I have already hosted the pdf in the ResearchGate, I have published a text version in the wikiversity so that it may be useful for others. Unless you can show me how that article is totally useless, I would like to '''keep''' the article in the wikiversity.    [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 10:13, 22 November 2025 (UTC)
::::And thats the point I am having. Wikiversity is not paper repository. The only way is to publish it via WikiJournal, but they want it for Wikipedia usually. Why wikiversity should be a duplication of ResearchGate, Academia or Zenodo?
::::What I can read on [[Wikiversity:What is Wikiversity?]] policy is, that Wikiversity research &quot;...includes interpreting primary sources, forming ideas, or taking observations.&quot; The article doent look to fall into this. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:43, 22 November 2025 (UTC)
:::::Well, then how come you missed the term &quot;Learning Projects&quot;? As Jtneill had pointed out, this is a legitimate learning project. And also, I do have the VRT permission to host this article on Wikiversity.  [[ticket:2025100410001149]] . besides ResearchGate is an self-archiving platform. the document version in it is not accessibly to screen readers (usually disable people use them), Translators, and also for the mobile readers. therefore I do have valid reasons to publish this article on wikiversity. 
:::::# It is a learning project, therefore according to WIkiversity Policy, It qualifies. 
:::::# I have an explicit VRT permission to host this article on Wikiversity
:::::# Versions that are published in RG, Zenodo are documents, and they are not accessible by screen readers or mobile users. Therefore it is imperative that an article version of this paper exist on here. 
:::::Therefore this article qualifies to stay here on Wikiversity.  [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 11:22, 22 November 2025 (UTC)

'''Keep'''. This is a legitimate student learning project that may be of use to others. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:51, 22 November 2025 (UTC)

== [[Pragmatics/History]] ==
{{archive top|Deleted. Other related resources have been deleted. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:24, 17 May 2026 (UTC)}}
Another KYPark page and subpages with unclear organization scheme. Contains fairly many redlinked items. See also [[User:KYPark/Literature]], perhaps a similar concept. Unlikely to be really useful for others but KYPark. '''Move to user space'''.

As an alternative, moving to [[History of Pragmatics (KYPark)]] would make sense to me: the topic is identified using a natural-language phrase (instead of the relatively unnatural slash) and the responsible editor is indicated so that the reader knows whether to look or not. And for those who oppose the brackets (which I like): [[History of Pragmatics/KYPark]]. Or also: [[KYPark/History of Pragmatics]]. But then, searches in mainspace will see that content and the question is whether that is good. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:21, 15 October 2025 (UTC)

:What about to propose the user to write some guidelines, how other can participate instead of deleting it? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:03, 16 October 2025 (UTC)
:: I plan to move the pages to userspace as I proposed. If someone wants to ask KYPark to address the problems, they should feel free. There will be plenty of time for KYPark to address the problems while the material is in user space. After the problems are addressed, the material can be moved back to mainspace. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:38, 15 November 2025 (UTC)
:So I would '''delete''' it. In the blocked user space its useless. The user cannot improve it and Wikiversity is not free hosting service for personal pages. My believe is, that there should be just a few working pages in the users spaces. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:30, 11 March 2026 (UTC)

'''Move'''. Insufficient statement of learning objective or connection to related learning resources with insufficient current activity to stay in main space. The page was originally [[History of pragmatics]] but was moved by Dave B. Therefore, I suggest moving to [[User:KYPark/History of pragmatics]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:57, 22 November 2025 (UTC)
{{archive bottom}}

== [[IMHA Research Archives]] ==
I propose to '''move to userspace''', including the subpages. I struggle to understand how Wikiversity readers are supposed to benefit from the material here and in the subpages. In the log, there is e.g. '10 February 2019 Marshallsumter discuss contribs deleted page IMHA Research Archives (content was: &quot;{&lt;nowiki/&gt;{Delete|Author request}} Thanks! -&quot;)', so the page was deleted before, but not the subpages.

We could also delete all the material if we have strong enough suspicion too much of it is copyright violation. In any case, moving to user space improves the matter a little by moving the content away from Google search. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 13:38, 9 November 2025 (UTC)

:Looking at some sub-pages, they can be deleted e.g., because they only consist of broken links or are largely empty. I deleted a couple but haven't been through all to check. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:27, 10 November 2025 (UTC)

As an example, let me give the wikitext content of [[IMHA Research Archives/3. Scientific litterature search, storage and use]]:
&lt;pre&gt;
==[[/Medicina Maritima - the Spanish scientific maritime health journal/]]==

==[[/PubMed/]]==

==[[/Google and Google Scholar/]]==

==[[/Zotero/]]==

==[https://www.dropbox.com/sh/d91z7bcyelfvk42/AAAkIvjtBnnFMbiU9ZLOdVL9a/Andrioti_database%20sources0310.pptx?dl=0 Maritime health web portal ressources ]==
&lt;/pre&gt;
The wikilinks are red; the external link to dropbox says &quot;You don't have access&quot;. This was made in 2016. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 09:04, 11 November 2025 (UTC)

:I suggest delete -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 03:27, 12 November 2025 (UTC)
:: I think we should avoid deletion as much as possible, instead moving to user space (bar copyvio, ethics violation, etc.). This is a good general principle. It greatly improves auditability and makes it so much easier for anyone to request undeletion since they know what content they are requesting for undeletion. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 09:52, 12 November 2025 (UTC)
:::Do not recreate Wikiversity from the educational and research project to the personal blog. That will lead to the cancelation of it by WMF. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:44, 20 November 2025 (UTC)
:::: The English Wikiversity has a long tradition of moving problematic content to user space, as per evidence collected at [[User:Dan_Polansky/About Wikiversity#Moving pages to userspace]]. If Wikimedia Foundation finds this problematic, they can start a discussion in Colloquium and state their concerns. They do not need to make explicit threats at first; they can start a discussion and explain why it is problematic. They can even do it from an anonymous IP and provide a well-articulated reasoning. And anyone else can start a discussion in Colloquium to change this tradition. I do not see why we should not want to change that tradition based on well-articulated, compelling reasoning. I see no reason why Juandev should be making threats instead of them, on a per RFD basis. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:58, 21 November 2025 (UTC)
:::: If Juandev is ''sincere'' about deleting very-low-value items ''from user space'', he should perhaps demonstrate that by asking his pages like [[:cs:Uživatel:Juandev/Problémy/Kov/Repase dvířek elektroskříně]] to be deleted; otherwise, I register a ''glaring inconsistence''. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 07:43, 21 November 2025 (UTC)
::What was the original delate page about @[[User:Jtneill|Jtneill]]? I guess that would be crucial for the decission. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:48, 20 November 2025 (UTC)
:::@[[User:Juandev|Juandev]] the couple of pages I checked and deleted were much like @[[User:Dan Polansky|Dan Polansky]] posted above i.e., headings with empty sections and/or broken links but no substantive content. But I think each sub-page needs checking. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 21:59, 20 November 2025 (UTC)
::::So I'm saying that the main page usually determines what the other pages are for. But if I don't know the page because it's been deleted, or why was deleted (deletion based on the founder's request is probably not the rule), it's hard to judge. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 22:16, 20 November 2025 (UTC)
:::::I've pasted the original content of the root page: [[IMHA Research Archives#Original page]] (i.e., prior to the content being removed and deletion requested) to help understand the context for the sub-pages. In 2018, Saltrabook blanked the page, indicating that the content had been moved elsewhere, and requested page deletion. Marshallsumter then deleted the main page but not the sub-pages. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 01:58, 21 November 2025 (UTC)
::::::I see, so if those subpages are usefull I would keept them, if not I would delete them. I dont see a point of providing free hosting to sombody, by moving many pages to their user space. The question is if we want to host (i.e. to have in the main ns) lists of links elsewhere. I have no opinion on that. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:11, 22 November 2025 (UTC)

: Let me clarify that while many of the subpages are like the example above, [[IMHA Research Archives/Scientific litterature search, storage and use/Zotero]] is different:
:: &quot;A continuous critical and evidence based learning is a core issue in clinical practice, research, teaching, publication and prevention activities. The Zotero Program is just one of many scientific literature management programs, that should be used for these purposes. Of course one can live without such a database but it helps a lot and can save a lot of time that could be used for more interesting issues. Not only that, but it helps to create better publications and knowledge. Without this program it can be very time consuming to publish a scientific article with the requested style for the references. Further in daily practice when you want to collect and cite a few references for a specific evidence in a clinical colloquium and discussion, this program is excellent. Therefore we strongly recommend that all maritime health persons learn how to use this excellent tool in their daily maritime health practice of all different types. There are good online courses for self-instruction on how to use Zotero. For example this one: Zotero fast online course But in order to increase IMHAR´s collective scientific strength in the use of EBM we would like to give training sessions in every possible opportunity, IMHA Symposia, seminars and other types of meetings. The database is useful for personal purposes but especially also for collaborative aims. At the IMHAR meeting in Paris Oct 7th 2016 we will give an introduction to the program by showing how it can be used in the daily practice and discuss strength and weaknesses compared to other similar databases.&quot;
: Even longer is e.g. [[IMHA Research Archives/Scientific litterature search, storage and use/Medicina Maritima - the Spanish scientific maritime health journal]].
: However, that does not mean these should be salvaged. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 07:53, 21 November 2025 (UTC)

== [[Palliative medicine]] ==

Underdeveloped and has not been improved on since 2007. Author inactive. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 21:42, 14 December 2025 (UTC)

:Delete, per nominator [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:16, 22 January 2026 (UTC)
:Yes, I would also expect there to be more and especially that someone would write how to use it. However, it still seems to me to be a useful thing in the sense of a syllabus, so that someone who is interested in the topic knows what information to obtain in order to get a complete picture of the topic. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:55, 16 March 2026 (UTC)

== [[Canadian Wilderness]] ==
{{archive top|Deleted per nom. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:07, 17 May 2026 (UTC)}}
This page doesn't seem to belong to wikiversity. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 09:55, 6 February 2026 (UTC)

:In principle there could be some material useful here but in practice, I don't see what this page is adding as an educational resource. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 12:54, 6 February 2026 (UTC)
:I can see this being a useful resource to a bigger project. Maybe we could move it to the &quot;[[Wikiversity:Drafts|Draft]]&quot; namespace vs. deleting it? —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 13:28, 6 February 2026 (UTC)
::Does anyone plan to work on it? [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 01:59, 8 February 2026 (UTC)
:::Next week the page has it's 17th birthday. Ever now and than someone added to it. With a lot of work it could be a nice encyclopedic article but making it educational .... Merging it may take more work than rewriting it. Move to Draft might be the best option. [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 08:58, 12 February 2026 (UTC)
{{archive bottom}}

== [[LQR Control for an Inverted Pendulum]] ==
Underdeveloped resource, has not been edited for more than a decade. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 08:03, 16 March 2026 (UTC)

:Looks like a test, '''delete'''. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:30, 27 March 2026 (UTC)

== False flag &quot;authority hack&quot; user page deletion ==
{{archive top|'''Not undeleted''', the requester dropped the request. See Wikiversity:Requests for Deletion v. 2803217.--[[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:36, 10 May 2026 (UTC)}}
'''Undeletion requested'''

Hi, Juandev marked my user page as &quot;spam&quot; and &quot;authority hack&quot;, and deleted it. 

First, I asked him for help with &quot;time limit for new users&quot;, and he replied - I should admit I dont know, what is &quot;new user limit&quot;, but if filter blocks your page because of certain external link, you may force to save anyway and sometimes it works. It should not work, when the website is blacklisted. As of now, I am not seeing you to save page in main namespace, so try to save it without external links first. 

Then he wrote me another message: Well, I have analyzed your contribution to Wikiversity and I should point out here, that this project is not a place for advertising, so there is no way of promoting your books and authority this way. - probably referring to the intro of my About me page where I present me and my work. 

Before I could explain him the difference between the neutral information and advertising and promotion, he deleted my user page. 

Here is my answer I posted to the discussion today: 

: Hi, my About Me page is just an info page with the neutral as possible presentation of my work.
:
: There is a big difference between informing and advertising. Informing is neutrally stating that something exists and requiring no action, while advertising is a special communication form with intent to cause certain action from readers. For example, click here, click there, order this, buy that.
:
: There is no such intention, form, or terms on my info page. Just neutral information. I don't hide and I am not ashamed that I am write and author, and that is a part of the usual bio, including works. I checked your user page: &quot;I graduated from the Czech University of Life Sciences in Prague and studied information science at the Faculty of Arts of Charles University.&quot; I think that if you had written a book on Life Science, you would have mentioned that as well.
:
: Most of the Info page is about my research and AIPA Method which is a valid contribution to psychology, consciousness studies, identity theory, and personality development. Actually, my paper '''AIPA Method: A Cognitive-Phenomenological Model for Identity Reconstruction and Stabilization in Pure Awareness''' is now in the peer review procedure at Journal of Consciousness Studies.
:
: Here is a part from the Wikiversity AIPA Method page in creation (waiting for the end of the time limit for new users):

: == Introduction ==
: The AIPA Method addresses a gap in contemporary personal development and consciousness science: most evidence‑based approaches (CBT, MBSR, MBCT, standard meditation) operate at the level of mental content—reframing thoughts, observing them, or reducing their impact—rather than at the level of identity structure. In contrast, AIPA targets the structural relationship between the self and the mind, aiming at durable identity reconstruction rooted in Pure Awareness rather than symptom management.
:
: The central research question of the primary AIPA preprint is whether a structured, sequentially staged method can produce permanent identity reconstruction rooted in Pure Awareness, and how such a method compares to established approaches in scope, mechanism, and outcome.
:
: == Theoretical foundations ==
: The AIPA framework is grounded in the cognitive‑phenomenological tradition (e.g., McAdams, Varela, Metzinger, Erikson), contemporary consciousness science on minimal phenomenal experience, and qualitative methods advocacy in psychology. It builds directly on:
:* Empirical work on pure awareness and Minimal Phenomenal Experience (MPE), especially Gamma &amp; Metzinger’s large‑scale study of content‑reduced awareness states.
:* Metzinger’s proposal of minimal phenomenal experience as an entry point for a minimal unifying model of consciousness.
:* Narrative identity and partial‑self models within personality and identity theory.
: Within this backdrop, AIPA proposes Pure Awareness as a distinct, operationally specified state that can become a structural ground of identity rather than a transient meditative experience.
:
: == Experiential empiricism ==
: The empirical foundation of the AIPA Method is explicitly first‑person and experiential, combining:
:* A 22‑year longitudinal autoethnographic self‑study (2003–2025) documenting partial personality episodes, protocol use, and outcomes.
:* A 13‑year prospective verification period with zero self‑reported recurrence of targeted harmful behaviors after a dated stabilization point (1 January 2006).
:* A high‑ecological‑validity “stress test” during acute bereavement, used to examine whether non‑reactive awareness remains stable under maximal provocation.
:* Two independent practitioner cases (an Amazon‑verified report and a structured questionnaire case) providing preliminary convergent signals across cognitive, emotional, behavioral, and identity dimensions.
:
: All central constructs (Pure Awareness, partial personalities, the Switch, identity stabilization) are operationalized with explicit phenomenological and behavioral criteria intended to enable replication and future third‑person measurement.
:
: I believe this is a valid contribution to Wikiversity.
:
: Best regards, Senad [[User:Senad Dizdarević|Senad Dizdarević]]


I suggest you check the deleted user page, and see for yourself if it is &quot;spam&quot; and &quot;authority hack&quot;, or a legit author's page with one paragraph short presentation, while the rest of the page is about my research project. 

Thank you for undeleting my user page, so I can use it. 

Best regards, 

Senad Dizdarević [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:26, 2 April 2026 (UTC)

:Hi Senad,
:Welcome to Wikiversity.
:It looks like you tried adding similar content to Wikipedia and ran into similar difficulties over there ([[w:User talk:Senad Dizdarević]])? Perhaps that is what has led to you Wikiversity?
:Basically, if you'd like to collaborate and help build open educational resources, feel free to contribute to Wikiversity. But if the primary motivation is to promote your autobiographical work you're probably going to run into challenges.
:Sincerely,
:James
:-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:11, 3 April 2026 (UTC)
::James, Hi, and thank you for your answer. 
::Yes, in 2025, I created the autobiographic page on Wikipedia, which was removed because of the links to my books on Amazon. To admin, I explained that I did not know the rules, and agreed that page is removed. Now I know that somebody else must write a Wikipedia page for you. 
::On the deleted user page on Wikiversity, there were no links to Amazon or any other form of promotion, just neutral as possible basic presentation of my writing (one sentence) and current project (the rest of the page). 
::I created Wikiversity page to present my AIPA Method project, to invite researchers to read it, give their opinion, and conduct empirical researches in their institutions. Now, it is in a theoretical phase, and needs more empirical testing. 
::Best regards, 
::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:03, 3 April 2026 (UTC)
:::It looks to me like the primary motivation for contributing to Wikiversity is to drive traffic / search engine ranking to your website?
:::* [[User:Senad Dizdarević]]
:::* [[AIPA Method]]
:::-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 01:36, 4 April 2026 (UTC)
::::No, it is not. There is no link to my website, so &quot;driving traffic to my website&quot; is not possible. 
::::For your educational purposes: 
::::Copilot &quot;AI:  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:38, 4 April 2026 (UTC)
:::::So do you still insist of undeleting your former version of your userpage if you have created the new one? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:15, 6 April 2026 (UTC)
::::::No, because in the moment of undeletition, somebody could delete it again, and so on. Thank you for not deleting my new user page, as it is made in your user page image.  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 08:59, 6 April 2026 (UTC)

{{archive bottom}}

== Undeletion request ==

It was deleted by an admin without discussion and with untrue rationale. If people take offense with the question that doesn't mean it's not a valid question and the page was good. Please undelete the Wikidebate page [https://web.archive.org/web/20250810030352/https://en.wikiversity.org/wiki/Is_it_likely_that_Earth_has_been_visited_by_aliens_millions_of_years_ago%3F Is it likely that Earth has been visited by aliens millions of years ago?]

There are lots of sources on the subject, the wikidebate is sourced very well compared to other wikidebates and wikiversity pages, and the page is educational, useful and of good quality. [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 23:57, 10 April 2026 (UTC)

:Page: [[Is it likely that Earth has been visited by aliens millions of years ago?]]
:Ping: [[User:Atcovi|Atcovi]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:21, 11 April 2026 (UTC)
:There is no need for a discussion for straight garbage-level, pseudoscientific content.
:For '''Is it likely that Earth has been visited by aliens millions of years ago?''', the flaws for this page wouldn't even take someone more than a few minutes to assess:
:* Essentially, the &quot;pro&quot; arguments unproven claims being derived from irrelevant, established facts (basically: &quot;it is likely aliens have came because Earth has existed for so long [sources proving Earth's longevity]&quot;). These are not serious, scientifically-backed arguments - these are non sequiturs. It's as if I said Wikipedia has existed longer than my existence on Earth ([https://d1wqtxts1xzle7.cloudfront.net/74351725/eyJoIjogImZiODhmYzNkODU1N2UxMWExYzUyODJiYzgzZTRmZDM4OTBjODY5YWMzMjA3NDNmOWEyZTA0ZTU3ZGYwZjAyYTkiLCAidSI6ICJodHRwczovL3B1cmUuaHZhLm5sL3dz-libre.pdf?1636354596=&amp;response-content-disposition=inline%3B+filename%3DCritical_Point_of_View_A_Wikipedia_Reade.pdf&amp;Expires=1775872055&amp;Signature=GqbUZboYRvUYWi~aW40LT5eZSHrLuDL3o0-DxAH8vSvcJcGAuyByZWLF2oHTY6GlB72TqvZxpE-v9d4gvsA6myriYqO~QQQZgWxjT2JXjUWC-yiPcTF4l~lroJSi4dY0v9eKiBcU03l-aeUdrX8~UPfi0TfW0IhsmzH-VBR6X6FrzRpIqc6uM6n9YXfr5FRB3aCqqokU690af3n0Hguaub1Zgmh9qjYYqzBS0VOOHjKTTEQnDuadX3jl5CQeXYTaeCC3H0hMeVwHlratbrnuFEKC1aN0-5znCUoSzMEg21ECzGPTrSDM1W05dcK-u0ZTCeUGKAuC-2yRFL3sY46MIw__&amp;Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA#page=157 reputable source proving ''this'' fact]), therefore it's likely that my birth took place solely for the sake of me experiencing Wikipedia (0 backing). It makes no sense and no person with at least a high school-level of intelligence would take this seriously. 
:* What is worse is that the user is being misleading with their &quot;[the page is] sourced very well&quot; claim. The sources ''themselves'' don't even back up the claims. It's just used as proof for an established concept, where the user then uses this established concept to jump to an unsupported, laughable conclusion that is pulled out of thin air. It's utterly ridiculous to even consider such a page for mainspace since it clearly violates our [[Wikiversity:Verifiability]] policy. This is, once again, pseudoscientific content that has caused our website to reduce in quality over the last few years. 
:* Going source by source, we can see that:
:#[https://web.archive.org/web/20250918011642/https://timesofindia.indiatimes.com/blogs/thebigd/compress-earths-history-into-24-hrs-humans-came-at-1158-pm-yet-killed-70-of-wildlife/ ‘Compress Earth’s history into 24 hrs. Humans came at 11:58 pm, yet killed 70% of wildlife’] is literally just a blog post which doesn't even mention aliens or extraterrestrial life. It just talks about Earth's history in accordance with the 24-hour metric of time, and the author tries to use this article as a 'piece in the puzzle' of aliens &quot;possibly&quot; visiting Earth... which, once again, is unsupported and is not backed up anywhere in the article.
:#[https://web.archive.org/web/20250808053249/https://news.cornell.edu/stories/2023/11/jurassic-worlds-might-be-easier-spot-modern-earth The Cornell article does not even remotely support the idea that &quot;aliens visited Earth&quot;]. It mentions a ''chance'' of &quot;life there [a habitable exoplanet] might not be limited to microbes, but could include creatures as large and varied as the megalosauruses or microraptors that once roamed Earth.&quot;, but again, no justification to take this article as proof that &quot;aliens may have visited us!&quot;. There's no mention of aliens visiting Earth anywhere in the article. Once again this is only proving the background premise, but not the unsupported, nonsensical &quot;alien likelihood&quot; argument that the author of this garbage page is trying to push so desperately.
:#The Parker Solar Probe WP article does not even mention aliens either. It follows the same issues as the previous argument.
:And the other page this user complained about [https://en.wikiversity.org/wiki/User_talk:Atcovi#Deletion_of_educational_page_because_of_personal_opinion on my talk page] holds almost similar, maybe even more fatal mistakes, than this one. It has nothing to do with &quot;taking offense&quot;, this is just low-quality, garbage content. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 00:56, 11 April 2026 (UTC)
::Why do you think pro claims are required to be proven? It's possible to object to them and these are arguments, not contextualized to be statements of proven facts. And it's not a strange or unreasonable argument to make that since Earth has existed for long, it's more likely that aliens have come here in the past than in recent times or the near future. Instead of insulting others' intelligence, maybe engage with the actual reasoning rather than censoring it away. And there are lots of sources, such as [https://interestingengineering.com/science/alien-civilizations-may-have-visited-earth-millions-of-years-ago-study-says Alien Civilizations May Have Visited Earth Millions of Years Ago, Study Says] etc etc. The sources are used for the arguments themselves individually. [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 12:30, 11 April 2026 (UTC)
:::Because, once again, this is not a site that caters to rampant debating for the sake of &quot;we need to employ rationality and logic to solve the world's problems&quot;, we have policies that we need to fulfill. The claims made in the pro argument clearly do not meet [[Wikiversity:Verifiability]], since you cannot verify these arguments with the sources because they are not relevant. 
:::''&quot;And it's not a strange or unreasonable argument to make that since Earth has existed for long, it's more likely that aliens have come here in the past than in recent times or the near future.&quot;'' The point being is that these arguments are not supported by the sources. Even the article you mention poses the idea as a hypothetical model. This is just you twisting the article to fit your unsupported narrative. I'll bring direct quotes for you to show why the linked article does not help you:
:::* ''One problem the researchers do make sure to point out is that '''they are working with only one data point: our own behaviors and capabilities for space exploration'''. “We tried to come up with a model that would involve the fewest assumptions about sociology that we could,” Carroll-Nellenback told Business Insider. '''We have no real way of knowing the motivations of an alien civilization'''.'' --&gt; proves that this is just speculation and no evidence-based arguments have been provided for the idea that aliens likely visited Earth.
:::And I'm not sure if you read my entire response, but I ''did'' engage with your &quot;actual reasoning&quot; and exposed its weaknesses and lack of adherence to Wikiversity policies. If we allowed content that was just filled with non sequiturs we would have content that fails Wikiversity's educational objectives and reduces the overall quality of this website, hence why such a harsh stance needs to be taken. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 13:50, 11 April 2026 (UTC)
::::Thanks for proving that the Wikimedia ecosystem is unfit to deliberate on controversial topics. The question is entirely valid and the content is far better sourced than nearly all Wikidebates and has no genuine flaws. The only possible issue with it as far as I can see is that now that Wikidebates has been paused people can't add objections if they do have sth specific to say about the topic that's not already included on that page which already had plenty of Cons and objections.
::::The page was more educational than most of Wikiversity and it was well-sourced – wikidebates was for arguments so people were invited to make arguments based on sourced things or outlined logic and the page met [[WV:V]] and most pages on Wikiversity aren't sourced as good. Doesn't look like people can see beyond their biases and personal views here but that's more evident in the marginalization and deletion of wikidebates and the low activity in that project than these selective deletions. A constructive thing to do would be to add reasoned Cons and objections not yet on the page and people had plenty of time to do that. There are and will be other sites for free constructive rational adversarial deliberation (not a big loss in that sense). [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 16:31, 22 April 2026 (UTC)
:::::Thank you for failing to address any of my arguments and going on an unrelated, nonsensical tangent that has nothing to do with the discussion. Once you start producing work that aligns with Wikiversity's content policies instead of typing up laughable, pseudoscientific garbage, then maybe your work can be accepted and not removed. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 16:59, 22 April 2026 (UTC)
::::::I suggest you stop ridiculing things and learn respectfully forming genuine points about the subject at hand. {{tq|the idea as a hypothetical model}} but please learn first about what arguments are and why they're not the same as a statement of objective proven fact. [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 17:18, 22 April 2026 (UTC)

==Pages by Harold Foppele==
[[User:Harold Foppele]] is locally blocked indefinitely and globally banned for sockpuppetry. There were also WMF and local community concerns expressed about copyright violation and AI (over)use. As a result, I think the Wikiversity pages created by this account warrant review with regard what should be deleted, what should be retained etc.:
* [[Completing the square]]
* [[Number of independent spatial modes in a spherical volume]]
* [[Quantum]]
** [[Quantum/Andrew N. Jordan]]
* [[Quantum A Matter Of Size]]
* [[Quantum A Spooky Action at a Distance]]
* [[Quantum: A Walk Through the Universe]]
* [[Quantum Computing Algorithms in the NISQ Era]]
* [[Quantum Formulas Collection]]
* [[Quantum harmonic oscillator]]
* [[Quantum Matter Elements and Particles]]
* [[Quantum mechanics]]
** [[Quantum mechanics/Timeline]]
* [[Quantum mechanics learning module]]
* [[Quantum mechanics measurements]]
* [[Quantum Noisy Qubits]]
* [[Quantum optics beam splitter experiments]]
* [[Quantum: The Secret of Cohesion: How Waves Hold Matter Together]]
* [[Quantum Ultra fast lasers]]
* [[Speed of sound experiments]]
* [[User:Harold Foppele]]
-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 08:12, 17 May 2026 (UTC)

:'''Delete all''' Not worth keeping. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 08:27, 17 May 2026 (UTC)</text>
      <sha1>ih7dlhmqlbgdr9prz7yboonc8yhcu23</sha1>
    </revision>
    <revision>
      <id>2809913</id>
      <parentid>2809912</parentid>
      <timestamp>2026-05-17T11:29:02Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <comment>/* Enhancing Web Browser Security through Cookie Encryption */ Kept</comment>
      <origin>2809913</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="56053" sha1="a5hvbg6frjzwcwpg3t5samv91mcls44" xml:space="preserve">{{/header}}
[[Category:Wikiversity deletion]]

__TOC__

== [[Korean/Words]] ==
(I go to RfD instead of ''proposed deletion'' since many pages are affected.)

I proposed to quasi-delete, i.e. '''move to userspace''' of the main (or sole?) creator, {{User|KYPark}}.

The page is organized a little bit like a dictionary. It makes it redundant to Wiktionary except that Wikiversity allows original research and there does seem to be original research there. Thus, its being organized as a dictionary would alone not necessarily be a problem.

Where I see a problem is in the organization and execution/implementation. Consider [[Korean/Words/가다]], which seems rather typical of the subpages (some subpages are like categories and transclude the pages for individual words):
* On the putative definition line, there is this: &quot;한곳에서 다른 곳으로 장소를 이동하다&quot;, apparently(?) in Korean. That does not seem to fit well into the ''English'' Wikiversity.
* There seems to be some original research into etymological relations between Korean and European languages in the &quot;Comparatives&quot; section (from what I recall, the English Wiktionary rejected this kind of content from KYPark). Admittedly, it is marked using &quot;This is a primary, secondary and/or original Eurasiatic research project at Wikiversity&quot;, so it could be tolerable, but even so, one has to wonder whether Wikiversity wants this kind of fringe science/research or outright pseudo-science.
** Fringe science: fringe physics has been moved to user space before. This would be fringe etymology. But then, original research is allowed.

Deletion is not required; moving to user space suffices, I think. Alternatively, one could at least rename the pages to make it clear from the title that this is not Wikiversity voice but rather KYPark voice, e.g. &quot;Korean/Words (KYPark)/...&quot; or  &quot;Korean/Words/KYPark/...&quot;  (recall the &quot;Fedosin&quot; pages featuring the name &quot;Fedosin&quot;).

Methodology: I see almost no methodological notes spanning the words at [[Korean/Words]]. And yet, if this is original research inventing new etymological connections, surely there should be some general considerations/analysis on how to proceed and how that manner of procedure differs from mainstream etymology?

Prefix index (max 200 items?):
{{Small START}}
{{Special:Prefixindex/Korean/Words}}
{{Small END}}

--[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 09:33, 24 September 2025 (UTC)

:I would keep it. If there is a course of Korean, why not to have a resesearch on Korean vocabulary? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 19:53, 16 October 2025 (UTC)
:: I propose to dismiss the above input: 1) it does not contain any argument, except for a question, and a question is not an argument (it can be so reinterpreted, but that includes additional burden on the interpreters, in interpreting it the wrong way); 2) it ignores all the issues I have raised, including that there is something like definition lines in Korean, in this ''English'' Wikiversity. To answer the question asked: there can be a research on Korean vocabulary in the mainspace, but not one showing the defects I identified above. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:35, 15 November 2025 (UTC)
:I've reviewed a sample of approximately 20 of the Korean/Words sub-pages and lean towards moving to user space because:
:* The pages appear to be an idiosynchratic collection of etymological pages about Korean language
:* There is minimal English instruction which is problematic for English Wikiversity
:* There is no explanation of research method
:* There is no educational rationale
:-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:31, 22 November 2025 (UTC)
:Well, since the original creator has indef I change my mind and I would '''delete''' it. The case is nobody knows how to continue with the research and if we move it to the userspace, the user cannot improve it eihter. What the original user can do to request admin, to send them a contentent to their email for example if they really want to improve the resource elsewhere. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:38, 11 March 2026 (UTC)

== [[Enhancing Web Browser Security through Cookie Encryption]] ==
{{archive top|'''Kept'''. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:28, 17 May 2026 (UTC)}}
To avoid further conflict with the user who entered this text into Wikiversity, I am opening a RFD request.

I am not sure about how to proceed, although I am inclined to move it out of mainspace = quasi-delete. I am looking forward to get input from others, especially curators and custodians. Some considerations:

1) There is perhaps no more appearance/suspicion of copyright violation, now that the ResearchGate (RG) article (of which this is a copy, perhaps an incomplete copy?) carries a license.

2) The article is not a complete replica from RG: at a minimum, it lacks images. The inserter could have continued editing the page in his user space before he uploads images, that is, before he finalizes the page for consumption, but that did not happen. I did not check whether the text is an exact one-to-one match; the article does not indicate anything in that regard.

3) The principle implied seems to be this: users should feel free to duplicate non-peer-reviewed articles from RG in English Wikiversity, perhaps to increase the Google search and LLM yield. I find this problematic, in part for the duplication. I would say: choose a venue and publish it there. If RG is not good enough for you as a publishing venue, choose Wikiversity instead, but not both?

4) There are some features that appear unduly promotional. There is a link to a dot com home page of the inserter of the article. I dot not know how we handle or should handle this, whether prohibit such a link, etc. This is perhaps not so much a call to quasi-deletion but a call to make it less promotional.

5) I cannot determine the value of such an article. It seems to be a pseudo-article describing someone's browser extension. Can someone do a better analysis?

--[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:48, 8 October 2025 (UTC)

:2) Images for Wikicommons are being created, it will take a lot of time. and the text is not an exact one-to-one match
:3) I also mentioned that It was being created so that it is more accessible from mobile phone, which is not possible in RG or in Zenodo
:Let me clarify the purpose of uploading it to different platforms
:Zenodo - registration and to link DOI
:RG - Self Archiving 
:Wikiversity - Accessible by anyone from any device. LLMs may get trained on Wikiversity data or use these data for indexing 
:5) The paper is a result of a research project which involved a browser extension which was built to test the theory.  [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 01:34, 9 October 2025 (UTC)
:: I find the practice here of publishing non-identical but similar text (&quot;the text is not an exact one-to-one match&quot;) with almost the same title to be problematic. I cannot imagine this is a recommended practice in academic publishing. At a minimum, somewhere near the top, the page should say something like the following: &quot;This text is based on article ___ published at ___ but is not identical. The author of the differences/changes is ___.&quot; Everything else leads to an undesirable confusion. In academic publishing, the title of an article serves as key part of identification of the artifact.
:: As I said before, I seen nothing particularly academic article-like about the page except for external/superficial signs. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:30, 9 October 2025 (UTC)
:::That Article has been published under CC BY SA 4.0
:::And I am one of the author of the article. That gives me right to modify text and publish it under a similar name. However, I will add the disclaimer text that you have suggested. I hope that helps.  [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 06:07, 9 October 2025 (UTC)
:::: It may give you that right from the ''copyright'' perspective, but perhaps not from ''academic publishing integrity'' perspective. Unfortunately, I do not have any guideline handy; I am merely following my common (or not so common) sense. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:32, 9 October 2025 (UTC)
:: I would like to ask: was this article guided by someone from an academic institution, such as a university? Is it reviewed at least in some weak sense? --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:39, 9 October 2025 (UTC)
:::Yes, This article has been reviewed by two academic professors, their names are also listed as co authors.
:::First, a project guide would help us with selecting a topic and with the document 
:::Second, an Internal examiner would go through our experiment and approve it
:::Finally, External Examiner would examine the documentation and verify it. 
:::We were required by these professors to put their name under contributions [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 05:48, 9 October 2025 (UTC)
:: Let me explicate the promotional potential of such a page a bit: one can go to the page of the article in Wikiversity --&gt; https://tomjoejames.com/ --&gt; HitMyTarget (a commercial, profit-making entity?) Why would the link be to a commercial web site rather than an academic page, or perhaps a LinkedIn account, which I think the person has? There could also be no link at all; a search for the name would turn out something in Google as well. But providing a direct link would drive users/viewers toward that website much stronger since otherwise the viewer of the page would have to open a new Google search window or the like. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:45, 9 October 2025 (UTC)
:::It is evident that the website is not even close to being complete. 
:::I will be creating a separate page under the same domain name specifically for people to contact me.
:::The url would probably be defined as tomjoejames.com/contact-me/
:::I haven't decided yet. But that is my personal website.
:::If the community requires me to remove it, I will. But personally I think people who are from here most likely to click the link to know more about me or to contact me. Either way I think my personal website serves the purpose. 
:::As for the HitMyTarget, it can be traced from any of my links. From my research gate profile, linkedin page or even my own userpage.
:::On the article I did not add any promotional content about myself, I hyperlinked only my own name. I do not know how that is promotional. [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 06:04, 9 October 2025 (UTC)
:::: I am pausing any further responses from me to see whether anyone else has any input. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:30, 9 October 2025 (UTC)
:What does it mean &quot;There is perhaps no more appearance/suspicion of copyright violation&quot;? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 19:57, 16 October 2025 (UTC)
:I have accepted VRT permission per [[ticket:2025100410001149]] FYI. [[User:Matrix|Matrix]] ([[User talk:Matrix|discuss]] • [[Special:Contributions/Matrix|contribs]]) 11:00, 28 October 2025 (UTC)
::Thank you Matrix [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 12:43, 28 October 2025 (UTC)
:I would '''delete''' it. 1) it states its a learning resource. It could not be a learning resource as not rewieved original research. 2) It is not an ongoing research, nor the research was performed on Wikiversity - wv is not a preprint or article database. Maybe it could be moved elsewhere withn Wikimedia domain, but I dont know where. So I would delete it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:56, 20 November 2025 (UTC)
::I would '''keep it.''' Like Dan had pointed out,  we do have article-like pages in Wikiversity, and this is not just a random pseudo science article but an article that is a report of an final year project, it has been reviewed by 3 professors whose name has been mentioned at the very beginning.   [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 14:50, 21 November 2025 (UTC)
:::I think it is not good to rate pages by appearance. It can be done on other Wikimedia projects, but it cannot be done on Wikiversity, because Wikiversity does not create a static format for presenting information, but is focused on the goal and process. Unfortunately, the goal and process do not have a uniform format. While a target article on Wikipedia or an entry on Wiktionary have some standard target format, Wikiversity does not. That is why I personally rate pages according to the goals and their assessment. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:05, 22 November 2025 (UTC)

Further reading for this nomination: [[S: Wikisource:Proposed_deletions/Archives/2025#Index:Cookie_Encryption.pdf]]; EncycloPetey handled the matter. Let me quote his wisdom on Zenodo (which I lack): &quot;This is tied to a PDF on Commons that was uploaded as &quot;own work&quot; with a CC license and a doi link to Zenodo, with no indication of where this paper was published or if it was published. Zenodo is not a publisher; it is a site for storing research and sharing papers. If Zenodo is the only place this was &quot;published&quot; then it was effectively self-published. --EncycloPetey (talk) 16:14, 15 September 2025 (UTC)&quot;

--[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 08:55, 9 October 2025 (UTC)

:Can you clarify what point are you trying to state? Didn't I already state that the article is published by me? 
:I first created the article in wikisource which I thought would be the perfect place, unfortunately they do not allow self published articles that are not notable. Then I discovered Wikiversity where they allow self published articles. That is why I created the article here. 
:Unlike in wikisource, I did follow guidelines.
:Ever since you deleted the first article, I spent time reading Wikiversity guidelines and I do think that I am following it perfectly.
:I would like to get your suggestions on how should I improve the page,  10 points would be sufficient. 
:Because your goals or intentions are confusing me very much. At first you told me that the article is exactly the same as the preprint in RG and therefore there is no use to it here. And then when I continued to optimize it for Wikiversity, you went ahead and said it is problematic according to recommended academic publishing. 
:Atleast just respond to the points that I have made whether you agree or disagree. So that I clarify and proceed to discuss points that are important and relevant 
:Have you published an research article? If yes, could you send it to me so that I can see the format you have done it [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 10:45, 9 October 2025 (UTC)
:: I am giving a chance/time to other curators/custodians to look at the matter and respond to my inputs. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 11:14, 9 October 2025 (UTC)
:: Incidentally, above I counted 4 questions (or more), 1 request (or more?) and 1 command (or more?). That is a behavior of a commanding entity. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 11:24, 9 October 2025 (UTC)

I would '''delete it''''. It's more like an academic communication than a learning resource or research.--[[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:32, 26 October 2025 (UTC)
:: In the above post, I do not see any valid rationale for deletion: we do have article-like pages, in Wikijournals and also e.g. in [[Physics/Essays/Fedosin/Stellar Stefan–Boltzmann constant]]. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 08:59, 3 November 2025 (UTC)
:::But I do, see above. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:56, 20 November 2025 (UTC)

:it is a '''student research paper''' forming part of a learning resource on web security and encryption.
:The project was conducted as part of a final-year university course and documented as a practical study on cookie encryption and it has been reviewed by three professors. However, I will be creating a sub page for the article to elaborately describe the experiment that we have conducted and the results we got.    [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 15:57, 26 October 2025 (UTC)
::And why should w host research papers? Wikiversity is not an academic Journal nor repository. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:06, 22 November 2025 (UTC)
:::I do not wish to go through this same argument once again, I've already answered to this question several times in Dan's talk page, Colloquium. you can refer them. I am not hosting the research paper here, I have already hosted the pdf in the ResearchGate, I have published a text version in the wikiversity so that it may be useful for others. Unless you can show me how that article is totally useless, I would like to '''keep''' the article in the wikiversity.    [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 10:13, 22 November 2025 (UTC)
::::And thats the point I am having. Wikiversity is not paper repository. The only way is to publish it via WikiJournal, but they want it for Wikipedia usually. Why wikiversity should be a duplication of ResearchGate, Academia or Zenodo?
::::What I can read on [[Wikiversity:What is Wikiversity?]] policy is, that Wikiversity research &quot;...includes interpreting primary sources, forming ideas, or taking observations.&quot; The article doent look to fall into this. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:43, 22 November 2025 (UTC)
:::::Well, then how come you missed the term &quot;Learning Projects&quot;? As Jtneill had pointed out, this is a legitimate learning project. And also, I do have the VRT permission to host this article on Wikiversity.  [[ticket:2025100410001149]] . besides ResearchGate is an self-archiving platform. the document version in it is not accessibly to screen readers (usually disable people use them), Translators, and also for the mobile readers. therefore I do have valid reasons to publish this article on wikiversity. 
:::::# It is a learning project, therefore according to WIkiversity Policy, It qualifies. 
:::::# I have an explicit VRT permission to host this article on Wikiversity
:::::# Versions that are published in RG, Zenodo are documents, and they are not accessible by screen readers or mobile users. Therefore it is imperative that an article version of this paper exist on here. 
:::::Therefore this article qualifies to stay here on Wikiversity.  [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 11:22, 22 November 2025 (UTC)

'''Keep'''. This is a legitimate student learning project that may be of use to others. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:51, 22 November 2025 (UTC)
{{archive bottom}}

== [[Pragmatics/History]] ==
{{archive top|Deleted. Other related resources have been deleted. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:24, 17 May 2026 (UTC)}}
Another KYPark page and subpages with unclear organization scheme. Contains fairly many redlinked items. See also [[User:KYPark/Literature]], perhaps a similar concept. Unlikely to be really useful for others but KYPark. '''Move to user space'''.

As an alternative, moving to [[History of Pragmatics (KYPark)]] would make sense to me: the topic is identified using a natural-language phrase (instead of the relatively unnatural slash) and the responsible editor is indicated so that the reader knows whether to look or not. And for those who oppose the brackets (which I like): [[History of Pragmatics/KYPark]]. Or also: [[KYPark/History of Pragmatics]]. But then, searches in mainspace will see that content and the question is whether that is good. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:21, 15 October 2025 (UTC)

:What about to propose the user to write some guidelines, how other can participate instead of deleting it? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:03, 16 October 2025 (UTC)
:: I plan to move the pages to userspace as I proposed. If someone wants to ask KYPark to address the problems, they should feel free. There will be plenty of time for KYPark to address the problems while the material is in user space. After the problems are addressed, the material can be moved back to mainspace. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:38, 15 November 2025 (UTC)
:So I would '''delete''' it. In the blocked user space its useless. The user cannot improve it and Wikiversity is not free hosting service for personal pages. My believe is, that there should be just a few working pages in the users spaces. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:30, 11 March 2026 (UTC)

'''Move'''. Insufficient statement of learning objective or connection to related learning resources with insufficient current activity to stay in main space. The page was originally [[History of pragmatics]] but was moved by Dave B. Therefore, I suggest moving to [[User:KYPark/History of pragmatics]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:57, 22 November 2025 (UTC)
{{archive bottom}}

== [[IMHA Research Archives]] ==
I propose to '''move to userspace''', including the subpages. I struggle to understand how Wikiversity readers are supposed to benefit from the material here and in the subpages. In the log, there is e.g. '10 February 2019 Marshallsumter discuss contribs deleted page IMHA Research Archives (content was: &quot;{&lt;nowiki/&gt;{Delete|Author request}} Thanks! -&quot;)', so the page was deleted before, but not the subpages.

We could also delete all the material if we have strong enough suspicion too much of it is copyright violation. In any case, moving to user space improves the matter a little by moving the content away from Google search. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 13:38, 9 November 2025 (UTC)

:Looking at some sub-pages, they can be deleted e.g., because they only consist of broken links or are largely empty. I deleted a couple but haven't been through all to check. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:27, 10 November 2025 (UTC)

As an example, let me give the wikitext content of [[IMHA Research Archives/3. Scientific litterature search, storage and use]]:
&lt;pre&gt;
==[[/Medicina Maritima - the Spanish scientific maritime health journal/]]==

==[[/PubMed/]]==

==[[/Google and Google Scholar/]]==

==[[/Zotero/]]==

==[https://www.dropbox.com/sh/d91z7bcyelfvk42/AAAkIvjtBnnFMbiU9ZLOdVL9a/Andrioti_database%20sources0310.pptx?dl=0 Maritime health web portal ressources ]==
&lt;/pre&gt;
The wikilinks are red; the external link to dropbox says &quot;You don't have access&quot;. This was made in 2016. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 09:04, 11 November 2025 (UTC)

:I suggest delete -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 03:27, 12 November 2025 (UTC)
:: I think we should avoid deletion as much as possible, instead moving to user space (bar copyvio, ethics violation, etc.). This is a good general principle. It greatly improves auditability and makes it so much easier for anyone to request undeletion since they know what content they are requesting for undeletion. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 09:52, 12 November 2025 (UTC)
:::Do not recreate Wikiversity from the educational and research project to the personal blog. That will lead to the cancelation of it by WMF. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:44, 20 November 2025 (UTC)
:::: The English Wikiversity has a long tradition of moving problematic content to user space, as per evidence collected at [[User:Dan_Polansky/About Wikiversity#Moving pages to userspace]]. If Wikimedia Foundation finds this problematic, they can start a discussion in Colloquium and state their concerns. They do not need to make explicit threats at first; they can start a discussion and explain why it is problematic. They can even do it from an anonymous IP and provide a well-articulated reasoning. And anyone else can start a discussion in Colloquium to change this tradition. I do not see why we should not want to change that tradition based on well-articulated, compelling reasoning. I see no reason why Juandev should be making threats instead of them, on a per RFD basis. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:58, 21 November 2025 (UTC)
:::: If Juandev is ''sincere'' about deleting very-low-value items ''from user space'', he should perhaps demonstrate that by asking his pages like [[:cs:Uživatel:Juandev/Problémy/Kov/Repase dvířek elektroskříně]] to be deleted; otherwise, I register a ''glaring inconsistence''. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 07:43, 21 November 2025 (UTC)
::What was the original delate page about @[[User:Jtneill|Jtneill]]? I guess that would be crucial for the decission. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:48, 20 November 2025 (UTC)
:::@[[User:Juandev|Juandev]] the couple of pages I checked and deleted were much like @[[User:Dan Polansky|Dan Polansky]] posted above i.e., headings with empty sections and/or broken links but no substantive content. But I think each sub-page needs checking. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 21:59, 20 November 2025 (UTC)
::::So I'm saying that the main page usually determines what the other pages are for. But if I don't know the page because it's been deleted, or why was deleted (deletion based on the founder's request is probably not the rule), it's hard to judge. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 22:16, 20 November 2025 (UTC)
:::::I've pasted the original content of the root page: [[IMHA Research Archives#Original page]] (i.e., prior to the content being removed and deletion requested) to help understand the context for the sub-pages. In 2018, Saltrabook blanked the page, indicating that the content had been moved elsewhere, and requested page deletion. Marshallsumter then deleted the main page but not the sub-pages. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 01:58, 21 November 2025 (UTC)
::::::I see, so if those subpages are usefull I would keept them, if not I would delete them. I dont see a point of providing free hosting to sombody, by moving many pages to their user space. The question is if we want to host (i.e. to have in the main ns) lists of links elsewhere. I have no opinion on that. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:11, 22 November 2025 (UTC)

: Let me clarify that while many of the subpages are like the example above, [[IMHA Research Archives/Scientific litterature search, storage and use/Zotero]] is different:
:: &quot;A continuous critical and evidence based learning is a core issue in clinical practice, research, teaching, publication and prevention activities. The Zotero Program is just one of many scientific literature management programs, that should be used for these purposes. Of course one can live without such a database but it helps a lot and can save a lot of time that could be used for more interesting issues. Not only that, but it helps to create better publications and knowledge. Without this program it can be very time consuming to publish a scientific article with the requested style for the references. Further in daily practice when you want to collect and cite a few references for a specific evidence in a clinical colloquium and discussion, this program is excellent. Therefore we strongly recommend that all maritime health persons learn how to use this excellent tool in their daily maritime health practice of all different types. There are good online courses for self-instruction on how to use Zotero. For example this one: Zotero fast online course But in order to increase IMHAR´s collective scientific strength in the use of EBM we would like to give training sessions in every possible opportunity, IMHA Symposia, seminars and other types of meetings. The database is useful for personal purposes but especially also for collaborative aims. At the IMHAR meeting in Paris Oct 7th 2016 we will give an introduction to the program by showing how it can be used in the daily practice and discuss strength and weaknesses compared to other similar databases.&quot;
: Even longer is e.g. [[IMHA Research Archives/Scientific litterature search, storage and use/Medicina Maritima - the Spanish scientific maritime health journal]].
: However, that does not mean these should be salvaged. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 07:53, 21 November 2025 (UTC)

== [[Palliative medicine]] ==

Underdeveloped and has not been improved on since 2007. Author inactive. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 21:42, 14 December 2025 (UTC)

:Delete, per nominator [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:16, 22 January 2026 (UTC)
:Yes, I would also expect there to be more and especially that someone would write how to use it. However, it still seems to me to be a useful thing in the sense of a syllabus, so that someone who is interested in the topic knows what information to obtain in order to get a complete picture of the topic. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:55, 16 March 2026 (UTC)

== [[Canadian Wilderness]] ==
{{archive top|Deleted per nom. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:07, 17 May 2026 (UTC)}}
This page doesn't seem to belong to wikiversity. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 09:55, 6 February 2026 (UTC)

:In principle there could be some material useful here but in practice, I don't see what this page is adding as an educational resource. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 12:54, 6 February 2026 (UTC)
:I can see this being a useful resource to a bigger project. Maybe we could move it to the &quot;[[Wikiversity:Drafts|Draft]]&quot; namespace vs. deleting it? —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 13:28, 6 February 2026 (UTC)
::Does anyone plan to work on it? [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 01:59, 8 February 2026 (UTC)
:::Next week the page has it's 17th birthday. Ever now and than someone added to it. With a lot of work it could be a nice encyclopedic article but making it educational .... Merging it may take more work than rewriting it. Move to Draft might be the best option. [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 08:58, 12 February 2026 (UTC)
{{archive bottom}}

== [[LQR Control for an Inverted Pendulum]] ==
Underdeveloped resource, has not been edited for more than a decade. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 08:03, 16 March 2026 (UTC)

:Looks like a test, '''delete'''. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:30, 27 March 2026 (UTC)

== False flag &quot;authority hack&quot; user page deletion ==
{{archive top|'''Not undeleted''', the requester dropped the request. See Wikiversity:Requests for Deletion v. 2803217.--[[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:36, 10 May 2026 (UTC)}}
'''Undeletion requested'''

Hi, Juandev marked my user page as &quot;spam&quot; and &quot;authority hack&quot;, and deleted it. 

First, I asked him for help with &quot;time limit for new users&quot;, and he replied - I should admit I dont know, what is &quot;new user limit&quot;, but if filter blocks your page because of certain external link, you may force to save anyway and sometimes it works. It should not work, when the website is blacklisted. As of now, I am not seeing you to save page in main namespace, so try to save it without external links first. 

Then he wrote me another message: Well, I have analyzed your contribution to Wikiversity and I should point out here, that this project is not a place for advertising, so there is no way of promoting your books and authority this way. - probably referring to the intro of my About me page where I present me and my work. 

Before I could explain him the difference between the neutral information and advertising and promotion, he deleted my user page. 

Here is my answer I posted to the discussion today: 

: Hi, my About Me page is just an info page with the neutral as possible presentation of my work.
:
: There is a big difference between informing and advertising. Informing is neutrally stating that something exists and requiring no action, while advertising is a special communication form with intent to cause certain action from readers. For example, click here, click there, order this, buy that.
:
: There is no such intention, form, or terms on my info page. Just neutral information. I don't hide and I am not ashamed that I am write and author, and that is a part of the usual bio, including works. I checked your user page: &quot;I graduated from the Czech University of Life Sciences in Prague and studied information science at the Faculty of Arts of Charles University.&quot; I think that if you had written a book on Life Science, you would have mentioned that as well.
:
: Most of the Info page is about my research and AIPA Method which is a valid contribution to psychology, consciousness studies, identity theory, and personality development. Actually, my paper '''AIPA Method: A Cognitive-Phenomenological Model for Identity Reconstruction and Stabilization in Pure Awareness''' is now in the peer review procedure at Journal of Consciousness Studies.
:
: Here is a part from the Wikiversity AIPA Method page in creation (waiting for the end of the time limit for new users):

: == Introduction ==
: The AIPA Method addresses a gap in contemporary personal development and consciousness science: most evidence‑based approaches (CBT, MBSR, MBCT, standard meditation) operate at the level of mental content—reframing thoughts, observing them, or reducing their impact—rather than at the level of identity structure. In contrast, AIPA targets the structural relationship between the self and the mind, aiming at durable identity reconstruction rooted in Pure Awareness rather than symptom management.
:
: The central research question of the primary AIPA preprint is whether a structured, sequentially staged method can produce permanent identity reconstruction rooted in Pure Awareness, and how such a method compares to established approaches in scope, mechanism, and outcome.
:
: == Theoretical foundations ==
: The AIPA framework is grounded in the cognitive‑phenomenological tradition (e.g., McAdams, Varela, Metzinger, Erikson), contemporary consciousness science on minimal phenomenal experience, and qualitative methods advocacy in psychology. It builds directly on:
:* Empirical work on pure awareness and Minimal Phenomenal Experience (MPE), especially Gamma &amp; Metzinger’s large‑scale study of content‑reduced awareness states.
:* Metzinger’s proposal of minimal phenomenal experience as an entry point for a minimal unifying model of consciousness.
:* Narrative identity and partial‑self models within personality and identity theory.
: Within this backdrop, AIPA proposes Pure Awareness as a distinct, operationally specified state that can become a structural ground of identity rather than a transient meditative experience.
:
: == Experiential empiricism ==
: The empirical foundation of the AIPA Method is explicitly first‑person and experiential, combining:
:* A 22‑year longitudinal autoethnographic self‑study (2003–2025) documenting partial personality episodes, protocol use, and outcomes.
:* A 13‑year prospective verification period with zero self‑reported recurrence of targeted harmful behaviors after a dated stabilization point (1 January 2006).
:* A high‑ecological‑validity “stress test” during acute bereavement, used to examine whether non‑reactive awareness remains stable under maximal provocation.
:* Two independent practitioner cases (an Amazon‑verified report and a structured questionnaire case) providing preliminary convergent signals across cognitive, emotional, behavioral, and identity dimensions.
:
: All central constructs (Pure Awareness, partial personalities, the Switch, identity stabilization) are operationalized with explicit phenomenological and behavioral criteria intended to enable replication and future third‑person measurement.
:
: I believe this is a valid contribution to Wikiversity.
:
: Best regards, Senad [[User:Senad Dizdarević|Senad Dizdarević]]


I suggest you check the deleted user page, and see for yourself if it is &quot;spam&quot; and &quot;authority hack&quot;, or a legit author's page with one paragraph short presentation, while the rest of the page is about my research project. 

Thank you for undeleting my user page, so I can use it. 

Best regards, 

Senad Dizdarević [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:26, 2 April 2026 (UTC)

:Hi Senad,
:Welcome to Wikiversity.
:It looks like you tried adding similar content to Wikipedia and ran into similar difficulties over there ([[w:User talk:Senad Dizdarević]])? Perhaps that is what has led to you Wikiversity?
:Basically, if you'd like to collaborate and help build open educational resources, feel free to contribute to Wikiversity. But if the primary motivation is to promote your autobiographical work you're probably going to run into challenges.
:Sincerely,
:James
:-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:11, 3 April 2026 (UTC)
::James, Hi, and thank you for your answer. 
::Yes, in 2025, I created the autobiographic page on Wikipedia, which was removed because of the links to my books on Amazon. To admin, I explained that I did not know the rules, and agreed that page is removed. Now I know that somebody else must write a Wikipedia page for you. 
::On the deleted user page on Wikiversity, there were no links to Amazon or any other form of promotion, just neutral as possible basic presentation of my writing (one sentence) and current project (the rest of the page). 
::I created Wikiversity page to present my AIPA Method project, to invite researchers to read it, give their opinion, and conduct empirical researches in their institutions. Now, it is in a theoretical phase, and needs more empirical testing. 
::Best regards, 
::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:03, 3 April 2026 (UTC)
:::It looks to me like the primary motivation for contributing to Wikiversity is to drive traffic / search engine ranking to your website?
:::* [[User:Senad Dizdarević]]
:::* [[AIPA Method]]
:::-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 01:36, 4 April 2026 (UTC)
::::No, it is not. There is no link to my website, so &quot;driving traffic to my website&quot; is not possible. 
::::For your educational purposes: 
::::Copilot &quot;AI:  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:38, 4 April 2026 (UTC)
:::::So do you still insist of undeleting your former version of your userpage if you have created the new one? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:15, 6 April 2026 (UTC)
::::::No, because in the moment of undeletition, somebody could delete it again, and so on. Thank you for not deleting my new user page, as it is made in your user page image.  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 08:59, 6 April 2026 (UTC)

{{archive bottom}}

== Undeletion request ==

It was deleted by an admin without discussion and with untrue rationale. If people take offense with the question that doesn't mean it's not a valid question and the page was good. Please undelete the Wikidebate page [https://web.archive.org/web/20250810030352/https://en.wikiversity.org/wiki/Is_it_likely_that_Earth_has_been_visited_by_aliens_millions_of_years_ago%3F Is it likely that Earth has been visited by aliens millions of years ago?]

There are lots of sources on the subject, the wikidebate is sourced very well compared to other wikidebates and wikiversity pages, and the page is educational, useful and of good quality. [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 23:57, 10 April 2026 (UTC)

:Page: [[Is it likely that Earth has been visited by aliens millions of years ago?]]
:Ping: [[User:Atcovi|Atcovi]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:21, 11 April 2026 (UTC)
:There is no need for a discussion for straight garbage-level, pseudoscientific content.
:For '''Is it likely that Earth has been visited by aliens millions of years ago?''', the flaws for this page wouldn't even take someone more than a few minutes to assess:
:* Essentially, the &quot;pro&quot; arguments unproven claims being derived from irrelevant, established facts (basically: &quot;it is likely aliens have came because Earth has existed for so long [sources proving Earth's longevity]&quot;). These are not serious, scientifically-backed arguments - these are non sequiturs. It's as if I said Wikipedia has existed longer than my existence on Earth ([https://d1wqtxts1xzle7.cloudfront.net/74351725/eyJoIjogImZiODhmYzNkODU1N2UxMWExYzUyODJiYzgzZTRmZDM4OTBjODY5YWMzMjA3NDNmOWEyZTA0ZTU3ZGYwZjAyYTkiLCAidSI6ICJodHRwczovL3B1cmUuaHZhLm5sL3dz-libre.pdf?1636354596=&amp;response-content-disposition=inline%3B+filename%3DCritical_Point_of_View_A_Wikipedia_Reade.pdf&amp;Expires=1775872055&amp;Signature=GqbUZboYRvUYWi~aW40LT5eZSHrLuDL3o0-DxAH8vSvcJcGAuyByZWLF2oHTY6GlB72TqvZxpE-v9d4gvsA6myriYqO~QQQZgWxjT2JXjUWC-yiPcTF4l~lroJSi4dY0v9eKiBcU03l-aeUdrX8~UPfi0TfW0IhsmzH-VBR6X6FrzRpIqc6uM6n9YXfr5FRB3aCqqokU690af3n0Hguaub1Zgmh9qjYYqzBS0VOOHjKTTEQnDuadX3jl5CQeXYTaeCC3H0hMeVwHlratbrnuFEKC1aN0-5znCUoSzMEg21ECzGPTrSDM1W05dcK-u0ZTCeUGKAuC-2yRFL3sY46MIw__&amp;Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA#page=157 reputable source proving ''this'' fact]), therefore it's likely that my birth took place solely for the sake of me experiencing Wikipedia (0 backing). It makes no sense and no person with at least a high school-level of intelligence would take this seriously. 
:* What is worse is that the user is being misleading with their &quot;[the page is] sourced very well&quot; claim. The sources ''themselves'' don't even back up the claims. It's just used as proof for an established concept, where the user then uses this established concept to jump to an unsupported, laughable conclusion that is pulled out of thin air. It's utterly ridiculous to even consider such a page for mainspace since it clearly violates our [[Wikiversity:Verifiability]] policy. This is, once again, pseudoscientific content that has caused our website to reduce in quality over the last few years. 
:* Going source by source, we can see that:
:#[https://web.archive.org/web/20250918011642/https://timesofindia.indiatimes.com/blogs/thebigd/compress-earths-history-into-24-hrs-humans-came-at-1158-pm-yet-killed-70-of-wildlife/ ‘Compress Earth’s history into 24 hrs. Humans came at 11:58 pm, yet killed 70% of wildlife’] is literally just a blog post which doesn't even mention aliens or extraterrestrial life. It just talks about Earth's history in accordance with the 24-hour metric of time, and the author tries to use this article as a 'piece in the puzzle' of aliens &quot;possibly&quot; visiting Earth... which, once again, is unsupported and is not backed up anywhere in the article.
:#[https://web.archive.org/web/20250808053249/https://news.cornell.edu/stories/2023/11/jurassic-worlds-might-be-easier-spot-modern-earth The Cornell article does not even remotely support the idea that &quot;aliens visited Earth&quot;]. It mentions a ''chance'' of &quot;life there [a habitable exoplanet] might not be limited to microbes, but could include creatures as large and varied as the megalosauruses or microraptors that once roamed Earth.&quot;, but again, no justification to take this article as proof that &quot;aliens may have visited us!&quot;. There's no mention of aliens visiting Earth anywhere in the article. Once again this is only proving the background premise, but not the unsupported, nonsensical &quot;alien likelihood&quot; argument that the author of this garbage page is trying to push so desperately.
:#The Parker Solar Probe WP article does not even mention aliens either. It follows the same issues as the previous argument.
:And the other page this user complained about [https://en.wikiversity.org/wiki/User_talk:Atcovi#Deletion_of_educational_page_because_of_personal_opinion on my talk page] holds almost similar, maybe even more fatal mistakes, than this one. It has nothing to do with &quot;taking offense&quot;, this is just low-quality, garbage content. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 00:56, 11 April 2026 (UTC)
::Why do you think pro claims are required to be proven? It's possible to object to them and these are arguments, not contextualized to be statements of proven facts. And it's not a strange or unreasonable argument to make that since Earth has existed for long, it's more likely that aliens have come here in the past than in recent times or the near future. Instead of insulting others' intelligence, maybe engage with the actual reasoning rather than censoring it away. And there are lots of sources, such as [https://interestingengineering.com/science/alien-civilizations-may-have-visited-earth-millions-of-years-ago-study-says Alien Civilizations May Have Visited Earth Millions of Years Ago, Study Says] etc etc. The sources are used for the arguments themselves individually. [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 12:30, 11 April 2026 (UTC)
:::Because, once again, this is not a site that caters to rampant debating for the sake of &quot;we need to employ rationality and logic to solve the world's problems&quot;, we have policies that we need to fulfill. The claims made in the pro argument clearly do not meet [[Wikiversity:Verifiability]], since you cannot verify these arguments with the sources because they are not relevant. 
:::''&quot;And it's not a strange or unreasonable argument to make that since Earth has existed for long, it's more likely that aliens have come here in the past than in recent times or the near future.&quot;'' The point being is that these arguments are not supported by the sources. Even the article you mention poses the idea as a hypothetical model. This is just you twisting the article to fit your unsupported narrative. I'll bring direct quotes for you to show why the linked article does not help you:
:::* ''One problem the researchers do make sure to point out is that '''they are working with only one data point: our own behaviors and capabilities for space exploration'''. “We tried to come up with a model that would involve the fewest assumptions about sociology that we could,” Carroll-Nellenback told Business Insider. '''We have no real way of knowing the motivations of an alien civilization'''.'' --&gt; proves that this is just speculation and no evidence-based arguments have been provided for the idea that aliens likely visited Earth.
:::And I'm not sure if you read my entire response, but I ''did'' engage with your &quot;actual reasoning&quot; and exposed its weaknesses and lack of adherence to Wikiversity policies. If we allowed content that was just filled with non sequiturs we would have content that fails Wikiversity's educational objectives and reduces the overall quality of this website, hence why such a harsh stance needs to be taken. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 13:50, 11 April 2026 (UTC)
::::Thanks for proving that the Wikimedia ecosystem is unfit to deliberate on controversial topics. The question is entirely valid and the content is far better sourced than nearly all Wikidebates and has no genuine flaws. The only possible issue with it as far as I can see is that now that Wikidebates has been paused people can't add objections if they do have sth specific to say about the topic that's not already included on that page which already had plenty of Cons and objections.
::::The page was more educational than most of Wikiversity and it was well-sourced – wikidebates was for arguments so people were invited to make arguments based on sourced things or outlined logic and the page met [[WV:V]] and most pages on Wikiversity aren't sourced as good. Doesn't look like people can see beyond their biases and personal views here but that's more evident in the marginalization and deletion of wikidebates and the low activity in that project than these selective deletions. A constructive thing to do would be to add reasoned Cons and objections not yet on the page and people had plenty of time to do that. There are and will be other sites for free constructive rational adversarial deliberation (not a big loss in that sense). [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 16:31, 22 April 2026 (UTC)
:::::Thank you for failing to address any of my arguments and going on an unrelated, nonsensical tangent that has nothing to do with the discussion. Once you start producing work that aligns with Wikiversity's content policies instead of typing up laughable, pseudoscientific garbage, then maybe your work can be accepted and not removed. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 16:59, 22 April 2026 (UTC)
::::::I suggest you stop ridiculing things and learn respectfully forming genuine points about the subject at hand. {{tq|the idea as a hypothetical model}} but please learn first about what arguments are and why they're not the same as a statement of objective proven fact. [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 17:18, 22 April 2026 (UTC)

==Pages by Harold Foppele==
[[User:Harold Foppele]] is locally blocked indefinitely and globally banned for sockpuppetry. There were also WMF and local community concerns expressed about copyright violation and AI (over)use. As a result, I think the Wikiversity pages created by this account warrant review with regard what should be deleted, what should be retained etc.:
* [[Completing the square]]
* [[Number of independent spatial modes in a spherical volume]]
* [[Quantum]]
** [[Quantum/Andrew N. Jordan]]
* [[Quantum A Matter Of Size]]
* [[Quantum A Spooky Action at a Distance]]
* [[Quantum: A Walk Through the Universe]]
* [[Quantum Computing Algorithms in the NISQ Era]]
* [[Quantum Formulas Collection]]
* [[Quantum harmonic oscillator]]
* [[Quantum Matter Elements and Particles]]
* [[Quantum mechanics]]
** [[Quantum mechanics/Timeline]]
* [[Quantum mechanics learning module]]
* [[Quantum mechanics measurements]]
* [[Quantum Noisy Qubits]]
* [[Quantum optics beam splitter experiments]]
* [[Quantum: The Secret of Cohesion: How Waves Hold Matter Together]]
* [[Quantum Ultra fast lasers]]
* [[Speed of sound experiments]]
* [[User:Harold Foppele]]
-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 08:12, 17 May 2026 (UTC)

:'''Delete all''' Not worth keeping. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 08:27, 17 May 2026 (UTC)</text>
      <sha1>a5hvbg6frjzwcwpg3t5samv91mcls44</sha1>
    </revision>
    <revision>
      <id>2809915</id>
      <parentid>2809913</parentid>
      <timestamp>2026-05-17T11:34:25Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <comment>/* Korean/Words */ + collapse for long list</comment>
      <origin>2809915</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="56089" sha1="h8jx42e3ps1o0eednl41ko2r0pfejrv" xml:space="preserve">{{/header}}
[[Category:Wikiversity deletion]]

__TOC__

== [[Korean/Words]] ==
(I go to RfD instead of ''proposed deletion'' since many pages are affected.)

I proposed to quasi-delete, i.e. '''move to userspace''' of the main (or sole?) creator, {{User|KYPark}}.

The page is organized a little bit like a dictionary. It makes it redundant to Wiktionary except that Wikiversity allows original research and there does seem to be original research there. Thus, its being organized as a dictionary would alone not necessarily be a problem.

Where I see a problem is in the organization and execution/implementation. Consider [[Korean/Words/가다]], which seems rather typical of the subpages (some subpages are like categories and transclude the pages for individual words):
* On the putative definition line, there is this: &quot;한곳에서 다른 곳으로 장소를 이동하다&quot;, apparently(?) in Korean. That does not seem to fit well into the ''English'' Wikiversity.
* There seems to be some original research into etymological relations between Korean and European languages in the &quot;Comparatives&quot; section (from what I recall, the English Wiktionary rejected this kind of content from KYPark). Admittedly, it is marked using &quot;This is a primary, secondary and/or original Eurasiatic research project at Wikiversity&quot;, so it could be tolerable, but even so, one has to wonder whether Wikiversity wants this kind of fringe science/research or outright pseudo-science.
** Fringe science: fringe physics has been moved to user space before. This would be fringe etymology. But then, original research is allowed.

Deletion is not required; moving to user space suffices, I think. Alternatively, one could at least rename the pages to make it clear from the title that this is not Wikiversity voice but rather KYPark voice, e.g. &quot;Korean/Words (KYPark)/...&quot; or  &quot;Korean/Words/KYPark/...&quot;  (recall the &quot;Fedosin&quot; pages featuring the name &quot;Fedosin&quot;).

Methodology: I see almost no methodological notes spanning the words at [[Korean/Words]]. And yet, if this is original research inventing new etymological connections, surely there should be some general considerations/analysis on how to proceed and how that manner of procedure differs from mainstream etymology?

Prefix index (max 200 items?):
{{collapse top}}
{{Small START}}
{{Special:Prefixindex/Korean/Words}}
{{Small END}}
{{Collapse bottom}}
--[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 09:33, 24 September 2025 (UTC)

:I would keep it. If there is a course of Korean, why not to have a resesearch on Korean vocabulary? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 19:53, 16 October 2025 (UTC)
:: I propose to dismiss the above input: 1) it does not contain any argument, except for a question, and a question is not an argument (it can be so reinterpreted, but that includes additional burden on the interpreters, in interpreting it the wrong way); 2) it ignores all the issues I have raised, including that there is something like definition lines in Korean, in this ''English'' Wikiversity. To answer the question asked: there can be a research on Korean vocabulary in the mainspace, but not one showing the defects I identified above. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:35, 15 November 2025 (UTC)
:I've reviewed a sample of approximately 20 of the Korean/Words sub-pages and lean towards moving to user space because:
:* The pages appear to be an idiosynchratic collection of etymological pages about Korean language
:* There is minimal English instruction which is problematic for English Wikiversity
:* There is no explanation of research method
:* There is no educational rationale
:-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:31, 22 November 2025 (UTC)
:Well, since the original creator has indef I change my mind and I would '''delete''' it. The case is nobody knows how to continue with the research and if we move it to the userspace, the user cannot improve it eihter. What the original user can do to request admin, to send them a contentent to their email for example if they really want to improve the resource elsewhere. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:38, 11 March 2026 (UTC)

== [[Enhancing Web Browser Security through Cookie Encryption]] ==
{{archive top|'''Kept'''. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:28, 17 May 2026 (UTC)}}
To avoid further conflict with the user who entered this text into Wikiversity, I am opening a RFD request.

I am not sure about how to proceed, although I am inclined to move it out of mainspace = quasi-delete. I am looking forward to get input from others, especially curators and custodians. Some considerations:

1) There is perhaps no more appearance/suspicion of copyright violation, now that the ResearchGate (RG) article (of which this is a copy, perhaps an incomplete copy?) carries a license.

2) The article is not a complete replica from RG: at a minimum, it lacks images. The inserter could have continued editing the page in his user space before he uploads images, that is, before he finalizes the page for consumption, but that did not happen. I did not check whether the text is an exact one-to-one match; the article does not indicate anything in that regard.

3) The principle implied seems to be this: users should feel free to duplicate non-peer-reviewed articles from RG in English Wikiversity, perhaps to increase the Google search and LLM yield. I find this problematic, in part for the duplication. I would say: choose a venue and publish it there. If RG is not good enough for you as a publishing venue, choose Wikiversity instead, but not both?

4) There are some features that appear unduly promotional. There is a link to a dot com home page of the inserter of the article. I dot not know how we handle or should handle this, whether prohibit such a link, etc. This is perhaps not so much a call to quasi-deletion but a call to make it less promotional.

5) I cannot determine the value of such an article. It seems to be a pseudo-article describing someone's browser extension. Can someone do a better analysis?

--[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:48, 8 October 2025 (UTC)

:2) Images for Wikicommons are being created, it will take a lot of time. and the text is not an exact one-to-one match
:3) I also mentioned that It was being created so that it is more accessible from mobile phone, which is not possible in RG or in Zenodo
:Let me clarify the purpose of uploading it to different platforms
:Zenodo - registration and to link DOI
:RG - Self Archiving 
:Wikiversity - Accessible by anyone from any device. LLMs may get trained on Wikiversity data or use these data for indexing 
:5) The paper is a result of a research project which involved a browser extension which was built to test the theory.  [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 01:34, 9 October 2025 (UTC)
:: I find the practice here of publishing non-identical but similar text (&quot;the text is not an exact one-to-one match&quot;) with almost the same title to be problematic. I cannot imagine this is a recommended practice in academic publishing. At a minimum, somewhere near the top, the page should say something like the following: &quot;This text is based on article ___ published at ___ but is not identical. The author of the differences/changes is ___.&quot; Everything else leads to an undesirable confusion. In academic publishing, the title of an article serves as key part of identification of the artifact.
:: As I said before, I seen nothing particularly academic article-like about the page except for external/superficial signs. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:30, 9 October 2025 (UTC)
:::That Article has been published under CC BY SA 4.0
:::And I am one of the author of the article. That gives me right to modify text and publish it under a similar name. However, I will add the disclaimer text that you have suggested. I hope that helps.  [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 06:07, 9 October 2025 (UTC)
:::: It may give you that right from the ''copyright'' perspective, but perhaps not from ''academic publishing integrity'' perspective. Unfortunately, I do not have any guideline handy; I am merely following my common (or not so common) sense. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:32, 9 October 2025 (UTC)
:: I would like to ask: was this article guided by someone from an academic institution, such as a university? Is it reviewed at least in some weak sense? --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:39, 9 October 2025 (UTC)
:::Yes, This article has been reviewed by two academic professors, their names are also listed as co authors.
:::First, a project guide would help us with selecting a topic and with the document 
:::Second, an Internal examiner would go through our experiment and approve it
:::Finally, External Examiner would examine the documentation and verify it. 
:::We were required by these professors to put their name under contributions [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 05:48, 9 October 2025 (UTC)
:: Let me explicate the promotional potential of such a page a bit: one can go to the page of the article in Wikiversity --&gt; https://tomjoejames.com/ --&gt; HitMyTarget (a commercial, profit-making entity?) Why would the link be to a commercial web site rather than an academic page, or perhaps a LinkedIn account, which I think the person has? There could also be no link at all; a search for the name would turn out something in Google as well. But providing a direct link would drive users/viewers toward that website much stronger since otherwise the viewer of the page would have to open a new Google search window or the like. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:45, 9 October 2025 (UTC)
:::It is evident that the website is not even close to being complete. 
:::I will be creating a separate page under the same domain name specifically for people to contact me.
:::The url would probably be defined as tomjoejames.com/contact-me/
:::I haven't decided yet. But that is my personal website.
:::If the community requires me to remove it, I will. But personally I think people who are from here most likely to click the link to know more about me or to contact me. Either way I think my personal website serves the purpose. 
:::As for the HitMyTarget, it can be traced from any of my links. From my research gate profile, linkedin page or even my own userpage.
:::On the article I did not add any promotional content about myself, I hyperlinked only my own name. I do not know how that is promotional. [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 06:04, 9 October 2025 (UTC)
:::: I am pausing any further responses from me to see whether anyone else has any input. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:30, 9 October 2025 (UTC)
:What does it mean &quot;There is perhaps no more appearance/suspicion of copyright violation&quot;? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 19:57, 16 October 2025 (UTC)
:I have accepted VRT permission per [[ticket:2025100410001149]] FYI. [[User:Matrix|Matrix]] ([[User talk:Matrix|discuss]] • [[Special:Contributions/Matrix|contribs]]) 11:00, 28 October 2025 (UTC)
::Thank you Matrix [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 12:43, 28 October 2025 (UTC)
:I would '''delete''' it. 1) it states its a learning resource. It could not be a learning resource as not rewieved original research. 2) It is not an ongoing research, nor the research was performed on Wikiversity - wv is not a preprint or article database. Maybe it could be moved elsewhere withn Wikimedia domain, but I dont know where. So I would delete it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:56, 20 November 2025 (UTC)
::I would '''keep it.''' Like Dan had pointed out,  we do have article-like pages in Wikiversity, and this is not just a random pseudo science article but an article that is a report of an final year project, it has been reviewed by 3 professors whose name has been mentioned at the very beginning.   [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 14:50, 21 November 2025 (UTC)
:::I think it is not good to rate pages by appearance. It can be done on other Wikimedia projects, but it cannot be done on Wikiversity, because Wikiversity does not create a static format for presenting information, but is focused on the goal and process. Unfortunately, the goal and process do not have a uniform format. While a target article on Wikipedia or an entry on Wiktionary have some standard target format, Wikiversity does not. That is why I personally rate pages according to the goals and their assessment. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:05, 22 November 2025 (UTC)

Further reading for this nomination: [[S: Wikisource:Proposed_deletions/Archives/2025#Index:Cookie_Encryption.pdf]]; EncycloPetey handled the matter. Let me quote his wisdom on Zenodo (which I lack): &quot;This is tied to a PDF on Commons that was uploaded as &quot;own work&quot; with a CC license and a doi link to Zenodo, with no indication of where this paper was published or if it was published. Zenodo is not a publisher; it is a site for storing research and sharing papers. If Zenodo is the only place this was &quot;published&quot; then it was effectively self-published. --EncycloPetey (talk) 16:14, 15 September 2025 (UTC)&quot;

--[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 08:55, 9 October 2025 (UTC)

:Can you clarify what point are you trying to state? Didn't I already state that the article is published by me? 
:I first created the article in wikisource which I thought would be the perfect place, unfortunately they do not allow self published articles that are not notable. Then I discovered Wikiversity where they allow self published articles. That is why I created the article here. 
:Unlike in wikisource, I did follow guidelines.
:Ever since you deleted the first article, I spent time reading Wikiversity guidelines and I do think that I am following it perfectly.
:I would like to get your suggestions on how should I improve the page,  10 points would be sufficient. 
:Because your goals or intentions are confusing me very much. At first you told me that the article is exactly the same as the preprint in RG and therefore there is no use to it here. And then when I continued to optimize it for Wikiversity, you went ahead and said it is problematic according to recommended academic publishing. 
:Atleast just respond to the points that I have made whether you agree or disagree. So that I clarify and proceed to discuss points that are important and relevant 
:Have you published an research article? If yes, could you send it to me so that I can see the format you have done it [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 10:45, 9 October 2025 (UTC)
:: I am giving a chance/time to other curators/custodians to look at the matter and respond to my inputs. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 11:14, 9 October 2025 (UTC)
:: Incidentally, above I counted 4 questions (or more), 1 request (or more?) and 1 command (or more?). That is a behavior of a commanding entity. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 11:24, 9 October 2025 (UTC)

I would '''delete it''''. It's more like an academic communication than a learning resource or research.--[[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:32, 26 October 2025 (UTC)
:: In the above post, I do not see any valid rationale for deletion: we do have article-like pages, in Wikijournals and also e.g. in [[Physics/Essays/Fedosin/Stellar Stefan–Boltzmann constant]]. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 08:59, 3 November 2025 (UTC)
:::But I do, see above. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:56, 20 November 2025 (UTC)

:it is a '''student research paper''' forming part of a learning resource on web security and encryption.
:The project was conducted as part of a final-year university course and documented as a practical study on cookie encryption and it has been reviewed by three professors. However, I will be creating a sub page for the article to elaborately describe the experiment that we have conducted and the results we got.    [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 15:57, 26 October 2025 (UTC)
::And why should w host research papers? Wikiversity is not an academic Journal nor repository. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:06, 22 November 2025 (UTC)
:::I do not wish to go through this same argument once again, I've already answered to this question several times in Dan's talk page, Colloquium. you can refer them. I am not hosting the research paper here, I have already hosted the pdf in the ResearchGate, I have published a text version in the wikiversity so that it may be useful for others. Unless you can show me how that article is totally useless, I would like to '''keep''' the article in the wikiversity.    [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 10:13, 22 November 2025 (UTC)
::::And thats the point I am having. Wikiversity is not paper repository. The only way is to publish it via WikiJournal, but they want it for Wikipedia usually. Why wikiversity should be a duplication of ResearchGate, Academia or Zenodo?
::::What I can read on [[Wikiversity:What is Wikiversity?]] policy is, that Wikiversity research &quot;...includes interpreting primary sources, forming ideas, or taking observations.&quot; The article doent look to fall into this. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:43, 22 November 2025 (UTC)
:::::Well, then how come you missed the term &quot;Learning Projects&quot;? As Jtneill had pointed out, this is a legitimate learning project. And also, I do have the VRT permission to host this article on Wikiversity.  [[ticket:2025100410001149]] . besides ResearchGate is an self-archiving platform. the document version in it is not accessibly to screen readers (usually disable people use them), Translators, and also for the mobile readers. therefore I do have valid reasons to publish this article on wikiversity. 
:::::# It is a learning project, therefore according to WIkiversity Policy, It qualifies. 
:::::# I have an explicit VRT permission to host this article on Wikiversity
:::::# Versions that are published in RG, Zenodo are documents, and they are not accessible by screen readers or mobile users. Therefore it is imperative that an article version of this paper exist on here. 
:::::Therefore this article qualifies to stay here on Wikiversity.  [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 11:22, 22 November 2025 (UTC)

'''Keep'''. This is a legitimate student learning project that may be of use to others. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:51, 22 November 2025 (UTC)
{{archive bottom}}

== [[Pragmatics/History]] ==
{{archive top|Deleted. Other related resources have been deleted. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:24, 17 May 2026 (UTC)}}
Another KYPark page and subpages with unclear organization scheme. Contains fairly many redlinked items. See also [[User:KYPark/Literature]], perhaps a similar concept. Unlikely to be really useful for others but KYPark. '''Move to user space'''.

As an alternative, moving to [[History of Pragmatics (KYPark)]] would make sense to me: the topic is identified using a natural-language phrase (instead of the relatively unnatural slash) and the responsible editor is indicated so that the reader knows whether to look or not. And for those who oppose the brackets (which I like): [[History of Pragmatics/KYPark]]. Or also: [[KYPark/History of Pragmatics]]. But then, searches in mainspace will see that content and the question is whether that is good. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:21, 15 October 2025 (UTC)

:What about to propose the user to write some guidelines, how other can participate instead of deleting it? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:03, 16 October 2025 (UTC)
:: I plan to move the pages to userspace as I proposed. If someone wants to ask KYPark to address the problems, they should feel free. There will be plenty of time for KYPark to address the problems while the material is in user space. After the problems are addressed, the material can be moved back to mainspace. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:38, 15 November 2025 (UTC)
:So I would '''delete''' it. In the blocked user space its useless. The user cannot improve it and Wikiversity is not free hosting service for personal pages. My believe is, that there should be just a few working pages in the users spaces. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:30, 11 March 2026 (UTC)

'''Move'''. Insufficient statement of learning objective or connection to related learning resources with insufficient current activity to stay in main space. The page was originally [[History of pragmatics]] but was moved by Dave B. Therefore, I suggest moving to [[User:KYPark/History of pragmatics]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:57, 22 November 2025 (UTC)
{{archive bottom}}

== [[IMHA Research Archives]] ==
I propose to '''move to userspace''', including the subpages. I struggle to understand how Wikiversity readers are supposed to benefit from the material here and in the subpages. In the log, there is e.g. '10 February 2019 Marshallsumter discuss contribs deleted page IMHA Research Archives (content was: &quot;{&lt;nowiki/&gt;{Delete|Author request}} Thanks! -&quot;)', so the page was deleted before, but not the subpages.

We could also delete all the material if we have strong enough suspicion too much of it is copyright violation. In any case, moving to user space improves the matter a little by moving the content away from Google search. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 13:38, 9 November 2025 (UTC)

:Looking at some sub-pages, they can be deleted e.g., because they only consist of broken links or are largely empty. I deleted a couple but haven't been through all to check. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:27, 10 November 2025 (UTC)

As an example, let me give the wikitext content of [[IMHA Research Archives/3. Scientific litterature search, storage and use]]:
&lt;pre&gt;
==[[/Medicina Maritima - the Spanish scientific maritime health journal/]]==

==[[/PubMed/]]==

==[[/Google and Google Scholar/]]==

==[[/Zotero/]]==

==[https://www.dropbox.com/sh/d91z7bcyelfvk42/AAAkIvjtBnnFMbiU9ZLOdVL9a/Andrioti_database%20sources0310.pptx?dl=0 Maritime health web portal ressources ]==
&lt;/pre&gt;
The wikilinks are red; the external link to dropbox says &quot;You don't have access&quot;. This was made in 2016. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 09:04, 11 November 2025 (UTC)

:I suggest delete -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 03:27, 12 November 2025 (UTC)
:: I think we should avoid deletion as much as possible, instead moving to user space (bar copyvio, ethics violation, etc.). This is a good general principle. It greatly improves auditability and makes it so much easier for anyone to request undeletion since they know what content they are requesting for undeletion. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 09:52, 12 November 2025 (UTC)
:::Do not recreate Wikiversity from the educational and research project to the personal blog. That will lead to the cancelation of it by WMF. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:44, 20 November 2025 (UTC)
:::: The English Wikiversity has a long tradition of moving problematic content to user space, as per evidence collected at [[User:Dan_Polansky/About Wikiversity#Moving pages to userspace]]. If Wikimedia Foundation finds this problematic, they can start a discussion in Colloquium and state their concerns. They do not need to make explicit threats at first; they can start a discussion and explain why it is problematic. They can even do it from an anonymous IP and provide a well-articulated reasoning. And anyone else can start a discussion in Colloquium to change this tradition. I do not see why we should not want to change that tradition based on well-articulated, compelling reasoning. I see no reason why Juandev should be making threats instead of them, on a per RFD basis. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:58, 21 November 2025 (UTC)
:::: If Juandev is ''sincere'' about deleting very-low-value items ''from user space'', he should perhaps demonstrate that by asking his pages like [[:cs:Uživatel:Juandev/Problémy/Kov/Repase dvířek elektroskříně]] to be deleted; otherwise, I register a ''glaring inconsistence''. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 07:43, 21 November 2025 (UTC)
::What was the original delate page about @[[User:Jtneill|Jtneill]]? I guess that would be crucial for the decission. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:48, 20 November 2025 (UTC)
:::@[[User:Juandev|Juandev]] the couple of pages I checked and deleted were much like @[[User:Dan Polansky|Dan Polansky]] posted above i.e., headings with empty sections and/or broken links but no substantive content. But I think each sub-page needs checking. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 21:59, 20 November 2025 (UTC)
::::So I'm saying that the main page usually determines what the other pages are for. But if I don't know the page because it's been deleted, or why was deleted (deletion based on the founder's request is probably not the rule), it's hard to judge. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 22:16, 20 November 2025 (UTC)
:::::I've pasted the original content of the root page: [[IMHA Research Archives#Original page]] (i.e., prior to the content being removed and deletion requested) to help understand the context for the sub-pages. In 2018, Saltrabook blanked the page, indicating that the content had been moved elsewhere, and requested page deletion. Marshallsumter then deleted the main page but not the sub-pages. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 01:58, 21 November 2025 (UTC)
::::::I see, so if those subpages are usefull I would keept them, if not I would delete them. I dont see a point of providing free hosting to sombody, by moving many pages to their user space. The question is if we want to host (i.e. to have in the main ns) lists of links elsewhere. I have no opinion on that. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:11, 22 November 2025 (UTC)

: Let me clarify that while many of the subpages are like the example above, [[IMHA Research Archives/Scientific litterature search, storage and use/Zotero]] is different:
:: &quot;A continuous critical and evidence based learning is a core issue in clinical practice, research, teaching, publication and prevention activities. The Zotero Program is just one of many scientific literature management programs, that should be used for these purposes. Of course one can live without such a database but it helps a lot and can save a lot of time that could be used for more interesting issues. Not only that, but it helps to create better publications and knowledge. Without this program it can be very time consuming to publish a scientific article with the requested style for the references. Further in daily practice when you want to collect and cite a few references for a specific evidence in a clinical colloquium and discussion, this program is excellent. Therefore we strongly recommend that all maritime health persons learn how to use this excellent tool in their daily maritime health practice of all different types. There are good online courses for self-instruction on how to use Zotero. For example this one: Zotero fast online course But in order to increase IMHAR´s collective scientific strength in the use of EBM we would like to give training sessions in every possible opportunity, IMHA Symposia, seminars and other types of meetings. The database is useful for personal purposes but especially also for collaborative aims. At the IMHAR meeting in Paris Oct 7th 2016 we will give an introduction to the program by showing how it can be used in the daily practice and discuss strength and weaknesses compared to other similar databases.&quot;
: Even longer is e.g. [[IMHA Research Archives/Scientific litterature search, storage and use/Medicina Maritima - the Spanish scientific maritime health journal]].
: However, that does not mean these should be salvaged. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 07:53, 21 November 2025 (UTC)

== [[Palliative medicine]] ==

Underdeveloped and has not been improved on since 2007. Author inactive. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 21:42, 14 December 2025 (UTC)

:Delete, per nominator [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:16, 22 January 2026 (UTC)
:Yes, I would also expect there to be more and especially that someone would write how to use it. However, it still seems to me to be a useful thing in the sense of a syllabus, so that someone who is interested in the topic knows what information to obtain in order to get a complete picture of the topic. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:55, 16 March 2026 (UTC)

== [[Canadian Wilderness]] ==
{{archive top|Deleted per nom. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:07, 17 May 2026 (UTC)}}
This page doesn't seem to belong to wikiversity. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 09:55, 6 February 2026 (UTC)

:In principle there could be some material useful here but in practice, I don't see what this page is adding as an educational resource. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 12:54, 6 February 2026 (UTC)
:I can see this being a useful resource to a bigger project. Maybe we could move it to the &quot;[[Wikiversity:Drafts|Draft]]&quot; namespace vs. deleting it? —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 13:28, 6 February 2026 (UTC)
::Does anyone plan to work on it? [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 01:59, 8 February 2026 (UTC)
:::Next week the page has it's 17th birthday. Ever now and than someone added to it. With a lot of work it could be a nice encyclopedic article but making it educational .... Merging it may take more work than rewriting it. Move to Draft might be the best option. [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 08:58, 12 February 2026 (UTC)
{{archive bottom}}

== [[LQR Control for an Inverted Pendulum]] ==
Underdeveloped resource, has not been edited for more than a decade. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 08:03, 16 March 2026 (UTC)

:Looks like a test, '''delete'''. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:30, 27 March 2026 (UTC)

== False flag &quot;authority hack&quot; user page deletion ==
{{archive top|'''Not undeleted''', the requester dropped the request. See Wikiversity:Requests for Deletion v. 2803217.--[[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:36, 10 May 2026 (UTC)}}
'''Undeletion requested'''

Hi, Juandev marked my user page as &quot;spam&quot; and &quot;authority hack&quot;, and deleted it. 

First, I asked him for help with &quot;time limit for new users&quot;, and he replied - I should admit I dont know, what is &quot;new user limit&quot;, but if filter blocks your page because of certain external link, you may force to save anyway and sometimes it works. It should not work, when the website is blacklisted. As of now, I am not seeing you to save page in main namespace, so try to save it without external links first. 

Then he wrote me another message: Well, I have analyzed your contribution to Wikiversity and I should point out here, that this project is not a place for advertising, so there is no way of promoting your books and authority this way. - probably referring to the intro of my About me page where I present me and my work. 

Before I could explain him the difference between the neutral information and advertising and promotion, he deleted my user page. 

Here is my answer I posted to the discussion today: 

: Hi, my About Me page is just an info page with the neutral as possible presentation of my work.
:
: There is a big difference between informing and advertising. Informing is neutrally stating that something exists and requiring no action, while advertising is a special communication form with intent to cause certain action from readers. For example, click here, click there, order this, buy that.
:
: There is no such intention, form, or terms on my info page. Just neutral information. I don't hide and I am not ashamed that I am write and author, and that is a part of the usual bio, including works. I checked your user page: &quot;I graduated from the Czech University of Life Sciences in Prague and studied information science at the Faculty of Arts of Charles University.&quot; I think that if you had written a book on Life Science, you would have mentioned that as well.
:
: Most of the Info page is about my research and AIPA Method which is a valid contribution to psychology, consciousness studies, identity theory, and personality development. Actually, my paper '''AIPA Method: A Cognitive-Phenomenological Model for Identity Reconstruction and Stabilization in Pure Awareness''' is now in the peer review procedure at Journal of Consciousness Studies.
:
: Here is a part from the Wikiversity AIPA Method page in creation (waiting for the end of the time limit for new users):

: == Introduction ==
: The AIPA Method addresses a gap in contemporary personal development and consciousness science: most evidence‑based approaches (CBT, MBSR, MBCT, standard meditation) operate at the level of mental content—reframing thoughts, observing them, or reducing their impact—rather than at the level of identity structure. In contrast, AIPA targets the structural relationship between the self and the mind, aiming at durable identity reconstruction rooted in Pure Awareness rather than symptom management.
:
: The central research question of the primary AIPA preprint is whether a structured, sequentially staged method can produce permanent identity reconstruction rooted in Pure Awareness, and how such a method compares to established approaches in scope, mechanism, and outcome.
:
: == Theoretical foundations ==
: The AIPA framework is grounded in the cognitive‑phenomenological tradition (e.g., McAdams, Varela, Metzinger, Erikson), contemporary consciousness science on minimal phenomenal experience, and qualitative methods advocacy in psychology. It builds directly on:
:* Empirical work on pure awareness and Minimal Phenomenal Experience (MPE), especially Gamma &amp; Metzinger’s large‑scale study of content‑reduced awareness states.
:* Metzinger’s proposal of minimal phenomenal experience as an entry point for a minimal unifying model of consciousness.
:* Narrative identity and partial‑self models within personality and identity theory.
: Within this backdrop, AIPA proposes Pure Awareness as a distinct, operationally specified state that can become a structural ground of identity rather than a transient meditative experience.
:
: == Experiential empiricism ==
: The empirical foundation of the AIPA Method is explicitly first‑person and experiential, combining:
:* A 22‑year longitudinal autoethnographic self‑study (2003–2025) documenting partial personality episodes, protocol use, and outcomes.
:* A 13‑year prospective verification period with zero self‑reported recurrence of targeted harmful behaviors after a dated stabilization point (1 January 2006).
:* A high‑ecological‑validity “stress test” during acute bereavement, used to examine whether non‑reactive awareness remains stable under maximal provocation.
:* Two independent practitioner cases (an Amazon‑verified report and a structured questionnaire case) providing preliminary convergent signals across cognitive, emotional, behavioral, and identity dimensions.
:
: All central constructs (Pure Awareness, partial personalities, the Switch, identity stabilization) are operationalized with explicit phenomenological and behavioral criteria intended to enable replication and future third‑person measurement.
:
: I believe this is a valid contribution to Wikiversity.
:
: Best regards, Senad [[User:Senad Dizdarević|Senad Dizdarević]]


I suggest you check the deleted user page, and see for yourself if it is &quot;spam&quot; and &quot;authority hack&quot;, or a legit author's page with one paragraph short presentation, while the rest of the page is about my research project. 

Thank you for undeleting my user page, so I can use it. 

Best regards, 

Senad Dizdarević [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:26, 2 April 2026 (UTC)

:Hi Senad,
:Welcome to Wikiversity.
:It looks like you tried adding similar content to Wikipedia and ran into similar difficulties over there ([[w:User talk:Senad Dizdarević]])? Perhaps that is what has led to you Wikiversity?
:Basically, if you'd like to collaborate and help build open educational resources, feel free to contribute to Wikiversity. But if the primary motivation is to promote your autobiographical work you're probably going to run into challenges.
:Sincerely,
:James
:-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:11, 3 April 2026 (UTC)
::James, Hi, and thank you for your answer. 
::Yes, in 2025, I created the autobiographic page on Wikipedia, which was removed because of the links to my books on Amazon. To admin, I explained that I did not know the rules, and agreed that page is removed. Now I know that somebody else must write a Wikipedia page for you. 
::On the deleted user page on Wikiversity, there were no links to Amazon or any other form of promotion, just neutral as possible basic presentation of my writing (one sentence) and current project (the rest of the page). 
::I created Wikiversity page to present my AIPA Method project, to invite researchers to read it, give their opinion, and conduct empirical researches in their institutions. Now, it is in a theoretical phase, and needs more empirical testing. 
::Best regards, 
::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:03, 3 April 2026 (UTC)
:::It looks to me like the primary motivation for contributing to Wikiversity is to drive traffic / search engine ranking to your website?
:::* [[User:Senad Dizdarević]]
:::* [[AIPA Method]]
:::-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 01:36, 4 April 2026 (UTC)
::::No, it is not. There is no link to my website, so &quot;driving traffic to my website&quot; is not possible. 
::::For your educational purposes: 
::::Copilot &quot;AI:  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:38, 4 April 2026 (UTC)
:::::So do you still insist of undeleting your former version of your userpage if you have created the new one? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:15, 6 April 2026 (UTC)
::::::No, because in the moment of undeletition, somebody could delete it again, and so on. Thank you for not deleting my new user page, as it is made in your user page image.  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 08:59, 6 April 2026 (UTC)

{{archive bottom}}

== Undeletion request ==

It was deleted by an admin without discussion and with untrue rationale. If people take offense with the question that doesn't mean it's not a valid question and the page was good. Please undelete the Wikidebate page [https://web.archive.org/web/20250810030352/https://en.wikiversity.org/wiki/Is_it_likely_that_Earth_has_been_visited_by_aliens_millions_of_years_ago%3F Is it likely that Earth has been visited by aliens millions of years ago?]

There are lots of sources on the subject, the wikidebate is sourced very well compared to other wikidebates and wikiversity pages, and the page is educational, useful and of good quality. [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 23:57, 10 April 2026 (UTC)

:Page: [[Is it likely that Earth has been visited by aliens millions of years ago?]]
:Ping: [[User:Atcovi|Atcovi]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:21, 11 April 2026 (UTC)
:There is no need for a discussion for straight garbage-level, pseudoscientific content.
:For '''Is it likely that Earth has been visited by aliens millions of years ago?''', the flaws for this page wouldn't even take someone more than a few minutes to assess:
:* Essentially, the &quot;pro&quot; arguments unproven claims being derived from irrelevant, established facts (basically: &quot;it is likely aliens have came because Earth has existed for so long [sources proving Earth's longevity]&quot;). These are not serious, scientifically-backed arguments - these are non sequiturs. It's as if I said Wikipedia has existed longer than my existence on Earth ([https://d1wqtxts1xzle7.cloudfront.net/74351725/eyJoIjogImZiODhmYzNkODU1N2UxMWExYzUyODJiYzgzZTRmZDM4OTBjODY5YWMzMjA3NDNmOWEyZTA0ZTU3ZGYwZjAyYTkiLCAidSI6ICJodHRwczovL3B1cmUuaHZhLm5sL3dz-libre.pdf?1636354596=&amp;response-content-disposition=inline%3B+filename%3DCritical_Point_of_View_A_Wikipedia_Reade.pdf&amp;Expires=1775872055&amp;Signature=GqbUZboYRvUYWi~aW40LT5eZSHrLuDL3o0-DxAH8vSvcJcGAuyByZWLF2oHTY6GlB72TqvZxpE-v9d4gvsA6myriYqO~QQQZgWxjT2JXjUWC-yiPcTF4l~lroJSi4dY0v9eKiBcU03l-aeUdrX8~UPfi0TfW0IhsmzH-VBR6X6FrzRpIqc6uM6n9YXfr5FRB3aCqqokU690af3n0Hguaub1Zgmh9qjYYqzBS0VOOHjKTTEQnDuadX3jl5CQeXYTaeCC3H0hMeVwHlratbrnuFEKC1aN0-5znCUoSzMEg21ECzGPTrSDM1W05dcK-u0ZTCeUGKAuC-2yRFL3sY46MIw__&amp;Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA#page=157 reputable source proving ''this'' fact]), therefore it's likely that my birth took place solely for the sake of me experiencing Wikipedia (0 backing). It makes no sense and no person with at least a high school-level of intelligence would take this seriously. 
:* What is worse is that the user is being misleading with their &quot;[the page is] sourced very well&quot; claim. The sources ''themselves'' don't even back up the claims. It's just used as proof for an established concept, where the user then uses this established concept to jump to an unsupported, laughable conclusion that is pulled out of thin air. It's utterly ridiculous to even consider such a page for mainspace since it clearly violates our [[Wikiversity:Verifiability]] policy. This is, once again, pseudoscientific content that has caused our website to reduce in quality over the last few years. 
:* Going source by source, we can see that:
:#[https://web.archive.org/web/20250918011642/https://timesofindia.indiatimes.com/blogs/thebigd/compress-earths-history-into-24-hrs-humans-came-at-1158-pm-yet-killed-70-of-wildlife/ ‘Compress Earth’s history into 24 hrs. Humans came at 11:58 pm, yet killed 70% of wildlife’] is literally just a blog post which doesn't even mention aliens or extraterrestrial life. It just talks about Earth's history in accordance with the 24-hour metric of time, and the author tries to use this article as a 'piece in the puzzle' of aliens &quot;possibly&quot; visiting Earth... which, once again, is unsupported and is not backed up anywhere in the article.
:#[https://web.archive.org/web/20250808053249/https://news.cornell.edu/stories/2023/11/jurassic-worlds-might-be-easier-spot-modern-earth The Cornell article does not even remotely support the idea that &quot;aliens visited Earth&quot;]. It mentions a ''chance'' of &quot;life there [a habitable exoplanet] might not be limited to microbes, but could include creatures as large and varied as the megalosauruses or microraptors that once roamed Earth.&quot;, but again, no justification to take this article as proof that &quot;aliens may have visited us!&quot;. There's no mention of aliens visiting Earth anywhere in the article. Once again this is only proving the background premise, but not the unsupported, nonsensical &quot;alien likelihood&quot; argument that the author of this garbage page is trying to push so desperately.
:#The Parker Solar Probe WP article does not even mention aliens either. It follows the same issues as the previous argument.
:And the other page this user complained about [https://en.wikiversity.org/wiki/User_talk:Atcovi#Deletion_of_educational_page_because_of_personal_opinion on my talk page] holds almost similar, maybe even more fatal mistakes, than this one. It has nothing to do with &quot;taking offense&quot;, this is just low-quality, garbage content. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 00:56, 11 April 2026 (UTC)
::Why do you think pro claims are required to be proven? It's possible to object to them and these are arguments, not contextualized to be statements of proven facts. And it's not a strange or unreasonable argument to make that since Earth has existed for long, it's more likely that aliens have come here in the past than in recent times or the near future. Instead of insulting others' intelligence, maybe engage with the actual reasoning rather than censoring it away. And there are lots of sources, such as [https://interestingengineering.com/science/alien-civilizations-may-have-visited-earth-millions-of-years-ago-study-says Alien Civilizations May Have Visited Earth Millions of Years Ago, Study Says] etc etc. The sources are used for the arguments themselves individually. [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 12:30, 11 April 2026 (UTC)
:::Because, once again, this is not a site that caters to rampant debating for the sake of &quot;we need to employ rationality and logic to solve the world's problems&quot;, we have policies that we need to fulfill. The claims made in the pro argument clearly do not meet [[Wikiversity:Verifiability]], since you cannot verify these arguments with the sources because they are not relevant. 
:::''&quot;And it's not a strange or unreasonable argument to make that since Earth has existed for long, it's more likely that aliens have come here in the past than in recent times or the near future.&quot;'' The point being is that these arguments are not supported by the sources. Even the article you mention poses the idea as a hypothetical model. This is just you twisting the article to fit your unsupported narrative. I'll bring direct quotes for you to show why the linked article does not help you:
:::* ''One problem the researchers do make sure to point out is that '''they are working with only one data point: our own behaviors and capabilities for space exploration'''. “We tried to come up with a model that would involve the fewest assumptions about sociology that we could,” Carroll-Nellenback told Business Insider. '''We have no real way of knowing the motivations of an alien civilization'''.'' --&gt; proves that this is just speculation and no evidence-based arguments have been provided for the idea that aliens likely visited Earth.
:::And I'm not sure if you read my entire response, but I ''did'' engage with your &quot;actual reasoning&quot; and exposed its weaknesses and lack of adherence to Wikiversity policies. If we allowed content that was just filled with non sequiturs we would have content that fails Wikiversity's educational objectives and reduces the overall quality of this website, hence why such a harsh stance needs to be taken. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 13:50, 11 April 2026 (UTC)
::::Thanks for proving that the Wikimedia ecosystem is unfit to deliberate on controversial topics. The question is entirely valid and the content is far better sourced than nearly all Wikidebates and has no genuine flaws. The only possible issue with it as far as I can see is that now that Wikidebates has been paused people can't add objections if they do have sth specific to say about the topic that's not already included on that page which already had plenty of Cons and objections.
::::The page was more educational than most of Wikiversity and it was well-sourced – wikidebates was for arguments so people were invited to make arguments based on sourced things or outlined logic and the page met [[WV:V]] and most pages on Wikiversity aren't sourced as good. Doesn't look like people can see beyond their biases and personal views here but that's more evident in the marginalization and deletion of wikidebates and the low activity in that project than these selective deletions. A constructive thing to do would be to add reasoned Cons and objections not yet on the page and people had plenty of time to do that. There are and will be other sites for free constructive rational adversarial deliberation (not a big loss in that sense). [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 16:31, 22 April 2026 (UTC)
:::::Thank you for failing to address any of my arguments and going on an unrelated, nonsensical tangent that has nothing to do with the discussion. Once you start producing work that aligns with Wikiversity's content policies instead of typing up laughable, pseudoscientific garbage, then maybe your work can be accepted and not removed. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 16:59, 22 April 2026 (UTC)
::::::I suggest you stop ridiculing things and learn respectfully forming genuine points about the subject at hand. {{tq|the idea as a hypothetical model}} but please learn first about what arguments are and why they're not the same as a statement of objective proven fact. [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 17:18, 22 April 2026 (UTC)

==Pages by Harold Foppele==
[[User:Harold Foppele]] is locally blocked indefinitely and globally banned for sockpuppetry. There were also WMF and local community concerns expressed about copyright violation and AI (over)use. As a result, I think the Wikiversity pages created by this account warrant review with regard what should be deleted, what should be retained etc.:
* [[Completing the square]]
* [[Number of independent spatial modes in a spherical volume]]
* [[Quantum]]
** [[Quantum/Andrew N. Jordan]]
* [[Quantum A Matter Of Size]]
* [[Quantum A Spooky Action at a Distance]]
* [[Quantum: A Walk Through the Universe]]
* [[Quantum Computing Algorithms in the NISQ Era]]
* [[Quantum Formulas Collection]]
* [[Quantum harmonic oscillator]]
* [[Quantum Matter Elements and Particles]]
* [[Quantum mechanics]]
** [[Quantum mechanics/Timeline]]
* [[Quantum mechanics learning module]]
* [[Quantum mechanics measurements]]
* [[Quantum Noisy Qubits]]
* [[Quantum optics beam splitter experiments]]
* [[Quantum: The Secret of Cohesion: How Waves Hold Matter Together]]
* [[Quantum Ultra fast lasers]]
* [[Speed of sound experiments]]
* [[User:Harold Foppele]]
-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 08:12, 17 May 2026 (UTC)

:'''Delete all''' Not worth keeping. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 08:27, 17 May 2026 (UTC)</text>
      <sha1>h8jx42e3ps1o0eednl41ko2r0pfejrv</sha1>
    </revision>
    <revision>
      <id>2809916</id>
      <parentid>2809915</parentid>
      <timestamp>2026-05-17T11:36:10Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <comment>/* LQR Control for an Inverted Pendulum */ Deleted</comment>
      <origin>2809916</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="56282" sha1="d8s8dq646jk3bl6hq745nug24k6pafo" xml:space="preserve">{{/header}}
[[Category:Wikiversity deletion]]

__TOC__

== [[Korean/Words]] ==
(I go to RfD instead of ''proposed deletion'' since many pages are affected.)

I proposed to quasi-delete, i.e. '''move to userspace''' of the main (or sole?) creator, {{User|KYPark}}.

The page is organized a little bit like a dictionary. It makes it redundant to Wiktionary except that Wikiversity allows original research and there does seem to be original research there. Thus, its being organized as a dictionary would alone not necessarily be a problem.

Where I see a problem is in the organization and execution/implementation. Consider [[Korean/Words/가다]], which seems rather typical of the subpages (some subpages are like categories and transclude the pages for individual words):
* On the putative definition line, there is this: &quot;한곳에서 다른 곳으로 장소를 이동하다&quot;, apparently(?) in Korean. That does not seem to fit well into the ''English'' Wikiversity.
* There seems to be some original research into etymological relations between Korean and European languages in the &quot;Comparatives&quot; section (from what I recall, the English Wiktionary rejected this kind of content from KYPark). Admittedly, it is marked using &quot;This is a primary, secondary and/or original Eurasiatic research project at Wikiversity&quot;, so it could be tolerable, but even so, one has to wonder whether Wikiversity wants this kind of fringe science/research or outright pseudo-science.
** Fringe science: fringe physics has been moved to user space before. This would be fringe etymology. But then, original research is allowed.

Deletion is not required; moving to user space suffices, I think. Alternatively, one could at least rename the pages to make it clear from the title that this is not Wikiversity voice but rather KYPark voice, e.g. &quot;Korean/Words (KYPark)/...&quot; or  &quot;Korean/Words/KYPark/...&quot;  (recall the &quot;Fedosin&quot; pages featuring the name &quot;Fedosin&quot;).

Methodology: I see almost no methodological notes spanning the words at [[Korean/Words]]. And yet, if this is original research inventing new etymological connections, surely there should be some general considerations/analysis on how to proceed and how that manner of procedure differs from mainstream etymology?

Prefix index (max 200 items?):
{{collapse top}}
{{Small START}}
{{Special:Prefixindex/Korean/Words}}
{{Small END}}
{{Collapse bottom}}
--[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 09:33, 24 September 2025 (UTC)

:I would keep it. If there is a course of Korean, why not to have a resesearch on Korean vocabulary? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 19:53, 16 October 2025 (UTC)
:: I propose to dismiss the above input: 1) it does not contain any argument, except for a question, and a question is not an argument (it can be so reinterpreted, but that includes additional burden on the interpreters, in interpreting it the wrong way); 2) it ignores all the issues I have raised, including that there is something like definition lines in Korean, in this ''English'' Wikiversity. To answer the question asked: there can be a research on Korean vocabulary in the mainspace, but not one showing the defects I identified above. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:35, 15 November 2025 (UTC)
:I've reviewed a sample of approximately 20 of the Korean/Words sub-pages and lean towards moving to user space because:
:* The pages appear to be an idiosynchratic collection of etymological pages about Korean language
:* There is minimal English instruction which is problematic for English Wikiversity
:* There is no explanation of research method
:* There is no educational rationale
:-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:31, 22 November 2025 (UTC)
:Well, since the original creator has indef I change my mind and I would '''delete''' it. The case is nobody knows how to continue with the research and if we move it to the userspace, the user cannot improve it eihter. What the original user can do to request admin, to send them a contentent to their email for example if they really want to improve the resource elsewhere. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:38, 11 March 2026 (UTC)

== [[Enhancing Web Browser Security through Cookie Encryption]] ==
{{archive top|'''Kept'''. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:28, 17 May 2026 (UTC)}}
To avoid further conflict with the user who entered this text into Wikiversity, I am opening a RFD request.

I am not sure about how to proceed, although I am inclined to move it out of mainspace = quasi-delete. I am looking forward to get input from others, especially curators and custodians. Some considerations:

1) There is perhaps no more appearance/suspicion of copyright violation, now that the ResearchGate (RG) article (of which this is a copy, perhaps an incomplete copy?) carries a license.

2) The article is not a complete replica from RG: at a minimum, it lacks images. The inserter could have continued editing the page in his user space before he uploads images, that is, before he finalizes the page for consumption, but that did not happen. I did not check whether the text is an exact one-to-one match; the article does not indicate anything in that regard.

3) The principle implied seems to be this: users should feel free to duplicate non-peer-reviewed articles from RG in English Wikiversity, perhaps to increase the Google search and LLM yield. I find this problematic, in part for the duplication. I would say: choose a venue and publish it there. If RG is not good enough for you as a publishing venue, choose Wikiversity instead, but not both?

4) There are some features that appear unduly promotional. There is a link to a dot com home page of the inserter of the article. I dot not know how we handle or should handle this, whether prohibit such a link, etc. This is perhaps not so much a call to quasi-deletion but a call to make it less promotional.

5) I cannot determine the value of such an article. It seems to be a pseudo-article describing someone's browser extension. Can someone do a better analysis?

--[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:48, 8 October 2025 (UTC)

:2) Images for Wikicommons are being created, it will take a lot of time. and the text is not an exact one-to-one match
:3) I also mentioned that It was being created so that it is more accessible from mobile phone, which is not possible in RG or in Zenodo
:Let me clarify the purpose of uploading it to different platforms
:Zenodo - registration and to link DOI
:RG - Self Archiving 
:Wikiversity - Accessible by anyone from any device. LLMs may get trained on Wikiversity data or use these data for indexing 
:5) The paper is a result of a research project which involved a browser extension which was built to test the theory.  [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 01:34, 9 October 2025 (UTC)
:: I find the practice here of publishing non-identical but similar text (&quot;the text is not an exact one-to-one match&quot;) with almost the same title to be problematic. I cannot imagine this is a recommended practice in academic publishing. At a minimum, somewhere near the top, the page should say something like the following: &quot;This text is based on article ___ published at ___ but is not identical. The author of the differences/changes is ___.&quot; Everything else leads to an undesirable confusion. In academic publishing, the title of an article serves as key part of identification of the artifact.
:: As I said before, I seen nothing particularly academic article-like about the page except for external/superficial signs. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:30, 9 October 2025 (UTC)
:::That Article has been published under CC BY SA 4.0
:::And I am one of the author of the article. That gives me right to modify text and publish it under a similar name. However, I will add the disclaimer text that you have suggested. I hope that helps.  [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 06:07, 9 October 2025 (UTC)
:::: It may give you that right from the ''copyright'' perspective, but perhaps not from ''academic publishing integrity'' perspective. Unfortunately, I do not have any guideline handy; I am merely following my common (or not so common) sense. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:32, 9 October 2025 (UTC)
:: I would like to ask: was this article guided by someone from an academic institution, such as a university? Is it reviewed at least in some weak sense? --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:39, 9 October 2025 (UTC)
:::Yes, This article has been reviewed by two academic professors, their names are also listed as co authors.
:::First, a project guide would help us with selecting a topic and with the document 
:::Second, an Internal examiner would go through our experiment and approve it
:::Finally, External Examiner would examine the documentation and verify it. 
:::We were required by these professors to put their name under contributions [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 05:48, 9 October 2025 (UTC)
:: Let me explicate the promotional potential of such a page a bit: one can go to the page of the article in Wikiversity --&gt; https://tomjoejames.com/ --&gt; HitMyTarget (a commercial, profit-making entity?) Why would the link be to a commercial web site rather than an academic page, or perhaps a LinkedIn account, which I think the person has? There could also be no link at all; a search for the name would turn out something in Google as well. But providing a direct link would drive users/viewers toward that website much stronger since otherwise the viewer of the page would have to open a new Google search window or the like. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:45, 9 October 2025 (UTC)
:::It is evident that the website is not even close to being complete. 
:::I will be creating a separate page under the same domain name specifically for people to contact me.
:::The url would probably be defined as tomjoejames.com/contact-me/
:::I haven't decided yet. But that is my personal website.
:::If the community requires me to remove it, I will. But personally I think people who are from here most likely to click the link to know more about me or to contact me. Either way I think my personal website serves the purpose. 
:::As for the HitMyTarget, it can be traced from any of my links. From my research gate profile, linkedin page or even my own userpage.
:::On the article I did not add any promotional content about myself, I hyperlinked only my own name. I do not know how that is promotional. [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 06:04, 9 October 2025 (UTC)
:::: I am pausing any further responses from me to see whether anyone else has any input. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:30, 9 October 2025 (UTC)
:What does it mean &quot;There is perhaps no more appearance/suspicion of copyright violation&quot;? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 19:57, 16 October 2025 (UTC)
:I have accepted VRT permission per [[ticket:2025100410001149]] FYI. [[User:Matrix|Matrix]] ([[User talk:Matrix|discuss]] • [[Special:Contributions/Matrix|contribs]]) 11:00, 28 October 2025 (UTC)
::Thank you Matrix [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 12:43, 28 October 2025 (UTC)
:I would '''delete''' it. 1) it states its a learning resource. It could not be a learning resource as not rewieved original research. 2) It is not an ongoing research, nor the research was performed on Wikiversity - wv is not a preprint or article database. Maybe it could be moved elsewhere withn Wikimedia domain, but I dont know where. So I would delete it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:56, 20 November 2025 (UTC)
::I would '''keep it.''' Like Dan had pointed out,  we do have article-like pages in Wikiversity, and this is not just a random pseudo science article but an article that is a report of an final year project, it has been reviewed by 3 professors whose name has been mentioned at the very beginning.   [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 14:50, 21 November 2025 (UTC)
:::I think it is not good to rate pages by appearance. It can be done on other Wikimedia projects, but it cannot be done on Wikiversity, because Wikiversity does not create a static format for presenting information, but is focused on the goal and process. Unfortunately, the goal and process do not have a uniform format. While a target article on Wikipedia or an entry on Wiktionary have some standard target format, Wikiversity does not. That is why I personally rate pages according to the goals and their assessment. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:05, 22 November 2025 (UTC)

Further reading for this nomination: [[S: Wikisource:Proposed_deletions/Archives/2025#Index:Cookie_Encryption.pdf]]; EncycloPetey handled the matter. Let me quote his wisdom on Zenodo (which I lack): &quot;This is tied to a PDF on Commons that was uploaded as &quot;own work&quot; with a CC license and a doi link to Zenodo, with no indication of where this paper was published or if it was published. Zenodo is not a publisher; it is a site for storing research and sharing papers. If Zenodo is the only place this was &quot;published&quot; then it was effectively self-published. --EncycloPetey (talk) 16:14, 15 September 2025 (UTC)&quot;

--[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 08:55, 9 October 2025 (UTC)

:Can you clarify what point are you trying to state? Didn't I already state that the article is published by me? 
:I first created the article in wikisource which I thought would be the perfect place, unfortunately they do not allow self published articles that are not notable. Then I discovered Wikiversity where they allow self published articles. That is why I created the article here. 
:Unlike in wikisource, I did follow guidelines.
:Ever since you deleted the first article, I spent time reading Wikiversity guidelines and I do think that I am following it perfectly.
:I would like to get your suggestions on how should I improve the page,  10 points would be sufficient. 
:Because your goals or intentions are confusing me very much. At first you told me that the article is exactly the same as the preprint in RG and therefore there is no use to it here. And then when I continued to optimize it for Wikiversity, you went ahead and said it is problematic according to recommended academic publishing. 
:Atleast just respond to the points that I have made whether you agree or disagree. So that I clarify and proceed to discuss points that are important and relevant 
:Have you published an research article? If yes, could you send it to me so that I can see the format you have done it [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 10:45, 9 October 2025 (UTC)
:: I am giving a chance/time to other curators/custodians to look at the matter and respond to my inputs. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 11:14, 9 October 2025 (UTC)
:: Incidentally, above I counted 4 questions (or more), 1 request (or more?) and 1 command (or more?). That is a behavior of a commanding entity. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 11:24, 9 October 2025 (UTC)

I would '''delete it''''. It's more like an academic communication than a learning resource or research.--[[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:32, 26 October 2025 (UTC)
:: In the above post, I do not see any valid rationale for deletion: we do have article-like pages, in Wikijournals and also e.g. in [[Physics/Essays/Fedosin/Stellar Stefan–Boltzmann constant]]. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 08:59, 3 November 2025 (UTC)
:::But I do, see above. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:56, 20 November 2025 (UTC)

:it is a '''student research paper''' forming part of a learning resource on web security and encryption.
:The project was conducted as part of a final-year university course and documented as a practical study on cookie encryption and it has been reviewed by three professors. However, I will be creating a sub page for the article to elaborately describe the experiment that we have conducted and the results we got.    [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 15:57, 26 October 2025 (UTC)
::And why should w host research papers? Wikiversity is not an academic Journal nor repository. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:06, 22 November 2025 (UTC)
:::I do not wish to go through this same argument once again, I've already answered to this question several times in Dan's talk page, Colloquium. you can refer them. I am not hosting the research paper here, I have already hosted the pdf in the ResearchGate, I have published a text version in the wikiversity so that it may be useful for others. Unless you can show me how that article is totally useless, I would like to '''keep''' the article in the wikiversity.    [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 10:13, 22 November 2025 (UTC)
::::And thats the point I am having. Wikiversity is not paper repository. The only way is to publish it via WikiJournal, but they want it for Wikipedia usually. Why wikiversity should be a duplication of ResearchGate, Academia or Zenodo?
::::What I can read on [[Wikiversity:What is Wikiversity?]] policy is, that Wikiversity research &quot;...includes interpreting primary sources, forming ideas, or taking observations.&quot; The article doent look to fall into this. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:43, 22 November 2025 (UTC)
:::::Well, then how come you missed the term &quot;Learning Projects&quot;? As Jtneill had pointed out, this is a legitimate learning project. And also, I do have the VRT permission to host this article on Wikiversity.  [[ticket:2025100410001149]] . besides ResearchGate is an self-archiving platform. the document version in it is not accessibly to screen readers (usually disable people use them), Translators, and also for the mobile readers. therefore I do have valid reasons to publish this article on wikiversity. 
:::::# It is a learning project, therefore according to WIkiversity Policy, It qualifies. 
:::::# I have an explicit VRT permission to host this article on Wikiversity
:::::# Versions that are published in RG, Zenodo are documents, and they are not accessible by screen readers or mobile users. Therefore it is imperative that an article version of this paper exist on here. 
:::::Therefore this article qualifies to stay here on Wikiversity.  [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 11:22, 22 November 2025 (UTC)

'''Keep'''. This is a legitimate student learning project that may be of use to others. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:51, 22 November 2025 (UTC)
{{archive bottom}}

== [[Pragmatics/History]] ==
{{archive top|Deleted. Other related resources have been deleted. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:24, 17 May 2026 (UTC)}}
Another KYPark page and subpages with unclear organization scheme. Contains fairly many redlinked items. See also [[User:KYPark/Literature]], perhaps a similar concept. Unlikely to be really useful for others but KYPark. '''Move to user space'''.

As an alternative, moving to [[History of Pragmatics (KYPark)]] would make sense to me: the topic is identified using a natural-language phrase (instead of the relatively unnatural slash) and the responsible editor is indicated so that the reader knows whether to look or not. And for those who oppose the brackets (which I like): [[History of Pragmatics/KYPark]]. Or also: [[KYPark/History of Pragmatics]]. But then, searches in mainspace will see that content and the question is whether that is good. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:21, 15 October 2025 (UTC)

:What about to propose the user to write some guidelines, how other can participate instead of deleting it? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:03, 16 October 2025 (UTC)
:: I plan to move the pages to userspace as I proposed. If someone wants to ask KYPark to address the problems, they should feel free. There will be plenty of time for KYPark to address the problems while the material is in user space. After the problems are addressed, the material can be moved back to mainspace. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:38, 15 November 2025 (UTC)
:So I would '''delete''' it. In the blocked user space its useless. The user cannot improve it and Wikiversity is not free hosting service for personal pages. My believe is, that there should be just a few working pages in the users spaces. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:30, 11 March 2026 (UTC)

'''Move'''. Insufficient statement of learning objective or connection to related learning resources with insufficient current activity to stay in main space. The page was originally [[History of pragmatics]] but was moved by Dave B. Therefore, I suggest moving to [[User:KYPark/History of pragmatics]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:57, 22 November 2025 (UTC)
{{archive bottom}}

== [[IMHA Research Archives]] ==
I propose to '''move to userspace''', including the subpages. I struggle to understand how Wikiversity readers are supposed to benefit from the material here and in the subpages. In the log, there is e.g. '10 February 2019 Marshallsumter discuss contribs deleted page IMHA Research Archives (content was: &quot;{&lt;nowiki/&gt;{Delete|Author request}} Thanks! -&quot;)', so the page was deleted before, but not the subpages.

We could also delete all the material if we have strong enough suspicion too much of it is copyright violation. In any case, moving to user space improves the matter a little by moving the content away from Google search. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 13:38, 9 November 2025 (UTC)

:Looking at some sub-pages, they can be deleted e.g., because they only consist of broken links or are largely empty. I deleted a couple but haven't been through all to check. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:27, 10 November 2025 (UTC)

As an example, let me give the wikitext content of [[IMHA Research Archives/3. Scientific litterature search, storage and use]]:
&lt;pre&gt;
==[[/Medicina Maritima - the Spanish scientific maritime health journal/]]==

==[[/PubMed/]]==

==[[/Google and Google Scholar/]]==

==[[/Zotero/]]==

==[https://www.dropbox.com/sh/d91z7bcyelfvk42/AAAkIvjtBnnFMbiU9ZLOdVL9a/Andrioti_database%20sources0310.pptx?dl=0 Maritime health web portal ressources ]==
&lt;/pre&gt;
The wikilinks are red; the external link to dropbox says &quot;You don't have access&quot;. This was made in 2016. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 09:04, 11 November 2025 (UTC)

:I suggest delete -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 03:27, 12 November 2025 (UTC)
:: I think we should avoid deletion as much as possible, instead moving to user space (bar copyvio, ethics violation, etc.). This is a good general principle. It greatly improves auditability and makes it so much easier for anyone to request undeletion since they know what content they are requesting for undeletion. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 09:52, 12 November 2025 (UTC)
:::Do not recreate Wikiversity from the educational and research project to the personal blog. That will lead to the cancelation of it by WMF. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:44, 20 November 2025 (UTC)
:::: The English Wikiversity has a long tradition of moving problematic content to user space, as per evidence collected at [[User:Dan_Polansky/About Wikiversity#Moving pages to userspace]]. If Wikimedia Foundation finds this problematic, they can start a discussion in Colloquium and state their concerns. They do not need to make explicit threats at first; they can start a discussion and explain why it is problematic. They can even do it from an anonymous IP and provide a well-articulated reasoning. And anyone else can start a discussion in Colloquium to change this tradition. I do not see why we should not want to change that tradition based on well-articulated, compelling reasoning. I see no reason why Juandev should be making threats instead of them, on a per RFD basis. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:58, 21 November 2025 (UTC)
:::: If Juandev is ''sincere'' about deleting very-low-value items ''from user space'', he should perhaps demonstrate that by asking his pages like [[:cs:Uživatel:Juandev/Problémy/Kov/Repase dvířek elektroskříně]] to be deleted; otherwise, I register a ''glaring inconsistence''. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 07:43, 21 November 2025 (UTC)
::What was the original delate page about @[[User:Jtneill|Jtneill]]? I guess that would be crucial for the decission. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:48, 20 November 2025 (UTC)
:::@[[User:Juandev|Juandev]] the couple of pages I checked and deleted were much like @[[User:Dan Polansky|Dan Polansky]] posted above i.e., headings with empty sections and/or broken links but no substantive content. But I think each sub-page needs checking. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 21:59, 20 November 2025 (UTC)
::::So I'm saying that the main page usually determines what the other pages are for. But if I don't know the page because it's been deleted, or why was deleted (deletion based on the founder's request is probably not the rule), it's hard to judge. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 22:16, 20 November 2025 (UTC)
:::::I've pasted the original content of the root page: [[IMHA Research Archives#Original page]] (i.e., prior to the content being removed and deletion requested) to help understand the context for the sub-pages. In 2018, Saltrabook blanked the page, indicating that the content had been moved elsewhere, and requested page deletion. Marshallsumter then deleted the main page but not the sub-pages. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 01:58, 21 November 2025 (UTC)
::::::I see, so if those subpages are usefull I would keept them, if not I would delete them. I dont see a point of providing free hosting to sombody, by moving many pages to their user space. The question is if we want to host (i.e. to have in the main ns) lists of links elsewhere. I have no opinion on that. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:11, 22 November 2025 (UTC)

: Let me clarify that while many of the subpages are like the example above, [[IMHA Research Archives/Scientific litterature search, storage and use/Zotero]] is different:
:: &quot;A continuous critical and evidence based learning is a core issue in clinical practice, research, teaching, publication and prevention activities. The Zotero Program is just one of many scientific literature management programs, that should be used for these purposes. Of course one can live without such a database but it helps a lot and can save a lot of time that could be used for more interesting issues. Not only that, but it helps to create better publications and knowledge. Without this program it can be very time consuming to publish a scientific article with the requested style for the references. Further in daily practice when you want to collect and cite a few references for a specific evidence in a clinical colloquium and discussion, this program is excellent. Therefore we strongly recommend that all maritime health persons learn how to use this excellent tool in their daily maritime health practice of all different types. There are good online courses for self-instruction on how to use Zotero. For example this one: Zotero fast online course But in order to increase IMHAR´s collective scientific strength in the use of EBM we would like to give training sessions in every possible opportunity, IMHA Symposia, seminars and other types of meetings. The database is useful for personal purposes but especially also for collaborative aims. At the IMHAR meeting in Paris Oct 7th 2016 we will give an introduction to the program by showing how it can be used in the daily practice and discuss strength and weaknesses compared to other similar databases.&quot;
: Even longer is e.g. [[IMHA Research Archives/Scientific litterature search, storage and use/Medicina Maritima - the Spanish scientific maritime health journal]].
: However, that does not mean these should be salvaged. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 07:53, 21 November 2025 (UTC)

== [[Palliative medicine]] ==

Underdeveloped and has not been improved on since 2007. Author inactive. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 21:42, 14 December 2025 (UTC)

:Delete, per nominator [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:16, 22 January 2026 (UTC)
:Yes, I would also expect there to be more and especially that someone would write how to use it. However, it still seems to me to be a useful thing in the sense of a syllabus, so that someone who is interested in the topic knows what information to obtain in order to get a complete picture of the topic. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:55, 16 March 2026 (UTC)

== [[Canadian Wilderness]] ==
{{archive top|Deleted per nom. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:07, 17 May 2026 (UTC)}}
This page doesn't seem to belong to wikiversity. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 09:55, 6 February 2026 (UTC)

:In principle there could be some material useful here but in practice, I don't see what this page is adding as an educational resource. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 12:54, 6 February 2026 (UTC)
:I can see this being a useful resource to a bigger project. Maybe we could move it to the &quot;[[Wikiversity:Drafts|Draft]]&quot; namespace vs. deleting it? —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 13:28, 6 February 2026 (UTC)
::Does anyone plan to work on it? [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 01:59, 8 February 2026 (UTC)
:::Next week the page has it's 17th birthday. Ever now and than someone added to it. With a lot of work it could be a nice encyclopedic article but making it educational .... Merging it may take more work than rewriting it. Move to Draft might be the best option. [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 08:58, 12 February 2026 (UTC)
{{archive bottom}}

== [[LQR Control for an Inverted Pendulum]] ==
{{archive top|'''Deleted''' per nom. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:36, 17 May 2026 (UTC)}}
Underdeveloped resource, has not been edited for more than a decade. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 08:03, 16 March 2026 (UTC)

:Looks like a test, '''delete'''. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:30, 27 March 2026 (UTC)
{{archive bottom}}

== False flag &quot;authority hack&quot; user page deletion ==
{{archive top|'''Not undeleted''', the requester dropped the request. See Wikiversity:Requests for Deletion v. 2803217.--[[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:36, 10 May 2026 (UTC)}}
'''Undeletion requested'''

Hi, Juandev marked my user page as &quot;spam&quot; and &quot;authority hack&quot;, and deleted it. 

First, I asked him for help with &quot;time limit for new users&quot;, and he replied - I should admit I dont know, what is &quot;new user limit&quot;, but if filter blocks your page because of certain external link, you may force to save anyway and sometimes it works. It should not work, when the website is blacklisted. As of now, I am not seeing you to save page in main namespace, so try to save it without external links first. 

Then he wrote me another message: Well, I have analyzed your contribution to Wikiversity and I should point out here, that this project is not a place for advertising, so there is no way of promoting your books and authority this way. - probably referring to the intro of my About me page where I present me and my work. 

Before I could explain him the difference between the neutral information and advertising and promotion, he deleted my user page. 

Here is my answer I posted to the discussion today: 

: Hi, my About Me page is just an info page with the neutral as possible presentation of my work.
:
: There is a big difference between informing and advertising. Informing is neutrally stating that something exists and requiring no action, while advertising is a special communication form with intent to cause certain action from readers. For example, click here, click there, order this, buy that.
:
: There is no such intention, form, or terms on my info page. Just neutral information. I don't hide and I am not ashamed that I am write and author, and that is a part of the usual bio, including works. I checked your user page: &quot;I graduated from the Czech University of Life Sciences in Prague and studied information science at the Faculty of Arts of Charles University.&quot; I think that if you had written a book on Life Science, you would have mentioned that as well.
:
: Most of the Info page is about my research and AIPA Method which is a valid contribution to psychology, consciousness studies, identity theory, and personality development. Actually, my paper '''AIPA Method: A Cognitive-Phenomenological Model for Identity Reconstruction and Stabilization in Pure Awareness''' is now in the peer review procedure at Journal of Consciousness Studies.
:
: Here is a part from the Wikiversity AIPA Method page in creation (waiting for the end of the time limit for new users):

: == Introduction ==
: The AIPA Method addresses a gap in contemporary personal development and consciousness science: most evidence‑based approaches (CBT, MBSR, MBCT, standard meditation) operate at the level of mental content—reframing thoughts, observing them, or reducing their impact—rather than at the level of identity structure. In contrast, AIPA targets the structural relationship between the self and the mind, aiming at durable identity reconstruction rooted in Pure Awareness rather than symptom management.
:
: The central research question of the primary AIPA preprint is whether a structured, sequentially staged method can produce permanent identity reconstruction rooted in Pure Awareness, and how such a method compares to established approaches in scope, mechanism, and outcome.
:
: == Theoretical foundations ==
: The AIPA framework is grounded in the cognitive‑phenomenological tradition (e.g., McAdams, Varela, Metzinger, Erikson), contemporary consciousness science on minimal phenomenal experience, and qualitative methods advocacy in psychology. It builds directly on:
:* Empirical work on pure awareness and Minimal Phenomenal Experience (MPE), especially Gamma &amp; Metzinger’s large‑scale study of content‑reduced awareness states.
:* Metzinger’s proposal of minimal phenomenal experience as an entry point for a minimal unifying model of consciousness.
:* Narrative identity and partial‑self models within personality and identity theory.
: Within this backdrop, AIPA proposes Pure Awareness as a distinct, operationally specified state that can become a structural ground of identity rather than a transient meditative experience.
:
: == Experiential empiricism ==
: The empirical foundation of the AIPA Method is explicitly first‑person and experiential, combining:
:* A 22‑year longitudinal autoethnographic self‑study (2003–2025) documenting partial personality episodes, protocol use, and outcomes.
:* A 13‑year prospective verification period with zero self‑reported recurrence of targeted harmful behaviors after a dated stabilization point (1 January 2006).
:* A high‑ecological‑validity “stress test” during acute bereavement, used to examine whether non‑reactive awareness remains stable under maximal provocation.
:* Two independent practitioner cases (an Amazon‑verified report and a structured questionnaire case) providing preliminary convergent signals across cognitive, emotional, behavioral, and identity dimensions.
:
: All central constructs (Pure Awareness, partial personalities, the Switch, identity stabilization) are operationalized with explicit phenomenological and behavioral criteria intended to enable replication and future third‑person measurement.
:
: I believe this is a valid contribution to Wikiversity.
:
: Best regards, Senad [[User:Senad Dizdarević|Senad Dizdarević]]


I suggest you check the deleted user page, and see for yourself if it is &quot;spam&quot; and &quot;authority hack&quot;, or a legit author's page with one paragraph short presentation, while the rest of the page is about my research project. 

Thank you for undeleting my user page, so I can use it. 

Best regards, 

Senad Dizdarević [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:26, 2 April 2026 (UTC)

:Hi Senad,
:Welcome to Wikiversity.
:It looks like you tried adding similar content to Wikipedia and ran into similar difficulties over there ([[w:User talk:Senad Dizdarević]])? Perhaps that is what has led to you Wikiversity?
:Basically, if you'd like to collaborate and help build open educational resources, feel free to contribute to Wikiversity. But if the primary motivation is to promote your autobiographical work you're probably going to run into challenges.
:Sincerely,
:James
:-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:11, 3 April 2026 (UTC)
::James, Hi, and thank you for your answer. 
::Yes, in 2025, I created the autobiographic page on Wikipedia, which was removed because of the links to my books on Amazon. To admin, I explained that I did not know the rules, and agreed that page is removed. Now I know that somebody else must write a Wikipedia page for you. 
::On the deleted user page on Wikiversity, there were no links to Amazon or any other form of promotion, just neutral as possible basic presentation of my writing (one sentence) and current project (the rest of the page). 
::I created Wikiversity page to present my AIPA Method project, to invite researchers to read it, give their opinion, and conduct empirical researches in their institutions. Now, it is in a theoretical phase, and needs more empirical testing. 
::Best regards, 
::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:03, 3 April 2026 (UTC)
:::It looks to me like the primary motivation for contributing to Wikiversity is to drive traffic / search engine ranking to your website?
:::* [[User:Senad Dizdarević]]
:::* [[AIPA Method]]
:::-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 01:36, 4 April 2026 (UTC)
::::No, it is not. There is no link to my website, so &quot;driving traffic to my website&quot; is not possible. 
::::For your educational purposes: 
::::Copilot &quot;AI:  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:38, 4 April 2026 (UTC)
:::::So do you still insist of undeleting your former version of your userpage if you have created the new one? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:15, 6 April 2026 (UTC)
::::::No, because in the moment of undeletition, somebody could delete it again, and so on. Thank you for not deleting my new user page, as it is made in your user page image.  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 08:59, 6 April 2026 (UTC)

{{archive bottom}}

== Undeletion request ==

It was deleted by an admin without discussion and with untrue rationale. If people take offense with the question that doesn't mean it's not a valid question and the page was good. Please undelete the Wikidebate page [https://web.archive.org/web/20250810030352/https://en.wikiversity.org/wiki/Is_it_likely_that_Earth_has_been_visited_by_aliens_millions_of_years_ago%3F Is it likely that Earth has been visited by aliens millions of years ago?]

There are lots of sources on the subject, the wikidebate is sourced very well compared to other wikidebates and wikiversity pages, and the page is educational, useful and of good quality. [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 23:57, 10 April 2026 (UTC)

:Page: [[Is it likely that Earth has been visited by aliens millions of years ago?]]
:Ping: [[User:Atcovi|Atcovi]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:21, 11 April 2026 (UTC)
:There is no need for a discussion for straight garbage-level, pseudoscientific content.
:For '''Is it likely that Earth has been visited by aliens millions of years ago?''', the flaws for this page wouldn't even take someone more than a few minutes to assess:
:* Essentially, the &quot;pro&quot; arguments unproven claims being derived from irrelevant, established facts (basically: &quot;it is likely aliens have came because Earth has existed for so long [sources proving Earth's longevity]&quot;). These are not serious, scientifically-backed arguments - these are non sequiturs. It's as if I said Wikipedia has existed longer than my existence on Earth ([https://d1wqtxts1xzle7.cloudfront.net/74351725/eyJoIjogImZiODhmYzNkODU1N2UxMWExYzUyODJiYzgzZTRmZDM4OTBjODY5YWMzMjA3NDNmOWEyZTA0ZTU3ZGYwZjAyYTkiLCAidSI6ICJodHRwczovL3B1cmUuaHZhLm5sL3dz-libre.pdf?1636354596=&amp;response-content-disposition=inline%3B+filename%3DCritical_Point_of_View_A_Wikipedia_Reade.pdf&amp;Expires=1775872055&amp;Signature=GqbUZboYRvUYWi~aW40LT5eZSHrLuDL3o0-DxAH8vSvcJcGAuyByZWLF2oHTY6GlB72TqvZxpE-v9d4gvsA6myriYqO~QQQZgWxjT2JXjUWC-yiPcTF4l~lroJSi4dY0v9eKiBcU03l-aeUdrX8~UPfi0TfW0IhsmzH-VBR6X6FrzRpIqc6uM6n9YXfr5FRB3aCqqokU690af3n0Hguaub1Zgmh9qjYYqzBS0VOOHjKTTEQnDuadX3jl5CQeXYTaeCC3H0hMeVwHlratbrnuFEKC1aN0-5znCUoSzMEg21ECzGPTrSDM1W05dcK-u0ZTCeUGKAuC-2yRFL3sY46MIw__&amp;Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA#page=157 reputable source proving ''this'' fact]), therefore it's likely that my birth took place solely for the sake of me experiencing Wikipedia (0 backing). It makes no sense and no person with at least a high school-level of intelligence would take this seriously. 
:* What is worse is that the user is being misleading with their &quot;[the page is] sourced very well&quot; claim. The sources ''themselves'' don't even back up the claims. It's just used as proof for an established concept, where the user then uses this established concept to jump to an unsupported, laughable conclusion that is pulled out of thin air. It's utterly ridiculous to even consider such a page for mainspace since it clearly violates our [[Wikiversity:Verifiability]] policy. This is, once again, pseudoscientific content that has caused our website to reduce in quality over the last few years. 
:* Going source by source, we can see that:
:#[https://web.archive.org/web/20250918011642/https://timesofindia.indiatimes.com/blogs/thebigd/compress-earths-history-into-24-hrs-humans-came-at-1158-pm-yet-killed-70-of-wildlife/ ‘Compress Earth’s history into 24 hrs. Humans came at 11:58 pm, yet killed 70% of wildlife’] is literally just a blog post which doesn't even mention aliens or extraterrestrial life. It just talks about Earth's history in accordance with the 24-hour metric of time, and the author tries to use this article as a 'piece in the puzzle' of aliens &quot;possibly&quot; visiting Earth... which, once again, is unsupported and is not backed up anywhere in the article.
:#[https://web.archive.org/web/20250808053249/https://news.cornell.edu/stories/2023/11/jurassic-worlds-might-be-easier-spot-modern-earth The Cornell article does not even remotely support the idea that &quot;aliens visited Earth&quot;]. It mentions a ''chance'' of &quot;life there [a habitable exoplanet] might not be limited to microbes, but could include creatures as large and varied as the megalosauruses or microraptors that once roamed Earth.&quot;, but again, no justification to take this article as proof that &quot;aliens may have visited us!&quot;. There's no mention of aliens visiting Earth anywhere in the article. Once again this is only proving the background premise, but not the unsupported, nonsensical &quot;alien likelihood&quot; argument that the author of this garbage page is trying to push so desperately.
:#The Parker Solar Probe WP article does not even mention aliens either. It follows the same issues as the previous argument.
:And the other page this user complained about [https://en.wikiversity.org/wiki/User_talk:Atcovi#Deletion_of_educational_page_because_of_personal_opinion on my talk page] holds almost similar, maybe even more fatal mistakes, than this one. It has nothing to do with &quot;taking offense&quot;, this is just low-quality, garbage content. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 00:56, 11 April 2026 (UTC)
::Why do you think pro claims are required to be proven? It's possible to object to them and these are arguments, not contextualized to be statements of proven facts. And it's not a strange or unreasonable argument to make that since Earth has existed for long, it's more likely that aliens have come here in the past than in recent times or the near future. Instead of insulting others' intelligence, maybe engage with the actual reasoning rather than censoring it away. And there are lots of sources, such as [https://interestingengineering.com/science/alien-civilizations-may-have-visited-earth-millions-of-years-ago-study-says Alien Civilizations May Have Visited Earth Millions of Years Ago, Study Says] etc etc. The sources are used for the arguments themselves individually. [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 12:30, 11 April 2026 (UTC)
:::Because, once again, this is not a site that caters to rampant debating for the sake of &quot;we need to employ rationality and logic to solve the world's problems&quot;, we have policies that we need to fulfill. The claims made in the pro argument clearly do not meet [[Wikiversity:Verifiability]], since you cannot verify these arguments with the sources because they are not relevant. 
:::''&quot;And it's not a strange or unreasonable argument to make that since Earth has existed for long, it's more likely that aliens have come here in the past than in recent times or the near future.&quot;'' The point being is that these arguments are not supported by the sources. Even the article you mention poses the idea as a hypothetical model. This is just you twisting the article to fit your unsupported narrative. I'll bring direct quotes for you to show why the linked article does not help you:
:::* ''One problem the researchers do make sure to point out is that '''they are working with only one data point: our own behaviors and capabilities for space exploration'''. “We tried to come up with a model that would involve the fewest assumptions about sociology that we could,” Carroll-Nellenback told Business Insider. '''We have no real way of knowing the motivations of an alien civilization'''.'' --&gt; proves that this is just speculation and no evidence-based arguments have been provided for the idea that aliens likely visited Earth.
:::And I'm not sure if you read my entire response, but I ''did'' engage with your &quot;actual reasoning&quot; and exposed its weaknesses and lack of adherence to Wikiversity policies. If we allowed content that was just filled with non sequiturs we would have content that fails Wikiversity's educational objectives and reduces the overall quality of this website, hence why such a harsh stance needs to be taken. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 13:50, 11 April 2026 (UTC)
::::Thanks for proving that the Wikimedia ecosystem is unfit to deliberate on controversial topics. The question is entirely valid and the content is far better sourced than nearly all Wikidebates and has no genuine flaws. The only possible issue with it as far as I can see is that now that Wikidebates has been paused people can't add objections if they do have sth specific to say about the topic that's not already included on that page which already had plenty of Cons and objections.
::::The page was more educational than most of Wikiversity and it was well-sourced – wikidebates was for arguments so people were invited to make arguments based on sourced things or outlined logic and the page met [[WV:V]] and most pages on Wikiversity aren't sourced as good. Doesn't look like people can see beyond their biases and personal views here but that's more evident in the marginalization and deletion of wikidebates and the low activity in that project than these selective deletions. A constructive thing to do would be to add reasoned Cons and objections not yet on the page and people had plenty of time to do that. There are and will be other sites for free constructive rational adversarial deliberation (not a big loss in that sense). [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 16:31, 22 April 2026 (UTC)
:::::Thank you for failing to address any of my arguments and going on an unrelated, nonsensical tangent that has nothing to do with the discussion. Once you start producing work that aligns with Wikiversity's content policies instead of typing up laughable, pseudoscientific garbage, then maybe your work can be accepted and not removed. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 16:59, 22 April 2026 (UTC)
::::::I suggest you stop ridiculing things and learn respectfully forming genuine points about the subject at hand. {{tq|the idea as a hypothetical model}} but please learn first about what arguments are and why they're not the same as a statement of objective proven fact. [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 17:18, 22 April 2026 (UTC)

==Pages by Harold Foppele==
[[User:Harold Foppele]] is locally blocked indefinitely and globally banned for sockpuppetry. There were also WMF and local community concerns expressed about copyright violation and AI (over)use. As a result, I think the Wikiversity pages created by this account warrant review with regard what should be deleted, what should be retained etc.:
* [[Completing the square]]
* [[Number of independent spatial modes in a spherical volume]]
* [[Quantum]]
** [[Quantum/Andrew N. Jordan]]
* [[Quantum A Matter Of Size]]
* [[Quantum A Spooky Action at a Distance]]
* [[Quantum: A Walk Through the Universe]]
* [[Quantum Computing Algorithms in the NISQ Era]]
* [[Quantum Formulas Collection]]
* [[Quantum harmonic oscillator]]
* [[Quantum Matter Elements and Particles]]
* [[Quantum mechanics]]
** [[Quantum mechanics/Timeline]]
* [[Quantum mechanics learning module]]
* [[Quantum mechanics measurements]]
* [[Quantum Noisy Qubits]]
* [[Quantum optics beam splitter experiments]]
* [[Quantum: The Secret of Cohesion: How Waves Hold Matter Together]]
* [[Quantum Ultra fast lasers]]
* [[Speed of sound experiments]]
* [[User:Harold Foppele]]
-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 08:12, 17 May 2026 (UTC)

:'''Delete all''' Not worth keeping. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 08:27, 17 May 2026 (UTC)</text>
      <sha1>d8s8dq646jk3bl6hq745nug24k6pafo</sha1>
    </revision>
    <revision>
      <id>2809917</id>
      <parentid>2809916</parentid>
      <timestamp>2026-05-17T11:38:25Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <comment>/* Palliative medicine */ Kept</comment>
      <origin>2809917</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="56488" sha1="j43zu2s3roqjc0suu6ktp5d17yrqtrv" xml:space="preserve">{{/header}}
[[Category:Wikiversity deletion]]

__TOC__

== [[Korean/Words]] ==
(I go to RfD instead of ''proposed deletion'' since many pages are affected.)

I proposed to quasi-delete, i.e. '''move to userspace''' of the main (or sole?) creator, {{User|KYPark}}.

The page is organized a little bit like a dictionary. It makes it redundant to Wiktionary except that Wikiversity allows original research and there does seem to be original research there. Thus, its being organized as a dictionary would alone not necessarily be a problem.

Where I see a problem is in the organization and execution/implementation. Consider [[Korean/Words/가다]], which seems rather typical of the subpages (some subpages are like categories and transclude the pages for individual words):
* On the putative definition line, there is this: &quot;한곳에서 다른 곳으로 장소를 이동하다&quot;, apparently(?) in Korean. That does not seem to fit well into the ''English'' Wikiversity.
* There seems to be some original research into etymological relations between Korean and European languages in the &quot;Comparatives&quot; section (from what I recall, the English Wiktionary rejected this kind of content from KYPark). Admittedly, it is marked using &quot;This is a primary, secondary and/or original Eurasiatic research project at Wikiversity&quot;, so it could be tolerable, but even so, one has to wonder whether Wikiversity wants this kind of fringe science/research or outright pseudo-science.
** Fringe science: fringe physics has been moved to user space before. This would be fringe etymology. But then, original research is allowed.

Deletion is not required; moving to user space suffices, I think. Alternatively, one could at least rename the pages to make it clear from the title that this is not Wikiversity voice but rather KYPark voice, e.g. &quot;Korean/Words (KYPark)/...&quot; or  &quot;Korean/Words/KYPark/...&quot;  (recall the &quot;Fedosin&quot; pages featuring the name &quot;Fedosin&quot;).

Methodology: I see almost no methodological notes spanning the words at [[Korean/Words]]. And yet, if this is original research inventing new etymological connections, surely there should be some general considerations/analysis on how to proceed and how that manner of procedure differs from mainstream etymology?

Prefix index (max 200 items?):
{{collapse top}}
{{Small START}}
{{Special:Prefixindex/Korean/Words}}
{{Small END}}
{{Collapse bottom}}
--[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 09:33, 24 September 2025 (UTC)

:I would keep it. If there is a course of Korean, why not to have a resesearch on Korean vocabulary? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 19:53, 16 October 2025 (UTC)
:: I propose to dismiss the above input: 1) it does not contain any argument, except for a question, and a question is not an argument (it can be so reinterpreted, but that includes additional burden on the interpreters, in interpreting it the wrong way); 2) it ignores all the issues I have raised, including that there is something like definition lines in Korean, in this ''English'' Wikiversity. To answer the question asked: there can be a research on Korean vocabulary in the mainspace, but not one showing the defects I identified above. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:35, 15 November 2025 (UTC)
:I've reviewed a sample of approximately 20 of the Korean/Words sub-pages and lean towards moving to user space because:
:* The pages appear to be an idiosynchratic collection of etymological pages about Korean language
:* There is minimal English instruction which is problematic for English Wikiversity
:* There is no explanation of research method
:* There is no educational rationale
:-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:31, 22 November 2025 (UTC)
:Well, since the original creator has indef I change my mind and I would '''delete''' it. The case is nobody knows how to continue with the research and if we move it to the userspace, the user cannot improve it eihter. What the original user can do to request admin, to send them a contentent to their email for example if they really want to improve the resource elsewhere. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:38, 11 March 2026 (UTC)

== [[Enhancing Web Browser Security through Cookie Encryption]] ==
{{archive top|'''Kept'''. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:28, 17 May 2026 (UTC)}}
To avoid further conflict with the user who entered this text into Wikiversity, I am opening a RFD request.

I am not sure about how to proceed, although I am inclined to move it out of mainspace = quasi-delete. I am looking forward to get input from others, especially curators and custodians. Some considerations:

1) There is perhaps no more appearance/suspicion of copyright violation, now that the ResearchGate (RG) article (of which this is a copy, perhaps an incomplete copy?) carries a license.

2) The article is not a complete replica from RG: at a minimum, it lacks images. The inserter could have continued editing the page in his user space before he uploads images, that is, before he finalizes the page for consumption, but that did not happen. I did not check whether the text is an exact one-to-one match; the article does not indicate anything in that regard.

3) The principle implied seems to be this: users should feel free to duplicate non-peer-reviewed articles from RG in English Wikiversity, perhaps to increase the Google search and LLM yield. I find this problematic, in part for the duplication. I would say: choose a venue and publish it there. If RG is not good enough for you as a publishing venue, choose Wikiversity instead, but not both?

4) There are some features that appear unduly promotional. There is a link to a dot com home page of the inserter of the article. I dot not know how we handle or should handle this, whether prohibit such a link, etc. This is perhaps not so much a call to quasi-deletion but a call to make it less promotional.

5) I cannot determine the value of such an article. It seems to be a pseudo-article describing someone's browser extension. Can someone do a better analysis?

--[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:48, 8 October 2025 (UTC)

:2) Images for Wikicommons are being created, it will take a lot of time. and the text is not an exact one-to-one match
:3) I also mentioned that It was being created so that it is more accessible from mobile phone, which is not possible in RG or in Zenodo
:Let me clarify the purpose of uploading it to different platforms
:Zenodo - registration and to link DOI
:RG - Self Archiving 
:Wikiversity - Accessible by anyone from any device. LLMs may get trained on Wikiversity data or use these data for indexing 
:5) The paper is a result of a research project which involved a browser extension which was built to test the theory.  [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 01:34, 9 October 2025 (UTC)
:: I find the practice here of publishing non-identical but similar text (&quot;the text is not an exact one-to-one match&quot;) with almost the same title to be problematic. I cannot imagine this is a recommended practice in academic publishing. At a minimum, somewhere near the top, the page should say something like the following: &quot;This text is based on article ___ published at ___ but is not identical. The author of the differences/changes is ___.&quot; Everything else leads to an undesirable confusion. In academic publishing, the title of an article serves as key part of identification of the artifact.
:: As I said before, I seen nothing particularly academic article-like about the page except for external/superficial signs. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:30, 9 October 2025 (UTC)
:::That Article has been published under CC BY SA 4.0
:::And I am one of the author of the article. That gives me right to modify text and publish it under a similar name. However, I will add the disclaimer text that you have suggested. I hope that helps.  [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 06:07, 9 October 2025 (UTC)
:::: It may give you that right from the ''copyright'' perspective, but perhaps not from ''academic publishing integrity'' perspective. Unfortunately, I do not have any guideline handy; I am merely following my common (or not so common) sense. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:32, 9 October 2025 (UTC)
:: I would like to ask: was this article guided by someone from an academic institution, such as a university? Is it reviewed at least in some weak sense? --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:39, 9 October 2025 (UTC)
:::Yes, This article has been reviewed by two academic professors, their names are also listed as co authors.
:::First, a project guide would help us with selecting a topic and with the document 
:::Second, an Internal examiner would go through our experiment and approve it
:::Finally, External Examiner would examine the documentation and verify it. 
:::We were required by these professors to put their name under contributions [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 05:48, 9 October 2025 (UTC)
:: Let me explicate the promotional potential of such a page a bit: one can go to the page of the article in Wikiversity --&gt; https://tomjoejames.com/ --&gt; HitMyTarget (a commercial, profit-making entity?) Why would the link be to a commercial web site rather than an academic page, or perhaps a LinkedIn account, which I think the person has? There could also be no link at all; a search for the name would turn out something in Google as well. But providing a direct link would drive users/viewers toward that website much stronger since otherwise the viewer of the page would have to open a new Google search window or the like. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:45, 9 October 2025 (UTC)
:::It is evident that the website is not even close to being complete. 
:::I will be creating a separate page under the same domain name specifically for people to contact me.
:::The url would probably be defined as tomjoejames.com/contact-me/
:::I haven't decided yet. But that is my personal website.
:::If the community requires me to remove it, I will. But personally I think people who are from here most likely to click the link to know more about me or to contact me. Either way I think my personal website serves the purpose. 
:::As for the HitMyTarget, it can be traced from any of my links. From my research gate profile, linkedin page or even my own userpage.
:::On the article I did not add any promotional content about myself, I hyperlinked only my own name. I do not know how that is promotional. [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 06:04, 9 October 2025 (UTC)
:::: I am pausing any further responses from me to see whether anyone else has any input. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:30, 9 October 2025 (UTC)
:What does it mean &quot;There is perhaps no more appearance/suspicion of copyright violation&quot;? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 19:57, 16 October 2025 (UTC)
:I have accepted VRT permission per [[ticket:2025100410001149]] FYI. [[User:Matrix|Matrix]] ([[User talk:Matrix|discuss]] • [[Special:Contributions/Matrix|contribs]]) 11:00, 28 October 2025 (UTC)
::Thank you Matrix [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 12:43, 28 October 2025 (UTC)
:I would '''delete''' it. 1) it states its a learning resource. It could not be a learning resource as not rewieved original research. 2) It is not an ongoing research, nor the research was performed on Wikiversity - wv is not a preprint or article database. Maybe it could be moved elsewhere withn Wikimedia domain, but I dont know where. So I would delete it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:56, 20 November 2025 (UTC)
::I would '''keep it.''' Like Dan had pointed out,  we do have article-like pages in Wikiversity, and this is not just a random pseudo science article but an article that is a report of an final year project, it has been reviewed by 3 professors whose name has been mentioned at the very beginning.   [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 14:50, 21 November 2025 (UTC)
:::I think it is not good to rate pages by appearance. It can be done on other Wikimedia projects, but it cannot be done on Wikiversity, because Wikiversity does not create a static format for presenting information, but is focused on the goal and process. Unfortunately, the goal and process do not have a uniform format. While a target article on Wikipedia or an entry on Wiktionary have some standard target format, Wikiversity does not. That is why I personally rate pages according to the goals and their assessment. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:05, 22 November 2025 (UTC)

Further reading for this nomination: [[S: Wikisource:Proposed_deletions/Archives/2025#Index:Cookie_Encryption.pdf]]; EncycloPetey handled the matter. Let me quote his wisdom on Zenodo (which I lack): &quot;This is tied to a PDF on Commons that was uploaded as &quot;own work&quot; with a CC license and a doi link to Zenodo, with no indication of where this paper was published or if it was published. Zenodo is not a publisher; it is a site for storing research and sharing papers. If Zenodo is the only place this was &quot;published&quot; then it was effectively self-published. --EncycloPetey (talk) 16:14, 15 September 2025 (UTC)&quot;

--[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 08:55, 9 October 2025 (UTC)

:Can you clarify what point are you trying to state? Didn't I already state that the article is published by me? 
:I first created the article in wikisource which I thought would be the perfect place, unfortunately they do not allow self published articles that are not notable. Then I discovered Wikiversity where they allow self published articles. That is why I created the article here. 
:Unlike in wikisource, I did follow guidelines.
:Ever since you deleted the first article, I spent time reading Wikiversity guidelines and I do think that I am following it perfectly.
:I would like to get your suggestions on how should I improve the page,  10 points would be sufficient. 
:Because your goals or intentions are confusing me very much. At first you told me that the article is exactly the same as the preprint in RG and therefore there is no use to it here. And then when I continued to optimize it for Wikiversity, you went ahead and said it is problematic according to recommended academic publishing. 
:Atleast just respond to the points that I have made whether you agree or disagree. So that I clarify and proceed to discuss points that are important and relevant 
:Have you published an research article? If yes, could you send it to me so that I can see the format you have done it [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 10:45, 9 October 2025 (UTC)
:: I am giving a chance/time to other curators/custodians to look at the matter and respond to my inputs. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 11:14, 9 October 2025 (UTC)
:: Incidentally, above I counted 4 questions (or more), 1 request (or more?) and 1 command (or more?). That is a behavior of a commanding entity. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 11:24, 9 October 2025 (UTC)

I would '''delete it''''. It's more like an academic communication than a learning resource or research.--[[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:32, 26 October 2025 (UTC)
:: In the above post, I do not see any valid rationale for deletion: we do have article-like pages, in Wikijournals and also e.g. in [[Physics/Essays/Fedosin/Stellar Stefan–Boltzmann constant]]. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 08:59, 3 November 2025 (UTC)
:::But I do, see above. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:56, 20 November 2025 (UTC)

:it is a '''student research paper''' forming part of a learning resource on web security and encryption.
:The project was conducted as part of a final-year university course and documented as a practical study on cookie encryption and it has been reviewed by three professors. However, I will be creating a sub page for the article to elaborately describe the experiment that we have conducted and the results we got.    [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 15:57, 26 October 2025 (UTC)
::And why should w host research papers? Wikiversity is not an academic Journal nor repository. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:06, 22 November 2025 (UTC)
:::I do not wish to go through this same argument once again, I've already answered to this question several times in Dan's talk page, Colloquium. you can refer them. I am not hosting the research paper here, I have already hosted the pdf in the ResearchGate, I have published a text version in the wikiversity so that it may be useful for others. Unless you can show me how that article is totally useless, I would like to '''keep''' the article in the wikiversity.    [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 10:13, 22 November 2025 (UTC)
::::And thats the point I am having. Wikiversity is not paper repository. The only way is to publish it via WikiJournal, but they want it for Wikipedia usually. Why wikiversity should be a duplication of ResearchGate, Academia or Zenodo?
::::What I can read on [[Wikiversity:What is Wikiversity?]] policy is, that Wikiversity research &quot;...includes interpreting primary sources, forming ideas, or taking observations.&quot; The article doent look to fall into this. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:43, 22 November 2025 (UTC)
:::::Well, then how come you missed the term &quot;Learning Projects&quot;? As Jtneill had pointed out, this is a legitimate learning project. And also, I do have the VRT permission to host this article on Wikiversity.  [[ticket:2025100410001149]] . besides ResearchGate is an self-archiving platform. the document version in it is not accessibly to screen readers (usually disable people use them), Translators, and also for the mobile readers. therefore I do have valid reasons to publish this article on wikiversity. 
:::::# It is a learning project, therefore according to WIkiversity Policy, It qualifies. 
:::::# I have an explicit VRT permission to host this article on Wikiversity
:::::# Versions that are published in RG, Zenodo are documents, and they are not accessible by screen readers or mobile users. Therefore it is imperative that an article version of this paper exist on here. 
:::::Therefore this article qualifies to stay here on Wikiversity.  [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 11:22, 22 November 2025 (UTC)

'''Keep'''. This is a legitimate student learning project that may be of use to others. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:51, 22 November 2025 (UTC)
{{archive bottom}}

== [[Pragmatics/History]] ==
{{archive top|Deleted. Other related resources have been deleted. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:24, 17 May 2026 (UTC)}}
Another KYPark page and subpages with unclear organization scheme. Contains fairly many redlinked items. See also [[User:KYPark/Literature]], perhaps a similar concept. Unlikely to be really useful for others but KYPark. '''Move to user space'''.

As an alternative, moving to [[History of Pragmatics (KYPark)]] would make sense to me: the topic is identified using a natural-language phrase (instead of the relatively unnatural slash) and the responsible editor is indicated so that the reader knows whether to look or not. And for those who oppose the brackets (which I like): [[History of Pragmatics/KYPark]]. Or also: [[KYPark/History of Pragmatics]]. But then, searches in mainspace will see that content and the question is whether that is good. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:21, 15 October 2025 (UTC)

:What about to propose the user to write some guidelines, how other can participate instead of deleting it? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:03, 16 October 2025 (UTC)
:: I plan to move the pages to userspace as I proposed. If someone wants to ask KYPark to address the problems, they should feel free. There will be plenty of time for KYPark to address the problems while the material is in user space. After the problems are addressed, the material can be moved back to mainspace. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:38, 15 November 2025 (UTC)
:So I would '''delete''' it. In the blocked user space its useless. The user cannot improve it and Wikiversity is not free hosting service for personal pages. My believe is, that there should be just a few working pages in the users spaces. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:30, 11 March 2026 (UTC)

'''Move'''. Insufficient statement of learning objective or connection to related learning resources with insufficient current activity to stay in main space. The page was originally [[History of pragmatics]] but was moved by Dave B. Therefore, I suggest moving to [[User:KYPark/History of pragmatics]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:57, 22 November 2025 (UTC)
{{archive bottom}}

== [[IMHA Research Archives]] ==
I propose to '''move to userspace''', including the subpages. I struggle to understand how Wikiversity readers are supposed to benefit from the material here and in the subpages. In the log, there is e.g. '10 February 2019 Marshallsumter discuss contribs deleted page IMHA Research Archives (content was: &quot;{&lt;nowiki/&gt;{Delete|Author request}} Thanks! -&quot;)', so the page was deleted before, but not the subpages.

We could also delete all the material if we have strong enough suspicion too much of it is copyright violation. In any case, moving to user space improves the matter a little by moving the content away from Google search. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 13:38, 9 November 2025 (UTC)

:Looking at some sub-pages, they can be deleted e.g., because they only consist of broken links or are largely empty. I deleted a couple but haven't been through all to check. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:27, 10 November 2025 (UTC)

As an example, let me give the wikitext content of [[IMHA Research Archives/3. Scientific litterature search, storage and use]]:
&lt;pre&gt;
==[[/Medicina Maritima - the Spanish scientific maritime health journal/]]==

==[[/PubMed/]]==

==[[/Google and Google Scholar/]]==

==[[/Zotero/]]==

==[https://www.dropbox.com/sh/d91z7bcyelfvk42/AAAkIvjtBnnFMbiU9ZLOdVL9a/Andrioti_database%20sources0310.pptx?dl=0 Maritime health web portal ressources ]==
&lt;/pre&gt;
The wikilinks are red; the external link to dropbox says &quot;You don't have access&quot;. This was made in 2016. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 09:04, 11 November 2025 (UTC)

:I suggest delete -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 03:27, 12 November 2025 (UTC)
:: I think we should avoid deletion as much as possible, instead moving to user space (bar copyvio, ethics violation, etc.). This is a good general principle. It greatly improves auditability and makes it so much easier for anyone to request undeletion since they know what content they are requesting for undeletion. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 09:52, 12 November 2025 (UTC)
:::Do not recreate Wikiversity from the educational and research project to the personal blog. That will lead to the cancelation of it by WMF. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:44, 20 November 2025 (UTC)
:::: The English Wikiversity has a long tradition of moving problematic content to user space, as per evidence collected at [[User:Dan_Polansky/About Wikiversity#Moving pages to userspace]]. If Wikimedia Foundation finds this problematic, they can start a discussion in Colloquium and state their concerns. They do not need to make explicit threats at first; they can start a discussion and explain why it is problematic. They can even do it from an anonymous IP and provide a well-articulated reasoning. And anyone else can start a discussion in Colloquium to change this tradition. I do not see why we should not want to change that tradition based on well-articulated, compelling reasoning. I see no reason why Juandev should be making threats instead of them, on a per RFD basis. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:58, 21 November 2025 (UTC)
:::: If Juandev is ''sincere'' about deleting very-low-value items ''from user space'', he should perhaps demonstrate that by asking his pages like [[:cs:Uživatel:Juandev/Problémy/Kov/Repase dvířek elektroskříně]] to be deleted; otherwise, I register a ''glaring inconsistence''. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 07:43, 21 November 2025 (UTC)
::What was the original delate page about @[[User:Jtneill|Jtneill]]? I guess that would be crucial for the decission. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:48, 20 November 2025 (UTC)
:::@[[User:Juandev|Juandev]] the couple of pages I checked and deleted were much like @[[User:Dan Polansky|Dan Polansky]] posted above i.e., headings with empty sections and/or broken links but no substantive content. But I think each sub-page needs checking. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 21:59, 20 November 2025 (UTC)
::::So I'm saying that the main page usually determines what the other pages are for. But if I don't know the page because it's been deleted, or why was deleted (deletion based on the founder's request is probably not the rule), it's hard to judge. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 22:16, 20 November 2025 (UTC)
:::::I've pasted the original content of the root page: [[IMHA Research Archives#Original page]] (i.e., prior to the content being removed and deletion requested) to help understand the context for the sub-pages. In 2018, Saltrabook blanked the page, indicating that the content had been moved elsewhere, and requested page deletion. Marshallsumter then deleted the main page but not the sub-pages. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 01:58, 21 November 2025 (UTC)
::::::I see, so if those subpages are usefull I would keept them, if not I would delete them. I dont see a point of providing free hosting to sombody, by moving many pages to their user space. The question is if we want to host (i.e. to have in the main ns) lists of links elsewhere. I have no opinion on that. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:11, 22 November 2025 (UTC)

: Let me clarify that while many of the subpages are like the example above, [[IMHA Research Archives/Scientific litterature search, storage and use/Zotero]] is different:
:: &quot;A continuous critical and evidence based learning is a core issue in clinical practice, research, teaching, publication and prevention activities. The Zotero Program is just one of many scientific literature management programs, that should be used for these purposes. Of course one can live without such a database but it helps a lot and can save a lot of time that could be used for more interesting issues. Not only that, but it helps to create better publications and knowledge. Without this program it can be very time consuming to publish a scientific article with the requested style for the references. Further in daily practice when you want to collect and cite a few references for a specific evidence in a clinical colloquium and discussion, this program is excellent. Therefore we strongly recommend that all maritime health persons learn how to use this excellent tool in their daily maritime health practice of all different types. There are good online courses for self-instruction on how to use Zotero. For example this one: Zotero fast online course But in order to increase IMHAR´s collective scientific strength in the use of EBM we would like to give training sessions in every possible opportunity, IMHA Symposia, seminars and other types of meetings. The database is useful for personal purposes but especially also for collaborative aims. At the IMHAR meeting in Paris Oct 7th 2016 we will give an introduction to the program by showing how it can be used in the daily practice and discuss strength and weaknesses compared to other similar databases.&quot;
: Even longer is e.g. [[IMHA Research Archives/Scientific litterature search, storage and use/Medicina Maritima - the Spanish scientific maritime health journal]].
: However, that does not mean these should be salvaged. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 07:53, 21 November 2025 (UTC)

== [[Palliative medicine]] ==
{{archive top|'''Kept'''. Page has been improved. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:38, 17 May 2026 (UTC)}}

Underdeveloped and has not been improved on since 2007. Author inactive. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 21:42, 14 December 2025 (UTC)

:Delete, per nominator [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:16, 22 January 2026 (UTC)
:Yes, I would also expect there to be more and especially that someone would write how to use it. However, it still seems to me to be a useful thing in the sense of a syllabus, so that someone who is interested in the topic knows what information to obtain in order to get a complete picture of the topic. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:55, 16 March 2026 (UTC)
{{archive bottom}}

== [[Canadian Wilderness]] ==
{{archive top|Deleted per nom. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:07, 17 May 2026 (UTC)}}
This page doesn't seem to belong to wikiversity. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 09:55, 6 February 2026 (UTC)

:In principle there could be some material useful here but in practice, I don't see what this page is adding as an educational resource. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 12:54, 6 February 2026 (UTC)
:I can see this being a useful resource to a bigger project. Maybe we could move it to the &quot;[[Wikiversity:Drafts|Draft]]&quot; namespace vs. deleting it? —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 13:28, 6 February 2026 (UTC)
::Does anyone plan to work on it? [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 01:59, 8 February 2026 (UTC)
:::Next week the page has it's 17th birthday. Ever now and than someone added to it. With a lot of work it could be a nice encyclopedic article but making it educational .... Merging it may take more work than rewriting it. Move to Draft might be the best option. [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 08:58, 12 February 2026 (UTC)
{{archive bottom}}

== [[LQR Control for an Inverted Pendulum]] ==
{{archive top|'''Deleted''' per nom. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:36, 17 May 2026 (UTC)}}
Underdeveloped resource, has not been edited for more than a decade. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 08:03, 16 March 2026 (UTC)

:Looks like a test, '''delete'''. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:30, 27 March 2026 (UTC)
{{archive bottom}}

== False flag &quot;authority hack&quot; user page deletion ==
{{archive top|'''Not undeleted''', the requester dropped the request. See Wikiversity:Requests for Deletion v. 2803217.--[[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:36, 10 May 2026 (UTC)}}
'''Undeletion requested'''

Hi, Juandev marked my user page as &quot;spam&quot; and &quot;authority hack&quot;, and deleted it. 

First, I asked him for help with &quot;time limit for new users&quot;, and he replied - I should admit I dont know, what is &quot;new user limit&quot;, but if filter blocks your page because of certain external link, you may force to save anyway and sometimes it works. It should not work, when the website is blacklisted. As of now, I am not seeing you to save page in main namespace, so try to save it without external links first. 

Then he wrote me another message: Well, I have analyzed your contribution to Wikiversity and I should point out here, that this project is not a place for advertising, so there is no way of promoting your books and authority this way. - probably referring to the intro of my About me page where I present me and my work. 

Before I could explain him the difference between the neutral information and advertising and promotion, he deleted my user page. 

Here is my answer I posted to the discussion today: 

: Hi, my About Me page is just an info page with the neutral as possible presentation of my work.
:
: There is a big difference between informing and advertising. Informing is neutrally stating that something exists and requiring no action, while advertising is a special communication form with intent to cause certain action from readers. For example, click here, click there, order this, buy that.
:
: There is no such intention, form, or terms on my info page. Just neutral information. I don't hide and I am not ashamed that I am write and author, and that is a part of the usual bio, including works. I checked your user page: &quot;I graduated from the Czech University of Life Sciences in Prague and studied information science at the Faculty of Arts of Charles University.&quot; I think that if you had written a book on Life Science, you would have mentioned that as well.
:
: Most of the Info page is about my research and AIPA Method which is a valid contribution to psychology, consciousness studies, identity theory, and personality development. Actually, my paper '''AIPA Method: A Cognitive-Phenomenological Model for Identity Reconstruction and Stabilization in Pure Awareness''' is now in the peer review procedure at Journal of Consciousness Studies.
:
: Here is a part from the Wikiversity AIPA Method page in creation (waiting for the end of the time limit for new users):

: == Introduction ==
: The AIPA Method addresses a gap in contemporary personal development and consciousness science: most evidence‑based approaches (CBT, MBSR, MBCT, standard meditation) operate at the level of mental content—reframing thoughts, observing them, or reducing their impact—rather than at the level of identity structure. In contrast, AIPA targets the structural relationship between the self and the mind, aiming at durable identity reconstruction rooted in Pure Awareness rather than symptom management.
:
: The central research question of the primary AIPA preprint is whether a structured, sequentially staged method can produce permanent identity reconstruction rooted in Pure Awareness, and how such a method compares to established approaches in scope, mechanism, and outcome.
:
: == Theoretical foundations ==
: The AIPA framework is grounded in the cognitive‑phenomenological tradition (e.g., McAdams, Varela, Metzinger, Erikson), contemporary consciousness science on minimal phenomenal experience, and qualitative methods advocacy in psychology. It builds directly on:
:* Empirical work on pure awareness and Minimal Phenomenal Experience (MPE), especially Gamma &amp; Metzinger’s large‑scale study of content‑reduced awareness states.
:* Metzinger’s proposal of minimal phenomenal experience as an entry point for a minimal unifying model of consciousness.
:* Narrative identity and partial‑self models within personality and identity theory.
: Within this backdrop, AIPA proposes Pure Awareness as a distinct, operationally specified state that can become a structural ground of identity rather than a transient meditative experience.
:
: == Experiential empiricism ==
: The empirical foundation of the AIPA Method is explicitly first‑person and experiential, combining:
:* A 22‑year longitudinal autoethnographic self‑study (2003–2025) documenting partial personality episodes, protocol use, and outcomes.
:* A 13‑year prospective verification period with zero self‑reported recurrence of targeted harmful behaviors after a dated stabilization point (1 January 2006).
:* A high‑ecological‑validity “stress test” during acute bereavement, used to examine whether non‑reactive awareness remains stable under maximal provocation.
:* Two independent practitioner cases (an Amazon‑verified report and a structured questionnaire case) providing preliminary convergent signals across cognitive, emotional, behavioral, and identity dimensions.
:
: All central constructs (Pure Awareness, partial personalities, the Switch, identity stabilization) are operationalized with explicit phenomenological and behavioral criteria intended to enable replication and future third‑person measurement.
:
: I believe this is a valid contribution to Wikiversity.
:
: Best regards, Senad [[User:Senad Dizdarević|Senad Dizdarević]]


I suggest you check the deleted user page, and see for yourself if it is &quot;spam&quot; and &quot;authority hack&quot;, or a legit author's page with one paragraph short presentation, while the rest of the page is about my research project. 

Thank you for undeleting my user page, so I can use it. 

Best regards, 

Senad Dizdarević [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:26, 2 April 2026 (UTC)

:Hi Senad,
:Welcome to Wikiversity.
:It looks like you tried adding similar content to Wikipedia and ran into similar difficulties over there ([[w:User talk:Senad Dizdarević]])? Perhaps that is what has led to you Wikiversity?
:Basically, if you'd like to collaborate and help build open educational resources, feel free to contribute to Wikiversity. But if the primary motivation is to promote your autobiographical work you're probably going to run into challenges.
:Sincerely,
:James
:-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:11, 3 April 2026 (UTC)
::James, Hi, and thank you for your answer. 
::Yes, in 2025, I created the autobiographic page on Wikipedia, which was removed because of the links to my books on Amazon. To admin, I explained that I did not know the rules, and agreed that page is removed. Now I know that somebody else must write a Wikipedia page for you. 
::On the deleted user page on Wikiversity, there were no links to Amazon or any other form of promotion, just neutral as possible basic presentation of my writing (one sentence) and current project (the rest of the page). 
::I created Wikiversity page to present my AIPA Method project, to invite researchers to read it, give their opinion, and conduct empirical researches in their institutions. Now, it is in a theoretical phase, and needs more empirical testing. 
::Best regards, 
::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:03, 3 April 2026 (UTC)
:::It looks to me like the primary motivation for contributing to Wikiversity is to drive traffic / search engine ranking to your website?
:::* [[User:Senad Dizdarević]]
:::* [[AIPA Method]]
:::-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 01:36, 4 April 2026 (UTC)
::::No, it is not. There is no link to my website, so &quot;driving traffic to my website&quot; is not possible. 
::::For your educational purposes: 
::::Copilot &quot;AI:  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:38, 4 April 2026 (UTC)
:::::So do you still insist of undeleting your former version of your userpage if you have created the new one? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:15, 6 April 2026 (UTC)
::::::No, because in the moment of undeletition, somebody could delete it again, and so on. Thank you for not deleting my new user page, as it is made in your user page image.  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 08:59, 6 April 2026 (UTC)

{{archive bottom}}

== Undeletion request ==

It was deleted by an admin without discussion and with untrue rationale. If people take offense with the question that doesn't mean it's not a valid question and the page was good. Please undelete the Wikidebate page [https://web.archive.org/web/20250810030352/https://en.wikiversity.org/wiki/Is_it_likely_that_Earth_has_been_visited_by_aliens_millions_of_years_ago%3F Is it likely that Earth has been visited by aliens millions of years ago?]

There are lots of sources on the subject, the wikidebate is sourced very well compared to other wikidebates and wikiversity pages, and the page is educational, useful and of good quality. [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 23:57, 10 April 2026 (UTC)

:Page: [[Is it likely that Earth has been visited by aliens millions of years ago?]]
:Ping: [[User:Atcovi|Atcovi]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:21, 11 April 2026 (UTC)
:There is no need for a discussion for straight garbage-level, pseudoscientific content.
:For '''Is it likely that Earth has been visited by aliens millions of years ago?''', the flaws for this page wouldn't even take someone more than a few minutes to assess:
:* Essentially, the &quot;pro&quot; arguments unproven claims being derived from irrelevant, established facts (basically: &quot;it is likely aliens have came because Earth has existed for so long [sources proving Earth's longevity]&quot;). These are not serious, scientifically-backed arguments - these are non sequiturs. It's as if I said Wikipedia has existed longer than my existence on Earth ([https://d1wqtxts1xzle7.cloudfront.net/74351725/eyJoIjogImZiODhmYzNkODU1N2UxMWExYzUyODJiYzgzZTRmZDM4OTBjODY5YWMzMjA3NDNmOWEyZTA0ZTU3ZGYwZjAyYTkiLCAidSI6ICJodHRwczovL3B1cmUuaHZhLm5sL3dz-libre.pdf?1636354596=&amp;response-content-disposition=inline%3B+filename%3DCritical_Point_of_View_A_Wikipedia_Reade.pdf&amp;Expires=1775872055&amp;Signature=GqbUZboYRvUYWi~aW40LT5eZSHrLuDL3o0-DxAH8vSvcJcGAuyByZWLF2oHTY6GlB72TqvZxpE-v9d4gvsA6myriYqO~QQQZgWxjT2JXjUWC-yiPcTF4l~lroJSi4dY0v9eKiBcU03l-aeUdrX8~UPfi0TfW0IhsmzH-VBR6X6FrzRpIqc6uM6n9YXfr5FRB3aCqqokU690af3n0Hguaub1Zgmh9qjYYqzBS0VOOHjKTTEQnDuadX3jl5CQeXYTaeCC3H0hMeVwHlratbrnuFEKC1aN0-5znCUoSzMEg21ECzGPTrSDM1W05dcK-u0ZTCeUGKAuC-2yRFL3sY46MIw__&amp;Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA#page=157 reputable source proving ''this'' fact]), therefore it's likely that my birth took place solely for the sake of me experiencing Wikipedia (0 backing). It makes no sense and no person with at least a high school-level of intelligence would take this seriously. 
:* What is worse is that the user is being misleading with their &quot;[the page is] sourced very well&quot; claim. The sources ''themselves'' don't even back up the claims. It's just used as proof for an established concept, where the user then uses this established concept to jump to an unsupported, laughable conclusion that is pulled out of thin air. It's utterly ridiculous to even consider such a page for mainspace since it clearly violates our [[Wikiversity:Verifiability]] policy. This is, once again, pseudoscientific content that has caused our website to reduce in quality over the last few years. 
:* Going source by source, we can see that:
:#[https://web.archive.org/web/20250918011642/https://timesofindia.indiatimes.com/blogs/thebigd/compress-earths-history-into-24-hrs-humans-came-at-1158-pm-yet-killed-70-of-wildlife/ ‘Compress Earth’s history into 24 hrs. Humans came at 11:58 pm, yet killed 70% of wildlife’] is literally just a blog post which doesn't even mention aliens or extraterrestrial life. It just talks about Earth's history in accordance with the 24-hour metric of time, and the author tries to use this article as a 'piece in the puzzle' of aliens &quot;possibly&quot; visiting Earth... which, once again, is unsupported and is not backed up anywhere in the article.
:#[https://web.archive.org/web/20250808053249/https://news.cornell.edu/stories/2023/11/jurassic-worlds-might-be-easier-spot-modern-earth The Cornell article does not even remotely support the idea that &quot;aliens visited Earth&quot;]. It mentions a ''chance'' of &quot;life there [a habitable exoplanet] might not be limited to microbes, but could include creatures as large and varied as the megalosauruses or microraptors that once roamed Earth.&quot;, but again, no justification to take this article as proof that &quot;aliens may have visited us!&quot;. There's no mention of aliens visiting Earth anywhere in the article. Once again this is only proving the background premise, but not the unsupported, nonsensical &quot;alien likelihood&quot; argument that the author of this garbage page is trying to push so desperately.
:#The Parker Solar Probe WP article does not even mention aliens either. It follows the same issues as the previous argument.
:And the other page this user complained about [https://en.wikiversity.org/wiki/User_talk:Atcovi#Deletion_of_educational_page_because_of_personal_opinion on my talk page] holds almost similar, maybe even more fatal mistakes, than this one. It has nothing to do with &quot;taking offense&quot;, this is just low-quality, garbage content. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 00:56, 11 April 2026 (UTC)
::Why do you think pro claims are required to be proven? It's possible to object to them and these are arguments, not contextualized to be statements of proven facts. And it's not a strange or unreasonable argument to make that since Earth has existed for long, it's more likely that aliens have come here in the past than in recent times or the near future. Instead of insulting others' intelligence, maybe engage with the actual reasoning rather than censoring it away. And there are lots of sources, such as [https://interestingengineering.com/science/alien-civilizations-may-have-visited-earth-millions-of-years-ago-study-says Alien Civilizations May Have Visited Earth Millions of Years Ago, Study Says] etc etc. The sources are used for the arguments themselves individually. [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 12:30, 11 April 2026 (UTC)
:::Because, once again, this is not a site that caters to rampant debating for the sake of &quot;we need to employ rationality and logic to solve the world's problems&quot;, we have policies that we need to fulfill. The claims made in the pro argument clearly do not meet [[Wikiversity:Verifiability]], since you cannot verify these arguments with the sources because they are not relevant. 
:::''&quot;And it's not a strange or unreasonable argument to make that since Earth has existed for long, it's more likely that aliens have come here in the past than in recent times or the near future.&quot;'' The point being is that these arguments are not supported by the sources. Even the article you mention poses the idea as a hypothetical model. This is just you twisting the article to fit your unsupported narrative. I'll bring direct quotes for you to show why the linked article does not help you:
:::* ''One problem the researchers do make sure to point out is that '''they are working with only one data point: our own behaviors and capabilities for space exploration'''. “We tried to come up with a model that would involve the fewest assumptions about sociology that we could,” Carroll-Nellenback told Business Insider. '''We have no real way of knowing the motivations of an alien civilization'''.'' --&gt; proves that this is just speculation and no evidence-based arguments have been provided for the idea that aliens likely visited Earth.
:::And I'm not sure if you read my entire response, but I ''did'' engage with your &quot;actual reasoning&quot; and exposed its weaknesses and lack of adherence to Wikiversity policies. If we allowed content that was just filled with non sequiturs we would have content that fails Wikiversity's educational objectives and reduces the overall quality of this website, hence why such a harsh stance needs to be taken. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 13:50, 11 April 2026 (UTC)
::::Thanks for proving that the Wikimedia ecosystem is unfit to deliberate on controversial topics. The question is entirely valid and the content is far better sourced than nearly all Wikidebates and has no genuine flaws. The only possible issue with it as far as I can see is that now that Wikidebates has been paused people can't add objections if they do have sth specific to say about the topic that's not already included on that page which already had plenty of Cons and objections.
::::The page was more educational than most of Wikiversity and it was well-sourced – wikidebates was for arguments so people were invited to make arguments based on sourced things or outlined logic and the page met [[WV:V]] and most pages on Wikiversity aren't sourced as good. Doesn't look like people can see beyond their biases and personal views here but that's more evident in the marginalization and deletion of wikidebates and the low activity in that project than these selective deletions. A constructive thing to do would be to add reasoned Cons and objections not yet on the page and people had plenty of time to do that. There are and will be other sites for free constructive rational adversarial deliberation (not a big loss in that sense). [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 16:31, 22 April 2026 (UTC)
:::::Thank you for failing to address any of my arguments and going on an unrelated, nonsensical tangent that has nothing to do with the discussion. Once you start producing work that aligns with Wikiversity's content policies instead of typing up laughable, pseudoscientific garbage, then maybe your work can be accepted and not removed. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 16:59, 22 April 2026 (UTC)
::::::I suggest you stop ridiculing things and learn respectfully forming genuine points about the subject at hand. {{tq|the idea as a hypothetical model}} but please learn first about what arguments are and why they're not the same as a statement of objective proven fact. [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 17:18, 22 April 2026 (UTC)

==Pages by Harold Foppele==
[[User:Harold Foppele]] is locally blocked indefinitely and globally banned for sockpuppetry. There were also WMF and local community concerns expressed about copyright violation and AI (over)use. As a result, I think the Wikiversity pages created by this account warrant review with regard what should be deleted, what should be retained etc.:
* [[Completing the square]]
* [[Number of independent spatial modes in a spherical volume]]
* [[Quantum]]
** [[Quantum/Andrew N. Jordan]]
* [[Quantum A Matter Of Size]]
* [[Quantum A Spooky Action at a Distance]]
* [[Quantum: A Walk Through the Universe]]
* [[Quantum Computing Algorithms in the NISQ Era]]
* [[Quantum Formulas Collection]]
* [[Quantum harmonic oscillator]]
* [[Quantum Matter Elements and Particles]]
* [[Quantum mechanics]]
** [[Quantum mechanics/Timeline]]
* [[Quantum mechanics learning module]]
* [[Quantum mechanics measurements]]
* [[Quantum Noisy Qubits]]
* [[Quantum optics beam splitter experiments]]
* [[Quantum: The Secret of Cohesion: How Waves Hold Matter Together]]
* [[Quantum Ultra fast lasers]]
* [[Speed of sound experiments]]
* [[User:Harold Foppele]]
-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 08:12, 17 May 2026 (UTC)

:'''Delete all''' Not worth keeping. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 08:27, 17 May 2026 (UTC)</text>
      <sha1>j43zu2s3roqjc0suu6ktp5d17yrqtrv</sha1>
    </revision>
    <revision>
      <id>2809918</id>
      <parentid>2809917</parentid>
      <timestamp>2026-05-17T11:50:07Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <comment>/* Korean/Words */ I think the consensus here is delete. {{U|Codename Noreste}} do you know an efficient way to mass delete these pages?</comment>
      <origin>2809918</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="56742" sha1="27zb1ty5a5hzpkyrj8wdnwfobmlxtpm" xml:space="preserve">{{/header}}
[[Category:Wikiversity deletion]]

__TOC__

== [[Korean/Words]] ==
(I go to RfD instead of ''proposed deletion'' since many pages are affected.)

I proposed to quasi-delete, i.e. '''move to userspace''' of the main (or sole?) creator, {{User|KYPark}}.

The page is organized a little bit like a dictionary. It makes it redundant to Wiktionary except that Wikiversity allows original research and there does seem to be original research there. Thus, its being organized as a dictionary would alone not necessarily be a problem.

Where I see a problem is in the organization and execution/implementation. Consider [[Korean/Words/가다]], which seems rather typical of the subpages (some subpages are like categories and transclude the pages for individual words):
* On the putative definition line, there is this: &quot;한곳에서 다른 곳으로 장소를 이동하다&quot;, apparently(?) in Korean. That does not seem to fit well into the ''English'' Wikiversity.
* There seems to be some original research into etymological relations between Korean and European languages in the &quot;Comparatives&quot; section (from what I recall, the English Wiktionary rejected this kind of content from KYPark). Admittedly, it is marked using &quot;This is a primary, secondary and/or original Eurasiatic research project at Wikiversity&quot;, so it could be tolerable, but even so, one has to wonder whether Wikiversity wants this kind of fringe science/research or outright pseudo-science.
** Fringe science: fringe physics has been moved to user space before. This would be fringe etymology. But then, original research is allowed.

Deletion is not required; moving to user space suffices, I think. Alternatively, one could at least rename the pages to make it clear from the title that this is not Wikiversity voice but rather KYPark voice, e.g. &quot;Korean/Words (KYPark)/...&quot; or  &quot;Korean/Words/KYPark/...&quot;  (recall the &quot;Fedosin&quot; pages featuring the name &quot;Fedosin&quot;).

Methodology: I see almost no methodological notes spanning the words at [[Korean/Words]]. And yet, if this is original research inventing new etymological connections, surely there should be some general considerations/analysis on how to proceed and how that manner of procedure differs from mainstream etymology?

Prefix index (max 200 items?):
{{collapse top}}
{{Small START}}
{{Special:Prefixindex/Korean/Words}}
{{Small END}}
{{Collapse bottom}}
--[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 09:33, 24 September 2025 (UTC)

:I would keep it. If there is a course of Korean, why not to have a resesearch on Korean vocabulary? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 19:53, 16 October 2025 (UTC)
:: I propose to dismiss the above input: 1) it does not contain any argument, except for a question, and a question is not an argument (it can be so reinterpreted, but that includes additional burden on the interpreters, in interpreting it the wrong way); 2) it ignores all the issues I have raised, including that there is something like definition lines in Korean, in this ''English'' Wikiversity. To answer the question asked: there can be a research on Korean vocabulary in the mainspace, but not one showing the defects I identified above. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:35, 15 November 2025 (UTC)
:I've reviewed a sample of approximately 20 of the Korean/Words sub-pages and lean towards moving to user space because:
:* The pages appear to be an idiosynchratic collection of etymological pages about Korean language
:* There is minimal English instruction which is problematic for English Wikiversity
:* There is no explanation of research method
:* There is no educational rationale
:-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:31, 22 November 2025 (UTC)
:Well, since the original creator has indef I change my mind and I would '''delete''' it. The case is nobody knows how to continue with the research and if we move it to the userspace, the user cannot improve it eihter. What the original user can do to request admin, to send them a contentent to their email for example if they really want to improve the resource elsewhere. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:38, 11 March 2026 (UTC)

I think the consensus here is delete. {{U|Codename Noreste}} do you know an efficient way to mass delete these pages? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:49, 17 May 2026 (UTC)

== [[Enhancing Web Browser Security through Cookie Encryption]] ==
{{archive top|'''Kept'''. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:28, 17 May 2026 (UTC)}}
To avoid further conflict with the user who entered this text into Wikiversity, I am opening a RFD request.

I am not sure about how to proceed, although I am inclined to move it out of mainspace = quasi-delete. I am looking forward to get input from others, especially curators and custodians. Some considerations:

1) There is perhaps no more appearance/suspicion of copyright violation, now that the ResearchGate (RG) article (of which this is a copy, perhaps an incomplete copy?) carries a license.

2) The article is not a complete replica from RG: at a minimum, it lacks images. The inserter could have continued editing the page in his user space before he uploads images, that is, before he finalizes the page for consumption, but that did not happen. I did not check whether the text is an exact one-to-one match; the article does not indicate anything in that regard.

3) The principle implied seems to be this: users should feel free to duplicate non-peer-reviewed articles from RG in English Wikiversity, perhaps to increase the Google search and LLM yield. I find this problematic, in part for the duplication. I would say: choose a venue and publish it there. If RG is not good enough for you as a publishing venue, choose Wikiversity instead, but not both?

4) There are some features that appear unduly promotional. There is a link to a dot com home page of the inserter of the article. I dot not know how we handle or should handle this, whether prohibit such a link, etc. This is perhaps not so much a call to quasi-deletion but a call to make it less promotional.

5) I cannot determine the value of such an article. It seems to be a pseudo-article describing someone's browser extension. Can someone do a better analysis?

--[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:48, 8 October 2025 (UTC)

:2) Images for Wikicommons are being created, it will take a lot of time. and the text is not an exact one-to-one match
:3) I also mentioned that It was being created so that it is more accessible from mobile phone, which is not possible in RG or in Zenodo
:Let me clarify the purpose of uploading it to different platforms
:Zenodo - registration and to link DOI
:RG - Self Archiving 
:Wikiversity - Accessible by anyone from any device. LLMs may get trained on Wikiversity data or use these data for indexing 
:5) The paper is a result of a research project which involved a browser extension which was built to test the theory.  [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 01:34, 9 October 2025 (UTC)
:: I find the practice here of publishing non-identical but similar text (&quot;the text is not an exact one-to-one match&quot;) with almost the same title to be problematic. I cannot imagine this is a recommended practice in academic publishing. At a minimum, somewhere near the top, the page should say something like the following: &quot;This text is based on article ___ published at ___ but is not identical. The author of the differences/changes is ___.&quot; Everything else leads to an undesirable confusion. In academic publishing, the title of an article serves as key part of identification of the artifact.
:: As I said before, I seen nothing particularly academic article-like about the page except for external/superficial signs. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:30, 9 October 2025 (UTC)
:::That Article has been published under CC BY SA 4.0
:::And I am one of the author of the article. That gives me right to modify text and publish it under a similar name. However, I will add the disclaimer text that you have suggested. I hope that helps.  [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 06:07, 9 October 2025 (UTC)
:::: It may give you that right from the ''copyright'' perspective, but perhaps not from ''academic publishing integrity'' perspective. Unfortunately, I do not have any guideline handy; I am merely following my common (or not so common) sense. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:32, 9 October 2025 (UTC)
:: I would like to ask: was this article guided by someone from an academic institution, such as a university? Is it reviewed at least in some weak sense? --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:39, 9 October 2025 (UTC)
:::Yes, This article has been reviewed by two academic professors, their names are also listed as co authors.
:::First, a project guide would help us with selecting a topic and with the document 
:::Second, an Internal examiner would go through our experiment and approve it
:::Finally, External Examiner would examine the documentation and verify it. 
:::We were required by these professors to put their name under contributions [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 05:48, 9 October 2025 (UTC)
:: Let me explicate the promotional potential of such a page a bit: one can go to the page of the article in Wikiversity --&gt; https://tomjoejames.com/ --&gt; HitMyTarget (a commercial, profit-making entity?) Why would the link be to a commercial web site rather than an academic page, or perhaps a LinkedIn account, which I think the person has? There could also be no link at all; a search for the name would turn out something in Google as well. But providing a direct link would drive users/viewers toward that website much stronger since otherwise the viewer of the page would have to open a new Google search window or the like. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:45, 9 October 2025 (UTC)
:::It is evident that the website is not even close to being complete. 
:::I will be creating a separate page under the same domain name specifically for people to contact me.
:::The url would probably be defined as tomjoejames.com/contact-me/
:::I haven't decided yet. But that is my personal website.
:::If the community requires me to remove it, I will. But personally I think people who are from here most likely to click the link to know more about me or to contact me. Either way I think my personal website serves the purpose. 
:::As for the HitMyTarget, it can be traced from any of my links. From my research gate profile, linkedin page or even my own userpage.
:::On the article I did not add any promotional content about myself, I hyperlinked only my own name. I do not know how that is promotional. [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 06:04, 9 October 2025 (UTC)
:::: I am pausing any further responses from me to see whether anyone else has any input. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:30, 9 October 2025 (UTC)
:What does it mean &quot;There is perhaps no more appearance/suspicion of copyright violation&quot;? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 19:57, 16 October 2025 (UTC)
:I have accepted VRT permission per [[ticket:2025100410001149]] FYI. [[User:Matrix|Matrix]] ([[User talk:Matrix|discuss]] • [[Special:Contributions/Matrix|contribs]]) 11:00, 28 October 2025 (UTC)
::Thank you Matrix [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 12:43, 28 October 2025 (UTC)
:I would '''delete''' it. 1) it states its a learning resource. It could not be a learning resource as not rewieved original research. 2) It is not an ongoing research, nor the research was performed on Wikiversity - wv is not a preprint or article database. Maybe it could be moved elsewhere withn Wikimedia domain, but I dont know where. So I would delete it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:56, 20 November 2025 (UTC)
::I would '''keep it.''' Like Dan had pointed out,  we do have article-like pages in Wikiversity, and this is not just a random pseudo science article but an article that is a report of an final year project, it has been reviewed by 3 professors whose name has been mentioned at the very beginning.   [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 14:50, 21 November 2025 (UTC)
:::I think it is not good to rate pages by appearance. It can be done on other Wikimedia projects, but it cannot be done on Wikiversity, because Wikiversity does not create a static format for presenting information, but is focused on the goal and process. Unfortunately, the goal and process do not have a uniform format. While a target article on Wikipedia or an entry on Wiktionary have some standard target format, Wikiversity does not. That is why I personally rate pages according to the goals and their assessment. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:05, 22 November 2025 (UTC)

Further reading for this nomination: [[S: Wikisource:Proposed_deletions/Archives/2025#Index:Cookie_Encryption.pdf]]; EncycloPetey handled the matter. Let me quote his wisdom on Zenodo (which I lack): &quot;This is tied to a PDF on Commons that was uploaded as &quot;own work&quot; with a CC license and a doi link to Zenodo, with no indication of where this paper was published or if it was published. Zenodo is not a publisher; it is a site for storing research and sharing papers. If Zenodo is the only place this was &quot;published&quot; then it was effectively self-published. --EncycloPetey (talk) 16:14, 15 September 2025 (UTC)&quot;

--[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 08:55, 9 October 2025 (UTC)

:Can you clarify what point are you trying to state? Didn't I already state that the article is published by me? 
:I first created the article in wikisource which I thought would be the perfect place, unfortunately they do not allow self published articles that are not notable. Then I discovered Wikiversity where they allow self published articles. That is why I created the article here. 
:Unlike in wikisource, I did follow guidelines.
:Ever since you deleted the first article, I spent time reading Wikiversity guidelines and I do think that I am following it perfectly.
:I would like to get your suggestions on how should I improve the page,  10 points would be sufficient. 
:Because your goals or intentions are confusing me very much. At first you told me that the article is exactly the same as the preprint in RG and therefore there is no use to it here. And then when I continued to optimize it for Wikiversity, you went ahead and said it is problematic according to recommended academic publishing. 
:Atleast just respond to the points that I have made whether you agree or disagree. So that I clarify and proceed to discuss points that are important and relevant 
:Have you published an research article? If yes, could you send it to me so that I can see the format you have done it [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 10:45, 9 October 2025 (UTC)
:: I am giving a chance/time to other curators/custodians to look at the matter and respond to my inputs. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 11:14, 9 October 2025 (UTC)
:: Incidentally, above I counted 4 questions (or more), 1 request (or more?) and 1 command (or more?). That is a behavior of a commanding entity. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 11:24, 9 October 2025 (UTC)

I would '''delete it''''. It's more like an academic communication than a learning resource or research.--[[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:32, 26 October 2025 (UTC)
:: In the above post, I do not see any valid rationale for deletion: we do have article-like pages, in Wikijournals and also e.g. in [[Physics/Essays/Fedosin/Stellar Stefan–Boltzmann constant]]. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 08:59, 3 November 2025 (UTC)
:::But I do, see above. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:56, 20 November 2025 (UTC)

:it is a '''student research paper''' forming part of a learning resource on web security and encryption.
:The project was conducted as part of a final-year university course and documented as a practical study on cookie encryption and it has been reviewed by three professors. However, I will be creating a sub page for the article to elaborately describe the experiment that we have conducted and the results we got.    [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 15:57, 26 October 2025 (UTC)
::And why should w host research papers? Wikiversity is not an academic Journal nor repository. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:06, 22 November 2025 (UTC)
:::I do not wish to go through this same argument once again, I've already answered to this question several times in Dan's talk page, Colloquium. you can refer them. I am not hosting the research paper here, I have already hosted the pdf in the ResearchGate, I have published a text version in the wikiversity so that it may be useful for others. Unless you can show me how that article is totally useless, I would like to '''keep''' the article in the wikiversity.    [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 10:13, 22 November 2025 (UTC)
::::And thats the point I am having. Wikiversity is not paper repository. The only way is to publish it via WikiJournal, but they want it for Wikipedia usually. Why wikiversity should be a duplication of ResearchGate, Academia or Zenodo?
::::What I can read on [[Wikiversity:What is Wikiversity?]] policy is, that Wikiversity research &quot;...includes interpreting primary sources, forming ideas, or taking observations.&quot; The article doent look to fall into this. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:43, 22 November 2025 (UTC)
:::::Well, then how come you missed the term &quot;Learning Projects&quot;? As Jtneill had pointed out, this is a legitimate learning project. And also, I do have the VRT permission to host this article on Wikiversity.  [[ticket:2025100410001149]] . besides ResearchGate is an self-archiving platform. the document version in it is not accessibly to screen readers (usually disable people use them), Translators, and also for the mobile readers. therefore I do have valid reasons to publish this article on wikiversity. 
:::::# It is a learning project, therefore according to WIkiversity Policy, It qualifies. 
:::::# I have an explicit VRT permission to host this article on Wikiversity
:::::# Versions that are published in RG, Zenodo are documents, and they are not accessible by screen readers or mobile users. Therefore it is imperative that an article version of this paper exist on here. 
:::::Therefore this article qualifies to stay here on Wikiversity.  [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 11:22, 22 November 2025 (UTC)

'''Keep'''. This is a legitimate student learning project that may be of use to others. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:51, 22 November 2025 (UTC)
{{archive bottom}}

== [[Pragmatics/History]] ==
{{archive top|Deleted. Other related resources have been deleted. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:24, 17 May 2026 (UTC)}}
Another KYPark page and subpages with unclear organization scheme. Contains fairly many redlinked items. See also [[User:KYPark/Literature]], perhaps a similar concept. Unlikely to be really useful for others but KYPark. '''Move to user space'''.

As an alternative, moving to [[History of Pragmatics (KYPark)]] would make sense to me: the topic is identified using a natural-language phrase (instead of the relatively unnatural slash) and the responsible editor is indicated so that the reader knows whether to look or not. And for those who oppose the brackets (which I like): [[History of Pragmatics/KYPark]]. Or also: [[KYPark/History of Pragmatics]]. But then, searches in mainspace will see that content and the question is whether that is good. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:21, 15 October 2025 (UTC)

:What about to propose the user to write some guidelines, how other can participate instead of deleting it? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:03, 16 October 2025 (UTC)
:: I plan to move the pages to userspace as I proposed. If someone wants to ask KYPark to address the problems, they should feel free. There will be plenty of time for KYPark to address the problems while the material is in user space. After the problems are addressed, the material can be moved back to mainspace. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:38, 15 November 2025 (UTC)
:So I would '''delete''' it. In the blocked user space its useless. The user cannot improve it and Wikiversity is not free hosting service for personal pages. My believe is, that there should be just a few working pages in the users spaces. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:30, 11 March 2026 (UTC)

'''Move'''. Insufficient statement of learning objective or connection to related learning resources with insufficient current activity to stay in main space. The page was originally [[History of pragmatics]] but was moved by Dave B. Therefore, I suggest moving to [[User:KYPark/History of pragmatics]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:57, 22 November 2025 (UTC)
{{archive bottom}}

== [[IMHA Research Archives]] ==
I propose to '''move to userspace''', including the subpages. I struggle to understand how Wikiversity readers are supposed to benefit from the material here and in the subpages. In the log, there is e.g. '10 February 2019 Marshallsumter discuss contribs deleted page IMHA Research Archives (content was: &quot;{&lt;nowiki/&gt;{Delete|Author request}} Thanks! -&quot;)', so the page was deleted before, but not the subpages.

We could also delete all the material if we have strong enough suspicion too much of it is copyright violation. In any case, moving to user space improves the matter a little by moving the content away from Google search. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 13:38, 9 November 2025 (UTC)

:Looking at some sub-pages, they can be deleted e.g., because they only consist of broken links or are largely empty. I deleted a couple but haven't been through all to check. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:27, 10 November 2025 (UTC)

As an example, let me give the wikitext content of [[IMHA Research Archives/3. Scientific litterature search, storage and use]]:
&lt;pre&gt;
==[[/Medicina Maritima - the Spanish scientific maritime health journal/]]==

==[[/PubMed/]]==

==[[/Google and Google Scholar/]]==

==[[/Zotero/]]==

==[https://www.dropbox.com/sh/d91z7bcyelfvk42/AAAkIvjtBnnFMbiU9ZLOdVL9a/Andrioti_database%20sources0310.pptx?dl=0 Maritime health web portal ressources ]==
&lt;/pre&gt;
The wikilinks are red; the external link to dropbox says &quot;You don't have access&quot;. This was made in 2016. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 09:04, 11 November 2025 (UTC)

:I suggest delete -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 03:27, 12 November 2025 (UTC)
:: I think we should avoid deletion as much as possible, instead moving to user space (bar copyvio, ethics violation, etc.). This is a good general principle. It greatly improves auditability and makes it so much easier for anyone to request undeletion since they know what content they are requesting for undeletion. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 09:52, 12 November 2025 (UTC)
:::Do not recreate Wikiversity from the educational and research project to the personal blog. That will lead to the cancelation of it by WMF. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:44, 20 November 2025 (UTC)
:::: The English Wikiversity has a long tradition of moving problematic content to user space, as per evidence collected at [[User:Dan_Polansky/About Wikiversity#Moving pages to userspace]]. If Wikimedia Foundation finds this problematic, they can start a discussion in Colloquium and state their concerns. They do not need to make explicit threats at first; they can start a discussion and explain why it is problematic. They can even do it from an anonymous IP and provide a well-articulated reasoning. And anyone else can start a discussion in Colloquium to change this tradition. I do not see why we should not want to change that tradition based on well-articulated, compelling reasoning. I see no reason why Juandev should be making threats instead of them, on a per RFD basis. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:58, 21 November 2025 (UTC)
:::: If Juandev is ''sincere'' about deleting very-low-value items ''from user space'', he should perhaps demonstrate that by asking his pages like [[:cs:Uživatel:Juandev/Problémy/Kov/Repase dvířek elektroskříně]] to be deleted; otherwise, I register a ''glaring inconsistence''. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 07:43, 21 November 2025 (UTC)
::What was the original delate page about @[[User:Jtneill|Jtneill]]? I guess that would be crucial for the decission. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:48, 20 November 2025 (UTC)
:::@[[User:Juandev|Juandev]] the couple of pages I checked and deleted were much like @[[User:Dan Polansky|Dan Polansky]] posted above i.e., headings with empty sections and/or broken links but no substantive content. But I think each sub-page needs checking. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 21:59, 20 November 2025 (UTC)
::::So I'm saying that the main page usually determines what the other pages are for. But if I don't know the page because it's been deleted, or why was deleted (deletion based on the founder's request is probably not the rule), it's hard to judge. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 22:16, 20 November 2025 (UTC)
:::::I've pasted the original content of the root page: [[IMHA Research Archives#Original page]] (i.e., prior to the content being removed and deletion requested) to help understand the context for the sub-pages. In 2018, Saltrabook blanked the page, indicating that the content had been moved elsewhere, and requested page deletion. Marshallsumter then deleted the main page but not the sub-pages. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 01:58, 21 November 2025 (UTC)
::::::I see, so if those subpages are usefull I would keept them, if not I would delete them. I dont see a point of providing free hosting to sombody, by moving many pages to their user space. The question is if we want to host (i.e. to have in the main ns) lists of links elsewhere. I have no opinion on that. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:11, 22 November 2025 (UTC)

: Let me clarify that while many of the subpages are like the example above, [[IMHA Research Archives/Scientific litterature search, storage and use/Zotero]] is different:
:: &quot;A continuous critical and evidence based learning is a core issue in clinical practice, research, teaching, publication and prevention activities. The Zotero Program is just one of many scientific literature management programs, that should be used for these purposes. Of course one can live without such a database but it helps a lot and can save a lot of time that could be used for more interesting issues. Not only that, but it helps to create better publications and knowledge. Without this program it can be very time consuming to publish a scientific article with the requested style for the references. Further in daily practice when you want to collect and cite a few references for a specific evidence in a clinical colloquium and discussion, this program is excellent. Therefore we strongly recommend that all maritime health persons learn how to use this excellent tool in their daily maritime health practice of all different types. There are good online courses for self-instruction on how to use Zotero. For example this one: Zotero fast online course But in order to increase IMHAR´s collective scientific strength in the use of EBM we would like to give training sessions in every possible opportunity, IMHA Symposia, seminars and other types of meetings. The database is useful for personal purposes but especially also for collaborative aims. At the IMHAR meeting in Paris Oct 7th 2016 we will give an introduction to the program by showing how it can be used in the daily practice and discuss strength and weaknesses compared to other similar databases.&quot;
: Even longer is e.g. [[IMHA Research Archives/Scientific litterature search, storage and use/Medicina Maritima - the Spanish scientific maritime health journal]].
: However, that does not mean these should be salvaged. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 07:53, 21 November 2025 (UTC)

== [[Palliative medicine]] ==
{{archive top|'''Kept'''. Page has been improved. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:38, 17 May 2026 (UTC)}}

Underdeveloped and has not been improved on since 2007. Author inactive. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 21:42, 14 December 2025 (UTC)

:Delete, per nominator [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:16, 22 January 2026 (UTC)
:Yes, I would also expect there to be more and especially that someone would write how to use it. However, it still seems to me to be a useful thing in the sense of a syllabus, so that someone who is interested in the topic knows what information to obtain in order to get a complete picture of the topic. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:55, 16 March 2026 (UTC)
{{archive bottom}}

== [[Canadian Wilderness]] ==
{{archive top|Deleted per nom. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:07, 17 May 2026 (UTC)}}
This page doesn't seem to belong to wikiversity. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 09:55, 6 February 2026 (UTC)

:In principle there could be some material useful here but in practice, I don't see what this page is adding as an educational resource. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 12:54, 6 February 2026 (UTC)
:I can see this being a useful resource to a bigger project. Maybe we could move it to the &quot;[[Wikiversity:Drafts|Draft]]&quot; namespace vs. deleting it? —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 13:28, 6 February 2026 (UTC)
::Does anyone plan to work on it? [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 01:59, 8 February 2026 (UTC)
:::Next week the page has it's 17th birthday. Ever now and than someone added to it. With a lot of work it could be a nice encyclopedic article but making it educational .... Merging it may take more work than rewriting it. Move to Draft might be the best option. [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 08:58, 12 February 2026 (UTC)
{{archive bottom}}

== [[LQR Control for an Inverted Pendulum]] ==
{{archive top|'''Deleted''' per nom. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:36, 17 May 2026 (UTC)}}
Underdeveloped resource, has not been edited for more than a decade. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 08:03, 16 March 2026 (UTC)

:Looks like a test, '''delete'''. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:30, 27 March 2026 (UTC)
{{archive bottom}}

== False flag &quot;authority hack&quot; user page deletion ==
{{archive top|'''Not undeleted''', the requester dropped the request. See Wikiversity:Requests for Deletion v. 2803217.--[[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:36, 10 May 2026 (UTC)}}
'''Undeletion requested'''

Hi, Juandev marked my user page as &quot;spam&quot; and &quot;authority hack&quot;, and deleted it. 

First, I asked him for help with &quot;time limit for new users&quot;, and he replied - I should admit I dont know, what is &quot;new user limit&quot;, but if filter blocks your page because of certain external link, you may force to save anyway and sometimes it works. It should not work, when the website is blacklisted. As of now, I am not seeing you to save page in main namespace, so try to save it without external links first. 

Then he wrote me another message: Well, I have analyzed your contribution to Wikiversity and I should point out here, that this project is not a place for advertising, so there is no way of promoting your books and authority this way. - probably referring to the intro of my About me page where I present me and my work. 

Before I could explain him the difference between the neutral information and advertising and promotion, he deleted my user page. 

Here is my answer I posted to the discussion today: 

: Hi, my About Me page is just an info page with the neutral as possible presentation of my work.
:
: There is a big difference between informing and advertising. Informing is neutrally stating that something exists and requiring no action, while advertising is a special communication form with intent to cause certain action from readers. For example, click here, click there, order this, buy that.
:
: There is no such intention, form, or terms on my info page. Just neutral information. I don't hide and I am not ashamed that I am write and author, and that is a part of the usual bio, including works. I checked your user page: &quot;I graduated from the Czech University of Life Sciences in Prague and studied information science at the Faculty of Arts of Charles University.&quot; I think that if you had written a book on Life Science, you would have mentioned that as well.
:
: Most of the Info page is about my research and AIPA Method which is a valid contribution to psychology, consciousness studies, identity theory, and personality development. Actually, my paper '''AIPA Method: A Cognitive-Phenomenological Model for Identity Reconstruction and Stabilization in Pure Awareness''' is now in the peer review procedure at Journal of Consciousness Studies.
:
: Here is a part from the Wikiversity AIPA Method page in creation (waiting for the end of the time limit for new users):

: == Introduction ==
: The AIPA Method addresses a gap in contemporary personal development and consciousness science: most evidence‑based approaches (CBT, MBSR, MBCT, standard meditation) operate at the level of mental content—reframing thoughts, observing them, or reducing their impact—rather than at the level of identity structure. In contrast, AIPA targets the structural relationship between the self and the mind, aiming at durable identity reconstruction rooted in Pure Awareness rather than symptom management.
:
: The central research question of the primary AIPA preprint is whether a structured, sequentially staged method can produce permanent identity reconstruction rooted in Pure Awareness, and how such a method compares to established approaches in scope, mechanism, and outcome.
:
: == Theoretical foundations ==
: The AIPA framework is grounded in the cognitive‑phenomenological tradition (e.g., McAdams, Varela, Metzinger, Erikson), contemporary consciousness science on minimal phenomenal experience, and qualitative methods advocacy in psychology. It builds directly on:
:* Empirical work on pure awareness and Minimal Phenomenal Experience (MPE), especially Gamma &amp; Metzinger’s large‑scale study of content‑reduced awareness states.
:* Metzinger’s proposal of minimal phenomenal experience as an entry point for a minimal unifying model of consciousness.
:* Narrative identity and partial‑self models within personality and identity theory.
: Within this backdrop, AIPA proposes Pure Awareness as a distinct, operationally specified state that can become a structural ground of identity rather than a transient meditative experience.
:
: == Experiential empiricism ==
: The empirical foundation of the AIPA Method is explicitly first‑person and experiential, combining:
:* A 22‑year longitudinal autoethnographic self‑study (2003–2025) documenting partial personality episodes, protocol use, and outcomes.
:* A 13‑year prospective verification period with zero self‑reported recurrence of targeted harmful behaviors after a dated stabilization point (1 January 2006).
:* A high‑ecological‑validity “stress test” during acute bereavement, used to examine whether non‑reactive awareness remains stable under maximal provocation.
:* Two independent practitioner cases (an Amazon‑verified report and a structured questionnaire case) providing preliminary convergent signals across cognitive, emotional, behavioral, and identity dimensions.
:
: All central constructs (Pure Awareness, partial personalities, the Switch, identity stabilization) are operationalized with explicit phenomenological and behavioral criteria intended to enable replication and future third‑person measurement.
:
: I believe this is a valid contribution to Wikiversity.
:
: Best regards, Senad [[User:Senad Dizdarević|Senad Dizdarević]]


I suggest you check the deleted user page, and see for yourself if it is &quot;spam&quot; and &quot;authority hack&quot;, or a legit author's page with one paragraph short presentation, while the rest of the page is about my research project. 

Thank you for undeleting my user page, so I can use it. 

Best regards, 

Senad Dizdarević [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:26, 2 April 2026 (UTC)

:Hi Senad,
:Welcome to Wikiversity.
:It looks like you tried adding similar content to Wikipedia and ran into similar difficulties over there ([[w:User talk:Senad Dizdarević]])? Perhaps that is what has led to you Wikiversity?
:Basically, if you'd like to collaborate and help build open educational resources, feel free to contribute to Wikiversity. But if the primary motivation is to promote your autobiographical work you're probably going to run into challenges.
:Sincerely,
:James
:-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:11, 3 April 2026 (UTC)
::James, Hi, and thank you for your answer. 
::Yes, in 2025, I created the autobiographic page on Wikipedia, which was removed because of the links to my books on Amazon. To admin, I explained that I did not know the rules, and agreed that page is removed. Now I know that somebody else must write a Wikipedia page for you. 
::On the deleted user page on Wikiversity, there were no links to Amazon or any other form of promotion, just neutral as possible basic presentation of my writing (one sentence) and current project (the rest of the page). 
::I created Wikiversity page to present my AIPA Method project, to invite researchers to read it, give their opinion, and conduct empirical researches in their institutions. Now, it is in a theoretical phase, and needs more empirical testing. 
::Best regards, 
::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:03, 3 April 2026 (UTC)
:::It looks to me like the primary motivation for contributing to Wikiversity is to drive traffic / search engine ranking to your website?
:::* [[User:Senad Dizdarević]]
:::* [[AIPA Method]]
:::-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 01:36, 4 April 2026 (UTC)
::::No, it is not. There is no link to my website, so &quot;driving traffic to my website&quot; is not possible. 
::::For your educational purposes: 
::::Copilot &quot;AI:  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:38, 4 April 2026 (UTC)
:::::So do you still insist of undeleting your former version of your userpage if you have created the new one? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:15, 6 April 2026 (UTC)
::::::No, because in the moment of undeletition, somebody could delete it again, and so on. Thank you for not deleting my new user page, as it is made in your user page image.  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 08:59, 6 April 2026 (UTC)

{{archive bottom}}

== Undeletion request ==

It was deleted by an admin without discussion and with untrue rationale. If people take offense with the question that doesn't mean it's not a valid question and the page was good. Please undelete the Wikidebate page [https://web.archive.org/web/20250810030352/https://en.wikiversity.org/wiki/Is_it_likely_that_Earth_has_been_visited_by_aliens_millions_of_years_ago%3F Is it likely that Earth has been visited by aliens millions of years ago?]

There are lots of sources on the subject, the wikidebate is sourced very well compared to other wikidebates and wikiversity pages, and the page is educational, useful and of good quality. [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 23:57, 10 April 2026 (UTC)

:Page: [[Is it likely that Earth has been visited by aliens millions of years ago?]]
:Ping: [[User:Atcovi|Atcovi]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:21, 11 April 2026 (UTC)
:There is no need for a discussion for straight garbage-level, pseudoscientific content.
:For '''Is it likely that Earth has been visited by aliens millions of years ago?''', the flaws for this page wouldn't even take someone more than a few minutes to assess:
:* Essentially, the &quot;pro&quot; arguments unproven claims being derived from irrelevant, established facts (basically: &quot;it is likely aliens have came because Earth has existed for so long [sources proving Earth's longevity]&quot;). These are not serious, scientifically-backed arguments - these are non sequiturs. It's as if I said Wikipedia has existed longer than my existence on Earth ([https://d1wqtxts1xzle7.cloudfront.net/74351725/eyJoIjogImZiODhmYzNkODU1N2UxMWExYzUyODJiYzgzZTRmZDM4OTBjODY5YWMzMjA3NDNmOWEyZTA0ZTU3ZGYwZjAyYTkiLCAidSI6ICJodHRwczovL3B1cmUuaHZhLm5sL3dz-libre.pdf?1636354596=&amp;response-content-disposition=inline%3B+filename%3DCritical_Point_of_View_A_Wikipedia_Reade.pdf&amp;Expires=1775872055&amp;Signature=GqbUZboYRvUYWi~aW40LT5eZSHrLuDL3o0-DxAH8vSvcJcGAuyByZWLF2oHTY6GlB72TqvZxpE-v9d4gvsA6myriYqO~QQQZgWxjT2JXjUWC-yiPcTF4l~lroJSi4dY0v9eKiBcU03l-aeUdrX8~UPfi0TfW0IhsmzH-VBR6X6FrzRpIqc6uM6n9YXfr5FRB3aCqqokU690af3n0Hguaub1Zgmh9qjYYqzBS0VOOHjKTTEQnDuadX3jl5CQeXYTaeCC3H0hMeVwHlratbrnuFEKC1aN0-5znCUoSzMEg21ECzGPTrSDM1W05dcK-u0ZTCeUGKAuC-2yRFL3sY46MIw__&amp;Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA#page=157 reputable source proving ''this'' fact]), therefore it's likely that my birth took place solely for the sake of me experiencing Wikipedia (0 backing). It makes no sense and no person with at least a high school-level of intelligence would take this seriously. 
:* What is worse is that the user is being misleading with their &quot;[the page is] sourced very well&quot; claim. The sources ''themselves'' don't even back up the claims. It's just used as proof for an established concept, where the user then uses this established concept to jump to an unsupported, laughable conclusion that is pulled out of thin air. It's utterly ridiculous to even consider such a page for mainspace since it clearly violates our [[Wikiversity:Verifiability]] policy. This is, once again, pseudoscientific content that has caused our website to reduce in quality over the last few years. 
:* Going source by source, we can see that:
:#[https://web.archive.org/web/20250918011642/https://timesofindia.indiatimes.com/blogs/thebigd/compress-earths-history-into-24-hrs-humans-came-at-1158-pm-yet-killed-70-of-wildlife/ ‘Compress Earth’s history into 24 hrs. Humans came at 11:58 pm, yet killed 70% of wildlife’] is literally just a blog post which doesn't even mention aliens or extraterrestrial life. It just talks about Earth's history in accordance with the 24-hour metric of time, and the author tries to use this article as a 'piece in the puzzle' of aliens &quot;possibly&quot; visiting Earth... which, once again, is unsupported and is not backed up anywhere in the article.
:#[https://web.archive.org/web/20250808053249/https://news.cornell.edu/stories/2023/11/jurassic-worlds-might-be-easier-spot-modern-earth The Cornell article does not even remotely support the idea that &quot;aliens visited Earth&quot;]. It mentions a ''chance'' of &quot;life there [a habitable exoplanet] might not be limited to microbes, but could include creatures as large and varied as the megalosauruses or microraptors that once roamed Earth.&quot;, but again, no justification to take this article as proof that &quot;aliens may have visited us!&quot;. There's no mention of aliens visiting Earth anywhere in the article. Once again this is only proving the background premise, but not the unsupported, nonsensical &quot;alien likelihood&quot; argument that the author of this garbage page is trying to push so desperately.
:#The Parker Solar Probe WP article does not even mention aliens either. It follows the same issues as the previous argument.
:And the other page this user complained about [https://en.wikiversity.org/wiki/User_talk:Atcovi#Deletion_of_educational_page_because_of_personal_opinion on my talk page] holds almost similar, maybe even more fatal mistakes, than this one. It has nothing to do with &quot;taking offense&quot;, this is just low-quality, garbage content. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 00:56, 11 April 2026 (UTC)
::Why do you think pro claims are required to be proven? It's possible to object to them and these are arguments, not contextualized to be statements of proven facts. And it's not a strange or unreasonable argument to make that since Earth has existed for long, it's more likely that aliens have come here in the past than in recent times or the near future. Instead of insulting others' intelligence, maybe engage with the actual reasoning rather than censoring it away. And there are lots of sources, such as [https://interestingengineering.com/science/alien-civilizations-may-have-visited-earth-millions-of-years-ago-study-says Alien Civilizations May Have Visited Earth Millions of Years Ago, Study Says] etc etc. The sources are used for the arguments themselves individually. [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 12:30, 11 April 2026 (UTC)
:::Because, once again, this is not a site that caters to rampant debating for the sake of &quot;we need to employ rationality and logic to solve the world's problems&quot;, we have policies that we need to fulfill. The claims made in the pro argument clearly do not meet [[Wikiversity:Verifiability]], since you cannot verify these arguments with the sources because they are not relevant. 
:::''&quot;And it's not a strange or unreasonable argument to make that since Earth has existed for long, it's more likely that aliens have come here in the past than in recent times or the near future.&quot;'' The point being is that these arguments are not supported by the sources. Even the article you mention poses the idea as a hypothetical model. This is just you twisting the article to fit your unsupported narrative. I'll bring direct quotes for you to show why the linked article does not help you:
:::* ''One problem the researchers do make sure to point out is that '''they are working with only one data point: our own behaviors and capabilities for space exploration'''. “We tried to come up with a model that would involve the fewest assumptions about sociology that we could,” Carroll-Nellenback told Business Insider. '''We have no real way of knowing the motivations of an alien civilization'''.'' --&gt; proves that this is just speculation and no evidence-based arguments have been provided for the idea that aliens likely visited Earth.
:::And I'm not sure if you read my entire response, but I ''did'' engage with your &quot;actual reasoning&quot; and exposed its weaknesses and lack of adherence to Wikiversity policies. If we allowed content that was just filled with non sequiturs we would have content that fails Wikiversity's educational objectives and reduces the overall quality of this website, hence why such a harsh stance needs to be taken. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 13:50, 11 April 2026 (UTC)
::::Thanks for proving that the Wikimedia ecosystem is unfit to deliberate on controversial topics. The question is entirely valid and the content is far better sourced than nearly all Wikidebates and has no genuine flaws. The only possible issue with it as far as I can see is that now that Wikidebates has been paused people can't add objections if they do have sth specific to say about the topic that's not already included on that page which already had plenty of Cons and objections.
::::The page was more educational than most of Wikiversity and it was well-sourced – wikidebates was for arguments so people were invited to make arguments based on sourced things or outlined logic and the page met [[WV:V]] and most pages on Wikiversity aren't sourced as good. Doesn't look like people can see beyond their biases and personal views here but that's more evident in the marginalization and deletion of wikidebates and the low activity in that project than these selective deletions. A constructive thing to do would be to add reasoned Cons and objections not yet on the page and people had plenty of time to do that. There are and will be other sites for free constructive rational adversarial deliberation (not a big loss in that sense). [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 16:31, 22 April 2026 (UTC)
:::::Thank you for failing to address any of my arguments and going on an unrelated, nonsensical tangent that has nothing to do with the discussion. Once you start producing work that aligns with Wikiversity's content policies instead of typing up laughable, pseudoscientific garbage, then maybe your work can be accepted and not removed. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 16:59, 22 April 2026 (UTC)
::::::I suggest you stop ridiculing things and learn respectfully forming genuine points about the subject at hand. {{tq|the idea as a hypothetical model}} but please learn first about what arguments are and why they're not the same as a statement of objective proven fact. [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 17:18, 22 April 2026 (UTC)

==Pages by Harold Foppele==
[[User:Harold Foppele]] is locally blocked indefinitely and globally banned for sockpuppetry. There were also WMF and local community concerns expressed about copyright violation and AI (over)use. As a result, I think the Wikiversity pages created by this account warrant review with regard what should be deleted, what should be retained etc.:
* [[Completing the square]]
* [[Number of independent spatial modes in a spherical volume]]
* [[Quantum]]
** [[Quantum/Andrew N. Jordan]]
* [[Quantum A Matter Of Size]]
* [[Quantum A Spooky Action at a Distance]]
* [[Quantum: A Walk Through the Universe]]
* [[Quantum Computing Algorithms in the NISQ Era]]
* [[Quantum Formulas Collection]]
* [[Quantum harmonic oscillator]]
* [[Quantum Matter Elements and Particles]]
* [[Quantum mechanics]]
** [[Quantum mechanics/Timeline]]
* [[Quantum mechanics learning module]]
* [[Quantum mechanics measurements]]
* [[Quantum Noisy Qubits]]
* [[Quantum optics beam splitter experiments]]
* [[Quantum: The Secret of Cohesion: How Waves Hold Matter Together]]
* [[Quantum Ultra fast lasers]]
* [[Speed of sound experiments]]
* [[User:Harold Foppele]]
-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 08:12, 17 May 2026 (UTC)

:'''Delete all''' Not worth keeping. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 08:27, 17 May 2026 (UTC)</text>
      <sha1>27zb1ty5a5hzpkyrj8wdnwfobmlxtpm</sha1>
    </revision>
    <revision>
      <id>2809919</id>
      <parentid>2809918</parentid>
      <timestamp>2026-05-17T11:58:56Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <comment>/* IMHA Research Archives */ Reply - {{ping|Saltrabook}}</comment>
      <origin>2809919</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="57056" sha1="pxa3oe49na1v9efputkmxyhxyj24qlo" xml:space="preserve">{{/header}}
[[Category:Wikiversity deletion]]

__TOC__

== [[Korean/Words]] ==
(I go to RfD instead of ''proposed deletion'' since many pages are affected.)

I proposed to quasi-delete, i.e. '''move to userspace''' of the main (or sole?) creator, {{User|KYPark}}.

The page is organized a little bit like a dictionary. It makes it redundant to Wiktionary except that Wikiversity allows original research and there does seem to be original research there. Thus, its being organized as a dictionary would alone not necessarily be a problem.

Where I see a problem is in the organization and execution/implementation. Consider [[Korean/Words/가다]], which seems rather typical of the subpages (some subpages are like categories and transclude the pages for individual words):
* On the putative definition line, there is this: &quot;한곳에서 다른 곳으로 장소를 이동하다&quot;, apparently(?) in Korean. That does not seem to fit well into the ''English'' Wikiversity.
* There seems to be some original research into etymological relations between Korean and European languages in the &quot;Comparatives&quot; section (from what I recall, the English Wiktionary rejected this kind of content from KYPark). Admittedly, it is marked using &quot;This is a primary, secondary and/or original Eurasiatic research project at Wikiversity&quot;, so it could be tolerable, but even so, one has to wonder whether Wikiversity wants this kind of fringe science/research or outright pseudo-science.
** Fringe science: fringe physics has been moved to user space before. This would be fringe etymology. But then, original research is allowed.

Deletion is not required; moving to user space suffices, I think. Alternatively, one could at least rename the pages to make it clear from the title that this is not Wikiversity voice but rather KYPark voice, e.g. &quot;Korean/Words (KYPark)/...&quot; or  &quot;Korean/Words/KYPark/...&quot;  (recall the &quot;Fedosin&quot; pages featuring the name &quot;Fedosin&quot;).

Methodology: I see almost no methodological notes spanning the words at [[Korean/Words]]. And yet, if this is original research inventing new etymological connections, surely there should be some general considerations/analysis on how to proceed and how that manner of procedure differs from mainstream etymology?

Prefix index (max 200 items?):
{{collapse top}}
{{Small START}}
{{Special:Prefixindex/Korean/Words}}
{{Small END}}
{{Collapse bottom}}
--[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 09:33, 24 September 2025 (UTC)

:I would keep it. If there is a course of Korean, why not to have a resesearch on Korean vocabulary? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 19:53, 16 October 2025 (UTC)
:: I propose to dismiss the above input: 1) it does not contain any argument, except for a question, and a question is not an argument (it can be so reinterpreted, but that includes additional burden on the interpreters, in interpreting it the wrong way); 2) it ignores all the issues I have raised, including that there is something like definition lines in Korean, in this ''English'' Wikiversity. To answer the question asked: there can be a research on Korean vocabulary in the mainspace, but not one showing the defects I identified above. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:35, 15 November 2025 (UTC)
:I've reviewed a sample of approximately 20 of the Korean/Words sub-pages and lean towards moving to user space because:
:* The pages appear to be an idiosynchratic collection of etymological pages about Korean language
:* There is minimal English instruction which is problematic for English Wikiversity
:* There is no explanation of research method
:* There is no educational rationale
:-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:31, 22 November 2025 (UTC)
:Well, since the original creator has indef I change my mind and I would '''delete''' it. The case is nobody knows how to continue with the research and if we move it to the userspace, the user cannot improve it eihter. What the original user can do to request admin, to send them a contentent to their email for example if they really want to improve the resource elsewhere. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:38, 11 March 2026 (UTC)

I think the consensus here is delete. {{U|Codename Noreste}} do you know an efficient way to mass delete these pages? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:49, 17 May 2026 (UTC)

== [[Enhancing Web Browser Security through Cookie Encryption]] ==
{{archive top|'''Kept'''. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:28, 17 May 2026 (UTC)}}
To avoid further conflict with the user who entered this text into Wikiversity, I am opening a RFD request.

I am not sure about how to proceed, although I am inclined to move it out of mainspace = quasi-delete. I am looking forward to get input from others, especially curators and custodians. Some considerations:

1) There is perhaps no more appearance/suspicion of copyright violation, now that the ResearchGate (RG) article (of which this is a copy, perhaps an incomplete copy?) carries a license.

2) The article is not a complete replica from RG: at a minimum, it lacks images. The inserter could have continued editing the page in his user space before he uploads images, that is, before he finalizes the page for consumption, but that did not happen. I did not check whether the text is an exact one-to-one match; the article does not indicate anything in that regard.

3) The principle implied seems to be this: users should feel free to duplicate non-peer-reviewed articles from RG in English Wikiversity, perhaps to increase the Google search and LLM yield. I find this problematic, in part for the duplication. I would say: choose a venue and publish it there. If RG is not good enough for you as a publishing venue, choose Wikiversity instead, but not both?

4) There are some features that appear unduly promotional. There is a link to a dot com home page of the inserter of the article. I dot not know how we handle or should handle this, whether prohibit such a link, etc. This is perhaps not so much a call to quasi-deletion but a call to make it less promotional.

5) I cannot determine the value of such an article. It seems to be a pseudo-article describing someone's browser extension. Can someone do a better analysis?

--[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:48, 8 October 2025 (UTC)

:2) Images for Wikicommons are being created, it will take a lot of time. and the text is not an exact one-to-one match
:3) I also mentioned that It was being created so that it is more accessible from mobile phone, which is not possible in RG or in Zenodo
:Let me clarify the purpose of uploading it to different platforms
:Zenodo - registration and to link DOI
:RG - Self Archiving 
:Wikiversity - Accessible by anyone from any device. LLMs may get trained on Wikiversity data or use these data for indexing 
:5) The paper is a result of a research project which involved a browser extension which was built to test the theory.  [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 01:34, 9 October 2025 (UTC)
:: I find the practice here of publishing non-identical but similar text (&quot;the text is not an exact one-to-one match&quot;) with almost the same title to be problematic. I cannot imagine this is a recommended practice in academic publishing. At a minimum, somewhere near the top, the page should say something like the following: &quot;This text is based on article ___ published at ___ but is not identical. The author of the differences/changes is ___.&quot; Everything else leads to an undesirable confusion. In academic publishing, the title of an article serves as key part of identification of the artifact.
:: As I said before, I seen nothing particularly academic article-like about the page except for external/superficial signs. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:30, 9 October 2025 (UTC)
:::That Article has been published under CC BY SA 4.0
:::And I am one of the author of the article. That gives me right to modify text and publish it under a similar name. However, I will add the disclaimer text that you have suggested. I hope that helps.  [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 06:07, 9 October 2025 (UTC)
:::: It may give you that right from the ''copyright'' perspective, but perhaps not from ''academic publishing integrity'' perspective. Unfortunately, I do not have any guideline handy; I am merely following my common (or not so common) sense. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:32, 9 October 2025 (UTC)
:: I would like to ask: was this article guided by someone from an academic institution, such as a university? Is it reviewed at least in some weak sense? --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:39, 9 October 2025 (UTC)
:::Yes, This article has been reviewed by two academic professors, their names are also listed as co authors.
:::First, a project guide would help us with selecting a topic and with the document 
:::Second, an Internal examiner would go through our experiment and approve it
:::Finally, External Examiner would examine the documentation and verify it. 
:::We were required by these professors to put their name under contributions [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 05:48, 9 October 2025 (UTC)
:: Let me explicate the promotional potential of such a page a bit: one can go to the page of the article in Wikiversity --&gt; https://tomjoejames.com/ --&gt; HitMyTarget (a commercial, profit-making entity?) Why would the link be to a commercial web site rather than an academic page, or perhaps a LinkedIn account, which I think the person has? There could also be no link at all; a search for the name would turn out something in Google as well. But providing a direct link would drive users/viewers toward that website much stronger since otherwise the viewer of the page would have to open a new Google search window or the like. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:45, 9 October 2025 (UTC)
:::It is evident that the website is not even close to being complete. 
:::I will be creating a separate page under the same domain name specifically for people to contact me.
:::The url would probably be defined as tomjoejames.com/contact-me/
:::I haven't decided yet. But that is my personal website.
:::If the community requires me to remove it, I will. But personally I think people who are from here most likely to click the link to know more about me or to contact me. Either way I think my personal website serves the purpose. 
:::As for the HitMyTarget, it can be traced from any of my links. From my research gate profile, linkedin page or even my own userpage.
:::On the article I did not add any promotional content about myself, I hyperlinked only my own name. I do not know how that is promotional. [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 06:04, 9 October 2025 (UTC)
:::: I am pausing any further responses from me to see whether anyone else has any input. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:30, 9 October 2025 (UTC)
:What does it mean &quot;There is perhaps no more appearance/suspicion of copyright violation&quot;? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 19:57, 16 October 2025 (UTC)
:I have accepted VRT permission per [[ticket:2025100410001149]] FYI. [[User:Matrix|Matrix]] ([[User talk:Matrix|discuss]] • [[Special:Contributions/Matrix|contribs]]) 11:00, 28 October 2025 (UTC)
::Thank you Matrix [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 12:43, 28 October 2025 (UTC)
:I would '''delete''' it. 1) it states its a learning resource. It could not be a learning resource as not rewieved original research. 2) It is not an ongoing research, nor the research was performed on Wikiversity - wv is not a preprint or article database. Maybe it could be moved elsewhere withn Wikimedia domain, but I dont know where. So I would delete it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:56, 20 November 2025 (UTC)
::I would '''keep it.''' Like Dan had pointed out,  we do have article-like pages in Wikiversity, and this is not just a random pseudo science article but an article that is a report of an final year project, it has been reviewed by 3 professors whose name has been mentioned at the very beginning.   [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 14:50, 21 November 2025 (UTC)
:::I think it is not good to rate pages by appearance. It can be done on other Wikimedia projects, but it cannot be done on Wikiversity, because Wikiversity does not create a static format for presenting information, but is focused on the goal and process. Unfortunately, the goal and process do not have a uniform format. While a target article on Wikipedia or an entry on Wiktionary have some standard target format, Wikiversity does not. That is why I personally rate pages according to the goals and their assessment. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:05, 22 November 2025 (UTC)

Further reading for this nomination: [[S: Wikisource:Proposed_deletions/Archives/2025#Index:Cookie_Encryption.pdf]]; EncycloPetey handled the matter. Let me quote his wisdom on Zenodo (which I lack): &quot;This is tied to a PDF on Commons that was uploaded as &quot;own work&quot; with a CC license and a doi link to Zenodo, with no indication of where this paper was published or if it was published. Zenodo is not a publisher; it is a site for storing research and sharing papers. If Zenodo is the only place this was &quot;published&quot; then it was effectively self-published. --EncycloPetey (talk) 16:14, 15 September 2025 (UTC)&quot;

--[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 08:55, 9 October 2025 (UTC)

:Can you clarify what point are you trying to state? Didn't I already state that the article is published by me? 
:I first created the article in wikisource which I thought would be the perfect place, unfortunately they do not allow self published articles that are not notable. Then I discovered Wikiversity where they allow self published articles. That is why I created the article here. 
:Unlike in wikisource, I did follow guidelines.
:Ever since you deleted the first article, I spent time reading Wikiversity guidelines and I do think that I am following it perfectly.
:I would like to get your suggestions on how should I improve the page,  10 points would be sufficient. 
:Because your goals or intentions are confusing me very much. At first you told me that the article is exactly the same as the preprint in RG and therefore there is no use to it here. And then when I continued to optimize it for Wikiversity, you went ahead and said it is problematic according to recommended academic publishing. 
:Atleast just respond to the points that I have made whether you agree or disagree. So that I clarify and proceed to discuss points that are important and relevant 
:Have you published an research article? If yes, could you send it to me so that I can see the format you have done it [[Special:Contributions/&amp;#126;2025-27520-79|&amp;#126;2025-27520-79]] ([[User talk:&amp;#126;2025-27520-79|talk]]) 10:45, 9 October 2025 (UTC)
:: I am giving a chance/time to other curators/custodians to look at the matter and respond to my inputs. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 11:14, 9 October 2025 (UTC)
:: Incidentally, above I counted 4 questions (or more), 1 request (or more?) and 1 command (or more?). That is a behavior of a commanding entity. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 11:24, 9 October 2025 (UTC)

I would '''delete it''''. It's more like an academic communication than a learning resource or research.--[[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:32, 26 October 2025 (UTC)
:: In the above post, I do not see any valid rationale for deletion: we do have article-like pages, in Wikijournals and also e.g. in [[Physics/Essays/Fedosin/Stellar Stefan–Boltzmann constant]]. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 08:59, 3 November 2025 (UTC)
:::But I do, see above. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:56, 20 November 2025 (UTC)

:it is a '''student research paper''' forming part of a learning resource on web security and encryption.
:The project was conducted as part of a final-year university course and documented as a practical study on cookie encryption and it has been reviewed by three professors. However, I will be creating a sub page for the article to elaborately describe the experiment that we have conducted and the results we got.    [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 15:57, 26 October 2025 (UTC)
::And why should w host research papers? Wikiversity is not an academic Journal nor repository. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:06, 22 November 2025 (UTC)
:::I do not wish to go through this same argument once again, I've already answered to this question several times in Dan's talk page, Colloquium. you can refer them. I am not hosting the research paper here, I have already hosted the pdf in the ResearchGate, I have published a text version in the wikiversity so that it may be useful for others. Unless you can show me how that article is totally useless, I would like to '''keep''' the article in the wikiversity.    [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 10:13, 22 November 2025 (UTC)
::::And thats the point I am having. Wikiversity is not paper repository. The only way is to publish it via WikiJournal, but they want it for Wikipedia usually. Why wikiversity should be a duplication of ResearchGate, Academia or Zenodo?
::::What I can read on [[Wikiversity:What is Wikiversity?]] policy is, that Wikiversity research &quot;...includes interpreting primary sources, forming ideas, or taking observations.&quot; The article doent look to fall into this. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:43, 22 November 2025 (UTC)
:::::Well, then how come you missed the term &quot;Learning Projects&quot;? As Jtneill had pointed out, this is a legitimate learning project. And also, I do have the VRT permission to host this article on Wikiversity.  [[ticket:2025100410001149]] . besides ResearchGate is an self-archiving platform. the document version in it is not accessibly to screen readers (usually disable people use them), Translators, and also for the mobile readers. therefore I do have valid reasons to publish this article on wikiversity. 
:::::# It is a learning project, therefore according to WIkiversity Policy, It qualifies. 
:::::# I have an explicit VRT permission to host this article on Wikiversity
:::::# Versions that are published in RG, Zenodo are documents, and they are not accessible by screen readers or mobile users. Therefore it is imperative that an article version of this paper exist on here. 
:::::Therefore this article qualifies to stay here on Wikiversity.  [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 11:22, 22 November 2025 (UTC)

'''Keep'''. This is a legitimate student learning project that may be of use to others. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:51, 22 November 2025 (UTC)
{{archive bottom}}

== [[Pragmatics/History]] ==
{{archive top|Deleted. Other related resources have been deleted. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:24, 17 May 2026 (UTC)}}
Another KYPark page and subpages with unclear organization scheme. Contains fairly many redlinked items. See also [[User:KYPark/Literature]], perhaps a similar concept. Unlikely to be really useful for others but KYPark. '''Move to user space'''.

As an alternative, moving to [[History of Pragmatics (KYPark)]] would make sense to me: the topic is identified using a natural-language phrase (instead of the relatively unnatural slash) and the responsible editor is indicated so that the reader knows whether to look or not. And for those who oppose the brackets (which I like): [[History of Pragmatics/KYPark]]. Or also: [[KYPark/History of Pragmatics]]. But then, searches in mainspace will see that content and the question is whether that is good. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:21, 15 October 2025 (UTC)

:What about to propose the user to write some guidelines, how other can participate instead of deleting it? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:03, 16 October 2025 (UTC)
:: I plan to move the pages to userspace as I proposed. If someone wants to ask KYPark to address the problems, they should feel free. There will be plenty of time for KYPark to address the problems while the material is in user space. After the problems are addressed, the material can be moved back to mainspace. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:38, 15 November 2025 (UTC)
:So I would '''delete''' it. In the blocked user space its useless. The user cannot improve it and Wikiversity is not free hosting service for personal pages. My believe is, that there should be just a few working pages in the users spaces. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:30, 11 March 2026 (UTC)

'''Move'''. Insufficient statement of learning objective or connection to related learning resources with insufficient current activity to stay in main space. The page was originally [[History of pragmatics]] but was moved by Dave B. Therefore, I suggest moving to [[User:KYPark/History of pragmatics]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:57, 22 November 2025 (UTC)
{{archive bottom}}

== [[IMHA Research Archives]] ==
I propose to '''move to userspace''', including the subpages. I struggle to understand how Wikiversity readers are supposed to benefit from the material here and in the subpages. In the log, there is e.g. '10 February 2019 Marshallsumter discuss contribs deleted page IMHA Research Archives (content was: &quot;{&lt;nowiki/&gt;{Delete|Author request}} Thanks! -&quot;)', so the page was deleted before, but not the subpages.

We could also delete all the material if we have strong enough suspicion too much of it is copyright violation. In any case, moving to user space improves the matter a little by moving the content away from Google search. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 13:38, 9 November 2025 (UTC)

:Looking at some sub-pages, they can be deleted e.g., because they only consist of broken links or are largely empty. I deleted a couple but haven't been through all to check. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:27, 10 November 2025 (UTC)
:{{ping|Saltrabook}} I'm wondering if you can respond here to help us decide about whether to delete the IMHA Research Archives sub-pages or perhaps move them to your user space? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:58, 17 May 2026 (UTC)

As an example, let me give the wikitext content of [[IMHA Research Archives/3. Scientific litterature search, storage and use]]:
&lt;pre&gt;
==[[/Medicina Maritima - the Spanish scientific maritime health journal/]]==

==[[/PubMed/]]==

==[[/Google and Google Scholar/]]==

==[[/Zotero/]]==

==[https://www.dropbox.com/sh/d91z7bcyelfvk42/AAAkIvjtBnnFMbiU9ZLOdVL9a/Andrioti_database%20sources0310.pptx?dl=0 Maritime health web portal ressources ]==
&lt;/pre&gt;
The wikilinks are red; the external link to dropbox says &quot;You don't have access&quot;. This was made in 2016. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 09:04, 11 November 2025 (UTC)

:I suggest delete -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 03:27, 12 November 2025 (UTC)
:: I think we should avoid deletion as much as possible, instead moving to user space (bar copyvio, ethics violation, etc.). This is a good general principle. It greatly improves auditability and makes it so much easier for anyone to request undeletion since they know what content they are requesting for undeletion. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 09:52, 12 November 2025 (UTC)
:::Do not recreate Wikiversity from the educational and research project to the personal blog. That will lead to the cancelation of it by WMF. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:44, 20 November 2025 (UTC)
:::: The English Wikiversity has a long tradition of moving problematic content to user space, as per evidence collected at [[User:Dan_Polansky/About Wikiversity#Moving pages to userspace]]. If Wikimedia Foundation finds this problematic, they can start a discussion in Colloquium and state their concerns. They do not need to make explicit threats at first; they can start a discussion and explain why it is problematic. They can even do it from an anonymous IP and provide a well-articulated reasoning. And anyone else can start a discussion in Colloquium to change this tradition. I do not see why we should not want to change that tradition based on well-articulated, compelling reasoning. I see no reason why Juandev should be making threats instead of them, on a per RFD basis. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:58, 21 November 2025 (UTC)
:::: If Juandev is ''sincere'' about deleting very-low-value items ''from user space'', he should perhaps demonstrate that by asking his pages like [[:cs:Uživatel:Juandev/Problémy/Kov/Repase dvířek elektroskříně]] to be deleted; otherwise, I register a ''glaring inconsistence''. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 07:43, 21 November 2025 (UTC)
::What was the original delate page about @[[User:Jtneill|Jtneill]]? I guess that would be crucial for the decission. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 21:48, 20 November 2025 (UTC)
:::@[[User:Juandev|Juandev]] the couple of pages I checked and deleted were much like @[[User:Dan Polansky|Dan Polansky]] posted above i.e., headings with empty sections and/or broken links but no substantive content. But I think each sub-page needs checking. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 21:59, 20 November 2025 (UTC)
::::So I'm saying that the main page usually determines what the other pages are for. But if I don't know the page because it's been deleted, or why was deleted (deletion based on the founder's request is probably not the rule), it's hard to judge. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 22:16, 20 November 2025 (UTC)
:::::I've pasted the original content of the root page: [[IMHA Research Archives#Original page]] (i.e., prior to the content being removed and deletion requested) to help understand the context for the sub-pages. In 2018, Saltrabook blanked the page, indicating that the content had been moved elsewhere, and requested page deletion. Marshallsumter then deleted the main page but not the sub-pages. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 01:58, 21 November 2025 (UTC)
::::::I see, so if those subpages are usefull I would keept them, if not I would delete them. I dont see a point of providing free hosting to sombody, by moving many pages to their user space. The question is if we want to host (i.e. to have in the main ns) lists of links elsewhere. I have no opinion on that. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 10:11, 22 November 2025 (UTC)

: Let me clarify that while many of the subpages are like the example above, [[IMHA Research Archives/Scientific litterature search, storage and use/Zotero]] is different:
:: &quot;A continuous critical and evidence based learning is a core issue in clinical practice, research, teaching, publication and prevention activities. The Zotero Program is just one of many scientific literature management programs, that should be used for these purposes. Of course one can live without such a database but it helps a lot and can save a lot of time that could be used for more interesting issues. Not only that, but it helps to create better publications and knowledge. Without this program it can be very time consuming to publish a scientific article with the requested style for the references. Further in daily practice when you want to collect and cite a few references for a specific evidence in a clinical colloquium and discussion, this program is excellent. Therefore we strongly recommend that all maritime health persons learn how to use this excellent tool in their daily maritime health practice of all different types. There are good online courses for self-instruction on how to use Zotero. For example this one: Zotero fast online course But in order to increase IMHAR´s collective scientific strength in the use of EBM we would like to give training sessions in every possible opportunity, IMHA Symposia, seminars and other types of meetings. The database is useful for personal purposes but especially also for collaborative aims. At the IMHAR meeting in Paris Oct 7th 2016 we will give an introduction to the program by showing how it can be used in the daily practice and discuss strength and weaknesses compared to other similar databases.&quot;
: Even longer is e.g. [[IMHA Research Archives/Scientific litterature search, storage and use/Medicina Maritima - the Spanish scientific maritime health journal]].
: However, that does not mean these should be salvaged. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 07:53, 21 November 2025 (UTC)

== [[Palliative medicine]] ==
{{archive top|'''Kept'''. Page has been improved. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:38, 17 May 2026 (UTC)}}

Underdeveloped and has not been improved on since 2007. Author inactive. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 21:42, 14 December 2025 (UTC)

:Delete, per nominator [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:16, 22 January 2026 (UTC)
:Yes, I would also expect there to be more and especially that someone would write how to use it. However, it still seems to me to be a useful thing in the sense of a syllabus, so that someone who is interested in the topic knows what information to obtain in order to get a complete picture of the topic. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:55, 16 March 2026 (UTC)
{{archive bottom}}

== [[Canadian Wilderness]] ==
{{archive top|Deleted per nom. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:07, 17 May 2026 (UTC)}}
This page doesn't seem to belong to wikiversity. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 09:55, 6 February 2026 (UTC)

:In principle there could be some material useful here but in practice, I don't see what this page is adding as an educational resource. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 12:54, 6 February 2026 (UTC)
:I can see this being a useful resource to a bigger project. Maybe we could move it to the &quot;[[Wikiversity:Drafts|Draft]]&quot; namespace vs. deleting it? —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 13:28, 6 February 2026 (UTC)
::Does anyone plan to work on it? [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 01:59, 8 February 2026 (UTC)
:::Next week the page has it's 17th birthday. Ever now and than someone added to it. With a lot of work it could be a nice encyclopedic article but making it educational .... Merging it may take more work than rewriting it. Move to Draft might be the best option. [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 08:58, 12 February 2026 (UTC)
{{archive bottom}}

== [[LQR Control for an Inverted Pendulum]] ==
{{archive top|'''Deleted''' per nom. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:36, 17 May 2026 (UTC)}}
Underdeveloped resource, has not been edited for more than a decade. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 08:03, 16 March 2026 (UTC)

:Looks like a test, '''delete'''. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:30, 27 March 2026 (UTC)
{{archive bottom}}

== False flag &quot;authority hack&quot; user page deletion ==
{{archive top|'''Not undeleted''', the requester dropped the request. See Wikiversity:Requests for Deletion v. 2803217.--[[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:36, 10 May 2026 (UTC)}}
'''Undeletion requested'''

Hi, Juandev marked my user page as &quot;spam&quot; and &quot;authority hack&quot;, and deleted it. 

First, I asked him for help with &quot;time limit for new users&quot;, and he replied - I should admit I dont know, what is &quot;new user limit&quot;, but if filter blocks your page because of certain external link, you may force to save anyway and sometimes it works. It should not work, when the website is blacklisted. As of now, I am not seeing you to save page in main namespace, so try to save it without external links first. 

Then he wrote me another message: Well, I have analyzed your contribution to Wikiversity and I should point out here, that this project is not a place for advertising, so there is no way of promoting your books and authority this way. - probably referring to the intro of my About me page where I present me and my work. 

Before I could explain him the difference between the neutral information and advertising and promotion, he deleted my user page. 

Here is my answer I posted to the discussion today: 

: Hi, my About Me page is just an info page with the neutral as possible presentation of my work.
:
: There is a big difference between informing and advertising. Informing is neutrally stating that something exists and requiring no action, while advertising is a special communication form with intent to cause certain action from readers. For example, click here, click there, order this, buy that.
:
: There is no such intention, form, or terms on my info page. Just neutral information. I don't hide and I am not ashamed that I am write and author, and that is a part of the usual bio, including works. I checked your user page: &quot;I graduated from the Czech University of Life Sciences in Prague and studied information science at the Faculty of Arts of Charles University.&quot; I think that if you had written a book on Life Science, you would have mentioned that as well.
:
: Most of the Info page is about my research and AIPA Method which is a valid contribution to psychology, consciousness studies, identity theory, and personality development. Actually, my paper '''AIPA Method: A Cognitive-Phenomenological Model for Identity Reconstruction and Stabilization in Pure Awareness''' is now in the peer review procedure at Journal of Consciousness Studies.
:
: Here is a part from the Wikiversity AIPA Method page in creation (waiting for the end of the time limit for new users):

: == Introduction ==
: The AIPA Method addresses a gap in contemporary personal development and consciousness science: most evidence‑based approaches (CBT, MBSR, MBCT, standard meditation) operate at the level of mental content—reframing thoughts, observing them, or reducing their impact—rather than at the level of identity structure. In contrast, AIPA targets the structural relationship between the self and the mind, aiming at durable identity reconstruction rooted in Pure Awareness rather than symptom management.
:
: The central research question of the primary AIPA preprint is whether a structured, sequentially staged method can produce permanent identity reconstruction rooted in Pure Awareness, and how such a method compares to established approaches in scope, mechanism, and outcome.
:
: == Theoretical foundations ==
: The AIPA framework is grounded in the cognitive‑phenomenological tradition (e.g., McAdams, Varela, Metzinger, Erikson), contemporary consciousness science on minimal phenomenal experience, and qualitative methods advocacy in psychology. It builds directly on:
:* Empirical work on pure awareness and Minimal Phenomenal Experience (MPE), especially Gamma &amp; Metzinger’s large‑scale study of content‑reduced awareness states.
:* Metzinger’s proposal of minimal phenomenal experience as an entry point for a minimal unifying model of consciousness.
:* Narrative identity and partial‑self models within personality and identity theory.
: Within this backdrop, AIPA proposes Pure Awareness as a distinct, operationally specified state that can become a structural ground of identity rather than a transient meditative experience.
:
: == Experiential empiricism ==
: The empirical foundation of the AIPA Method is explicitly first‑person and experiential, combining:
:* A 22‑year longitudinal autoethnographic self‑study (2003–2025) documenting partial personality episodes, protocol use, and outcomes.
:* A 13‑year prospective verification period with zero self‑reported recurrence of targeted harmful behaviors after a dated stabilization point (1 January 2006).
:* A high‑ecological‑validity “stress test” during acute bereavement, used to examine whether non‑reactive awareness remains stable under maximal provocation.
:* Two independent practitioner cases (an Amazon‑verified report and a structured questionnaire case) providing preliminary convergent signals across cognitive, emotional, behavioral, and identity dimensions.
:
: All central constructs (Pure Awareness, partial personalities, the Switch, identity stabilization) are operationalized with explicit phenomenological and behavioral criteria intended to enable replication and future third‑person measurement.
:
: I believe this is a valid contribution to Wikiversity.
:
: Best regards, Senad [[User:Senad Dizdarević|Senad Dizdarević]]


I suggest you check the deleted user page, and see for yourself if it is &quot;spam&quot; and &quot;authority hack&quot;, or a legit author's page with one paragraph short presentation, while the rest of the page is about my research project. 

Thank you for undeleting my user page, so I can use it. 

Best regards, 

Senad Dizdarević [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:26, 2 April 2026 (UTC)

:Hi Senad,
:Welcome to Wikiversity.
:It looks like you tried adding similar content to Wikipedia and ran into similar difficulties over there ([[w:User talk:Senad Dizdarević]])? Perhaps that is what has led to you Wikiversity?
:Basically, if you'd like to collaborate and help build open educational resources, feel free to contribute to Wikiversity. But if the primary motivation is to promote your autobiographical work you're probably going to run into challenges.
:Sincerely,
:James
:-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:11, 3 April 2026 (UTC)
::James, Hi, and thank you for your answer. 
::Yes, in 2025, I created the autobiographic page on Wikipedia, which was removed because of the links to my books on Amazon. To admin, I explained that I did not know the rules, and agreed that page is removed. Now I know that somebody else must write a Wikipedia page for you. 
::On the deleted user page on Wikiversity, there were no links to Amazon or any other form of promotion, just neutral as possible basic presentation of my writing (one sentence) and current project (the rest of the page). 
::I created Wikiversity page to present my AIPA Method project, to invite researchers to read it, give their opinion, and conduct empirical researches in their institutions. Now, it is in a theoretical phase, and needs more empirical testing. 
::Best regards, 
::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:03, 3 April 2026 (UTC)
:::It looks to me like the primary motivation for contributing to Wikiversity is to drive traffic / search engine ranking to your website?
:::* [[User:Senad Dizdarević]]
:::* [[AIPA Method]]
:::-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 01:36, 4 April 2026 (UTC)
::::No, it is not. There is no link to my website, so &quot;driving traffic to my website&quot; is not possible. 
::::For your educational purposes: 
::::Copilot &quot;AI:  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:38, 4 April 2026 (UTC)
:::::So do you still insist of undeleting your former version of your userpage if you have created the new one? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:15, 6 April 2026 (UTC)
::::::No, because in the moment of undeletition, somebody could delete it again, and so on. Thank you for not deleting my new user page, as it is made in your user page image.  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 08:59, 6 April 2026 (UTC)

{{archive bottom}}

== Undeletion request ==

It was deleted by an admin without discussion and with untrue rationale. If people take offense with the question that doesn't mean it's not a valid question and the page was good. Please undelete the Wikidebate page [https://web.archive.org/web/20250810030352/https://en.wikiversity.org/wiki/Is_it_likely_that_Earth_has_been_visited_by_aliens_millions_of_years_ago%3F Is it likely that Earth has been visited by aliens millions of years ago?]

There are lots of sources on the subject, the wikidebate is sourced very well compared to other wikidebates and wikiversity pages, and the page is educational, useful and of good quality. [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 23:57, 10 April 2026 (UTC)

:Page: [[Is it likely that Earth has been visited by aliens millions of years ago?]]
:Ping: [[User:Atcovi|Atcovi]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:21, 11 April 2026 (UTC)
:There is no need for a discussion for straight garbage-level, pseudoscientific content.
:For '''Is it likely that Earth has been visited by aliens millions of years ago?''', the flaws for this page wouldn't even take someone more than a few minutes to assess:
:* Essentially, the &quot;pro&quot; arguments unproven claims being derived from irrelevant, established facts (basically: &quot;it is likely aliens have came because Earth has existed for so long [sources proving Earth's longevity]&quot;). These are not serious, scientifically-backed arguments - these are non sequiturs. It's as if I said Wikipedia has existed longer than my existence on Earth ([https://d1wqtxts1xzle7.cloudfront.net/74351725/eyJoIjogImZiODhmYzNkODU1N2UxMWExYzUyODJiYzgzZTRmZDM4OTBjODY5YWMzMjA3NDNmOWEyZTA0ZTU3ZGYwZjAyYTkiLCAidSI6ICJodHRwczovL3B1cmUuaHZhLm5sL3dz-libre.pdf?1636354596=&amp;response-content-disposition=inline%3B+filename%3DCritical_Point_of_View_A_Wikipedia_Reade.pdf&amp;Expires=1775872055&amp;Signature=GqbUZboYRvUYWi~aW40LT5eZSHrLuDL3o0-DxAH8vSvcJcGAuyByZWLF2oHTY6GlB72TqvZxpE-v9d4gvsA6myriYqO~QQQZgWxjT2JXjUWC-yiPcTF4l~lroJSi4dY0v9eKiBcU03l-aeUdrX8~UPfi0TfW0IhsmzH-VBR6X6FrzRpIqc6uM6n9YXfr5FRB3aCqqokU690af3n0Hguaub1Zgmh9qjYYqzBS0VOOHjKTTEQnDuadX3jl5CQeXYTaeCC3H0hMeVwHlratbrnuFEKC1aN0-5znCUoSzMEg21ECzGPTrSDM1W05dcK-u0ZTCeUGKAuC-2yRFL3sY46MIw__&amp;Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA#page=157 reputable source proving ''this'' fact]), therefore it's likely that my birth took place solely for the sake of me experiencing Wikipedia (0 backing). It makes no sense and no person with at least a high school-level of intelligence would take this seriously. 
:* What is worse is that the user is being misleading with their &quot;[the page is] sourced very well&quot; claim. The sources ''themselves'' don't even back up the claims. It's just used as proof for an established concept, where the user then uses this established concept to jump to an unsupported, laughable conclusion that is pulled out of thin air. It's utterly ridiculous to even consider such a page for mainspace since it clearly violates our [[Wikiversity:Verifiability]] policy. This is, once again, pseudoscientific content that has caused our website to reduce in quality over the last few years. 
:* Going source by source, we can see that:
:#[https://web.archive.org/web/20250918011642/https://timesofindia.indiatimes.com/blogs/thebigd/compress-earths-history-into-24-hrs-humans-came-at-1158-pm-yet-killed-70-of-wildlife/ ‘Compress Earth’s history into 24 hrs. Humans came at 11:58 pm, yet killed 70% of wildlife’] is literally just a blog post which doesn't even mention aliens or extraterrestrial life. It just talks about Earth's history in accordance with the 24-hour metric of time, and the author tries to use this article as a 'piece in the puzzle' of aliens &quot;possibly&quot; visiting Earth... which, once again, is unsupported and is not backed up anywhere in the article.
:#[https://web.archive.org/web/20250808053249/https://news.cornell.edu/stories/2023/11/jurassic-worlds-might-be-easier-spot-modern-earth The Cornell article does not even remotely support the idea that &quot;aliens visited Earth&quot;]. It mentions a ''chance'' of &quot;life there [a habitable exoplanet] might not be limited to microbes, but could include creatures as large and varied as the megalosauruses or microraptors that once roamed Earth.&quot;, but again, no justification to take this article as proof that &quot;aliens may have visited us!&quot;. There's no mention of aliens visiting Earth anywhere in the article. Once again this is only proving the background premise, but not the unsupported, nonsensical &quot;alien likelihood&quot; argument that the author of this garbage page is trying to push so desperately.
:#The Parker Solar Probe WP article does not even mention aliens either. It follows the same issues as the previous argument.
:And the other page this user complained about [https://en.wikiversity.org/wiki/User_talk:Atcovi#Deletion_of_educational_page_because_of_personal_opinion on my talk page] holds almost similar, maybe even more fatal mistakes, than this one. It has nothing to do with &quot;taking offense&quot;, this is just low-quality, garbage content. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 00:56, 11 April 2026 (UTC)
::Why do you think pro claims are required to be proven? It's possible to object to them and these are arguments, not contextualized to be statements of proven facts. And it's not a strange or unreasonable argument to make that since Earth has existed for long, it's more likely that aliens have come here in the past than in recent times or the near future. Instead of insulting others' intelligence, maybe engage with the actual reasoning rather than censoring it away. And there are lots of sources, such as [https://interestingengineering.com/science/alien-civilizations-may-have-visited-earth-millions-of-years-ago-study-says Alien Civilizations May Have Visited Earth Millions of Years Ago, Study Says] etc etc. The sources are used for the arguments themselves individually. [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 12:30, 11 April 2026 (UTC)
:::Because, once again, this is not a site that caters to rampant debating for the sake of &quot;we need to employ rationality and logic to solve the world's problems&quot;, we have policies that we need to fulfill. The claims made in the pro argument clearly do not meet [[Wikiversity:Verifiability]], since you cannot verify these arguments with the sources because they are not relevant. 
:::''&quot;And it's not a strange or unreasonable argument to make that since Earth has existed for long, it's more likely that aliens have come here in the past than in recent times or the near future.&quot;'' The point being is that these arguments are not supported by the sources. Even the article you mention poses the idea as a hypothetical model. This is just you twisting the article to fit your unsupported narrative. I'll bring direct quotes for you to show why the linked article does not help you:
:::* ''One problem the researchers do make sure to point out is that '''they are working with only one data point: our own behaviors and capabilities for space exploration'''. “We tried to come up with a model that would involve the fewest assumptions about sociology that we could,” Carroll-Nellenback told Business Insider. '''We have no real way of knowing the motivations of an alien civilization'''.'' --&gt; proves that this is just speculation and no evidence-based arguments have been provided for the idea that aliens likely visited Earth.
:::And I'm not sure if you read my entire response, but I ''did'' engage with your &quot;actual reasoning&quot; and exposed its weaknesses and lack of adherence to Wikiversity policies. If we allowed content that was just filled with non sequiturs we would have content that fails Wikiversity's educational objectives and reduces the overall quality of this website, hence why such a harsh stance needs to be taken. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 13:50, 11 April 2026 (UTC)
::::Thanks for proving that the Wikimedia ecosystem is unfit to deliberate on controversial topics. The question is entirely valid and the content is far better sourced than nearly all Wikidebates and has no genuine flaws. The only possible issue with it as far as I can see is that now that Wikidebates has been paused people can't add objections if they do have sth specific to say about the topic that's not already included on that page which already had plenty of Cons and objections.
::::The page was more educational than most of Wikiversity and it was well-sourced – wikidebates was for arguments so people were invited to make arguments based on sourced things or outlined logic and the page met [[WV:V]] and most pages on Wikiversity aren't sourced as good. Doesn't look like people can see beyond their biases and personal views here but that's more evident in the marginalization and deletion of wikidebates and the low activity in that project than these selective deletions. A constructive thing to do would be to add reasoned Cons and objections not yet on the page and people had plenty of time to do that. There are and will be other sites for free constructive rational adversarial deliberation (not a big loss in that sense). [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 16:31, 22 April 2026 (UTC)
:::::Thank you for failing to address any of my arguments and going on an unrelated, nonsensical tangent that has nothing to do with the discussion. Once you start producing work that aligns with Wikiversity's content policies instead of typing up laughable, pseudoscientific garbage, then maybe your work can be accepted and not removed. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 16:59, 22 April 2026 (UTC)
::::::I suggest you stop ridiculing things and learn respectfully forming genuine points about the subject at hand. {{tq|the idea as a hypothetical model}} but please learn first about what arguments are and why they're not the same as a statement of objective proven fact. [[User:Prototyperspective|Prototyperspective]] ([[User talk:Prototyperspective|discuss]] • [[Special:Contributions/Prototyperspective|contribs]]) 17:18, 22 April 2026 (UTC)

==Pages by Harold Foppele==
[[User:Harold Foppele]] is locally blocked indefinitely and globally banned for sockpuppetry. There were also WMF and local community concerns expressed about copyright violation and AI (over)use. As a result, I think the Wikiversity pages created by this account warrant review with regard what should be deleted, what should be retained etc.:
* [[Completing the square]]
* [[Number of independent spatial modes in a spherical volume]]
* [[Quantum]]
** [[Quantum/Andrew N. Jordan]]
* [[Quantum A Matter Of Size]]
* [[Quantum A Spooky Action at a Distance]]
* [[Quantum: A Walk Through the Universe]]
* [[Quantum Computing Algorithms in the NISQ Era]]
* [[Quantum Formulas Collection]]
* [[Quantum harmonic oscillator]]
* [[Quantum Matter Elements and Particles]]
* [[Quantum mechanics]]
** [[Quantum mechanics/Timeline]]
* [[Quantum mechanics learning module]]
* [[Quantum mechanics measurements]]
* [[Quantum Noisy Qubits]]
* [[Quantum optics beam splitter experiments]]
* [[Quantum: The Secret of Cohesion: How Waves Hold Matter Together]]
* [[Quantum Ultra fast lasers]]
* [[Speed of sound experiments]]
* [[User:Harold Foppele]]
-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 08:12, 17 May 2026 (UTC)

:'''Delete all''' Not worth keeping. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 08:27, 17 May 2026 (UTC)</text>
      <sha1>pxa3oe49na1v9efputkmxyhxyj24qlo</sha1>
    </revision>
  </page>
  <page>
    <title>Media information cognition</title>
    <ns>0</ns>
    <id>3965</id>
    <revision>
      <id>2809844</id>
      <parentid>2197268</parentid>
      <timestamp>2026-05-17T03:59:49Z</timestamp>
      <contributor>
        <username>HenriPittier</username>
        <id>3076895</id>
      </contributor>
      <origin>2809844</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="9980" sha1="6cvn3jh0fvodczxq95uwne3b5ut1qp1" xml:space="preserve">[[Image:Wikiversity-banner.jpg|thumb|right|450px]]
The Magic School Bus of Media Information &amp; Cognition explores the boundaries and crossing of boundaries between Information, the vehicles that transmit it - Media, and the faculties by which we absorb, digest, or reject it.

== Department of Memes ==
== Department of Structure &amp; System ==
== Department of Referentiality and Organization ==
Increasing International Online Communication Efficacy
From Wikiversity
Jump to: navigation, search

Online communications via text e-mail and instant messaging can bring a sense of anonymity to the people engaged in the communication. This perception is not necessarily borne out during the exchange as there are many clues to a persons background and status to be found in their spelling, their choice of individual words, their grammar and their prosaic style. Fortunately, there are some online tools that are readily available to help level the communication playing field.

Contents
[hide]

    * 1 Languages- Common Tongues and Specialized Vocabularies  
    * 2 Stereotype Threat Concerns
    * 3 The Usefulness of Embedded Dictionaries and Web Page Dictionary Resources
    * 4 The Usefulness of Web Based Thesauruses
    * 5 Using The Open Source Dictionary and Wordnick
    * 6 Using Specialized Scientific Vocabulary
    * 7 Using Google Translator
    * 8 Places for Teachers to use These Communication Tools
    * 9 References

    
Languages- Common Tongues and Specialized Vocabularies: [edit]

Because I reside in America, I am used to using English as my common tongue. Personally I recognize that English is not homogeneous in its usage across the world. It is also not homogeneous in America nor in my region of the southwestern portion of the country and not in my state of California and not in my city of San Diego. None the less, I can discern things in my own communication which may give anyone communicating with me a clue as to who and where I am just by my use of this common tongue.Because I use a relatively refined vocabulary and write with a fair amount of clarity, someone communicating with me would find it easy to assume that I am well educated. If my communication is of a formal business nature they may have a hard time gaining more insight into anything more about me including my nationality, my race, and even my gender. If I am using a user name online it can hide or reveal things about me depending on how I craft it. I am comfortable in my communication abilities and I also feel that I am a fair judge of other people's communication skill. In addition to common speech forms I also have some knowledge of several specialized vocabularies. My background in general science and biology allow me to understand and exchange information in these subject areas that would be less comprehensible to others who have little background in these areas. I also have some background with several foreign languages but I do not have enough mastery over them to feel comfortable on my own with any extensive communications with anyone who is fluent in those languages.


Stereo Type Threat Concerns:

A stereotype threat is faced by someone when anything they do or say makes someone else and perhaps even themselves be likely to characterize them as being a typical example of the stereotype.When the stereotype is a negative one, it can be self threatening enough that it can be disruptive to the efforts of the effected person just by the existence of this threat alone. African American students have historically labored under this condition. &quot;Whenever they perform an explicitly scholastic or intellectual task, they face the threat of confirming being judged by a negative societal stereotype- a suspicion- about their race's intellectual ability and competence.&quot; (Stereotype Threat and the Intellectual Test Performance of African Americans, Steele &amp; Aronson 1995). In regards to online communications, this threat can have a dampening effect upon the participation of African Americans and other potential groups who would be negatively stereotyped. Even though written communications via e-mail or instant text messages should carry some anonymity, the threat could stop their participation before they even begin. Hopefully if they know that there resources available in real time for them to use while communicating online, they will be less likely to fall prey to the stereotype threat.


The Usefulness of Embedded Dictionaries and Web Page Dictionary Resources

To be honest, my spelling is atrocious (ha ha I actually spelled that right the first time by some miracle). I tend to be phonetic when I attempt to write out the words I am thinking about. I am quite grateful for embedded dictionaries in most text programs that are on the computer and in email and other online communication programs. I also have an online dictionary bookmarked and in those times when I am using a simple text program without an embedded dictionary or those times when I need to hand write something, my browser is usually opened to the online dictionary for quick reference. My dictionary of choice for this is: http://www.merriam-webster.com They have a nice search bar that works with those of us who can get close to the spelling but not hit the mark and they have an alphabetized listing for those who are further from getting the right spelling.


The Usefulness of Web Based Thesauruses

So after you have the spelling of the word you want to use and you successfully use it in your communications, you may find that you are worried about being redundant. A good thing repeated the same way can be too much of a good thing. This is where the online thesaurus comes in handy. For example, if I am talking about a boat, I don't want to sink my link by using that appellation over and over, so I click on the tab I have open to: http://thesaurus.reference.com. I type in boat in their search bar and here is what I get;

'''&quot;Main Entry: 	boat'''
'''Part of Speech: 	noun'''
'''Definition: 	vehicle for water travel'''
'''Synonyms:'''
'''	ark, barge, bark, bateau, bottom, bucket, canoe, catamaran, craft, dinghy, dory, gondola, hulk, ketch, launch, lifeboat, pinnace, raft, sailboat, schooner, scow, ship, skiff, sloop, steamboat, tub, yacht'''
'''Notes: 	a boat is a vessel that can be hauled aboard a ship, according to the Navy, with a ship being somewhat larger.&quot;'''

This information gives me lots of ways to call a boat by any other name, though it will not necessarily be as sweet. It keeps you afloat on the sea of communication and not foundering on the rocks of redundancy.


Using The Open Source Dictionary and Wordnick

This is all well and good if someone is just needing to communicate one way. But when an online exchange is more instantaneous, you may need an additional resource or two at your disposal. Fortunately you can have multiple tabs and full browser pages open on most modern computers. If someone you were communicating with was to throw the term &quot;carbolicious&quot; at you, you might have nary a clue as to it's meaning and your online dictionary may not have it either. there are several places though where this term may be found. One is: http://www3.merriam-webster.com/opendictionary They have alphabetized listings and a search bar as well so just type in the term in the search bar and you have improved your chances of knowing what the other person is talking about. Another good site for this type of communication impediment is: http://www.wordnik.com They also have listings of unusual words and phrases. If neither the traditional resources or these alternate resources have this information the I suggest calling out your online communication partner by asking did you just make that up or something?


Using Specialized Scientific Vocabulary

I advise caution when you encounter the need to use specialized vocabulary or encounter it being used by someone else. Scientific vocabulary can be especially tricky. Terms such as carrying capacity have nothing to do with weight in the scientific discipline of Ecology. The term is used when describing what amount of a certain type of living organism a particular ecosystem can sustain. It would be difficult to anticipate all the potentials for miscommunication with specialized vocabularies and just smarter to admit that you do not know everything  instead.


Using Google Translator

Venturing you online communications into the realm of internationalism can be daunting. Not only do you not share a language with many of the people across the world, you also may lack an understanding of their cultural norms. The way to go when you encounter someone from a foreign country online who does not speak your language is to proceed cautiously and respectfully. It is not generally too hard to establish names and country affiliations but after that you may be at a loss as to how to proceed. If the other person speaks and writes in one of a few of the most common languages, I suggest using: http://translate.google.com This is not a perfect translator so expect that there may be snags to your communication, but overall it is a good way to have conversations longer than the equivalent of &quot;Me Tarzan, You Jane&quot;.


Places for Teachers to use These Communication Tools

I have found several teacher's resource web sites that have chat enabled that could be a good place to try out theese tools. they are: http://teachers.net/mentors and: http://www.theteacherscorner.net/forums
Good luck with the chatting and be careful of those specialized vocabularies and foreign tongues.   
[edit]

[Press edit (above) to contribute here]

References

&quot;Stereotype Threat and the Intellectual Test Performance of African Americans&quot; in the Journal of Personality and Psychology, 1995. Vol. 69, No. 5 by: Claude M. Steele &amp; Joshua Aronson

&quot;The Language of Science, The Language of Students&quot; Heldref Publications 2005 by: Edyth Young

== Department of Physical Constraints ==</text>
      <sha1>6cvn3jh0fvodczxq95uwne3b5ut1qp1</sha1>
    </revision>
    <revision>
      <id>2809856</id>
      <parentid>2809844</parentid>
      <timestamp>2026-05-17T04:30:27Z</timestamp>
      <contributor>
        <username>NguoiDungKhongDinhDanh</username>
        <id>2922842</id>
      </contributor>
      <minor />
      <comment>Reverted edit by [[Special:Contributions/HenriPittier|HenriPittier]] ([[User_talk:HenriPittier|talk]]) to last version by [[User:ShakespeareFan00|ShakespeareFan00]] using [[Wikiversity:Rollback|rollback]]</comment>
      <origin>2197268</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="9970" sha1="izpgylwakvrqt8q2xf1i2dauulwvatm" xml:space="preserve">[[Image:Wikiversity-banner.jpg|thumb|right|450px]]
The School of Media Information &amp; Cognition explores the boundaries and crossing of boundaries between Information, the vehicles that transmit it - Media, and the faculties by which we absorb, digest, or reject it.

== Department of Memes ==
== Department of Structure &amp; System ==
== Department of Referentiality and Organization ==
Increasing International Online Communication Efficacy
From Wikiversity
Jump to: navigation, search

Online communications via text e-mail and instant messaging can bring a sense of anonymity to the people engaged in the communication. This perception is not necessarily borne out during the exchange as there are many clues to a persons background and status to be found in their spelling, their choice of individual words, their grammar and their prosaic style. Fortunately, there are some online tools that are readily available to help level the communication playing field.

Contents
[hide]

    * 1 Languages- Common Tongues and Specialized Vocabularies  
    * 2 Stereotype Threat Concerns
    * 3 The Usefulness of Embedded Dictionaries and Web Page Dictionary Resources
    * 4 The Usefulness of Web Based Thesauruses
    * 5 Using The Open Source Dictionary and Wordnick
    * 6 Using Specialized Scientific Vocabulary
    * 7 Using Google Translator
    * 8 Places for Teachers to use These Communication Tools
    * 9 References

    
Languages- Common Tongues and Specialized Vocabularies: [edit]

Because I reside in America, I am used to using English as my common tongue. Personally I recognize that English is not homogeneous in its usage across the world. It is also not homogeneous in America nor in my region of the southwestern portion of the country and not in my state of California and not in my city of San Diego. None the less, I can discern things in my own communication which may give anyone communicating with me a clue as to who and where I am just by my use of this common tongue.Because I use a relatively refined vocabulary and write with a fair amount of clarity, someone communicating with me would find it easy to assume that I am well educated. If my communication is of a formal business nature they may have a hard time gaining more insight into anything more about me including my nationality, my race, and even my gender. If I am using a user name online it can hide or reveal things about me depending on how I craft it. I am comfortable in my communication abilities and I also feel that I am a fair judge of other people's communication skill. In addition to common speech forms I also have some knowledge of several specialized vocabularies. My background in general science and biology allow me to understand and exchange information in these subject areas that would be less comprehensible to others who have little background in these areas. I also have some background with several foreign languages but I do not have enough mastery over them to feel comfortable on my own with any extensive communications with anyone who is fluent in those languages.


Stereo Type Threat Concerns:

A stereotype threat is faced by someone when anything they do or say makes someone else and perhaps even themselves be likely to characterize them as being a typical example of the stereotype.When the stereotype is a negative one, it can be self threatening enough that it can be disruptive to the efforts of the effected person just by the existence of this threat alone. African American students have historically labored under this condition. &quot;Whenever they perform an explicitly scholastic or intellectual task, they face the threat of confirming being judged by a negative societal stereotype- a suspicion- about their race's intellectual ability and competence.&quot; (Stereotype Threat and the Intellectual Test Performance of African Americans, Steele &amp; Aronson 1995). In regards to online communications, this threat can have a dampening effect upon the participation of African Americans and other potential groups who would be negatively stereotyped. Even though written communications via e-mail or instant text messages should carry some anonymity, the threat could stop their participation before they even begin. Hopefully if they know that there resources available in real time for them to use while communicating online, they will be less likely to fall prey to the stereotype threat.


The Usefulness of Embedded Dictionaries and Web Page Dictionary Resources

To be honest, my spelling is atrocious (ha ha I actually spelled that right the first time by some miracle). I tend to be phonetic when I attempt to write out the words I am thinking about. I am quite grateful for embedded dictionaries in most text programs that are on the computer and in email and other online communication programs. I also have an online dictionary bookmarked and in those times when I am using a simple text program without an embedded dictionary or those times when I need to hand write something, my browser is usually opened to the online dictionary for quick reference. My dictionary of choice for this is: http://www.merriam-webster.com They have a nice search bar that works with those of us who can get close to the spelling but not hit the mark and they have an alphabetized listing for those who are further from getting the right spelling.


The Usefulness of Web Based Thesauruses

So after you have the spelling of the word you want to use and you successfully use it in your communications, you may find that you are worried about being redundant. A good thing repeated the same way can be too much of a good thing. This is where the online thesaurus comes in handy. For example, if I am talking about a boat, I don't want to sink my link by using that appellation over and over, so I click on the tab I have open to: http://thesaurus.reference.com. I type in boat in their search bar and here is what I get;

'''&quot;Main Entry: 	boat'''
'''Part of Speech: 	noun'''
'''Definition: 	vehicle for water travel'''
'''Synonyms:'''
'''	ark, barge, bark, bateau, bottom, bucket, canoe, catamaran, craft, dinghy, dory, gondola, hulk, ketch, launch, lifeboat, pinnace, raft, sailboat, schooner, scow, ship, skiff, sloop, steamboat, tub, yacht'''
'''Notes: 	a boat is a vessel that can be hauled aboard a ship, according to the Navy, with a ship being somewhat larger.&quot;'''

This information gives me lots of ways to call a boat by any other name, though it will not necessarily be as sweet. It keeps you afloat on the sea of communication and not foundering on the rocks of redundancy.


Using The Open Source Dictionary and Wordnick

This is all well and good if someone is just needing to communicate one way. But when an online exchange is more instantaneous, you may need an additional resource or two at your disposal. Fortunately you can have multiple tabs and full browser pages open on most modern computers. If someone you were communicating with was to throw the term &quot;carbolicious&quot; at you, you might have nary a clue as to it's meaning and your online dictionary may not have it either. there are several places though where this term may be found. One is: http://www3.merriam-webster.com/opendictionary They have alphabetized listings and a search bar as well so just type in the term in the search bar and you have improved your chances of knowing what the other person is talking about. Another good site for this type of communication impediment is: http://www.wordnik.com They also have listings of unusual words and phrases. If neither the traditional resources or these alternate resources have this information the I suggest calling out your online communication partner by asking did you just make that up or something?


Using Specialized Scientific Vocabulary

I advise caution when you encounter the need to use specialized vocabulary or encounter it being used by someone else. Scientific vocabulary can be especially tricky. Terms such as carrying capacity have nothing to do with weight in the scientific discipline of Ecology. The term is used when describing what amount of a certain type of living organism a particular ecosystem can sustain. It would be difficult to anticipate all the potentials for miscommunication with specialized vocabularies and just smarter to admit that you do not know everything  instead.


Using Google Translator

Venturing you online communications into the realm of internationalism can be daunting. Not only do you not share a language with many of the people across the world, you also may lack an understanding of their cultural norms. The way to go when you encounter someone from a foreign country online who does not speak your language is to proceed cautiously and respectfully. It is not generally too hard to establish names and country affiliations but after that you may be at a loss as to how to proceed. If the other person speaks and writes in one of a few of the most common languages, I suggest using: http://translate.google.com This is not a perfect translator so expect that there may be snags to your communication, but overall it is a good way to have conversations longer than the equivalent of &quot;Me Tarzan, You Jane&quot;.


Places for Teachers to use These Communication Tools

I have found several teacher's resource web sites that have chat enabled that could be a good place to try out theese tools. they are: http://teachers.net/mentors and: http://www.theteacherscorner.net/forums
Good luck with the chatting and be careful of those specialized vocabularies and foreign tongues.   
[edit]

[Press edit (above) to contribute here]

References

&quot;Stereotype Threat and the Intellectual Test Performance of African Americans&quot; in the Journal of Personality and Psychology, 1995. Vol. 69, No. 5 by: Claude M. Steele &amp; Joshua Aronson

&quot;The Language of Science, The Language of Students&quot; Heldref Publications 2005 by: Edyth Young

== Department of Physical Constraints ==</text>
      <sha1>izpgylwakvrqt8q2xf1i2dauulwvatm</sha1>
    </revision>
  </page>
  <page>
    <title>Wikiversity:Review board</title>
    <ns>4</ns>
    <id>4010</id>
    <revision>
      <id>2809908</id>
      <parentid>2127026</parentid>
      <timestamp>2026-05-17T11:19:22Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <minor />
      <comment>/* See also */</comment>
      <origin>2809908</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="7482" sha1="efsbc0ap7j760iqpkrtl6hxwsyq9hba" xml:space="preserve">{{Administering Wikiversity}}
'''Note''': This page contains some suggestions for the review board system detailed at [[betawikiversity:Wikiversity:Review_board/En|beta]].
----

The role of &quot;experts&quot; as Wikipedia editors has always been controversial. Often, the people who know the most about a topic are advised not to edit articles about that topic because of the danger of introducing personal biases. Well-documented and objectively-verifiable facts are given preference over expert opinion. While Wikiversity encourages the recognition of biases, Wikiversity also wants to encourage the participation of experienced educators who will share their expertise within the Wikiversity community. In order to facilitate the constructive utilization of expert knowledge that exists within the Wikiversity community, Wikiversity can develop a new type of wiki functionary, the &quot;referee&quot;. Wikiversity referees can be particularly useful in several roles:
#trusted advisors for students
#trusted editors for guiding the community towards satisfactory outcomes of content disputes
#facilitators of a formal [[Wikiversity:Peer review|peer review]] process for [[Wikiversity:Original research|original research]]
#liaisons for facilitating interactions between Wikiversity and professional educators and researchers outside of Wikiversity

==Trust==
In order for Wikiversity to function efficiently as a meeting place for learners and experienced teachers, it is important that Wikiversity have a system that will allow participants to know something about the backgrounds of people they interact with at Wikiversity. As &quot;[[w:Category:Wikipedia functionaries|functionaries]]&quot; with special responsibilities, Wikiversity referees need to be subjected to a special level of scrutiny in order to generate and sustain trust within the Wikiversity community. Wikiversity referees need to have a public record of constructive activity within Wikiversity. This public record depends on the record of page edits that exists in the &quot;history&quot; of each wiki page. If a Wikiversity participant makes useful edits and has constructive interactions with other members of the community, their edit history will reflect their service to the community. However, it is cumbersome to review the edit history of a wiki editor. Wikiversity needs a systematic way to convert edit histories into evaluations of potential referees. How does a wiki deal with this sort of problem?

Wikipedia has developed a special subset of wiki editors: [[w:Wikipedia:Administrators|administrators]]. A Wikipedia administrator is a &quot;trusted member of the community&quot; who has undergone an explicit [[w:Wikipedia:Requests for adminship|peer-review]] by the community. Administrators are experienced wiki editors and are expected to have knowledge of the community policies that regulate [[w:Administrators' reading list|how the wiki works]]. Wikiversity, like all WikiMedia projects, needs administrators (here we call them &quot;[[Wikiversity:Custodianship|custodians]]&quot;). However, when it comes to questions about article content, custodians are no different from any other Wikiversity editor. Being a custodian/administrator for a wiki indicates a certain amount of expertise about that wiki, but says nothing about expertise in any other area.

==Peer review of referees==
In addition to custodians/administrators, Wikipedia has other &quot;[[w:Category:Wikipedia functionaries|functionaries]]&quot; who perform special tasks (for Wikiversity functionaries, see [[Wikiversity:Support staff|Support staff]]). A Wikiversity referee is a member of the community who makes a special commitment to share their education-related expertise with the Wikiversity community. The special commitment includes submitting to a peer-review process by which the community openly documents the past history of the referee in such a way that it becomes relatively easy for all members of the community to know if the referee has expertise in particular subject areas that are of interest to the Wikiversity community. As for other Wikiversity functionaries, being a Wikiversity referee is not an &quot;honor&quot;, it is a commitment to perform special tasks for the community. In particular, Wikiversity referees will be called upon for help with those tasks that require expert knowledge about a subject area within Wikiversity.

==Expert opinion about wiki content==
Wikipedia has always had to deal with simple vandalism and more sophisticated &quot;jokes&quot; and falsifications. Persistent problems are met by blocking users from editing and protecting pages from being edited. Sometimes &quot;spoof&quot; articles are added to Wikipedia that pass the casual inspection of vandalism patrollers. It takes an expert to spot a good spoof. Wikiversity needs experts in all topic areas who can provide informed opinion when there are disputes or uncertainty about Wikiversity content. Wikiversity referees have the &lt;b&gt;special obligation&lt;/b&gt; of recognizing spoofs and frauds &lt;b&gt;and explaining to non-experts how to understand that specific Wikiversity content is bogus&lt;/b&gt;.

==Ambassadorial function==
Wikiversity is devoted to exploration of how to use the wiki user interface to promote learning. While exploring new ways of learning, Wikiversity seeks to have constructive relations with the &quot;outside world&quot; of more conventional educational institutions. Wikiversity tries to provide educational resources to the world and also provides a platform by which educators and researchers from all around the world can interact. Many working professionals cannot commit their time to projects unless they trust the people they are working with. Wikiversity does not use a standard system of academic credentials, so outside professionals face a problem in knowing if they can have a professional interaction with members of the Wikiversity community. The process by which Wikiversity openly evaluates the performance of Wikiversity referees provides a system for designating trusted members of the Wikiversity community with expert knowledge in certain topic areas. Wikiversity referees can function as ambassadorial contacts for outside professionals seeking to build collaborative projects with Wikiversity.

==Peer review of original research==
Conducting [[Wikiversity:Original research|original research]] is not the main [[Wikiversity:Mission|mission]] of Wikiversity, but unlike the long-standing policy of Wikipedia, original research is not excluded from Wikiversity. Any original research that arises within Wikiversity must be clearly identified as such and subjected to formal peer review. The Wikiversity peer review process must be entirely transparent and openly conducted in wiki format. Wikiversity referees can act to facilitate and guide the Wikiversity community as it reviews original research results within Wikiversity.

==See also==
*[[User:JWSchmidt/Wikiversity/Review board]] - A copy of the ([http://beta.wikiversity.org/wiki/Wikiversity:Research_guidelines/En original at the beta-wikiversity hub])
*[[Wikiversity:Research ethics]]
*[[Wikiversity:Research process]]
*[[WikiJournal User Group]] - Peer reviewed wiki publishing
*[http://en.wikipedia.org/w/index.php?title=Wikipedia:Wikipedia_Signpost/2006-07-31/Listserv&amp;oldid=66968788 Professors criticize, praise Wikipedia in listserv discussions]

[[Category:Pages moved from Meta]]
[[Category:Research policy proposals]]
[[Category:Wikiversity ethics]]
[[Category:Research ethics]]

[[de:Wikiversity:Review Board]]</text>
      <sha1>efsbc0ap7j760iqpkrtl6hxwsyq9hba</sha1>
    </revision>
  </page>
  <page>
    <title>Ruby</title>
    <ns>0</ns>
    <id>5858</id>
    <revision>
      <id>2809847</id>
      <parentid>2344328</parentid>
      <timestamp>2026-05-17T04:00:58Z</timestamp>
      <contributor>
        <username>HenriPittier</username>
        <id>3076895</id>
      </contributor>
      <origin>2809847</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="2598" sha1="7czol1m44gqqeynkchhjp5s6yexw0ae" xml:space="preserve">__NOTOC__
{{delete}}
&lt;small&gt;This is a placeholder for [[Portal:Engineering and Technology]] --&gt; [[School:Computer Science]] --&gt; [[Topic:Computer Programming]] --&gt; Ruby&lt;/small&gt;

{{RoundBoxTop|theme=2}}
==Introduction==
[[w:Ruby_(programming_language)|Ruby]] is a free, pure object-oriented, and interpreted programming language. Ruby has been used in game making programs such as RPG Maker XP.  It uses a markup script similar to Visual BASIC.  However, Ruby is rarely used in comparison to C++ and similar programming language.
{{RoundBoxBottom}}

{{RoundBoxTop|theme=4}}

==Prerequisites==
''Prerequisites are suggested courses that should be completed before taking this course. If you're having a hard time understanding the material in this course, make sure you complete these prerequisites first.''

* [[Computer Skills]]
* [[Introduction to Programming]]
* [[Object Oriented Programming]]
* [[Programming Logic]]
{{RoundBoxBottom}}

{{RoundBoxTop|theme=3}}
==Learning Resources==
{{nonformal}}
{{technology}}

*[[/Introduction to Ruby/]]
*[[/Flow Control/]]

'''[[Ruby on Rails website tutorial | Creating a website with Ruby on Rails]]'''
{{RoundBoxBottom}}

{{RoundBoxTop|theme=5}}

==Active Participants==

===Teachers or Contributors===
''If you are helping to develop this resource, please sign below by typing 4 tildes (~).''

===Students===
''If you are using this course as a learning resource, please sign below by typing 4 tildes (~).''
*[[User:Nithindanday|Nithindanday]] ([[User talk:Nithindanday|discuss]] • [[Special:Contributions/Nithindanday|contribs]]) 19:37, 16 October 2016 (UTC)
{{RoundBoxBottom}}

{{RoundBoxTop|theme=6}}

==Further Reading==
*[[b:Ruby Programming|Ruby Manual]] at [http://www.wikibooks.org/ Wikibooks]
**[[b:Ruby Programming/Syntax|Ruby SYNTAX Manual]]
*[http://www.ruby-doc.org/downloads Ruby Documentation] from [http://www.ruby-doc.org/ Ruby-Doc.Org]
*[https://evrone.com/yukihiro-matsumoto-interview Yukihiro Matsumoto: &quot;Ruby is designed for humans, not machines&quot;]

==See Also==
* [http://www.yoyobrain.com/cardboxes/preview/103 Ruby Learning Tool] Learn Ruby concepts and work more efficiently.
* [https://www.theblogstarter.com/intro-to-ruby-on-rails/ Ruby on Rails Tutorial] Learn the basics of Ruby on Rails
* [http://rubylearning.org/ Free Ruby Programming Courses] Learn Ruby programming from the comfort of your home.
* [http://blogs.agriya.com/process-of-software-testing-in-agriya Ruby Testing] process-of-software-testing.
* gems 
{{RoundBoxBottom}}

[[Category: Ruby]]
[[Category:Programming languages]]
[[Category:Technology courses]]</text>
      <sha1>7czol1m44gqqeynkchhjp5s6yexw0ae</sha1>
    </revision>
    <revision>
      <id>2809854</id>
      <parentid>2809847</parentid>
      <timestamp>2026-05-17T04:30:25Z</timestamp>
      <contributor>
        <username>NguoiDungKhongDinhDanh</username>
        <id>2922842</id>
      </contributor>
      <minor />
      <comment>Reverted edit by [[Special:Contributions/HenriPittier|HenriPittier]] ([[User_talk:HenriPittier|talk]]) to last version by [[User:Billinghurst|Billinghurst]] using [[Wikiversity:Rollback|rollback]]</comment>
      <origin>2196766</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="2588" sha1="ph919ivh9c9esqeg784u3aqv6cso8n6" xml:space="preserve">__NOTOC__

&lt;small&gt;This is a placeholder for [[Portal:Engineering and Technology]] --&gt; [[School:Computer Science]] --&gt; [[Topic:Computer Programming]] --&gt; Ruby&lt;/small&gt;

{{RoundBoxTop|theme=2}}
==Introduction==
[[w:Ruby_(programming_language)|Ruby]] is a free, pure object-oriented, and interpreted programming language. Ruby has been used in game making programs such as RPG Maker XP.  It uses a markup script similar to Visual BASIC.  However, Ruby is rarely used in comparison to C++ and similar programming language.
{{RoundBoxBottom}}

{{RoundBoxTop|theme=4}}

==Prerequisites==
''Prerequisites are suggested courses that should be completed before taking this course. If you're having a hard time understanding the material in this course, make sure you complete these prerequisites first.''

* [[Computer Skills]]
* [[Introduction to Programming]]
* [[Object Oriented Programming]]
* [[Programming Logic]]
{{RoundBoxBottom}}

{{RoundBoxTop|theme=3}}
==Learning Resources==
{{nonformal}}
{{technology}}

*[[/Introduction to Ruby/]]
*[[/Flow Control/]]

'''[[Ruby on Rails website tutorial | Creating a website with Ruby on Rails]]'''
{{RoundBoxBottom}}

{{RoundBoxTop|theme=5}}

==Active Participants==

===Teachers or Contributors===
''If you are helping to develop this resource, please sign below by typing 4 tildes (~).''

===Students===
''If you are using this course as a learning resource, please sign below by typing 4 tildes (~).''
*[[User:Nithindanday|Nithindanday]] ([[User talk:Nithindanday|discuss]] • [[Special:Contributions/Nithindanday|contribs]]) 19:37, 16 October 2016 (UTC)
{{RoundBoxBottom}}

{{RoundBoxTop|theme=6}}

==Further Reading==
*[[b:Ruby Programming|Ruby Manual]] at [http://www.wikibooks.org/ Wikibooks]
**[[b:Ruby Programming/Syntax|Ruby SYNTAX Manual]]
*[http://www.ruby-doc.org/downloads Ruby Documentation] from [http://www.ruby-doc.org/ Ruby-Doc.Org]
*[https://evrone.com/yukihiro-matsumoto-interview Yukihiro Matsumoto: &quot;Ruby is designed for humans, not machines&quot;]

==See Also==
* [http://www.yoyobrain.com/cardboxes/preview/103 Ruby Learning Tool] Learn Ruby concepts and work more efficiently.
* [https://www.theblogstarter.com/intro-to-ruby-on-rails/ Ruby on Rails Tutorial] Learn the basics of Ruby on Rails
* [http://rubylearning.org/ Free Ruby Programming Courses] Learn Ruby programming from the comfort of your home.
* [http://blogs.agriya.com/process-of-software-testing-in-agriya Ruby Testing] process-of-software-testing.
* gems 
{{RoundBoxBottom}}

[[Category: Ruby]]
[[Category:Programming languages]]
[[Category:Technology courses]]</text>
      <sha1>ph919ivh9c9esqeg784u3aqv6cso8n6</sha1>
    </revision>
  </page>
  <page>
    <title>Wikiversity:Request custodian action/Archive</title>
    <ns>4</ns>
    <id>6129</id>
    <revision>
      <id>2809732</id>
      <parentid>2776502</parentid>
      <timestamp>2026-05-16T19:28:16Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>Adding a date.</comment>
      <origin>2809732</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="1679" sha1="smmz2xsreu3gsiscnud09ubso2l6wkp" xml:space="preserve">Archived material from [[Wikiversity:Request custodian action]] can be found at:

* [[/1|Archive 1]] (August 2006 - January 2007)
* [[/2|Archive 2]] (February 2007 - August 2007)
* [[/3|Archive 3]] (September 2007 - October 2007)
* [[/4|Archive 4]] (November 2007 - September 2008)
* [[/5|Archive 5]] (September 2008 - December 2008)
* [[/6|Archive 6]] (January 2009 - June 2009)
* [[/7|Archive 7]] (July 2009 - June 2010)
* [[/8|Archive 8]] (July 2010 - August 2010)
* [[/9|Archive 9]] (September 2010 - December 2010)
* [[/10|Archive 10]] (January 2011 - February 2011)
* [[/11|Archive 11]] (March 2011)
* [[/12|Archive 12]] (April 2011 - October 2011)
* [[/13|Archive 13]] (November 2011)
* [[/14|Archive 14]] (December 2011 - January 2012)
* [[/15|Archive 15]] (February 2012 - September 2013)
* [[/16|Archive 16]] (October 2013 - December 2013)
* [[/17|Archive 17]] (January 2014 - December 2014)
* [[/18|Archive 18]] (January 2015 - December 2015)
* [[/19|Archive 19]] (January 2016 - December 2016)
* [[/20|Archive 20]] (January 2017 - December 2017)
* [[/21|Archive 21]] (January 2018 - December 2019)
* [[/22|Archive 22]] (January 2020 - December 2020)
* [[/23|Archive 23]] (January 2021 - June 2023)
* [[/24|Archive 24]] (December 2021 - December 2022)
* [[/25|Archive 25]] (July 2023 - December 2023)
* [[/26|Archive 26]] (January 2024 - June 2024)
* [[/27|Archive 27]] (July 2024 - December 2024)
* [[/28|Archive 28]] (January 2025 - June 2025)
* [[/29|Archive 29]] (July 2025 - December 2025)
* [[/30|Archive 30]] (January 2026 - June 2026)
* [[/31|Archive 31]]
* [[/32|Archive 32]]
* [[/33|Archive 33]]
* [[/34|Archive 34]]
* [[/35|Archive 35]]
* [[/36|Archive 36]]</text>
      <sha1>smmz2xsreu3gsiscnud09ubso2l6wkp</sha1>
    </revision>
  </page>
  <page>
    <title>Introduction to Set Theory</title>
    <ns>0</ns>
    <id>7845</id>
    <revision>
      <id>2809889</id>
      <parentid>2765999</parentid>
      <timestamp>2026-05-17T10:21:56Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <comment>- prod</comment>
      <origin>2809889</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="2073" sha1="jrjs9n9p0hyum5yl2voyor1etjpbasd" xml:space="preserve">{{nav3|Wikiversity|Wikiversity:School of Mathematics|School:Mathematics/Undergraduate/Pure Mathematics}}
{|
|-
|bgcolor=&quot;#E6CFDD&quot; style=&quot;border:1px solid #cfcfcf;padding:1em;padding-top:0.5em;padding-bottom:0em;&quot;| &lt;h2&gt;Introduction to Set Theory&lt;/h2&gt;&lt;br&gt;
&lt;h3&gt;An [[School:Mathematics/Courses by level|introductory course]] [[School:Mathematics|from the School of Mathematics]]&lt;/h3&gt;

|-
|bgcolor=&quot;#F4E3F3&quot; style=&quot;border:1px solid #cfcfcf;padding:1em;padding-top:0.5em;padding-bottom:0em;&quot;|

This course aims to provide a thorough introduction to the subject of set theory. We will cover the following: Set-theoretical paradoxes and means of avoiding them. Sets, relations, functions, order and well-order. Proof by transfinite induction and definitions by transfinite recursion. Cardinal and ordinal numbers and their arithmetic. Construction of the real numbers. Axiom of choice and its consequences.

== Course requirements ==
The following knowledge is required or desirable on commencement of study of this course:
* knowledge of basic [[School:Mathematics/Undergraduate/Foundations_of_Pure_Mathematics|Pure Mathematics]]
* knowledge of [[School_of_Mathematics:Introduction_to_Proofs|formal proofs]]

== Course outline ==
This is an approximate depiction of the course:
* Propositional Logic
* Axiomatic Approach
* Unions and Intersections
* Algebra of Sets
* Ordered Pairs
* Relations
* Functions
* Ordering Relations
* Cardinal Arithmetic
* Partial, Linear Orderings
* Well Orderings
* Comparison Theorem for Well Orderings
* Isomorphisms
* Transfinite Recursion Theorem
* Replacement Axioms
* Epsilon-Images
* Ordinals
* Ordinal Numbers
* Ordinal Arithmetic

== Lecture series ==
*[[School:Mathematics/Undergraduate/Introduction_to_Set_Theory:Lecture 1|Lecture 1]] Propositional Logic
*[[School:Mathematics/Undergraduate/Introduction_to_Set_Theory:Lecture 2|Lecture 2]] ''not available yet''

== Assignments ==
''not available yet''

== Examinations ==
''not available yet''

== Recommended student evaluation scheme ==
''not available yet''
|}
[[Category:Mathematics]]</text>
      <sha1>jrjs9n9p0hyum5yl2voyor1etjpbasd</sha1>
    </revision>
  </page>
  <page>
    <title>Popular psychology</title>
    <ns>0</ns>
    <id>7884</id>
    <revision>
      <id>2809843</id>
      <parentid>1574704</parentid>
      <timestamp>2026-05-17T03:59:25Z</timestamp>
      <contributor>
        <username>HenriPittier</username>
        <id>3076895</id>
      </contributor>
      <origin>2809843</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="1446" sha1="40tics8p827fwbz8z3d1uoindqys1er" xml:space="preserve">{{TOCright}}

Welcome to The Fairly OddParents Wikiversity's School of [[w:Popular_psychology|Popular Psychology]].

A Wikiversity [[Wikiversity:Schools|school]] is a large organizational structure which can contain various departments and divisions. The departments and divisions should be listed in the departments and divisions section. The school should not contain any learning resources. The school can contain [[Portal:Learning Projects|projects]] for developing [[Portal:Learning Materials|learning resources]].

==Divisions and Departments==

Divisions and Departments of the School exist on pages in &quot;topic&quot; namespace. Start the name of departments with the &quot;Topic:&quot; prefix; departments reside in the [[Wikiversity:Namespaces|Topic: namespace]]. Departments and divisions link to learning materials and learning projects. Divisions can link subdivisions or to departments. For more information on schools, divisions and departments look at the [[Wikiversity:Naming_conventions|Naming Conventions]].

===Subjects===

*[[Body language|Body Langauge]]
* ...

==Active participants==

The histories of Wikiversity pages indicate who the active participants are. If you are an active participant in this school, you can list your name here (this can help small schools grow and the participants communicate better; for large schools it is not needed).
*  ...

==School news==

* '''Date founded''' - School founded!


[[Category:Psychology]]</text>
      <sha1>40tics8p827fwbz8z3d1uoindqys1er</sha1>
    </revision>
    <revision>
      <id>2809857</id>
      <parentid>2809843</parentid>
      <timestamp>2026-05-17T04:30:27Z</timestamp>
      <contributor>
        <username>NguoiDungKhongDinhDanh</username>
        <id>2922842</id>
      </contributor>
      <minor />
      <comment>Reverted edit by [[Special:Contributions/HenriPittier|HenriPittier]] ([[User_talk:HenriPittier|talk]]) to last version by [[User:MaintenanceBot|MaintenanceBot]] using [[Wikiversity:Rollback|rollback]]</comment>
      <origin>1574704</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="1424" sha1="k52rm0k0yziu1hlomfrdxnfyejqsp0t" xml:space="preserve">{{TOCright}}

Welcome to Wikiversity's School of [[w:Popular_psychology|Popular Psychology]].

A Wikiversity [[Wikiversity:Schools|school]] is a large organizational structure which can contain various departments and divisions. The departments and divisions should be listed in the departments and divisions section. The school should not contain any learning resources. The school can contain [[Portal:Learning Projects|projects]] for developing [[Portal:Learning Materials|learning resources]].

==Divisions and Departments==

Divisions and Departments of the School exist on pages in &quot;topic&quot; namespace. Start the name of departments with the &quot;Topic:&quot; prefix; departments reside in the [[Wikiversity:Namespaces|Topic: namespace]]. Departments and divisions link to learning materials and learning projects. Divisions can link subdivisions or to departments. For more information on schools, divisions and departments look at the [[Wikiversity:Naming_conventions|Naming Conventions]].

===Subjects===

*[[Body language|Body Langauge]]
* ...

==Active participants==

The histories of Wikiversity pages indicate who the active participants are. If you are an active participant in this school, you can list your name here (this can help small schools grow and the participants communicate better; for large schools it is not needed).
*  ...

==School news==

* '''Date founded''' - School founded!


[[Category:Psychology]]</text>
      <sha1>k52rm0k0yziu1hlomfrdxnfyejqsp0t</sha1>
    </revision>
  </page>
  <page>
    <title>COPD Examination</title>
    <ns>0</ns>
    <id>34153</id>
    <revision>
      <id>2809829</id>
      <parentid>1958174</parentid>
      <timestamp>2026-05-17T03:43:08Z</timestamp>
      <contributor>
        <username>HenriPittier</username>
        <id>3076895</id>
      </contributor>
      <origin>2809829</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="3183" sha1="edz4hfpuxn9ol9rfqob6wezt0f65vuk" xml:space="preserve">{{delete}}
==Before you start some definitions==

Emphysema - dilation and destruction of air spaces distal to bronchioles

Chronic bronchitis - airway narrowing and mucous production
*chronic cough


And now a stepwise approach to the OSCE examination

1. Knock on the door, walk in and introduce yourself.  Wash hands and make sure the patient is comfortable then begin the examination.

==General==
*ABCs
**as a general rule, if the patient can talk to you their airway and breathing are okay
*LOC
*Pulse rate
*Respiratory rate, rhythm and depth
*Effort of breathing
**Use of accessory muscles - sternocleido mastoid, pec minor
***arms braced on knees or table
**speaking in full sentences
**Pursing of lips
**Nasal flaring
**Paradoxical abdominal breathing
**Sweating
**Tracheal tug

==Inspection==
*Look for cyanosis
**Central - look at lips, oral mucosa and tongue
**Peripheral - nails, hands and feet
*Look at fingers for cigarette tar stains
*Shape of chest
**Chest wall deformities or trauma
**Asymmetries of shape or movement
**Barrel chest has increased AP diameter - common in COPD
*Look for intercostal, subcostal and supraclavicular indrawing

==Palpation==
*Feel for tracheal position and presence of a downward tug
*Feel for range and symmetry of movement on inspiration - decreased range with hyperinflated lungs of COPD
*Feel for tactile fremitus - decreased in COPD

==Percussion==
*Percuss anterior and posterior, comparing left to right - hyperresonance with COPD
*Estimate diaphragmatic excursion by noting the difference in the level of dullness on percussion with inspiration and expiration - normal is 5-6cm, but is decreased with hyperinflated lungs of COPD

==Auscultation==
*listen to each of the five lung lobes and compare findings between sides
**Air entry - decreased in COPD
**Adventitious sounds
***wheezes, crackles, other
***generalized versus localized
***loud vs soft

==Make diagnoses==

==Differences between emphysema and chronic bronchitis on exam==
===Inspection===
*emphysema: pink puffer (SOB and tachypnea), hyperinflation, SOBOE, respiratory distress
*chronic bronchitis: blue bloater, cyanotic, peripheral edema (RVF), mild SOB post cough
===Percussion===
*emphysema: hyperresonant, decreased diaphragmatic excursion
*chronic bronchitis: normal
===Auscultation===
*emphysema: decreased breath sounds, no egophony
*chronic bronchitis: crackles and wheezes

==CXR== 
*hyperinflated lungs with flattened diaphragms
*retrosternal airspace
*heart shadow long and narrow or enlarged if RVF/cor pulmonale
*may see bullae with emphysema

==ABGs==
*both have decreased PaO2 and increased PaCO2 (retainers) (low pH) but chronic bronchitis is worse than emphysema.

==CBC==
*Hct normal in emphysema, increased in Chronic bronchitis

==PFTs==
*Emphysema
**TLC increased (barrel chest)
**RV increased
**VC decreased
**FEV1 &lt; 50%
**DLCO decreased (because alveoli destroyed) 
*Chronic bronchitis
**TLC normal
**RV slightly increased
**VC slightly decreased
**FEV1 &lt; 50%
**DLCO slightly decreased or normal
*cor pulmonale if FEV1 &lt; 25%
==Other OSCE modules==
{{OSCE2}}
[[Category:OSCE]]

[[Category:Clinical skills]]
[[Category:Respiratory medicine]]</text>
      <sha1>edz4hfpuxn9ol9rfqob6wezt0f65vuk</sha1>
    </revision>
    <revision>
      <id>2809866</id>
      <parentid>2809829</parentid>
      <timestamp>2026-05-17T04:30:38Z</timestamp>
      <contributor>
        <username>NguoiDungKhongDinhDanh</username>
        <id>2922842</id>
      </contributor>
      <minor />
      <comment>Reverted edit by [[Special:Contributions/HenriPittier|HenriPittier]] ([[User_talk:HenriPittier|talk]]) to last version by [[User:176.28.136.245|176.28.136.245]] using [[Wikiversity:Rollback|rollback]]</comment>
      <origin>1958174</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="3172" sha1="pym1nchg3ihhxfvfvpalys0wn3tbcrx" xml:space="preserve">==Before you start some definitions==

Emphysema - dilation and destruction of air spaces distal to bronchioles

Chronic bronchitis - airway narrowing and mucous production
*chronic cough


And now a stepwise approach to the OSCE examination

1. Knock on the door, walk in and introduce yourself.  Wash hands and make sure the patient is comfortable then begin the examination.

==General==
*ABCs
**as a general rule, if the patient can talk to you their airway and breathing are okay
*LOC
*Pulse rate
*Respiratory rate, rhythm and depth
*Effort of breathing
**Use of accessory muscles - sternocleido mastoid, pec minor
***arms braced on knees or table
**speaking in full sentences
**Pursing of lips
**Nasal flaring
**Paradoxical abdominal breathing
**Sweating
**Tracheal tug

==Inspection==
*Look for cyanosis
**Central - look at lips, oral mucosa and tongue
**Peripheral - nails, hands and feet
*Look at fingers for cigarette tar stains
*Shape of chest
**Chest wall deformities or trauma
**Asymmetries of shape or movement
**Barrel chest has increased AP diameter - common in COPD
*Look for intercostal, subcostal and supraclavicular indrawing

==Palpation==
*Feel for tracheal position and presence of a downward tug
*Feel for range and symmetry of movement on inspiration - decreased range with hyperinflated lungs of COPD
*Feel for tactile fremitus - decreased in COPD

==Percussion==
*Percuss anterior and posterior, comparing left to right - hyperresonance with COPD
*Estimate diaphragmatic excursion by noting the difference in the level of dullness on percussion with inspiration and expiration - normal is 5-6cm, but is decreased with hyperinflated lungs of COPD

==Auscultation==
*listen to each of the five lung lobes and compare findings between sides
**Air entry - decreased in COPD
**Adventitious sounds
***wheezes, crackles, other
***generalized versus localized
***loud vs soft

==Make diagnoses==

==Differences between emphysema and chronic bronchitis on exam==
===Inspection===
*emphysema: pink puffer (SOB and tachypnea), hyperinflation, SOBOE, respiratory distress
*chronic bronchitis: blue bloater, cyanotic, peripheral edema (RVF), mild SOB post cough
===Percussion===
*emphysema: hyperresonant, decreased diaphragmatic excursion
*chronic bronchitis: normal
===Auscultation===
*emphysema: decreased breath sounds, no egophony
*chronic bronchitis: crackles and wheezes

==CXR== 
*hyperinflated lungs with flattened diaphragms
*retrosternal airspace
*heart shadow long and narrow or enlarged if RVF/cor pulmonale
*may see bullae with emphysema

==ABGs==
*both have decreased PaO2 and increased PaCO2 (retainers) (low pH) but chronic bronchitis is worse than emphysema.

==CBC==
*Hct normal in emphysema, increased in Chronic bronchitis

==PFTs==
*Emphysema
**TLC increased (barrel chest)
**RV increased
**VC decreased
**FEV1 &lt; 50%
**DLCO decreased (because alveoli destroyed) 
*Chronic bronchitis
**TLC normal
**RV slightly increased
**VC slightly decreased
**FEV1 &lt; 50%
**DLCO slightly decreased or normal
*cor pulmonale if FEV1 &lt; 25%
==Other OSCE modules==
{{OSCE2}}
[[Category:OSCE]]

[[Category:Clinical skills]]
[[Category:Respiratory medicine]]</text>
      <sha1>pym1nchg3ihhxfvfvpalys0wn3tbcrx</sha1>
    </revision>
  </page>
  <page>
    <title>Fairy Rings</title>
    <ns>0</ns>
    <id>47171</id>
    <revision>
      <id>2809914</id>
      <parentid>2774291</parentid>
      <timestamp>2026-05-17T11:32:44Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <comment>- RFD (empty sub-pages were already deleted and the discussion was already closed)</comment>
      <origin>2809914</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="145" sha1="q3coedl67wx82w2lxi80htyg4xzlmqu" xml:space="preserve">{{:Fairy Rings/Header}}
[[File:Fairy_Ring.jpg|thumb|250px|Fairy ring]]
{{Juststarted}}

[[Category:Fairy Rings| ]]
[[Category:Research projects]]</text>
      <sha1>q3coedl67wx82w2lxi80htyg4xzlmqu</sha1>
    </revision>
  </page>
  <page>
    <title>Wikiversity:Main Page/News</title>
    <ns>4</ns>
    <id>53432</id>
    <revision>
      <id>2809743</id>
      <parentid>2808009</parentid>
      <timestamp>2026-05-16T20:17:42Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <minor />
      <comment>Codename Noreste moved page [[Main Page/News]] to [[Wikiversity:Main Page/News]]: To maintain consistency with the other Main Page templates.</comment>
      <origin>2808009</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="807" sha1="tco5mletgq76wdfdqal15ql8x868we7" xml:space="preserve">'''2026'''
* '''May 9''': '''''[[Wikiversity:Curators]]''''' [new policy]
* '''April 18''': '''''[[Wikiversity:Artificial intelligence]]''''' [new policy]
* '''January 11''': '''''[[The Gambling King of Baltimore: Doc Slater 1837-1902]]''''' [new article]
* '''January 2''': [[ChatGPT's Essay on Kohlberg's Theory: AI's Use in Academic Writing|'''''ChatGPT's Essay on Kohlberg's Theory: AI's Use in Academic Writing''''']] [new article]

'''2025'''
* '''December 16:''' '''''[[Engineering thermodynamics/Quizzes/Turbine and compressor problems|Turbine and compressor problems]]''''' [new quiz]
* '''December 4:''' '''''[[Association Between Screen Time and Sleep: An Online Survey]]''''' [new article]
&lt;noinclude&gt;
[[Category:Main page templates]]
[[Category:News]]
[[Category:Wikiversity news]]
&lt;/noinclude&gt;</text>
      <sha1>tco5mletgq76wdfdqal15ql8x868we7</sha1>
    </revision>
  </page>
  <page>
    <title>Wikiversity:Main Page/Layout</title>
    <ns>4</ns>
    <id>53545</id>
    <revision>
      <id>2809747</id>
      <parentid>2778365</parentid>
      <timestamp>2026-05-16T20:19:24Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <minor />
      <comment>Modifying.</comment>
      <origin>2809747</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="902" sha1="8qb0ez4fvviwjppwlsvs24zcmagrqx0" xml:space="preserve">&lt;div&gt;{{Wikiversity:Main Page/Welcome|theme={{{welcome|11}}}}}&lt;/div&gt;
&lt;div&gt;{{Wikiversity:Main Page/Introduction|theme={{{intro|13}}}}}&lt;/div&gt;

&lt;div style=&quot;display: flex; flex-wrap: wrap; width: 100%;&quot; &gt;

&lt;div style=&quot;flex: 30%; min-width: 20em; vertical-align: top;&quot;&gt;
{{Wikiversity:Main Page/Feature|theme={{{feature|1}}}}}
&lt;/div&gt;

&lt;div style=&quot;flex: 40%; min-width: 30em; vertical-align: top;&quot;&gt;
{{Wikiversity:Main Page/Project|theme={{{project|1}}}}}
&lt;/div&gt;

&lt;div style=&quot;flex: 30%; min-width: 20em; vertical-align: top;&quot;&gt;
{{Robelbox|title=[[Main Page/News|News]]|theme={{{theme|11}}}|height={{{height|none}}} }}
&lt;div style=&quot;padding-top:0.5em; padding-bottom:0.2em; padding-left:0.5em; padding-right:0.75em;&quot;&gt;
{{Wikiversity:Main Page/News}}
&lt;/div&gt;
{{Robelbox/close}}
&lt;/div&gt;

&lt;/div&gt;
{{Wikiversity:Main Page/Wikimedia projects|theme={{{sisters|13}}}}}&lt;noinclude&gt;
[[Category: main page templates]]
&lt;/noinclude&gt;</text>
      <sha1>8qb0ez4fvviwjppwlsvs24zcmagrqx0</sha1>
    </revision>
  </page>
  <page>
    <title>User:JWSchmidt/Wikiversity/Review board</title>
    <ns>2</ns>
    <id>56285</id>
    <revision>
      <id>2809905</id>
      <parentid>2670288</parentid>
      <timestamp>2026-05-17T11:16:55Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <minor />
      <comment>Jtneill moved page [[Wikiversity:Review board/En]] to [[User:User:JWSchmidt/Wikiversity/Review board]] without leaving a redirect: Move to user space</comment>
      <origin>2670288</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="7058" sha1="rwvjugjmu72urece2vx9ilqlk5dglkc" xml:space="preserve">{{rfd|Wikiversity:Review board/En|It makes no sense to have a page [[Wikiversity:Review board/En]] in addition to [[Wikiversity:Review board]] as if the only difference was language, &quot;En&quot;. Given the page history, the page could be moved to a subpage of [[User:JWSchmidt]].}}

{{Research policy}}
[[betawikiversity:Wikiversity:Original research/En|Original Research]] projects at Wikiversity introduce a risk that unsound methods will be used in some projects. Original research can generate unverifiable data and conclusions. It is also possible for nonresearch-related ideas and writings to masquerade as research. As outlined at [[Wikiversity:Research guidelines|Research guidelines]], acceptable original research at Wikiversity is shaped by ethical considerations and precautions against research methods that lead to inaccurate or falsified data. Wikiversity relies on peer review of research projects to identify and correct problems that might arise in research projects. In addition to conventional wiki peer review by wiki webpage editing, Wikiversity also seeks to establish a more formalized system for peer review; the Research Review Board (&quot;Review Board&quot;, for short). The Review Board is a group of community-approved Wikiversity participants tasked to help the community verify the methods used in research projects and deal with any potential problems.

==Pre-approval of research projects==
Most types of Wikiversity research projects do not need to be submitted to the Review Board for approval before they are started as Wikiversity webpages. A possible exception is any research activity conducted at Wikiversity that would normally require review by an [[w:Institutional review board|Institutional Review Board]]. Potentially, a research project approved by an IRB at a bricks-and-mortar research institution could involve research activities conducted at Wikiversity. Any such IRB-approved research should be evaluated by the Wikiversity Review Board in order to make sure that the proposed research does not violate Wikimedia Foundation policy and is not beyond the educational mission of Wikiversity.

==Review of research methods and practice==
The main function of the Review Board is to help guide the whole Wikiversity community in peer review of research projects. It is of particular concern that each research project adhere to the [[Wikiversity:Research guidelines|Wikiversity research guidelines]]. The Review Board helps the community distinguish between valid research methods and bogus research methods. When problems in research methods and practices are identified, the Review Board helps the community respond so as to correct any problems in research activities at Wikiversity. In conjunction with Wikiversity sysops, problematical research projects that cannot be corrected will be terminated.

In keeping with the educational mission of Wikiversity, the Review Board will help Wikiversity participants learn how to use productive and reliable research methods.

==Wiki publishing==
Wikiversity does not have a system for formal peer review of research results and conclusions. The Review Board does not &quot;approve&quot; the results from original research projects before they are considered &quot;published&quot; on Wikiversity. All members of Wikiversity research projects can post their research conclusions on wiki webpages, but such &quot;informal publication&quot; does not imply any certification of the research by the Review Board or Wikiversity. The Review Board only helps the community make sure that research projects are conducted according to Wikiversity research guidelines and sound research methods.

A long-term goal is for Wikiversity to explore the possibility of having a formal peer review system for research reports. It is possible that in the future the Review Board could evolve into a way for experts to conduct formal peer review of research results within Wikiversity. Until then, any research results arising from research projects at Wikiversity should be submitted for peer review at conventional journals.

==Referees==
The Review Board members are called &quot;Referees&quot;. Referees are Wikiversity participants nominated then accepted by the community in a similar manner to how [[Wikiversity:Custodianship|Custodians]] are selected. 

Referees help the community:
*mark pages of original research projects with the appropriate template
*make sure that original research follows the [[Wikiversity:Research guidelines|Research Guidelines]]
*approve any research-related activities at Wikiversity that are part another institution's IRB-approval research project
*make sure data and research results arising from original research are correctly archived and not manipulated after posting as an historical archive
*identify and correct poor research methods or work with sysops to terminate projects that cannot be corrected

Referees are not Custodians - they do not have the privileges to deal with breaches in the guidelines beyond editing the wiki webpages of research projects. If a research project needs to be terminated, referees can request that Custodians take action to delete pages or block editors who refuse to follow the research guidelines. However, some Referees may also be Custodians. In such cases, the account holder of such privileges needs to clearly identify the role they are acting in so that there is no actual or perceived conflict of interest.

==Selection of referees==
Referees are selected because of their past history of Wikiversity editing. Wikiversity editors who have demonstrated expertise in particular subject areas and an interest in helping the community monitor the methods and practices of research projects will be potential candidate Referees. Candidates can self-nominate or be nominated by someone else. Candidates become Referees following community discussion and approval by consensus. Such candidates must demonstrate a sufficient level of competence in order to referee.

==Conduct of referees==
Becoming a Referee means taking on extra duties and responsibilities in service of the Wikiversity community. In particular, Referees are expected to apply their expertise and experience to help guide the community in peer review of research methods and practices used in Wikiversity research projects. Referees never demand action based on their &quot;expert opinion&quot;, rather they use their expertise to help provide explanations that guide the community to consensus. 

==See also==
*Research policies
**[[Wikiversity:Research guidelines|Research Guidelines]] for Wikiversity
**[[Wikiversity:Scope of research|Scope of Research]] for Wikiversity
*Research-related pages
**[[Wikiversity:Research]] - Source documents concerning research within Wikiversity
**[[betawikiversity:Wikiversity:Original research/En|Original Research]] - unpublished research into a topic using literature review and/or methods in addition to literature review
**[[betawikiversity:Wikiversity:Secondary research/En|Secondary research]] - research into a topic using the method of literature review</text>
      <sha1>rwvjugjmu72urece2vx9ilqlk5dglkc</sha1>
    </revision>
    <revision>
      <id>2809906</id>
      <parentid>2809905</parentid>
      <timestamp>2026-05-17T11:17:53Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <comment>{{Notice|See also [[Wikiversity:Review board]]}}</comment>
      <origin>2809906</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="6832" sha1="3wkeipnlxkgt7o9jiat2wy7ahrdqvqz" xml:space="preserve">{{Notice|See also [[Wikiversity:Review board]]}}

{{Research policy}}
[[betawikiversity:Wikiversity:Original research/En|Original Research]] projects at Wikiversity introduce a risk that unsound methods will be used in some projects. Original research can generate unverifiable data and conclusions. It is also possible for nonresearch-related ideas and writings to masquerade as research. As outlined at [[Wikiversity:Research guidelines|Research guidelines]], acceptable original research at Wikiversity is shaped by ethical considerations and precautions against research methods that lead to inaccurate or falsified data. Wikiversity relies on peer review of research projects to identify and correct problems that might arise in research projects. In addition to conventional wiki peer review by wiki webpage editing, Wikiversity also seeks to establish a more formalized system for peer review; the Research Review Board (&quot;Review Board&quot;, for short). The Review Board is a group of community-approved Wikiversity participants tasked to help the community verify the methods used in research projects and deal with any potential problems.

==Pre-approval of research projects==
Most types of Wikiversity research projects do not need to be submitted to the Review Board for approval before they are started as Wikiversity webpages. A possible exception is any research activity conducted at Wikiversity that would normally require review by an [[w:Institutional review board|Institutional Review Board]]. Potentially, a research project approved by an IRB at a bricks-and-mortar research institution could involve research activities conducted at Wikiversity. Any such IRB-approved research should be evaluated by the Wikiversity Review Board in order to make sure that the proposed research does not violate Wikimedia Foundation policy and is not beyond the educational mission of Wikiversity.

==Review of research methods and practice==
The main function of the Review Board is to help guide the whole Wikiversity community in peer review of research projects. It is of particular concern that each research project adhere to the [[Wikiversity:Research guidelines|Wikiversity research guidelines]]. The Review Board helps the community distinguish between valid research methods and bogus research methods. When problems in research methods and practices are identified, the Review Board helps the community respond so as to correct any problems in research activities at Wikiversity. In conjunction with Wikiversity sysops, problematical research projects that cannot be corrected will be terminated.

In keeping with the educational mission of Wikiversity, the Review Board will help Wikiversity participants learn how to use productive and reliable research methods.

==Wiki publishing==
Wikiversity does not have a system for formal peer review of research results and conclusions. The Review Board does not &quot;approve&quot; the results from original research projects before they are considered &quot;published&quot; on Wikiversity. All members of Wikiversity research projects can post their research conclusions on wiki webpages, but such &quot;informal publication&quot; does not imply any certification of the research by the Review Board or Wikiversity. The Review Board only helps the community make sure that research projects are conducted according to Wikiversity research guidelines and sound research methods.

A long-term goal is for Wikiversity to explore the possibility of having a formal peer review system for research reports. It is possible that in the future the Review Board could evolve into a way for experts to conduct formal peer review of research results within Wikiversity. Until then, any research results arising from research projects at Wikiversity should be submitted for peer review at conventional journals.

==Referees==
The Review Board members are called &quot;Referees&quot;. Referees are Wikiversity participants nominated then accepted by the community in a similar manner to how [[Wikiversity:Custodianship|Custodians]] are selected. 

Referees help the community:
*mark pages of original research projects with the appropriate template
*make sure that original research follows the [[Wikiversity:Research guidelines|Research Guidelines]]
*approve any research-related activities at Wikiversity that are part another institution's IRB-approval research project
*make sure data and research results arising from original research are correctly archived and not manipulated after posting as an historical archive
*identify and correct poor research methods or work with sysops to terminate projects that cannot be corrected

Referees are not Custodians - they do not have the privileges to deal with breaches in the guidelines beyond editing the wiki webpages of research projects. If a research project needs to be terminated, referees can request that Custodians take action to delete pages or block editors who refuse to follow the research guidelines. However, some Referees may also be Custodians. In such cases, the account holder of such privileges needs to clearly identify the role they are acting in so that there is no actual or perceived conflict of interest.

==Selection of referees==
Referees are selected because of their past history of Wikiversity editing. Wikiversity editors who have demonstrated expertise in particular subject areas and an interest in helping the community monitor the methods and practices of research projects will be potential candidate Referees. Candidates can self-nominate or be nominated by someone else. Candidates become Referees following community discussion and approval by consensus. Such candidates must demonstrate a sufficient level of competence in order to referee.

==Conduct of referees==
Becoming a Referee means taking on extra duties and responsibilities in service of the Wikiversity community. In particular, Referees are expected to apply their expertise and experience to help guide the community in peer review of research methods and practices used in Wikiversity research projects. Referees never demand action based on their &quot;expert opinion&quot;, rather they use their expertise to help provide explanations that guide the community to consensus. 

==See also==
*Research policies
**[[Wikiversity:Research guidelines|Research Guidelines]] for Wikiversity
**[[Wikiversity:Scope of research|Scope of Research]] for Wikiversity
*Research-related pages
**[[Wikiversity:Research]] - Source documents concerning research within Wikiversity
**[[betawikiversity:Wikiversity:Original research/En|Original Research]] - unpublished research into a topic using literature review and/or methods in addition to literature review
**[[betawikiversity:Wikiversity:Secondary research/En|Secondary research]] - research into a topic using the method of literature review</text>
      <sha1>3wkeipnlxkgt7o9jiat2wy7ahrdqvqz</sha1>
    </revision>
    <revision>
      <id>2809907</id>
      <parentid>2809906</parentid>
      <timestamp>2026-05-17T11:18:47Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <minor />
      <comment>Jtneill moved page [[User:User:JWSchmidt/Wikiversity/Review board]] to [[User:JWSchmidt/Wikiversity/Review board]] without leaving a redirect</comment>
      <origin>2809906</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="6832" sha1="3wkeipnlxkgt7o9jiat2wy7ahrdqvqz" xml:space="preserve">{{Notice|See also [[Wikiversity:Review board]]}}

{{Research policy}}
[[betawikiversity:Wikiversity:Original research/En|Original Research]] projects at Wikiversity introduce a risk that unsound methods will be used in some projects. Original research can generate unverifiable data and conclusions. It is also possible for nonresearch-related ideas and writings to masquerade as research. As outlined at [[Wikiversity:Research guidelines|Research guidelines]], acceptable original research at Wikiversity is shaped by ethical considerations and precautions against research methods that lead to inaccurate or falsified data. Wikiversity relies on peer review of research projects to identify and correct problems that might arise in research projects. In addition to conventional wiki peer review by wiki webpage editing, Wikiversity also seeks to establish a more formalized system for peer review; the Research Review Board (&quot;Review Board&quot;, for short). The Review Board is a group of community-approved Wikiversity participants tasked to help the community verify the methods used in research projects and deal with any potential problems.

==Pre-approval of research projects==
Most types of Wikiversity research projects do not need to be submitted to the Review Board for approval before they are started as Wikiversity webpages. A possible exception is any research activity conducted at Wikiversity that would normally require review by an [[w:Institutional review board|Institutional Review Board]]. Potentially, a research project approved by an IRB at a bricks-and-mortar research institution could involve research activities conducted at Wikiversity. Any such IRB-approved research should be evaluated by the Wikiversity Review Board in order to make sure that the proposed research does not violate Wikimedia Foundation policy and is not beyond the educational mission of Wikiversity.

==Review of research methods and practice==
The main function of the Review Board is to help guide the whole Wikiversity community in peer review of research projects. It is of particular concern that each research project adhere to the [[Wikiversity:Research guidelines|Wikiversity research guidelines]]. The Review Board helps the community distinguish between valid research methods and bogus research methods. When problems in research methods and practices are identified, the Review Board helps the community respond so as to correct any problems in research activities at Wikiversity. In conjunction with Wikiversity sysops, problematical research projects that cannot be corrected will be terminated.

In keeping with the educational mission of Wikiversity, the Review Board will help Wikiversity participants learn how to use productive and reliable research methods.

==Wiki publishing==
Wikiversity does not have a system for formal peer review of research results and conclusions. The Review Board does not &quot;approve&quot; the results from original research projects before they are considered &quot;published&quot; on Wikiversity. All members of Wikiversity research projects can post their research conclusions on wiki webpages, but such &quot;informal publication&quot; does not imply any certification of the research by the Review Board or Wikiversity. The Review Board only helps the community make sure that research projects are conducted according to Wikiversity research guidelines and sound research methods.

A long-term goal is for Wikiversity to explore the possibility of having a formal peer review system for research reports. It is possible that in the future the Review Board could evolve into a way for experts to conduct formal peer review of research results within Wikiversity. Until then, any research results arising from research projects at Wikiversity should be submitted for peer review at conventional journals.

==Referees==
The Review Board members are called &quot;Referees&quot;. Referees are Wikiversity participants nominated then accepted by the community in a similar manner to how [[Wikiversity:Custodianship|Custodians]] are selected. 

Referees help the community:
*mark pages of original research projects with the appropriate template
*make sure that original research follows the [[Wikiversity:Research guidelines|Research Guidelines]]
*approve any research-related activities at Wikiversity that are part another institution's IRB-approval research project
*make sure data and research results arising from original research are correctly archived and not manipulated after posting as an historical archive
*identify and correct poor research methods or work with sysops to terminate projects that cannot be corrected

Referees are not Custodians - they do not have the privileges to deal with breaches in the guidelines beyond editing the wiki webpages of research projects. If a research project needs to be terminated, referees can request that Custodians take action to delete pages or block editors who refuse to follow the research guidelines. However, some Referees may also be Custodians. In such cases, the account holder of such privileges needs to clearly identify the role they are acting in so that there is no actual or perceived conflict of interest.

==Selection of referees==
Referees are selected because of their past history of Wikiversity editing. Wikiversity editors who have demonstrated expertise in particular subject areas and an interest in helping the community monitor the methods and practices of research projects will be potential candidate Referees. Candidates can self-nominate or be nominated by someone else. Candidates become Referees following community discussion and approval by consensus. Such candidates must demonstrate a sufficient level of competence in order to referee.

==Conduct of referees==
Becoming a Referee means taking on extra duties and responsibilities in service of the Wikiversity community. In particular, Referees are expected to apply their expertise and experience to help guide the community in peer review of research methods and practices used in Wikiversity research projects. Referees never demand action based on their &quot;expert opinion&quot;, rather they use their expertise to help provide explanations that guide the community to consensus. 

==See also==
*Research policies
**[[Wikiversity:Research guidelines|Research Guidelines]] for Wikiversity
**[[Wikiversity:Scope of research|Scope of Research]] for Wikiversity
*Research-related pages
**[[Wikiversity:Research]] - Source documents concerning research within Wikiversity
**[[betawikiversity:Wikiversity:Original research/En|Original Research]] - unpublished research into a topic using literature review and/or methods in addition to literature review
**[[betawikiversity:Wikiversity:Secondary research/En|Secondary research]] - research into a topic using the method of literature review</text>
      <sha1>3wkeipnlxkgt7o9jiat2wy7ahrdqvqz</sha1>
    </revision>
  </page>
  <page>
    <title>Wikiversity community blog</title>
    <ns>0</ns>
    <id>63790</id>
    <revision>
      <id>2809849</id>
      <parentid>451317</parentid>
      <timestamp>2026-05-17T04:01:47Z</timestamp>
      <contributor>
        <username>HenriPittier</username>
        <id>3076895</id>
      </contributor>
      <origin>2809849</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="3307" sha1="nyqbnwdpbb3fgn76pjr6hbdrrz29dzs" xml:space="preserve">There are several blogs of Wikiversity participants in Wikiversity itself (see [[:Category:Blogs]]), as well as outside - but this page is to discuss whether it would be a reasonable idea to have a communal blog. Would it be desirable to have such a thing? How would it working for the company? Ideas and comments are very welcome.

==Is it desirable?==
Even if we don't have an aggregated or centralised page for blog ''posts'', I think it is a good idea to list individual ''blogs'' from a centralised page. For example, my own blog can never be picked up via a category, as it is on a external host. [[User:Cormaggio|Cormaggio]] &lt;sup&gt;&lt;small&gt;[[User talk:Cormaggio|talk]]&lt;/small&gt;&lt;/sup&gt; 10:02, 30 July 2008 (UTC)
: The RSS reader extension is now enabled on the sandbox server, so a proof-of-concept could be created. Maybe we can use Google Reader for now to burn a single feed of all related WV blogs. But I suspect we're not going to be seeing such an extension enabled on WM projects for some time. Maybe we can try doing this with [[Knol]]? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:25, 30 July 2008 (UTC)

== What would we blog about? ==
We might make an analogy with [[w:WP:POST|The Signpost]] - here we announce news items that are important to a lot of people on Wikiversity. However, blogs can be updated as frequently as necessary, so there is no constraint on regular publishing. --[[User:HappyCamper|HappyCamper]] 11:49, 30 July 2008 (UTC)

==How would it work?==
Would it be best as an aggregation of all posts to all blogs? Would it simply be a free-form editable page that people can post to directly? Would it be an aggregator for shorter ' micro-blogging' updates, such as Twitter or Facebook 'status'? Just some ideas to get the ball rolling... [[User:Cormaggio|Cormaggio]] &lt;sup&gt;&lt;small&gt;[[User talk:Cormaggio|talk]]&lt;/small&gt;&lt;/sup&gt; 10:02, 30 July 2008 (UTC)
: For it to fly here, now, I'd vote for &quot;a free-form editable page that people can post to directly&quot;. Why not - let's try! -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:26, 30 July 2008 (UTC)

==Where would it reside?==
One idea would be to have some form of such a blog on the front page itself - it would probably have to be limited to a line or two maximum (though could possibly truncate, and give the option to &quot;read more&quot; on an expanded page). This might give the front page some sense of there being a community of learners and practitioners here - which is not so obviously apparent from our front page... [[User:Cormaggio|Cormaggio]] &lt;sup&gt;&lt;small&gt;[[User talk:Cormaggio|talk]]&lt;/small&gt;&lt;/sup&gt; 10:02, 30 July 2008 (UTC)
: Maybe a summary of each blog post for inclusion; and the main blog post would be not included? Or just include the title. Or maybe each person blogs individually, and then posts a title (for inclusion; and which links to the individual blog post) and a summary (not included) to the community blog page. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:29, 30 July 2008 (UTC)

==See also==
* [http://en.planet.wikimedia.org/ Planet Wikimedia]
* [[Wikiversity Blog howto]]
* [[Twitter]]

[[Category:Blogs]]</text>
      <sha1>nyqbnwdpbb3fgn76pjr6hbdrrz29dzs</sha1>
    </revision>
    <revision>
      <id>2809851</id>
      <parentid>2809849</parentid>
      <timestamp>2026-05-17T04:29:18Z</timestamp>
      <contributor>
        <username>EggRoll97</username>
        <id>2861116</id>
      </contributor>
      <comment>Undid revision [[Special:Diff/2809849|2809849]] by [[Special:Contributions/HenriPittier|HenriPittier]] ([[User talk:HenriPittier|talk]])</comment>
      <origin>2809851</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="3288" sha1="d0jwf4dh9s9wlqubu7kklwh1sa8lj91" xml:space="preserve">There are several blogs of Wikiversity participants in Wikiversity itself (see [[:Category:Blogs]]), as well as outside - but this page is to discuss whether it would be a reasonable idea to have a communal blog. Would it be desirable to have such a thing? How would it work? Ideas and comments are very welcome.

==Is it desirable?==
Even if we don't have an aggregated or centralised page for blog ''posts'', I think it is a good idea to list individual ''blogs'' from a centralised page. For example, my own blog can never be picked up via a category, as it is on a external host. [[User:Cormaggio|Cormaggio]] &lt;sup&gt;&lt;small&gt;[[User talk:Cormaggio|talk]]&lt;/small&gt;&lt;/sup&gt; 10:02, 30 July 2008 (UTC)
: The RSS reader extension is now enabled on the sandbox server, so a proof-of-concept could be created. Maybe we can use Google Reader for now to burn a single feed of all related WV blogs. But I suspect we're not going to be seeing such an extension enabled on WM projects for some time. Maybe we can try doing this with [[Knol]]? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:25, 30 July 2008 (UTC)

== What would we blog about? ==
We might make an analogy with [[w:WP:POST|The Signpost]] - here we announce news items that are important to a lot of people on Wikiversity. However, blogs can be updated as frequently as necessary, so there is no constraint on regular publishing. --[[User:HappyCamper|HappyCamper]] 11:49, 30 July 2008 (UTC)

==How would it work?==
Would it be best as an aggregation of all posts to all blogs? Would it simply be a free-form editable page that people can post to directly? Would it be an aggregator for shorter ' micro-blogging' updates, such as Twitter or Facebook 'status'? Just some ideas to get the ball rolling... [[User:Cormaggio|Cormaggio]] &lt;sup&gt;&lt;small&gt;[[User talk:Cormaggio|talk]]&lt;/small&gt;&lt;/sup&gt; 10:02, 30 July 2008 (UTC)
: For it to fly here, now, I'd vote for &quot;a free-form editable page that people can post to directly&quot;. Why not - let's try! -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:26, 30 July 2008 (UTC)

==Where would it reside?==
One idea would be to have some form of such a blog on the front page itself - it would probably have to be limited to a line or two maximum (though could possibly truncate, and give the option to &quot;read more&quot; on an expanded page). This might give the front page some sense of there being a community of learners and practitioners here - which is not so obviously apparent from our front page... [[User:Cormaggio|Cormaggio]] &lt;sup&gt;&lt;small&gt;[[User talk:Cormaggio|talk]]&lt;/small&gt;&lt;/sup&gt; 10:02, 30 July 2008 (UTC)
: Maybe a summary of each blog post for inclusion; and the main blog post would be not included? Or just include the title. Or maybe each person blogs individually, and then posts a title (for inclusion; and which links to the individual blog post) and a summary (not included) to the community blog page. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:29, 30 July 2008 (UTC)

==See also==
* [http://en.planet.wikimedia.org/ Planet Wikimedia]
* [[Wikiversity Blog howto]]
* [[Twitter]]

[[Category:Blogs]]</text>
      <sha1>d0jwf4dh9s9wlqubu7kklwh1sa8lj91</sha1>
    </revision>
  </page>
  <page>
    <title>Introduction to Diplomatic History</title>
    <ns>0</ns>
    <id>66297</id>
    <revision>
      <id>2809888</id>
      <parentid>2771954</parentid>
      <timestamp>2026-05-17T10:20:41Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <comment>- prod (no reason)</comment>
      <origin>2809888</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="6862" sha1="559umvrrzgrs2up1umxnbtusctdewxn" xml:space="preserve">&lt;div style=&quot;float: right; border:solid darkgreen 1px; margin: 1px;&quot;&gt;
{| cellspacing=&quot;0&quot; style=&quot;width: 238px; background: goldenrod;&quot;
| style=&quot;width: 35px; height: 45px; background: darkgreen; text-align: center; font-size: {{{8|{{{id-s|24}}}}}}pt; color: {{{id-fc|white}}};&quot; | '''D'''
| style=&quot;font-size: {{{info-s|8}}}pt; padding: 4pt; line-height: 1.25em; color: {{{info-fc|black}}};&quot; | This lesson is a part of the '''Denelder Homeschooling Series on History'''.
|}&lt;/div&gt;&lt;noinclude&gt;

'''DIPL 1001: Introduction to Diplomatic History''' is a survey of the history of diplomacy throughout recorded history. This course is meant to introduce new students to the study of diplomatic history by explaining the concept of diplomacy, terms that the student will use often in the [[Topic:Diplomatic History|Department of Diplomatic History]], and a broad history of international relations on a global scale. This is the first course students new to the department should complete as it will be the foundation for successive courses.

Courses within the Department of Diplomatic History will be primarily self-study, placing the educational responsibility on the student rather than the professor. Although the professor will provide a plan for study and general information, it is the responsibility of the student to fulfil the goals and expectations of the course by completing the readings, studying the provided lesson, and performing independent research to prove comprehension. This course is also designed for homeschooling use, with information for the homeschool instructor to aid the student in successful completion. Recommendations for further study will be provided with each homeschooling lesson to expand upon the basic course. 

==Denelder Homeschooling Series on History==
As denoted by the infobox above, this course is a lesson created by [[User:Dr_Denelder|Dr. Jason Denelder]] as a part of his lesson series for homeschooled students. This lesson was designed as an aid for homeschoolers to further their knowledge on a specific topic, not to replace regular homeschooling lesson plans and resources. The Introduction to Diplomatic History is intended as the first lesson in the Department of Diplomatic History and is classified as HS-DH001 in the Homeschooling Series.

==Suggested Readings==
*[http://www.diplom.org/Zine/S1995R/Szykman/History.html Diplomacy: An Historical Perspective] Simon Szykman. Spring 1995. Carnegie Mellon University.
*[http://www.ediplomat.com/nd/history.htm A Brief History of Diplomacy]  eDiplomat.
*[http://diplo.diplomacy.edu/books/mdiplomacy_book/langhorne/langhorne.htm History and the Evolution of Diplomacy] Richard Langhorne.
*[http://diplo.diplomacy.edu/books/mdiplomacy_book/petrovski/petrovski.htm Diplomacy as an Instrument of Good Governance] Vladimir Petrovsky.

==Course Syllabus==
===Goals and Expectations===
That students will understand the concept of diplomacy in a historical sense, will understand the basic terms of diplomatic research, and will gain an understanding of international relations on a global scale throughout history. That students will be able to implement their newly gained knowledge and successfully demonstrate their understanding by developing a researched essay on a general topic of diplomatic history.

===Reading Schedule===

===Essay===
The purpose of the essay is to demonstrate an understanding of the basics of diplomacy in the context of diplomatic history. As this is considered a university first-year course, grammar, spelling, and rhetoric should be correct and consistent throughout. Substance, however, is the most important component of a successful essay, demonstrating comprehension of the idea of diplomacy and its practical uses. Students have open control over the topic of their choice as long as it relates to the course material. Essays should be at least two pages long, although this should not be looked upon as a maximum. As the purpose is to demonstrate comprehension, the student should not write a descriptive essay, but rather an analytical essay. This means that the student should analyze a topic in diplomatic history, discussing the consequences of such an action and possible alternate paths and their consequences, using terms and concepts from the lesson.

Since this is an introductory course that encompasses the entire history of international relations, possible topics are endless in scope. In the essay, it is better to narrow in on a particular incident rather than discuss a broad topic. Do not analyze the diplomacy of Europe during the First World War, rather, analyze the effects of the War Guilt Clause on relations between Germany and the United Kingdom. Be specific in your analysis. 

For those students wishing for constructive criticism of their essays may email them to Dr. Denelder at jason.denelder@yahoo.com. He will read your essay, making comments and noting corrections where necessary. If submitting the essay, please allow up to two weeks to accommodate Dr. Denelder's busy schedule.

===Course Completion===
Successful completion of DIPL 1001 is dependent on the student's understanding of the concept of diplomacy and the broad history of international relations demonstrated by the satisfactory completion of an essay on a selected topic of diplomatic history. DIPL 1001 serves as the prerequisite course for continuation into more detailed courses of diplomatic history and should be completed first.

==Lesson Plan/Outline==
===Synopsis===

===Concepts===

===Terms===
*'''Diplomacy:''' the art and practice of conducting negotiations between representatives of groups or states; also, the employment of tact to gain strategic advantage or to find mutually acceptable solutions to a common challenge
*'''International Diplomacy:''' the conduct of international relations through the intercession of professional diplomats with regard to issues of peace-making, trade, war, economics, and culture
*'''Diplomatic Immunity:''' a form of legal immunity and a policy held between governments, which ensures that diplomats are given safe passage and are considered not susceptible to lawsuit or prosecution under the host country's laws
*'''Diplomatic Recognition:''' a unilateral political act, with domestic and international legal consequences, whereby a state acknowledges an act or status of another state or government
*'''Paradiplomacy:''' the international relations conducted by subnational, regional, local or non-central governments

===Important Figures===

===Timeline===

==Course Roster==
*--[[User:Jolie|Jolie]] 22:22, 9 October 2008 (UTC)

==Professorship==
* [[User:Dr_Denelder|Dr. Jason Denelder]] - For questions, concerns, discussion, or comment, please use my [[User talk:Dr_Denelder|talk page]] or email me at jason.denelder@yahoo.com.

[[Category:History]]
[[Category:Introductions]]</text>
      <sha1>559umvrrzgrs2up1umxnbtusctdewxn</sha1>
    </revision>
  </page>
  <page>
    <title>Wikiversity talk:Main Page/News</title>
    <ns>5</ns>
    <id>67093</id>
    <revision>
      <id>2809745</id>
      <parentid>2809090</parentid>
      <timestamp>2026-05-16T20:17:42Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <minor />
      <comment>Codename Noreste moved page [[Talk:Main Page/News]] to [[Wikiversity talk:Main Page/News]]: To maintain consistency with the other Main Page templates.</comment>
      <origin>2809090</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="11960" sha1="b21s689fhahqu7thagvorvcfhgi6c1n" xml:space="preserve">=== Semi ===

Should this page be full protected? Obviously all the custodians should have it watchlisted, but no one other than a custodian has ever edited it. [[User:Salmon of Doubt|Salmon of Doubt]] 11:44, 13 September 2008 (UTC)
* The idea of the complex protection system on the various main page templates was to leave this particular page semi-protected only so that ordinary users can add news items. This page should only be fully protected if it becomes a repeated target for vandalism, which is not yet the case. --[[User:McCormack|McCormack]] 12:07, 13 September 2008 (UTC)

== Possible use of dynamicpagelist ==

{{#invoke:DynamicPageList
|show
|category=Completed resources
|namespace=
|count=10
|mode=unordered
|ordermethod=categoryaddlastedit
|orderdate=categoryaddlastdate
|order=descending
}} --[[User:Marshallsumter|Marshallsumter]] ([[User talk:Marshallsumter|discuss]] • [[Special:Contributions/Marshallsumter|contribs]]) 21:19, 16 October 2016 (UTC)

So, if I follow current custom, [[Main Page/News]] would appear something like:

'''2016'''
* '''15 October:''' The new courses [[IT Fundamentals]] and [[Assessing Human Rights]] are completed and ready for students and professionals
* '''15 October:''' The new book chapter [[Motivation and emotion/Book/2016/Emotional hijacking|Emotional hijacking]] is ready for use by psychologists and their students
* '''12 October:''' The Python Programming lessons [[Python Programming/Modules|Modules]] and [[Python Programming/Classes|Classes]] are completed and ready for students
* '''15 August:''' '''Wikiversity celebrates its 10-year anniversary!'''
* '''15 August:''' The fall semester begins for the course [[principles of radiation astronomy]].
* '''8 August:''' The [[ENG 099|open course in conversational American English]] for EFL/ESL/ELL/ESOL students starts.
* '''31 July:''' For [[Wikiversity:Year of Science 2016|'''The Wikimedia Year of Science''']], try using the May 9, 2016 [[w:Transit of Mercury]] to improve the [[Stars/Sun/Locating the Sun|location of the Sun]]. --[[User:Marshallsumter|Marshallsumter]] ([[User talk:Marshallsumter|discuss]] • [[Special:Contributions/Marshallsumter|contribs]]) 21:22, 16 October 2016 (UTC)

::I'm confused. You wrote that &quot;It would be great to have five to six things to put in the news each week instead of five to six for three to four months!&quot; Are you also wanting to maintain this manually rather than using DynamicPageList to do the updates automatically? If you are working manually, there is no reason to list IT Fundamentals again, as it is only on the DynamicPageList due to vandalism. -- [[User:Dave Braunschweig|Dave Braunschweig]] ([[User talk:Dave Braunschweig|discuss]] • [[Special:Contributions/Dave Braunschweig|contribs]]) 23:40, 16 October 2016 (UTC)

:::Originally I was intending to try to maintain this subpage manually. Your use of dynamicpagelist suggests that at least this part could be automated. But there appears to be no easy way to include what the resources are, their approximate dates of completion and intended targets. I also wanted to include those News items that are not in that specific category. Combining the two in an automated way would really be great! --[[User:Marshallsumter|Marshallsumter]] ([[User talk:Marshallsumter|discuss]] • [[Special:Contributions/Marshallsumter|contribs]]) 02:11, 17 October 2016 (UTC)

==Earlier unannounced completed resources==

These would currently have been updated or improved:
{{div col|colwidth=12em}}
{{#invoke:DynamicPageList
|show
|category=Completed resources
|namespace=
|count=10
|mode=unordered
|ordermethod=categoryaddlastedit
|orderdate=categoryaddlastdate
|order=descending
}}
{{Div col end}} --[[User:Marshallsumter|Marshallsumter]] ([[User talk:Marshallsumter|discuss]] • [[Special:Contributions/Marshallsumter|contribs]]) 21:54, 25 June 2017 (UTC)

# [[Mathematical Properties]] was announced on 20 January 2018,
# [[Internet Protocol Analysis]] was announced on 15 March 2019,
# [[Overcoming Hate]] was announced on 9 July 2019,
# [[Unleashing Creativity]] was announced on 2 July 2019,
# [[Candor]] was announced on 28 June 2019,
# [[Exploring Social Constructs]] was announced on 31 May 2019,
# [[Applied Programming]] was announced on 17 May 2018,
# [[Finding Courage]] was announced on 17 April 2019,
# [[Moral Reasoning]] was announced on 14 April 2019,
# [[Coping with Ego]] was announced on 17 March 2019,
# [[Resolving Anger]] was announced on 1 February 2019,
# [[Communicating Power]] was announced on 29 January 2019,
# [[What you can change and what you cannot]] was announced on 28 January 2019,
# [[Recognizing Emotions]] was announced on 25 January 2019,
# [[Appraising Emotional Responses]] was announced on 24 January 2019, and
# [[Open Source 3-D Printing]] was announced on 20 January 2019. --[[User:Marshallsumter|Marshallsumter]] ([[User talk:Marshallsumter|discuss]] • [[Special:Contributions/Marshallsumter|contribs]]) 01:35, 15 September 2019 (UTC)

== COVID-19 COBOL programmer shortage? ==

&lt;blockquote&gt;COVID-19 COBOL programmer shortage&lt;/blockquote&gt;
Where can I find information about this topic (from 12 April news item)? Thanks in advance. [[User:Ottawahitech|Ottawahitech]] ([[User talk:Ottawahitech|discuss]] • [[Special:Contributions/Ottawahitech|contribs]]) 19:13, 21 April 2020 (UTC)
:{{Ping|Ottawahitech}} There's quite a bit you can learn with a search engine. Just from my cursory following of the news, I know that the problem is particularly acute in New Jersey in the banking industry. If you're interested in learning, you may want to track down *How to Learn COBOL in 21 Days*, which is free online. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 21:28, 21 April 2020 (UTC)
:{{At|Ottawahitech}} A long list of additional resources are included at [[Talk:COBOL]]. -- [[User:Dave Braunschweig|Dave Braunschweig]] ([[User talk:Dave Braunschweig|discuss]] • [[Special:Contributions/Dave Braunschweig|contribs]]) 23:29, 21 April 2020 (UTC)
::{{At|Koavf|Dave Braunschweig}} actually there is a story behind my question. Back in 2011 I was trying to insert information into a Bank of America article and was meeting a [https://en.wikipedia.org/w/index.php?oldid=436375222&amp;title=Talk%3ABank_of_America#The_suicide_of_Kevin_Flanagan lot of resistance], even though at the time the information was documented on another Wikipedia article where I first learned about it. The information was about a computer programmer who committed suicide in front of one of Bank of America's properties. According to the the article, he was despondent after losing his job at Bofa, which went to H1B workers. Flanagn and his layed off coleauges all of whom lost their jobs were tasked with training their replacements. 
::To make a long story short, there were two persistent editors guarding information on the Bofa article, and  I eventually moved on to other areas. Those two kept the story out of wikipedia, and months or even years later I found out that the article about Flanagan himself disappreaed as well. Since then I am skeptical about claims  of a  shortage of skilled people made by employers without the corresponding verifiable reliable sources showing a shortage actually exists. Maybe that's just me? [[User:Ottawahitech|Ottawahitech]] ([[User talk:Ottawahitech|discuss]] • [[Special:Contributions/Ottawahitech|contribs]]) 02:24, 22 April 2020 (UTC)
:::{{ping|Ottawahitech}} Well, that certainly escalated quickly. Without getting into the specifics of any editing disputes from the past or possible criminal disappearances, etc. it seems like your main question is, &quot;Are there ''really'' a shortage of COBOL specialists?&quot; and the answer is 100% yes. This has been a known problem for well over a decade (likely longer) and if you want evidence of that, I would recommend looking at job listings to see how much a company will pay someone with COBOL knowledge versus (e.g.) Python or C+. Having proficiency and especially experience in COBOL is a good way to make money in programming. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 02:37, 22 April 2020 (UTC)

:::{{At|Ottawahitech}} I'm sorry, but for me this approach crosses the line. I have recommended that you move on from past incidents on other Wikimedia projects.[https://en.wikiversity.org/w/index.php?title=User_talk%3AOttawahitech&amp;type=revision&amp;diff=2141168&amp;oldid=2137899] I have strongly encouraged you to move on from past incidents on other Wikimedia projects. I am now warning you to move on from past incidents on other Wikimedia projects. Wikiversity's [[Wikiversity:Mission|mission]] is to create and host a range of learning projects and learning resources. You need to find a way to contribute to this mission that doesn't involve past edits elsewhere. -- [[User:Dave Braunschweig|Dave Braunschweig]] ([[User talk:Dave Braunschweig|discuss]] • [[Special:Contributions/Dave Braunschweig|contribs]]) 03:01, 22 April 2020 (UTC)

== Finding Common Ground ==

The course [[Finding Common Ground]] is now complete. May I add it to the news myself or is there some other way to have it added? Thanks. --[[User:Lbeaumont|Lbeaumont]] ([[User talk:Lbeaumont|discuss]] • [[Special:Contributions/Lbeaumont|contribs]]) 01:40, 14 March 2022 (UTC)

:I've added an announcement of your course's completion to Main Page News, please modify if you wish. --[[User:Marshallsumter|Marshallsumter]] ([[User talk:Marshallsumter|discuss]] • [[Special:Contributions/Marshallsumter|contribs]]) 05:16, 14 March 2022 (UTC)
::Thanks! [[User:Lbeaumont|Lbeaumont]] ([[User talk:Lbeaumont|discuss]] • [[Special:Contributions/Lbeaumont|contribs]]) 11:50, 14 March 2022 (UTC)

== bug ==

January 5, 2023 is after December 25, 2023??? [[Special:Contributions/79.185.141.205|79.185.141.205]] ([[User talk:79.185.141.205|discuss]])
:fixed, thanks for bringing this up. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 22:30, 6 January 2024 (UTC)

=== another bug ===


March 6, 2024 is after December 5, 2024??? [[Special:Contributions/109.243.1.105|109.243.1.105]] ([[User talk:109.243.1.105|discuss]])
:Fixed. I'll try to be more attentive to this page. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 19:10, 18 July 2025 (UTC)

==noinclude==
{{ping|Dave Braunschweig}} I suppose, the offending &lt;code&gt;&lt;nowiki&gt;&lt;/noinclude&gt;&lt;/nowiki&gt;&lt;/code&gt; on the Main Page comes from here. --[[User:Watchduck|Watchduck]] &lt;small&gt;([[User talk:Watchduck|quack]])&lt;/small&gt; 21:22, 8 December 2024 (UTC)

:Thanks for the watchful eye {{ping|Watchduck}} I've fixed it up. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 21:45, 8 December 2024 (UTC)

== write news? ==

here? @[[User:Koavf|Koavf]] [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 22:10, 13 May 2026 (UTC)

:If you are serious about writing news here, I recommend getting together other Wikinews editors (including me: I'm happy to help) to organize at [[School:Journalism]], plan out what we want to do, present any radical proposals (like wholesale rehosting Wikinews here) to the community, and then starting the process of regularly writing news stories if the community agrees to include hosting citizen journalism here as an ongoing activity. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:21, 14 May 2026 (UTC)</text>
      <sha1>b21s689fhahqu7thagvorvcfhgi6c1n</sha1>
    </revision>
  </page>
  <page>
    <title>Wikiversity:Request custodian action</title>
    <ns>4</ns>
    <id>75745</id>
    <revision>
      <id>2809682</id>
      <parentid>2809013</parentid>
      <timestamp>2026-05-16T19:14:42Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Dan Polansky */ archive to [[Wikiversity:Request custodian action/Archive/29#Dan Polansky]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809682</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="41112" sha1="j9496a0jb1okduueyst5tvaisap29yt" xml:space="preserve">{{/Header}}

== Sidewide count.js ==

i would like something like: [[Template:User contrib count/count.js]]. i created [[Template:User contrib count]] and a user/common.js. {{User contrib count}}.&lt;br&gt;&lt;br&gt; so a &quot;count.js&quot; would complete it. See [[User:Harold Foppele/common.js]].
If an Administrator could help please. Cheers [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 19:22, 18 January 2026 (UTC)

== need to add my profile ==

im trying to add new profile content  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:03, 4 February 2026 (UTC)

:You can edit it now. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:05, 4 February 2026 (UTC)
::where can create a new one [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)
:::i have created and its in sandbox. i would like to know when it will be approved  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 19:38, 4 February 2026 (UTC)
::::Please don’t create [[wv:spam|spam]] pages as it will be deleted. Please also read [[WV:Scope]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 04:01, 5 February 2026 (UTC)

== Im trying to add new profile while add content its shows not alowed ==

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Exceeded New Page Limit

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)

== New User: cannot create talk page ==

Hi, I am a new user of Wikiversity and I wanted to create a talk page for the article [[ChatGPT's Essay on Kohlberg's Theory: AI's Use in Academic Writing]]. As a new user, I was barred from performing this action. The text that I wanted to add to the talk page is:

&lt;blockquote&gt;
I have doubts as to to the reliability of this essay. Take for rexample the sentence:

&lt;blockquote&gt;
Due to its efficiency, AI has saved 380,000-403,000 lives per year in European healthcare as reported in a recent Deloitte and MedTech Europe report&lt;ref&gt;Dantas, C., Mackiewicz, K., Tageo, V., Jacucci, G., Guardado, D., Ortet, S., Varlamis, I., Maniadakis, M., De Lera, E., Quintas, J., Kocsis, O., &amp; Vassiliou, C. (2021). Benefits and hurdles of AI in the workplace – what comes next? ''International Journal of Artificial Intelligence and Expert Systems, 10'', 9-17. https://www.researchgate.net/publication/351993615_Benefits_and_Hurdles_of_AI_In_The_Workplace_-What_Comes_Next&lt;/ref&gt;.
&lt;/blockquote&gt;

Reading the reference (freely available on ResearchGate), one notes:

# that the reference is from 2021 (predating the widespread use of LLMs such as ChatGPT and the associated 'AI' boom), and
# that the reference factually contradicts this essay.

Quoting from the reference:

&lt;blockquote&gt;
There are enormous benefits of applying AI-based solutions to monitor workers’ health and prevent accidents or, currently, COVID-19 infections, and those benefits are reported with enormous potential. According to the recent Deloitte and MedTech Europe report [11], implementing AI in European healthcare systems could save up 380,000 to 403,000 lives annually or €170.9 to 212.4 billion per year.
&lt;/blockquote&gt;

Not that the reference says ''could save'', not ''saves'' as in the essay.

This calls into question the reliability of the essay.

&lt;/blockquote&gt;

Could an administrator make this addition for me? Thank you! 
{{reflist}}
[[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 06:53, 5 February 2026 (UTC)

:@[[User:Æolus|Æolus]] I have added it for you, you can change the header and sign it now. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 08:05, 5 February 2026 (UTC)
::Thank you! [[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 12:43, 5 February 2026 (UTC)

== Disallowed to add a page on a course ==

I'm trying to populate a newly created course on Wikiversity, but it blocks me from creating more pages with &quot;New User Exceeded New Page Limit&quot;. Could this be lifted please? [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 13:21, 15 February 2026 (UTC)

:Sorry! Never mind. I was trying to create a new article instead of a new page. All good now. [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 14:03, 15 February 2026 (UTC)

== Harold Foppele adding LLM-generated nonsense and personal fiction ==

I became aware of [[User:Harold Foppele]]'s editing after I deleted some of his uploads on Commons. He appears to be adding a large amount of text and images that are some combination of personal fiction and LLM-generated nonsense. This includes:
*[[Quantum Ultra fast lasers#Future thought experiment|Personal speculative fiction]] in an otherwise &quot;nonfiction&quot; article
*Uploading nonsense LLM-created [[:File:Rontosecond pulse laser (Schematic).jpg|diagrams]] and [[:File:Rontosecond pulse laser (Futuristic).jpg|renders]] for nonexistent lab equipment, with fake source (on Commons, he indicated these files as having been created by him using an LLM)
*Uploading nonsense LLM-created images of equations with obvious artifacts. These images, such as [[:File:Redfield equation (non-Markovian).png]] and [[:File:Lindblad equation (Markovian).png]], don't even match the text he puts them with.
Much of his writing is also of extremely poor quality, to the point where it's not clear whether it's written by him or an LLM. I'm not an active editor on this project, so I'm not as familiar with the standards here, but I believe this is worth custodian attention. [[User:Pi.1415926535|Pi.1415926535]] ([[User talk:Pi.1415926535|discuss]] • [[Special:Contributions/Pi.1415926535|contribs]]) 03:06, 23 February 2026 (UTC)

:Fake source ''and'' contradictory copyright info, claiming both public domain and CC license. Moreover, if they are indeed nearly-direct LLM output, depending on jurisdiction they may not even be eligible for copyright.
:I've put speedy deletion marks for the equations, because they're obviously not coherent mathematical equations (the parentheses don't match, the symbols merge into each other the way text in image models often do, etc) [[User:Sesquilinear|Sesquilinear]] ([[User talk:Sesquilinear|discuss]] • [[Special:Contributions/Sesquilinear|contribs]]) 21:50, 7 March 2026 (UTC)

== Repeated removal of RFD notices by Harold Foppele ==

{{User|Harold Foppele }}

This editor is appearing in multiple noticeboards for behaviour which is contentious. Ther latest adventure is the repeated removal of tye RFD notice at [[Quantum/Henry C. Kapteyn]]. You will see from their contributions record the number of times. I have warned Tham on their user tag page that this is tantaomunt to volunteering to be blocked here. They have a track record of achieving blocks on enWiki and Commons already.

They have all the appearance of shooting not to understand when given direct information about their behaviour, whichever project they are editing, and are fast becoming a time sink. Their behaviour across multiple WMF sites may well lead to a Global Lock, but I do not believe they have quite reached the threshold for that.

I believe that what is required is a preventative block to seek to ensure thatchy understand the seriousness of their behaviour, and the need to be collegial. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 23:03, 4 March 2026 (UTC)
: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:45, 8 March 2026 (UTC)

== Blocks for sockpuppet ==

Please block [[User:Harold Foppele]] and [[User:Johnwilliamsiii]] for sockpuppetry based on [https://en.wikipedia.org/wiki/Wikipedia:Sockpuppet_investigations/Harold_Foppele en wiki] CU and [https://commons.wikimedia.org/w/index.php?diff=1177465640 commons] CU investigations. The user has also violated copyright, see the above discussion. A block is necessary to prevent further abuse. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:30, 8 March 2026 (UTC)

:&lt;small&gt;@[[User:MathXplore|MathXplore]]&lt;/small&gt; [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:31, 8 March 2026 (UTC)
:: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:44, 8 March 2026 (UTC)
:CC. @[[User:Timtrent|Timtrent]], @[[User:Sesquilinear|Sesquilinear]], @[[User:Pi.1415926535|Pi.1415926535]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:33, 8 March 2026 (UTC)
::Thank you for the ping. I concur based on [[w:en:WP:DUCK|behaviour]]. CUs appear divided. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 11:41, 8 March 2026 (UTC)

== Problem when trying to start a discussion with authors of the Plurilingual education portal ==

The authors I wanted to discuss with are called &quot;Project PEP&quot; and my name is Franch Chandler. How can I be allowed to do so ? [[User:French Chandler|French Chandler]] ([[User talk:French Chandler|discuss]] • [[Special:Contributions/French Chandler|contribs]]) 18:25, 16 March 2026 (UTC)

:@[[User:French Chandler|French Chandler]] place your qestion [https://en.wikiversity.org/w/index.php?title=User_talk:Projet_PEP&amp;action=edit into the dialog box] on this link and hit Publish page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:22, 16 March 2026 (UTC)

== Please publish my post ==

My post is about &quot;Every child grows and develops at their own pace, but some may experience challenges that affect their ability to perform everyday tasks. These challenges can include difficulties with fine motor skills, sensory processing, handwriting, feeding, and self-regulation. When these issues are not addressed early, they can impact a child’s confidence, academic performance, and independence.

With the rise of digital healthcare services, '''online physical therapy''' has emerged as a powerful and accessible solution for parents seeking support for their children. This modern approach provides structured, personalized therapy programs that can be accessed from the comfort of home, making it easier for families to ensure consistent care.&quot; [[User:Skyabovetherapy|Skyabovetherapy]] ([[User talk:Skyabovetherapy|discuss]] • [[Special:Contributions/Skyabovetherapy|contribs]]) 12:28, 28 March 2026 (UTC)

:@[[User:Skyabovetherapy|Skyabovetherapy]] Well, you can publish it yourself, Wikiversity is a free environement, where everybody can create educational resources. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 14:11, 29 March 2026 (UTC)
::They actually triggered some abuse filters. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 16:24, 29 March 2026 (UTC)
:I looked at your attempts to add this text and I see a link to one website repeated many times, which reminds me of the misuse of Wikiversity for self-promotion or to increase the importance of the website. It is necessary to remind you here that Wikiversity is not a place for promotion, but a place for education. So if you want to educate, it will not be a problem to create the page without external links with a clearly defined procedure for how people should use it and what to expect from it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:07, 1 April 2026 (UTC)

== New user limit ==

Hi, I am creating an AIPA Method learning resource page. 

I am the author of the linked research, and I hit the “new user limit” and “new page with external link” filters while publishing. 

Here is the link to the page in creation: [https://en.wikiversity.org/w/index.php?title=AIPA_Method&amp;veaction=edit] 

Thank you for your help. 

Best regards, 

Senad Dizdarević [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:19, 30 March 2026 (UTC)

:@[[User:Senad Dizdarević|Senad Dizdarević]] I should admit I dont know, what is &quot;new user limit&quot;, but if filter blocks your page because of certain external link, you may force to save anyway and sometimes it works. It should not work, when the website is blacklisted. As of now, I am not seeing you to save page in main namespace, so try to save it without external links first. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:30, 30 March 2026 (UTC)
::Thank you, you are very kind. 
::I will wait a day, and try again (without links, too). 
::Today, I already created About Me info page, and maybe that is enough for the filters for one day.  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:53, 30 March 2026 (UTC)
:::Well, I have analyzed your contribution to Wikiversity and I should point out here, that this project is not a place for advertising, so there is no way of promoting your books and authority this way. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:56, 1 April 2026 (UTC)
::::Hi, my About Me page is just an info page with the neutral as possible presentation of my work. 
::::There is a big difference between informing and advertising. Informing is neutrally stating that something exists and requiring no action, while advertising is a special communication form with intent to cause certain action from readers. For example, click here, click there, order this, buy that. 
::::There is no such intention, form, or terms on my info page. Just neutral information. I don't hide and I am not ashamed that I am write and author, and that is a part of the usual bio, including works. I checked your user page: &quot;I graduated from the Czech University of Life Sciences in Prague and studied information science at the Faculty of Arts of Charles University.&quot; I think that if you had written a book on Life Science, you would have mentioned that as well.
::::Most of the Info page is about my research and AIPA Method which is a valid contribution to psychology, consciousness studies, identity theory, and personality development. Actually, my paper '''AIPA Method: A Cognitive-Phenomenological Model for Identity Reconstruction and Stabilization in Pure Awareness''' is now in the peer review procedure at Journal of Consciousness Studies. 
::::Here is a part from the Wikiversity AIPA Method page in creation (waiting for the end of the time limit for new users):    [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:47, 2 April 2026 (UTC)
:::::For the unknown reasons, the form didn't publish my second part of the message: 
:::::I believe this is a valid contribution to Wikiversity. 
:::::Best Regards, 
:::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:52, 2 April 2026 (UTC)
::::::And the third try: 
:::::: == Introduction ==
::::::The AIPA Method addresses a gap in contemporary personal development and consciousness science: most evidence‑based approaches (CBT, MBSR, MBCT, standard meditation) operate at the level of mental content—reframing thoughts, observing them, or reducing their impact—rather than at the level of identity structure. In contrast, AIPA targets the structural relationship between the self and the mind, aiming at durable identity reconstruction rooted in Pure Awareness rather than symptom management.
::::::The central research question of the primary AIPA preprint is whether a structured, sequentially staged method can produce permanent identity reconstruction rooted in Pure Awareness, and how such a method compares to established approaches in scope, mechanism, and outcome.
:::::: == Theoretical foundations ==
::::::The AIPA framework is grounded in the cognitive‑phenomenological tradition (e.g., McAdams, Varela, Metzinger, Erikson), contemporary consciousness science on minimal phenomenal experience, and qualitative methods advocacy in psychology. It builds directly on:
::::::* Empirical work on pure awareness and Minimal Phenomenal Experience (MPE), especially Gamma &amp; Metzinger’s large‑scale study of content‑reduced awareness states.
::::::* Metzinger’s proposal of minimal phenomenal experience as an entry point for a minimal unifying model of consciousness.
::::::* Narrative identity and partial‑self models within personality and identity theory.
::::::Within this backdrop, AIPA proposes Pure Awareness as a distinct, operationally specified state that can become a structural ground of identity rather than a transient meditative experience.
:::::: == Experiential empiricism ==
::::::The empirical foundation of the AIPA Method is explicitly first‑person and experiential, combining:
::::::* A 22‑year longitudinal autoethnographic self‑study (2003–2025) documenting partial personality episodes, protocol use, and outcomes.
::::::* A 13‑year prospective verification period with zero self‑reported recurrence of targeted harmful behaviors after a dated stabilization point (1 January 2006).
::::::* A high‑ecological‑validity “stress test” during acute bereavement, used to examine whether non‑reactive awareness remains stable under maximal provocation.
::::::* Two independent practitioner cases (an Amazon‑verified report and a structured questionnaire case) providing preliminary convergent signals across cognitive, emotional, behavioral, and identity dimensions.
::::::All central constructs (Pure Awareness, partial personalities, the Switch, identity stabilization) are operationalized with explicit phenomenological and behavioral criteria intended to enable replication and future third‑person measurement.
::::::I believe this is a valid contribution to Wikiversity. 
::::::Best regards, 
::::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:54, 2 April 2026 (UTC)

== Unable to publish pages  ==

Whenever I try to publish a page with linked sources it gets flagged and says I'm a new user attempting to publish content with outside links. Those outside links are my sources. [[User:Soboyed|Soboyed]] ([[User talk:Soboyed|discuss]] • [[Special:Contributions/Soboyed|contribs]]) 04:52, 2 April 2026 (UTC)

:This restriction is automatically lifted after you have edited for a certain time (I don't recall that time off-hand, but it is not long). This is designed to stop spam. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 04:53, 2 April 2026 (UTC)

== Showing error to publish a Post ==

My  action was constructive, not destructive, please allow to publish it. [[Special:Contributions/&amp;#126;2026-20906-18|&amp;#126;2026-20906-18]] ([[User talk:&amp;#126;2026-20906-18|talk]]) 08:06, 4 April 2026 (UTC)

:Maybe you got caught in a filter. Consider [[Special:CreateAccount|creating an account]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:06, 4 April 2026 (UTC)
:Your edits, [https://en.wikiversity.org/w/index.php?title=Special:AbuseLog&amp;wpSearchUser=%7E2026-20906-18 these ones], seems to have tripped a filter when you tried to create a page on [[Create]] which external links. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 23:58, 4 April 2026 (UTC)
:Have you read my [https://en.wikiversity.org/w/index.php?title=Wikiversity:Request_custodian_action&amp;diff=prev&amp;oldid=2802219 previous reply] to you @[[User:~2026-20906-18|~2026-20906-18]]? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:02, 6 April 2026 (UTC)

== Abuse filters which should be deleted ==

Hi, there are some abuse filters which should probably be deleted.
* [[Special:AbuseFilter/1]] (not needed anymore)
* [[Special:AbuseFilter/2]] (no hits since 2018)
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched)
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives)
* [[Special:AbuseFilter/5]] (no hits since 2023)
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore)
* [[Special:AbuseFilter/17]] (no hits since 2022)
* [[Special:AbuseFilter/19]] (no hits since 2019)
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive)
Thanks. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 03:51, 5 April 2026 (UTC)

:Why do these need to be deleted rather than inactivated? Do inactive abuse filters cause a server strain? —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:39, 5 April 2026 (UTC)
:: Deleted filters do not cause strain to the servers. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:28, 5 April 2026 (UTC)
:These sounds like sensible suggestions but, yes, would inactivation perhaps make more sense than deletion for at least some  filters? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:35, 5 April 2026 (UTC)
:I would keep them @[[User:Codename Noreste|Codename Noreste]]. Alternatively, I would turn off the ones that haven't caught anything for a long time, but I would leave them enabled in case they need to be turned on or improved. If someone has already written the code and we don't have hundreds of free man-hours of programmers on Wikiversity, the server load seems secondary to me, and is negligible compared to other things. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:11, 6 April 2026 (UTC)
:: I know how to write abuse filter code and regex, but I would recommend disabling filters that have never caught anything in a long time ''and'' those who made lots of false positives. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:09, 6 April 2026 (UTC)
:::Of course @[[User:Codename Noreste|Codename Noreste]], there are people here today who are capable of changing the code. But the question is what it will be like in a few years, the question is what will happen if those two are busy for a long time, etc. That's why I would leave it so that those who don't know much about code can be inspired by it and will need to do something with it someday - plus, more code for different types of filtering is actually great educational material on how those filters work. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:41, 17 April 2026 (UTC)

Here's the updated list of abuse filters under review with actions I've taken (several disabled, one basic code improvement, and some actions changed) - none have been deleted so they can all be edited and reactivayed - please suggest any further changes:
* [[Special:AbuseFilter/1]] (not needed anymore) - One time account spam bot - 4 hits over 10 years ago - Disabled in 2024 - May be useful in future
* [[Special:AbuseFilter/2]] (no hits since 2018) - Userspace spamming - 778 hits; none since 2018 likely due to global filters - Now disabled
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched) - Specific user page spam - 1,101 hits most recent 7 March 2026 - Still active - Kept enabled
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives) - Questionable Language (profanity) - 6,055 hits including very recently - However it was logging hits without taking any actions - Edited to reduce likelihood of false positives by only applying filter to users with low (&lt; 20) edit count and applied weak actions to tag and warn but not prevent publishing the content
* [[Special:AbuseFilter/5]] (no hits since 2023) - Blocked Solicitation Links - 95 hits; none since 2023 - blocks specific historical spam sites - Non-active - Now disabled
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore) - Not reviewed - They are currently disabled
* [[Special:AbuseFilter/17]] (no hits since 2022) - Fundamental Physics Edits - 347 hits; none since 2022 - Non-active and very specific for a historical issue - Now disabled 
* [[Special:AbuseFilter/19]] (no hits since 2019) - Page Creation - 20 hits; none since 2019 - Retained for historical reference and possible future updates - Now disabled
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive) - Globally Banned Editor (renamed to Low-edit Spam Monitor) - 2,829 hits including very recent - Only applies to users with less than 5 edits and takes no actions / monitoring only - Reviewing the details of the hits I don't see many false positives and have strengthened its actions to add a tag and warning

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:57, 9 April 2026 (UTC)

== Block request ==

Please block ~2026-20985-80/~2026-21079-90/~2026-21223-88. Reason: Vandalism. [[User:Àncilu|Àncilu]] ([[User talk:Àncilu|discuss]] • [[Special:Contributions/Àncilu|contribs]]) 23:24, 5 April 2026 (UTC)

:All edits should be deleted and the first is blocked by Atcovi. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:33, 6 April 2026 (UTC)

== Antispam - Filter 12 ==
{{ping|Codename Noreste}} Thanks for contacting me with a suggested [[Special:AbuseFilter|abuse filter]] for the coupon spam we've been getting. A very much appreciated time saver. Per your suggestion, abuse filter 12 has been reactivated with your updated regex. It should tag and prevent page creation actions for coupon promo etc. Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:33, 15 April 2026 (UTC)
: @[[User:Jtneill|Jtneill]] Please do the following to filter 12:
:# Enable the block action (temporary for unregistered users, indefinite for registered users)
:# Disable both the disallow and tag actions, since that filter will be set to block
: Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:42, 5 May 2026 (UTC)
::Excellent. Done:
::* Block duration for non-registered users = 1 week
::* Block duration for registered users = indefinite
::* Disallow and tagging disabled
::Thankyou. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:24, 9 May 2026 (UTC)

== Urgent! error message This action has been automatically identified as potentially harmful, and therefore disallowed ==

While submitting the post this error was coming &quot;This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please inform an administrator of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link&quot; How to resolve it?

Here is the content:

{{note|marketing material removed}}

[[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:14, 17 April 2026 (UTC)
: That's because Wikiversity doesn't accept advertising. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 05:20, 17 April 2026 (UTC)
::So this is fine
::'''Online Internship and Digital Learning for Students'''
::Online learning has become an important part of modern education. With the help of the internet and digital tools, students can now study, practice, and gain experience without being physically present in a classroom. One key part of this system is the online internship, which helps students learn real-world skills along with their studies.
::An online internship allows students to work on tasks and projects through digital platforms. This makes learning more practical and useful, especially for those who want to understand how real work environments function.
::'''Background'''
::The concept of online learning developed from distance education, where students learned from remote locations. Over time, with the growth of digital technology, learning has become more interactive and flexible.
::The introduction of the online internship has added another important layer to digital education. It combines theoretical learning with practical experience, helping students prepare for future careers.
::During global events such as the COVID-19 pandemic, online education and online internship programs became essential. They helped students continue learning and gaining experience despite restrictions on physical movement.
::'''Importance of Online Internship'''
::An online internship plays an important role in student development. It helps bridge the gap between academic knowledge and practical skills.
::'''Some key points include:'''
::Students understand how real work is done
::They develop basic professional skills
::It supports career readiness
::It allows learning without location limits
::By participating in an online internship, students can improve their confidence and gain early exposure to different fields.
::'''Features of Online Internship-Based Learning'''
::Modern education platforms often include online internship opportunities as part of their learning system. These usually offer:
::Flexible schedules for students
::Access to learning from home
::Beginner-friendly tasks and projects
::A combination of theory and practice
::Such features make online internship programs suitable for a wide range of learners, including beginners.
::'''Learning Tasks'''
::Explore how online internship programs support student learning in digital environments.
::Identify how students can gain practical experience through an online internship
::Analyze the role of flexible learning in improving student engagement
::Understand how online education and internships work together
::'''References'''
::[https://ijpsl.in/wp-content/uploads/2020/09/E-Learning_Hanaaya-Navaneeth.pdf The Past, Present and Future of E-Learning: Hanaaya Varyani and Navaneeth M S]
::[https://ieeexplore.ieee.org/document/9788102 Current Trends and Future Perspectives of e-Learning in India]
::'''See Also'''
::[https://easyshiksha.com/online_courses/internship Online Internship]
::[https://easyshiksha.com/online_courses/ Online Courses]
::[https://easyshiksha.com/online_courses/kids-learning Kids Learning]
::[https://easyshiksha.com/career_helper/ Career Guidance] [[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:27, 17 April 2026 (UTC)
:::@[[User:EasyshikshaMarketing|EasyshikshaMarketing]] Wikiversity is a resource for education, or a space for education. However, your intention to link to another website is obvious, and such content does not belong here, as it contradicts the purpose of Wikiversity. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:38, 17 April 2026 (UTC)

==AI-generated images==
Seeking your advice.

Myself and students use some AI-generated images in the [[Motivation and emotion]] project.

[[User:Dronebogus]] has been removing some of these images from Wikiversity pages and nominating them for deletion at Commons. As a result, some have been deleted and some have been kept.

Dronebogus has made some useful edits and image suggestions for [[Motivation and emotion]] which I've appreciated and  incorporated. However, there are other edits to remove an AI image by Dronebogus that I've reverted where I think the image is more educational than no image or an alternative image suggested by Dronebogus.

There are a couple of pages where Dronebogus has reverted my reversion, so we are at risk of edit warring. We have briefly discussed and warned each other on our user talk pages, but it seems to come down to a difference in perception about the educational usefulness of the AI images.

So, I'm asking here for others to please review the recent edit histories for these pages:
* [[Motivation and emotion/Lectures/Brain and physiological needs]]
* [[Motivation and emotion/Book/2025/Stockholm syndrome emotion]]

and let us know what you think about the AI image suitability vs. using no image or alternative images suggested by Dronebogus.

Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:45, 26 April 2026 (UTC)

:I think Jtneill needs to try harder to find non-AI alternatives both on Commons and the web. I’m not reiterating the well known problems with generative AI— you can read about those on Wikipedia and the broader Internet. Needless to say it’s kind of just inherently toxic. If you use it, it should be the last resort of last resorts. Just my stance, which I consider perfectly valid and reasonable. [[User:Dronebogus|Dronebogus]] ([[User talk:Dronebogus|discuss]] • [[Special:Contributions/Dronebogus|contribs]]) 04:10, 27 April 2026 (UTC)

== Request for Page Creation Approval - Research on Dr. Ian Stevenson ==


'''Hello Administrators,'''

I am a digital archivist and researcher attempting to create an educational page regarding Dr. Ian Stevenson's scientific work, specifically titled &quot;Where Reincarnation and Biology Intersect&quot; and its official Vietnamese edition.

My edits are purely constructive, aimed at integrating local research context with global structured data (including '''Wikidata Q139548587'''). The automated filter is currently preventing publication due to &quot;new user external link limits.&quot;

I have ensured that all citations, references, and images (sourced from Wikimedia Commons) are strictly academic and non-promotional. Could you please review my contributions and consider whitelisting my account or approving this specific page creation?

Thank you for your assistance in preserving this research '''legacy''' within the open knowledge ecosystem.

'''Best regards,''' [[User:Ian Stevenson777|Ian Stevenson777]] ([[User talk:Ian Stevenson777|discuss]] • [[Special:Contributions/Ian Stevenson777|contribs]]) 07:26, 28 April 2026 (UTC)
: The page title should probably be in English, as this is English Wikiversity. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:19, 28 April 2026 (UTC)
:@[[User:Ian Stevenson777|Ian Stevenson777]] I looked at the text and it seems to me that it is informative, but the user cannot learn anything from it because they would have to buy the book. In this regard, it seems to me that it is enough [[:w:Where Reincarnation and Biology Intersect|to have that article on Wikipedia]] and there is no need to duplicate it here on Wikiversity. If you are particularly interested with its Vietnamese translation, I would focus on Vietnamese Wikipedia, but it seems to me, that the article there [https://vi.wikipedia.org/w/index.php?title=N%C6%A1i_lu%C3%A2n_h%E1%BB%93i_v%C3%A0_sinh_h%E1%BB%8Dc_giao_nhau&amp;oldid=75029095 have some problems at the moment]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:51, 5 May 2026 (UTC)
:This request is AI-generated and was made by a lock evading LTA. Please ignore it. [[User:NguoiDungKhongDinhDanh|NguoiDungKhongDinhDanh]] ([[User talk:NguoiDungKhongDinhDanh|discuss]] • [[Special:Contributions/NguoiDungKhongDinhDanh|contribs]]) 23:58, 13 May 2026 (UTC)

== Call for custodians and bureaucrats ==
&lt;div class=&quot;cd-moveMark&quot;&gt;''Moved to [[Wikiversity:Notices for custodians#Call for custodians and bureaucrats]].  [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 18:46, 12 May 2026 (UTC)''&lt;/div&gt;

== Interface administrator flag request ==

@[[User:Jtneill|Jtneill]], @[[User:Mu301|Mu301]] I am requesting IA flag to delete [[MediaWiki:Gadget-WikiSign.js]]. It was requested for deletion by [[User:Sophivorus|a trusted user]] and I think it can be deleted. Once I delete it, I will notify you and you can remove the flag. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:24, 10 May 2026 (UTC)

:Can you enable two-factor authentication? 
:Policy: [[Wikiversity:Interface administrators]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:27, 10 May 2026 (UTC)
::Done @[[User:Jtneill|Jtneill]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:20, 11 May 2026 (UTC)
:::You are an interface administrator for 24 hours. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:57, 11 May 2026 (UTC)
::::Thx @[[User:Jtneill|Jtneill]], I have just deleted the page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:59, 11 May 2026 (UTC)

== Block request ==

Hi. Please block @[[User:Skibidi Titan 5.0|Skibidi Titan 5.0]]. Reason : Vandalism.

Thanks, [[User:Locpac|Locpac]] ([[User talk:Locpac|discuss]] • [[Special:Contributions/Locpac|contribs]]) 15:10, 10 May 2026 (UTC)

:Thankyou. Done. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 15:25, 10 May 2026 (UTC)


== ~2026-28496-53 ==

Please block [[Special:Contribs/~2026-28496-53]], vandalism. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:02, 11 May 2026 (UTC)

:{{done}} Thank you! —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 17:14, 11 May 2026 (UTC)

== ~2026-28792-52 ==

Please block [[Special:Contribs/~2026-28792-52]], vandalism. Appears to be same user as above. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:38, 12 May 2026 (UTC)
: Blocked locally by Barras. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 17:46, 12 May 2026 (UTC)</text>
      <sha1>j9496a0jb1okduueyst5tvaisap29yt</sha1>
    </revision>
    <revision>
      <id>2809685</id>
      <parentid>2809682</parentid>
      <timestamp>2026-05-16T19:16:24Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Sidewide count.js */ archive to [[Wikiversity:Request custodian action/Archive/30#Sidewide count.js]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809685</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="40638" sha1="iwkadrieneisczgzbbuyakewi4e7xyi" xml:space="preserve">{{/Header}}

== need to add my profile ==

im trying to add new profile content  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:03, 4 February 2026 (UTC)

:You can edit it now. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:05, 4 February 2026 (UTC)
::where can create a new one [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)
:::i have created and its in sandbox. i would like to know when it will be approved  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 19:38, 4 February 2026 (UTC)
::::Please don’t create [[wv:spam|spam]] pages as it will be deleted. Please also read [[WV:Scope]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 04:01, 5 February 2026 (UTC)

== Im trying to add new profile while add content its shows not alowed ==

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Exceeded New Page Limit

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)

== New User: cannot create talk page ==

Hi, I am a new user of Wikiversity and I wanted to create a talk page for the article [[ChatGPT's Essay on Kohlberg's Theory: AI's Use in Academic Writing]]. As a new user, I was barred from performing this action. The text that I wanted to add to the talk page is:

&lt;blockquote&gt;
I have doubts as to to the reliability of this essay. Take for rexample the sentence:

&lt;blockquote&gt;
Due to its efficiency, AI has saved 380,000-403,000 lives per year in European healthcare as reported in a recent Deloitte and MedTech Europe report&lt;ref&gt;Dantas, C., Mackiewicz, K., Tageo, V., Jacucci, G., Guardado, D., Ortet, S., Varlamis, I., Maniadakis, M., De Lera, E., Quintas, J., Kocsis, O., &amp; Vassiliou, C. (2021). Benefits and hurdles of AI in the workplace – what comes next? ''International Journal of Artificial Intelligence and Expert Systems, 10'', 9-17. https://www.researchgate.net/publication/351993615_Benefits_and_Hurdles_of_AI_In_The_Workplace_-What_Comes_Next&lt;/ref&gt;.
&lt;/blockquote&gt;

Reading the reference (freely available on ResearchGate), one notes:

# that the reference is from 2021 (predating the widespread use of LLMs such as ChatGPT and the associated 'AI' boom), and
# that the reference factually contradicts this essay.

Quoting from the reference:

&lt;blockquote&gt;
There are enormous benefits of applying AI-based solutions to monitor workers’ health and prevent accidents or, currently, COVID-19 infections, and those benefits are reported with enormous potential. According to the recent Deloitte and MedTech Europe report [11], implementing AI in European healthcare systems could save up 380,000 to 403,000 lives annually or €170.9 to 212.4 billion per year.
&lt;/blockquote&gt;

Not that the reference says ''could save'', not ''saves'' as in the essay.

This calls into question the reliability of the essay.

&lt;/blockquote&gt;

Could an administrator make this addition for me? Thank you! 
{{reflist}}
[[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 06:53, 5 February 2026 (UTC)

:@[[User:Æolus|Æolus]] I have added it for you, you can change the header and sign it now. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 08:05, 5 February 2026 (UTC)
::Thank you! [[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 12:43, 5 February 2026 (UTC)

== Disallowed to add a page on a course ==

I'm trying to populate a newly created course on Wikiversity, but it blocks me from creating more pages with &quot;New User Exceeded New Page Limit&quot;. Could this be lifted please? [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 13:21, 15 February 2026 (UTC)

:Sorry! Never mind. I was trying to create a new article instead of a new page. All good now. [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 14:03, 15 February 2026 (UTC)

== Harold Foppele adding LLM-generated nonsense and personal fiction ==

I became aware of [[User:Harold Foppele]]'s editing after I deleted some of his uploads on Commons. He appears to be adding a large amount of text and images that are some combination of personal fiction and LLM-generated nonsense. This includes:
*[[Quantum Ultra fast lasers#Future thought experiment|Personal speculative fiction]] in an otherwise &quot;nonfiction&quot; article
*Uploading nonsense LLM-created [[:File:Rontosecond pulse laser (Schematic).jpg|diagrams]] and [[:File:Rontosecond pulse laser (Futuristic).jpg|renders]] for nonexistent lab equipment, with fake source (on Commons, he indicated these files as having been created by him using an LLM)
*Uploading nonsense LLM-created images of equations with obvious artifacts. These images, such as [[:File:Redfield equation (non-Markovian).png]] and [[:File:Lindblad equation (Markovian).png]], don't even match the text he puts them with.
Much of his writing is also of extremely poor quality, to the point where it's not clear whether it's written by him or an LLM. I'm not an active editor on this project, so I'm not as familiar with the standards here, but I believe this is worth custodian attention. [[User:Pi.1415926535|Pi.1415926535]] ([[User talk:Pi.1415926535|discuss]] • [[Special:Contributions/Pi.1415926535|contribs]]) 03:06, 23 February 2026 (UTC)

:Fake source ''and'' contradictory copyright info, claiming both public domain and CC license. Moreover, if they are indeed nearly-direct LLM output, depending on jurisdiction they may not even be eligible for copyright.
:I've put speedy deletion marks for the equations, because they're obviously not coherent mathematical equations (the parentheses don't match, the symbols merge into each other the way text in image models often do, etc) [[User:Sesquilinear|Sesquilinear]] ([[User talk:Sesquilinear|discuss]] • [[Special:Contributions/Sesquilinear|contribs]]) 21:50, 7 March 2026 (UTC)

== Repeated removal of RFD notices by Harold Foppele ==

{{User|Harold Foppele }}

This editor is appearing in multiple noticeboards for behaviour which is contentious. Ther latest adventure is the repeated removal of tye RFD notice at [[Quantum/Henry C. Kapteyn]]. You will see from their contributions record the number of times. I have warned Tham on their user tag page that this is tantaomunt to volunteering to be blocked here. They have a track record of achieving blocks on enWiki and Commons already.

They have all the appearance of shooting not to understand when given direct information about their behaviour, whichever project they are editing, and are fast becoming a time sink. Their behaviour across multiple WMF sites may well lead to a Global Lock, but I do not believe they have quite reached the threshold for that.

I believe that what is required is a preventative block to seek to ensure thatchy understand the seriousness of their behaviour, and the need to be collegial. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 23:03, 4 March 2026 (UTC)
: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:45, 8 March 2026 (UTC)

== Blocks for sockpuppet ==

Please block [[User:Harold Foppele]] and [[User:Johnwilliamsiii]] for sockpuppetry based on [https://en.wikipedia.org/wiki/Wikipedia:Sockpuppet_investigations/Harold_Foppele en wiki] CU and [https://commons.wikimedia.org/w/index.php?diff=1177465640 commons] CU investigations. The user has also violated copyright, see the above discussion. A block is necessary to prevent further abuse. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:30, 8 March 2026 (UTC)

:&lt;small&gt;@[[User:MathXplore|MathXplore]]&lt;/small&gt; [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:31, 8 March 2026 (UTC)
:: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:44, 8 March 2026 (UTC)
:CC. @[[User:Timtrent|Timtrent]], @[[User:Sesquilinear|Sesquilinear]], @[[User:Pi.1415926535|Pi.1415926535]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:33, 8 March 2026 (UTC)
::Thank you for the ping. I concur based on [[w:en:WP:DUCK|behaviour]]. CUs appear divided. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 11:41, 8 March 2026 (UTC)

== Problem when trying to start a discussion with authors of the Plurilingual education portal ==

The authors I wanted to discuss with are called &quot;Project PEP&quot; and my name is Franch Chandler. How can I be allowed to do so ? [[User:French Chandler|French Chandler]] ([[User talk:French Chandler|discuss]] • [[Special:Contributions/French Chandler|contribs]]) 18:25, 16 March 2026 (UTC)

:@[[User:French Chandler|French Chandler]] place your qestion [https://en.wikiversity.org/w/index.php?title=User_talk:Projet_PEP&amp;action=edit into the dialog box] on this link and hit Publish page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:22, 16 March 2026 (UTC)

== Please publish my post ==

My post is about &quot;Every child grows and develops at their own pace, but some may experience challenges that affect their ability to perform everyday tasks. These challenges can include difficulties with fine motor skills, sensory processing, handwriting, feeding, and self-regulation. When these issues are not addressed early, they can impact a child’s confidence, academic performance, and independence.

With the rise of digital healthcare services, '''online physical therapy''' has emerged as a powerful and accessible solution for parents seeking support for their children. This modern approach provides structured, personalized therapy programs that can be accessed from the comfort of home, making it easier for families to ensure consistent care.&quot; [[User:Skyabovetherapy|Skyabovetherapy]] ([[User talk:Skyabovetherapy|discuss]] • [[Special:Contributions/Skyabovetherapy|contribs]]) 12:28, 28 March 2026 (UTC)

:@[[User:Skyabovetherapy|Skyabovetherapy]] Well, you can publish it yourself, Wikiversity is a free environement, where everybody can create educational resources. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 14:11, 29 March 2026 (UTC)
::They actually triggered some abuse filters. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 16:24, 29 March 2026 (UTC)
:I looked at your attempts to add this text and I see a link to one website repeated many times, which reminds me of the misuse of Wikiversity for self-promotion or to increase the importance of the website. It is necessary to remind you here that Wikiversity is not a place for promotion, but a place for education. So if you want to educate, it will not be a problem to create the page without external links with a clearly defined procedure for how people should use it and what to expect from it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:07, 1 April 2026 (UTC)

== New user limit ==

Hi, I am creating an AIPA Method learning resource page. 

I am the author of the linked research, and I hit the “new user limit” and “new page with external link” filters while publishing. 

Here is the link to the page in creation: [https://en.wikiversity.org/w/index.php?title=AIPA_Method&amp;veaction=edit] 

Thank you for your help. 

Best regards, 

Senad Dizdarević [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:19, 30 March 2026 (UTC)

:@[[User:Senad Dizdarević|Senad Dizdarević]] I should admit I dont know, what is &quot;new user limit&quot;, but if filter blocks your page because of certain external link, you may force to save anyway and sometimes it works. It should not work, when the website is blacklisted. As of now, I am not seeing you to save page in main namespace, so try to save it without external links first. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:30, 30 March 2026 (UTC)
::Thank you, you are very kind. 
::I will wait a day, and try again (without links, too). 
::Today, I already created About Me info page, and maybe that is enough for the filters for one day.  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:53, 30 March 2026 (UTC)
:::Well, I have analyzed your contribution to Wikiversity and I should point out here, that this project is not a place for advertising, so there is no way of promoting your books and authority this way. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:56, 1 April 2026 (UTC)
::::Hi, my About Me page is just an info page with the neutral as possible presentation of my work. 
::::There is a big difference between informing and advertising. Informing is neutrally stating that something exists and requiring no action, while advertising is a special communication form with intent to cause certain action from readers. For example, click here, click there, order this, buy that. 
::::There is no such intention, form, or terms on my info page. Just neutral information. I don't hide and I am not ashamed that I am write and author, and that is a part of the usual bio, including works. I checked your user page: &quot;I graduated from the Czech University of Life Sciences in Prague and studied information science at the Faculty of Arts of Charles University.&quot; I think that if you had written a book on Life Science, you would have mentioned that as well.
::::Most of the Info page is about my research and AIPA Method which is a valid contribution to psychology, consciousness studies, identity theory, and personality development. Actually, my paper '''AIPA Method: A Cognitive-Phenomenological Model for Identity Reconstruction and Stabilization in Pure Awareness''' is now in the peer review procedure at Journal of Consciousness Studies. 
::::Here is a part from the Wikiversity AIPA Method page in creation (waiting for the end of the time limit for new users):    [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:47, 2 April 2026 (UTC)
:::::For the unknown reasons, the form didn't publish my second part of the message: 
:::::I believe this is a valid contribution to Wikiversity. 
:::::Best Regards, 
:::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:52, 2 April 2026 (UTC)
::::::And the third try: 
:::::: == Introduction ==
::::::The AIPA Method addresses a gap in contemporary personal development and consciousness science: most evidence‑based approaches (CBT, MBSR, MBCT, standard meditation) operate at the level of mental content—reframing thoughts, observing them, or reducing their impact—rather than at the level of identity structure. In contrast, AIPA targets the structural relationship between the self and the mind, aiming at durable identity reconstruction rooted in Pure Awareness rather than symptom management.
::::::The central research question of the primary AIPA preprint is whether a structured, sequentially staged method can produce permanent identity reconstruction rooted in Pure Awareness, and how such a method compares to established approaches in scope, mechanism, and outcome.
:::::: == Theoretical foundations ==
::::::The AIPA framework is grounded in the cognitive‑phenomenological tradition (e.g., McAdams, Varela, Metzinger, Erikson), contemporary consciousness science on minimal phenomenal experience, and qualitative methods advocacy in psychology. It builds directly on:
::::::* Empirical work on pure awareness and Minimal Phenomenal Experience (MPE), especially Gamma &amp; Metzinger’s large‑scale study of content‑reduced awareness states.
::::::* Metzinger’s proposal of minimal phenomenal experience as an entry point for a minimal unifying model of consciousness.
::::::* Narrative identity and partial‑self models within personality and identity theory.
::::::Within this backdrop, AIPA proposes Pure Awareness as a distinct, operationally specified state that can become a structural ground of identity rather than a transient meditative experience.
:::::: == Experiential empiricism ==
::::::The empirical foundation of the AIPA Method is explicitly first‑person and experiential, combining:
::::::* A 22‑year longitudinal autoethnographic self‑study (2003–2025) documenting partial personality episodes, protocol use, and outcomes.
::::::* A 13‑year prospective verification period with zero self‑reported recurrence of targeted harmful behaviors after a dated stabilization point (1 January 2006).
::::::* A high‑ecological‑validity “stress test” during acute bereavement, used to examine whether non‑reactive awareness remains stable under maximal provocation.
::::::* Two independent practitioner cases (an Amazon‑verified report and a structured questionnaire case) providing preliminary convergent signals across cognitive, emotional, behavioral, and identity dimensions.
::::::All central constructs (Pure Awareness, partial personalities, the Switch, identity stabilization) are operationalized with explicit phenomenological and behavioral criteria intended to enable replication and future third‑person measurement.
::::::I believe this is a valid contribution to Wikiversity. 
::::::Best regards, 
::::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:54, 2 April 2026 (UTC)

== Unable to publish pages  ==

Whenever I try to publish a page with linked sources it gets flagged and says I'm a new user attempting to publish content with outside links. Those outside links are my sources. [[User:Soboyed|Soboyed]] ([[User talk:Soboyed|discuss]] • [[Special:Contributions/Soboyed|contribs]]) 04:52, 2 April 2026 (UTC)

:This restriction is automatically lifted after you have edited for a certain time (I don't recall that time off-hand, but it is not long). This is designed to stop spam. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 04:53, 2 April 2026 (UTC)

== Showing error to publish a Post ==

My  action was constructive, not destructive, please allow to publish it. [[Special:Contributions/&amp;#126;2026-20906-18|&amp;#126;2026-20906-18]] ([[User talk:&amp;#126;2026-20906-18|talk]]) 08:06, 4 April 2026 (UTC)

:Maybe you got caught in a filter. Consider [[Special:CreateAccount|creating an account]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:06, 4 April 2026 (UTC)
:Your edits, [https://en.wikiversity.org/w/index.php?title=Special:AbuseLog&amp;wpSearchUser=%7E2026-20906-18 these ones], seems to have tripped a filter when you tried to create a page on [[Create]] which external links. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 23:58, 4 April 2026 (UTC)
:Have you read my [https://en.wikiversity.org/w/index.php?title=Wikiversity:Request_custodian_action&amp;diff=prev&amp;oldid=2802219 previous reply] to you @[[User:~2026-20906-18|~2026-20906-18]]? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:02, 6 April 2026 (UTC)

== Abuse filters which should be deleted ==

Hi, there are some abuse filters which should probably be deleted.
* [[Special:AbuseFilter/1]] (not needed anymore)
* [[Special:AbuseFilter/2]] (no hits since 2018)
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched)
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives)
* [[Special:AbuseFilter/5]] (no hits since 2023)
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore)
* [[Special:AbuseFilter/17]] (no hits since 2022)
* [[Special:AbuseFilter/19]] (no hits since 2019)
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive)
Thanks. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 03:51, 5 April 2026 (UTC)

:Why do these need to be deleted rather than inactivated? Do inactive abuse filters cause a server strain? —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:39, 5 April 2026 (UTC)
:: Deleted filters do not cause strain to the servers. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:28, 5 April 2026 (UTC)
:These sounds like sensible suggestions but, yes, would inactivation perhaps make more sense than deletion for at least some  filters? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:35, 5 April 2026 (UTC)
:I would keep them @[[User:Codename Noreste|Codename Noreste]]. Alternatively, I would turn off the ones that haven't caught anything for a long time, but I would leave them enabled in case they need to be turned on or improved. If someone has already written the code and we don't have hundreds of free man-hours of programmers on Wikiversity, the server load seems secondary to me, and is negligible compared to other things. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:11, 6 April 2026 (UTC)
:: I know how to write abuse filter code and regex, but I would recommend disabling filters that have never caught anything in a long time ''and'' those who made lots of false positives. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:09, 6 April 2026 (UTC)
:::Of course @[[User:Codename Noreste|Codename Noreste]], there are people here today who are capable of changing the code. But the question is what it will be like in a few years, the question is what will happen if those two are busy for a long time, etc. That's why I would leave it so that those who don't know much about code can be inspired by it and will need to do something with it someday - plus, more code for different types of filtering is actually great educational material on how those filters work. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:41, 17 April 2026 (UTC)

Here's the updated list of abuse filters under review with actions I've taken (several disabled, one basic code improvement, and some actions changed) - none have been deleted so they can all be edited and reactivayed - please suggest any further changes:
* [[Special:AbuseFilter/1]] (not needed anymore) - One time account spam bot - 4 hits over 10 years ago - Disabled in 2024 - May be useful in future
* [[Special:AbuseFilter/2]] (no hits since 2018) - Userspace spamming - 778 hits; none since 2018 likely due to global filters - Now disabled
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched) - Specific user page spam - 1,101 hits most recent 7 March 2026 - Still active - Kept enabled
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives) - Questionable Language (profanity) - 6,055 hits including very recently - However it was logging hits without taking any actions - Edited to reduce likelihood of false positives by only applying filter to users with low (&lt; 20) edit count and applied weak actions to tag and warn but not prevent publishing the content
* [[Special:AbuseFilter/5]] (no hits since 2023) - Blocked Solicitation Links - 95 hits; none since 2023 - blocks specific historical spam sites - Non-active - Now disabled
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore) - Not reviewed - They are currently disabled
* [[Special:AbuseFilter/17]] (no hits since 2022) - Fundamental Physics Edits - 347 hits; none since 2022 - Non-active and very specific for a historical issue - Now disabled 
* [[Special:AbuseFilter/19]] (no hits since 2019) - Page Creation - 20 hits; none since 2019 - Retained for historical reference and possible future updates - Now disabled
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive) - Globally Banned Editor (renamed to Low-edit Spam Monitor) - 2,829 hits including very recent - Only applies to users with less than 5 edits and takes no actions / monitoring only - Reviewing the details of the hits I don't see many false positives and have strengthened its actions to add a tag and warning

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:57, 9 April 2026 (UTC)

== Block request ==

Please block ~2026-20985-80/~2026-21079-90/~2026-21223-88. Reason: Vandalism. [[User:Àncilu|Àncilu]] ([[User talk:Àncilu|discuss]] • [[Special:Contributions/Àncilu|contribs]]) 23:24, 5 April 2026 (UTC)

:All edits should be deleted and the first is blocked by Atcovi. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:33, 6 April 2026 (UTC)

== Antispam - Filter 12 ==
{{ping|Codename Noreste}} Thanks for contacting me with a suggested [[Special:AbuseFilter|abuse filter]] for the coupon spam we've been getting. A very much appreciated time saver. Per your suggestion, abuse filter 12 has been reactivated with your updated regex. It should tag and prevent page creation actions for coupon promo etc. Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:33, 15 April 2026 (UTC)
: @[[User:Jtneill|Jtneill]] Please do the following to filter 12:
:# Enable the block action (temporary for unregistered users, indefinite for registered users)
:# Disable both the disallow and tag actions, since that filter will be set to block
: Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:42, 5 May 2026 (UTC)
::Excellent. Done:
::* Block duration for non-registered users = 1 week
::* Block duration for registered users = indefinite
::* Disallow and tagging disabled
::Thankyou. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:24, 9 May 2026 (UTC)

== Urgent! error message This action has been automatically identified as potentially harmful, and therefore disallowed ==

While submitting the post this error was coming &quot;This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please inform an administrator of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link&quot; How to resolve it?

Here is the content:

{{note|marketing material removed}}

[[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:14, 17 April 2026 (UTC)
: That's because Wikiversity doesn't accept advertising. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 05:20, 17 April 2026 (UTC)
::So this is fine
::'''Online Internship and Digital Learning for Students'''
::Online learning has become an important part of modern education. With the help of the internet and digital tools, students can now study, practice, and gain experience without being physically present in a classroom. One key part of this system is the online internship, which helps students learn real-world skills along with their studies.
::An online internship allows students to work on tasks and projects through digital platforms. This makes learning more practical and useful, especially for those who want to understand how real work environments function.
::'''Background'''
::The concept of online learning developed from distance education, where students learned from remote locations. Over time, with the growth of digital technology, learning has become more interactive and flexible.
::The introduction of the online internship has added another important layer to digital education. It combines theoretical learning with practical experience, helping students prepare for future careers.
::During global events such as the COVID-19 pandemic, online education and online internship programs became essential. They helped students continue learning and gaining experience despite restrictions on physical movement.
::'''Importance of Online Internship'''
::An online internship plays an important role in student development. It helps bridge the gap between academic knowledge and practical skills.
::'''Some key points include:'''
::Students understand how real work is done
::They develop basic professional skills
::It supports career readiness
::It allows learning without location limits
::By participating in an online internship, students can improve their confidence and gain early exposure to different fields.
::'''Features of Online Internship-Based Learning'''
::Modern education platforms often include online internship opportunities as part of their learning system. These usually offer:
::Flexible schedules for students
::Access to learning from home
::Beginner-friendly tasks and projects
::A combination of theory and practice
::Such features make online internship programs suitable for a wide range of learners, including beginners.
::'''Learning Tasks'''
::Explore how online internship programs support student learning in digital environments.
::Identify how students can gain practical experience through an online internship
::Analyze the role of flexible learning in improving student engagement
::Understand how online education and internships work together
::'''References'''
::[https://ijpsl.in/wp-content/uploads/2020/09/E-Learning_Hanaaya-Navaneeth.pdf The Past, Present and Future of E-Learning: Hanaaya Varyani and Navaneeth M S]
::[https://ieeexplore.ieee.org/document/9788102 Current Trends and Future Perspectives of e-Learning in India]
::'''See Also'''
::[https://easyshiksha.com/online_courses/internship Online Internship]
::[https://easyshiksha.com/online_courses/ Online Courses]
::[https://easyshiksha.com/online_courses/kids-learning Kids Learning]
::[https://easyshiksha.com/career_helper/ Career Guidance] [[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:27, 17 April 2026 (UTC)
:::@[[User:EasyshikshaMarketing|EasyshikshaMarketing]] Wikiversity is a resource for education, or a space for education. However, your intention to link to another website is obvious, and such content does not belong here, as it contradicts the purpose of Wikiversity. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:38, 17 April 2026 (UTC)

==AI-generated images==
Seeking your advice.

Myself and students use some AI-generated images in the [[Motivation and emotion]] project.

[[User:Dronebogus]] has been removing some of these images from Wikiversity pages and nominating them for deletion at Commons. As a result, some have been deleted and some have been kept.

Dronebogus has made some useful edits and image suggestions for [[Motivation and emotion]] which I've appreciated and  incorporated. However, there are other edits to remove an AI image by Dronebogus that I've reverted where I think the image is more educational than no image or an alternative image suggested by Dronebogus.

There are a couple of pages where Dronebogus has reverted my reversion, so we are at risk of edit warring. We have briefly discussed and warned each other on our user talk pages, but it seems to come down to a difference in perception about the educational usefulness of the AI images.

So, I'm asking here for others to please review the recent edit histories for these pages:
* [[Motivation and emotion/Lectures/Brain and physiological needs]]
* [[Motivation and emotion/Book/2025/Stockholm syndrome emotion]]

and let us know what you think about the AI image suitability vs. using no image or alternative images suggested by Dronebogus.

Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:45, 26 April 2026 (UTC)

:I think Jtneill needs to try harder to find non-AI alternatives both on Commons and the web. I’m not reiterating the well known problems with generative AI— you can read about those on Wikipedia and the broader Internet. Needless to say it’s kind of just inherently toxic. If you use it, it should be the last resort of last resorts. Just my stance, which I consider perfectly valid and reasonable. [[User:Dronebogus|Dronebogus]] ([[User talk:Dronebogus|discuss]] • [[Special:Contributions/Dronebogus|contribs]]) 04:10, 27 April 2026 (UTC)

== Request for Page Creation Approval - Research on Dr. Ian Stevenson ==


'''Hello Administrators,'''

I am a digital archivist and researcher attempting to create an educational page regarding Dr. Ian Stevenson's scientific work, specifically titled &quot;Where Reincarnation and Biology Intersect&quot; and its official Vietnamese edition.

My edits are purely constructive, aimed at integrating local research context with global structured data (including '''Wikidata Q139548587'''). The automated filter is currently preventing publication due to &quot;new user external link limits.&quot;

I have ensured that all citations, references, and images (sourced from Wikimedia Commons) are strictly academic and non-promotional. Could you please review my contributions and consider whitelisting my account or approving this specific page creation?

Thank you for your assistance in preserving this research '''legacy''' within the open knowledge ecosystem.

'''Best regards,''' [[User:Ian Stevenson777|Ian Stevenson777]] ([[User talk:Ian Stevenson777|discuss]] • [[Special:Contributions/Ian Stevenson777|contribs]]) 07:26, 28 April 2026 (UTC)
: The page title should probably be in English, as this is English Wikiversity. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:19, 28 April 2026 (UTC)
:@[[User:Ian Stevenson777|Ian Stevenson777]] I looked at the text and it seems to me that it is informative, but the user cannot learn anything from it because they would have to buy the book. In this regard, it seems to me that it is enough [[:w:Where Reincarnation and Biology Intersect|to have that article on Wikipedia]] and there is no need to duplicate it here on Wikiversity. If you are particularly interested with its Vietnamese translation, I would focus on Vietnamese Wikipedia, but it seems to me, that the article there [https://vi.wikipedia.org/w/index.php?title=N%C6%A1i_lu%C3%A2n_h%E1%BB%93i_v%C3%A0_sinh_h%E1%BB%8Dc_giao_nhau&amp;oldid=75029095 have some problems at the moment]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:51, 5 May 2026 (UTC)
:This request is AI-generated and was made by a lock evading LTA. Please ignore it. [[User:NguoiDungKhongDinhDanh|NguoiDungKhongDinhDanh]] ([[User talk:NguoiDungKhongDinhDanh|discuss]] • [[Special:Contributions/NguoiDungKhongDinhDanh|contribs]]) 23:58, 13 May 2026 (UTC)

== Call for custodians and bureaucrats ==
&lt;div class=&quot;cd-moveMark&quot;&gt;''Moved to [[Wikiversity:Notices for custodians#Call for custodians and bureaucrats]].  [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 18:46, 12 May 2026 (UTC)''&lt;/div&gt;

== Interface administrator flag request ==

@[[User:Jtneill|Jtneill]], @[[User:Mu301|Mu301]] I am requesting IA flag to delete [[MediaWiki:Gadget-WikiSign.js]]. It was requested for deletion by [[User:Sophivorus|a trusted user]] and I think it can be deleted. Once I delete it, I will notify you and you can remove the flag. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:24, 10 May 2026 (UTC)

:Can you enable two-factor authentication? 
:Policy: [[Wikiversity:Interface administrators]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:27, 10 May 2026 (UTC)
::Done @[[User:Jtneill|Jtneill]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:20, 11 May 2026 (UTC)
:::You are an interface administrator for 24 hours. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:57, 11 May 2026 (UTC)
::::Thx @[[User:Jtneill|Jtneill]], I have just deleted the page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:59, 11 May 2026 (UTC)

== Block request ==

Hi. Please block @[[User:Skibidi Titan 5.0|Skibidi Titan 5.0]]. Reason : Vandalism.

Thanks, [[User:Locpac|Locpac]] ([[User talk:Locpac|discuss]] • [[Special:Contributions/Locpac|contribs]]) 15:10, 10 May 2026 (UTC)

:Thankyou. Done. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 15:25, 10 May 2026 (UTC)


== ~2026-28496-53 ==

Please block [[Special:Contribs/~2026-28496-53]], vandalism. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:02, 11 May 2026 (UTC)

:{{done}} Thank you! —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 17:14, 11 May 2026 (UTC)

== ~2026-28792-52 ==

Please block [[Special:Contribs/~2026-28792-52]], vandalism. Appears to be same user as above. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:38, 12 May 2026 (UTC)
: Blocked locally by Barras. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 17:46, 12 May 2026 (UTC)</text>
      <sha1>iwkadrieneisczgzbbuyakewi4e7xyi</sha1>
    </revision>
    <revision>
      <id>2809687</id>
      <parentid>2809685</parentid>
      <timestamp>2026-05-16T19:16:42Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* need to add my profile */ archive to [[Wikiversity:Request custodian action/Archive/30#need to add my profile]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809687</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="39504" sha1="hvg4x40ky4j1625ypfswpob2qciwbxx" xml:space="preserve">{{/Header}}

== Im trying to add new profile while add content its shows not alowed ==

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Exceeded New Page Limit

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)

== New User: cannot create talk page ==

Hi, I am a new user of Wikiversity and I wanted to create a talk page for the article [[ChatGPT's Essay on Kohlberg's Theory: AI's Use in Academic Writing]]. As a new user, I was barred from performing this action. The text that I wanted to add to the talk page is:

&lt;blockquote&gt;
I have doubts as to to the reliability of this essay. Take for rexample the sentence:

&lt;blockquote&gt;
Due to its efficiency, AI has saved 380,000-403,000 lives per year in European healthcare as reported in a recent Deloitte and MedTech Europe report&lt;ref&gt;Dantas, C., Mackiewicz, K., Tageo, V., Jacucci, G., Guardado, D., Ortet, S., Varlamis, I., Maniadakis, M., De Lera, E., Quintas, J., Kocsis, O., &amp; Vassiliou, C. (2021). Benefits and hurdles of AI in the workplace – what comes next? ''International Journal of Artificial Intelligence and Expert Systems, 10'', 9-17. https://www.researchgate.net/publication/351993615_Benefits_and_Hurdles_of_AI_In_The_Workplace_-What_Comes_Next&lt;/ref&gt;.
&lt;/blockquote&gt;

Reading the reference (freely available on ResearchGate), one notes:

# that the reference is from 2021 (predating the widespread use of LLMs such as ChatGPT and the associated 'AI' boom), and
# that the reference factually contradicts this essay.

Quoting from the reference:

&lt;blockquote&gt;
There are enormous benefits of applying AI-based solutions to monitor workers’ health and prevent accidents or, currently, COVID-19 infections, and those benefits are reported with enormous potential. According to the recent Deloitte and MedTech Europe report [11], implementing AI in European healthcare systems could save up 380,000 to 403,000 lives annually or €170.9 to 212.4 billion per year.
&lt;/blockquote&gt;

Not that the reference says ''could save'', not ''saves'' as in the essay.

This calls into question the reliability of the essay.

&lt;/blockquote&gt;

Could an administrator make this addition for me? Thank you! 
{{reflist}}
[[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 06:53, 5 February 2026 (UTC)

:@[[User:Æolus|Æolus]] I have added it for you, you can change the header and sign it now. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 08:05, 5 February 2026 (UTC)
::Thank you! [[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 12:43, 5 February 2026 (UTC)

== Disallowed to add a page on a course ==

I'm trying to populate a newly created course on Wikiversity, but it blocks me from creating more pages with &quot;New User Exceeded New Page Limit&quot;. Could this be lifted please? [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 13:21, 15 February 2026 (UTC)

:Sorry! Never mind. I was trying to create a new article instead of a new page. All good now. [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 14:03, 15 February 2026 (UTC)

== Harold Foppele adding LLM-generated nonsense and personal fiction ==

I became aware of [[User:Harold Foppele]]'s editing after I deleted some of his uploads on Commons. He appears to be adding a large amount of text and images that are some combination of personal fiction and LLM-generated nonsense. This includes:
*[[Quantum Ultra fast lasers#Future thought experiment|Personal speculative fiction]] in an otherwise &quot;nonfiction&quot; article
*Uploading nonsense LLM-created [[:File:Rontosecond pulse laser (Schematic).jpg|diagrams]] and [[:File:Rontosecond pulse laser (Futuristic).jpg|renders]] for nonexistent lab equipment, with fake source (on Commons, he indicated these files as having been created by him using an LLM)
*Uploading nonsense LLM-created images of equations with obvious artifacts. These images, such as [[:File:Redfield equation (non-Markovian).png]] and [[:File:Lindblad equation (Markovian).png]], don't even match the text he puts them with.
Much of his writing is also of extremely poor quality, to the point where it's not clear whether it's written by him or an LLM. I'm not an active editor on this project, so I'm not as familiar with the standards here, but I believe this is worth custodian attention. [[User:Pi.1415926535|Pi.1415926535]] ([[User talk:Pi.1415926535|discuss]] • [[Special:Contributions/Pi.1415926535|contribs]]) 03:06, 23 February 2026 (UTC)

:Fake source ''and'' contradictory copyright info, claiming both public domain and CC license. Moreover, if they are indeed nearly-direct LLM output, depending on jurisdiction they may not even be eligible for copyright.
:I've put speedy deletion marks for the equations, because they're obviously not coherent mathematical equations (the parentheses don't match, the symbols merge into each other the way text in image models often do, etc) [[User:Sesquilinear|Sesquilinear]] ([[User talk:Sesquilinear|discuss]] • [[Special:Contributions/Sesquilinear|contribs]]) 21:50, 7 March 2026 (UTC)

== Repeated removal of RFD notices by Harold Foppele ==

{{User|Harold Foppele }}

This editor is appearing in multiple noticeboards for behaviour which is contentious. Ther latest adventure is the repeated removal of tye RFD notice at [[Quantum/Henry C. Kapteyn]]. You will see from their contributions record the number of times. I have warned Tham on their user tag page that this is tantaomunt to volunteering to be blocked here. They have a track record of achieving blocks on enWiki and Commons already.

They have all the appearance of shooting not to understand when given direct information about their behaviour, whichever project they are editing, and are fast becoming a time sink. Their behaviour across multiple WMF sites may well lead to a Global Lock, but I do not believe they have quite reached the threshold for that.

I believe that what is required is a preventative block to seek to ensure thatchy understand the seriousness of their behaviour, and the need to be collegial. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 23:03, 4 March 2026 (UTC)
: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:45, 8 March 2026 (UTC)

== Blocks for sockpuppet ==

Please block [[User:Harold Foppele]] and [[User:Johnwilliamsiii]] for sockpuppetry based on [https://en.wikipedia.org/wiki/Wikipedia:Sockpuppet_investigations/Harold_Foppele en wiki] CU and [https://commons.wikimedia.org/w/index.php?diff=1177465640 commons] CU investigations. The user has also violated copyright, see the above discussion. A block is necessary to prevent further abuse. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:30, 8 March 2026 (UTC)

:&lt;small&gt;@[[User:MathXplore|MathXplore]]&lt;/small&gt; [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:31, 8 March 2026 (UTC)
:: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:44, 8 March 2026 (UTC)
:CC. @[[User:Timtrent|Timtrent]], @[[User:Sesquilinear|Sesquilinear]], @[[User:Pi.1415926535|Pi.1415926535]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:33, 8 March 2026 (UTC)
::Thank you for the ping. I concur based on [[w:en:WP:DUCK|behaviour]]. CUs appear divided. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 11:41, 8 March 2026 (UTC)

== Problem when trying to start a discussion with authors of the Plurilingual education portal ==

The authors I wanted to discuss with are called &quot;Project PEP&quot; and my name is Franch Chandler. How can I be allowed to do so ? [[User:French Chandler|French Chandler]] ([[User talk:French Chandler|discuss]] • [[Special:Contributions/French Chandler|contribs]]) 18:25, 16 March 2026 (UTC)

:@[[User:French Chandler|French Chandler]] place your qestion [https://en.wikiversity.org/w/index.php?title=User_talk:Projet_PEP&amp;action=edit into the dialog box] on this link and hit Publish page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:22, 16 March 2026 (UTC)

== Please publish my post ==

My post is about &quot;Every child grows and develops at their own pace, but some may experience challenges that affect their ability to perform everyday tasks. These challenges can include difficulties with fine motor skills, sensory processing, handwriting, feeding, and self-regulation. When these issues are not addressed early, they can impact a child’s confidence, academic performance, and independence.

With the rise of digital healthcare services, '''online physical therapy''' has emerged as a powerful and accessible solution for parents seeking support for their children. This modern approach provides structured, personalized therapy programs that can be accessed from the comfort of home, making it easier for families to ensure consistent care.&quot; [[User:Skyabovetherapy|Skyabovetherapy]] ([[User talk:Skyabovetherapy|discuss]] • [[Special:Contributions/Skyabovetherapy|contribs]]) 12:28, 28 March 2026 (UTC)

:@[[User:Skyabovetherapy|Skyabovetherapy]] Well, you can publish it yourself, Wikiversity is a free environement, where everybody can create educational resources. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 14:11, 29 March 2026 (UTC)
::They actually triggered some abuse filters. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 16:24, 29 March 2026 (UTC)
:I looked at your attempts to add this text and I see a link to one website repeated many times, which reminds me of the misuse of Wikiversity for self-promotion or to increase the importance of the website. It is necessary to remind you here that Wikiversity is not a place for promotion, but a place for education. So if you want to educate, it will not be a problem to create the page without external links with a clearly defined procedure for how people should use it and what to expect from it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:07, 1 April 2026 (UTC)

== New user limit ==

Hi, I am creating an AIPA Method learning resource page. 

I am the author of the linked research, and I hit the “new user limit” and “new page with external link” filters while publishing. 

Here is the link to the page in creation: [https://en.wikiversity.org/w/index.php?title=AIPA_Method&amp;veaction=edit] 

Thank you for your help. 

Best regards, 

Senad Dizdarević [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:19, 30 March 2026 (UTC)

:@[[User:Senad Dizdarević|Senad Dizdarević]] I should admit I dont know, what is &quot;new user limit&quot;, but if filter blocks your page because of certain external link, you may force to save anyway and sometimes it works. It should not work, when the website is blacklisted. As of now, I am not seeing you to save page in main namespace, so try to save it without external links first. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:30, 30 March 2026 (UTC)
::Thank you, you are very kind. 
::I will wait a day, and try again (without links, too). 
::Today, I already created About Me info page, and maybe that is enough for the filters for one day.  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:53, 30 March 2026 (UTC)
:::Well, I have analyzed your contribution to Wikiversity and I should point out here, that this project is not a place for advertising, so there is no way of promoting your books and authority this way. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:56, 1 April 2026 (UTC)
::::Hi, my About Me page is just an info page with the neutral as possible presentation of my work. 
::::There is a big difference between informing and advertising. Informing is neutrally stating that something exists and requiring no action, while advertising is a special communication form with intent to cause certain action from readers. For example, click here, click there, order this, buy that. 
::::There is no such intention, form, or terms on my info page. Just neutral information. I don't hide and I am not ashamed that I am write and author, and that is a part of the usual bio, including works. I checked your user page: &quot;I graduated from the Czech University of Life Sciences in Prague and studied information science at the Faculty of Arts of Charles University.&quot; I think that if you had written a book on Life Science, you would have mentioned that as well.
::::Most of the Info page is about my research and AIPA Method which is a valid contribution to psychology, consciousness studies, identity theory, and personality development. Actually, my paper '''AIPA Method: A Cognitive-Phenomenological Model for Identity Reconstruction and Stabilization in Pure Awareness''' is now in the peer review procedure at Journal of Consciousness Studies. 
::::Here is a part from the Wikiversity AIPA Method page in creation (waiting for the end of the time limit for new users):    [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:47, 2 April 2026 (UTC)
:::::For the unknown reasons, the form didn't publish my second part of the message: 
:::::I believe this is a valid contribution to Wikiversity. 
:::::Best Regards, 
:::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:52, 2 April 2026 (UTC)
::::::And the third try: 
:::::: == Introduction ==
::::::The AIPA Method addresses a gap in contemporary personal development and consciousness science: most evidence‑based approaches (CBT, MBSR, MBCT, standard meditation) operate at the level of mental content—reframing thoughts, observing them, or reducing their impact—rather than at the level of identity structure. In contrast, AIPA targets the structural relationship between the self and the mind, aiming at durable identity reconstruction rooted in Pure Awareness rather than symptom management.
::::::The central research question of the primary AIPA preprint is whether a structured, sequentially staged method can produce permanent identity reconstruction rooted in Pure Awareness, and how such a method compares to established approaches in scope, mechanism, and outcome.
:::::: == Theoretical foundations ==
::::::The AIPA framework is grounded in the cognitive‑phenomenological tradition (e.g., McAdams, Varela, Metzinger, Erikson), contemporary consciousness science on minimal phenomenal experience, and qualitative methods advocacy in psychology. It builds directly on:
::::::* Empirical work on pure awareness and Minimal Phenomenal Experience (MPE), especially Gamma &amp; Metzinger’s large‑scale study of content‑reduced awareness states.
::::::* Metzinger’s proposal of minimal phenomenal experience as an entry point for a minimal unifying model of consciousness.
::::::* Narrative identity and partial‑self models within personality and identity theory.
::::::Within this backdrop, AIPA proposes Pure Awareness as a distinct, operationally specified state that can become a structural ground of identity rather than a transient meditative experience.
:::::: == Experiential empiricism ==
::::::The empirical foundation of the AIPA Method is explicitly first‑person and experiential, combining:
::::::* A 22‑year longitudinal autoethnographic self‑study (2003–2025) documenting partial personality episodes, protocol use, and outcomes.
::::::* A 13‑year prospective verification period with zero self‑reported recurrence of targeted harmful behaviors after a dated stabilization point (1 January 2006).
::::::* A high‑ecological‑validity “stress test” during acute bereavement, used to examine whether non‑reactive awareness remains stable under maximal provocation.
::::::* Two independent practitioner cases (an Amazon‑verified report and a structured questionnaire case) providing preliminary convergent signals across cognitive, emotional, behavioral, and identity dimensions.
::::::All central constructs (Pure Awareness, partial personalities, the Switch, identity stabilization) are operationalized with explicit phenomenological and behavioral criteria intended to enable replication and future third‑person measurement.
::::::I believe this is a valid contribution to Wikiversity. 
::::::Best regards, 
::::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:54, 2 April 2026 (UTC)

== Unable to publish pages  ==

Whenever I try to publish a page with linked sources it gets flagged and says I'm a new user attempting to publish content with outside links. Those outside links are my sources. [[User:Soboyed|Soboyed]] ([[User talk:Soboyed|discuss]] • [[Special:Contributions/Soboyed|contribs]]) 04:52, 2 April 2026 (UTC)

:This restriction is automatically lifted after you have edited for a certain time (I don't recall that time off-hand, but it is not long). This is designed to stop spam. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 04:53, 2 April 2026 (UTC)

== Showing error to publish a Post ==

My  action was constructive, not destructive, please allow to publish it. [[Special:Contributions/&amp;#126;2026-20906-18|&amp;#126;2026-20906-18]] ([[User talk:&amp;#126;2026-20906-18|talk]]) 08:06, 4 April 2026 (UTC)

:Maybe you got caught in a filter. Consider [[Special:CreateAccount|creating an account]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:06, 4 April 2026 (UTC)
:Your edits, [https://en.wikiversity.org/w/index.php?title=Special:AbuseLog&amp;wpSearchUser=%7E2026-20906-18 these ones], seems to have tripped a filter when you tried to create a page on [[Create]] which external links. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 23:58, 4 April 2026 (UTC)
:Have you read my [https://en.wikiversity.org/w/index.php?title=Wikiversity:Request_custodian_action&amp;diff=prev&amp;oldid=2802219 previous reply] to you @[[User:~2026-20906-18|~2026-20906-18]]? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:02, 6 April 2026 (UTC)

== Abuse filters which should be deleted ==

Hi, there are some abuse filters which should probably be deleted.
* [[Special:AbuseFilter/1]] (not needed anymore)
* [[Special:AbuseFilter/2]] (no hits since 2018)
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched)
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives)
* [[Special:AbuseFilter/5]] (no hits since 2023)
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore)
* [[Special:AbuseFilter/17]] (no hits since 2022)
* [[Special:AbuseFilter/19]] (no hits since 2019)
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive)
Thanks. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 03:51, 5 April 2026 (UTC)

:Why do these need to be deleted rather than inactivated? Do inactive abuse filters cause a server strain? —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:39, 5 April 2026 (UTC)
:: Deleted filters do not cause strain to the servers. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:28, 5 April 2026 (UTC)
:These sounds like sensible suggestions but, yes, would inactivation perhaps make more sense than deletion for at least some  filters? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:35, 5 April 2026 (UTC)
:I would keep them @[[User:Codename Noreste|Codename Noreste]]. Alternatively, I would turn off the ones that haven't caught anything for a long time, but I would leave them enabled in case they need to be turned on or improved. If someone has already written the code and we don't have hundreds of free man-hours of programmers on Wikiversity, the server load seems secondary to me, and is negligible compared to other things. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:11, 6 April 2026 (UTC)
:: I know how to write abuse filter code and regex, but I would recommend disabling filters that have never caught anything in a long time ''and'' those who made lots of false positives. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:09, 6 April 2026 (UTC)
:::Of course @[[User:Codename Noreste|Codename Noreste]], there are people here today who are capable of changing the code. But the question is what it will be like in a few years, the question is what will happen if those two are busy for a long time, etc. That's why I would leave it so that those who don't know much about code can be inspired by it and will need to do something with it someday - plus, more code for different types of filtering is actually great educational material on how those filters work. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:41, 17 April 2026 (UTC)

Here's the updated list of abuse filters under review with actions I've taken (several disabled, one basic code improvement, and some actions changed) - none have been deleted so they can all be edited and reactivayed - please suggest any further changes:
* [[Special:AbuseFilter/1]] (not needed anymore) - One time account spam bot - 4 hits over 10 years ago - Disabled in 2024 - May be useful in future
* [[Special:AbuseFilter/2]] (no hits since 2018) - Userspace spamming - 778 hits; none since 2018 likely due to global filters - Now disabled
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched) - Specific user page spam - 1,101 hits most recent 7 March 2026 - Still active - Kept enabled
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives) - Questionable Language (profanity) - 6,055 hits including very recently - However it was logging hits without taking any actions - Edited to reduce likelihood of false positives by only applying filter to users with low (&lt; 20) edit count and applied weak actions to tag and warn but not prevent publishing the content
* [[Special:AbuseFilter/5]] (no hits since 2023) - Blocked Solicitation Links - 95 hits; none since 2023 - blocks specific historical spam sites - Non-active - Now disabled
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore) - Not reviewed - They are currently disabled
* [[Special:AbuseFilter/17]] (no hits since 2022) - Fundamental Physics Edits - 347 hits; none since 2022 - Non-active and very specific for a historical issue - Now disabled 
* [[Special:AbuseFilter/19]] (no hits since 2019) - Page Creation - 20 hits; none since 2019 - Retained for historical reference and possible future updates - Now disabled
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive) - Globally Banned Editor (renamed to Low-edit Spam Monitor) - 2,829 hits including very recent - Only applies to users with less than 5 edits and takes no actions / monitoring only - Reviewing the details of the hits I don't see many false positives and have strengthened its actions to add a tag and warning

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:57, 9 April 2026 (UTC)

== Block request ==

Please block ~2026-20985-80/~2026-21079-90/~2026-21223-88. Reason: Vandalism. [[User:Àncilu|Àncilu]] ([[User talk:Àncilu|discuss]] • [[Special:Contributions/Àncilu|contribs]]) 23:24, 5 April 2026 (UTC)

:All edits should be deleted and the first is blocked by Atcovi. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:33, 6 April 2026 (UTC)

== Antispam - Filter 12 ==
{{ping|Codename Noreste}} Thanks for contacting me with a suggested [[Special:AbuseFilter|abuse filter]] for the coupon spam we've been getting. A very much appreciated time saver. Per your suggestion, abuse filter 12 has been reactivated with your updated regex. It should tag and prevent page creation actions for coupon promo etc. Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:33, 15 April 2026 (UTC)
: @[[User:Jtneill|Jtneill]] Please do the following to filter 12:
:# Enable the block action (temporary for unregistered users, indefinite for registered users)
:# Disable both the disallow and tag actions, since that filter will be set to block
: Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:42, 5 May 2026 (UTC)
::Excellent. Done:
::* Block duration for non-registered users = 1 week
::* Block duration for registered users = indefinite
::* Disallow and tagging disabled
::Thankyou. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:24, 9 May 2026 (UTC)

== Urgent! error message This action has been automatically identified as potentially harmful, and therefore disallowed ==

While submitting the post this error was coming &quot;This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please inform an administrator of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link&quot; How to resolve it?

Here is the content:

{{note|marketing material removed}}

[[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:14, 17 April 2026 (UTC)
: That's because Wikiversity doesn't accept advertising. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 05:20, 17 April 2026 (UTC)
::So this is fine
::'''Online Internship and Digital Learning for Students'''
::Online learning has become an important part of modern education. With the help of the internet and digital tools, students can now study, practice, and gain experience without being physically present in a classroom. One key part of this system is the online internship, which helps students learn real-world skills along with their studies.
::An online internship allows students to work on tasks and projects through digital platforms. This makes learning more practical and useful, especially for those who want to understand how real work environments function.
::'''Background'''
::The concept of online learning developed from distance education, where students learned from remote locations. Over time, with the growth of digital technology, learning has become more interactive and flexible.
::The introduction of the online internship has added another important layer to digital education. It combines theoretical learning with practical experience, helping students prepare for future careers.
::During global events such as the COVID-19 pandemic, online education and online internship programs became essential. They helped students continue learning and gaining experience despite restrictions on physical movement.
::'''Importance of Online Internship'''
::An online internship plays an important role in student development. It helps bridge the gap between academic knowledge and practical skills.
::'''Some key points include:'''
::Students understand how real work is done
::They develop basic professional skills
::It supports career readiness
::It allows learning without location limits
::By participating in an online internship, students can improve their confidence and gain early exposure to different fields.
::'''Features of Online Internship-Based Learning'''
::Modern education platforms often include online internship opportunities as part of their learning system. These usually offer:
::Flexible schedules for students
::Access to learning from home
::Beginner-friendly tasks and projects
::A combination of theory and practice
::Such features make online internship programs suitable for a wide range of learners, including beginners.
::'''Learning Tasks'''
::Explore how online internship programs support student learning in digital environments.
::Identify how students can gain practical experience through an online internship
::Analyze the role of flexible learning in improving student engagement
::Understand how online education and internships work together
::'''References'''
::[https://ijpsl.in/wp-content/uploads/2020/09/E-Learning_Hanaaya-Navaneeth.pdf The Past, Present and Future of E-Learning: Hanaaya Varyani and Navaneeth M S]
::[https://ieeexplore.ieee.org/document/9788102 Current Trends and Future Perspectives of e-Learning in India]
::'''See Also'''
::[https://easyshiksha.com/online_courses/internship Online Internship]
::[https://easyshiksha.com/online_courses/ Online Courses]
::[https://easyshiksha.com/online_courses/kids-learning Kids Learning]
::[https://easyshiksha.com/career_helper/ Career Guidance] [[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:27, 17 April 2026 (UTC)
:::@[[User:EasyshikshaMarketing|EasyshikshaMarketing]] Wikiversity is a resource for education, or a space for education. However, your intention to link to another website is obvious, and such content does not belong here, as it contradicts the purpose of Wikiversity. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:38, 17 April 2026 (UTC)

==AI-generated images==
Seeking your advice.

Myself and students use some AI-generated images in the [[Motivation and emotion]] project.

[[User:Dronebogus]] has been removing some of these images from Wikiversity pages and nominating them for deletion at Commons. As a result, some have been deleted and some have been kept.

Dronebogus has made some useful edits and image suggestions for [[Motivation and emotion]] which I've appreciated and  incorporated. However, there are other edits to remove an AI image by Dronebogus that I've reverted where I think the image is more educational than no image or an alternative image suggested by Dronebogus.

There are a couple of pages where Dronebogus has reverted my reversion, so we are at risk of edit warring. We have briefly discussed and warned each other on our user talk pages, but it seems to come down to a difference in perception about the educational usefulness of the AI images.

So, I'm asking here for others to please review the recent edit histories for these pages:
* [[Motivation and emotion/Lectures/Brain and physiological needs]]
* [[Motivation and emotion/Book/2025/Stockholm syndrome emotion]]

and let us know what you think about the AI image suitability vs. using no image or alternative images suggested by Dronebogus.

Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:45, 26 April 2026 (UTC)

:I think Jtneill needs to try harder to find non-AI alternatives both on Commons and the web. I’m not reiterating the well known problems with generative AI— you can read about those on Wikipedia and the broader Internet. Needless to say it’s kind of just inherently toxic. If you use it, it should be the last resort of last resorts. Just my stance, which I consider perfectly valid and reasonable. [[User:Dronebogus|Dronebogus]] ([[User talk:Dronebogus|discuss]] • [[Special:Contributions/Dronebogus|contribs]]) 04:10, 27 April 2026 (UTC)

== Request for Page Creation Approval - Research on Dr. Ian Stevenson ==


'''Hello Administrators,'''

I am a digital archivist and researcher attempting to create an educational page regarding Dr. Ian Stevenson's scientific work, specifically titled &quot;Where Reincarnation and Biology Intersect&quot; and its official Vietnamese edition.

My edits are purely constructive, aimed at integrating local research context with global structured data (including '''Wikidata Q139548587'''). The automated filter is currently preventing publication due to &quot;new user external link limits.&quot;

I have ensured that all citations, references, and images (sourced from Wikimedia Commons) are strictly academic and non-promotional. Could you please review my contributions and consider whitelisting my account or approving this specific page creation?

Thank you for your assistance in preserving this research '''legacy''' within the open knowledge ecosystem.

'''Best regards,''' [[User:Ian Stevenson777|Ian Stevenson777]] ([[User talk:Ian Stevenson777|discuss]] • [[Special:Contributions/Ian Stevenson777|contribs]]) 07:26, 28 April 2026 (UTC)
: The page title should probably be in English, as this is English Wikiversity. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:19, 28 April 2026 (UTC)
:@[[User:Ian Stevenson777|Ian Stevenson777]] I looked at the text and it seems to me that it is informative, but the user cannot learn anything from it because they would have to buy the book. In this regard, it seems to me that it is enough [[:w:Where Reincarnation and Biology Intersect|to have that article on Wikipedia]] and there is no need to duplicate it here on Wikiversity. If you are particularly interested with its Vietnamese translation, I would focus on Vietnamese Wikipedia, but it seems to me, that the article there [https://vi.wikipedia.org/w/index.php?title=N%C6%A1i_lu%C3%A2n_h%E1%BB%93i_v%C3%A0_sinh_h%E1%BB%8Dc_giao_nhau&amp;oldid=75029095 have some problems at the moment]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:51, 5 May 2026 (UTC)
:This request is AI-generated and was made by a lock evading LTA. Please ignore it. [[User:NguoiDungKhongDinhDanh|NguoiDungKhongDinhDanh]] ([[User talk:NguoiDungKhongDinhDanh|discuss]] • [[Special:Contributions/NguoiDungKhongDinhDanh|contribs]]) 23:58, 13 May 2026 (UTC)

== Call for custodians and bureaucrats ==
&lt;div class=&quot;cd-moveMark&quot;&gt;''Moved to [[Wikiversity:Notices for custodians#Call for custodians and bureaucrats]].  [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 18:46, 12 May 2026 (UTC)''&lt;/div&gt;

== Interface administrator flag request ==

@[[User:Jtneill|Jtneill]], @[[User:Mu301|Mu301]] I am requesting IA flag to delete [[MediaWiki:Gadget-WikiSign.js]]. It was requested for deletion by [[User:Sophivorus|a trusted user]] and I think it can be deleted. Once I delete it, I will notify you and you can remove the flag. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:24, 10 May 2026 (UTC)

:Can you enable two-factor authentication? 
:Policy: [[Wikiversity:Interface administrators]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:27, 10 May 2026 (UTC)
::Done @[[User:Jtneill|Jtneill]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:20, 11 May 2026 (UTC)
:::You are an interface administrator for 24 hours. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:57, 11 May 2026 (UTC)
::::Thx @[[User:Jtneill|Jtneill]], I have just deleted the page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:59, 11 May 2026 (UTC)

== Block request ==

Hi. Please block @[[User:Skibidi Titan 5.0|Skibidi Titan 5.0]]. Reason : Vandalism.

Thanks, [[User:Locpac|Locpac]] ([[User talk:Locpac|discuss]] • [[Special:Contributions/Locpac|contribs]]) 15:10, 10 May 2026 (UTC)

:Thankyou. Done. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 15:25, 10 May 2026 (UTC)


== ~2026-28496-53 ==

Please block [[Special:Contribs/~2026-28496-53]], vandalism. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:02, 11 May 2026 (UTC)

:{{done}} Thank you! —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 17:14, 11 May 2026 (UTC)

== ~2026-28792-52 ==

Please block [[Special:Contribs/~2026-28792-52]], vandalism. Appears to be same user as above. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:38, 12 May 2026 (UTC)
: Blocked locally by Barras. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 17:46, 12 May 2026 (UTC)</text>
      <sha1>hvg4x40ky4j1625ypfswpob2qciwbxx</sha1>
    </revision>
    <revision>
      <id>2809689</id>
      <parentid>2809687</parentid>
      <timestamp>2026-05-16T19:16:54Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Im trying to add new profile while add content its shows not alowed */ archive to [[Wikiversity:Request custodian action/Archive/30#Im trying to add new profile while add content its shows not alowed]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809689</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="38576" sha1="ltd3i4tcrtnht5afdrqsiqxqk8cntaf" xml:space="preserve">{{/Header}}

== New User: cannot create talk page ==

Hi, I am a new user of Wikiversity and I wanted to create a talk page for the article [[ChatGPT's Essay on Kohlberg's Theory: AI's Use in Academic Writing]]. As a new user, I was barred from performing this action. The text that I wanted to add to the talk page is:

&lt;blockquote&gt;
I have doubts as to to the reliability of this essay. Take for rexample the sentence:

&lt;blockquote&gt;
Due to its efficiency, AI has saved 380,000-403,000 lives per year in European healthcare as reported in a recent Deloitte and MedTech Europe report&lt;ref&gt;Dantas, C., Mackiewicz, K., Tageo, V., Jacucci, G., Guardado, D., Ortet, S., Varlamis, I., Maniadakis, M., De Lera, E., Quintas, J., Kocsis, O., &amp; Vassiliou, C. (2021). Benefits and hurdles of AI in the workplace – what comes next? ''International Journal of Artificial Intelligence and Expert Systems, 10'', 9-17. https://www.researchgate.net/publication/351993615_Benefits_and_Hurdles_of_AI_In_The_Workplace_-What_Comes_Next&lt;/ref&gt;.
&lt;/blockquote&gt;

Reading the reference (freely available on ResearchGate), one notes:

# that the reference is from 2021 (predating the widespread use of LLMs such as ChatGPT and the associated 'AI' boom), and
# that the reference factually contradicts this essay.

Quoting from the reference:

&lt;blockquote&gt;
There are enormous benefits of applying AI-based solutions to monitor workers’ health and prevent accidents or, currently, COVID-19 infections, and those benefits are reported with enormous potential. According to the recent Deloitte and MedTech Europe report [11], implementing AI in European healthcare systems could save up 380,000 to 403,000 lives annually or €170.9 to 212.4 billion per year.
&lt;/blockquote&gt;

Not that the reference says ''could save'', not ''saves'' as in the essay.

This calls into question the reliability of the essay.

&lt;/blockquote&gt;

Could an administrator make this addition for me? Thank you! 
{{reflist}}
[[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 06:53, 5 February 2026 (UTC)

:@[[User:Æolus|Æolus]] I have added it for you, you can change the header and sign it now. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 08:05, 5 February 2026 (UTC)
::Thank you! [[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 12:43, 5 February 2026 (UTC)

== Disallowed to add a page on a course ==

I'm trying to populate a newly created course on Wikiversity, but it blocks me from creating more pages with &quot;New User Exceeded New Page Limit&quot;. Could this be lifted please? [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 13:21, 15 February 2026 (UTC)

:Sorry! Never mind. I was trying to create a new article instead of a new page. All good now. [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 14:03, 15 February 2026 (UTC)

== Harold Foppele adding LLM-generated nonsense and personal fiction ==

I became aware of [[User:Harold Foppele]]'s editing after I deleted some of his uploads on Commons. He appears to be adding a large amount of text and images that are some combination of personal fiction and LLM-generated nonsense. This includes:
*[[Quantum Ultra fast lasers#Future thought experiment|Personal speculative fiction]] in an otherwise &quot;nonfiction&quot; article
*Uploading nonsense LLM-created [[:File:Rontosecond pulse laser (Schematic).jpg|diagrams]] and [[:File:Rontosecond pulse laser (Futuristic).jpg|renders]] for nonexistent lab equipment, with fake source (on Commons, he indicated these files as having been created by him using an LLM)
*Uploading nonsense LLM-created images of equations with obvious artifacts. These images, such as [[:File:Redfield equation (non-Markovian).png]] and [[:File:Lindblad equation (Markovian).png]], don't even match the text he puts them with.
Much of his writing is also of extremely poor quality, to the point where it's not clear whether it's written by him or an LLM. I'm not an active editor on this project, so I'm not as familiar with the standards here, but I believe this is worth custodian attention. [[User:Pi.1415926535|Pi.1415926535]] ([[User talk:Pi.1415926535|discuss]] • [[Special:Contributions/Pi.1415926535|contribs]]) 03:06, 23 February 2026 (UTC)

:Fake source ''and'' contradictory copyright info, claiming both public domain and CC license. Moreover, if they are indeed nearly-direct LLM output, depending on jurisdiction they may not even be eligible for copyright.
:I've put speedy deletion marks for the equations, because they're obviously not coherent mathematical equations (the parentheses don't match, the symbols merge into each other the way text in image models often do, etc) [[User:Sesquilinear|Sesquilinear]] ([[User talk:Sesquilinear|discuss]] • [[Special:Contributions/Sesquilinear|contribs]]) 21:50, 7 March 2026 (UTC)

== Repeated removal of RFD notices by Harold Foppele ==

{{User|Harold Foppele }}

This editor is appearing in multiple noticeboards for behaviour which is contentious. Ther latest adventure is the repeated removal of tye RFD notice at [[Quantum/Henry C. Kapteyn]]. You will see from their contributions record the number of times. I have warned Tham on their user tag page that this is tantaomunt to volunteering to be blocked here. They have a track record of achieving blocks on enWiki and Commons already.

They have all the appearance of shooting not to understand when given direct information about their behaviour, whichever project they are editing, and are fast becoming a time sink. Their behaviour across multiple WMF sites may well lead to a Global Lock, but I do not believe they have quite reached the threshold for that.

I believe that what is required is a preventative block to seek to ensure thatchy understand the seriousness of their behaviour, and the need to be collegial. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 23:03, 4 March 2026 (UTC)
: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:45, 8 March 2026 (UTC)

== Blocks for sockpuppet ==

Please block [[User:Harold Foppele]] and [[User:Johnwilliamsiii]] for sockpuppetry based on [https://en.wikipedia.org/wiki/Wikipedia:Sockpuppet_investigations/Harold_Foppele en wiki] CU and [https://commons.wikimedia.org/w/index.php?diff=1177465640 commons] CU investigations. The user has also violated copyright, see the above discussion. A block is necessary to prevent further abuse. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:30, 8 March 2026 (UTC)

:&lt;small&gt;@[[User:MathXplore|MathXplore]]&lt;/small&gt; [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:31, 8 March 2026 (UTC)
:: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:44, 8 March 2026 (UTC)
:CC. @[[User:Timtrent|Timtrent]], @[[User:Sesquilinear|Sesquilinear]], @[[User:Pi.1415926535|Pi.1415926535]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:33, 8 March 2026 (UTC)
::Thank you for the ping. I concur based on [[w:en:WP:DUCK|behaviour]]. CUs appear divided. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 11:41, 8 March 2026 (UTC)

== Problem when trying to start a discussion with authors of the Plurilingual education portal ==

The authors I wanted to discuss with are called &quot;Project PEP&quot; and my name is Franch Chandler. How can I be allowed to do so ? [[User:French Chandler|French Chandler]] ([[User talk:French Chandler|discuss]] • [[Special:Contributions/French Chandler|contribs]]) 18:25, 16 March 2026 (UTC)

:@[[User:French Chandler|French Chandler]] place your qestion [https://en.wikiversity.org/w/index.php?title=User_talk:Projet_PEP&amp;action=edit into the dialog box] on this link and hit Publish page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:22, 16 March 2026 (UTC)

== Please publish my post ==

My post is about &quot;Every child grows and develops at their own pace, but some may experience challenges that affect their ability to perform everyday tasks. These challenges can include difficulties with fine motor skills, sensory processing, handwriting, feeding, and self-regulation. When these issues are not addressed early, they can impact a child’s confidence, academic performance, and independence.

With the rise of digital healthcare services, '''online physical therapy''' has emerged as a powerful and accessible solution for parents seeking support for their children. This modern approach provides structured, personalized therapy programs that can be accessed from the comfort of home, making it easier for families to ensure consistent care.&quot; [[User:Skyabovetherapy|Skyabovetherapy]] ([[User talk:Skyabovetherapy|discuss]] • [[Special:Contributions/Skyabovetherapy|contribs]]) 12:28, 28 March 2026 (UTC)

:@[[User:Skyabovetherapy|Skyabovetherapy]] Well, you can publish it yourself, Wikiversity is a free environement, where everybody can create educational resources. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 14:11, 29 March 2026 (UTC)
::They actually triggered some abuse filters. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 16:24, 29 March 2026 (UTC)
:I looked at your attempts to add this text and I see a link to one website repeated many times, which reminds me of the misuse of Wikiversity for self-promotion or to increase the importance of the website. It is necessary to remind you here that Wikiversity is not a place for promotion, but a place for education. So if you want to educate, it will not be a problem to create the page without external links with a clearly defined procedure for how people should use it and what to expect from it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:07, 1 April 2026 (UTC)

== New user limit ==

Hi, I am creating an AIPA Method learning resource page. 

I am the author of the linked research, and I hit the “new user limit” and “new page with external link” filters while publishing. 

Here is the link to the page in creation: [https://en.wikiversity.org/w/index.php?title=AIPA_Method&amp;veaction=edit] 

Thank you for your help. 

Best regards, 

Senad Dizdarević [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:19, 30 March 2026 (UTC)

:@[[User:Senad Dizdarević|Senad Dizdarević]] I should admit I dont know, what is &quot;new user limit&quot;, but if filter blocks your page because of certain external link, you may force to save anyway and sometimes it works. It should not work, when the website is blacklisted. As of now, I am not seeing you to save page in main namespace, so try to save it without external links first. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:30, 30 March 2026 (UTC)
::Thank you, you are very kind. 
::I will wait a day, and try again (without links, too). 
::Today, I already created About Me info page, and maybe that is enough for the filters for one day.  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:53, 30 March 2026 (UTC)
:::Well, I have analyzed your contribution to Wikiversity and I should point out here, that this project is not a place for advertising, so there is no way of promoting your books and authority this way. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:56, 1 April 2026 (UTC)
::::Hi, my About Me page is just an info page with the neutral as possible presentation of my work. 
::::There is a big difference between informing and advertising. Informing is neutrally stating that something exists and requiring no action, while advertising is a special communication form with intent to cause certain action from readers. For example, click here, click there, order this, buy that. 
::::There is no such intention, form, or terms on my info page. Just neutral information. I don't hide and I am not ashamed that I am write and author, and that is a part of the usual bio, including works. I checked your user page: &quot;I graduated from the Czech University of Life Sciences in Prague and studied information science at the Faculty of Arts of Charles University.&quot; I think that if you had written a book on Life Science, you would have mentioned that as well.
::::Most of the Info page is about my research and AIPA Method which is a valid contribution to psychology, consciousness studies, identity theory, and personality development. Actually, my paper '''AIPA Method: A Cognitive-Phenomenological Model for Identity Reconstruction and Stabilization in Pure Awareness''' is now in the peer review procedure at Journal of Consciousness Studies. 
::::Here is a part from the Wikiversity AIPA Method page in creation (waiting for the end of the time limit for new users):    [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:47, 2 April 2026 (UTC)
:::::For the unknown reasons, the form didn't publish my second part of the message: 
:::::I believe this is a valid contribution to Wikiversity. 
:::::Best Regards, 
:::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:52, 2 April 2026 (UTC)
::::::And the third try: 
:::::: == Introduction ==
::::::The AIPA Method addresses a gap in contemporary personal development and consciousness science: most evidence‑based approaches (CBT, MBSR, MBCT, standard meditation) operate at the level of mental content—reframing thoughts, observing them, or reducing their impact—rather than at the level of identity structure. In contrast, AIPA targets the structural relationship between the self and the mind, aiming at durable identity reconstruction rooted in Pure Awareness rather than symptom management.
::::::The central research question of the primary AIPA preprint is whether a structured, sequentially staged method can produce permanent identity reconstruction rooted in Pure Awareness, and how such a method compares to established approaches in scope, mechanism, and outcome.
:::::: == Theoretical foundations ==
::::::The AIPA framework is grounded in the cognitive‑phenomenological tradition (e.g., McAdams, Varela, Metzinger, Erikson), contemporary consciousness science on minimal phenomenal experience, and qualitative methods advocacy in psychology. It builds directly on:
::::::* Empirical work on pure awareness and Minimal Phenomenal Experience (MPE), especially Gamma &amp; Metzinger’s large‑scale study of content‑reduced awareness states.
::::::* Metzinger’s proposal of minimal phenomenal experience as an entry point for a minimal unifying model of consciousness.
::::::* Narrative identity and partial‑self models within personality and identity theory.
::::::Within this backdrop, AIPA proposes Pure Awareness as a distinct, operationally specified state that can become a structural ground of identity rather than a transient meditative experience.
:::::: == Experiential empiricism ==
::::::The empirical foundation of the AIPA Method is explicitly first‑person and experiential, combining:
::::::* A 22‑year longitudinal autoethnographic self‑study (2003–2025) documenting partial personality episodes, protocol use, and outcomes.
::::::* A 13‑year prospective verification period with zero self‑reported recurrence of targeted harmful behaviors after a dated stabilization point (1 January 2006).
::::::* A high‑ecological‑validity “stress test” during acute bereavement, used to examine whether non‑reactive awareness remains stable under maximal provocation.
::::::* Two independent practitioner cases (an Amazon‑verified report and a structured questionnaire case) providing preliminary convergent signals across cognitive, emotional, behavioral, and identity dimensions.
::::::All central constructs (Pure Awareness, partial personalities, the Switch, identity stabilization) are operationalized with explicit phenomenological and behavioral criteria intended to enable replication and future third‑person measurement.
::::::I believe this is a valid contribution to Wikiversity. 
::::::Best regards, 
::::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:54, 2 April 2026 (UTC)

== Unable to publish pages  ==

Whenever I try to publish a page with linked sources it gets flagged and says I'm a new user attempting to publish content with outside links. Those outside links are my sources. [[User:Soboyed|Soboyed]] ([[User talk:Soboyed|discuss]] • [[Special:Contributions/Soboyed|contribs]]) 04:52, 2 April 2026 (UTC)

:This restriction is automatically lifted after you have edited for a certain time (I don't recall that time off-hand, but it is not long). This is designed to stop spam. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 04:53, 2 April 2026 (UTC)

== Showing error to publish a Post ==

My  action was constructive, not destructive, please allow to publish it. [[Special:Contributions/&amp;#126;2026-20906-18|&amp;#126;2026-20906-18]] ([[User talk:&amp;#126;2026-20906-18|talk]]) 08:06, 4 April 2026 (UTC)

:Maybe you got caught in a filter. Consider [[Special:CreateAccount|creating an account]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:06, 4 April 2026 (UTC)
:Your edits, [https://en.wikiversity.org/w/index.php?title=Special:AbuseLog&amp;wpSearchUser=%7E2026-20906-18 these ones], seems to have tripped a filter when you tried to create a page on [[Create]] which external links. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 23:58, 4 April 2026 (UTC)
:Have you read my [https://en.wikiversity.org/w/index.php?title=Wikiversity:Request_custodian_action&amp;diff=prev&amp;oldid=2802219 previous reply] to you @[[User:~2026-20906-18|~2026-20906-18]]? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:02, 6 April 2026 (UTC)

== Abuse filters which should be deleted ==

Hi, there are some abuse filters which should probably be deleted.
* [[Special:AbuseFilter/1]] (not needed anymore)
* [[Special:AbuseFilter/2]] (no hits since 2018)
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched)
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives)
* [[Special:AbuseFilter/5]] (no hits since 2023)
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore)
* [[Special:AbuseFilter/17]] (no hits since 2022)
* [[Special:AbuseFilter/19]] (no hits since 2019)
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive)
Thanks. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 03:51, 5 April 2026 (UTC)

:Why do these need to be deleted rather than inactivated? Do inactive abuse filters cause a server strain? —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:39, 5 April 2026 (UTC)
:: Deleted filters do not cause strain to the servers. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:28, 5 April 2026 (UTC)
:These sounds like sensible suggestions but, yes, would inactivation perhaps make more sense than deletion for at least some  filters? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:35, 5 April 2026 (UTC)
:I would keep them @[[User:Codename Noreste|Codename Noreste]]. Alternatively, I would turn off the ones that haven't caught anything for a long time, but I would leave them enabled in case they need to be turned on or improved. If someone has already written the code and we don't have hundreds of free man-hours of programmers on Wikiversity, the server load seems secondary to me, and is negligible compared to other things. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:11, 6 April 2026 (UTC)
:: I know how to write abuse filter code and regex, but I would recommend disabling filters that have never caught anything in a long time ''and'' those who made lots of false positives. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:09, 6 April 2026 (UTC)
:::Of course @[[User:Codename Noreste|Codename Noreste]], there are people here today who are capable of changing the code. But the question is what it will be like in a few years, the question is what will happen if those two are busy for a long time, etc. That's why I would leave it so that those who don't know much about code can be inspired by it and will need to do something with it someday - plus, more code for different types of filtering is actually great educational material on how those filters work. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:41, 17 April 2026 (UTC)

Here's the updated list of abuse filters under review with actions I've taken (several disabled, one basic code improvement, and some actions changed) - none have been deleted so they can all be edited and reactivayed - please suggest any further changes:
* [[Special:AbuseFilter/1]] (not needed anymore) - One time account spam bot - 4 hits over 10 years ago - Disabled in 2024 - May be useful in future
* [[Special:AbuseFilter/2]] (no hits since 2018) - Userspace spamming - 778 hits; none since 2018 likely due to global filters - Now disabled
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched) - Specific user page spam - 1,101 hits most recent 7 March 2026 - Still active - Kept enabled
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives) - Questionable Language (profanity) - 6,055 hits including very recently - However it was logging hits without taking any actions - Edited to reduce likelihood of false positives by only applying filter to users with low (&lt; 20) edit count and applied weak actions to tag and warn but not prevent publishing the content
* [[Special:AbuseFilter/5]] (no hits since 2023) - Blocked Solicitation Links - 95 hits; none since 2023 - blocks specific historical spam sites - Non-active - Now disabled
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore) - Not reviewed - They are currently disabled
* [[Special:AbuseFilter/17]] (no hits since 2022) - Fundamental Physics Edits - 347 hits; none since 2022 - Non-active and very specific for a historical issue - Now disabled 
* [[Special:AbuseFilter/19]] (no hits since 2019) - Page Creation - 20 hits; none since 2019 - Retained for historical reference and possible future updates - Now disabled
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive) - Globally Banned Editor (renamed to Low-edit Spam Monitor) - 2,829 hits including very recent - Only applies to users with less than 5 edits and takes no actions / monitoring only - Reviewing the details of the hits I don't see many false positives and have strengthened its actions to add a tag and warning

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:57, 9 April 2026 (UTC)

== Block request ==

Please block ~2026-20985-80/~2026-21079-90/~2026-21223-88. Reason: Vandalism. [[User:Àncilu|Àncilu]] ([[User talk:Àncilu|discuss]] • [[Special:Contributions/Àncilu|contribs]]) 23:24, 5 April 2026 (UTC)

:All edits should be deleted and the first is blocked by Atcovi. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:33, 6 April 2026 (UTC)

== Antispam - Filter 12 ==
{{ping|Codename Noreste}} Thanks for contacting me with a suggested [[Special:AbuseFilter|abuse filter]] for the coupon spam we've been getting. A very much appreciated time saver. Per your suggestion, abuse filter 12 has been reactivated with your updated regex. It should tag and prevent page creation actions for coupon promo etc. Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:33, 15 April 2026 (UTC)
: @[[User:Jtneill|Jtneill]] Please do the following to filter 12:
:# Enable the block action (temporary for unregistered users, indefinite for registered users)
:# Disable both the disallow and tag actions, since that filter will be set to block
: Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:42, 5 May 2026 (UTC)
::Excellent. Done:
::* Block duration for non-registered users = 1 week
::* Block duration for registered users = indefinite
::* Disallow and tagging disabled
::Thankyou. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:24, 9 May 2026 (UTC)

== Urgent! error message This action has been automatically identified as potentially harmful, and therefore disallowed ==

While submitting the post this error was coming &quot;This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please inform an administrator of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link&quot; How to resolve it?

Here is the content:

{{note|marketing material removed}}

[[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:14, 17 April 2026 (UTC)
: That's because Wikiversity doesn't accept advertising. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 05:20, 17 April 2026 (UTC)
::So this is fine
::'''Online Internship and Digital Learning for Students'''
::Online learning has become an important part of modern education. With the help of the internet and digital tools, students can now study, practice, and gain experience without being physically present in a classroom. One key part of this system is the online internship, which helps students learn real-world skills along with their studies.
::An online internship allows students to work on tasks and projects through digital platforms. This makes learning more practical and useful, especially for those who want to understand how real work environments function.
::'''Background'''
::The concept of online learning developed from distance education, where students learned from remote locations. Over time, with the growth of digital technology, learning has become more interactive and flexible.
::The introduction of the online internship has added another important layer to digital education. It combines theoretical learning with practical experience, helping students prepare for future careers.
::During global events such as the COVID-19 pandemic, online education and online internship programs became essential. They helped students continue learning and gaining experience despite restrictions on physical movement.
::'''Importance of Online Internship'''
::An online internship plays an important role in student development. It helps bridge the gap between academic knowledge and practical skills.
::'''Some key points include:'''
::Students understand how real work is done
::They develop basic professional skills
::It supports career readiness
::It allows learning without location limits
::By participating in an online internship, students can improve their confidence and gain early exposure to different fields.
::'''Features of Online Internship-Based Learning'''
::Modern education platforms often include online internship opportunities as part of their learning system. These usually offer:
::Flexible schedules for students
::Access to learning from home
::Beginner-friendly tasks and projects
::A combination of theory and practice
::Such features make online internship programs suitable for a wide range of learners, including beginners.
::'''Learning Tasks'''
::Explore how online internship programs support student learning in digital environments.
::Identify how students can gain practical experience through an online internship
::Analyze the role of flexible learning in improving student engagement
::Understand how online education and internships work together
::'''References'''
::[https://ijpsl.in/wp-content/uploads/2020/09/E-Learning_Hanaaya-Navaneeth.pdf The Past, Present and Future of E-Learning: Hanaaya Varyani and Navaneeth M S]
::[https://ieeexplore.ieee.org/document/9788102 Current Trends and Future Perspectives of e-Learning in India]
::'''See Also'''
::[https://easyshiksha.com/online_courses/internship Online Internship]
::[https://easyshiksha.com/online_courses/ Online Courses]
::[https://easyshiksha.com/online_courses/kids-learning Kids Learning]
::[https://easyshiksha.com/career_helper/ Career Guidance] [[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:27, 17 April 2026 (UTC)
:::@[[User:EasyshikshaMarketing|EasyshikshaMarketing]] Wikiversity is a resource for education, or a space for education. However, your intention to link to another website is obvious, and such content does not belong here, as it contradicts the purpose of Wikiversity. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:38, 17 April 2026 (UTC)

==AI-generated images==
Seeking your advice.

Myself and students use some AI-generated images in the [[Motivation and emotion]] project.

[[User:Dronebogus]] has been removing some of these images from Wikiversity pages and nominating them for deletion at Commons. As a result, some have been deleted and some have been kept.

Dronebogus has made some useful edits and image suggestions for [[Motivation and emotion]] which I've appreciated and  incorporated. However, there are other edits to remove an AI image by Dronebogus that I've reverted where I think the image is more educational than no image or an alternative image suggested by Dronebogus.

There are a couple of pages where Dronebogus has reverted my reversion, so we are at risk of edit warring. We have briefly discussed and warned each other on our user talk pages, but it seems to come down to a difference in perception about the educational usefulness of the AI images.

So, I'm asking here for others to please review the recent edit histories for these pages:
* [[Motivation and emotion/Lectures/Brain and physiological needs]]
* [[Motivation and emotion/Book/2025/Stockholm syndrome emotion]]

and let us know what you think about the AI image suitability vs. using no image or alternative images suggested by Dronebogus.

Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:45, 26 April 2026 (UTC)

:I think Jtneill needs to try harder to find non-AI alternatives both on Commons and the web. I’m not reiterating the well known problems with generative AI— you can read about those on Wikipedia and the broader Internet. Needless to say it’s kind of just inherently toxic. If you use it, it should be the last resort of last resorts. Just my stance, which I consider perfectly valid and reasonable. [[User:Dronebogus|Dronebogus]] ([[User talk:Dronebogus|discuss]] • [[Special:Contributions/Dronebogus|contribs]]) 04:10, 27 April 2026 (UTC)

== Request for Page Creation Approval - Research on Dr. Ian Stevenson ==


'''Hello Administrators,'''

I am a digital archivist and researcher attempting to create an educational page regarding Dr. Ian Stevenson's scientific work, specifically titled &quot;Where Reincarnation and Biology Intersect&quot; and its official Vietnamese edition.

My edits are purely constructive, aimed at integrating local research context with global structured data (including '''Wikidata Q139548587'''). The automated filter is currently preventing publication due to &quot;new user external link limits.&quot;

I have ensured that all citations, references, and images (sourced from Wikimedia Commons) are strictly academic and non-promotional. Could you please review my contributions and consider whitelisting my account or approving this specific page creation?

Thank you for your assistance in preserving this research '''legacy''' within the open knowledge ecosystem.

'''Best regards,''' [[User:Ian Stevenson777|Ian Stevenson777]] ([[User talk:Ian Stevenson777|discuss]] • [[Special:Contributions/Ian Stevenson777|contribs]]) 07:26, 28 April 2026 (UTC)
: The page title should probably be in English, as this is English Wikiversity. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:19, 28 April 2026 (UTC)
:@[[User:Ian Stevenson777|Ian Stevenson777]] I looked at the text and it seems to me that it is informative, but the user cannot learn anything from it because they would have to buy the book. In this regard, it seems to me that it is enough [[:w:Where Reincarnation and Biology Intersect|to have that article on Wikipedia]] and there is no need to duplicate it here on Wikiversity. If you are particularly interested with its Vietnamese translation, I would focus on Vietnamese Wikipedia, but it seems to me, that the article there [https://vi.wikipedia.org/w/index.php?title=N%C6%A1i_lu%C3%A2n_h%E1%BB%93i_v%C3%A0_sinh_h%E1%BB%8Dc_giao_nhau&amp;oldid=75029095 have some problems at the moment]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:51, 5 May 2026 (UTC)
:This request is AI-generated and was made by a lock evading LTA. Please ignore it. [[User:NguoiDungKhongDinhDanh|NguoiDungKhongDinhDanh]] ([[User talk:NguoiDungKhongDinhDanh|discuss]] • [[Special:Contributions/NguoiDungKhongDinhDanh|contribs]]) 23:58, 13 May 2026 (UTC)

== Call for custodians and bureaucrats ==
&lt;div class=&quot;cd-moveMark&quot;&gt;''Moved to [[Wikiversity:Notices for custodians#Call for custodians and bureaucrats]].  [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 18:46, 12 May 2026 (UTC)''&lt;/div&gt;

== Interface administrator flag request ==

@[[User:Jtneill|Jtneill]], @[[User:Mu301|Mu301]] I am requesting IA flag to delete [[MediaWiki:Gadget-WikiSign.js]]. It was requested for deletion by [[User:Sophivorus|a trusted user]] and I think it can be deleted. Once I delete it, I will notify you and you can remove the flag. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:24, 10 May 2026 (UTC)

:Can you enable two-factor authentication? 
:Policy: [[Wikiversity:Interface administrators]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:27, 10 May 2026 (UTC)
::Done @[[User:Jtneill|Jtneill]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:20, 11 May 2026 (UTC)
:::You are an interface administrator for 24 hours. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:57, 11 May 2026 (UTC)
::::Thx @[[User:Jtneill|Jtneill]], I have just deleted the page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:59, 11 May 2026 (UTC)

== Block request ==

Hi. Please block @[[User:Skibidi Titan 5.0|Skibidi Titan 5.0]]. Reason : Vandalism.

Thanks, [[User:Locpac|Locpac]] ([[User talk:Locpac|discuss]] • [[Special:Contributions/Locpac|contribs]]) 15:10, 10 May 2026 (UTC)

:Thankyou. Done. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 15:25, 10 May 2026 (UTC)


== ~2026-28496-53 ==

Please block [[Special:Contribs/~2026-28496-53]], vandalism. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:02, 11 May 2026 (UTC)

:{{done}} Thank you! —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 17:14, 11 May 2026 (UTC)

== ~2026-28792-52 ==

Please block [[Special:Contribs/~2026-28792-52]], vandalism. Appears to be same user as above. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:38, 12 May 2026 (UTC)
: Blocked locally by Barras. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 17:46, 12 May 2026 (UTC)</text>
      <sha1>ltd3i4tcrtnht5afdrqsiqxqk8cntaf</sha1>
    </revision>
    <revision>
      <id>2809691</id>
      <parentid>2809689</parentid>
      <timestamp>2026-05-16T19:18:59Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* New User: cannot create talk page */ archive to [[Wikiversity:Request custodian action/Archive/30#New User: cannot create talk page]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809691</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="36115" sha1="3x7ug1ybbw892b6n3uo69dd9vucm41t" xml:space="preserve">{{/Header}}

== Disallowed to add a page on a course ==

I'm trying to populate a newly created course on Wikiversity, but it blocks me from creating more pages with &quot;New User Exceeded New Page Limit&quot;. Could this be lifted please? [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 13:21, 15 February 2026 (UTC)

:Sorry! Never mind. I was trying to create a new article instead of a new page. All good now. [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 14:03, 15 February 2026 (UTC)

== Harold Foppele adding LLM-generated nonsense and personal fiction ==

I became aware of [[User:Harold Foppele]]'s editing after I deleted some of his uploads on Commons. He appears to be adding a large amount of text and images that are some combination of personal fiction and LLM-generated nonsense. This includes:
*[[Quantum Ultra fast lasers#Future thought experiment|Personal speculative fiction]] in an otherwise &quot;nonfiction&quot; article
*Uploading nonsense LLM-created [[:File:Rontosecond pulse laser (Schematic).jpg|diagrams]] and [[:File:Rontosecond pulse laser (Futuristic).jpg|renders]] for nonexistent lab equipment, with fake source (on Commons, he indicated these files as having been created by him using an LLM)
*Uploading nonsense LLM-created images of equations with obvious artifacts. These images, such as [[:File:Redfield equation (non-Markovian).png]] and [[:File:Lindblad equation (Markovian).png]], don't even match the text he puts them with.
Much of his writing is also of extremely poor quality, to the point where it's not clear whether it's written by him or an LLM. I'm not an active editor on this project, so I'm not as familiar with the standards here, but I believe this is worth custodian attention. [[User:Pi.1415926535|Pi.1415926535]] ([[User talk:Pi.1415926535|discuss]] • [[Special:Contributions/Pi.1415926535|contribs]]) 03:06, 23 February 2026 (UTC)

:Fake source ''and'' contradictory copyright info, claiming both public domain and CC license. Moreover, if they are indeed nearly-direct LLM output, depending on jurisdiction they may not even be eligible for copyright.
:I've put speedy deletion marks for the equations, because they're obviously not coherent mathematical equations (the parentheses don't match, the symbols merge into each other the way text in image models often do, etc) [[User:Sesquilinear|Sesquilinear]] ([[User talk:Sesquilinear|discuss]] • [[Special:Contributions/Sesquilinear|contribs]]) 21:50, 7 March 2026 (UTC)

== Repeated removal of RFD notices by Harold Foppele ==

{{User|Harold Foppele }}

This editor is appearing in multiple noticeboards for behaviour which is contentious. Ther latest adventure is the repeated removal of tye RFD notice at [[Quantum/Henry C. Kapteyn]]. You will see from their contributions record the number of times. I have warned Tham on their user tag page that this is tantaomunt to volunteering to be blocked here. They have a track record of achieving blocks on enWiki and Commons already.

They have all the appearance of shooting not to understand when given direct information about their behaviour, whichever project they are editing, and are fast becoming a time sink. Their behaviour across multiple WMF sites may well lead to a Global Lock, but I do not believe they have quite reached the threshold for that.

I believe that what is required is a preventative block to seek to ensure thatchy understand the seriousness of their behaviour, and the need to be collegial. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 23:03, 4 March 2026 (UTC)
: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:45, 8 March 2026 (UTC)

== Blocks for sockpuppet ==

Please block [[User:Harold Foppele]] and [[User:Johnwilliamsiii]] for sockpuppetry based on [https://en.wikipedia.org/wiki/Wikipedia:Sockpuppet_investigations/Harold_Foppele en wiki] CU and [https://commons.wikimedia.org/w/index.php?diff=1177465640 commons] CU investigations. The user has also violated copyright, see the above discussion. A block is necessary to prevent further abuse. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:30, 8 March 2026 (UTC)

:&lt;small&gt;@[[User:MathXplore|MathXplore]]&lt;/small&gt; [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:31, 8 March 2026 (UTC)
:: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:44, 8 March 2026 (UTC)
:CC. @[[User:Timtrent|Timtrent]], @[[User:Sesquilinear|Sesquilinear]], @[[User:Pi.1415926535|Pi.1415926535]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:33, 8 March 2026 (UTC)
::Thank you for the ping. I concur based on [[w:en:WP:DUCK|behaviour]]. CUs appear divided. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 11:41, 8 March 2026 (UTC)

== Problem when trying to start a discussion with authors of the Plurilingual education portal ==

The authors I wanted to discuss with are called &quot;Project PEP&quot; and my name is Franch Chandler. How can I be allowed to do so ? [[User:French Chandler|French Chandler]] ([[User talk:French Chandler|discuss]] • [[Special:Contributions/French Chandler|contribs]]) 18:25, 16 March 2026 (UTC)

:@[[User:French Chandler|French Chandler]] place your qestion [https://en.wikiversity.org/w/index.php?title=User_talk:Projet_PEP&amp;action=edit into the dialog box] on this link and hit Publish page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:22, 16 March 2026 (UTC)

== Please publish my post ==

My post is about &quot;Every child grows and develops at their own pace, but some may experience challenges that affect their ability to perform everyday tasks. These challenges can include difficulties with fine motor skills, sensory processing, handwriting, feeding, and self-regulation. When these issues are not addressed early, they can impact a child’s confidence, academic performance, and independence.

With the rise of digital healthcare services, '''online physical therapy''' has emerged as a powerful and accessible solution for parents seeking support for their children. This modern approach provides structured, personalized therapy programs that can be accessed from the comfort of home, making it easier for families to ensure consistent care.&quot; [[User:Skyabovetherapy|Skyabovetherapy]] ([[User talk:Skyabovetherapy|discuss]] • [[Special:Contributions/Skyabovetherapy|contribs]]) 12:28, 28 March 2026 (UTC)

:@[[User:Skyabovetherapy|Skyabovetherapy]] Well, you can publish it yourself, Wikiversity is a free environement, where everybody can create educational resources. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 14:11, 29 March 2026 (UTC)
::They actually triggered some abuse filters. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 16:24, 29 March 2026 (UTC)
:I looked at your attempts to add this text and I see a link to one website repeated many times, which reminds me of the misuse of Wikiversity for self-promotion or to increase the importance of the website. It is necessary to remind you here that Wikiversity is not a place for promotion, but a place for education. So if you want to educate, it will not be a problem to create the page without external links with a clearly defined procedure for how people should use it and what to expect from it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:07, 1 April 2026 (UTC)

== New user limit ==

Hi, I am creating an AIPA Method learning resource page. 

I am the author of the linked research, and I hit the “new user limit” and “new page with external link” filters while publishing. 

Here is the link to the page in creation: [https://en.wikiversity.org/w/index.php?title=AIPA_Method&amp;veaction=edit] 

Thank you for your help. 

Best regards, 

Senad Dizdarević [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:19, 30 March 2026 (UTC)

:@[[User:Senad Dizdarević|Senad Dizdarević]] I should admit I dont know, what is &quot;new user limit&quot;, but if filter blocks your page because of certain external link, you may force to save anyway and sometimes it works. It should not work, when the website is blacklisted. As of now, I am not seeing you to save page in main namespace, so try to save it without external links first. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:30, 30 March 2026 (UTC)
::Thank you, you are very kind. 
::I will wait a day, and try again (without links, too). 
::Today, I already created About Me info page, and maybe that is enough for the filters for one day.  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:53, 30 March 2026 (UTC)
:::Well, I have analyzed your contribution to Wikiversity and I should point out here, that this project is not a place for advertising, so there is no way of promoting your books and authority this way. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:56, 1 April 2026 (UTC)
::::Hi, my About Me page is just an info page with the neutral as possible presentation of my work. 
::::There is a big difference between informing and advertising. Informing is neutrally stating that something exists and requiring no action, while advertising is a special communication form with intent to cause certain action from readers. For example, click here, click there, order this, buy that. 
::::There is no such intention, form, or terms on my info page. Just neutral information. I don't hide and I am not ashamed that I am write and author, and that is a part of the usual bio, including works. I checked your user page: &quot;I graduated from the Czech University of Life Sciences in Prague and studied information science at the Faculty of Arts of Charles University.&quot; I think that if you had written a book on Life Science, you would have mentioned that as well.
::::Most of the Info page is about my research and AIPA Method which is a valid contribution to psychology, consciousness studies, identity theory, and personality development. Actually, my paper '''AIPA Method: A Cognitive-Phenomenological Model for Identity Reconstruction and Stabilization in Pure Awareness''' is now in the peer review procedure at Journal of Consciousness Studies. 
::::Here is a part from the Wikiversity AIPA Method page in creation (waiting for the end of the time limit for new users):    [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:47, 2 April 2026 (UTC)
:::::For the unknown reasons, the form didn't publish my second part of the message: 
:::::I believe this is a valid contribution to Wikiversity. 
:::::Best Regards, 
:::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:52, 2 April 2026 (UTC)
::::::And the third try: 
:::::: == Introduction ==
::::::The AIPA Method addresses a gap in contemporary personal development and consciousness science: most evidence‑based approaches (CBT, MBSR, MBCT, standard meditation) operate at the level of mental content—reframing thoughts, observing them, or reducing their impact—rather than at the level of identity structure. In contrast, AIPA targets the structural relationship between the self and the mind, aiming at durable identity reconstruction rooted in Pure Awareness rather than symptom management.
::::::The central research question of the primary AIPA preprint is whether a structured, sequentially staged method can produce permanent identity reconstruction rooted in Pure Awareness, and how such a method compares to established approaches in scope, mechanism, and outcome.
:::::: == Theoretical foundations ==
::::::The AIPA framework is grounded in the cognitive‑phenomenological tradition (e.g., McAdams, Varela, Metzinger, Erikson), contemporary consciousness science on minimal phenomenal experience, and qualitative methods advocacy in psychology. It builds directly on:
::::::* Empirical work on pure awareness and Minimal Phenomenal Experience (MPE), especially Gamma &amp; Metzinger’s large‑scale study of content‑reduced awareness states.
::::::* Metzinger’s proposal of minimal phenomenal experience as an entry point for a minimal unifying model of consciousness.
::::::* Narrative identity and partial‑self models within personality and identity theory.
::::::Within this backdrop, AIPA proposes Pure Awareness as a distinct, operationally specified state that can become a structural ground of identity rather than a transient meditative experience.
:::::: == Experiential empiricism ==
::::::The empirical foundation of the AIPA Method is explicitly first‑person and experiential, combining:
::::::* A 22‑year longitudinal autoethnographic self‑study (2003–2025) documenting partial personality episodes, protocol use, and outcomes.
::::::* A 13‑year prospective verification period with zero self‑reported recurrence of targeted harmful behaviors after a dated stabilization point (1 January 2006).
::::::* A high‑ecological‑validity “stress test” during acute bereavement, used to examine whether non‑reactive awareness remains stable under maximal provocation.
::::::* Two independent practitioner cases (an Amazon‑verified report and a structured questionnaire case) providing preliminary convergent signals across cognitive, emotional, behavioral, and identity dimensions.
::::::All central constructs (Pure Awareness, partial personalities, the Switch, identity stabilization) are operationalized with explicit phenomenological and behavioral criteria intended to enable replication and future third‑person measurement.
::::::I believe this is a valid contribution to Wikiversity. 
::::::Best regards, 
::::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:54, 2 April 2026 (UTC)

== Unable to publish pages  ==

Whenever I try to publish a page with linked sources it gets flagged and says I'm a new user attempting to publish content with outside links. Those outside links are my sources. [[User:Soboyed|Soboyed]] ([[User talk:Soboyed|discuss]] • [[Special:Contributions/Soboyed|contribs]]) 04:52, 2 April 2026 (UTC)

:This restriction is automatically lifted after you have edited for a certain time (I don't recall that time off-hand, but it is not long). This is designed to stop spam. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 04:53, 2 April 2026 (UTC)

== Showing error to publish a Post ==

My  action was constructive, not destructive, please allow to publish it. [[Special:Contributions/&amp;#126;2026-20906-18|&amp;#126;2026-20906-18]] ([[User talk:&amp;#126;2026-20906-18|talk]]) 08:06, 4 April 2026 (UTC)

:Maybe you got caught in a filter. Consider [[Special:CreateAccount|creating an account]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:06, 4 April 2026 (UTC)
:Your edits, [https://en.wikiversity.org/w/index.php?title=Special:AbuseLog&amp;wpSearchUser=%7E2026-20906-18 these ones], seems to have tripped a filter when you tried to create a page on [[Create]] which external links. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 23:58, 4 April 2026 (UTC)
:Have you read my [https://en.wikiversity.org/w/index.php?title=Wikiversity:Request_custodian_action&amp;diff=prev&amp;oldid=2802219 previous reply] to you @[[User:~2026-20906-18|~2026-20906-18]]? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:02, 6 April 2026 (UTC)

== Abuse filters which should be deleted ==

Hi, there are some abuse filters which should probably be deleted.
* [[Special:AbuseFilter/1]] (not needed anymore)
* [[Special:AbuseFilter/2]] (no hits since 2018)
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched)
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives)
* [[Special:AbuseFilter/5]] (no hits since 2023)
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore)
* [[Special:AbuseFilter/17]] (no hits since 2022)
* [[Special:AbuseFilter/19]] (no hits since 2019)
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive)
Thanks. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 03:51, 5 April 2026 (UTC)

:Why do these need to be deleted rather than inactivated? Do inactive abuse filters cause a server strain? —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:39, 5 April 2026 (UTC)
:: Deleted filters do not cause strain to the servers. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:28, 5 April 2026 (UTC)
:These sounds like sensible suggestions but, yes, would inactivation perhaps make more sense than deletion for at least some  filters? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:35, 5 April 2026 (UTC)
:I would keep them @[[User:Codename Noreste|Codename Noreste]]. Alternatively, I would turn off the ones that haven't caught anything for a long time, but I would leave them enabled in case they need to be turned on or improved. If someone has already written the code and we don't have hundreds of free man-hours of programmers on Wikiversity, the server load seems secondary to me, and is negligible compared to other things. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:11, 6 April 2026 (UTC)
:: I know how to write abuse filter code and regex, but I would recommend disabling filters that have never caught anything in a long time ''and'' those who made lots of false positives. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:09, 6 April 2026 (UTC)
:::Of course @[[User:Codename Noreste|Codename Noreste]], there are people here today who are capable of changing the code. But the question is what it will be like in a few years, the question is what will happen if those two are busy for a long time, etc. That's why I would leave it so that those who don't know much about code can be inspired by it and will need to do something with it someday - plus, more code for different types of filtering is actually great educational material on how those filters work. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:41, 17 April 2026 (UTC)

Here's the updated list of abuse filters under review with actions I've taken (several disabled, one basic code improvement, and some actions changed) - none have been deleted so they can all be edited and reactivayed - please suggest any further changes:
* [[Special:AbuseFilter/1]] (not needed anymore) - One time account spam bot - 4 hits over 10 years ago - Disabled in 2024 - May be useful in future
* [[Special:AbuseFilter/2]] (no hits since 2018) - Userspace spamming - 778 hits; none since 2018 likely due to global filters - Now disabled
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched) - Specific user page spam - 1,101 hits most recent 7 March 2026 - Still active - Kept enabled
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives) - Questionable Language (profanity) - 6,055 hits including very recently - However it was logging hits without taking any actions - Edited to reduce likelihood of false positives by only applying filter to users with low (&lt; 20) edit count and applied weak actions to tag and warn but not prevent publishing the content
* [[Special:AbuseFilter/5]] (no hits since 2023) - Blocked Solicitation Links - 95 hits; none since 2023 - blocks specific historical spam sites - Non-active - Now disabled
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore) - Not reviewed - They are currently disabled
* [[Special:AbuseFilter/17]] (no hits since 2022) - Fundamental Physics Edits - 347 hits; none since 2022 - Non-active and very specific for a historical issue - Now disabled 
* [[Special:AbuseFilter/19]] (no hits since 2019) - Page Creation - 20 hits; none since 2019 - Retained for historical reference and possible future updates - Now disabled
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive) - Globally Banned Editor (renamed to Low-edit Spam Monitor) - 2,829 hits including very recent - Only applies to users with less than 5 edits and takes no actions / monitoring only - Reviewing the details of the hits I don't see many false positives and have strengthened its actions to add a tag and warning

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:57, 9 April 2026 (UTC)

== Block request ==

Please block ~2026-20985-80/~2026-21079-90/~2026-21223-88. Reason: Vandalism. [[User:Àncilu|Àncilu]] ([[User talk:Àncilu|discuss]] • [[Special:Contributions/Àncilu|contribs]]) 23:24, 5 April 2026 (UTC)

:All edits should be deleted and the first is blocked by Atcovi. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:33, 6 April 2026 (UTC)

== Antispam - Filter 12 ==
{{ping|Codename Noreste}} Thanks for contacting me with a suggested [[Special:AbuseFilter|abuse filter]] for the coupon spam we've been getting. A very much appreciated time saver. Per your suggestion, abuse filter 12 has been reactivated with your updated regex. It should tag and prevent page creation actions for coupon promo etc. Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:33, 15 April 2026 (UTC)
: @[[User:Jtneill|Jtneill]] Please do the following to filter 12:
:# Enable the block action (temporary for unregistered users, indefinite for registered users)
:# Disable both the disallow and tag actions, since that filter will be set to block
: Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:42, 5 May 2026 (UTC)
::Excellent. Done:
::* Block duration for non-registered users = 1 week
::* Block duration for registered users = indefinite
::* Disallow and tagging disabled
::Thankyou. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:24, 9 May 2026 (UTC)

== Urgent! error message This action has been automatically identified as potentially harmful, and therefore disallowed ==

While submitting the post this error was coming &quot;This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please inform an administrator of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link&quot; How to resolve it?

Here is the content:

{{note|marketing material removed}}

[[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:14, 17 April 2026 (UTC)
: That's because Wikiversity doesn't accept advertising. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 05:20, 17 April 2026 (UTC)
::So this is fine
::'''Online Internship and Digital Learning for Students'''
::Online learning has become an important part of modern education. With the help of the internet and digital tools, students can now study, practice, and gain experience without being physically present in a classroom. One key part of this system is the online internship, which helps students learn real-world skills along with their studies.
::An online internship allows students to work on tasks and projects through digital platforms. This makes learning more practical and useful, especially for those who want to understand how real work environments function.
::'''Background'''
::The concept of online learning developed from distance education, where students learned from remote locations. Over time, with the growth of digital technology, learning has become more interactive and flexible.
::The introduction of the online internship has added another important layer to digital education. It combines theoretical learning with practical experience, helping students prepare for future careers.
::During global events such as the COVID-19 pandemic, online education and online internship programs became essential. They helped students continue learning and gaining experience despite restrictions on physical movement.
::'''Importance of Online Internship'''
::An online internship plays an important role in student development. It helps bridge the gap between academic knowledge and practical skills.
::'''Some key points include:'''
::Students understand how real work is done
::They develop basic professional skills
::It supports career readiness
::It allows learning without location limits
::By participating in an online internship, students can improve their confidence and gain early exposure to different fields.
::'''Features of Online Internship-Based Learning'''
::Modern education platforms often include online internship opportunities as part of their learning system. These usually offer:
::Flexible schedules for students
::Access to learning from home
::Beginner-friendly tasks and projects
::A combination of theory and practice
::Such features make online internship programs suitable for a wide range of learners, including beginners.
::'''Learning Tasks'''
::Explore how online internship programs support student learning in digital environments.
::Identify how students can gain practical experience through an online internship
::Analyze the role of flexible learning in improving student engagement
::Understand how online education and internships work together
::'''References'''
::[https://ijpsl.in/wp-content/uploads/2020/09/E-Learning_Hanaaya-Navaneeth.pdf The Past, Present and Future of E-Learning: Hanaaya Varyani and Navaneeth M S]
::[https://ieeexplore.ieee.org/document/9788102 Current Trends and Future Perspectives of e-Learning in India]
::'''See Also'''
::[https://easyshiksha.com/online_courses/internship Online Internship]
::[https://easyshiksha.com/online_courses/ Online Courses]
::[https://easyshiksha.com/online_courses/kids-learning Kids Learning]
::[https://easyshiksha.com/career_helper/ Career Guidance] [[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:27, 17 April 2026 (UTC)
:::@[[User:EasyshikshaMarketing|EasyshikshaMarketing]] Wikiversity is a resource for education, or a space for education. However, your intention to link to another website is obvious, and such content does not belong here, as it contradicts the purpose of Wikiversity. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:38, 17 April 2026 (UTC)

==AI-generated images==
Seeking your advice.

Myself and students use some AI-generated images in the [[Motivation and emotion]] project.

[[User:Dronebogus]] has been removing some of these images from Wikiversity pages and nominating them for deletion at Commons. As a result, some have been deleted and some have been kept.

Dronebogus has made some useful edits and image suggestions for [[Motivation and emotion]] which I've appreciated and  incorporated. However, there are other edits to remove an AI image by Dronebogus that I've reverted where I think the image is more educational than no image or an alternative image suggested by Dronebogus.

There are a couple of pages where Dronebogus has reverted my reversion, so we are at risk of edit warring. We have briefly discussed and warned each other on our user talk pages, but it seems to come down to a difference in perception about the educational usefulness of the AI images.

So, I'm asking here for others to please review the recent edit histories for these pages:
* [[Motivation and emotion/Lectures/Brain and physiological needs]]
* [[Motivation and emotion/Book/2025/Stockholm syndrome emotion]]

and let us know what you think about the AI image suitability vs. using no image or alternative images suggested by Dronebogus.

Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:45, 26 April 2026 (UTC)

:I think Jtneill needs to try harder to find non-AI alternatives both on Commons and the web. I’m not reiterating the well known problems with generative AI— you can read about those on Wikipedia and the broader Internet. Needless to say it’s kind of just inherently toxic. If you use it, it should be the last resort of last resorts. Just my stance, which I consider perfectly valid and reasonable. [[User:Dronebogus|Dronebogus]] ([[User talk:Dronebogus|discuss]] • [[Special:Contributions/Dronebogus|contribs]]) 04:10, 27 April 2026 (UTC)

== Request for Page Creation Approval - Research on Dr. Ian Stevenson ==


'''Hello Administrators,'''

I am a digital archivist and researcher attempting to create an educational page regarding Dr. Ian Stevenson's scientific work, specifically titled &quot;Where Reincarnation and Biology Intersect&quot; and its official Vietnamese edition.

My edits are purely constructive, aimed at integrating local research context with global structured data (including '''Wikidata Q139548587'''). The automated filter is currently preventing publication due to &quot;new user external link limits.&quot;

I have ensured that all citations, references, and images (sourced from Wikimedia Commons) are strictly academic and non-promotional. Could you please review my contributions and consider whitelisting my account or approving this specific page creation?

Thank you for your assistance in preserving this research '''legacy''' within the open knowledge ecosystem.

'''Best regards,''' [[User:Ian Stevenson777|Ian Stevenson777]] ([[User talk:Ian Stevenson777|discuss]] • [[Special:Contributions/Ian Stevenson777|contribs]]) 07:26, 28 April 2026 (UTC)
: The page title should probably be in English, as this is English Wikiversity. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:19, 28 April 2026 (UTC)
:@[[User:Ian Stevenson777|Ian Stevenson777]] I looked at the text and it seems to me that it is informative, but the user cannot learn anything from it because they would have to buy the book. In this regard, it seems to me that it is enough [[:w:Where Reincarnation and Biology Intersect|to have that article on Wikipedia]] and there is no need to duplicate it here on Wikiversity. If you are particularly interested with its Vietnamese translation, I would focus on Vietnamese Wikipedia, but it seems to me, that the article there [https://vi.wikipedia.org/w/index.php?title=N%C6%A1i_lu%C3%A2n_h%E1%BB%93i_v%C3%A0_sinh_h%E1%BB%8Dc_giao_nhau&amp;oldid=75029095 have some problems at the moment]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:51, 5 May 2026 (UTC)
:This request is AI-generated and was made by a lock evading LTA. Please ignore it. [[User:NguoiDungKhongDinhDanh|NguoiDungKhongDinhDanh]] ([[User talk:NguoiDungKhongDinhDanh|discuss]] • [[Special:Contributions/NguoiDungKhongDinhDanh|contribs]]) 23:58, 13 May 2026 (UTC)

== Call for custodians and bureaucrats ==
&lt;div class=&quot;cd-moveMark&quot;&gt;''Moved to [[Wikiversity:Notices for custodians#Call for custodians and bureaucrats]].  [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 18:46, 12 May 2026 (UTC)''&lt;/div&gt;

== Interface administrator flag request ==

@[[User:Jtneill|Jtneill]], @[[User:Mu301|Mu301]] I am requesting IA flag to delete [[MediaWiki:Gadget-WikiSign.js]]. It was requested for deletion by [[User:Sophivorus|a trusted user]] and I think it can be deleted. Once I delete it, I will notify you and you can remove the flag. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:24, 10 May 2026 (UTC)

:Can you enable two-factor authentication? 
:Policy: [[Wikiversity:Interface administrators]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:27, 10 May 2026 (UTC)
::Done @[[User:Jtneill|Jtneill]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:20, 11 May 2026 (UTC)
:::You are an interface administrator for 24 hours. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:57, 11 May 2026 (UTC)
::::Thx @[[User:Jtneill|Jtneill]], I have just deleted the page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:59, 11 May 2026 (UTC)

== Block request ==

Hi. Please block @[[User:Skibidi Titan 5.0|Skibidi Titan 5.0]]. Reason : Vandalism.

Thanks, [[User:Locpac|Locpac]] ([[User talk:Locpac|discuss]] • [[Special:Contributions/Locpac|contribs]]) 15:10, 10 May 2026 (UTC)

:Thankyou. Done. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 15:25, 10 May 2026 (UTC)


== ~2026-28496-53 ==

Please block [[Special:Contribs/~2026-28496-53]], vandalism. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:02, 11 May 2026 (UTC)

:{{done}} Thank you! —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 17:14, 11 May 2026 (UTC)

== ~2026-28792-52 ==

Please block [[Special:Contribs/~2026-28792-52]], vandalism. Appears to be same user as above. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:38, 12 May 2026 (UTC)
: Blocked locally by Barras. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 17:46, 12 May 2026 (UTC)</text>
      <sha1>3x7ug1ybbw892b6n3uo69dd9vucm41t</sha1>
    </revision>
    <revision>
      <id>2809693</id>
      <parentid>2809691</parentid>
      <timestamp>2026-05-16T19:19:25Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Disallowed to add a page on a course */ archive to [[Wikiversity:Request custodian action/Archive/30#Disallowed to add a page on a course]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809693</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="35501" sha1="bs2xtyz58q6us2ionk7j4phqpekfxgc" xml:space="preserve">{{/Header}}

== Harold Foppele adding LLM-generated nonsense and personal fiction ==

I became aware of [[User:Harold Foppele]]'s editing after I deleted some of his uploads on Commons. He appears to be adding a large amount of text and images that are some combination of personal fiction and LLM-generated nonsense. This includes:
*[[Quantum Ultra fast lasers#Future thought experiment|Personal speculative fiction]] in an otherwise &quot;nonfiction&quot; article
*Uploading nonsense LLM-created [[:File:Rontosecond pulse laser (Schematic).jpg|diagrams]] and [[:File:Rontosecond pulse laser (Futuristic).jpg|renders]] for nonexistent lab equipment, with fake source (on Commons, he indicated these files as having been created by him using an LLM)
*Uploading nonsense LLM-created images of equations with obvious artifacts. These images, such as [[:File:Redfield equation (non-Markovian).png]] and [[:File:Lindblad equation (Markovian).png]], don't even match the text he puts them with.
Much of his writing is also of extremely poor quality, to the point where it's not clear whether it's written by him or an LLM. I'm not an active editor on this project, so I'm not as familiar with the standards here, but I believe this is worth custodian attention. [[User:Pi.1415926535|Pi.1415926535]] ([[User talk:Pi.1415926535|discuss]] • [[Special:Contributions/Pi.1415926535|contribs]]) 03:06, 23 February 2026 (UTC)

:Fake source ''and'' contradictory copyright info, claiming both public domain and CC license. Moreover, if they are indeed nearly-direct LLM output, depending on jurisdiction they may not even be eligible for copyright.
:I've put speedy deletion marks for the equations, because they're obviously not coherent mathematical equations (the parentheses don't match, the symbols merge into each other the way text in image models often do, etc) [[User:Sesquilinear|Sesquilinear]] ([[User talk:Sesquilinear|discuss]] • [[Special:Contributions/Sesquilinear|contribs]]) 21:50, 7 March 2026 (UTC)

== Repeated removal of RFD notices by Harold Foppele ==

{{User|Harold Foppele }}

This editor is appearing in multiple noticeboards for behaviour which is contentious. Ther latest adventure is the repeated removal of tye RFD notice at [[Quantum/Henry C. Kapteyn]]. You will see from their contributions record the number of times. I have warned Tham on their user tag page that this is tantaomunt to volunteering to be blocked here. They have a track record of achieving blocks on enWiki and Commons already.

They have all the appearance of shooting not to understand when given direct information about their behaviour, whichever project they are editing, and are fast becoming a time sink. Their behaviour across multiple WMF sites may well lead to a Global Lock, but I do not believe they have quite reached the threshold for that.

I believe that what is required is a preventative block to seek to ensure thatchy understand the seriousness of their behaviour, and the need to be collegial. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 23:03, 4 March 2026 (UTC)
: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:45, 8 March 2026 (UTC)

== Blocks for sockpuppet ==

Please block [[User:Harold Foppele]] and [[User:Johnwilliamsiii]] for sockpuppetry based on [https://en.wikipedia.org/wiki/Wikipedia:Sockpuppet_investigations/Harold_Foppele en wiki] CU and [https://commons.wikimedia.org/w/index.php?diff=1177465640 commons] CU investigations. The user has also violated copyright, see the above discussion. A block is necessary to prevent further abuse. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:30, 8 March 2026 (UTC)

:&lt;small&gt;@[[User:MathXplore|MathXplore]]&lt;/small&gt; [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:31, 8 March 2026 (UTC)
:: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:44, 8 March 2026 (UTC)
:CC. @[[User:Timtrent|Timtrent]], @[[User:Sesquilinear|Sesquilinear]], @[[User:Pi.1415926535|Pi.1415926535]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:33, 8 March 2026 (UTC)
::Thank you for the ping. I concur based on [[w:en:WP:DUCK|behaviour]]. CUs appear divided. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 11:41, 8 March 2026 (UTC)

== Problem when trying to start a discussion with authors of the Plurilingual education portal ==

The authors I wanted to discuss with are called &quot;Project PEP&quot; and my name is Franch Chandler. How can I be allowed to do so ? [[User:French Chandler|French Chandler]] ([[User talk:French Chandler|discuss]] • [[Special:Contributions/French Chandler|contribs]]) 18:25, 16 March 2026 (UTC)

:@[[User:French Chandler|French Chandler]] place your qestion [https://en.wikiversity.org/w/index.php?title=User_talk:Projet_PEP&amp;action=edit into the dialog box] on this link and hit Publish page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:22, 16 March 2026 (UTC)

== Please publish my post ==

My post is about &quot;Every child grows and develops at their own pace, but some may experience challenges that affect their ability to perform everyday tasks. These challenges can include difficulties with fine motor skills, sensory processing, handwriting, feeding, and self-regulation. When these issues are not addressed early, they can impact a child’s confidence, academic performance, and independence.

With the rise of digital healthcare services, '''online physical therapy''' has emerged as a powerful and accessible solution for parents seeking support for their children. This modern approach provides structured, personalized therapy programs that can be accessed from the comfort of home, making it easier for families to ensure consistent care.&quot; [[User:Skyabovetherapy|Skyabovetherapy]] ([[User talk:Skyabovetherapy|discuss]] • [[Special:Contributions/Skyabovetherapy|contribs]]) 12:28, 28 March 2026 (UTC)

:@[[User:Skyabovetherapy|Skyabovetherapy]] Well, you can publish it yourself, Wikiversity is a free environement, where everybody can create educational resources. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 14:11, 29 March 2026 (UTC)
::They actually triggered some abuse filters. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 16:24, 29 March 2026 (UTC)
:I looked at your attempts to add this text and I see a link to one website repeated many times, which reminds me of the misuse of Wikiversity for self-promotion or to increase the importance of the website. It is necessary to remind you here that Wikiversity is not a place for promotion, but a place for education. So if you want to educate, it will not be a problem to create the page without external links with a clearly defined procedure for how people should use it and what to expect from it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:07, 1 April 2026 (UTC)

== New user limit ==

Hi, I am creating an AIPA Method learning resource page. 

I am the author of the linked research, and I hit the “new user limit” and “new page with external link” filters while publishing. 

Here is the link to the page in creation: [https://en.wikiversity.org/w/index.php?title=AIPA_Method&amp;veaction=edit] 

Thank you for your help. 

Best regards, 

Senad Dizdarević [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:19, 30 March 2026 (UTC)

:@[[User:Senad Dizdarević|Senad Dizdarević]] I should admit I dont know, what is &quot;new user limit&quot;, but if filter blocks your page because of certain external link, you may force to save anyway and sometimes it works. It should not work, when the website is blacklisted. As of now, I am not seeing you to save page in main namespace, so try to save it without external links first. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:30, 30 March 2026 (UTC)
::Thank you, you are very kind. 
::I will wait a day, and try again (without links, too). 
::Today, I already created About Me info page, and maybe that is enough for the filters for one day.  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:53, 30 March 2026 (UTC)
:::Well, I have analyzed your contribution to Wikiversity and I should point out here, that this project is not a place for advertising, so there is no way of promoting your books and authority this way. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:56, 1 April 2026 (UTC)
::::Hi, my About Me page is just an info page with the neutral as possible presentation of my work. 
::::There is a big difference between informing and advertising. Informing is neutrally stating that something exists and requiring no action, while advertising is a special communication form with intent to cause certain action from readers. For example, click here, click there, order this, buy that. 
::::There is no such intention, form, or terms on my info page. Just neutral information. I don't hide and I am not ashamed that I am write and author, and that is a part of the usual bio, including works. I checked your user page: &quot;I graduated from the Czech University of Life Sciences in Prague and studied information science at the Faculty of Arts of Charles University.&quot; I think that if you had written a book on Life Science, you would have mentioned that as well.
::::Most of the Info page is about my research and AIPA Method which is a valid contribution to psychology, consciousness studies, identity theory, and personality development. Actually, my paper '''AIPA Method: A Cognitive-Phenomenological Model for Identity Reconstruction and Stabilization in Pure Awareness''' is now in the peer review procedure at Journal of Consciousness Studies. 
::::Here is a part from the Wikiversity AIPA Method page in creation (waiting for the end of the time limit for new users):    [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:47, 2 April 2026 (UTC)
:::::For the unknown reasons, the form didn't publish my second part of the message: 
:::::I believe this is a valid contribution to Wikiversity. 
:::::Best Regards, 
:::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:52, 2 April 2026 (UTC)
::::::And the third try: 
:::::: == Introduction ==
::::::The AIPA Method addresses a gap in contemporary personal development and consciousness science: most evidence‑based approaches (CBT, MBSR, MBCT, standard meditation) operate at the level of mental content—reframing thoughts, observing them, or reducing their impact—rather than at the level of identity structure. In contrast, AIPA targets the structural relationship between the self and the mind, aiming at durable identity reconstruction rooted in Pure Awareness rather than symptom management.
::::::The central research question of the primary AIPA preprint is whether a structured, sequentially staged method can produce permanent identity reconstruction rooted in Pure Awareness, and how such a method compares to established approaches in scope, mechanism, and outcome.
:::::: == Theoretical foundations ==
::::::The AIPA framework is grounded in the cognitive‑phenomenological tradition (e.g., McAdams, Varela, Metzinger, Erikson), contemporary consciousness science on minimal phenomenal experience, and qualitative methods advocacy in psychology. It builds directly on:
::::::* Empirical work on pure awareness and Minimal Phenomenal Experience (MPE), especially Gamma &amp; Metzinger’s large‑scale study of content‑reduced awareness states.
::::::* Metzinger’s proposal of minimal phenomenal experience as an entry point for a minimal unifying model of consciousness.
::::::* Narrative identity and partial‑self models within personality and identity theory.
::::::Within this backdrop, AIPA proposes Pure Awareness as a distinct, operationally specified state that can become a structural ground of identity rather than a transient meditative experience.
:::::: == Experiential empiricism ==
::::::The empirical foundation of the AIPA Method is explicitly first‑person and experiential, combining:
::::::* A 22‑year longitudinal autoethnographic self‑study (2003–2025) documenting partial personality episodes, protocol use, and outcomes.
::::::* A 13‑year prospective verification period with zero self‑reported recurrence of targeted harmful behaviors after a dated stabilization point (1 January 2006).
::::::* A high‑ecological‑validity “stress test” during acute bereavement, used to examine whether non‑reactive awareness remains stable under maximal provocation.
::::::* Two independent practitioner cases (an Amazon‑verified report and a structured questionnaire case) providing preliminary convergent signals across cognitive, emotional, behavioral, and identity dimensions.
::::::All central constructs (Pure Awareness, partial personalities, the Switch, identity stabilization) are operationalized with explicit phenomenological and behavioral criteria intended to enable replication and future third‑person measurement.
::::::I believe this is a valid contribution to Wikiversity. 
::::::Best regards, 
::::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:54, 2 April 2026 (UTC)

== Unable to publish pages  ==

Whenever I try to publish a page with linked sources it gets flagged and says I'm a new user attempting to publish content with outside links. Those outside links are my sources. [[User:Soboyed|Soboyed]] ([[User talk:Soboyed|discuss]] • [[Special:Contributions/Soboyed|contribs]]) 04:52, 2 April 2026 (UTC)

:This restriction is automatically lifted after you have edited for a certain time (I don't recall that time off-hand, but it is not long). This is designed to stop spam. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 04:53, 2 April 2026 (UTC)

== Showing error to publish a Post ==

My  action was constructive, not destructive, please allow to publish it. [[Special:Contributions/&amp;#126;2026-20906-18|&amp;#126;2026-20906-18]] ([[User talk:&amp;#126;2026-20906-18|talk]]) 08:06, 4 April 2026 (UTC)

:Maybe you got caught in a filter. Consider [[Special:CreateAccount|creating an account]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:06, 4 April 2026 (UTC)
:Your edits, [https://en.wikiversity.org/w/index.php?title=Special:AbuseLog&amp;wpSearchUser=%7E2026-20906-18 these ones], seems to have tripped a filter when you tried to create a page on [[Create]] which external links. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 23:58, 4 April 2026 (UTC)
:Have you read my [https://en.wikiversity.org/w/index.php?title=Wikiversity:Request_custodian_action&amp;diff=prev&amp;oldid=2802219 previous reply] to you @[[User:~2026-20906-18|~2026-20906-18]]? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:02, 6 April 2026 (UTC)

== Abuse filters which should be deleted ==

Hi, there are some abuse filters which should probably be deleted.
* [[Special:AbuseFilter/1]] (not needed anymore)
* [[Special:AbuseFilter/2]] (no hits since 2018)
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched)
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives)
* [[Special:AbuseFilter/5]] (no hits since 2023)
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore)
* [[Special:AbuseFilter/17]] (no hits since 2022)
* [[Special:AbuseFilter/19]] (no hits since 2019)
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive)
Thanks. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 03:51, 5 April 2026 (UTC)

:Why do these need to be deleted rather than inactivated? Do inactive abuse filters cause a server strain? —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:39, 5 April 2026 (UTC)
:: Deleted filters do not cause strain to the servers. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:28, 5 April 2026 (UTC)
:These sounds like sensible suggestions but, yes, would inactivation perhaps make more sense than deletion for at least some  filters? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:35, 5 April 2026 (UTC)
:I would keep them @[[User:Codename Noreste|Codename Noreste]]. Alternatively, I would turn off the ones that haven't caught anything for a long time, but I would leave them enabled in case they need to be turned on or improved. If someone has already written the code and we don't have hundreds of free man-hours of programmers on Wikiversity, the server load seems secondary to me, and is negligible compared to other things. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:11, 6 April 2026 (UTC)
:: I know how to write abuse filter code and regex, but I would recommend disabling filters that have never caught anything in a long time ''and'' those who made lots of false positives. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:09, 6 April 2026 (UTC)
:::Of course @[[User:Codename Noreste|Codename Noreste]], there are people here today who are capable of changing the code. But the question is what it will be like in a few years, the question is what will happen if those two are busy for a long time, etc. That's why I would leave it so that those who don't know much about code can be inspired by it and will need to do something with it someday - plus, more code for different types of filtering is actually great educational material on how those filters work. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:41, 17 April 2026 (UTC)

Here's the updated list of abuse filters under review with actions I've taken (several disabled, one basic code improvement, and some actions changed) - none have been deleted so they can all be edited and reactivayed - please suggest any further changes:
* [[Special:AbuseFilter/1]] (not needed anymore) - One time account spam bot - 4 hits over 10 years ago - Disabled in 2024 - May be useful in future
* [[Special:AbuseFilter/2]] (no hits since 2018) - Userspace spamming - 778 hits; none since 2018 likely due to global filters - Now disabled
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched) - Specific user page spam - 1,101 hits most recent 7 March 2026 - Still active - Kept enabled
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives) - Questionable Language (profanity) - 6,055 hits including very recently - However it was logging hits without taking any actions - Edited to reduce likelihood of false positives by only applying filter to users with low (&lt; 20) edit count and applied weak actions to tag and warn but not prevent publishing the content
* [[Special:AbuseFilter/5]] (no hits since 2023) - Blocked Solicitation Links - 95 hits; none since 2023 - blocks specific historical spam sites - Non-active - Now disabled
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore) - Not reviewed - They are currently disabled
* [[Special:AbuseFilter/17]] (no hits since 2022) - Fundamental Physics Edits - 347 hits; none since 2022 - Non-active and very specific for a historical issue - Now disabled 
* [[Special:AbuseFilter/19]] (no hits since 2019) - Page Creation - 20 hits; none since 2019 - Retained for historical reference and possible future updates - Now disabled
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive) - Globally Banned Editor (renamed to Low-edit Spam Monitor) - 2,829 hits including very recent - Only applies to users with less than 5 edits and takes no actions / monitoring only - Reviewing the details of the hits I don't see many false positives and have strengthened its actions to add a tag and warning

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:57, 9 April 2026 (UTC)

== Block request ==

Please block ~2026-20985-80/~2026-21079-90/~2026-21223-88. Reason: Vandalism. [[User:Àncilu|Àncilu]] ([[User talk:Àncilu|discuss]] • [[Special:Contributions/Àncilu|contribs]]) 23:24, 5 April 2026 (UTC)

:All edits should be deleted and the first is blocked by Atcovi. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:33, 6 April 2026 (UTC)

== Antispam - Filter 12 ==
{{ping|Codename Noreste}} Thanks for contacting me with a suggested [[Special:AbuseFilter|abuse filter]] for the coupon spam we've been getting. A very much appreciated time saver. Per your suggestion, abuse filter 12 has been reactivated with your updated regex. It should tag and prevent page creation actions for coupon promo etc. Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:33, 15 April 2026 (UTC)
: @[[User:Jtneill|Jtneill]] Please do the following to filter 12:
:# Enable the block action (temporary for unregistered users, indefinite for registered users)
:# Disable both the disallow and tag actions, since that filter will be set to block
: Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:42, 5 May 2026 (UTC)
::Excellent. Done:
::* Block duration for non-registered users = 1 week
::* Block duration for registered users = indefinite
::* Disallow and tagging disabled
::Thankyou. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:24, 9 May 2026 (UTC)

== Urgent! error message This action has been automatically identified as potentially harmful, and therefore disallowed ==

While submitting the post this error was coming &quot;This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please inform an administrator of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link&quot; How to resolve it?

Here is the content:

{{note|marketing material removed}}

[[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:14, 17 April 2026 (UTC)
: That's because Wikiversity doesn't accept advertising. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 05:20, 17 April 2026 (UTC)
::So this is fine
::'''Online Internship and Digital Learning for Students'''
::Online learning has become an important part of modern education. With the help of the internet and digital tools, students can now study, practice, and gain experience without being physically present in a classroom. One key part of this system is the online internship, which helps students learn real-world skills along with their studies.
::An online internship allows students to work on tasks and projects through digital platforms. This makes learning more practical and useful, especially for those who want to understand how real work environments function.
::'''Background'''
::The concept of online learning developed from distance education, where students learned from remote locations. Over time, with the growth of digital technology, learning has become more interactive and flexible.
::The introduction of the online internship has added another important layer to digital education. It combines theoretical learning with practical experience, helping students prepare for future careers.
::During global events such as the COVID-19 pandemic, online education and online internship programs became essential. They helped students continue learning and gaining experience despite restrictions on physical movement.
::'''Importance of Online Internship'''
::An online internship plays an important role in student development. It helps bridge the gap between academic knowledge and practical skills.
::'''Some key points include:'''
::Students understand how real work is done
::They develop basic professional skills
::It supports career readiness
::It allows learning without location limits
::By participating in an online internship, students can improve their confidence and gain early exposure to different fields.
::'''Features of Online Internship-Based Learning'''
::Modern education platforms often include online internship opportunities as part of their learning system. These usually offer:
::Flexible schedules for students
::Access to learning from home
::Beginner-friendly tasks and projects
::A combination of theory and practice
::Such features make online internship programs suitable for a wide range of learners, including beginners.
::'''Learning Tasks'''
::Explore how online internship programs support student learning in digital environments.
::Identify how students can gain practical experience through an online internship
::Analyze the role of flexible learning in improving student engagement
::Understand how online education and internships work together
::'''References'''
::[https://ijpsl.in/wp-content/uploads/2020/09/E-Learning_Hanaaya-Navaneeth.pdf The Past, Present and Future of E-Learning: Hanaaya Varyani and Navaneeth M S]
::[https://ieeexplore.ieee.org/document/9788102 Current Trends and Future Perspectives of e-Learning in India]
::'''See Also'''
::[https://easyshiksha.com/online_courses/internship Online Internship]
::[https://easyshiksha.com/online_courses/ Online Courses]
::[https://easyshiksha.com/online_courses/kids-learning Kids Learning]
::[https://easyshiksha.com/career_helper/ Career Guidance] [[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:27, 17 April 2026 (UTC)
:::@[[User:EasyshikshaMarketing|EasyshikshaMarketing]] Wikiversity is a resource for education, or a space for education. However, your intention to link to another website is obvious, and such content does not belong here, as it contradicts the purpose of Wikiversity. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:38, 17 April 2026 (UTC)

==AI-generated images==
Seeking your advice.

Myself and students use some AI-generated images in the [[Motivation and emotion]] project.

[[User:Dronebogus]] has been removing some of these images from Wikiversity pages and nominating them for deletion at Commons. As a result, some have been deleted and some have been kept.

Dronebogus has made some useful edits and image suggestions for [[Motivation and emotion]] which I've appreciated and  incorporated. However, there are other edits to remove an AI image by Dronebogus that I've reverted where I think the image is more educational than no image or an alternative image suggested by Dronebogus.

There are a couple of pages where Dronebogus has reverted my reversion, so we are at risk of edit warring. We have briefly discussed and warned each other on our user talk pages, but it seems to come down to a difference in perception about the educational usefulness of the AI images.

So, I'm asking here for others to please review the recent edit histories for these pages:
* [[Motivation and emotion/Lectures/Brain and physiological needs]]
* [[Motivation and emotion/Book/2025/Stockholm syndrome emotion]]

and let us know what you think about the AI image suitability vs. using no image or alternative images suggested by Dronebogus.

Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:45, 26 April 2026 (UTC)

:I think Jtneill needs to try harder to find non-AI alternatives both on Commons and the web. I’m not reiterating the well known problems with generative AI— you can read about those on Wikipedia and the broader Internet. Needless to say it’s kind of just inherently toxic. If you use it, it should be the last resort of last resorts. Just my stance, which I consider perfectly valid and reasonable. [[User:Dronebogus|Dronebogus]] ([[User talk:Dronebogus|discuss]] • [[Special:Contributions/Dronebogus|contribs]]) 04:10, 27 April 2026 (UTC)

== Request for Page Creation Approval - Research on Dr. Ian Stevenson ==


'''Hello Administrators,'''

I am a digital archivist and researcher attempting to create an educational page regarding Dr. Ian Stevenson's scientific work, specifically titled &quot;Where Reincarnation and Biology Intersect&quot; and its official Vietnamese edition.

My edits are purely constructive, aimed at integrating local research context with global structured data (including '''Wikidata Q139548587'''). The automated filter is currently preventing publication due to &quot;new user external link limits.&quot;

I have ensured that all citations, references, and images (sourced from Wikimedia Commons) are strictly academic and non-promotional. Could you please review my contributions and consider whitelisting my account or approving this specific page creation?

Thank you for your assistance in preserving this research '''legacy''' within the open knowledge ecosystem.

'''Best regards,''' [[User:Ian Stevenson777|Ian Stevenson777]] ([[User talk:Ian Stevenson777|discuss]] • [[Special:Contributions/Ian Stevenson777|contribs]]) 07:26, 28 April 2026 (UTC)
: The page title should probably be in English, as this is English Wikiversity. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:19, 28 April 2026 (UTC)
:@[[User:Ian Stevenson777|Ian Stevenson777]] I looked at the text and it seems to me that it is informative, but the user cannot learn anything from it because they would have to buy the book. In this regard, it seems to me that it is enough [[:w:Where Reincarnation and Biology Intersect|to have that article on Wikipedia]] and there is no need to duplicate it here on Wikiversity. If you are particularly interested with its Vietnamese translation, I would focus on Vietnamese Wikipedia, but it seems to me, that the article there [https://vi.wikipedia.org/w/index.php?title=N%C6%A1i_lu%C3%A2n_h%E1%BB%93i_v%C3%A0_sinh_h%E1%BB%8Dc_giao_nhau&amp;oldid=75029095 have some problems at the moment]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:51, 5 May 2026 (UTC)
:This request is AI-generated and was made by a lock evading LTA. Please ignore it. [[User:NguoiDungKhongDinhDanh|NguoiDungKhongDinhDanh]] ([[User talk:NguoiDungKhongDinhDanh|discuss]] • [[Special:Contributions/NguoiDungKhongDinhDanh|contribs]]) 23:58, 13 May 2026 (UTC)

== Call for custodians and bureaucrats ==
&lt;div class=&quot;cd-moveMark&quot;&gt;''Moved to [[Wikiversity:Notices for custodians#Call for custodians and bureaucrats]].  [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 18:46, 12 May 2026 (UTC)''&lt;/div&gt;

== Interface administrator flag request ==

@[[User:Jtneill|Jtneill]], @[[User:Mu301|Mu301]] I am requesting IA flag to delete [[MediaWiki:Gadget-WikiSign.js]]. It was requested for deletion by [[User:Sophivorus|a trusted user]] and I think it can be deleted. Once I delete it, I will notify you and you can remove the flag. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:24, 10 May 2026 (UTC)

:Can you enable two-factor authentication? 
:Policy: [[Wikiversity:Interface administrators]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:27, 10 May 2026 (UTC)
::Done @[[User:Jtneill|Jtneill]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:20, 11 May 2026 (UTC)
:::You are an interface administrator for 24 hours. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:57, 11 May 2026 (UTC)
::::Thx @[[User:Jtneill|Jtneill]], I have just deleted the page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:59, 11 May 2026 (UTC)

== Block request ==

Hi. Please block @[[User:Skibidi Titan 5.0|Skibidi Titan 5.0]]. Reason : Vandalism.

Thanks, [[User:Locpac|Locpac]] ([[User talk:Locpac|discuss]] • [[Special:Contributions/Locpac|contribs]]) 15:10, 10 May 2026 (UTC)

:Thankyou. Done. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 15:25, 10 May 2026 (UTC)


== ~2026-28496-53 ==

Please block [[Special:Contribs/~2026-28496-53]], vandalism. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:02, 11 May 2026 (UTC)

:{{done}} Thank you! —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 17:14, 11 May 2026 (UTC)

== ~2026-28792-52 ==

Please block [[Special:Contribs/~2026-28792-52]], vandalism. Appears to be same user as above. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:38, 12 May 2026 (UTC)
: Blocked locally by Barras. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 17:46, 12 May 2026 (UTC)</text>
      <sha1>bs2xtyz58q6us2ionk7j4phqpekfxgc</sha1>
    </revision>
    <revision>
      <id>2809695</id>
      <parentid>2809693</parentid>
      <timestamp>2026-05-16T19:20:55Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Harold Foppele adding LLM-generated nonsense and personal fiction */ archive to [[Wikiversity:Request custodian action/Archive/30#Harold Foppele adding LLM-generated nonsense and personal fiction]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809695</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="33515" sha1="2u79akuxx5e00ev5f8be0hz89ush2p2" xml:space="preserve">{{/Header}}

== Repeated removal of RFD notices by Harold Foppele ==

{{User|Harold Foppele }}

This editor is appearing in multiple noticeboards for behaviour which is contentious. Ther latest adventure is the repeated removal of tye RFD notice at [[Quantum/Henry C. Kapteyn]]. You will see from their contributions record the number of times. I have warned Tham on their user tag page that this is tantaomunt to volunteering to be blocked here. They have a track record of achieving blocks on enWiki and Commons already.

They have all the appearance of shooting not to understand when given direct information about their behaviour, whichever project they are editing, and are fast becoming a time sink. Their behaviour across multiple WMF sites may well lead to a Global Lock, but I do not believe they have quite reached the threshold for that.

I believe that what is required is a preventative block to seek to ensure thatchy understand the seriousness of their behaviour, and the need to be collegial. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 23:03, 4 March 2026 (UTC)
: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:45, 8 March 2026 (UTC)

== Blocks for sockpuppet ==

Please block [[User:Harold Foppele]] and [[User:Johnwilliamsiii]] for sockpuppetry based on [https://en.wikipedia.org/wiki/Wikipedia:Sockpuppet_investigations/Harold_Foppele en wiki] CU and [https://commons.wikimedia.org/w/index.php?diff=1177465640 commons] CU investigations. The user has also violated copyright, see the above discussion. A block is necessary to prevent further abuse. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:30, 8 March 2026 (UTC)

:&lt;small&gt;@[[User:MathXplore|MathXplore]]&lt;/small&gt; [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:31, 8 March 2026 (UTC)
:: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:44, 8 March 2026 (UTC)
:CC. @[[User:Timtrent|Timtrent]], @[[User:Sesquilinear|Sesquilinear]], @[[User:Pi.1415926535|Pi.1415926535]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:33, 8 March 2026 (UTC)
::Thank you for the ping. I concur based on [[w:en:WP:DUCK|behaviour]]. CUs appear divided. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 11:41, 8 March 2026 (UTC)

== Problem when trying to start a discussion with authors of the Plurilingual education portal ==

The authors I wanted to discuss with are called &quot;Project PEP&quot; and my name is Franch Chandler. How can I be allowed to do so ? [[User:French Chandler|French Chandler]] ([[User talk:French Chandler|discuss]] • [[Special:Contributions/French Chandler|contribs]]) 18:25, 16 March 2026 (UTC)

:@[[User:French Chandler|French Chandler]] place your qestion [https://en.wikiversity.org/w/index.php?title=User_talk:Projet_PEP&amp;action=edit into the dialog box] on this link and hit Publish page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:22, 16 March 2026 (UTC)

== Please publish my post ==

My post is about &quot;Every child grows and develops at their own pace, but some may experience challenges that affect their ability to perform everyday tasks. These challenges can include difficulties with fine motor skills, sensory processing, handwriting, feeding, and self-regulation. When these issues are not addressed early, they can impact a child’s confidence, academic performance, and independence.

With the rise of digital healthcare services, '''online physical therapy''' has emerged as a powerful and accessible solution for parents seeking support for their children. This modern approach provides structured, personalized therapy programs that can be accessed from the comfort of home, making it easier for families to ensure consistent care.&quot; [[User:Skyabovetherapy|Skyabovetherapy]] ([[User talk:Skyabovetherapy|discuss]] • [[Special:Contributions/Skyabovetherapy|contribs]]) 12:28, 28 March 2026 (UTC)

:@[[User:Skyabovetherapy|Skyabovetherapy]] Well, you can publish it yourself, Wikiversity is a free environement, where everybody can create educational resources. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 14:11, 29 March 2026 (UTC)
::They actually triggered some abuse filters. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 16:24, 29 March 2026 (UTC)
:I looked at your attempts to add this text and I see a link to one website repeated many times, which reminds me of the misuse of Wikiversity for self-promotion or to increase the importance of the website. It is necessary to remind you here that Wikiversity is not a place for promotion, but a place for education. So if you want to educate, it will not be a problem to create the page without external links with a clearly defined procedure for how people should use it and what to expect from it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:07, 1 April 2026 (UTC)

== New user limit ==

Hi, I am creating an AIPA Method learning resource page. 

I am the author of the linked research, and I hit the “new user limit” and “new page with external link” filters while publishing. 

Here is the link to the page in creation: [https://en.wikiversity.org/w/index.php?title=AIPA_Method&amp;veaction=edit] 

Thank you for your help. 

Best regards, 

Senad Dizdarević [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:19, 30 March 2026 (UTC)

:@[[User:Senad Dizdarević|Senad Dizdarević]] I should admit I dont know, what is &quot;new user limit&quot;, but if filter blocks your page because of certain external link, you may force to save anyway and sometimes it works. It should not work, when the website is blacklisted. As of now, I am not seeing you to save page in main namespace, so try to save it without external links first. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:30, 30 March 2026 (UTC)
::Thank you, you are very kind. 
::I will wait a day, and try again (without links, too). 
::Today, I already created About Me info page, and maybe that is enough for the filters for one day.  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:53, 30 March 2026 (UTC)
:::Well, I have analyzed your contribution to Wikiversity and I should point out here, that this project is not a place for advertising, so there is no way of promoting your books and authority this way. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:56, 1 April 2026 (UTC)
::::Hi, my About Me page is just an info page with the neutral as possible presentation of my work. 
::::There is a big difference between informing and advertising. Informing is neutrally stating that something exists and requiring no action, while advertising is a special communication form with intent to cause certain action from readers. For example, click here, click there, order this, buy that. 
::::There is no such intention, form, or terms on my info page. Just neutral information. I don't hide and I am not ashamed that I am write and author, and that is a part of the usual bio, including works. I checked your user page: &quot;I graduated from the Czech University of Life Sciences in Prague and studied information science at the Faculty of Arts of Charles University.&quot; I think that if you had written a book on Life Science, you would have mentioned that as well.
::::Most of the Info page is about my research and AIPA Method which is a valid contribution to psychology, consciousness studies, identity theory, and personality development. Actually, my paper '''AIPA Method: A Cognitive-Phenomenological Model for Identity Reconstruction and Stabilization in Pure Awareness''' is now in the peer review procedure at Journal of Consciousness Studies. 
::::Here is a part from the Wikiversity AIPA Method page in creation (waiting for the end of the time limit for new users):    [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:47, 2 April 2026 (UTC)
:::::For the unknown reasons, the form didn't publish my second part of the message: 
:::::I believe this is a valid contribution to Wikiversity. 
:::::Best Regards, 
:::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:52, 2 April 2026 (UTC)
::::::And the third try: 
:::::: == Introduction ==
::::::The AIPA Method addresses a gap in contemporary personal development and consciousness science: most evidence‑based approaches (CBT, MBSR, MBCT, standard meditation) operate at the level of mental content—reframing thoughts, observing them, or reducing their impact—rather than at the level of identity structure. In contrast, AIPA targets the structural relationship between the self and the mind, aiming at durable identity reconstruction rooted in Pure Awareness rather than symptom management.
::::::The central research question of the primary AIPA preprint is whether a structured, sequentially staged method can produce permanent identity reconstruction rooted in Pure Awareness, and how such a method compares to established approaches in scope, mechanism, and outcome.
:::::: == Theoretical foundations ==
::::::The AIPA framework is grounded in the cognitive‑phenomenological tradition (e.g., McAdams, Varela, Metzinger, Erikson), contemporary consciousness science on minimal phenomenal experience, and qualitative methods advocacy in psychology. It builds directly on:
::::::* Empirical work on pure awareness and Minimal Phenomenal Experience (MPE), especially Gamma &amp; Metzinger’s large‑scale study of content‑reduced awareness states.
::::::* Metzinger’s proposal of minimal phenomenal experience as an entry point for a minimal unifying model of consciousness.
::::::* Narrative identity and partial‑self models within personality and identity theory.
::::::Within this backdrop, AIPA proposes Pure Awareness as a distinct, operationally specified state that can become a structural ground of identity rather than a transient meditative experience.
:::::: == Experiential empiricism ==
::::::The empirical foundation of the AIPA Method is explicitly first‑person and experiential, combining:
::::::* A 22‑year longitudinal autoethnographic self‑study (2003–2025) documenting partial personality episodes, protocol use, and outcomes.
::::::* A 13‑year prospective verification period with zero self‑reported recurrence of targeted harmful behaviors after a dated stabilization point (1 January 2006).
::::::* A high‑ecological‑validity “stress test” during acute bereavement, used to examine whether non‑reactive awareness remains stable under maximal provocation.
::::::* Two independent practitioner cases (an Amazon‑verified report and a structured questionnaire case) providing preliminary convergent signals across cognitive, emotional, behavioral, and identity dimensions.
::::::All central constructs (Pure Awareness, partial personalities, the Switch, identity stabilization) are operationalized with explicit phenomenological and behavioral criteria intended to enable replication and future third‑person measurement.
::::::I believe this is a valid contribution to Wikiversity. 
::::::Best regards, 
::::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:54, 2 April 2026 (UTC)

== Unable to publish pages  ==

Whenever I try to publish a page with linked sources it gets flagged and says I'm a new user attempting to publish content with outside links. Those outside links are my sources. [[User:Soboyed|Soboyed]] ([[User talk:Soboyed|discuss]] • [[Special:Contributions/Soboyed|contribs]]) 04:52, 2 April 2026 (UTC)

:This restriction is automatically lifted after you have edited for a certain time (I don't recall that time off-hand, but it is not long). This is designed to stop spam. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 04:53, 2 April 2026 (UTC)

== Showing error to publish a Post ==

My  action was constructive, not destructive, please allow to publish it. [[Special:Contributions/&amp;#126;2026-20906-18|&amp;#126;2026-20906-18]] ([[User talk:&amp;#126;2026-20906-18|talk]]) 08:06, 4 April 2026 (UTC)

:Maybe you got caught in a filter. Consider [[Special:CreateAccount|creating an account]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:06, 4 April 2026 (UTC)
:Your edits, [https://en.wikiversity.org/w/index.php?title=Special:AbuseLog&amp;wpSearchUser=%7E2026-20906-18 these ones], seems to have tripped a filter when you tried to create a page on [[Create]] which external links. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 23:58, 4 April 2026 (UTC)
:Have you read my [https://en.wikiversity.org/w/index.php?title=Wikiversity:Request_custodian_action&amp;diff=prev&amp;oldid=2802219 previous reply] to you @[[User:~2026-20906-18|~2026-20906-18]]? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:02, 6 April 2026 (UTC)

== Abuse filters which should be deleted ==

Hi, there are some abuse filters which should probably be deleted.
* [[Special:AbuseFilter/1]] (not needed anymore)
* [[Special:AbuseFilter/2]] (no hits since 2018)
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched)
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives)
* [[Special:AbuseFilter/5]] (no hits since 2023)
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore)
* [[Special:AbuseFilter/17]] (no hits since 2022)
* [[Special:AbuseFilter/19]] (no hits since 2019)
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive)
Thanks. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 03:51, 5 April 2026 (UTC)

:Why do these need to be deleted rather than inactivated? Do inactive abuse filters cause a server strain? —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:39, 5 April 2026 (UTC)
:: Deleted filters do not cause strain to the servers. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:28, 5 April 2026 (UTC)
:These sounds like sensible suggestions but, yes, would inactivation perhaps make more sense than deletion for at least some  filters? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:35, 5 April 2026 (UTC)
:I would keep them @[[User:Codename Noreste|Codename Noreste]]. Alternatively, I would turn off the ones that haven't caught anything for a long time, but I would leave them enabled in case they need to be turned on or improved. If someone has already written the code and we don't have hundreds of free man-hours of programmers on Wikiversity, the server load seems secondary to me, and is negligible compared to other things. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:11, 6 April 2026 (UTC)
:: I know how to write abuse filter code and regex, but I would recommend disabling filters that have never caught anything in a long time ''and'' those who made lots of false positives. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:09, 6 April 2026 (UTC)
:::Of course @[[User:Codename Noreste|Codename Noreste]], there are people here today who are capable of changing the code. But the question is what it will be like in a few years, the question is what will happen if those two are busy for a long time, etc. That's why I would leave it so that those who don't know much about code can be inspired by it and will need to do something with it someday - plus, more code for different types of filtering is actually great educational material on how those filters work. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:41, 17 April 2026 (UTC)

Here's the updated list of abuse filters under review with actions I've taken (several disabled, one basic code improvement, and some actions changed) - none have been deleted so they can all be edited and reactivayed - please suggest any further changes:
* [[Special:AbuseFilter/1]] (not needed anymore) - One time account spam bot - 4 hits over 10 years ago - Disabled in 2024 - May be useful in future
* [[Special:AbuseFilter/2]] (no hits since 2018) - Userspace spamming - 778 hits; none since 2018 likely due to global filters - Now disabled
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched) - Specific user page spam - 1,101 hits most recent 7 March 2026 - Still active - Kept enabled
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives) - Questionable Language (profanity) - 6,055 hits including very recently - However it was logging hits without taking any actions - Edited to reduce likelihood of false positives by only applying filter to users with low (&lt; 20) edit count and applied weak actions to tag and warn but not prevent publishing the content
* [[Special:AbuseFilter/5]] (no hits since 2023) - Blocked Solicitation Links - 95 hits; none since 2023 - blocks specific historical spam sites - Non-active - Now disabled
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore) - Not reviewed - They are currently disabled
* [[Special:AbuseFilter/17]] (no hits since 2022) - Fundamental Physics Edits - 347 hits; none since 2022 - Non-active and very specific for a historical issue - Now disabled 
* [[Special:AbuseFilter/19]] (no hits since 2019) - Page Creation - 20 hits; none since 2019 - Retained for historical reference and possible future updates - Now disabled
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive) - Globally Banned Editor (renamed to Low-edit Spam Monitor) - 2,829 hits including very recent - Only applies to users with less than 5 edits and takes no actions / monitoring only - Reviewing the details of the hits I don't see many false positives and have strengthened its actions to add a tag and warning

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:57, 9 April 2026 (UTC)

== Block request ==

Please block ~2026-20985-80/~2026-21079-90/~2026-21223-88. Reason: Vandalism. [[User:Àncilu|Àncilu]] ([[User talk:Àncilu|discuss]] • [[Special:Contributions/Àncilu|contribs]]) 23:24, 5 April 2026 (UTC)

:All edits should be deleted and the first is blocked by Atcovi. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:33, 6 April 2026 (UTC)

== Antispam - Filter 12 ==
{{ping|Codename Noreste}} Thanks for contacting me with a suggested [[Special:AbuseFilter|abuse filter]] for the coupon spam we've been getting. A very much appreciated time saver. Per your suggestion, abuse filter 12 has been reactivated with your updated regex. It should tag and prevent page creation actions for coupon promo etc. Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:33, 15 April 2026 (UTC)
: @[[User:Jtneill|Jtneill]] Please do the following to filter 12:
:# Enable the block action (temporary for unregistered users, indefinite for registered users)
:# Disable both the disallow and tag actions, since that filter will be set to block
: Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:42, 5 May 2026 (UTC)
::Excellent. Done:
::* Block duration for non-registered users = 1 week
::* Block duration for registered users = indefinite
::* Disallow and tagging disabled
::Thankyou. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:24, 9 May 2026 (UTC)

== Urgent! error message This action has been automatically identified as potentially harmful, and therefore disallowed ==

While submitting the post this error was coming &quot;This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please inform an administrator of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link&quot; How to resolve it?

Here is the content:

{{note|marketing material removed}}

[[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:14, 17 April 2026 (UTC)
: That's because Wikiversity doesn't accept advertising. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 05:20, 17 April 2026 (UTC)
::So this is fine
::'''Online Internship and Digital Learning for Students'''
::Online learning has become an important part of modern education. With the help of the internet and digital tools, students can now study, practice, and gain experience without being physically present in a classroom. One key part of this system is the online internship, which helps students learn real-world skills along with their studies.
::An online internship allows students to work on tasks and projects through digital platforms. This makes learning more practical and useful, especially for those who want to understand how real work environments function.
::'''Background'''
::The concept of online learning developed from distance education, where students learned from remote locations. Over time, with the growth of digital technology, learning has become more interactive and flexible.
::The introduction of the online internship has added another important layer to digital education. It combines theoretical learning with practical experience, helping students prepare for future careers.
::During global events such as the COVID-19 pandemic, online education and online internship programs became essential. They helped students continue learning and gaining experience despite restrictions on physical movement.
::'''Importance of Online Internship'''
::An online internship plays an important role in student development. It helps bridge the gap between academic knowledge and practical skills.
::'''Some key points include:'''
::Students understand how real work is done
::They develop basic professional skills
::It supports career readiness
::It allows learning without location limits
::By participating in an online internship, students can improve their confidence and gain early exposure to different fields.
::'''Features of Online Internship-Based Learning'''
::Modern education platforms often include online internship opportunities as part of their learning system. These usually offer:
::Flexible schedules for students
::Access to learning from home
::Beginner-friendly tasks and projects
::A combination of theory and practice
::Such features make online internship programs suitable for a wide range of learners, including beginners.
::'''Learning Tasks'''
::Explore how online internship programs support student learning in digital environments.
::Identify how students can gain practical experience through an online internship
::Analyze the role of flexible learning in improving student engagement
::Understand how online education and internships work together
::'''References'''
::[https://ijpsl.in/wp-content/uploads/2020/09/E-Learning_Hanaaya-Navaneeth.pdf The Past, Present and Future of E-Learning: Hanaaya Varyani and Navaneeth M S]
::[https://ieeexplore.ieee.org/document/9788102 Current Trends and Future Perspectives of e-Learning in India]
::'''See Also'''
::[https://easyshiksha.com/online_courses/internship Online Internship]
::[https://easyshiksha.com/online_courses/ Online Courses]
::[https://easyshiksha.com/online_courses/kids-learning Kids Learning]
::[https://easyshiksha.com/career_helper/ Career Guidance] [[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:27, 17 April 2026 (UTC)
:::@[[User:EasyshikshaMarketing|EasyshikshaMarketing]] Wikiversity is a resource for education, or a space for education. However, your intention to link to another website is obvious, and such content does not belong here, as it contradicts the purpose of Wikiversity. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:38, 17 April 2026 (UTC)

==AI-generated images==
Seeking your advice.

Myself and students use some AI-generated images in the [[Motivation and emotion]] project.

[[User:Dronebogus]] has been removing some of these images from Wikiversity pages and nominating them for deletion at Commons. As a result, some have been deleted and some have been kept.

Dronebogus has made some useful edits and image suggestions for [[Motivation and emotion]] which I've appreciated and  incorporated. However, there are other edits to remove an AI image by Dronebogus that I've reverted where I think the image is more educational than no image or an alternative image suggested by Dronebogus.

There are a couple of pages where Dronebogus has reverted my reversion, so we are at risk of edit warring. We have briefly discussed and warned each other on our user talk pages, but it seems to come down to a difference in perception about the educational usefulness of the AI images.

So, I'm asking here for others to please review the recent edit histories for these pages:
* [[Motivation and emotion/Lectures/Brain and physiological needs]]
* [[Motivation and emotion/Book/2025/Stockholm syndrome emotion]]

and let us know what you think about the AI image suitability vs. using no image or alternative images suggested by Dronebogus.

Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:45, 26 April 2026 (UTC)

:I think Jtneill needs to try harder to find non-AI alternatives both on Commons and the web. I’m not reiterating the well known problems with generative AI— you can read about those on Wikipedia and the broader Internet. Needless to say it’s kind of just inherently toxic. If you use it, it should be the last resort of last resorts. Just my stance, which I consider perfectly valid and reasonable. [[User:Dronebogus|Dronebogus]] ([[User talk:Dronebogus|discuss]] • [[Special:Contributions/Dronebogus|contribs]]) 04:10, 27 April 2026 (UTC)

== Request for Page Creation Approval - Research on Dr. Ian Stevenson ==


'''Hello Administrators,'''

I am a digital archivist and researcher attempting to create an educational page regarding Dr. Ian Stevenson's scientific work, specifically titled &quot;Where Reincarnation and Biology Intersect&quot; and its official Vietnamese edition.

My edits are purely constructive, aimed at integrating local research context with global structured data (including '''Wikidata Q139548587'''). The automated filter is currently preventing publication due to &quot;new user external link limits.&quot;

I have ensured that all citations, references, and images (sourced from Wikimedia Commons) are strictly academic and non-promotional. Could you please review my contributions and consider whitelisting my account or approving this specific page creation?

Thank you for your assistance in preserving this research '''legacy''' within the open knowledge ecosystem.

'''Best regards,''' [[User:Ian Stevenson777|Ian Stevenson777]] ([[User talk:Ian Stevenson777|discuss]] • [[Special:Contributions/Ian Stevenson777|contribs]]) 07:26, 28 April 2026 (UTC)
: The page title should probably be in English, as this is English Wikiversity. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:19, 28 April 2026 (UTC)
:@[[User:Ian Stevenson777|Ian Stevenson777]] I looked at the text and it seems to me that it is informative, but the user cannot learn anything from it because they would have to buy the book. In this regard, it seems to me that it is enough [[:w:Where Reincarnation and Biology Intersect|to have that article on Wikipedia]] and there is no need to duplicate it here on Wikiversity. If you are particularly interested with its Vietnamese translation, I would focus on Vietnamese Wikipedia, but it seems to me, that the article there [https://vi.wikipedia.org/w/index.php?title=N%C6%A1i_lu%C3%A2n_h%E1%BB%93i_v%C3%A0_sinh_h%E1%BB%8Dc_giao_nhau&amp;oldid=75029095 have some problems at the moment]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:51, 5 May 2026 (UTC)
:This request is AI-generated and was made by a lock evading LTA. Please ignore it. [[User:NguoiDungKhongDinhDanh|NguoiDungKhongDinhDanh]] ([[User talk:NguoiDungKhongDinhDanh|discuss]] • [[Special:Contributions/NguoiDungKhongDinhDanh|contribs]]) 23:58, 13 May 2026 (UTC)

== Call for custodians and bureaucrats ==
&lt;div class=&quot;cd-moveMark&quot;&gt;''Moved to [[Wikiversity:Notices for custodians#Call for custodians and bureaucrats]].  [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 18:46, 12 May 2026 (UTC)''&lt;/div&gt;

== Interface administrator flag request ==

@[[User:Jtneill|Jtneill]], @[[User:Mu301|Mu301]] I am requesting IA flag to delete [[MediaWiki:Gadget-WikiSign.js]]. It was requested for deletion by [[User:Sophivorus|a trusted user]] and I think it can be deleted. Once I delete it, I will notify you and you can remove the flag. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:24, 10 May 2026 (UTC)

:Can you enable two-factor authentication? 
:Policy: [[Wikiversity:Interface administrators]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:27, 10 May 2026 (UTC)
::Done @[[User:Jtneill|Jtneill]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:20, 11 May 2026 (UTC)
:::You are an interface administrator for 24 hours. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:57, 11 May 2026 (UTC)
::::Thx @[[User:Jtneill|Jtneill]], I have just deleted the page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:59, 11 May 2026 (UTC)

== Block request ==

Hi. Please block @[[User:Skibidi Titan 5.0|Skibidi Titan 5.0]]. Reason : Vandalism.

Thanks, [[User:Locpac|Locpac]] ([[User talk:Locpac|discuss]] • [[Special:Contributions/Locpac|contribs]]) 15:10, 10 May 2026 (UTC)

:Thankyou. Done. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 15:25, 10 May 2026 (UTC)


== ~2026-28496-53 ==

Please block [[Special:Contribs/~2026-28496-53]], vandalism. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:02, 11 May 2026 (UTC)

:{{done}} Thank you! —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 17:14, 11 May 2026 (UTC)

== ~2026-28792-52 ==

Please block [[Special:Contribs/~2026-28792-52]], vandalism. Appears to be same user as above. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:38, 12 May 2026 (UTC)
: Blocked locally by Barras. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 17:46, 12 May 2026 (UTC)</text>
      <sha1>2u79akuxx5e00ev5f8be0hz89ush2p2</sha1>
    </revision>
    <revision>
      <id>2809697</id>
      <parentid>2809695</parentid>
      <timestamp>2026-05-16T19:21:37Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Repeated removal of RFD notices by Harold Foppele */ archive to [[Wikiversity:Request custodian action/Archive/30#Repeated removal of RFD notices by Harold Foppele]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809697</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="32204" sha1="j2kv6gyqntei2x2a9qv5sm1gx8zzv9f" xml:space="preserve">{{/Header}}

== Blocks for sockpuppet ==

Please block [[User:Harold Foppele]] and [[User:Johnwilliamsiii]] for sockpuppetry based on [https://en.wikipedia.org/wiki/Wikipedia:Sockpuppet_investigations/Harold_Foppele en wiki] CU and [https://commons.wikimedia.org/w/index.php?diff=1177465640 commons] CU investigations. The user has also violated copyright, see the above discussion. A block is necessary to prevent further abuse. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:30, 8 March 2026 (UTC)

:&lt;small&gt;@[[User:MathXplore|MathXplore]]&lt;/small&gt; [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:31, 8 March 2026 (UTC)
:: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:44, 8 March 2026 (UTC)
:CC. @[[User:Timtrent|Timtrent]], @[[User:Sesquilinear|Sesquilinear]], @[[User:Pi.1415926535|Pi.1415926535]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:33, 8 March 2026 (UTC)
::Thank you for the ping. I concur based on [[w:en:WP:DUCK|behaviour]]. CUs appear divided. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 11:41, 8 March 2026 (UTC)

== Problem when trying to start a discussion with authors of the Plurilingual education portal ==

The authors I wanted to discuss with are called &quot;Project PEP&quot; and my name is Franch Chandler. How can I be allowed to do so ? [[User:French Chandler|French Chandler]] ([[User talk:French Chandler|discuss]] • [[Special:Contributions/French Chandler|contribs]]) 18:25, 16 March 2026 (UTC)

:@[[User:French Chandler|French Chandler]] place your qestion [https://en.wikiversity.org/w/index.php?title=User_talk:Projet_PEP&amp;action=edit into the dialog box] on this link and hit Publish page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:22, 16 March 2026 (UTC)

== Please publish my post ==

My post is about &quot;Every child grows and develops at their own pace, but some may experience challenges that affect their ability to perform everyday tasks. These challenges can include difficulties with fine motor skills, sensory processing, handwriting, feeding, and self-regulation. When these issues are not addressed early, they can impact a child’s confidence, academic performance, and independence.

With the rise of digital healthcare services, '''online physical therapy''' has emerged as a powerful and accessible solution for parents seeking support for their children. This modern approach provides structured, personalized therapy programs that can be accessed from the comfort of home, making it easier for families to ensure consistent care.&quot; [[User:Skyabovetherapy|Skyabovetherapy]] ([[User talk:Skyabovetherapy|discuss]] • [[Special:Contributions/Skyabovetherapy|contribs]]) 12:28, 28 March 2026 (UTC)

:@[[User:Skyabovetherapy|Skyabovetherapy]] Well, you can publish it yourself, Wikiversity is a free environement, where everybody can create educational resources. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 14:11, 29 March 2026 (UTC)
::They actually triggered some abuse filters. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 16:24, 29 March 2026 (UTC)
:I looked at your attempts to add this text and I see a link to one website repeated many times, which reminds me of the misuse of Wikiversity for self-promotion or to increase the importance of the website. It is necessary to remind you here that Wikiversity is not a place for promotion, but a place for education. So if you want to educate, it will not be a problem to create the page without external links with a clearly defined procedure for how people should use it and what to expect from it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:07, 1 April 2026 (UTC)

== New user limit ==

Hi, I am creating an AIPA Method learning resource page. 

I am the author of the linked research, and I hit the “new user limit” and “new page with external link” filters while publishing. 

Here is the link to the page in creation: [https://en.wikiversity.org/w/index.php?title=AIPA_Method&amp;veaction=edit] 

Thank you for your help. 

Best regards, 

Senad Dizdarević [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:19, 30 March 2026 (UTC)

:@[[User:Senad Dizdarević|Senad Dizdarević]] I should admit I dont know, what is &quot;new user limit&quot;, but if filter blocks your page because of certain external link, you may force to save anyway and sometimes it works. It should not work, when the website is blacklisted. As of now, I am not seeing you to save page in main namespace, so try to save it without external links first. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:30, 30 March 2026 (UTC)
::Thank you, you are very kind. 
::I will wait a day, and try again (without links, too). 
::Today, I already created About Me info page, and maybe that is enough for the filters for one day.  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:53, 30 March 2026 (UTC)
:::Well, I have analyzed your contribution to Wikiversity and I should point out here, that this project is not a place for advertising, so there is no way of promoting your books and authority this way. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:56, 1 April 2026 (UTC)
::::Hi, my About Me page is just an info page with the neutral as possible presentation of my work. 
::::There is a big difference between informing and advertising. Informing is neutrally stating that something exists and requiring no action, while advertising is a special communication form with intent to cause certain action from readers. For example, click here, click there, order this, buy that. 
::::There is no such intention, form, or terms on my info page. Just neutral information. I don't hide and I am not ashamed that I am write and author, and that is a part of the usual bio, including works. I checked your user page: &quot;I graduated from the Czech University of Life Sciences in Prague and studied information science at the Faculty of Arts of Charles University.&quot; I think that if you had written a book on Life Science, you would have mentioned that as well.
::::Most of the Info page is about my research and AIPA Method which is a valid contribution to psychology, consciousness studies, identity theory, and personality development. Actually, my paper '''AIPA Method: A Cognitive-Phenomenological Model for Identity Reconstruction and Stabilization in Pure Awareness''' is now in the peer review procedure at Journal of Consciousness Studies. 
::::Here is a part from the Wikiversity AIPA Method page in creation (waiting for the end of the time limit for new users):    [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:47, 2 April 2026 (UTC)
:::::For the unknown reasons, the form didn't publish my second part of the message: 
:::::I believe this is a valid contribution to Wikiversity. 
:::::Best Regards, 
:::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:52, 2 April 2026 (UTC)
::::::And the third try: 
:::::: == Introduction ==
::::::The AIPA Method addresses a gap in contemporary personal development and consciousness science: most evidence‑based approaches (CBT, MBSR, MBCT, standard meditation) operate at the level of mental content—reframing thoughts, observing them, or reducing their impact—rather than at the level of identity structure. In contrast, AIPA targets the structural relationship between the self and the mind, aiming at durable identity reconstruction rooted in Pure Awareness rather than symptom management.
::::::The central research question of the primary AIPA preprint is whether a structured, sequentially staged method can produce permanent identity reconstruction rooted in Pure Awareness, and how such a method compares to established approaches in scope, mechanism, and outcome.
:::::: == Theoretical foundations ==
::::::The AIPA framework is grounded in the cognitive‑phenomenological tradition (e.g., McAdams, Varela, Metzinger, Erikson), contemporary consciousness science on minimal phenomenal experience, and qualitative methods advocacy in psychology. It builds directly on:
::::::* Empirical work on pure awareness and Minimal Phenomenal Experience (MPE), especially Gamma &amp; Metzinger’s large‑scale study of content‑reduced awareness states.
::::::* Metzinger’s proposal of minimal phenomenal experience as an entry point for a minimal unifying model of consciousness.
::::::* Narrative identity and partial‑self models within personality and identity theory.
::::::Within this backdrop, AIPA proposes Pure Awareness as a distinct, operationally specified state that can become a structural ground of identity rather than a transient meditative experience.
:::::: == Experiential empiricism ==
::::::The empirical foundation of the AIPA Method is explicitly first‑person and experiential, combining:
::::::* A 22‑year longitudinal autoethnographic self‑study (2003–2025) documenting partial personality episodes, protocol use, and outcomes.
::::::* A 13‑year prospective verification period with zero self‑reported recurrence of targeted harmful behaviors after a dated stabilization point (1 January 2006).
::::::* A high‑ecological‑validity “stress test” during acute bereavement, used to examine whether non‑reactive awareness remains stable under maximal provocation.
::::::* Two independent practitioner cases (an Amazon‑verified report and a structured questionnaire case) providing preliminary convergent signals across cognitive, emotional, behavioral, and identity dimensions.
::::::All central constructs (Pure Awareness, partial personalities, the Switch, identity stabilization) are operationalized with explicit phenomenological and behavioral criteria intended to enable replication and future third‑person measurement.
::::::I believe this is a valid contribution to Wikiversity. 
::::::Best regards, 
::::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:54, 2 April 2026 (UTC)

== Unable to publish pages  ==

Whenever I try to publish a page with linked sources it gets flagged and says I'm a new user attempting to publish content with outside links. Those outside links are my sources. [[User:Soboyed|Soboyed]] ([[User talk:Soboyed|discuss]] • [[Special:Contributions/Soboyed|contribs]]) 04:52, 2 April 2026 (UTC)

:This restriction is automatically lifted after you have edited for a certain time (I don't recall that time off-hand, but it is not long). This is designed to stop spam. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 04:53, 2 April 2026 (UTC)

== Showing error to publish a Post ==

My  action was constructive, not destructive, please allow to publish it. [[Special:Contributions/&amp;#126;2026-20906-18|&amp;#126;2026-20906-18]] ([[User talk:&amp;#126;2026-20906-18|talk]]) 08:06, 4 April 2026 (UTC)

:Maybe you got caught in a filter. Consider [[Special:CreateAccount|creating an account]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:06, 4 April 2026 (UTC)
:Your edits, [https://en.wikiversity.org/w/index.php?title=Special:AbuseLog&amp;wpSearchUser=%7E2026-20906-18 these ones], seems to have tripped a filter when you tried to create a page on [[Create]] which external links. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 23:58, 4 April 2026 (UTC)
:Have you read my [https://en.wikiversity.org/w/index.php?title=Wikiversity:Request_custodian_action&amp;diff=prev&amp;oldid=2802219 previous reply] to you @[[User:~2026-20906-18|~2026-20906-18]]? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:02, 6 April 2026 (UTC)

== Abuse filters which should be deleted ==

Hi, there are some abuse filters which should probably be deleted.
* [[Special:AbuseFilter/1]] (not needed anymore)
* [[Special:AbuseFilter/2]] (no hits since 2018)
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched)
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives)
* [[Special:AbuseFilter/5]] (no hits since 2023)
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore)
* [[Special:AbuseFilter/17]] (no hits since 2022)
* [[Special:AbuseFilter/19]] (no hits since 2019)
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive)
Thanks. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 03:51, 5 April 2026 (UTC)

:Why do these need to be deleted rather than inactivated? Do inactive abuse filters cause a server strain? —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:39, 5 April 2026 (UTC)
:: Deleted filters do not cause strain to the servers. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:28, 5 April 2026 (UTC)
:These sounds like sensible suggestions but, yes, would inactivation perhaps make more sense than deletion for at least some  filters? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:35, 5 April 2026 (UTC)
:I would keep them @[[User:Codename Noreste|Codename Noreste]]. Alternatively, I would turn off the ones that haven't caught anything for a long time, but I would leave them enabled in case they need to be turned on or improved. If someone has already written the code and we don't have hundreds of free man-hours of programmers on Wikiversity, the server load seems secondary to me, and is negligible compared to other things. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:11, 6 April 2026 (UTC)
:: I know how to write abuse filter code and regex, but I would recommend disabling filters that have never caught anything in a long time ''and'' those who made lots of false positives. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:09, 6 April 2026 (UTC)
:::Of course @[[User:Codename Noreste|Codename Noreste]], there are people here today who are capable of changing the code. But the question is what it will be like in a few years, the question is what will happen if those two are busy for a long time, etc. That's why I would leave it so that those who don't know much about code can be inspired by it and will need to do something with it someday - plus, more code for different types of filtering is actually great educational material on how those filters work. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:41, 17 April 2026 (UTC)

Here's the updated list of abuse filters under review with actions I've taken (several disabled, one basic code improvement, and some actions changed) - none have been deleted so they can all be edited and reactivayed - please suggest any further changes:
* [[Special:AbuseFilter/1]] (not needed anymore) - One time account spam bot - 4 hits over 10 years ago - Disabled in 2024 - May be useful in future
* [[Special:AbuseFilter/2]] (no hits since 2018) - Userspace spamming - 778 hits; none since 2018 likely due to global filters - Now disabled
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched) - Specific user page spam - 1,101 hits most recent 7 March 2026 - Still active - Kept enabled
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives) - Questionable Language (profanity) - 6,055 hits including very recently - However it was logging hits without taking any actions - Edited to reduce likelihood of false positives by only applying filter to users with low (&lt; 20) edit count and applied weak actions to tag and warn but not prevent publishing the content
* [[Special:AbuseFilter/5]] (no hits since 2023) - Blocked Solicitation Links - 95 hits; none since 2023 - blocks specific historical spam sites - Non-active - Now disabled
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore) - Not reviewed - They are currently disabled
* [[Special:AbuseFilter/17]] (no hits since 2022) - Fundamental Physics Edits - 347 hits; none since 2022 - Non-active and very specific for a historical issue - Now disabled 
* [[Special:AbuseFilter/19]] (no hits since 2019) - Page Creation - 20 hits; none since 2019 - Retained for historical reference and possible future updates - Now disabled
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive) - Globally Banned Editor (renamed to Low-edit Spam Monitor) - 2,829 hits including very recent - Only applies to users with less than 5 edits and takes no actions / monitoring only - Reviewing the details of the hits I don't see many false positives and have strengthened its actions to add a tag and warning

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:57, 9 April 2026 (UTC)

== Block request ==

Please block ~2026-20985-80/~2026-21079-90/~2026-21223-88. Reason: Vandalism. [[User:Àncilu|Àncilu]] ([[User talk:Àncilu|discuss]] • [[Special:Contributions/Àncilu|contribs]]) 23:24, 5 April 2026 (UTC)

:All edits should be deleted and the first is blocked by Atcovi. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:33, 6 April 2026 (UTC)

== Antispam - Filter 12 ==
{{ping|Codename Noreste}} Thanks for contacting me with a suggested [[Special:AbuseFilter|abuse filter]] for the coupon spam we've been getting. A very much appreciated time saver. Per your suggestion, abuse filter 12 has been reactivated with your updated regex. It should tag and prevent page creation actions for coupon promo etc. Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:33, 15 April 2026 (UTC)
: @[[User:Jtneill|Jtneill]] Please do the following to filter 12:
:# Enable the block action (temporary for unregistered users, indefinite for registered users)
:# Disable both the disallow and tag actions, since that filter will be set to block
: Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:42, 5 May 2026 (UTC)
::Excellent. Done:
::* Block duration for non-registered users = 1 week
::* Block duration for registered users = indefinite
::* Disallow and tagging disabled
::Thankyou. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:24, 9 May 2026 (UTC)

== Urgent! error message This action has been automatically identified as potentially harmful, and therefore disallowed ==

While submitting the post this error was coming &quot;This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please inform an administrator of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link&quot; How to resolve it?

Here is the content:

{{note|marketing material removed}}

[[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:14, 17 April 2026 (UTC)
: That's because Wikiversity doesn't accept advertising. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 05:20, 17 April 2026 (UTC)
::So this is fine
::'''Online Internship and Digital Learning for Students'''
::Online learning has become an important part of modern education. With the help of the internet and digital tools, students can now study, practice, and gain experience without being physically present in a classroom. One key part of this system is the online internship, which helps students learn real-world skills along with their studies.
::An online internship allows students to work on tasks and projects through digital platforms. This makes learning more practical and useful, especially for those who want to understand how real work environments function.
::'''Background'''
::The concept of online learning developed from distance education, where students learned from remote locations. Over time, with the growth of digital technology, learning has become more interactive and flexible.
::The introduction of the online internship has added another important layer to digital education. It combines theoretical learning with practical experience, helping students prepare for future careers.
::During global events such as the COVID-19 pandemic, online education and online internship programs became essential. They helped students continue learning and gaining experience despite restrictions on physical movement.
::'''Importance of Online Internship'''
::An online internship plays an important role in student development. It helps bridge the gap between academic knowledge and practical skills.
::'''Some key points include:'''
::Students understand how real work is done
::They develop basic professional skills
::It supports career readiness
::It allows learning without location limits
::By participating in an online internship, students can improve their confidence and gain early exposure to different fields.
::'''Features of Online Internship-Based Learning'''
::Modern education platforms often include online internship opportunities as part of their learning system. These usually offer:
::Flexible schedules for students
::Access to learning from home
::Beginner-friendly tasks and projects
::A combination of theory and practice
::Such features make online internship programs suitable for a wide range of learners, including beginners.
::'''Learning Tasks'''
::Explore how online internship programs support student learning in digital environments.
::Identify how students can gain practical experience through an online internship
::Analyze the role of flexible learning in improving student engagement
::Understand how online education and internships work together
::'''References'''
::[https://ijpsl.in/wp-content/uploads/2020/09/E-Learning_Hanaaya-Navaneeth.pdf The Past, Present and Future of E-Learning: Hanaaya Varyani and Navaneeth M S]
::[https://ieeexplore.ieee.org/document/9788102 Current Trends and Future Perspectives of e-Learning in India]
::'''See Also'''
::[https://easyshiksha.com/online_courses/internship Online Internship]
::[https://easyshiksha.com/online_courses/ Online Courses]
::[https://easyshiksha.com/online_courses/kids-learning Kids Learning]
::[https://easyshiksha.com/career_helper/ Career Guidance] [[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:27, 17 April 2026 (UTC)
:::@[[User:EasyshikshaMarketing|EasyshikshaMarketing]] Wikiversity is a resource for education, or a space for education. However, your intention to link to another website is obvious, and such content does not belong here, as it contradicts the purpose of Wikiversity. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:38, 17 April 2026 (UTC)

==AI-generated images==
Seeking your advice.

Myself and students use some AI-generated images in the [[Motivation and emotion]] project.

[[User:Dronebogus]] has been removing some of these images from Wikiversity pages and nominating them for deletion at Commons. As a result, some have been deleted and some have been kept.

Dronebogus has made some useful edits and image suggestions for [[Motivation and emotion]] which I've appreciated and  incorporated. However, there are other edits to remove an AI image by Dronebogus that I've reverted where I think the image is more educational than no image or an alternative image suggested by Dronebogus.

There are a couple of pages where Dronebogus has reverted my reversion, so we are at risk of edit warring. We have briefly discussed and warned each other on our user talk pages, but it seems to come down to a difference in perception about the educational usefulness of the AI images.

So, I'm asking here for others to please review the recent edit histories for these pages:
* [[Motivation and emotion/Lectures/Brain and physiological needs]]
* [[Motivation and emotion/Book/2025/Stockholm syndrome emotion]]

and let us know what you think about the AI image suitability vs. using no image or alternative images suggested by Dronebogus.

Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:45, 26 April 2026 (UTC)

:I think Jtneill needs to try harder to find non-AI alternatives both on Commons and the web. I’m not reiterating the well known problems with generative AI— you can read about those on Wikipedia and the broader Internet. Needless to say it’s kind of just inherently toxic. If you use it, it should be the last resort of last resorts. Just my stance, which I consider perfectly valid and reasonable. [[User:Dronebogus|Dronebogus]] ([[User talk:Dronebogus|discuss]] • [[Special:Contributions/Dronebogus|contribs]]) 04:10, 27 April 2026 (UTC)

== Request for Page Creation Approval - Research on Dr. Ian Stevenson ==


'''Hello Administrators,'''

I am a digital archivist and researcher attempting to create an educational page regarding Dr. Ian Stevenson's scientific work, specifically titled &quot;Where Reincarnation and Biology Intersect&quot; and its official Vietnamese edition.

My edits are purely constructive, aimed at integrating local research context with global structured data (including '''Wikidata Q139548587'''). The automated filter is currently preventing publication due to &quot;new user external link limits.&quot;

I have ensured that all citations, references, and images (sourced from Wikimedia Commons) are strictly academic and non-promotional. Could you please review my contributions and consider whitelisting my account or approving this specific page creation?

Thank you for your assistance in preserving this research '''legacy''' within the open knowledge ecosystem.

'''Best regards,''' [[User:Ian Stevenson777|Ian Stevenson777]] ([[User talk:Ian Stevenson777|discuss]] • [[Special:Contributions/Ian Stevenson777|contribs]]) 07:26, 28 April 2026 (UTC)
: The page title should probably be in English, as this is English Wikiversity. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:19, 28 April 2026 (UTC)
:@[[User:Ian Stevenson777|Ian Stevenson777]] I looked at the text and it seems to me that it is informative, but the user cannot learn anything from it because they would have to buy the book. In this regard, it seems to me that it is enough [[:w:Where Reincarnation and Biology Intersect|to have that article on Wikipedia]] and there is no need to duplicate it here on Wikiversity. If you are particularly interested with its Vietnamese translation, I would focus on Vietnamese Wikipedia, but it seems to me, that the article there [https://vi.wikipedia.org/w/index.php?title=N%C6%A1i_lu%C3%A2n_h%E1%BB%93i_v%C3%A0_sinh_h%E1%BB%8Dc_giao_nhau&amp;oldid=75029095 have some problems at the moment]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:51, 5 May 2026 (UTC)
:This request is AI-generated and was made by a lock evading LTA. Please ignore it. [[User:NguoiDungKhongDinhDanh|NguoiDungKhongDinhDanh]] ([[User talk:NguoiDungKhongDinhDanh|discuss]] • [[Special:Contributions/NguoiDungKhongDinhDanh|contribs]]) 23:58, 13 May 2026 (UTC)

== Call for custodians and bureaucrats ==
&lt;div class=&quot;cd-moveMark&quot;&gt;''Moved to [[Wikiversity:Notices for custodians#Call for custodians and bureaucrats]].  [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 18:46, 12 May 2026 (UTC)''&lt;/div&gt;

== Interface administrator flag request ==

@[[User:Jtneill|Jtneill]], @[[User:Mu301|Mu301]] I am requesting IA flag to delete [[MediaWiki:Gadget-WikiSign.js]]. It was requested for deletion by [[User:Sophivorus|a trusted user]] and I think it can be deleted. Once I delete it, I will notify you and you can remove the flag. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:24, 10 May 2026 (UTC)

:Can you enable two-factor authentication? 
:Policy: [[Wikiversity:Interface administrators]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:27, 10 May 2026 (UTC)
::Done @[[User:Jtneill|Jtneill]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:20, 11 May 2026 (UTC)
:::You are an interface administrator for 24 hours. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:57, 11 May 2026 (UTC)
::::Thx @[[User:Jtneill|Jtneill]], I have just deleted the page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:59, 11 May 2026 (UTC)

== Block request ==

Hi. Please block @[[User:Skibidi Titan 5.0|Skibidi Titan 5.0]]. Reason : Vandalism.

Thanks, [[User:Locpac|Locpac]] ([[User talk:Locpac|discuss]] • [[Special:Contributions/Locpac|contribs]]) 15:10, 10 May 2026 (UTC)

:Thankyou. Done. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 15:25, 10 May 2026 (UTC)


== ~2026-28496-53 ==

Please block [[Special:Contribs/~2026-28496-53]], vandalism. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:02, 11 May 2026 (UTC)

:{{done}} Thank you! —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 17:14, 11 May 2026 (UTC)

== ~2026-28792-52 ==

Please block [[Special:Contribs/~2026-28792-52]], vandalism. Appears to be same user as above. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:38, 12 May 2026 (UTC)
: Blocked locally by Barras. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 17:46, 12 May 2026 (UTC)</text>
      <sha1>j2kv6gyqntei2x2a9qv5sm1gx8zzv9f</sha1>
    </revision>
    <revision>
      <id>2809699</id>
      <parentid>2809697</parentid>
      <timestamp>2026-05-16T19:23:41Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Blocks for sockpuppet */ archive to [[Wikiversity:Request custodian action/Archive/30#Blocks for sockpuppet]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809699</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="30808" sha1="0ez5f8c1cbf5li8xis5cqf0foo4byt0" xml:space="preserve">{{/Header}}

== Problem when trying to start a discussion with authors of the Plurilingual education portal ==

The authors I wanted to discuss with are called &quot;Project PEP&quot; and my name is Franch Chandler. How can I be allowed to do so ? [[User:French Chandler|French Chandler]] ([[User talk:French Chandler|discuss]] • [[Special:Contributions/French Chandler|contribs]]) 18:25, 16 March 2026 (UTC)

:@[[User:French Chandler|French Chandler]] place your qestion [https://en.wikiversity.org/w/index.php?title=User_talk:Projet_PEP&amp;action=edit into the dialog box] on this link and hit Publish page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:22, 16 March 2026 (UTC)

== Please publish my post ==

My post is about &quot;Every child grows and develops at their own pace, but some may experience challenges that affect their ability to perform everyday tasks. These challenges can include difficulties with fine motor skills, sensory processing, handwriting, feeding, and self-regulation. When these issues are not addressed early, they can impact a child’s confidence, academic performance, and independence.

With the rise of digital healthcare services, '''online physical therapy''' has emerged as a powerful and accessible solution for parents seeking support for their children. This modern approach provides structured, personalized therapy programs that can be accessed from the comfort of home, making it easier for families to ensure consistent care.&quot; [[User:Skyabovetherapy|Skyabovetherapy]] ([[User talk:Skyabovetherapy|discuss]] • [[Special:Contributions/Skyabovetherapy|contribs]]) 12:28, 28 March 2026 (UTC)

:@[[User:Skyabovetherapy|Skyabovetherapy]] Well, you can publish it yourself, Wikiversity is a free environement, where everybody can create educational resources. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 14:11, 29 March 2026 (UTC)
::They actually triggered some abuse filters. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 16:24, 29 March 2026 (UTC)
:I looked at your attempts to add this text and I see a link to one website repeated many times, which reminds me of the misuse of Wikiversity for self-promotion or to increase the importance of the website. It is necessary to remind you here that Wikiversity is not a place for promotion, but a place for education. So if you want to educate, it will not be a problem to create the page without external links with a clearly defined procedure for how people should use it and what to expect from it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:07, 1 April 2026 (UTC)

== New user limit ==

Hi, I am creating an AIPA Method learning resource page. 

I am the author of the linked research, and I hit the “new user limit” and “new page with external link” filters while publishing. 

Here is the link to the page in creation: [https://en.wikiversity.org/w/index.php?title=AIPA_Method&amp;veaction=edit] 

Thank you for your help. 

Best regards, 

Senad Dizdarević [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:19, 30 March 2026 (UTC)

:@[[User:Senad Dizdarević|Senad Dizdarević]] I should admit I dont know, what is &quot;new user limit&quot;, but if filter blocks your page because of certain external link, you may force to save anyway and sometimes it works. It should not work, when the website is blacklisted. As of now, I am not seeing you to save page in main namespace, so try to save it without external links first. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:30, 30 March 2026 (UTC)
::Thank you, you are very kind. 
::I will wait a day, and try again (without links, too). 
::Today, I already created About Me info page, and maybe that is enough for the filters for one day.  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:53, 30 March 2026 (UTC)
:::Well, I have analyzed your contribution to Wikiversity and I should point out here, that this project is not a place for advertising, so there is no way of promoting your books and authority this way. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:56, 1 April 2026 (UTC)
::::Hi, my About Me page is just an info page with the neutral as possible presentation of my work. 
::::There is a big difference between informing and advertising. Informing is neutrally stating that something exists and requiring no action, while advertising is a special communication form with intent to cause certain action from readers. For example, click here, click there, order this, buy that. 
::::There is no such intention, form, or terms on my info page. Just neutral information. I don't hide and I am not ashamed that I am write and author, and that is a part of the usual bio, including works. I checked your user page: &quot;I graduated from the Czech University of Life Sciences in Prague and studied information science at the Faculty of Arts of Charles University.&quot; I think that if you had written a book on Life Science, you would have mentioned that as well.
::::Most of the Info page is about my research and AIPA Method which is a valid contribution to psychology, consciousness studies, identity theory, and personality development. Actually, my paper '''AIPA Method: A Cognitive-Phenomenological Model for Identity Reconstruction and Stabilization in Pure Awareness''' is now in the peer review procedure at Journal of Consciousness Studies. 
::::Here is a part from the Wikiversity AIPA Method page in creation (waiting for the end of the time limit for new users):    [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:47, 2 April 2026 (UTC)
:::::For the unknown reasons, the form didn't publish my second part of the message: 
:::::I believe this is a valid contribution to Wikiversity. 
:::::Best Regards, 
:::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:52, 2 April 2026 (UTC)
::::::And the third try: 
:::::: == Introduction ==
::::::The AIPA Method addresses a gap in contemporary personal development and consciousness science: most evidence‑based approaches (CBT, MBSR, MBCT, standard meditation) operate at the level of mental content—reframing thoughts, observing them, or reducing their impact—rather than at the level of identity structure. In contrast, AIPA targets the structural relationship between the self and the mind, aiming at durable identity reconstruction rooted in Pure Awareness rather than symptom management.
::::::The central research question of the primary AIPA preprint is whether a structured, sequentially staged method can produce permanent identity reconstruction rooted in Pure Awareness, and how such a method compares to established approaches in scope, mechanism, and outcome.
:::::: == Theoretical foundations ==
::::::The AIPA framework is grounded in the cognitive‑phenomenological tradition (e.g., McAdams, Varela, Metzinger, Erikson), contemporary consciousness science on minimal phenomenal experience, and qualitative methods advocacy in psychology. It builds directly on:
::::::* Empirical work on pure awareness and Minimal Phenomenal Experience (MPE), especially Gamma &amp; Metzinger’s large‑scale study of content‑reduced awareness states.
::::::* Metzinger’s proposal of minimal phenomenal experience as an entry point for a minimal unifying model of consciousness.
::::::* Narrative identity and partial‑self models within personality and identity theory.
::::::Within this backdrop, AIPA proposes Pure Awareness as a distinct, operationally specified state that can become a structural ground of identity rather than a transient meditative experience.
:::::: == Experiential empiricism ==
::::::The empirical foundation of the AIPA Method is explicitly first‑person and experiential, combining:
::::::* A 22‑year longitudinal autoethnographic self‑study (2003–2025) documenting partial personality episodes, protocol use, and outcomes.
::::::* A 13‑year prospective verification period with zero self‑reported recurrence of targeted harmful behaviors after a dated stabilization point (1 January 2006).
::::::* A high‑ecological‑validity “stress test” during acute bereavement, used to examine whether non‑reactive awareness remains stable under maximal provocation.
::::::* Two independent practitioner cases (an Amazon‑verified report and a structured questionnaire case) providing preliminary convergent signals across cognitive, emotional, behavioral, and identity dimensions.
::::::All central constructs (Pure Awareness, partial personalities, the Switch, identity stabilization) are operationalized with explicit phenomenological and behavioral criteria intended to enable replication and future third‑person measurement.
::::::I believe this is a valid contribution to Wikiversity. 
::::::Best regards, 
::::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:54, 2 April 2026 (UTC)

== Unable to publish pages  ==

Whenever I try to publish a page with linked sources it gets flagged and says I'm a new user attempting to publish content with outside links. Those outside links are my sources. [[User:Soboyed|Soboyed]] ([[User talk:Soboyed|discuss]] • [[Special:Contributions/Soboyed|contribs]]) 04:52, 2 April 2026 (UTC)

:This restriction is automatically lifted after you have edited for a certain time (I don't recall that time off-hand, but it is not long). This is designed to stop spam. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 04:53, 2 April 2026 (UTC)

== Showing error to publish a Post ==

My  action was constructive, not destructive, please allow to publish it. [[Special:Contributions/&amp;#126;2026-20906-18|&amp;#126;2026-20906-18]] ([[User talk:&amp;#126;2026-20906-18|talk]]) 08:06, 4 April 2026 (UTC)

:Maybe you got caught in a filter. Consider [[Special:CreateAccount|creating an account]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:06, 4 April 2026 (UTC)
:Your edits, [https://en.wikiversity.org/w/index.php?title=Special:AbuseLog&amp;wpSearchUser=%7E2026-20906-18 these ones], seems to have tripped a filter when you tried to create a page on [[Create]] which external links. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 23:58, 4 April 2026 (UTC)
:Have you read my [https://en.wikiversity.org/w/index.php?title=Wikiversity:Request_custodian_action&amp;diff=prev&amp;oldid=2802219 previous reply] to you @[[User:~2026-20906-18|~2026-20906-18]]? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:02, 6 April 2026 (UTC)

== Abuse filters which should be deleted ==

Hi, there are some abuse filters which should probably be deleted.
* [[Special:AbuseFilter/1]] (not needed anymore)
* [[Special:AbuseFilter/2]] (no hits since 2018)
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched)
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives)
* [[Special:AbuseFilter/5]] (no hits since 2023)
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore)
* [[Special:AbuseFilter/17]] (no hits since 2022)
* [[Special:AbuseFilter/19]] (no hits since 2019)
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive)
Thanks. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 03:51, 5 April 2026 (UTC)

:Why do these need to be deleted rather than inactivated? Do inactive abuse filters cause a server strain? —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:39, 5 April 2026 (UTC)
:: Deleted filters do not cause strain to the servers. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:28, 5 April 2026 (UTC)
:These sounds like sensible suggestions but, yes, would inactivation perhaps make more sense than deletion for at least some  filters? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:35, 5 April 2026 (UTC)
:I would keep them @[[User:Codename Noreste|Codename Noreste]]. Alternatively, I would turn off the ones that haven't caught anything for a long time, but I would leave them enabled in case they need to be turned on or improved. If someone has already written the code and we don't have hundreds of free man-hours of programmers on Wikiversity, the server load seems secondary to me, and is negligible compared to other things. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:11, 6 April 2026 (UTC)
:: I know how to write abuse filter code and regex, but I would recommend disabling filters that have never caught anything in a long time ''and'' those who made lots of false positives. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:09, 6 April 2026 (UTC)
:::Of course @[[User:Codename Noreste|Codename Noreste]], there are people here today who are capable of changing the code. But the question is what it will be like in a few years, the question is what will happen if those two are busy for a long time, etc. That's why I would leave it so that those who don't know much about code can be inspired by it and will need to do something with it someday - plus, more code for different types of filtering is actually great educational material on how those filters work. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:41, 17 April 2026 (UTC)

Here's the updated list of abuse filters under review with actions I've taken (several disabled, one basic code improvement, and some actions changed) - none have been deleted so they can all be edited and reactivayed - please suggest any further changes:
* [[Special:AbuseFilter/1]] (not needed anymore) - One time account spam bot - 4 hits over 10 years ago - Disabled in 2024 - May be useful in future
* [[Special:AbuseFilter/2]] (no hits since 2018) - Userspace spamming - 778 hits; none since 2018 likely due to global filters - Now disabled
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched) - Specific user page spam - 1,101 hits most recent 7 March 2026 - Still active - Kept enabled
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives) - Questionable Language (profanity) - 6,055 hits including very recently - However it was logging hits without taking any actions - Edited to reduce likelihood of false positives by only applying filter to users with low (&lt; 20) edit count and applied weak actions to tag and warn but not prevent publishing the content
* [[Special:AbuseFilter/5]] (no hits since 2023) - Blocked Solicitation Links - 95 hits; none since 2023 - blocks specific historical spam sites - Non-active - Now disabled
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore) - Not reviewed - They are currently disabled
* [[Special:AbuseFilter/17]] (no hits since 2022) - Fundamental Physics Edits - 347 hits; none since 2022 - Non-active and very specific for a historical issue - Now disabled 
* [[Special:AbuseFilter/19]] (no hits since 2019) - Page Creation - 20 hits; none since 2019 - Retained for historical reference and possible future updates - Now disabled
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive) - Globally Banned Editor (renamed to Low-edit Spam Monitor) - 2,829 hits including very recent - Only applies to users with less than 5 edits and takes no actions / monitoring only - Reviewing the details of the hits I don't see many false positives and have strengthened its actions to add a tag and warning

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:57, 9 April 2026 (UTC)

== Block request ==

Please block ~2026-20985-80/~2026-21079-90/~2026-21223-88. Reason: Vandalism. [[User:Àncilu|Àncilu]] ([[User talk:Àncilu|discuss]] • [[Special:Contributions/Àncilu|contribs]]) 23:24, 5 April 2026 (UTC)

:All edits should be deleted and the first is blocked by Atcovi. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:33, 6 April 2026 (UTC)

== Antispam - Filter 12 ==
{{ping|Codename Noreste}} Thanks for contacting me with a suggested [[Special:AbuseFilter|abuse filter]] for the coupon spam we've been getting. A very much appreciated time saver. Per your suggestion, abuse filter 12 has been reactivated with your updated regex. It should tag and prevent page creation actions for coupon promo etc. Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:33, 15 April 2026 (UTC)
: @[[User:Jtneill|Jtneill]] Please do the following to filter 12:
:# Enable the block action (temporary for unregistered users, indefinite for registered users)
:# Disable both the disallow and tag actions, since that filter will be set to block
: Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:42, 5 May 2026 (UTC)
::Excellent. Done:
::* Block duration for non-registered users = 1 week
::* Block duration for registered users = indefinite
::* Disallow and tagging disabled
::Thankyou. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:24, 9 May 2026 (UTC)

== Urgent! error message This action has been automatically identified as potentially harmful, and therefore disallowed ==

While submitting the post this error was coming &quot;This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please inform an administrator of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link&quot; How to resolve it?

Here is the content:

{{note|marketing material removed}}

[[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:14, 17 April 2026 (UTC)
: That's because Wikiversity doesn't accept advertising. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 05:20, 17 April 2026 (UTC)
::So this is fine
::'''Online Internship and Digital Learning for Students'''
::Online learning has become an important part of modern education. With the help of the internet and digital tools, students can now study, practice, and gain experience without being physically present in a classroom. One key part of this system is the online internship, which helps students learn real-world skills along with their studies.
::An online internship allows students to work on tasks and projects through digital platforms. This makes learning more practical and useful, especially for those who want to understand how real work environments function.
::'''Background'''
::The concept of online learning developed from distance education, where students learned from remote locations. Over time, with the growth of digital technology, learning has become more interactive and flexible.
::The introduction of the online internship has added another important layer to digital education. It combines theoretical learning with practical experience, helping students prepare for future careers.
::During global events such as the COVID-19 pandemic, online education and online internship programs became essential. They helped students continue learning and gaining experience despite restrictions on physical movement.
::'''Importance of Online Internship'''
::An online internship plays an important role in student development. It helps bridge the gap between academic knowledge and practical skills.
::'''Some key points include:'''
::Students understand how real work is done
::They develop basic professional skills
::It supports career readiness
::It allows learning without location limits
::By participating in an online internship, students can improve their confidence and gain early exposure to different fields.
::'''Features of Online Internship-Based Learning'''
::Modern education platforms often include online internship opportunities as part of their learning system. These usually offer:
::Flexible schedules for students
::Access to learning from home
::Beginner-friendly tasks and projects
::A combination of theory and practice
::Such features make online internship programs suitable for a wide range of learners, including beginners.
::'''Learning Tasks'''
::Explore how online internship programs support student learning in digital environments.
::Identify how students can gain practical experience through an online internship
::Analyze the role of flexible learning in improving student engagement
::Understand how online education and internships work together
::'''References'''
::[https://ijpsl.in/wp-content/uploads/2020/09/E-Learning_Hanaaya-Navaneeth.pdf The Past, Present and Future of E-Learning: Hanaaya Varyani and Navaneeth M S]
::[https://ieeexplore.ieee.org/document/9788102 Current Trends and Future Perspectives of e-Learning in India]
::'''See Also'''
::[https://easyshiksha.com/online_courses/internship Online Internship]
::[https://easyshiksha.com/online_courses/ Online Courses]
::[https://easyshiksha.com/online_courses/kids-learning Kids Learning]
::[https://easyshiksha.com/career_helper/ Career Guidance] [[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:27, 17 April 2026 (UTC)
:::@[[User:EasyshikshaMarketing|EasyshikshaMarketing]] Wikiversity is a resource for education, or a space for education. However, your intention to link to another website is obvious, and such content does not belong here, as it contradicts the purpose of Wikiversity. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:38, 17 April 2026 (UTC)

==AI-generated images==
Seeking your advice.

Myself and students use some AI-generated images in the [[Motivation and emotion]] project.

[[User:Dronebogus]] has been removing some of these images from Wikiversity pages and nominating them for deletion at Commons. As a result, some have been deleted and some have been kept.

Dronebogus has made some useful edits and image suggestions for [[Motivation and emotion]] which I've appreciated and  incorporated. However, there are other edits to remove an AI image by Dronebogus that I've reverted where I think the image is more educational than no image or an alternative image suggested by Dronebogus.

There are a couple of pages where Dronebogus has reverted my reversion, so we are at risk of edit warring. We have briefly discussed and warned each other on our user talk pages, but it seems to come down to a difference in perception about the educational usefulness of the AI images.

So, I'm asking here for others to please review the recent edit histories for these pages:
* [[Motivation and emotion/Lectures/Brain and physiological needs]]
* [[Motivation and emotion/Book/2025/Stockholm syndrome emotion]]

and let us know what you think about the AI image suitability vs. using no image or alternative images suggested by Dronebogus.

Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:45, 26 April 2026 (UTC)

:I think Jtneill needs to try harder to find non-AI alternatives both on Commons and the web. I’m not reiterating the well known problems with generative AI— you can read about those on Wikipedia and the broader Internet. Needless to say it’s kind of just inherently toxic. If you use it, it should be the last resort of last resorts. Just my stance, which I consider perfectly valid and reasonable. [[User:Dronebogus|Dronebogus]] ([[User talk:Dronebogus|discuss]] • [[Special:Contributions/Dronebogus|contribs]]) 04:10, 27 April 2026 (UTC)

== Request for Page Creation Approval - Research on Dr. Ian Stevenson ==


'''Hello Administrators,'''

I am a digital archivist and researcher attempting to create an educational page regarding Dr. Ian Stevenson's scientific work, specifically titled &quot;Where Reincarnation and Biology Intersect&quot; and its official Vietnamese edition.

My edits are purely constructive, aimed at integrating local research context with global structured data (including '''Wikidata Q139548587'''). The automated filter is currently preventing publication due to &quot;new user external link limits.&quot;

I have ensured that all citations, references, and images (sourced from Wikimedia Commons) are strictly academic and non-promotional. Could you please review my contributions and consider whitelisting my account or approving this specific page creation?

Thank you for your assistance in preserving this research '''legacy''' within the open knowledge ecosystem.

'''Best regards,''' [[User:Ian Stevenson777|Ian Stevenson777]] ([[User talk:Ian Stevenson777|discuss]] • [[Special:Contributions/Ian Stevenson777|contribs]]) 07:26, 28 April 2026 (UTC)
: The page title should probably be in English, as this is English Wikiversity. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:19, 28 April 2026 (UTC)
:@[[User:Ian Stevenson777|Ian Stevenson777]] I looked at the text and it seems to me that it is informative, but the user cannot learn anything from it because they would have to buy the book. In this regard, it seems to me that it is enough [[:w:Where Reincarnation and Biology Intersect|to have that article on Wikipedia]] and there is no need to duplicate it here on Wikiversity. If you are particularly interested with its Vietnamese translation, I would focus on Vietnamese Wikipedia, but it seems to me, that the article there [https://vi.wikipedia.org/w/index.php?title=N%C6%A1i_lu%C3%A2n_h%E1%BB%93i_v%C3%A0_sinh_h%E1%BB%8Dc_giao_nhau&amp;oldid=75029095 have some problems at the moment]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:51, 5 May 2026 (UTC)
:This request is AI-generated and was made by a lock evading LTA. Please ignore it. [[User:NguoiDungKhongDinhDanh|NguoiDungKhongDinhDanh]] ([[User talk:NguoiDungKhongDinhDanh|discuss]] • [[Special:Contributions/NguoiDungKhongDinhDanh|contribs]]) 23:58, 13 May 2026 (UTC)

== Call for custodians and bureaucrats ==
&lt;div class=&quot;cd-moveMark&quot;&gt;''Moved to [[Wikiversity:Notices for custodians#Call for custodians and bureaucrats]].  [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 18:46, 12 May 2026 (UTC)''&lt;/div&gt;

== Interface administrator flag request ==

@[[User:Jtneill|Jtneill]], @[[User:Mu301|Mu301]] I am requesting IA flag to delete [[MediaWiki:Gadget-WikiSign.js]]. It was requested for deletion by [[User:Sophivorus|a trusted user]] and I think it can be deleted. Once I delete it, I will notify you and you can remove the flag. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:24, 10 May 2026 (UTC)

:Can you enable two-factor authentication? 
:Policy: [[Wikiversity:Interface administrators]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:27, 10 May 2026 (UTC)
::Done @[[User:Jtneill|Jtneill]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:20, 11 May 2026 (UTC)
:::You are an interface administrator for 24 hours. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:57, 11 May 2026 (UTC)
::::Thx @[[User:Jtneill|Jtneill]], I have just deleted the page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:59, 11 May 2026 (UTC)

== Block request ==

Hi. Please block @[[User:Skibidi Titan 5.0|Skibidi Titan 5.0]]. Reason : Vandalism.

Thanks, [[User:Locpac|Locpac]] ([[User talk:Locpac|discuss]] • [[Special:Contributions/Locpac|contribs]]) 15:10, 10 May 2026 (UTC)

:Thankyou. Done. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 15:25, 10 May 2026 (UTC)


== ~2026-28496-53 ==

Please block [[Special:Contribs/~2026-28496-53]], vandalism. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:02, 11 May 2026 (UTC)

:{{done}} Thank you! —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 17:14, 11 May 2026 (UTC)

== ~2026-28792-52 ==

Please block [[Special:Contribs/~2026-28792-52]], vandalism. Appears to be same user as above. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:38, 12 May 2026 (UTC)
: Blocked locally by Barras. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 17:46, 12 May 2026 (UTC)</text>
      <sha1>0ez5f8c1cbf5li8xis5cqf0foo4byt0</sha1>
    </revision>
    <revision>
      <id>2809701</id>
      <parentid>2809699</parentid>
      <timestamp>2026-05-16T19:23:50Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Problem when trying to start a discussion with authors of the Plurilingual education portal */ archive to [[Wikiversity:Request custodian action/Archive/30#Problem when trying to start a discussion with authors of the Plurilingual education portal]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809701</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="30090" sha1="2g9cdzllztjgn0bfkht6fuziib2374r" xml:space="preserve">{{/Header}}

== Please publish my post ==

My post is about &quot;Every child grows and develops at their own pace, but some may experience challenges that affect their ability to perform everyday tasks. These challenges can include difficulties with fine motor skills, sensory processing, handwriting, feeding, and self-regulation. When these issues are not addressed early, they can impact a child’s confidence, academic performance, and independence.

With the rise of digital healthcare services, '''online physical therapy''' has emerged as a powerful and accessible solution for parents seeking support for their children. This modern approach provides structured, personalized therapy programs that can be accessed from the comfort of home, making it easier for families to ensure consistent care.&quot; [[User:Skyabovetherapy|Skyabovetherapy]] ([[User talk:Skyabovetherapy|discuss]] • [[Special:Contributions/Skyabovetherapy|contribs]]) 12:28, 28 March 2026 (UTC)

:@[[User:Skyabovetherapy|Skyabovetherapy]] Well, you can publish it yourself, Wikiversity is a free environement, where everybody can create educational resources. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 14:11, 29 March 2026 (UTC)
::They actually triggered some abuse filters. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 16:24, 29 March 2026 (UTC)
:I looked at your attempts to add this text and I see a link to one website repeated many times, which reminds me of the misuse of Wikiversity for self-promotion or to increase the importance of the website. It is necessary to remind you here that Wikiversity is not a place for promotion, but a place for education. So if you want to educate, it will not be a problem to create the page without external links with a clearly defined procedure for how people should use it and what to expect from it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:07, 1 April 2026 (UTC)

== New user limit ==

Hi, I am creating an AIPA Method learning resource page. 

I am the author of the linked research, and I hit the “new user limit” and “new page with external link” filters while publishing. 

Here is the link to the page in creation: [https://en.wikiversity.org/w/index.php?title=AIPA_Method&amp;veaction=edit] 

Thank you for your help. 

Best regards, 

Senad Dizdarević [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:19, 30 March 2026 (UTC)

:@[[User:Senad Dizdarević|Senad Dizdarević]] I should admit I dont know, what is &quot;new user limit&quot;, but if filter blocks your page because of certain external link, you may force to save anyway and sometimes it works. It should not work, when the website is blacklisted. As of now, I am not seeing you to save page in main namespace, so try to save it without external links first. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:30, 30 March 2026 (UTC)
::Thank you, you are very kind. 
::I will wait a day, and try again (without links, too). 
::Today, I already created About Me info page, and maybe that is enough for the filters for one day.  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:53, 30 March 2026 (UTC)
:::Well, I have analyzed your contribution to Wikiversity and I should point out here, that this project is not a place for advertising, so there is no way of promoting your books and authority this way. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:56, 1 April 2026 (UTC)
::::Hi, my About Me page is just an info page with the neutral as possible presentation of my work. 
::::There is a big difference between informing and advertising. Informing is neutrally stating that something exists and requiring no action, while advertising is a special communication form with intent to cause certain action from readers. For example, click here, click there, order this, buy that. 
::::There is no such intention, form, or terms on my info page. Just neutral information. I don't hide and I am not ashamed that I am write and author, and that is a part of the usual bio, including works. I checked your user page: &quot;I graduated from the Czech University of Life Sciences in Prague and studied information science at the Faculty of Arts of Charles University.&quot; I think that if you had written a book on Life Science, you would have mentioned that as well.
::::Most of the Info page is about my research and AIPA Method which is a valid contribution to psychology, consciousness studies, identity theory, and personality development. Actually, my paper '''AIPA Method: A Cognitive-Phenomenological Model for Identity Reconstruction and Stabilization in Pure Awareness''' is now in the peer review procedure at Journal of Consciousness Studies. 
::::Here is a part from the Wikiversity AIPA Method page in creation (waiting for the end of the time limit for new users):    [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:47, 2 April 2026 (UTC)
:::::For the unknown reasons, the form didn't publish my second part of the message: 
:::::I believe this is a valid contribution to Wikiversity. 
:::::Best Regards, 
:::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:52, 2 April 2026 (UTC)
::::::And the third try: 
:::::: == Introduction ==
::::::The AIPA Method addresses a gap in contemporary personal development and consciousness science: most evidence‑based approaches (CBT, MBSR, MBCT, standard meditation) operate at the level of mental content—reframing thoughts, observing them, or reducing their impact—rather than at the level of identity structure. In contrast, AIPA targets the structural relationship between the self and the mind, aiming at durable identity reconstruction rooted in Pure Awareness rather than symptom management.
::::::The central research question of the primary AIPA preprint is whether a structured, sequentially staged method can produce permanent identity reconstruction rooted in Pure Awareness, and how such a method compares to established approaches in scope, mechanism, and outcome.
:::::: == Theoretical foundations ==
::::::The AIPA framework is grounded in the cognitive‑phenomenological tradition (e.g., McAdams, Varela, Metzinger, Erikson), contemporary consciousness science on minimal phenomenal experience, and qualitative methods advocacy in psychology. It builds directly on:
::::::* Empirical work on pure awareness and Minimal Phenomenal Experience (MPE), especially Gamma &amp; Metzinger’s large‑scale study of content‑reduced awareness states.
::::::* Metzinger’s proposal of minimal phenomenal experience as an entry point for a minimal unifying model of consciousness.
::::::* Narrative identity and partial‑self models within personality and identity theory.
::::::Within this backdrop, AIPA proposes Pure Awareness as a distinct, operationally specified state that can become a structural ground of identity rather than a transient meditative experience.
:::::: == Experiential empiricism ==
::::::The empirical foundation of the AIPA Method is explicitly first‑person and experiential, combining:
::::::* A 22‑year longitudinal autoethnographic self‑study (2003–2025) documenting partial personality episodes, protocol use, and outcomes.
::::::* A 13‑year prospective verification period with zero self‑reported recurrence of targeted harmful behaviors after a dated stabilization point (1 January 2006).
::::::* A high‑ecological‑validity “stress test” during acute bereavement, used to examine whether non‑reactive awareness remains stable under maximal provocation.
::::::* Two independent practitioner cases (an Amazon‑verified report and a structured questionnaire case) providing preliminary convergent signals across cognitive, emotional, behavioral, and identity dimensions.
::::::All central constructs (Pure Awareness, partial personalities, the Switch, identity stabilization) are operationalized with explicit phenomenological and behavioral criteria intended to enable replication and future third‑person measurement.
::::::I believe this is a valid contribution to Wikiversity. 
::::::Best regards, 
::::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:54, 2 April 2026 (UTC)

== Unable to publish pages  ==

Whenever I try to publish a page with linked sources it gets flagged and says I'm a new user attempting to publish content with outside links. Those outside links are my sources. [[User:Soboyed|Soboyed]] ([[User talk:Soboyed|discuss]] • [[Special:Contributions/Soboyed|contribs]]) 04:52, 2 April 2026 (UTC)

:This restriction is automatically lifted after you have edited for a certain time (I don't recall that time off-hand, but it is not long). This is designed to stop spam. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 04:53, 2 April 2026 (UTC)

== Showing error to publish a Post ==

My  action was constructive, not destructive, please allow to publish it. [[Special:Contributions/&amp;#126;2026-20906-18|&amp;#126;2026-20906-18]] ([[User talk:&amp;#126;2026-20906-18|talk]]) 08:06, 4 April 2026 (UTC)

:Maybe you got caught in a filter. Consider [[Special:CreateAccount|creating an account]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:06, 4 April 2026 (UTC)
:Your edits, [https://en.wikiversity.org/w/index.php?title=Special:AbuseLog&amp;wpSearchUser=%7E2026-20906-18 these ones], seems to have tripped a filter when you tried to create a page on [[Create]] which external links. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 23:58, 4 April 2026 (UTC)
:Have you read my [https://en.wikiversity.org/w/index.php?title=Wikiversity:Request_custodian_action&amp;diff=prev&amp;oldid=2802219 previous reply] to you @[[User:~2026-20906-18|~2026-20906-18]]? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:02, 6 April 2026 (UTC)

== Abuse filters which should be deleted ==

Hi, there are some abuse filters which should probably be deleted.
* [[Special:AbuseFilter/1]] (not needed anymore)
* [[Special:AbuseFilter/2]] (no hits since 2018)
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched)
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives)
* [[Special:AbuseFilter/5]] (no hits since 2023)
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore)
* [[Special:AbuseFilter/17]] (no hits since 2022)
* [[Special:AbuseFilter/19]] (no hits since 2019)
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive)
Thanks. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 03:51, 5 April 2026 (UTC)

:Why do these need to be deleted rather than inactivated? Do inactive abuse filters cause a server strain? —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:39, 5 April 2026 (UTC)
:: Deleted filters do not cause strain to the servers. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:28, 5 April 2026 (UTC)
:These sounds like sensible suggestions but, yes, would inactivation perhaps make more sense than deletion for at least some  filters? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:35, 5 April 2026 (UTC)
:I would keep them @[[User:Codename Noreste|Codename Noreste]]. Alternatively, I would turn off the ones that haven't caught anything for a long time, but I would leave them enabled in case they need to be turned on or improved. If someone has already written the code and we don't have hundreds of free man-hours of programmers on Wikiversity, the server load seems secondary to me, and is negligible compared to other things. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:11, 6 April 2026 (UTC)
:: I know how to write abuse filter code and regex, but I would recommend disabling filters that have never caught anything in a long time ''and'' those who made lots of false positives. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:09, 6 April 2026 (UTC)
:::Of course @[[User:Codename Noreste|Codename Noreste]], there are people here today who are capable of changing the code. But the question is what it will be like in a few years, the question is what will happen if those two are busy for a long time, etc. That's why I would leave it so that those who don't know much about code can be inspired by it and will need to do something with it someday - plus, more code for different types of filtering is actually great educational material on how those filters work. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:41, 17 April 2026 (UTC)

Here's the updated list of abuse filters under review with actions I've taken (several disabled, one basic code improvement, and some actions changed) - none have been deleted so they can all be edited and reactivayed - please suggest any further changes:
* [[Special:AbuseFilter/1]] (not needed anymore) - One time account spam bot - 4 hits over 10 years ago - Disabled in 2024 - May be useful in future
* [[Special:AbuseFilter/2]] (no hits since 2018) - Userspace spamming - 778 hits; none since 2018 likely due to global filters - Now disabled
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched) - Specific user page spam - 1,101 hits most recent 7 March 2026 - Still active - Kept enabled
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives) - Questionable Language (profanity) - 6,055 hits including very recently - However it was logging hits without taking any actions - Edited to reduce likelihood of false positives by only applying filter to users with low (&lt; 20) edit count and applied weak actions to tag and warn but not prevent publishing the content
* [[Special:AbuseFilter/5]] (no hits since 2023) - Blocked Solicitation Links - 95 hits; none since 2023 - blocks specific historical spam sites - Non-active - Now disabled
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore) - Not reviewed - They are currently disabled
* [[Special:AbuseFilter/17]] (no hits since 2022) - Fundamental Physics Edits - 347 hits; none since 2022 - Non-active and very specific for a historical issue - Now disabled 
* [[Special:AbuseFilter/19]] (no hits since 2019) - Page Creation - 20 hits; none since 2019 - Retained for historical reference and possible future updates - Now disabled
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive) - Globally Banned Editor (renamed to Low-edit Spam Monitor) - 2,829 hits including very recent - Only applies to users with less than 5 edits and takes no actions / monitoring only - Reviewing the details of the hits I don't see many false positives and have strengthened its actions to add a tag and warning

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:57, 9 April 2026 (UTC)

== Block request ==

Please block ~2026-20985-80/~2026-21079-90/~2026-21223-88. Reason: Vandalism. [[User:Àncilu|Àncilu]] ([[User talk:Àncilu|discuss]] • [[Special:Contributions/Àncilu|contribs]]) 23:24, 5 April 2026 (UTC)

:All edits should be deleted and the first is blocked by Atcovi. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:33, 6 April 2026 (UTC)

== Antispam - Filter 12 ==
{{ping|Codename Noreste}} Thanks for contacting me with a suggested [[Special:AbuseFilter|abuse filter]] for the coupon spam we've been getting. A very much appreciated time saver. Per your suggestion, abuse filter 12 has been reactivated with your updated regex. It should tag and prevent page creation actions for coupon promo etc. Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:33, 15 April 2026 (UTC)
: @[[User:Jtneill|Jtneill]] Please do the following to filter 12:
:# Enable the block action (temporary for unregistered users, indefinite for registered users)
:# Disable both the disallow and tag actions, since that filter will be set to block
: Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:42, 5 May 2026 (UTC)
::Excellent. Done:
::* Block duration for non-registered users = 1 week
::* Block duration for registered users = indefinite
::* Disallow and tagging disabled
::Thankyou. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:24, 9 May 2026 (UTC)

== Urgent! error message This action has been automatically identified as potentially harmful, and therefore disallowed ==

While submitting the post this error was coming &quot;This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please inform an administrator of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link&quot; How to resolve it?

Here is the content:

{{note|marketing material removed}}

[[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:14, 17 April 2026 (UTC)
: That's because Wikiversity doesn't accept advertising. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 05:20, 17 April 2026 (UTC)
::So this is fine
::'''Online Internship and Digital Learning for Students'''
::Online learning has become an important part of modern education. With the help of the internet and digital tools, students can now study, practice, and gain experience without being physically present in a classroom. One key part of this system is the online internship, which helps students learn real-world skills along with their studies.
::An online internship allows students to work on tasks and projects through digital platforms. This makes learning more practical and useful, especially for those who want to understand how real work environments function.
::'''Background'''
::The concept of online learning developed from distance education, where students learned from remote locations. Over time, with the growth of digital technology, learning has become more interactive and flexible.
::The introduction of the online internship has added another important layer to digital education. It combines theoretical learning with practical experience, helping students prepare for future careers.
::During global events such as the COVID-19 pandemic, online education and online internship programs became essential. They helped students continue learning and gaining experience despite restrictions on physical movement.
::'''Importance of Online Internship'''
::An online internship plays an important role in student development. It helps bridge the gap between academic knowledge and practical skills.
::'''Some key points include:'''
::Students understand how real work is done
::They develop basic professional skills
::It supports career readiness
::It allows learning without location limits
::By participating in an online internship, students can improve their confidence and gain early exposure to different fields.
::'''Features of Online Internship-Based Learning'''
::Modern education platforms often include online internship opportunities as part of their learning system. These usually offer:
::Flexible schedules for students
::Access to learning from home
::Beginner-friendly tasks and projects
::A combination of theory and practice
::Such features make online internship programs suitable for a wide range of learners, including beginners.
::'''Learning Tasks'''
::Explore how online internship programs support student learning in digital environments.
::Identify how students can gain practical experience through an online internship
::Analyze the role of flexible learning in improving student engagement
::Understand how online education and internships work together
::'''References'''
::[https://ijpsl.in/wp-content/uploads/2020/09/E-Learning_Hanaaya-Navaneeth.pdf The Past, Present and Future of E-Learning: Hanaaya Varyani and Navaneeth M S]
::[https://ieeexplore.ieee.org/document/9788102 Current Trends and Future Perspectives of e-Learning in India]
::'''See Also'''
::[https://easyshiksha.com/online_courses/internship Online Internship]
::[https://easyshiksha.com/online_courses/ Online Courses]
::[https://easyshiksha.com/online_courses/kids-learning Kids Learning]
::[https://easyshiksha.com/career_helper/ Career Guidance] [[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:27, 17 April 2026 (UTC)
:::@[[User:EasyshikshaMarketing|EasyshikshaMarketing]] Wikiversity is a resource for education, or a space for education. However, your intention to link to another website is obvious, and such content does not belong here, as it contradicts the purpose of Wikiversity. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:38, 17 April 2026 (UTC)

==AI-generated images==
Seeking your advice.

Myself and students use some AI-generated images in the [[Motivation and emotion]] project.

[[User:Dronebogus]] has been removing some of these images from Wikiversity pages and nominating them for deletion at Commons. As a result, some have been deleted and some have been kept.

Dronebogus has made some useful edits and image suggestions for [[Motivation and emotion]] which I've appreciated and  incorporated. However, there are other edits to remove an AI image by Dronebogus that I've reverted where I think the image is more educational than no image or an alternative image suggested by Dronebogus.

There are a couple of pages where Dronebogus has reverted my reversion, so we are at risk of edit warring. We have briefly discussed and warned each other on our user talk pages, but it seems to come down to a difference in perception about the educational usefulness of the AI images.

So, I'm asking here for others to please review the recent edit histories for these pages:
* [[Motivation and emotion/Lectures/Brain and physiological needs]]
* [[Motivation and emotion/Book/2025/Stockholm syndrome emotion]]

and let us know what you think about the AI image suitability vs. using no image or alternative images suggested by Dronebogus.

Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:45, 26 April 2026 (UTC)

:I think Jtneill needs to try harder to find non-AI alternatives both on Commons and the web. I’m not reiterating the well known problems with generative AI— you can read about those on Wikipedia and the broader Internet. Needless to say it’s kind of just inherently toxic. If you use it, it should be the last resort of last resorts. Just my stance, which I consider perfectly valid and reasonable. [[User:Dronebogus|Dronebogus]] ([[User talk:Dronebogus|discuss]] • [[Special:Contributions/Dronebogus|contribs]]) 04:10, 27 April 2026 (UTC)

== Request for Page Creation Approval - Research on Dr. Ian Stevenson ==


'''Hello Administrators,'''

I am a digital archivist and researcher attempting to create an educational page regarding Dr. Ian Stevenson's scientific work, specifically titled &quot;Where Reincarnation and Biology Intersect&quot; and its official Vietnamese edition.

My edits are purely constructive, aimed at integrating local research context with global structured data (including '''Wikidata Q139548587'''). The automated filter is currently preventing publication due to &quot;new user external link limits.&quot;

I have ensured that all citations, references, and images (sourced from Wikimedia Commons) are strictly academic and non-promotional. Could you please review my contributions and consider whitelisting my account or approving this specific page creation?

Thank you for your assistance in preserving this research '''legacy''' within the open knowledge ecosystem.

'''Best regards,''' [[User:Ian Stevenson777|Ian Stevenson777]] ([[User talk:Ian Stevenson777|discuss]] • [[Special:Contributions/Ian Stevenson777|contribs]]) 07:26, 28 April 2026 (UTC)
: The page title should probably be in English, as this is English Wikiversity. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:19, 28 April 2026 (UTC)
:@[[User:Ian Stevenson777|Ian Stevenson777]] I looked at the text and it seems to me that it is informative, but the user cannot learn anything from it because they would have to buy the book. In this regard, it seems to me that it is enough [[:w:Where Reincarnation and Biology Intersect|to have that article on Wikipedia]] and there is no need to duplicate it here on Wikiversity. If you are particularly interested with its Vietnamese translation, I would focus on Vietnamese Wikipedia, but it seems to me, that the article there [https://vi.wikipedia.org/w/index.php?title=N%C6%A1i_lu%C3%A2n_h%E1%BB%93i_v%C3%A0_sinh_h%E1%BB%8Dc_giao_nhau&amp;oldid=75029095 have some problems at the moment]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:51, 5 May 2026 (UTC)
:This request is AI-generated and was made by a lock evading LTA. Please ignore it. [[User:NguoiDungKhongDinhDanh|NguoiDungKhongDinhDanh]] ([[User talk:NguoiDungKhongDinhDanh|discuss]] • [[Special:Contributions/NguoiDungKhongDinhDanh|contribs]]) 23:58, 13 May 2026 (UTC)

== Call for custodians and bureaucrats ==
&lt;div class=&quot;cd-moveMark&quot;&gt;''Moved to [[Wikiversity:Notices for custodians#Call for custodians and bureaucrats]].  [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 18:46, 12 May 2026 (UTC)''&lt;/div&gt;

== Interface administrator flag request ==

@[[User:Jtneill|Jtneill]], @[[User:Mu301|Mu301]] I am requesting IA flag to delete [[MediaWiki:Gadget-WikiSign.js]]. It was requested for deletion by [[User:Sophivorus|a trusted user]] and I think it can be deleted. Once I delete it, I will notify you and you can remove the flag. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:24, 10 May 2026 (UTC)

:Can you enable two-factor authentication? 
:Policy: [[Wikiversity:Interface administrators]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:27, 10 May 2026 (UTC)
::Done @[[User:Jtneill|Jtneill]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:20, 11 May 2026 (UTC)
:::You are an interface administrator for 24 hours. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:57, 11 May 2026 (UTC)
::::Thx @[[User:Jtneill|Jtneill]], I have just deleted the page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:59, 11 May 2026 (UTC)

== Block request ==

Hi. Please block @[[User:Skibidi Titan 5.0|Skibidi Titan 5.0]]. Reason : Vandalism.

Thanks, [[User:Locpac|Locpac]] ([[User talk:Locpac|discuss]] • [[Special:Contributions/Locpac|contribs]]) 15:10, 10 May 2026 (UTC)

:Thankyou. Done. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 15:25, 10 May 2026 (UTC)


== ~2026-28496-53 ==

Please block [[Special:Contribs/~2026-28496-53]], vandalism. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:02, 11 May 2026 (UTC)

:{{done}} Thank you! —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 17:14, 11 May 2026 (UTC)

== ~2026-28792-52 ==

Please block [[Special:Contribs/~2026-28792-52]], vandalism. Appears to be same user as above. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:38, 12 May 2026 (UTC)
: Blocked locally by Barras. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 17:46, 12 May 2026 (UTC)</text>
      <sha1>2g9cdzllztjgn0bfkht6fuziib2374r</sha1>
    </revision>
    <revision>
      <id>2809703</id>
      <parentid>2809701</parentid>
      <timestamp>2026-05-16T19:24:06Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Please publish my post */ archive to [[Wikiversity:Request custodian action/Archive/30#Please publish my post]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809703</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="27996" sha1="o8udp680lc6wan4kozv7yin9cde3d1b" xml:space="preserve">{{/Header}}

== New user limit ==

Hi, I am creating an AIPA Method learning resource page. 

I am the author of the linked research, and I hit the “new user limit” and “new page with external link” filters while publishing. 

Here is the link to the page in creation: [https://en.wikiversity.org/w/index.php?title=AIPA_Method&amp;veaction=edit] 

Thank you for your help. 

Best regards, 

Senad Dizdarević [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:19, 30 March 2026 (UTC)

:@[[User:Senad Dizdarević|Senad Dizdarević]] I should admit I dont know, what is &quot;new user limit&quot;, but if filter blocks your page because of certain external link, you may force to save anyway and sometimes it works. It should not work, when the website is blacklisted. As of now, I am not seeing you to save page in main namespace, so try to save it without external links first. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:30, 30 March 2026 (UTC)
::Thank you, you are very kind. 
::I will wait a day, and try again (without links, too). 
::Today, I already created About Me info page, and maybe that is enough for the filters for one day.  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:53, 30 March 2026 (UTC)
:::Well, I have analyzed your contribution to Wikiversity and I should point out here, that this project is not a place for advertising, so there is no way of promoting your books and authority this way. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:56, 1 April 2026 (UTC)
::::Hi, my About Me page is just an info page with the neutral as possible presentation of my work. 
::::There is a big difference between informing and advertising. Informing is neutrally stating that something exists and requiring no action, while advertising is a special communication form with intent to cause certain action from readers. For example, click here, click there, order this, buy that. 
::::There is no such intention, form, or terms on my info page. Just neutral information. I don't hide and I am not ashamed that I am write and author, and that is a part of the usual bio, including works. I checked your user page: &quot;I graduated from the Czech University of Life Sciences in Prague and studied information science at the Faculty of Arts of Charles University.&quot; I think that if you had written a book on Life Science, you would have mentioned that as well.
::::Most of the Info page is about my research and AIPA Method which is a valid contribution to psychology, consciousness studies, identity theory, and personality development. Actually, my paper '''AIPA Method: A Cognitive-Phenomenological Model for Identity Reconstruction and Stabilization in Pure Awareness''' is now in the peer review procedure at Journal of Consciousness Studies. 
::::Here is a part from the Wikiversity AIPA Method page in creation (waiting for the end of the time limit for new users):    [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:47, 2 April 2026 (UTC)
:::::For the unknown reasons, the form didn't publish my second part of the message: 
:::::I believe this is a valid contribution to Wikiversity. 
:::::Best Regards, 
:::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:52, 2 April 2026 (UTC)
::::::And the third try: 
:::::: == Introduction ==
::::::The AIPA Method addresses a gap in contemporary personal development and consciousness science: most evidence‑based approaches (CBT, MBSR, MBCT, standard meditation) operate at the level of mental content—reframing thoughts, observing them, or reducing their impact—rather than at the level of identity structure. In contrast, AIPA targets the structural relationship between the self and the mind, aiming at durable identity reconstruction rooted in Pure Awareness rather than symptom management.
::::::The central research question of the primary AIPA preprint is whether a structured, sequentially staged method can produce permanent identity reconstruction rooted in Pure Awareness, and how such a method compares to established approaches in scope, mechanism, and outcome.
:::::: == Theoretical foundations ==
::::::The AIPA framework is grounded in the cognitive‑phenomenological tradition (e.g., McAdams, Varela, Metzinger, Erikson), contemporary consciousness science on minimal phenomenal experience, and qualitative methods advocacy in psychology. It builds directly on:
::::::* Empirical work on pure awareness and Minimal Phenomenal Experience (MPE), especially Gamma &amp; Metzinger’s large‑scale study of content‑reduced awareness states.
::::::* Metzinger’s proposal of minimal phenomenal experience as an entry point for a minimal unifying model of consciousness.
::::::* Narrative identity and partial‑self models within personality and identity theory.
::::::Within this backdrop, AIPA proposes Pure Awareness as a distinct, operationally specified state that can become a structural ground of identity rather than a transient meditative experience.
:::::: == Experiential empiricism ==
::::::The empirical foundation of the AIPA Method is explicitly first‑person and experiential, combining:
::::::* A 22‑year longitudinal autoethnographic self‑study (2003–2025) documenting partial personality episodes, protocol use, and outcomes.
::::::* A 13‑year prospective verification period with zero self‑reported recurrence of targeted harmful behaviors after a dated stabilization point (1 January 2006).
::::::* A high‑ecological‑validity “stress test” during acute bereavement, used to examine whether non‑reactive awareness remains stable under maximal provocation.
::::::* Two independent practitioner cases (an Amazon‑verified report and a structured questionnaire case) providing preliminary convergent signals across cognitive, emotional, behavioral, and identity dimensions.
::::::All central constructs (Pure Awareness, partial personalities, the Switch, identity stabilization) are operationalized with explicit phenomenological and behavioral criteria intended to enable replication and future third‑person measurement.
::::::I believe this is a valid contribution to Wikiversity. 
::::::Best regards, 
::::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:54, 2 April 2026 (UTC)

== Unable to publish pages  ==

Whenever I try to publish a page with linked sources it gets flagged and says I'm a new user attempting to publish content with outside links. Those outside links are my sources. [[User:Soboyed|Soboyed]] ([[User talk:Soboyed|discuss]] • [[Special:Contributions/Soboyed|contribs]]) 04:52, 2 April 2026 (UTC)

:This restriction is automatically lifted after you have edited for a certain time (I don't recall that time off-hand, but it is not long). This is designed to stop spam. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 04:53, 2 April 2026 (UTC)

== Showing error to publish a Post ==

My  action was constructive, not destructive, please allow to publish it. [[Special:Contributions/&amp;#126;2026-20906-18|&amp;#126;2026-20906-18]] ([[User talk:&amp;#126;2026-20906-18|talk]]) 08:06, 4 April 2026 (UTC)

:Maybe you got caught in a filter. Consider [[Special:CreateAccount|creating an account]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:06, 4 April 2026 (UTC)
:Your edits, [https://en.wikiversity.org/w/index.php?title=Special:AbuseLog&amp;wpSearchUser=%7E2026-20906-18 these ones], seems to have tripped a filter when you tried to create a page on [[Create]] which external links. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 23:58, 4 April 2026 (UTC)
:Have you read my [https://en.wikiversity.org/w/index.php?title=Wikiversity:Request_custodian_action&amp;diff=prev&amp;oldid=2802219 previous reply] to you @[[User:~2026-20906-18|~2026-20906-18]]? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:02, 6 April 2026 (UTC)

== Abuse filters which should be deleted ==

Hi, there are some abuse filters which should probably be deleted.
* [[Special:AbuseFilter/1]] (not needed anymore)
* [[Special:AbuseFilter/2]] (no hits since 2018)
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched)
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives)
* [[Special:AbuseFilter/5]] (no hits since 2023)
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore)
* [[Special:AbuseFilter/17]] (no hits since 2022)
* [[Special:AbuseFilter/19]] (no hits since 2019)
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive)
Thanks. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 03:51, 5 April 2026 (UTC)

:Why do these need to be deleted rather than inactivated? Do inactive abuse filters cause a server strain? —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:39, 5 April 2026 (UTC)
:: Deleted filters do not cause strain to the servers. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:28, 5 April 2026 (UTC)
:These sounds like sensible suggestions but, yes, would inactivation perhaps make more sense than deletion for at least some  filters? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:35, 5 April 2026 (UTC)
:I would keep them @[[User:Codename Noreste|Codename Noreste]]. Alternatively, I would turn off the ones that haven't caught anything for a long time, but I would leave them enabled in case they need to be turned on or improved. If someone has already written the code and we don't have hundreds of free man-hours of programmers on Wikiversity, the server load seems secondary to me, and is negligible compared to other things. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:11, 6 April 2026 (UTC)
:: I know how to write abuse filter code and regex, but I would recommend disabling filters that have never caught anything in a long time ''and'' those who made lots of false positives. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:09, 6 April 2026 (UTC)
:::Of course @[[User:Codename Noreste|Codename Noreste]], there are people here today who are capable of changing the code. But the question is what it will be like in a few years, the question is what will happen if those two are busy for a long time, etc. That's why I would leave it so that those who don't know much about code can be inspired by it and will need to do something with it someday - plus, more code for different types of filtering is actually great educational material on how those filters work. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:41, 17 April 2026 (UTC)

Here's the updated list of abuse filters under review with actions I've taken (several disabled, one basic code improvement, and some actions changed) - none have been deleted so they can all be edited and reactivayed - please suggest any further changes:
* [[Special:AbuseFilter/1]] (not needed anymore) - One time account spam bot - 4 hits over 10 years ago - Disabled in 2024 - May be useful in future
* [[Special:AbuseFilter/2]] (no hits since 2018) - Userspace spamming - 778 hits; none since 2018 likely due to global filters - Now disabled
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched) - Specific user page spam - 1,101 hits most recent 7 March 2026 - Still active - Kept enabled
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives) - Questionable Language (profanity) - 6,055 hits including very recently - However it was logging hits without taking any actions - Edited to reduce likelihood of false positives by only applying filter to users with low (&lt; 20) edit count and applied weak actions to tag and warn but not prevent publishing the content
* [[Special:AbuseFilter/5]] (no hits since 2023) - Blocked Solicitation Links - 95 hits; none since 2023 - blocks specific historical spam sites - Non-active - Now disabled
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore) - Not reviewed - They are currently disabled
* [[Special:AbuseFilter/17]] (no hits since 2022) - Fundamental Physics Edits - 347 hits; none since 2022 - Non-active and very specific for a historical issue - Now disabled 
* [[Special:AbuseFilter/19]] (no hits since 2019) - Page Creation - 20 hits; none since 2019 - Retained for historical reference and possible future updates - Now disabled
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive) - Globally Banned Editor (renamed to Low-edit Spam Monitor) - 2,829 hits including very recent - Only applies to users with less than 5 edits and takes no actions / monitoring only - Reviewing the details of the hits I don't see many false positives and have strengthened its actions to add a tag and warning

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:57, 9 April 2026 (UTC)

== Block request ==

Please block ~2026-20985-80/~2026-21079-90/~2026-21223-88. Reason: Vandalism. [[User:Àncilu|Àncilu]] ([[User talk:Àncilu|discuss]] • [[Special:Contributions/Àncilu|contribs]]) 23:24, 5 April 2026 (UTC)

:All edits should be deleted and the first is blocked by Atcovi. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:33, 6 April 2026 (UTC)

== Antispam - Filter 12 ==
{{ping|Codename Noreste}} Thanks for contacting me with a suggested [[Special:AbuseFilter|abuse filter]] for the coupon spam we've been getting. A very much appreciated time saver. Per your suggestion, abuse filter 12 has been reactivated with your updated regex. It should tag and prevent page creation actions for coupon promo etc. Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:33, 15 April 2026 (UTC)
: @[[User:Jtneill|Jtneill]] Please do the following to filter 12:
:# Enable the block action (temporary for unregistered users, indefinite for registered users)
:# Disable both the disallow and tag actions, since that filter will be set to block
: Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:42, 5 May 2026 (UTC)
::Excellent. Done:
::* Block duration for non-registered users = 1 week
::* Block duration for registered users = indefinite
::* Disallow and tagging disabled
::Thankyou. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:24, 9 May 2026 (UTC)

== Urgent! error message This action has been automatically identified as potentially harmful, and therefore disallowed ==

While submitting the post this error was coming &quot;This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please inform an administrator of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link&quot; How to resolve it?

Here is the content:

{{note|marketing material removed}}

[[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:14, 17 April 2026 (UTC)
: That's because Wikiversity doesn't accept advertising. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 05:20, 17 April 2026 (UTC)
::So this is fine
::'''Online Internship and Digital Learning for Students'''
::Online learning has become an important part of modern education. With the help of the internet and digital tools, students can now study, practice, and gain experience without being physically present in a classroom. One key part of this system is the online internship, which helps students learn real-world skills along with their studies.
::An online internship allows students to work on tasks and projects through digital platforms. This makes learning more practical and useful, especially for those who want to understand how real work environments function.
::'''Background'''
::The concept of online learning developed from distance education, where students learned from remote locations. Over time, with the growth of digital technology, learning has become more interactive and flexible.
::The introduction of the online internship has added another important layer to digital education. It combines theoretical learning with practical experience, helping students prepare for future careers.
::During global events such as the COVID-19 pandemic, online education and online internship programs became essential. They helped students continue learning and gaining experience despite restrictions on physical movement.
::'''Importance of Online Internship'''
::An online internship plays an important role in student development. It helps bridge the gap between academic knowledge and practical skills.
::'''Some key points include:'''
::Students understand how real work is done
::They develop basic professional skills
::It supports career readiness
::It allows learning without location limits
::By participating in an online internship, students can improve their confidence and gain early exposure to different fields.
::'''Features of Online Internship-Based Learning'''
::Modern education platforms often include online internship opportunities as part of their learning system. These usually offer:
::Flexible schedules for students
::Access to learning from home
::Beginner-friendly tasks and projects
::A combination of theory and practice
::Such features make online internship programs suitable for a wide range of learners, including beginners.
::'''Learning Tasks'''
::Explore how online internship programs support student learning in digital environments.
::Identify how students can gain practical experience through an online internship
::Analyze the role of flexible learning in improving student engagement
::Understand how online education and internships work together
::'''References'''
::[https://ijpsl.in/wp-content/uploads/2020/09/E-Learning_Hanaaya-Navaneeth.pdf The Past, Present and Future of E-Learning: Hanaaya Varyani and Navaneeth M S]
::[https://ieeexplore.ieee.org/document/9788102 Current Trends and Future Perspectives of e-Learning in India]
::'''See Also'''
::[https://easyshiksha.com/online_courses/internship Online Internship]
::[https://easyshiksha.com/online_courses/ Online Courses]
::[https://easyshiksha.com/online_courses/kids-learning Kids Learning]
::[https://easyshiksha.com/career_helper/ Career Guidance] [[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:27, 17 April 2026 (UTC)
:::@[[User:EasyshikshaMarketing|EasyshikshaMarketing]] Wikiversity is a resource for education, or a space for education. However, your intention to link to another website is obvious, and such content does not belong here, as it contradicts the purpose of Wikiversity. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:38, 17 April 2026 (UTC)

==AI-generated images==
Seeking your advice.

Myself and students use some AI-generated images in the [[Motivation and emotion]] project.

[[User:Dronebogus]] has been removing some of these images from Wikiversity pages and nominating them for deletion at Commons. As a result, some have been deleted and some have been kept.

Dronebogus has made some useful edits and image suggestions for [[Motivation and emotion]] which I've appreciated and  incorporated. However, there are other edits to remove an AI image by Dronebogus that I've reverted where I think the image is more educational than no image or an alternative image suggested by Dronebogus.

There are a couple of pages where Dronebogus has reverted my reversion, so we are at risk of edit warring. We have briefly discussed and warned each other on our user talk pages, but it seems to come down to a difference in perception about the educational usefulness of the AI images.

So, I'm asking here for others to please review the recent edit histories for these pages:
* [[Motivation and emotion/Lectures/Brain and physiological needs]]
* [[Motivation and emotion/Book/2025/Stockholm syndrome emotion]]

and let us know what you think about the AI image suitability vs. using no image or alternative images suggested by Dronebogus.

Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:45, 26 April 2026 (UTC)

:I think Jtneill needs to try harder to find non-AI alternatives both on Commons and the web. I’m not reiterating the well known problems with generative AI— you can read about those on Wikipedia and the broader Internet. Needless to say it’s kind of just inherently toxic. If you use it, it should be the last resort of last resorts. Just my stance, which I consider perfectly valid and reasonable. [[User:Dronebogus|Dronebogus]] ([[User talk:Dronebogus|discuss]] • [[Special:Contributions/Dronebogus|contribs]]) 04:10, 27 April 2026 (UTC)

== Request for Page Creation Approval - Research on Dr. Ian Stevenson ==


'''Hello Administrators,'''

I am a digital archivist and researcher attempting to create an educational page regarding Dr. Ian Stevenson's scientific work, specifically titled &quot;Where Reincarnation and Biology Intersect&quot; and its official Vietnamese edition.

My edits are purely constructive, aimed at integrating local research context with global structured data (including '''Wikidata Q139548587'''). The automated filter is currently preventing publication due to &quot;new user external link limits.&quot;

I have ensured that all citations, references, and images (sourced from Wikimedia Commons) are strictly academic and non-promotional. Could you please review my contributions and consider whitelisting my account or approving this specific page creation?

Thank you for your assistance in preserving this research '''legacy''' within the open knowledge ecosystem.

'''Best regards,''' [[User:Ian Stevenson777|Ian Stevenson777]] ([[User talk:Ian Stevenson777|discuss]] • [[Special:Contributions/Ian Stevenson777|contribs]]) 07:26, 28 April 2026 (UTC)
: The page title should probably be in English, as this is English Wikiversity. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:19, 28 April 2026 (UTC)
:@[[User:Ian Stevenson777|Ian Stevenson777]] I looked at the text and it seems to me that it is informative, but the user cannot learn anything from it because they would have to buy the book. In this regard, it seems to me that it is enough [[:w:Where Reincarnation and Biology Intersect|to have that article on Wikipedia]] and there is no need to duplicate it here on Wikiversity. If you are particularly interested with its Vietnamese translation, I would focus on Vietnamese Wikipedia, but it seems to me, that the article there [https://vi.wikipedia.org/w/index.php?title=N%C6%A1i_lu%C3%A2n_h%E1%BB%93i_v%C3%A0_sinh_h%E1%BB%8Dc_giao_nhau&amp;oldid=75029095 have some problems at the moment]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:51, 5 May 2026 (UTC)
:This request is AI-generated and was made by a lock evading LTA. Please ignore it. [[User:NguoiDungKhongDinhDanh|NguoiDungKhongDinhDanh]] ([[User talk:NguoiDungKhongDinhDanh|discuss]] • [[Special:Contributions/NguoiDungKhongDinhDanh|contribs]]) 23:58, 13 May 2026 (UTC)

== Call for custodians and bureaucrats ==
&lt;div class=&quot;cd-moveMark&quot;&gt;''Moved to [[Wikiversity:Notices for custodians#Call for custodians and bureaucrats]].  [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 18:46, 12 May 2026 (UTC)''&lt;/div&gt;

== Interface administrator flag request ==

@[[User:Jtneill|Jtneill]], @[[User:Mu301|Mu301]] I am requesting IA flag to delete [[MediaWiki:Gadget-WikiSign.js]]. It was requested for deletion by [[User:Sophivorus|a trusted user]] and I think it can be deleted. Once I delete it, I will notify you and you can remove the flag. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:24, 10 May 2026 (UTC)

:Can you enable two-factor authentication? 
:Policy: [[Wikiversity:Interface administrators]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:27, 10 May 2026 (UTC)
::Done @[[User:Jtneill|Jtneill]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:20, 11 May 2026 (UTC)
:::You are an interface administrator for 24 hours. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:57, 11 May 2026 (UTC)
::::Thx @[[User:Jtneill|Jtneill]], I have just deleted the page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:59, 11 May 2026 (UTC)

== Block request ==

Hi. Please block @[[User:Skibidi Titan 5.0|Skibidi Titan 5.0]]. Reason : Vandalism.

Thanks, [[User:Locpac|Locpac]] ([[User talk:Locpac|discuss]] • [[Special:Contributions/Locpac|contribs]]) 15:10, 10 May 2026 (UTC)

:Thankyou. Done. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 15:25, 10 May 2026 (UTC)


== ~2026-28496-53 ==

Please block [[Special:Contribs/~2026-28496-53]], vandalism. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:02, 11 May 2026 (UTC)

:{{done}} Thank you! —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 17:14, 11 May 2026 (UTC)

== ~2026-28792-52 ==

Please block [[Special:Contribs/~2026-28792-52]], vandalism. Appears to be same user as above. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:38, 12 May 2026 (UTC)
: Blocked locally by Barras. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 17:46, 12 May 2026 (UTC)</text>
      <sha1>o8udp680lc6wan4kozv7yin9cde3d1b</sha1>
    </revision>
    <revision>
      <id>2809705</id>
      <parentid>2809703</parentid>
      <timestamp>2026-05-16T19:24:19Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* New user limit */ archive to [[Wikiversity:Request custodian action/Archive/30#New user limit]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809705</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="21193" sha1="5kmgeb1ygbcbrl9t4n1yrcreyc7r7md" xml:space="preserve">{{/Header}}

== Unable to publish pages  ==

Whenever I try to publish a page with linked sources it gets flagged and says I'm a new user attempting to publish content with outside links. Those outside links are my sources. [[User:Soboyed|Soboyed]] ([[User talk:Soboyed|discuss]] • [[Special:Contributions/Soboyed|contribs]]) 04:52, 2 April 2026 (UTC)

:This restriction is automatically lifted after you have edited for a certain time (I don't recall that time off-hand, but it is not long). This is designed to stop spam. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 04:53, 2 April 2026 (UTC)

== Showing error to publish a Post ==

My  action was constructive, not destructive, please allow to publish it. [[Special:Contributions/&amp;#126;2026-20906-18|&amp;#126;2026-20906-18]] ([[User talk:&amp;#126;2026-20906-18|talk]]) 08:06, 4 April 2026 (UTC)

:Maybe you got caught in a filter. Consider [[Special:CreateAccount|creating an account]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:06, 4 April 2026 (UTC)
:Your edits, [https://en.wikiversity.org/w/index.php?title=Special:AbuseLog&amp;wpSearchUser=%7E2026-20906-18 these ones], seems to have tripped a filter when you tried to create a page on [[Create]] which external links. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 23:58, 4 April 2026 (UTC)
:Have you read my [https://en.wikiversity.org/w/index.php?title=Wikiversity:Request_custodian_action&amp;diff=prev&amp;oldid=2802219 previous reply] to you @[[User:~2026-20906-18|~2026-20906-18]]? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:02, 6 April 2026 (UTC)

== Abuse filters which should be deleted ==

Hi, there are some abuse filters which should probably be deleted.
* [[Special:AbuseFilter/1]] (not needed anymore)
* [[Special:AbuseFilter/2]] (no hits since 2018)
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched)
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives)
* [[Special:AbuseFilter/5]] (no hits since 2023)
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore)
* [[Special:AbuseFilter/17]] (no hits since 2022)
* [[Special:AbuseFilter/19]] (no hits since 2019)
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive)
Thanks. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 03:51, 5 April 2026 (UTC)

:Why do these need to be deleted rather than inactivated? Do inactive abuse filters cause a server strain? —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:39, 5 April 2026 (UTC)
:: Deleted filters do not cause strain to the servers. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:28, 5 April 2026 (UTC)
:These sounds like sensible suggestions but, yes, would inactivation perhaps make more sense than deletion for at least some  filters? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:35, 5 April 2026 (UTC)
:I would keep them @[[User:Codename Noreste|Codename Noreste]]. Alternatively, I would turn off the ones that haven't caught anything for a long time, but I would leave them enabled in case they need to be turned on or improved. If someone has already written the code and we don't have hundreds of free man-hours of programmers on Wikiversity, the server load seems secondary to me, and is negligible compared to other things. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:11, 6 April 2026 (UTC)
:: I know how to write abuse filter code and regex, but I would recommend disabling filters that have never caught anything in a long time ''and'' those who made lots of false positives. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:09, 6 April 2026 (UTC)
:::Of course @[[User:Codename Noreste|Codename Noreste]], there are people here today who are capable of changing the code. But the question is what it will be like in a few years, the question is what will happen if those two are busy for a long time, etc. That's why I would leave it so that those who don't know much about code can be inspired by it and will need to do something with it someday - plus, more code for different types of filtering is actually great educational material on how those filters work. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:41, 17 April 2026 (UTC)

Here's the updated list of abuse filters under review with actions I've taken (several disabled, one basic code improvement, and some actions changed) - none have been deleted so they can all be edited and reactivayed - please suggest any further changes:
* [[Special:AbuseFilter/1]] (not needed anymore) - One time account spam bot - 4 hits over 10 years ago - Disabled in 2024 - May be useful in future
* [[Special:AbuseFilter/2]] (no hits since 2018) - Userspace spamming - 778 hits; none since 2018 likely due to global filters - Now disabled
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched) - Specific user page spam - 1,101 hits most recent 7 March 2026 - Still active - Kept enabled
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives) - Questionable Language (profanity) - 6,055 hits including very recently - However it was logging hits without taking any actions - Edited to reduce likelihood of false positives by only applying filter to users with low (&lt; 20) edit count and applied weak actions to tag and warn but not prevent publishing the content
* [[Special:AbuseFilter/5]] (no hits since 2023) - Blocked Solicitation Links - 95 hits; none since 2023 - blocks specific historical spam sites - Non-active - Now disabled
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore) - Not reviewed - They are currently disabled
* [[Special:AbuseFilter/17]] (no hits since 2022) - Fundamental Physics Edits - 347 hits; none since 2022 - Non-active and very specific for a historical issue - Now disabled 
* [[Special:AbuseFilter/19]] (no hits since 2019) - Page Creation - 20 hits; none since 2019 - Retained for historical reference and possible future updates - Now disabled
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive) - Globally Banned Editor (renamed to Low-edit Spam Monitor) - 2,829 hits including very recent - Only applies to users with less than 5 edits and takes no actions / monitoring only - Reviewing the details of the hits I don't see many false positives and have strengthened its actions to add a tag and warning

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:57, 9 April 2026 (UTC)

== Block request ==

Please block ~2026-20985-80/~2026-21079-90/~2026-21223-88. Reason: Vandalism. [[User:Àncilu|Àncilu]] ([[User talk:Àncilu|discuss]] • [[Special:Contributions/Àncilu|contribs]]) 23:24, 5 April 2026 (UTC)

:All edits should be deleted and the first is blocked by Atcovi. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:33, 6 April 2026 (UTC)

== Antispam - Filter 12 ==
{{ping|Codename Noreste}} Thanks for contacting me with a suggested [[Special:AbuseFilter|abuse filter]] for the coupon spam we've been getting. A very much appreciated time saver. Per your suggestion, abuse filter 12 has been reactivated with your updated regex. It should tag and prevent page creation actions for coupon promo etc. Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:33, 15 April 2026 (UTC)
: @[[User:Jtneill|Jtneill]] Please do the following to filter 12:
:# Enable the block action (temporary for unregistered users, indefinite for registered users)
:# Disable both the disallow and tag actions, since that filter will be set to block
: Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:42, 5 May 2026 (UTC)
::Excellent. Done:
::* Block duration for non-registered users = 1 week
::* Block duration for registered users = indefinite
::* Disallow and tagging disabled
::Thankyou. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:24, 9 May 2026 (UTC)

== Urgent! error message This action has been automatically identified as potentially harmful, and therefore disallowed ==

While submitting the post this error was coming &quot;This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please inform an administrator of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link&quot; How to resolve it?

Here is the content:

{{note|marketing material removed}}

[[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:14, 17 April 2026 (UTC)
: That's because Wikiversity doesn't accept advertising. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 05:20, 17 April 2026 (UTC)
::So this is fine
::'''Online Internship and Digital Learning for Students'''
::Online learning has become an important part of modern education. With the help of the internet and digital tools, students can now study, practice, and gain experience without being physically present in a classroom. One key part of this system is the online internship, which helps students learn real-world skills along with their studies.
::An online internship allows students to work on tasks and projects through digital platforms. This makes learning more practical and useful, especially for those who want to understand how real work environments function.
::'''Background'''
::The concept of online learning developed from distance education, where students learned from remote locations. Over time, with the growth of digital technology, learning has become more interactive and flexible.
::The introduction of the online internship has added another important layer to digital education. It combines theoretical learning with practical experience, helping students prepare for future careers.
::During global events such as the COVID-19 pandemic, online education and online internship programs became essential. They helped students continue learning and gaining experience despite restrictions on physical movement.
::'''Importance of Online Internship'''
::An online internship plays an important role in student development. It helps bridge the gap between academic knowledge and practical skills.
::'''Some key points include:'''
::Students understand how real work is done
::They develop basic professional skills
::It supports career readiness
::It allows learning without location limits
::By participating in an online internship, students can improve their confidence and gain early exposure to different fields.
::'''Features of Online Internship-Based Learning'''
::Modern education platforms often include online internship opportunities as part of their learning system. These usually offer:
::Flexible schedules for students
::Access to learning from home
::Beginner-friendly tasks and projects
::A combination of theory and practice
::Such features make online internship programs suitable for a wide range of learners, including beginners.
::'''Learning Tasks'''
::Explore how online internship programs support student learning in digital environments.
::Identify how students can gain practical experience through an online internship
::Analyze the role of flexible learning in improving student engagement
::Understand how online education and internships work together
::'''References'''
::[https://ijpsl.in/wp-content/uploads/2020/09/E-Learning_Hanaaya-Navaneeth.pdf The Past, Present and Future of E-Learning: Hanaaya Varyani and Navaneeth M S]
::[https://ieeexplore.ieee.org/document/9788102 Current Trends and Future Perspectives of e-Learning in India]
::'''See Also'''
::[https://easyshiksha.com/online_courses/internship Online Internship]
::[https://easyshiksha.com/online_courses/ Online Courses]
::[https://easyshiksha.com/online_courses/kids-learning Kids Learning]
::[https://easyshiksha.com/career_helper/ Career Guidance] [[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:27, 17 April 2026 (UTC)
:::@[[User:EasyshikshaMarketing|EasyshikshaMarketing]] Wikiversity is a resource for education, or a space for education. However, your intention to link to another website is obvious, and such content does not belong here, as it contradicts the purpose of Wikiversity. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:38, 17 April 2026 (UTC)

==AI-generated images==
Seeking your advice.

Myself and students use some AI-generated images in the [[Motivation and emotion]] project.

[[User:Dronebogus]] has been removing some of these images from Wikiversity pages and nominating them for deletion at Commons. As a result, some have been deleted and some have been kept.

Dronebogus has made some useful edits and image suggestions for [[Motivation and emotion]] which I've appreciated and  incorporated. However, there are other edits to remove an AI image by Dronebogus that I've reverted where I think the image is more educational than no image or an alternative image suggested by Dronebogus.

There are a couple of pages where Dronebogus has reverted my reversion, so we are at risk of edit warring. We have briefly discussed and warned each other on our user talk pages, but it seems to come down to a difference in perception about the educational usefulness of the AI images.

So, I'm asking here for others to please review the recent edit histories for these pages:
* [[Motivation and emotion/Lectures/Brain and physiological needs]]
* [[Motivation and emotion/Book/2025/Stockholm syndrome emotion]]

and let us know what you think about the AI image suitability vs. using no image or alternative images suggested by Dronebogus.

Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:45, 26 April 2026 (UTC)

:I think Jtneill needs to try harder to find non-AI alternatives both on Commons and the web. I’m not reiterating the well known problems with generative AI— you can read about those on Wikipedia and the broader Internet. Needless to say it’s kind of just inherently toxic. If you use it, it should be the last resort of last resorts. Just my stance, which I consider perfectly valid and reasonable. [[User:Dronebogus|Dronebogus]] ([[User talk:Dronebogus|discuss]] • [[Special:Contributions/Dronebogus|contribs]]) 04:10, 27 April 2026 (UTC)

== Request for Page Creation Approval - Research on Dr. Ian Stevenson ==


'''Hello Administrators,'''

I am a digital archivist and researcher attempting to create an educational page regarding Dr. Ian Stevenson's scientific work, specifically titled &quot;Where Reincarnation and Biology Intersect&quot; and its official Vietnamese edition.

My edits are purely constructive, aimed at integrating local research context with global structured data (including '''Wikidata Q139548587'''). The automated filter is currently preventing publication due to &quot;new user external link limits.&quot;

I have ensured that all citations, references, and images (sourced from Wikimedia Commons) are strictly academic and non-promotional. Could you please review my contributions and consider whitelisting my account or approving this specific page creation?

Thank you for your assistance in preserving this research '''legacy''' within the open knowledge ecosystem.

'''Best regards,''' [[User:Ian Stevenson777|Ian Stevenson777]] ([[User talk:Ian Stevenson777|discuss]] • [[Special:Contributions/Ian Stevenson777|contribs]]) 07:26, 28 April 2026 (UTC)
: The page title should probably be in English, as this is English Wikiversity. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:19, 28 April 2026 (UTC)
:@[[User:Ian Stevenson777|Ian Stevenson777]] I looked at the text and it seems to me that it is informative, but the user cannot learn anything from it because they would have to buy the book. In this regard, it seems to me that it is enough [[:w:Where Reincarnation and Biology Intersect|to have that article on Wikipedia]] and there is no need to duplicate it here on Wikiversity. If you are particularly interested with its Vietnamese translation, I would focus on Vietnamese Wikipedia, but it seems to me, that the article there [https://vi.wikipedia.org/w/index.php?title=N%C6%A1i_lu%C3%A2n_h%E1%BB%93i_v%C3%A0_sinh_h%E1%BB%8Dc_giao_nhau&amp;oldid=75029095 have some problems at the moment]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:51, 5 May 2026 (UTC)
:This request is AI-generated and was made by a lock evading LTA. Please ignore it. [[User:NguoiDungKhongDinhDanh|NguoiDungKhongDinhDanh]] ([[User talk:NguoiDungKhongDinhDanh|discuss]] • [[Special:Contributions/NguoiDungKhongDinhDanh|contribs]]) 23:58, 13 May 2026 (UTC)

== Call for custodians and bureaucrats ==
&lt;div class=&quot;cd-moveMark&quot;&gt;''Moved to [[Wikiversity:Notices for custodians#Call for custodians and bureaucrats]].  [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 18:46, 12 May 2026 (UTC)''&lt;/div&gt;

== Interface administrator flag request ==

@[[User:Jtneill|Jtneill]], @[[User:Mu301|Mu301]] I am requesting IA flag to delete [[MediaWiki:Gadget-WikiSign.js]]. It was requested for deletion by [[User:Sophivorus|a trusted user]] and I think it can be deleted. Once I delete it, I will notify you and you can remove the flag. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:24, 10 May 2026 (UTC)

:Can you enable two-factor authentication? 
:Policy: [[Wikiversity:Interface administrators]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:27, 10 May 2026 (UTC)
::Done @[[User:Jtneill|Jtneill]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:20, 11 May 2026 (UTC)
:::You are an interface administrator for 24 hours. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:57, 11 May 2026 (UTC)
::::Thx @[[User:Jtneill|Jtneill]], I have just deleted the page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:59, 11 May 2026 (UTC)

== Block request ==

Hi. Please block @[[User:Skibidi Titan 5.0|Skibidi Titan 5.0]]. Reason : Vandalism.

Thanks, [[User:Locpac|Locpac]] ([[User talk:Locpac|discuss]] • [[Special:Contributions/Locpac|contribs]]) 15:10, 10 May 2026 (UTC)

:Thankyou. Done. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 15:25, 10 May 2026 (UTC)


== ~2026-28496-53 ==

Please block [[Special:Contribs/~2026-28496-53]], vandalism. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:02, 11 May 2026 (UTC)

:{{done}} Thank you! —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 17:14, 11 May 2026 (UTC)

== ~2026-28792-52 ==

Please block [[Special:Contribs/~2026-28792-52]], vandalism. Appears to be same user as above. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:38, 12 May 2026 (UTC)
: Blocked locally by Barras. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 17:46, 12 May 2026 (UTC)</text>
      <sha1>5kmgeb1ygbcbrl9t4n1yrcreyc7r7md</sha1>
    </revision>
    <revision>
      <id>2809707</id>
      <parentid>2809705</parentid>
      <timestamp>2026-05-16T19:24:30Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Unable to publish pages */ archive to [[Wikiversity:Request custodian action/Archive/30#Unable to publish pages]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809707</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="20456" sha1="mfijk2h6t80jprxa5sg7d69fu7comvo" xml:space="preserve">{{/Header}}

== Showing error to publish a Post ==

My  action was constructive, not destructive, please allow to publish it. [[Special:Contributions/&amp;#126;2026-20906-18|&amp;#126;2026-20906-18]] ([[User talk:&amp;#126;2026-20906-18|talk]]) 08:06, 4 April 2026 (UTC)

:Maybe you got caught in a filter. Consider [[Special:CreateAccount|creating an account]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:06, 4 April 2026 (UTC)
:Your edits, [https://en.wikiversity.org/w/index.php?title=Special:AbuseLog&amp;wpSearchUser=%7E2026-20906-18 these ones], seems to have tripped a filter when you tried to create a page on [[Create]] which external links. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 23:58, 4 April 2026 (UTC)
:Have you read my [https://en.wikiversity.org/w/index.php?title=Wikiversity:Request_custodian_action&amp;diff=prev&amp;oldid=2802219 previous reply] to you @[[User:~2026-20906-18|~2026-20906-18]]? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:02, 6 April 2026 (UTC)

== Abuse filters which should be deleted ==

Hi, there are some abuse filters which should probably be deleted.
* [[Special:AbuseFilter/1]] (not needed anymore)
* [[Special:AbuseFilter/2]] (no hits since 2018)
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched)
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives)
* [[Special:AbuseFilter/5]] (no hits since 2023)
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore)
* [[Special:AbuseFilter/17]] (no hits since 2022)
* [[Special:AbuseFilter/19]] (no hits since 2019)
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive)
Thanks. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 03:51, 5 April 2026 (UTC)

:Why do these need to be deleted rather than inactivated? Do inactive abuse filters cause a server strain? —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:39, 5 April 2026 (UTC)
:: Deleted filters do not cause strain to the servers. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:28, 5 April 2026 (UTC)
:These sounds like sensible suggestions but, yes, would inactivation perhaps make more sense than deletion for at least some  filters? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:35, 5 April 2026 (UTC)
:I would keep them @[[User:Codename Noreste|Codename Noreste]]. Alternatively, I would turn off the ones that haven't caught anything for a long time, but I would leave them enabled in case they need to be turned on or improved. If someone has already written the code and we don't have hundreds of free man-hours of programmers on Wikiversity, the server load seems secondary to me, and is negligible compared to other things. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:11, 6 April 2026 (UTC)
:: I know how to write abuse filter code and regex, but I would recommend disabling filters that have never caught anything in a long time ''and'' those who made lots of false positives. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:09, 6 April 2026 (UTC)
:::Of course @[[User:Codename Noreste|Codename Noreste]], there are people here today who are capable of changing the code. But the question is what it will be like in a few years, the question is what will happen if those two are busy for a long time, etc. That's why I would leave it so that those who don't know much about code can be inspired by it and will need to do something with it someday - plus, more code for different types of filtering is actually great educational material on how those filters work. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:41, 17 April 2026 (UTC)

Here's the updated list of abuse filters under review with actions I've taken (several disabled, one basic code improvement, and some actions changed) - none have been deleted so they can all be edited and reactivayed - please suggest any further changes:
* [[Special:AbuseFilter/1]] (not needed anymore) - One time account spam bot - 4 hits over 10 years ago - Disabled in 2024 - May be useful in future
* [[Special:AbuseFilter/2]] (no hits since 2018) - Userspace spamming - 778 hits; none since 2018 likely due to global filters - Now disabled
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched) - Specific user page spam - 1,101 hits most recent 7 March 2026 - Still active - Kept enabled
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives) - Questionable Language (profanity) - 6,055 hits including very recently - However it was logging hits without taking any actions - Edited to reduce likelihood of false positives by only applying filter to users with low (&lt; 20) edit count and applied weak actions to tag and warn but not prevent publishing the content
* [[Special:AbuseFilter/5]] (no hits since 2023) - Blocked Solicitation Links - 95 hits; none since 2023 - blocks specific historical spam sites - Non-active - Now disabled
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore) - Not reviewed - They are currently disabled
* [[Special:AbuseFilter/17]] (no hits since 2022) - Fundamental Physics Edits - 347 hits; none since 2022 - Non-active and very specific for a historical issue - Now disabled 
* [[Special:AbuseFilter/19]] (no hits since 2019) - Page Creation - 20 hits; none since 2019 - Retained for historical reference and possible future updates - Now disabled
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive) - Globally Banned Editor (renamed to Low-edit Spam Monitor) - 2,829 hits including very recent - Only applies to users with less than 5 edits and takes no actions / monitoring only - Reviewing the details of the hits I don't see many false positives and have strengthened its actions to add a tag and warning

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:57, 9 April 2026 (UTC)

== Block request ==

Please block ~2026-20985-80/~2026-21079-90/~2026-21223-88. Reason: Vandalism. [[User:Àncilu|Àncilu]] ([[User talk:Àncilu|discuss]] • [[Special:Contributions/Àncilu|contribs]]) 23:24, 5 April 2026 (UTC)

:All edits should be deleted and the first is blocked by Atcovi. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:33, 6 April 2026 (UTC)

== Antispam - Filter 12 ==
{{ping|Codename Noreste}} Thanks for contacting me with a suggested [[Special:AbuseFilter|abuse filter]] for the coupon spam we've been getting. A very much appreciated time saver. Per your suggestion, abuse filter 12 has been reactivated with your updated regex. It should tag and prevent page creation actions for coupon promo etc. Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:33, 15 April 2026 (UTC)
: @[[User:Jtneill|Jtneill]] Please do the following to filter 12:
:# Enable the block action (temporary for unregistered users, indefinite for registered users)
:# Disable both the disallow and tag actions, since that filter will be set to block
: Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:42, 5 May 2026 (UTC)
::Excellent. Done:
::* Block duration for non-registered users = 1 week
::* Block duration for registered users = indefinite
::* Disallow and tagging disabled
::Thankyou. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:24, 9 May 2026 (UTC)

== Urgent! error message This action has been automatically identified as potentially harmful, and therefore disallowed ==

While submitting the post this error was coming &quot;This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please inform an administrator of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link&quot; How to resolve it?

Here is the content:

{{note|marketing material removed}}

[[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:14, 17 April 2026 (UTC)
: That's because Wikiversity doesn't accept advertising. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 05:20, 17 April 2026 (UTC)
::So this is fine
::'''Online Internship and Digital Learning for Students'''
::Online learning has become an important part of modern education. With the help of the internet and digital tools, students can now study, practice, and gain experience without being physically present in a classroom. One key part of this system is the online internship, which helps students learn real-world skills along with their studies.
::An online internship allows students to work on tasks and projects through digital platforms. This makes learning more practical and useful, especially for those who want to understand how real work environments function.
::'''Background'''
::The concept of online learning developed from distance education, where students learned from remote locations. Over time, with the growth of digital technology, learning has become more interactive and flexible.
::The introduction of the online internship has added another important layer to digital education. It combines theoretical learning with practical experience, helping students prepare for future careers.
::During global events such as the COVID-19 pandemic, online education and online internship programs became essential. They helped students continue learning and gaining experience despite restrictions on physical movement.
::'''Importance of Online Internship'''
::An online internship plays an important role in student development. It helps bridge the gap between academic knowledge and practical skills.
::'''Some key points include:'''
::Students understand how real work is done
::They develop basic professional skills
::It supports career readiness
::It allows learning without location limits
::By participating in an online internship, students can improve their confidence and gain early exposure to different fields.
::'''Features of Online Internship-Based Learning'''
::Modern education platforms often include online internship opportunities as part of their learning system. These usually offer:
::Flexible schedules for students
::Access to learning from home
::Beginner-friendly tasks and projects
::A combination of theory and practice
::Such features make online internship programs suitable for a wide range of learners, including beginners.
::'''Learning Tasks'''
::Explore how online internship programs support student learning in digital environments.
::Identify how students can gain practical experience through an online internship
::Analyze the role of flexible learning in improving student engagement
::Understand how online education and internships work together
::'''References'''
::[https://ijpsl.in/wp-content/uploads/2020/09/E-Learning_Hanaaya-Navaneeth.pdf The Past, Present and Future of E-Learning: Hanaaya Varyani and Navaneeth M S]
::[https://ieeexplore.ieee.org/document/9788102 Current Trends and Future Perspectives of e-Learning in India]
::'''See Also'''
::[https://easyshiksha.com/online_courses/internship Online Internship]
::[https://easyshiksha.com/online_courses/ Online Courses]
::[https://easyshiksha.com/online_courses/kids-learning Kids Learning]
::[https://easyshiksha.com/career_helper/ Career Guidance] [[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:27, 17 April 2026 (UTC)
:::@[[User:EasyshikshaMarketing|EasyshikshaMarketing]] Wikiversity is a resource for education, or a space for education. However, your intention to link to another website is obvious, and such content does not belong here, as it contradicts the purpose of Wikiversity. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:38, 17 April 2026 (UTC)

==AI-generated images==
Seeking your advice.

Myself and students use some AI-generated images in the [[Motivation and emotion]] project.

[[User:Dronebogus]] has been removing some of these images from Wikiversity pages and nominating them for deletion at Commons. As a result, some have been deleted and some have been kept.

Dronebogus has made some useful edits and image suggestions for [[Motivation and emotion]] which I've appreciated and  incorporated. However, there are other edits to remove an AI image by Dronebogus that I've reverted where I think the image is more educational than no image or an alternative image suggested by Dronebogus.

There are a couple of pages where Dronebogus has reverted my reversion, so we are at risk of edit warring. We have briefly discussed and warned each other on our user talk pages, but it seems to come down to a difference in perception about the educational usefulness of the AI images.

So, I'm asking here for others to please review the recent edit histories for these pages:
* [[Motivation and emotion/Lectures/Brain and physiological needs]]
* [[Motivation and emotion/Book/2025/Stockholm syndrome emotion]]

and let us know what you think about the AI image suitability vs. using no image or alternative images suggested by Dronebogus.

Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:45, 26 April 2026 (UTC)

:I think Jtneill needs to try harder to find non-AI alternatives both on Commons and the web. I’m not reiterating the well known problems with generative AI— you can read about those on Wikipedia and the broader Internet. Needless to say it’s kind of just inherently toxic. If you use it, it should be the last resort of last resorts. Just my stance, which I consider perfectly valid and reasonable. [[User:Dronebogus|Dronebogus]] ([[User talk:Dronebogus|discuss]] • [[Special:Contributions/Dronebogus|contribs]]) 04:10, 27 April 2026 (UTC)

== Request for Page Creation Approval - Research on Dr. Ian Stevenson ==


'''Hello Administrators,'''

I am a digital archivist and researcher attempting to create an educational page regarding Dr. Ian Stevenson's scientific work, specifically titled &quot;Where Reincarnation and Biology Intersect&quot; and its official Vietnamese edition.

My edits are purely constructive, aimed at integrating local research context with global structured data (including '''Wikidata Q139548587'''). The automated filter is currently preventing publication due to &quot;new user external link limits.&quot;

I have ensured that all citations, references, and images (sourced from Wikimedia Commons) are strictly academic and non-promotional. Could you please review my contributions and consider whitelisting my account or approving this specific page creation?

Thank you for your assistance in preserving this research '''legacy''' within the open knowledge ecosystem.

'''Best regards,''' [[User:Ian Stevenson777|Ian Stevenson777]] ([[User talk:Ian Stevenson777|discuss]] • [[Special:Contributions/Ian Stevenson777|contribs]]) 07:26, 28 April 2026 (UTC)
: The page title should probably be in English, as this is English Wikiversity. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:19, 28 April 2026 (UTC)
:@[[User:Ian Stevenson777|Ian Stevenson777]] I looked at the text and it seems to me that it is informative, but the user cannot learn anything from it because they would have to buy the book. In this regard, it seems to me that it is enough [[:w:Where Reincarnation and Biology Intersect|to have that article on Wikipedia]] and there is no need to duplicate it here on Wikiversity. If you are particularly interested with its Vietnamese translation, I would focus on Vietnamese Wikipedia, but it seems to me, that the article there [https://vi.wikipedia.org/w/index.php?title=N%C6%A1i_lu%C3%A2n_h%E1%BB%93i_v%C3%A0_sinh_h%E1%BB%8Dc_giao_nhau&amp;oldid=75029095 have some problems at the moment]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:51, 5 May 2026 (UTC)
:This request is AI-generated and was made by a lock evading LTA. Please ignore it. [[User:NguoiDungKhongDinhDanh|NguoiDungKhongDinhDanh]] ([[User talk:NguoiDungKhongDinhDanh|discuss]] • [[Special:Contributions/NguoiDungKhongDinhDanh|contribs]]) 23:58, 13 May 2026 (UTC)

== Call for custodians and bureaucrats ==
&lt;div class=&quot;cd-moveMark&quot;&gt;''Moved to [[Wikiversity:Notices for custodians#Call for custodians and bureaucrats]].  [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 18:46, 12 May 2026 (UTC)''&lt;/div&gt;

== Interface administrator flag request ==

@[[User:Jtneill|Jtneill]], @[[User:Mu301|Mu301]] I am requesting IA flag to delete [[MediaWiki:Gadget-WikiSign.js]]. It was requested for deletion by [[User:Sophivorus|a trusted user]] and I think it can be deleted. Once I delete it, I will notify you and you can remove the flag. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:24, 10 May 2026 (UTC)

:Can you enable two-factor authentication? 
:Policy: [[Wikiversity:Interface administrators]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:27, 10 May 2026 (UTC)
::Done @[[User:Jtneill|Jtneill]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:20, 11 May 2026 (UTC)
:::You are an interface administrator for 24 hours. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:57, 11 May 2026 (UTC)
::::Thx @[[User:Jtneill|Jtneill]], I have just deleted the page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:59, 11 May 2026 (UTC)

== Block request ==

Hi. Please block @[[User:Skibidi Titan 5.0|Skibidi Titan 5.0]]. Reason : Vandalism.

Thanks, [[User:Locpac|Locpac]] ([[User talk:Locpac|discuss]] • [[Special:Contributions/Locpac|contribs]]) 15:10, 10 May 2026 (UTC)

:Thankyou. Done. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 15:25, 10 May 2026 (UTC)


== ~2026-28496-53 ==

Please block [[Special:Contribs/~2026-28496-53]], vandalism. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:02, 11 May 2026 (UTC)

:{{done}} Thank you! —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 17:14, 11 May 2026 (UTC)

== ~2026-28792-52 ==

Please block [[Special:Contribs/~2026-28792-52]], vandalism. Appears to be same user as above. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:38, 12 May 2026 (UTC)
: Blocked locally by Barras. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 17:46, 12 May 2026 (UTC)</text>
      <sha1>mfijk2h6t80jprxa5sg7d69fu7comvo</sha1>
    </revision>
    <revision>
      <id>2809709</id>
      <parentid>2809707</parentid>
      <timestamp>2026-05-16T19:24:54Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Showing error to publish a Post */ archive to [[Wikiversity:Request custodian action/Archive/30#Showing error to publish a Post]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809709</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="19306" sha1="9dgfjna2wspmz8nfmla9br32s33dhbl" xml:space="preserve">{{/Header}}

== Abuse filters which should be deleted ==

Hi, there are some abuse filters which should probably be deleted.
* [[Special:AbuseFilter/1]] (not needed anymore)
* [[Special:AbuseFilter/2]] (no hits since 2018)
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched)
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives)
* [[Special:AbuseFilter/5]] (no hits since 2023)
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore)
* [[Special:AbuseFilter/17]] (no hits since 2022)
* [[Special:AbuseFilter/19]] (no hits since 2019)
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive)
Thanks. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 03:51, 5 April 2026 (UTC)

:Why do these need to be deleted rather than inactivated? Do inactive abuse filters cause a server strain? —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:39, 5 April 2026 (UTC)
:: Deleted filters do not cause strain to the servers. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:28, 5 April 2026 (UTC)
:These sounds like sensible suggestions but, yes, would inactivation perhaps make more sense than deletion for at least some  filters? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:35, 5 April 2026 (UTC)
:I would keep them @[[User:Codename Noreste|Codename Noreste]]. Alternatively, I would turn off the ones that haven't caught anything for a long time, but I would leave them enabled in case they need to be turned on or improved. If someone has already written the code and we don't have hundreds of free man-hours of programmers on Wikiversity, the server load seems secondary to me, and is negligible compared to other things. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:11, 6 April 2026 (UTC)
:: I know how to write abuse filter code and regex, but I would recommend disabling filters that have never caught anything in a long time ''and'' those who made lots of false positives. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:09, 6 April 2026 (UTC)
:::Of course @[[User:Codename Noreste|Codename Noreste]], there are people here today who are capable of changing the code. But the question is what it will be like in a few years, the question is what will happen if those two are busy for a long time, etc. That's why I would leave it so that those who don't know much about code can be inspired by it and will need to do something with it someday - plus, more code for different types of filtering is actually great educational material on how those filters work. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:41, 17 April 2026 (UTC)

Here's the updated list of abuse filters under review with actions I've taken (several disabled, one basic code improvement, and some actions changed) - none have been deleted so they can all be edited and reactivayed - please suggest any further changes:
* [[Special:AbuseFilter/1]] (not needed anymore) - One time account spam bot - 4 hits over 10 years ago - Disabled in 2024 - May be useful in future
* [[Special:AbuseFilter/2]] (no hits since 2018) - Userspace spamming - 778 hits; none since 2018 likely due to global filters - Now disabled
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched) - Specific user page spam - 1,101 hits most recent 7 March 2026 - Still active - Kept enabled
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives) - Questionable Language (profanity) - 6,055 hits including very recently - However it was logging hits without taking any actions - Edited to reduce likelihood of false positives by only applying filter to users with low (&lt; 20) edit count and applied weak actions to tag and warn but not prevent publishing the content
* [[Special:AbuseFilter/5]] (no hits since 2023) - Blocked Solicitation Links - 95 hits; none since 2023 - blocks specific historical spam sites - Non-active - Now disabled
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore) - Not reviewed - They are currently disabled
* [[Special:AbuseFilter/17]] (no hits since 2022) - Fundamental Physics Edits - 347 hits; none since 2022 - Non-active and very specific for a historical issue - Now disabled 
* [[Special:AbuseFilter/19]] (no hits since 2019) - Page Creation - 20 hits; none since 2019 - Retained for historical reference and possible future updates - Now disabled
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive) - Globally Banned Editor (renamed to Low-edit Spam Monitor) - 2,829 hits including very recent - Only applies to users with less than 5 edits and takes no actions / monitoring only - Reviewing the details of the hits I don't see many false positives and have strengthened its actions to add a tag and warning

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:57, 9 April 2026 (UTC)

== Block request ==

Please block ~2026-20985-80/~2026-21079-90/~2026-21223-88. Reason: Vandalism. [[User:Àncilu|Àncilu]] ([[User talk:Àncilu|discuss]] • [[Special:Contributions/Àncilu|contribs]]) 23:24, 5 April 2026 (UTC)

:All edits should be deleted and the first is blocked by Atcovi. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:33, 6 April 2026 (UTC)

== Antispam - Filter 12 ==
{{ping|Codename Noreste}} Thanks for contacting me with a suggested [[Special:AbuseFilter|abuse filter]] for the coupon spam we've been getting. A very much appreciated time saver. Per your suggestion, abuse filter 12 has been reactivated with your updated regex. It should tag and prevent page creation actions for coupon promo etc. Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:33, 15 April 2026 (UTC)
: @[[User:Jtneill|Jtneill]] Please do the following to filter 12:
:# Enable the block action (temporary for unregistered users, indefinite for registered users)
:# Disable both the disallow and tag actions, since that filter will be set to block
: Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:42, 5 May 2026 (UTC)
::Excellent. Done:
::* Block duration for non-registered users = 1 week
::* Block duration for registered users = indefinite
::* Disallow and tagging disabled
::Thankyou. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:24, 9 May 2026 (UTC)

== Urgent! error message This action has been automatically identified as potentially harmful, and therefore disallowed ==

While submitting the post this error was coming &quot;This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please inform an administrator of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link&quot; How to resolve it?

Here is the content:

{{note|marketing material removed}}

[[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:14, 17 April 2026 (UTC)
: That's because Wikiversity doesn't accept advertising. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 05:20, 17 April 2026 (UTC)
::So this is fine
::'''Online Internship and Digital Learning for Students'''
::Online learning has become an important part of modern education. With the help of the internet and digital tools, students can now study, practice, and gain experience without being physically present in a classroom. One key part of this system is the online internship, which helps students learn real-world skills along with their studies.
::An online internship allows students to work on tasks and projects through digital platforms. This makes learning more practical and useful, especially for those who want to understand how real work environments function.
::'''Background'''
::The concept of online learning developed from distance education, where students learned from remote locations. Over time, with the growth of digital technology, learning has become more interactive and flexible.
::The introduction of the online internship has added another important layer to digital education. It combines theoretical learning with practical experience, helping students prepare for future careers.
::During global events such as the COVID-19 pandemic, online education and online internship programs became essential. They helped students continue learning and gaining experience despite restrictions on physical movement.
::'''Importance of Online Internship'''
::An online internship plays an important role in student development. It helps bridge the gap between academic knowledge and practical skills.
::'''Some key points include:'''
::Students understand how real work is done
::They develop basic professional skills
::It supports career readiness
::It allows learning without location limits
::By participating in an online internship, students can improve their confidence and gain early exposure to different fields.
::'''Features of Online Internship-Based Learning'''
::Modern education platforms often include online internship opportunities as part of their learning system. These usually offer:
::Flexible schedules for students
::Access to learning from home
::Beginner-friendly tasks and projects
::A combination of theory and practice
::Such features make online internship programs suitable for a wide range of learners, including beginners.
::'''Learning Tasks'''
::Explore how online internship programs support student learning in digital environments.
::Identify how students can gain practical experience through an online internship
::Analyze the role of flexible learning in improving student engagement
::Understand how online education and internships work together
::'''References'''
::[https://ijpsl.in/wp-content/uploads/2020/09/E-Learning_Hanaaya-Navaneeth.pdf The Past, Present and Future of E-Learning: Hanaaya Varyani and Navaneeth M S]
::[https://ieeexplore.ieee.org/document/9788102 Current Trends and Future Perspectives of e-Learning in India]
::'''See Also'''
::[https://easyshiksha.com/online_courses/internship Online Internship]
::[https://easyshiksha.com/online_courses/ Online Courses]
::[https://easyshiksha.com/online_courses/kids-learning Kids Learning]
::[https://easyshiksha.com/career_helper/ Career Guidance] [[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:27, 17 April 2026 (UTC)
:::@[[User:EasyshikshaMarketing|EasyshikshaMarketing]] Wikiversity is a resource for education, or a space for education. However, your intention to link to another website is obvious, and such content does not belong here, as it contradicts the purpose of Wikiversity. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:38, 17 April 2026 (UTC)

==AI-generated images==
Seeking your advice.

Myself and students use some AI-generated images in the [[Motivation and emotion]] project.

[[User:Dronebogus]] has been removing some of these images from Wikiversity pages and nominating them for deletion at Commons. As a result, some have been deleted and some have been kept.

Dronebogus has made some useful edits and image suggestions for [[Motivation and emotion]] which I've appreciated and  incorporated. However, there are other edits to remove an AI image by Dronebogus that I've reverted where I think the image is more educational than no image or an alternative image suggested by Dronebogus.

There are a couple of pages where Dronebogus has reverted my reversion, so we are at risk of edit warring. We have briefly discussed and warned each other on our user talk pages, but it seems to come down to a difference in perception about the educational usefulness of the AI images.

So, I'm asking here for others to please review the recent edit histories for these pages:
* [[Motivation and emotion/Lectures/Brain and physiological needs]]
* [[Motivation and emotion/Book/2025/Stockholm syndrome emotion]]

and let us know what you think about the AI image suitability vs. using no image or alternative images suggested by Dronebogus.

Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:45, 26 April 2026 (UTC)

:I think Jtneill needs to try harder to find non-AI alternatives both on Commons and the web. I’m not reiterating the well known problems with generative AI— you can read about those on Wikipedia and the broader Internet. Needless to say it’s kind of just inherently toxic. If you use it, it should be the last resort of last resorts. Just my stance, which I consider perfectly valid and reasonable. [[User:Dronebogus|Dronebogus]] ([[User talk:Dronebogus|discuss]] • [[Special:Contributions/Dronebogus|contribs]]) 04:10, 27 April 2026 (UTC)

== Request for Page Creation Approval - Research on Dr. Ian Stevenson ==


'''Hello Administrators,'''

I am a digital archivist and researcher attempting to create an educational page regarding Dr. Ian Stevenson's scientific work, specifically titled &quot;Where Reincarnation and Biology Intersect&quot; and its official Vietnamese edition.

My edits are purely constructive, aimed at integrating local research context with global structured data (including '''Wikidata Q139548587'''). The automated filter is currently preventing publication due to &quot;new user external link limits.&quot;

I have ensured that all citations, references, and images (sourced from Wikimedia Commons) are strictly academic and non-promotional. Could you please review my contributions and consider whitelisting my account or approving this specific page creation?

Thank you for your assistance in preserving this research '''legacy''' within the open knowledge ecosystem.

'''Best regards,''' [[User:Ian Stevenson777|Ian Stevenson777]] ([[User talk:Ian Stevenson777|discuss]] • [[Special:Contributions/Ian Stevenson777|contribs]]) 07:26, 28 April 2026 (UTC)
: The page title should probably be in English, as this is English Wikiversity. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:19, 28 April 2026 (UTC)
:@[[User:Ian Stevenson777|Ian Stevenson777]] I looked at the text and it seems to me that it is informative, but the user cannot learn anything from it because they would have to buy the book. In this regard, it seems to me that it is enough [[:w:Where Reincarnation and Biology Intersect|to have that article on Wikipedia]] and there is no need to duplicate it here on Wikiversity. If you are particularly interested with its Vietnamese translation, I would focus on Vietnamese Wikipedia, but it seems to me, that the article there [https://vi.wikipedia.org/w/index.php?title=N%C6%A1i_lu%C3%A2n_h%E1%BB%93i_v%C3%A0_sinh_h%E1%BB%8Dc_giao_nhau&amp;oldid=75029095 have some problems at the moment]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:51, 5 May 2026 (UTC)
:This request is AI-generated and was made by a lock evading LTA. Please ignore it. [[User:NguoiDungKhongDinhDanh|NguoiDungKhongDinhDanh]] ([[User talk:NguoiDungKhongDinhDanh|discuss]] • [[Special:Contributions/NguoiDungKhongDinhDanh|contribs]]) 23:58, 13 May 2026 (UTC)

== Call for custodians and bureaucrats ==
&lt;div class=&quot;cd-moveMark&quot;&gt;''Moved to [[Wikiversity:Notices for custodians#Call for custodians and bureaucrats]].  [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 18:46, 12 May 2026 (UTC)''&lt;/div&gt;

== Interface administrator flag request ==

@[[User:Jtneill|Jtneill]], @[[User:Mu301|Mu301]] I am requesting IA flag to delete [[MediaWiki:Gadget-WikiSign.js]]. It was requested for deletion by [[User:Sophivorus|a trusted user]] and I think it can be deleted. Once I delete it, I will notify you and you can remove the flag. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:24, 10 May 2026 (UTC)

:Can you enable two-factor authentication? 
:Policy: [[Wikiversity:Interface administrators]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:27, 10 May 2026 (UTC)
::Done @[[User:Jtneill|Jtneill]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:20, 11 May 2026 (UTC)
:::You are an interface administrator for 24 hours. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:57, 11 May 2026 (UTC)
::::Thx @[[User:Jtneill|Jtneill]], I have just deleted the page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:59, 11 May 2026 (UTC)

== Block request ==

Hi. Please block @[[User:Skibidi Titan 5.0|Skibidi Titan 5.0]]. Reason : Vandalism.

Thanks, [[User:Locpac|Locpac]] ([[User talk:Locpac|discuss]] • [[Special:Contributions/Locpac|contribs]]) 15:10, 10 May 2026 (UTC)

:Thankyou. Done. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 15:25, 10 May 2026 (UTC)


== ~2026-28496-53 ==

Please block [[Special:Contribs/~2026-28496-53]], vandalism. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:02, 11 May 2026 (UTC)

:{{done}} Thank you! —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 17:14, 11 May 2026 (UTC)

== ~2026-28792-52 ==

Please block [[Special:Contribs/~2026-28792-52]], vandalism. Appears to be same user as above. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:38, 12 May 2026 (UTC)
: Blocked locally by Barras. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 17:46, 12 May 2026 (UTC)</text>
      <sha1>9dgfjna2wspmz8nfmla9br32s33dhbl</sha1>
    </revision>
    <revision>
      <id>2809711</id>
      <parentid>2809709</parentid>
      <timestamp>2026-05-16T19:25:01Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Abuse filters which should be deleted */ archive to [[Wikiversity:Request custodian action/Archive/30#Abuse filters which should be deleted]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809711</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="13666" sha1="jssyaiz3f28kei2k9vxkwtn57iksvuw" xml:space="preserve">{{/Header}}

== Block request ==

Please block ~2026-20985-80/~2026-21079-90/~2026-21223-88. Reason: Vandalism. [[User:Àncilu|Àncilu]] ([[User talk:Àncilu|discuss]] • [[Special:Contributions/Àncilu|contribs]]) 23:24, 5 April 2026 (UTC)

:All edits should be deleted and the first is blocked by Atcovi. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:33, 6 April 2026 (UTC)

== Antispam - Filter 12 ==
{{ping|Codename Noreste}} Thanks for contacting me with a suggested [[Special:AbuseFilter|abuse filter]] for the coupon spam we've been getting. A very much appreciated time saver. Per your suggestion, abuse filter 12 has been reactivated with your updated regex. It should tag and prevent page creation actions for coupon promo etc. Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:33, 15 April 2026 (UTC)
: @[[User:Jtneill|Jtneill]] Please do the following to filter 12:
:# Enable the block action (temporary for unregistered users, indefinite for registered users)
:# Disable both the disallow and tag actions, since that filter will be set to block
: Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:42, 5 May 2026 (UTC)
::Excellent. Done:
::* Block duration for non-registered users = 1 week
::* Block duration for registered users = indefinite
::* Disallow and tagging disabled
::Thankyou. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:24, 9 May 2026 (UTC)

== Urgent! error message This action has been automatically identified as potentially harmful, and therefore disallowed ==

While submitting the post this error was coming &quot;This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please inform an administrator of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link&quot; How to resolve it?

Here is the content:

{{note|marketing material removed}}

[[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:14, 17 April 2026 (UTC)
: That's because Wikiversity doesn't accept advertising. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 05:20, 17 April 2026 (UTC)
::So this is fine
::'''Online Internship and Digital Learning for Students'''
::Online learning has become an important part of modern education. With the help of the internet and digital tools, students can now study, practice, and gain experience without being physically present in a classroom. One key part of this system is the online internship, which helps students learn real-world skills along with their studies.
::An online internship allows students to work on tasks and projects through digital platforms. This makes learning more practical and useful, especially for those who want to understand how real work environments function.
::'''Background'''
::The concept of online learning developed from distance education, where students learned from remote locations. Over time, with the growth of digital technology, learning has become more interactive and flexible.
::The introduction of the online internship has added another important layer to digital education. It combines theoretical learning with practical experience, helping students prepare for future careers.
::During global events such as the COVID-19 pandemic, online education and online internship programs became essential. They helped students continue learning and gaining experience despite restrictions on physical movement.
::'''Importance of Online Internship'''
::An online internship plays an important role in student development. It helps bridge the gap between academic knowledge and practical skills.
::'''Some key points include:'''
::Students understand how real work is done
::They develop basic professional skills
::It supports career readiness
::It allows learning without location limits
::By participating in an online internship, students can improve their confidence and gain early exposure to different fields.
::'''Features of Online Internship-Based Learning'''
::Modern education platforms often include online internship opportunities as part of their learning system. These usually offer:
::Flexible schedules for students
::Access to learning from home
::Beginner-friendly tasks and projects
::A combination of theory and practice
::Such features make online internship programs suitable for a wide range of learners, including beginners.
::'''Learning Tasks'''
::Explore how online internship programs support student learning in digital environments.
::Identify how students can gain practical experience through an online internship
::Analyze the role of flexible learning in improving student engagement
::Understand how online education and internships work together
::'''References'''
::[https://ijpsl.in/wp-content/uploads/2020/09/E-Learning_Hanaaya-Navaneeth.pdf The Past, Present and Future of E-Learning: Hanaaya Varyani and Navaneeth M S]
::[https://ieeexplore.ieee.org/document/9788102 Current Trends and Future Perspectives of e-Learning in India]
::'''See Also'''
::[https://easyshiksha.com/online_courses/internship Online Internship]
::[https://easyshiksha.com/online_courses/ Online Courses]
::[https://easyshiksha.com/online_courses/kids-learning Kids Learning]
::[https://easyshiksha.com/career_helper/ Career Guidance] [[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:27, 17 April 2026 (UTC)
:::@[[User:EasyshikshaMarketing|EasyshikshaMarketing]] Wikiversity is a resource for education, or a space for education. However, your intention to link to another website is obvious, and such content does not belong here, as it contradicts the purpose of Wikiversity. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:38, 17 April 2026 (UTC)

==AI-generated images==
Seeking your advice.

Myself and students use some AI-generated images in the [[Motivation and emotion]] project.

[[User:Dronebogus]] has been removing some of these images from Wikiversity pages and nominating them for deletion at Commons. As a result, some have been deleted and some have been kept.

Dronebogus has made some useful edits and image suggestions for [[Motivation and emotion]] which I've appreciated and  incorporated. However, there are other edits to remove an AI image by Dronebogus that I've reverted where I think the image is more educational than no image or an alternative image suggested by Dronebogus.

There are a couple of pages where Dronebogus has reverted my reversion, so we are at risk of edit warring. We have briefly discussed and warned each other on our user talk pages, but it seems to come down to a difference in perception about the educational usefulness of the AI images.

So, I'm asking here for others to please review the recent edit histories for these pages:
* [[Motivation and emotion/Lectures/Brain and physiological needs]]
* [[Motivation and emotion/Book/2025/Stockholm syndrome emotion]]

and let us know what you think about the AI image suitability vs. using no image or alternative images suggested by Dronebogus.

Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:45, 26 April 2026 (UTC)

:I think Jtneill needs to try harder to find non-AI alternatives both on Commons and the web. I’m not reiterating the well known problems with generative AI— you can read about those on Wikipedia and the broader Internet. Needless to say it’s kind of just inherently toxic. If you use it, it should be the last resort of last resorts. Just my stance, which I consider perfectly valid and reasonable. [[User:Dronebogus|Dronebogus]] ([[User talk:Dronebogus|discuss]] • [[Special:Contributions/Dronebogus|contribs]]) 04:10, 27 April 2026 (UTC)

== Request for Page Creation Approval - Research on Dr. Ian Stevenson ==


'''Hello Administrators,'''

I am a digital archivist and researcher attempting to create an educational page regarding Dr. Ian Stevenson's scientific work, specifically titled &quot;Where Reincarnation and Biology Intersect&quot; and its official Vietnamese edition.

My edits are purely constructive, aimed at integrating local research context with global structured data (including '''Wikidata Q139548587'''). The automated filter is currently preventing publication due to &quot;new user external link limits.&quot;

I have ensured that all citations, references, and images (sourced from Wikimedia Commons) are strictly academic and non-promotional. Could you please review my contributions and consider whitelisting my account or approving this specific page creation?

Thank you for your assistance in preserving this research '''legacy''' within the open knowledge ecosystem.

'''Best regards,''' [[User:Ian Stevenson777|Ian Stevenson777]] ([[User talk:Ian Stevenson777|discuss]] • [[Special:Contributions/Ian Stevenson777|contribs]]) 07:26, 28 April 2026 (UTC)
: The page title should probably be in English, as this is English Wikiversity. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:19, 28 April 2026 (UTC)
:@[[User:Ian Stevenson777|Ian Stevenson777]] I looked at the text and it seems to me that it is informative, but the user cannot learn anything from it because they would have to buy the book. In this regard, it seems to me that it is enough [[:w:Where Reincarnation and Biology Intersect|to have that article on Wikipedia]] and there is no need to duplicate it here on Wikiversity. If you are particularly interested with its Vietnamese translation, I would focus on Vietnamese Wikipedia, but it seems to me, that the article there [https://vi.wikipedia.org/w/index.php?title=N%C6%A1i_lu%C3%A2n_h%E1%BB%93i_v%C3%A0_sinh_h%E1%BB%8Dc_giao_nhau&amp;oldid=75029095 have some problems at the moment]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:51, 5 May 2026 (UTC)
:This request is AI-generated and was made by a lock evading LTA. Please ignore it. [[User:NguoiDungKhongDinhDanh|NguoiDungKhongDinhDanh]] ([[User talk:NguoiDungKhongDinhDanh|discuss]] • [[Special:Contributions/NguoiDungKhongDinhDanh|contribs]]) 23:58, 13 May 2026 (UTC)

== Call for custodians and bureaucrats ==
&lt;div class=&quot;cd-moveMark&quot;&gt;''Moved to [[Wikiversity:Notices for custodians#Call for custodians and bureaucrats]].  [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 18:46, 12 May 2026 (UTC)''&lt;/div&gt;

== Interface administrator flag request ==

@[[User:Jtneill|Jtneill]], @[[User:Mu301|Mu301]] I am requesting IA flag to delete [[MediaWiki:Gadget-WikiSign.js]]. It was requested for deletion by [[User:Sophivorus|a trusted user]] and I think it can be deleted. Once I delete it, I will notify you and you can remove the flag. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:24, 10 May 2026 (UTC)

:Can you enable two-factor authentication? 
:Policy: [[Wikiversity:Interface administrators]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:27, 10 May 2026 (UTC)
::Done @[[User:Jtneill|Jtneill]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:20, 11 May 2026 (UTC)
:::You are an interface administrator for 24 hours. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:57, 11 May 2026 (UTC)
::::Thx @[[User:Jtneill|Jtneill]], I have just deleted the page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:59, 11 May 2026 (UTC)

== Block request ==

Hi. Please block @[[User:Skibidi Titan 5.0|Skibidi Titan 5.0]]. Reason : Vandalism.

Thanks, [[User:Locpac|Locpac]] ([[User talk:Locpac|discuss]] • [[Special:Contributions/Locpac|contribs]]) 15:10, 10 May 2026 (UTC)

:Thankyou. Done. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 15:25, 10 May 2026 (UTC)


== ~2026-28496-53 ==

Please block [[Special:Contribs/~2026-28496-53]], vandalism. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:02, 11 May 2026 (UTC)

:{{done}} Thank you! —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 17:14, 11 May 2026 (UTC)

== ~2026-28792-52 ==

Please block [[Special:Contribs/~2026-28792-52]], vandalism. Appears to be same user as above. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:38, 12 May 2026 (UTC)
: Blocked locally by Barras. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 17:46, 12 May 2026 (UTC)</text>
      <sha1>jssyaiz3f28kei2k9vxkwtn57iksvuw</sha1>
    </revision>
    <revision>
      <id>2809714</id>
      <parentid>2809711</parentid>
      <timestamp>2026-05-16T19:25:09Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Block request */ archive to [[Wikiversity:Request custodian action/Archive/30#Block request]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809714</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="13232" sha1="1dxxbk04u8ywsl63vwmnp55hr3at9gx" xml:space="preserve">{{/Header}}

== Antispam - Filter 12 ==
{{ping|Codename Noreste}} Thanks for contacting me with a suggested [[Special:AbuseFilter|abuse filter]] for the coupon spam we've been getting. A very much appreciated time saver. Per your suggestion, abuse filter 12 has been reactivated with your updated regex. It should tag and prevent page creation actions for coupon promo etc. Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:33, 15 April 2026 (UTC)
: @[[User:Jtneill|Jtneill]] Please do the following to filter 12:
:# Enable the block action (temporary for unregistered users, indefinite for registered users)
:# Disable both the disallow and tag actions, since that filter will be set to block
: Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:42, 5 May 2026 (UTC)
::Excellent. Done:
::* Block duration for non-registered users = 1 week
::* Block duration for registered users = indefinite
::* Disallow and tagging disabled
::Thankyou. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:24, 9 May 2026 (UTC)

== Urgent! error message This action has been automatically identified as potentially harmful, and therefore disallowed ==

While submitting the post this error was coming &quot;This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please inform an administrator of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link&quot; How to resolve it?

Here is the content:

{{note|marketing material removed}}

[[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:14, 17 April 2026 (UTC)
: That's because Wikiversity doesn't accept advertising. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 05:20, 17 April 2026 (UTC)
::So this is fine
::'''Online Internship and Digital Learning for Students'''
::Online learning has become an important part of modern education. With the help of the internet and digital tools, students can now study, practice, and gain experience without being physically present in a classroom. One key part of this system is the online internship, which helps students learn real-world skills along with their studies.
::An online internship allows students to work on tasks and projects through digital platforms. This makes learning more practical and useful, especially for those who want to understand how real work environments function.
::'''Background'''
::The concept of online learning developed from distance education, where students learned from remote locations. Over time, with the growth of digital technology, learning has become more interactive and flexible.
::The introduction of the online internship has added another important layer to digital education. It combines theoretical learning with practical experience, helping students prepare for future careers.
::During global events such as the COVID-19 pandemic, online education and online internship programs became essential. They helped students continue learning and gaining experience despite restrictions on physical movement.
::'''Importance of Online Internship'''
::An online internship plays an important role in student development. It helps bridge the gap between academic knowledge and practical skills.
::'''Some key points include:'''
::Students understand how real work is done
::They develop basic professional skills
::It supports career readiness
::It allows learning without location limits
::By participating in an online internship, students can improve their confidence and gain early exposure to different fields.
::'''Features of Online Internship-Based Learning'''
::Modern education platforms often include online internship opportunities as part of their learning system. These usually offer:
::Flexible schedules for students
::Access to learning from home
::Beginner-friendly tasks and projects
::A combination of theory and practice
::Such features make online internship programs suitable for a wide range of learners, including beginners.
::'''Learning Tasks'''
::Explore how online internship programs support student learning in digital environments.
::Identify how students can gain practical experience through an online internship
::Analyze the role of flexible learning in improving student engagement
::Understand how online education and internships work together
::'''References'''
::[https://ijpsl.in/wp-content/uploads/2020/09/E-Learning_Hanaaya-Navaneeth.pdf The Past, Present and Future of E-Learning: Hanaaya Varyani and Navaneeth M S]
::[https://ieeexplore.ieee.org/document/9788102 Current Trends and Future Perspectives of e-Learning in India]
::'''See Also'''
::[https://easyshiksha.com/online_courses/internship Online Internship]
::[https://easyshiksha.com/online_courses/ Online Courses]
::[https://easyshiksha.com/online_courses/kids-learning Kids Learning]
::[https://easyshiksha.com/career_helper/ Career Guidance] [[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:27, 17 April 2026 (UTC)
:::@[[User:EasyshikshaMarketing|EasyshikshaMarketing]] Wikiversity is a resource for education, or a space for education. However, your intention to link to another website is obvious, and such content does not belong here, as it contradicts the purpose of Wikiversity. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:38, 17 April 2026 (UTC)

==AI-generated images==
Seeking your advice.

Myself and students use some AI-generated images in the [[Motivation and emotion]] project.

[[User:Dronebogus]] has been removing some of these images from Wikiversity pages and nominating them for deletion at Commons. As a result, some have been deleted and some have been kept.

Dronebogus has made some useful edits and image suggestions for [[Motivation and emotion]] which I've appreciated and  incorporated. However, there are other edits to remove an AI image by Dronebogus that I've reverted where I think the image is more educational than no image or an alternative image suggested by Dronebogus.

There are a couple of pages where Dronebogus has reverted my reversion, so we are at risk of edit warring. We have briefly discussed and warned each other on our user talk pages, but it seems to come down to a difference in perception about the educational usefulness of the AI images.

So, I'm asking here for others to please review the recent edit histories for these pages:
* [[Motivation and emotion/Lectures/Brain and physiological needs]]
* [[Motivation and emotion/Book/2025/Stockholm syndrome emotion]]

and let us know what you think about the AI image suitability vs. using no image or alternative images suggested by Dronebogus.

Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:45, 26 April 2026 (UTC)

:I think Jtneill needs to try harder to find non-AI alternatives both on Commons and the web. I’m not reiterating the well known problems with generative AI— you can read about those on Wikipedia and the broader Internet. Needless to say it’s kind of just inherently toxic. If you use it, it should be the last resort of last resorts. Just my stance, which I consider perfectly valid and reasonable. [[User:Dronebogus|Dronebogus]] ([[User talk:Dronebogus|discuss]] • [[Special:Contributions/Dronebogus|contribs]]) 04:10, 27 April 2026 (UTC)

== Request for Page Creation Approval - Research on Dr. Ian Stevenson ==


'''Hello Administrators,'''

I am a digital archivist and researcher attempting to create an educational page regarding Dr. Ian Stevenson's scientific work, specifically titled &quot;Where Reincarnation and Biology Intersect&quot; and its official Vietnamese edition.

My edits are purely constructive, aimed at integrating local research context with global structured data (including '''Wikidata Q139548587'''). The automated filter is currently preventing publication due to &quot;new user external link limits.&quot;

I have ensured that all citations, references, and images (sourced from Wikimedia Commons) are strictly academic and non-promotional. Could you please review my contributions and consider whitelisting my account or approving this specific page creation?

Thank you for your assistance in preserving this research '''legacy''' within the open knowledge ecosystem.

'''Best regards,''' [[User:Ian Stevenson777|Ian Stevenson777]] ([[User talk:Ian Stevenson777|discuss]] • [[Special:Contributions/Ian Stevenson777|contribs]]) 07:26, 28 April 2026 (UTC)
: The page title should probably be in English, as this is English Wikiversity. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:19, 28 April 2026 (UTC)
:@[[User:Ian Stevenson777|Ian Stevenson777]] I looked at the text and it seems to me that it is informative, but the user cannot learn anything from it because they would have to buy the book. In this regard, it seems to me that it is enough [[:w:Where Reincarnation and Biology Intersect|to have that article on Wikipedia]] and there is no need to duplicate it here on Wikiversity. If you are particularly interested with its Vietnamese translation, I would focus on Vietnamese Wikipedia, but it seems to me, that the article there [https://vi.wikipedia.org/w/index.php?title=N%C6%A1i_lu%C3%A2n_h%E1%BB%93i_v%C3%A0_sinh_h%E1%BB%8Dc_giao_nhau&amp;oldid=75029095 have some problems at the moment]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:51, 5 May 2026 (UTC)
:This request is AI-generated and was made by a lock evading LTA. Please ignore it. [[User:NguoiDungKhongDinhDanh|NguoiDungKhongDinhDanh]] ([[User talk:NguoiDungKhongDinhDanh|discuss]] • [[Special:Contributions/NguoiDungKhongDinhDanh|contribs]]) 23:58, 13 May 2026 (UTC)

== Call for custodians and bureaucrats ==
&lt;div class=&quot;cd-moveMark&quot;&gt;''Moved to [[Wikiversity:Notices for custodians#Call for custodians and bureaucrats]].  [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 18:46, 12 May 2026 (UTC)''&lt;/div&gt;

== Interface administrator flag request ==

@[[User:Jtneill|Jtneill]], @[[User:Mu301|Mu301]] I am requesting IA flag to delete [[MediaWiki:Gadget-WikiSign.js]]. It was requested for deletion by [[User:Sophivorus|a trusted user]] and I think it can be deleted. Once I delete it, I will notify you and you can remove the flag. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:24, 10 May 2026 (UTC)

:Can you enable two-factor authentication? 
:Policy: [[Wikiversity:Interface administrators]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:27, 10 May 2026 (UTC)
::Done @[[User:Jtneill|Jtneill]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:20, 11 May 2026 (UTC)
:::You are an interface administrator for 24 hours. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:57, 11 May 2026 (UTC)
::::Thx @[[User:Jtneill|Jtneill]], I have just deleted the page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:59, 11 May 2026 (UTC)

== Block request ==

Hi. Please block @[[User:Skibidi Titan 5.0|Skibidi Titan 5.0]]. Reason : Vandalism.

Thanks, [[User:Locpac|Locpac]] ([[User talk:Locpac|discuss]] • [[Special:Contributions/Locpac|contribs]]) 15:10, 10 May 2026 (UTC)

:Thankyou. Done. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 15:25, 10 May 2026 (UTC)


== ~2026-28496-53 ==

Please block [[Special:Contribs/~2026-28496-53]], vandalism. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:02, 11 May 2026 (UTC)

:{{done}} Thank you! —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 17:14, 11 May 2026 (UTC)

== ~2026-28792-52 ==

Please block [[Special:Contribs/~2026-28792-52]], vandalism. Appears to be same user as above. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:38, 12 May 2026 (UTC)
: Blocked locally by Barras. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 17:46, 12 May 2026 (UTC)</text>
      <sha1>1dxxbk04u8ywsl63vwmnp55hr3at9gx</sha1>
    </revision>
    <revision>
      <id>2809716</id>
      <parentid>2809714</parentid>
      <timestamp>2026-05-16T19:25:16Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Antispam - Filter 12 */ archive to [[Wikiversity:Request custodian action/Archive/30#Antispam - Filter 12]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809716</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="11988" sha1="79fcdy25fal5vzqedt4x36k30j1n68m" xml:space="preserve">{{/Header}}

== Urgent! error message This action has been automatically identified as potentially harmful, and therefore disallowed ==

While submitting the post this error was coming &quot;This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please inform an administrator of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link&quot; How to resolve it?

Here is the content:

{{note|marketing material removed}}

[[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:14, 17 April 2026 (UTC)
: That's because Wikiversity doesn't accept advertising. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 05:20, 17 April 2026 (UTC)
::So this is fine
::'''Online Internship and Digital Learning for Students'''
::Online learning has become an important part of modern education. With the help of the internet and digital tools, students can now study, practice, and gain experience without being physically present in a classroom. One key part of this system is the online internship, which helps students learn real-world skills along with their studies.
::An online internship allows students to work on tasks and projects through digital platforms. This makes learning more practical and useful, especially for those who want to understand how real work environments function.
::'''Background'''
::The concept of online learning developed from distance education, where students learned from remote locations. Over time, with the growth of digital technology, learning has become more interactive and flexible.
::The introduction of the online internship has added another important layer to digital education. It combines theoretical learning with practical experience, helping students prepare for future careers.
::During global events such as the COVID-19 pandemic, online education and online internship programs became essential. They helped students continue learning and gaining experience despite restrictions on physical movement.
::'''Importance of Online Internship'''
::An online internship plays an important role in student development. It helps bridge the gap between academic knowledge and practical skills.
::'''Some key points include:'''
::Students understand how real work is done
::They develop basic professional skills
::It supports career readiness
::It allows learning without location limits
::By participating in an online internship, students can improve their confidence and gain early exposure to different fields.
::'''Features of Online Internship-Based Learning'''
::Modern education platforms often include online internship opportunities as part of their learning system. These usually offer:
::Flexible schedules for students
::Access to learning from home
::Beginner-friendly tasks and projects
::A combination of theory and practice
::Such features make online internship programs suitable for a wide range of learners, including beginners.
::'''Learning Tasks'''
::Explore how online internship programs support student learning in digital environments.
::Identify how students can gain practical experience through an online internship
::Analyze the role of flexible learning in improving student engagement
::Understand how online education and internships work together
::'''References'''
::[https://ijpsl.in/wp-content/uploads/2020/09/E-Learning_Hanaaya-Navaneeth.pdf The Past, Present and Future of E-Learning: Hanaaya Varyani and Navaneeth M S]
::[https://ieeexplore.ieee.org/document/9788102 Current Trends and Future Perspectives of e-Learning in India]
::'''See Also'''
::[https://easyshiksha.com/online_courses/internship Online Internship]
::[https://easyshiksha.com/online_courses/ Online Courses]
::[https://easyshiksha.com/online_courses/kids-learning Kids Learning]
::[https://easyshiksha.com/career_helper/ Career Guidance] [[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:27, 17 April 2026 (UTC)
:::@[[User:EasyshikshaMarketing|EasyshikshaMarketing]] Wikiversity is a resource for education, or a space for education. However, your intention to link to another website is obvious, and such content does not belong here, as it contradicts the purpose of Wikiversity. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:38, 17 April 2026 (UTC)

==AI-generated images==
Seeking your advice.

Myself and students use some AI-generated images in the [[Motivation and emotion]] project.

[[User:Dronebogus]] has been removing some of these images from Wikiversity pages and nominating them for deletion at Commons. As a result, some have been deleted and some have been kept.

Dronebogus has made some useful edits and image suggestions for [[Motivation and emotion]] which I've appreciated and  incorporated. However, there are other edits to remove an AI image by Dronebogus that I've reverted where I think the image is more educational than no image or an alternative image suggested by Dronebogus.

There are a couple of pages where Dronebogus has reverted my reversion, so we are at risk of edit warring. We have briefly discussed and warned each other on our user talk pages, but it seems to come down to a difference in perception about the educational usefulness of the AI images.

So, I'm asking here for others to please review the recent edit histories for these pages:
* [[Motivation and emotion/Lectures/Brain and physiological needs]]
* [[Motivation and emotion/Book/2025/Stockholm syndrome emotion]]

and let us know what you think about the AI image suitability vs. using no image or alternative images suggested by Dronebogus.

Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:45, 26 April 2026 (UTC)

:I think Jtneill needs to try harder to find non-AI alternatives both on Commons and the web. I’m not reiterating the well known problems with generative AI— you can read about those on Wikipedia and the broader Internet. Needless to say it’s kind of just inherently toxic. If you use it, it should be the last resort of last resorts. Just my stance, which I consider perfectly valid and reasonable. [[User:Dronebogus|Dronebogus]] ([[User talk:Dronebogus|discuss]] • [[Special:Contributions/Dronebogus|contribs]]) 04:10, 27 April 2026 (UTC)

== Request for Page Creation Approval - Research on Dr. Ian Stevenson ==


'''Hello Administrators,'''

I am a digital archivist and researcher attempting to create an educational page regarding Dr. Ian Stevenson's scientific work, specifically titled &quot;Where Reincarnation and Biology Intersect&quot; and its official Vietnamese edition.

My edits are purely constructive, aimed at integrating local research context with global structured data (including '''Wikidata Q139548587'''). The automated filter is currently preventing publication due to &quot;new user external link limits.&quot;

I have ensured that all citations, references, and images (sourced from Wikimedia Commons) are strictly academic and non-promotional. Could you please review my contributions and consider whitelisting my account or approving this specific page creation?

Thank you for your assistance in preserving this research '''legacy''' within the open knowledge ecosystem.

'''Best regards,''' [[User:Ian Stevenson777|Ian Stevenson777]] ([[User talk:Ian Stevenson777|discuss]] • [[Special:Contributions/Ian Stevenson777|contribs]]) 07:26, 28 April 2026 (UTC)
: The page title should probably be in English, as this is English Wikiversity. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:19, 28 April 2026 (UTC)
:@[[User:Ian Stevenson777|Ian Stevenson777]] I looked at the text and it seems to me that it is informative, but the user cannot learn anything from it because they would have to buy the book. In this regard, it seems to me that it is enough [[:w:Where Reincarnation and Biology Intersect|to have that article on Wikipedia]] and there is no need to duplicate it here on Wikiversity. If you are particularly interested with its Vietnamese translation, I would focus on Vietnamese Wikipedia, but it seems to me, that the article there [https://vi.wikipedia.org/w/index.php?title=N%C6%A1i_lu%C3%A2n_h%E1%BB%93i_v%C3%A0_sinh_h%E1%BB%8Dc_giao_nhau&amp;oldid=75029095 have some problems at the moment]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:51, 5 May 2026 (UTC)
:This request is AI-generated and was made by a lock evading LTA. Please ignore it. [[User:NguoiDungKhongDinhDanh|NguoiDungKhongDinhDanh]] ([[User talk:NguoiDungKhongDinhDanh|discuss]] • [[Special:Contributions/NguoiDungKhongDinhDanh|contribs]]) 23:58, 13 May 2026 (UTC)

== Call for custodians and bureaucrats ==
&lt;div class=&quot;cd-moveMark&quot;&gt;''Moved to [[Wikiversity:Notices for custodians#Call for custodians and bureaucrats]].  [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 18:46, 12 May 2026 (UTC)''&lt;/div&gt;

== Interface administrator flag request ==

@[[User:Jtneill|Jtneill]], @[[User:Mu301|Mu301]] I am requesting IA flag to delete [[MediaWiki:Gadget-WikiSign.js]]. It was requested for deletion by [[User:Sophivorus|a trusted user]] and I think it can be deleted. Once I delete it, I will notify you and you can remove the flag. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:24, 10 May 2026 (UTC)

:Can you enable two-factor authentication? 
:Policy: [[Wikiversity:Interface administrators]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:27, 10 May 2026 (UTC)
::Done @[[User:Jtneill|Jtneill]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:20, 11 May 2026 (UTC)
:::You are an interface administrator for 24 hours. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:57, 11 May 2026 (UTC)
::::Thx @[[User:Jtneill|Jtneill]], I have just deleted the page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:59, 11 May 2026 (UTC)

== Block request ==

Hi. Please block @[[User:Skibidi Titan 5.0|Skibidi Titan 5.0]]. Reason : Vandalism.

Thanks, [[User:Locpac|Locpac]] ([[User talk:Locpac|discuss]] • [[Special:Contributions/Locpac|contribs]]) 15:10, 10 May 2026 (UTC)

:Thankyou. Done. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 15:25, 10 May 2026 (UTC)


== ~2026-28496-53 ==

Please block [[Special:Contribs/~2026-28496-53]], vandalism. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:02, 11 May 2026 (UTC)

:{{done}} Thank you! —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 17:14, 11 May 2026 (UTC)

== ~2026-28792-52 ==

Please block [[Special:Contribs/~2026-28792-52]], vandalism. Appears to be same user as above. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:38, 12 May 2026 (UTC)
: Blocked locally by Barras. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 17:46, 12 May 2026 (UTC)</text>
      <sha1>79fcdy25fal5vzqedt4x36k30j1n68m</sha1>
    </revision>
    <revision>
      <id>2809718</id>
      <parentid>2809716</parentid>
      <timestamp>2026-05-16T19:25:26Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Urgent! error message This action has been automatically identified as potentially harmful, and therefore disallowed */ archive to [[Wikiversity:Request custodian action/Archive/30#Urgent! error message This action has been automatically identified as potentially harmful, and therefore disallowed]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809718</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="7311" sha1="bs3evdku0e54ned5cq7faev0w7bvrka" xml:space="preserve">{{/Header}}

==AI-generated images==
Seeking your advice.

Myself and students use some AI-generated images in the [[Motivation and emotion]] project.

[[User:Dronebogus]] has been removing some of these images from Wikiversity pages and nominating them for deletion at Commons. As a result, some have been deleted and some have been kept.

Dronebogus has made some useful edits and image suggestions for [[Motivation and emotion]] which I've appreciated and  incorporated. However, there are other edits to remove an AI image by Dronebogus that I've reverted where I think the image is more educational than no image or an alternative image suggested by Dronebogus.

There are a couple of pages where Dronebogus has reverted my reversion, so we are at risk of edit warring. We have briefly discussed and warned each other on our user talk pages, but it seems to come down to a difference in perception about the educational usefulness of the AI images.

So, I'm asking here for others to please review the recent edit histories for these pages:
* [[Motivation and emotion/Lectures/Brain and physiological needs]]
* [[Motivation and emotion/Book/2025/Stockholm syndrome emotion]]

and let us know what you think about the AI image suitability vs. using no image or alternative images suggested by Dronebogus.

Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:45, 26 April 2026 (UTC)

:I think Jtneill needs to try harder to find non-AI alternatives both on Commons and the web. I’m not reiterating the well known problems with generative AI— you can read about those on Wikipedia and the broader Internet. Needless to say it’s kind of just inherently toxic. If you use it, it should be the last resort of last resorts. Just my stance, which I consider perfectly valid and reasonable. [[User:Dronebogus|Dronebogus]] ([[User talk:Dronebogus|discuss]] • [[Special:Contributions/Dronebogus|contribs]]) 04:10, 27 April 2026 (UTC)

== Request for Page Creation Approval - Research on Dr. Ian Stevenson ==


'''Hello Administrators,'''

I am a digital archivist and researcher attempting to create an educational page regarding Dr. Ian Stevenson's scientific work, specifically titled &quot;Where Reincarnation and Biology Intersect&quot; and its official Vietnamese edition.

My edits are purely constructive, aimed at integrating local research context with global structured data (including '''Wikidata Q139548587'''). The automated filter is currently preventing publication due to &quot;new user external link limits.&quot;

I have ensured that all citations, references, and images (sourced from Wikimedia Commons) are strictly academic and non-promotional. Could you please review my contributions and consider whitelisting my account or approving this specific page creation?

Thank you for your assistance in preserving this research '''legacy''' within the open knowledge ecosystem.

'''Best regards,''' [[User:Ian Stevenson777|Ian Stevenson777]] ([[User talk:Ian Stevenson777|discuss]] • [[Special:Contributions/Ian Stevenson777|contribs]]) 07:26, 28 April 2026 (UTC)
: The page title should probably be in English, as this is English Wikiversity. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:19, 28 April 2026 (UTC)
:@[[User:Ian Stevenson777|Ian Stevenson777]] I looked at the text and it seems to me that it is informative, but the user cannot learn anything from it because they would have to buy the book. In this regard, it seems to me that it is enough [[:w:Where Reincarnation and Biology Intersect|to have that article on Wikipedia]] and there is no need to duplicate it here on Wikiversity. If you are particularly interested with its Vietnamese translation, I would focus on Vietnamese Wikipedia, but it seems to me, that the article there [https://vi.wikipedia.org/w/index.php?title=N%C6%A1i_lu%C3%A2n_h%E1%BB%93i_v%C3%A0_sinh_h%E1%BB%8Dc_giao_nhau&amp;oldid=75029095 have some problems at the moment]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:51, 5 May 2026 (UTC)
:This request is AI-generated and was made by a lock evading LTA. Please ignore it. [[User:NguoiDungKhongDinhDanh|NguoiDungKhongDinhDanh]] ([[User talk:NguoiDungKhongDinhDanh|discuss]] • [[Special:Contributions/NguoiDungKhongDinhDanh|contribs]]) 23:58, 13 May 2026 (UTC)

== Call for custodians and bureaucrats ==
&lt;div class=&quot;cd-moveMark&quot;&gt;''Moved to [[Wikiversity:Notices for custodians#Call for custodians and bureaucrats]].  [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 18:46, 12 May 2026 (UTC)''&lt;/div&gt;

== Interface administrator flag request ==

@[[User:Jtneill|Jtneill]], @[[User:Mu301|Mu301]] I am requesting IA flag to delete [[MediaWiki:Gadget-WikiSign.js]]. It was requested for deletion by [[User:Sophivorus|a trusted user]] and I think it can be deleted. Once I delete it, I will notify you and you can remove the flag. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:24, 10 May 2026 (UTC)

:Can you enable two-factor authentication? 
:Policy: [[Wikiversity:Interface administrators]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:27, 10 May 2026 (UTC)
::Done @[[User:Jtneill|Jtneill]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:20, 11 May 2026 (UTC)
:::You are an interface administrator for 24 hours. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:57, 11 May 2026 (UTC)
::::Thx @[[User:Jtneill|Jtneill]], I have just deleted the page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:59, 11 May 2026 (UTC)

== Block request ==

Hi. Please block @[[User:Skibidi Titan 5.0|Skibidi Titan 5.0]]. Reason : Vandalism.

Thanks, [[User:Locpac|Locpac]] ([[User talk:Locpac|discuss]] • [[Special:Contributions/Locpac|contribs]]) 15:10, 10 May 2026 (UTC)

:Thankyou. Done. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 15:25, 10 May 2026 (UTC)


== ~2026-28496-53 ==

Please block [[Special:Contribs/~2026-28496-53]], vandalism. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:02, 11 May 2026 (UTC)

:{{done}} Thank you! —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 17:14, 11 May 2026 (UTC)

== ~2026-28792-52 ==

Please block [[Special:Contribs/~2026-28792-52]], vandalism. Appears to be same user as above. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:38, 12 May 2026 (UTC)
: Blocked locally by Barras. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 17:46, 12 May 2026 (UTC)</text>
      <sha1>bs3evdku0e54ned5cq7faev0w7bvrka</sha1>
    </revision>
    <revision>
      <id>2809720</id>
      <parentid>2809718</parentid>
      <timestamp>2026-05-16T19:25:51Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* AI-generated images */ archive to [[Wikiversity:Request custodian action/Archive/30#AI-generated images]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809720</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="5309" sha1="r8214byczd30kqa8p9zhyzyqrxvzvxk" xml:space="preserve">{{/Header}}

== Request for Page Creation Approval - Research on Dr. Ian Stevenson ==


'''Hello Administrators,'''

I am a digital archivist and researcher attempting to create an educational page regarding Dr. Ian Stevenson's scientific work, specifically titled &quot;Where Reincarnation and Biology Intersect&quot; and its official Vietnamese edition.

My edits are purely constructive, aimed at integrating local research context with global structured data (including '''Wikidata Q139548587'''). The automated filter is currently preventing publication due to &quot;new user external link limits.&quot;

I have ensured that all citations, references, and images (sourced from Wikimedia Commons) are strictly academic and non-promotional. Could you please review my contributions and consider whitelisting my account or approving this specific page creation?

Thank you for your assistance in preserving this research '''legacy''' within the open knowledge ecosystem.

'''Best regards,''' [[User:Ian Stevenson777|Ian Stevenson777]] ([[User talk:Ian Stevenson777|discuss]] • [[Special:Contributions/Ian Stevenson777|contribs]]) 07:26, 28 April 2026 (UTC)
: The page title should probably be in English, as this is English Wikiversity. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:19, 28 April 2026 (UTC)
:@[[User:Ian Stevenson777|Ian Stevenson777]] I looked at the text and it seems to me that it is informative, but the user cannot learn anything from it because they would have to buy the book. In this regard, it seems to me that it is enough [[:w:Where Reincarnation and Biology Intersect|to have that article on Wikipedia]] and there is no need to duplicate it here on Wikiversity. If you are particularly interested with its Vietnamese translation, I would focus on Vietnamese Wikipedia, but it seems to me, that the article there [https://vi.wikipedia.org/w/index.php?title=N%C6%A1i_lu%C3%A2n_h%E1%BB%93i_v%C3%A0_sinh_h%E1%BB%8Dc_giao_nhau&amp;oldid=75029095 have some problems at the moment]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:51, 5 May 2026 (UTC)
:This request is AI-generated and was made by a lock evading LTA. Please ignore it. [[User:NguoiDungKhongDinhDanh|NguoiDungKhongDinhDanh]] ([[User talk:NguoiDungKhongDinhDanh|discuss]] • [[Special:Contributions/NguoiDungKhongDinhDanh|contribs]]) 23:58, 13 May 2026 (UTC)

== Call for custodians and bureaucrats ==
&lt;div class=&quot;cd-moveMark&quot;&gt;''Moved to [[Wikiversity:Notices for custodians#Call for custodians and bureaucrats]].  [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 18:46, 12 May 2026 (UTC)''&lt;/div&gt;

== Interface administrator flag request ==

@[[User:Jtneill|Jtneill]], @[[User:Mu301|Mu301]] I am requesting IA flag to delete [[MediaWiki:Gadget-WikiSign.js]]. It was requested for deletion by [[User:Sophivorus|a trusted user]] and I think it can be deleted. Once I delete it, I will notify you and you can remove the flag. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:24, 10 May 2026 (UTC)

:Can you enable two-factor authentication? 
:Policy: [[Wikiversity:Interface administrators]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:27, 10 May 2026 (UTC)
::Done @[[User:Jtneill|Jtneill]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:20, 11 May 2026 (UTC)
:::You are an interface administrator for 24 hours. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:57, 11 May 2026 (UTC)
::::Thx @[[User:Jtneill|Jtneill]], I have just deleted the page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:59, 11 May 2026 (UTC)

== Block request ==

Hi. Please block @[[User:Skibidi Titan 5.0|Skibidi Titan 5.0]]. Reason : Vandalism.

Thanks, [[User:Locpac|Locpac]] ([[User talk:Locpac|discuss]] • [[Special:Contributions/Locpac|contribs]]) 15:10, 10 May 2026 (UTC)

:Thankyou. Done. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 15:25, 10 May 2026 (UTC)


== ~2026-28496-53 ==

Please block [[Special:Contribs/~2026-28496-53]], vandalism. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:02, 11 May 2026 (UTC)

:{{done}} Thank you! —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 17:14, 11 May 2026 (UTC)

== ~2026-28792-52 ==

Please block [[Special:Contribs/~2026-28792-52]], vandalism. Appears to be same user as above. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:38, 12 May 2026 (UTC)
: Blocked locally by Barras. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 17:46, 12 May 2026 (UTC)</text>
      <sha1>r8214byczd30kqa8p9zhyzyqrxvzvxk</sha1>
    </revision>
    <revision>
      <id>2809722</id>
      <parentid>2809720</parentid>
      <timestamp>2026-05-16T19:25:59Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Request for Page Creation Approval - Research on Dr. Ian Stevenson */ archive to [[Wikiversity:Request custodian action/Archive/30#Request for Page Creation Approval - Research on Dr. Ian Stevenson]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809722</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="2838" sha1="5ryrwuj24ocgtwy85gm72efjyy0bdyw" xml:space="preserve">{{/Header}}

== Call for custodians and bureaucrats ==
&lt;div class=&quot;cd-moveMark&quot;&gt;''Moved to [[Wikiversity:Notices for custodians#Call for custodians and bureaucrats]].  [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 18:46, 12 May 2026 (UTC)''&lt;/div&gt;

== Interface administrator flag request ==

@[[User:Jtneill|Jtneill]], @[[User:Mu301|Mu301]] I am requesting IA flag to delete [[MediaWiki:Gadget-WikiSign.js]]. It was requested for deletion by [[User:Sophivorus|a trusted user]] and I think it can be deleted. Once I delete it, I will notify you and you can remove the flag. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:24, 10 May 2026 (UTC)

:Can you enable two-factor authentication? 
:Policy: [[Wikiversity:Interface administrators]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:27, 10 May 2026 (UTC)
::Done @[[User:Jtneill|Jtneill]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:20, 11 May 2026 (UTC)
:::You are an interface administrator for 24 hours. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:57, 11 May 2026 (UTC)
::::Thx @[[User:Jtneill|Jtneill]], I have just deleted the page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:59, 11 May 2026 (UTC)

== Block request ==

Hi. Please block @[[User:Skibidi Titan 5.0|Skibidi Titan 5.0]]. Reason : Vandalism.

Thanks, [[User:Locpac|Locpac]] ([[User talk:Locpac|discuss]] • [[Special:Contributions/Locpac|contribs]]) 15:10, 10 May 2026 (UTC)

:Thankyou. Done. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 15:25, 10 May 2026 (UTC)


== ~2026-28496-53 ==

Please block [[Special:Contribs/~2026-28496-53]], vandalism. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:02, 11 May 2026 (UTC)

:{{done}} Thank you! —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 17:14, 11 May 2026 (UTC)

== ~2026-28792-52 ==

Please block [[Special:Contribs/~2026-28792-52]], vandalism. Appears to be same user as above. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:38, 12 May 2026 (UTC)
: Blocked locally by Barras. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 17:46, 12 May 2026 (UTC)</text>
      <sha1>5ryrwuj24ocgtwy85gm72efjyy0bdyw</sha1>
    </revision>
    <revision>
      <id>2809724</id>
      <parentid>2809722</parentid>
      <timestamp>2026-05-16T19:26:07Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Call for custodians and bureaucrats */ archive to [[Wikiversity:Request custodian action/Archive/30#Call for custodians and bureaucrats]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809724</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="2509" sha1="ovie2i3ir9wiq1mrlo96zni5uumc1nd" xml:space="preserve">{{/Header}}

== Interface administrator flag request ==

@[[User:Jtneill|Jtneill]], @[[User:Mu301|Mu301]] I am requesting IA flag to delete [[MediaWiki:Gadget-WikiSign.js]]. It was requested for deletion by [[User:Sophivorus|a trusted user]] and I think it can be deleted. Once I delete it, I will notify you and you can remove the flag. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:24, 10 May 2026 (UTC)

:Can you enable two-factor authentication? 
:Policy: [[Wikiversity:Interface administrators]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:27, 10 May 2026 (UTC)
::Done @[[User:Jtneill|Jtneill]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:20, 11 May 2026 (UTC)
:::You are an interface administrator for 24 hours. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:57, 11 May 2026 (UTC)
::::Thx @[[User:Jtneill|Jtneill]], I have just deleted the page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:59, 11 May 2026 (UTC)

== Block request ==

Hi. Please block @[[User:Skibidi Titan 5.0|Skibidi Titan 5.0]]. Reason : Vandalism.

Thanks, [[User:Locpac|Locpac]] ([[User talk:Locpac|discuss]] • [[Special:Contributions/Locpac|contribs]]) 15:10, 10 May 2026 (UTC)

:Thankyou. Done. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 15:25, 10 May 2026 (UTC)


== ~2026-28496-53 ==

Please block [[Special:Contribs/~2026-28496-53]], vandalism. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:02, 11 May 2026 (UTC)

:{{done}} Thank you! —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 17:14, 11 May 2026 (UTC)

== ~2026-28792-52 ==

Please block [[Special:Contribs/~2026-28792-52]], vandalism. Appears to be same user as above. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:38, 12 May 2026 (UTC)
: Blocked locally by Barras. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 17:46, 12 May 2026 (UTC)</text>
      <sha1>ovie2i3ir9wiq1mrlo96zni5uumc1nd</sha1>
    </revision>
    <revision>
      <id>2809726</id>
      <parentid>2809724</parentid>
      <timestamp>2026-05-16T19:26:22Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Interface administrator flag request */ archive to [[Wikiversity:Request custodian action/Archive/30#Interface administrator flag request]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809726</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="1280" sha1="6vwyu9k634mi3b1w3a2z4cfz1glx1ya" xml:space="preserve">{{/Header}}

== Block request ==

Hi. Please block @[[User:Skibidi Titan 5.0|Skibidi Titan 5.0]]. Reason : Vandalism.

Thanks, [[User:Locpac|Locpac]] ([[User talk:Locpac|discuss]] • [[Special:Contributions/Locpac|contribs]]) 15:10, 10 May 2026 (UTC)

:Thankyou. Done. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 15:25, 10 May 2026 (UTC)


== ~2026-28496-53 ==

Please block [[Special:Contribs/~2026-28496-53]], vandalism. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:02, 11 May 2026 (UTC)

:{{done}} Thank you! —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 17:14, 11 May 2026 (UTC)

== ~2026-28792-52 ==

Please block [[Special:Contribs/~2026-28792-52]], vandalism. Appears to be same user as above. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:38, 12 May 2026 (UTC)
: Blocked locally by Barras. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 17:46, 12 May 2026 (UTC)</text>
      <sha1>6vwyu9k634mi3b1w3a2z4cfz1glx1ya</sha1>
    </revision>
    <revision>
      <id>2809727</id>
      <parentid>2809726</parentid>
      <timestamp>2026-05-16T19:26:47Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <minor />
      <comment>Removing a line of whitespace.</comment>
      <origin>2809727</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="1279" sha1="czr7pcrq68h60uqh672p9b6i9bfe1jw" xml:space="preserve">{{/Header}}

== Block request ==

Hi. Please block @[[User:Skibidi Titan 5.0|Skibidi Titan 5.0]]. Reason : Vandalism.

Thanks, [[User:Locpac|Locpac]] ([[User talk:Locpac|discuss]] • [[Special:Contributions/Locpac|contribs]]) 15:10, 10 May 2026 (UTC)

:Thankyou. Done. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 15:25, 10 May 2026 (UTC)

== ~2026-28496-53 ==

Please block [[Special:Contribs/~2026-28496-53]], vandalism. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:02, 11 May 2026 (UTC)

:{{done}} Thank you! —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 17:14, 11 May 2026 (UTC)

== ~2026-28792-52 ==

Please block [[Special:Contribs/~2026-28792-52]], vandalism. Appears to be same user as above. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:38, 12 May 2026 (UTC)
: Blocked locally by Barras. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 17:46, 12 May 2026 (UTC)</text>
      <sha1>czr7pcrq68h60uqh672p9b6i9bfe1jw</sha1>
    </revision>
    <revision>
      <id>2809729</id>
      <parentid>2809727</parentid>
      <timestamp>2026-05-16T19:26:58Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Block request */ archive to [[Wikiversity:Request custodian action/Archive/30#Block request]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809729</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="886" sha1="ogy9h2t7tevqonesd6o5cjp7jt0sgjj" xml:space="preserve">{{/Header}}

== ~2026-28496-53 ==

Please block [[Special:Contribs/~2026-28496-53]], vandalism. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:02, 11 May 2026 (UTC)

:{{done}} Thank you! —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 17:14, 11 May 2026 (UTC)

== ~2026-28792-52 ==

Please block [[Special:Contribs/~2026-28792-52]], vandalism. Appears to be same user as above. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:38, 12 May 2026 (UTC)
: Blocked locally by Barras. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 17:46, 12 May 2026 (UTC)</text>
      <sha1>ogy9h2t7tevqonesd6o5cjp7jt0sgjj</sha1>
    </revision>
    <revision>
      <id>2809731</id>
      <parentid>2809729</parentid>
      <timestamp>2026-05-16T19:27:08Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* ~2026-28496-53 */ archive to [[Wikiversity:Request custodian action/Archive/30#~2026-28496-53]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809731</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="490" sha1="ra4uvi2llq055m7x9wfve9zw9lok70o" xml:space="preserve">{{/Header}}

== ~2026-28792-52 ==

Please block [[Special:Contribs/~2026-28792-52]], vandalism. Appears to be same user as above. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:38, 12 May 2026 (UTC)
: Blocked locally by Barras. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 17:46, 12 May 2026 (UTC)</text>
      <sha1>ra4uvi2llq055m7x9wfve9zw9lok70o</sha1>
    </revision>
    <revision>
      <id>2809797</id>
      <parentid>2809731</parentid>
      <timestamp>2026-05-17T01:13:37Z</timestamp>
      <contributor>
        <username>Kirby - Electrotechnics</username>
        <id>3074947</id>
      </contributor>
      <comment>/* New User Exceeded New Page Limit */ new section</comment>
      <origin>2809797</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="1013" sha1="1go2ltua4et74pjm0f5qchj9r4t8qho" xml:space="preserve">{{/Header}}

== ~2026-28792-52 ==

Please block [[Special:Contribs/~2026-28792-52]], vandalism. Appears to be same user as above. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:38, 12 May 2026 (UTC)
: Blocked locally by Barras. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 17:46, 12 May 2026 (UTC)

== New User Exceeded New Page Limit  ==

Hello, my action of creating a Portal for Banjo learning (Portal:Banjo) was denied as I am a user whose had my account for a while but not written before today. My actions are constructive, but if you would rather me wait and let the system work as it intends to then that's okay too. 
--[[User:Kirby - Electrotechnics|Kirby - Electrotechnics]] ([[User talk:Kirby - Electrotechnics|discuss]] • [[Special:Contributions/Kirby - Electrotechnics|contribs]]) 01:13, 17 May 2026 (UTC)</text>
      <sha1>1go2ltua4et74pjm0f5qchj9r4t8qho</sha1>
    </revision>
    <revision>
      <id>2809827</id>
      <parentid>2809797</parentid>
      <timestamp>2026-05-17T03:36:08Z</timestamp>
      <contributor>
        <username>Koavf</username>
        <id>147</id>
      </contributor>
      <comment>/* New User Exceeded New Page Limit */ Reply</comment>
      <origin>2809827</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="1673" sha1="bjv11gh778jn7az5fk0s6jgjbsox8wy" xml:space="preserve">{{/Header}}

== ~2026-28792-52 ==

Please block [[Special:Contribs/~2026-28792-52]], vandalism. Appears to be same user as above. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:38, 12 May 2026 (UTC)
: Blocked locally by Barras. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 17:46, 12 May 2026 (UTC)

== New User Exceeded New Page Limit  ==

Hello, my action of creating a Portal for Banjo learning (Portal:Banjo) was denied as I am a user whose had my account for a while but not written before today. My actions are constructive, but if you would rather me wait and let the system work as it intends to then that's okay too. 
--[[User:Kirby - Electrotechnics|Kirby - Electrotechnics]] ([[User talk:Kirby - Electrotechnics|discuss]] • [[Special:Contributions/Kirby - Electrotechnics|contribs]]) 01:13, 17 May 2026 (UTC)

:That is standard and the rate limit will fall off as you stay and edit; it has some pretty easy barriers to cross. I can create a blank [[Portal:Banjo]] if you want, but to be clear, portal pages are usually much broader topics that can help orient you to specific pages. Do you think there will be that many pages about the topic of banjo playing? If not, then you can just continue editing [[Banjo]]. ―[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''&lt;span style=&quot;color:black&quot;&gt;v&lt;/span&gt;f&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 03:36, 17 May 2026 (UTC)</text>
      <sha1>bjv11gh778jn7az5fk0s6jgjbsox8wy</sha1>
    </revision>
  </page>
  <page>
    <title>The Abbasid City of Peace</title>
    <ns>0</ns>
    <id>78411</id>
    <revision>
      <id>2809837</id>
      <parentid>2716531</parentid>
      <timestamp>2026-05-17T03:53:04Z</timestamp>
      <contributor>
        <username>HenriPittier</username>
        <id>3076895</id>
      </contributor>
      <origin>2809837</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="1466" sha1="m3kkpdrcyd2q5rakxnwhrre5ubz3fp5" xml:space="preserve">&lt;p&gt;'''The Abbasid City of Peace'''&lt;/p&gt;

In 750, after years of civil war, the Abbasids, who have fought against their claimed descent from from Addas, an uncle of Muhammad, overthrew the Umayyad caliphs. 
The new rulers moved the capitol from Damascus to a site in Iraq near the old Sasanian captiol of Ctesiphon. There the caliph al-Mansur established
a new capitol,(caliph Al-Mansur was Fatimids not Abbasids) Baghdad, which he called Madina al-salam, the City of Peace. The city was laid out in 762 at a time astrologers determined as favorable.
It was round in plan, about a mile and a half in diameter. The shape signified that the new capitol was the center of the universe. At the city's center
was the caliph's palace, oriented to the four compass points. For almost 300 years Baghdad was the hub of Arab power and of brilliant Islamic culture. 
The Addasid caliphs were renowned throughout the world and even established diplomatic relations with Charlemagne at Aachen in Germany. The 
Abbasids lavished their wealth on art, literature, and science and were responsible, for the translation of numerous Greek texts that otherwise would
have been lost. Many of these works were introduced to the medieval West though their Arabic version.

[[http://img9.imageshack.us/img9/5870/3177711661aaba9dc37aoas3.jpg]]

&lt;p&gt;Reference sites:&lt;br /&gt;&lt;/p&gt;
&lt;references/&gt;
http://www.atlastours.net/iraq/baghdad.html

&lt;p&gt;[http://www.atlastours.net/iraq/baghdad.html Bagdad]&lt;/p&gt;</text>
      <sha1>m3kkpdrcyd2q5rakxnwhrre5ubz3fp5</sha1>
    </revision>
    <revision>
      <id>2809863</id>
      <parentid>2809837</parentid>
      <timestamp>2026-05-17T04:30:34Z</timestamp>
      <contributor>
        <username>NguoiDungKhongDinhDanh</username>
        <id>2922842</id>
      </contributor>
      <minor />
      <comment>Reverted edit by [[Special:Contributions/HenriPittier|HenriPittier]] ([[User_talk:HenriPittier|talk]]) to last version by [[User:Sakura emad|Sakura emad]] using [[Wikiversity:Rollback|rollback]]</comment>
      <origin>2190192</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="1440" sha1="k2sf11ctan7msh9jc72gpxr6n2qgvre" xml:space="preserve">&lt;p&gt;'''The Abbasid City of Peace'''&lt;/p&gt;

In 750, after years of civil war, the Abbasids, who claimed descent from from Addas, an uncle of Muhammad, overthrew the Umayyad caliphs. 
The new rulers moved the capitol from Damascus to a site in Iraq near the old Sasanian captiol of Ctesiphon. There the caliph al-Mansur established
a new capitol,(caliph Al-Mansur was Fatimids not Abbasids) Baghdad, which he called Madina al-salam, the City of Peace. The city was laid out in 762 at a time astrologers determined as favorable.
It was round in plan, about a mile and a half in diameter. The shape signified that the new capitol was the center of the universe. At the city's center
was the caliph's palace, oriented to the four compass points. For almost 300 years Baghdad was the hub of Arab power and of brilliant Islamic culture. 
The Addasid caliphs were renowned throughout the world and even established diplomatic relations with Charlemagne at Aachen in Germany. The 
Abbasids lavished their wealth on art, literature, and science and were responsible, for the translation of numerous Greek texts that otherwise would
have been lost. Many of these works were introduced to the medieval West though their Arabic version.

[[http://img9.imageshack.us/img9/5870/3177711661aaba9dc37aoas3.jpg]]

&lt;p&gt;Reference sites:&lt;br /&gt;&lt;/p&gt;
&lt;references/&gt;
http://www.atlastours.net/iraq/baghdad.html

&lt;p&gt;[http://www.atlastours.net/iraq/baghdad.html Bagdad]&lt;/p&gt;</text>
      <sha1>k2sf11ctan7msh9jc72gpxr6n2qgvre</sha1>
    </revision>
  </page>
  <page>
    <title>Wikiversity:Request custodian action/Header</title>
    <ns>4</ns>
    <id>83382</id>
    <revision>
      <id>2809736</id>
      <parentid>2809026</parentid>
      <timestamp>2026-05-16T19:39:12Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>Updating.</comment>
      <origin>2809736</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="3622" sha1="jv92bj4r6wk4nwesjxbmev25nhpcyqo" xml:space="preserve">&lt;includeonly&gt;__NEWSECTIONLINK__{{Nobots}}&lt;/includeonly&gt;{{RoundBoxTop|theme=14}}
{{Portal-head2|2=Welcome}}
&lt;hr&gt;
{| class=&quot;wikitable&quot; style = &quot;float:right; margin-left: 1em&quot;
! Custodian requests !! Entries
|-
| [https://en.wikiversity.org/w/index.php?title=Wikiversity:Request_custodian_action/Header&amp;action=purge Purge cache]
|-
| {{ #ifexpr: {{PAGESINCAT:Wikiversity protected edit requests}} &gt; 0 | bgcolor=&quot;#ffbbbb&quot; |}} | [[:Category:Wikiversity protected edit requests|Edit protected page]] || {{ #ifexpr: {{PAGESINCAT:Wikiversity protected edit requests}} &gt; 0 | bgcolor=&quot;#ffbbbb&quot; |}} | {{PAGESINCAT:Wikiversity protected edit requests}}
|-
| {{ #ifexpr: {{PAGESINCAT:Candidates for speedy deletion}} &gt; 0 | bgcolor=&quot;#ffbbbb&quot; |}} | [[:Category:Candidates for speedy deletion|Speedy deletion]] || {{ #ifexpr: {{PAGESINCAT:Candidates for speedy deletion}} &gt; 0 | bgcolor=&quot;#ffbbbb&quot; |}} | {{PAGESINCAT:Candidates for speedy deletion}}
|-
| {{ #ifexpr: {{PAGESINCAT:Pending deletions}} &gt; 0 | bgcolor=&quot;#ffbbbb&quot; |}} | [[:Category:Pending deletions|Expired prods]] || {{ #ifexpr: {{PAGESINCAT:Pending deletions}} &gt; 0 | bgcolor=&quot;#ffbbbb&quot; |}} | {{PAGESINCAT:Pending deletions}}
|-
| {{ #ifexpr: {{PAGESINCAT:Requests for Deletion}} &gt; 0 | bgcolor=&quot;#ffbbbb&quot; |}} | [[:Category:Requests for Deletion|Requests for Deletion]] || {{ #ifexpr: {{PAGESINCAT: Requests for Deletion}} &gt; 0 | bgcolor=&quot;#ffbbbb&quot; |}} | {{PAGESINCAT: Requests for Deletion}}
|-
| {{ #ifexpr: {{PAGESINCAT:Requests for unblock}} &gt; 0 | bgcolor=&quot;#ffbbbb&quot; |}} | [[:Category:Requests for unblock|Unblock requests]] || {{ #ifexpr: {{PAGESINCAT:Requests for unblock}} &gt; 0 | bgcolor=&quot;#ffbbbb&quot; |}} | {{PAGESINCAT:Requests for unblock}}
|-
| {{ #ifexpr: {{PAGESINCAT:Possible copyright violations}} &gt; 0 | bgcolor=&quot;#ffbbbb&quot; |}} | [[:Category:Possible copyright violations|Possible copyvio]] || {{ #ifexpr: {{PAGESINCAT:Possible copyright violations}} &gt; 0 | bgcolor=&quot;#ffbbbb&quot; |}} | {{PAGESINCAT:Possible copyright violations}}
|-
| {{ #ifexpr: {{PAGESINCAT:History merge requests}} &gt; 0 | bgcolor=&quot;#ffbbbb&quot; |}} | [[:Category:History merge requests|History merge]] || {{ #ifexpr: {{PAGESINCAT:History merge requests}} &gt; 0 | bgcolor=&quot;#ffbbbb&quot; |}} | {{PAGESINCAT:History merge requests}}
|-
|}
&lt;includeonly&gt;{{Shortcut|WV:RCA}}&lt;/includeonly&gt;
[[Wikiversity:Support staff|Wikiversity support staff]] are trusted users who have access to technical features (such as [[WV:PROTECT|protecting]] and [[WV:DELETE|deleting]] pages, [[WV:BLOCK|blocking]] users, and undoing these actions) that help with maintenance of Wikiversity.

You can '''[[Special:NewSection/Wikiversity:Request custodian action|create a new request]]'''. Sign with &lt;code&gt;&lt;nowiki&gt;--~~~~&lt;/nowiki&gt;&lt;/code&gt;.

Other request pages:
* [[Wikiversity:Requests for Deletion|Requests for deletion]]
* [[Wikiversity:Import|Requests for importing]] (e.g., from Meta or Wikibooks): 
* [[Wikiversity:Requests for CheckUser|Request for CheckUser]]

Other pages you may be looking for:
* [[Wikiversity:Custodian feedback|Comment on custodian actions]]
* [[Wikiversity:Notices for custodians|Notices for custodians]]
&lt;includeonly&gt;* [[/Archive/|Archive]] (old requests)&lt;/includeonly&gt;
{{clear}}
&lt;inputbox&gt;
bgcolor=transparent
type=fulltext
prefix=Wikiversity:Request custodian action
width=50
searchbuttonlabel=Search in the archives
&lt;/inputbox&gt;
{{RoundBoxBottom}}
{{Administering Wikiversity}}&lt;includeonly&gt;
[[Category:Wikiversity administration]]
[[Category:Wikiversity custodianship]]
[[cs:Wikiverzita:Nástěnka správců]]
[[fr:Wikiversité:Requêtes aux bibliothécaires]]
[[pt:Wikiversidade:Pedidos a administradores]]
&lt;/includeonly&gt;</text>
      <sha1>jv92bj4r6wk4nwesjxbmev25nhpcyqo</sha1>
    </revision>
    <revision>
      <id>2809902</id>
      <parentid>2809736</parentid>
      <timestamp>2026-05-17T11:00:39Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <comment>Expired prods -&gt; Pending deletions</comment>
      <origin>2809902</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="3626" sha1="5wwx8q6yfyxl8gf6yswnq56msoss0b9" xml:space="preserve">&lt;includeonly&gt;__NEWSECTIONLINK__{{Nobots}}&lt;/includeonly&gt;{{RoundBoxTop|theme=14}}
{{Portal-head2|2=Welcome}}
&lt;hr&gt;
{| class=&quot;wikitable&quot; style = &quot;float:right; margin-left: 1em&quot;
! Custodian requests !! Entries
|-
| [https://en.wikiversity.org/w/index.php?title=Wikiversity:Request_custodian_action/Header&amp;action=purge Purge cache]
|-
| {{ #ifexpr: {{PAGESINCAT:Wikiversity protected edit requests}} &gt; 0 | bgcolor=&quot;#ffbbbb&quot; |}} | [[:Category:Wikiversity protected edit requests|Edit protected page]] || {{ #ifexpr: {{PAGESINCAT:Wikiversity protected edit requests}} &gt; 0 | bgcolor=&quot;#ffbbbb&quot; |}} | {{PAGESINCAT:Wikiversity protected edit requests}}
|-
| {{ #ifexpr: {{PAGESINCAT:Candidates for speedy deletion}} &gt; 0 | bgcolor=&quot;#ffbbbb&quot; |}} | [[:Category:Candidates for speedy deletion|Speedy deletion]] || {{ #ifexpr: {{PAGESINCAT:Candidates for speedy deletion}} &gt; 0 | bgcolor=&quot;#ffbbbb&quot; |}} | {{PAGESINCAT:Candidates for speedy deletion}}
|-
| {{ #ifexpr: {{PAGESINCAT:Pending deletions}} &gt; 0 | bgcolor=&quot;#ffbbbb&quot; |}} | [[:Category:Pending deletions|Pending deletions]] || {{ #ifexpr: {{PAGESINCAT:Pending deletions}} &gt; 0 | bgcolor=&quot;#ffbbbb&quot; |}} | {{PAGESINCAT:Pending deletions}}
|-
| {{ #ifexpr: {{PAGESINCAT:Requests for Deletion}} &gt; 0 | bgcolor=&quot;#ffbbbb&quot; |}} | [[:Category:Requests for Deletion|Requests for Deletion]] || {{ #ifexpr: {{PAGESINCAT: Requests for Deletion}} &gt; 0 | bgcolor=&quot;#ffbbbb&quot; |}} | {{PAGESINCAT: Requests for Deletion}}
|-
| {{ #ifexpr: {{PAGESINCAT:Requests for unblock}} &gt; 0 | bgcolor=&quot;#ffbbbb&quot; |}} | [[:Category:Requests for unblock|Unblock requests]] || {{ #ifexpr: {{PAGESINCAT:Requests for unblock}} &gt; 0 | bgcolor=&quot;#ffbbbb&quot; |}} | {{PAGESINCAT:Requests for unblock}}
|-
| {{ #ifexpr: {{PAGESINCAT:Possible copyright violations}} &gt; 0 | bgcolor=&quot;#ffbbbb&quot; |}} | [[:Category:Possible copyright violations|Possible copyvio]] || {{ #ifexpr: {{PAGESINCAT:Possible copyright violations}} &gt; 0 | bgcolor=&quot;#ffbbbb&quot; |}} | {{PAGESINCAT:Possible copyright violations}}
|-
| {{ #ifexpr: {{PAGESINCAT:History merge requests}} &gt; 0 | bgcolor=&quot;#ffbbbb&quot; |}} | [[:Category:History merge requests|History merge]] || {{ #ifexpr: {{PAGESINCAT:History merge requests}} &gt; 0 | bgcolor=&quot;#ffbbbb&quot; |}} | {{PAGESINCAT:History merge requests}}
|-
|}
&lt;includeonly&gt;{{Shortcut|WV:RCA}}&lt;/includeonly&gt;
[[Wikiversity:Support staff|Wikiversity support staff]] are trusted users who have access to technical features (such as [[WV:PROTECT|protecting]] and [[WV:DELETE|deleting]] pages, [[WV:BLOCK|blocking]] users, and undoing these actions) that help with maintenance of Wikiversity.

You can '''[[Special:NewSection/Wikiversity:Request custodian action|create a new request]]'''. Sign with &lt;code&gt;&lt;nowiki&gt;--~~~~&lt;/nowiki&gt;&lt;/code&gt;.

Other request pages:
* [[Wikiversity:Requests for Deletion|Requests for deletion]]
* [[Wikiversity:Import|Requests for importing]] (e.g., from Meta or Wikibooks): 
* [[Wikiversity:Requests for CheckUser|Request for CheckUser]]

Other pages you may be looking for:
* [[Wikiversity:Custodian feedback|Comment on custodian actions]]
* [[Wikiversity:Notices for custodians|Notices for custodians]]
&lt;includeonly&gt;* [[/Archive/|Archive]] (old requests)&lt;/includeonly&gt;
{{clear}}
&lt;inputbox&gt;
bgcolor=transparent
type=fulltext
prefix=Wikiversity:Request custodian action
width=50
searchbuttonlabel=Search in the archives
&lt;/inputbox&gt;
{{RoundBoxBottom}}
{{Administering Wikiversity}}&lt;includeonly&gt;
[[Category:Wikiversity administration]]
[[Category:Wikiversity custodianship]]
[[cs:Wikiverzita:Nástěnka správců]]
[[fr:Wikiversité:Requêtes aux bibliothécaires]]
[[pt:Wikiversidade:Pedidos a administradores]]
&lt;/includeonly&gt;</text>
      <sha1>5wwx8q6yfyxl8gf6yswnq56msoss0b9</sha1>
    </revision>
  </page>
  <page>
    <title>Comparative law and justice/Vietnam</title>
    <ns>0</ns>
    <id>86178</id>
    <revision>
      <id>2809876</id>
      <parentid>2760530</parentid>
      <timestamp>2026-05-17T07:46:35Z</timestamp>
      <contributor>
        <username>~2026-29634-71</username>
        <id>3076970</id>
      </contributor>
      <comment>/* Works Cited */ added a source</comment>
      <origin>2809876</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="13583" sha1="36huhidkxcm2tcin6zqtgyhssio3zd0" xml:space="preserve">{{Comparative law and justice project|region=Asia}}
===Brief History===
'''BRIEF HISTORY:'''&lt;/br&gt;&lt;br&gt;
The Vietnamese first appeared in history as one of many scattered peoples living in what is now South China and Northern Vietnam just before the beginning of the Christian era. According to local tradition, the small Vietnamese kingdom of Au Lac, located in the heart of the Red River valley, was founded by a line of legendary kings who had ruled over the ancient kingdom of Van Lang for thousands of years. Historical evidence to substantiate this tradition is scanty, but archaeological findings indicate that the early peoples of the Red River delta area may have been among the first East Asians to practice agriculture, and by the 1st century BC they had achieved a relatively advanced level of Bronze Age civilization. 
• Vietnam conquered by French in 19th century
• Occupied by Japanese in W.W.II
• 1945 end of W.W. II
• 1946-54 – Communist Viet Minh League formed and led
by Ho Chi Minh; not recognized by France
• French and Viet Minh fight for control of Indochina
• 1954 – Viet Nam divided with DMZ; elections promised
by UN; country to be re-united in 1956
• 1955-6 Ho Chi Minh controls Communist North (DMV);
Diem, supported by U.S. controls South; U.S. delays
• 1957 – U.S. has Special Forces troops involved in
intelligence gathering and training of South Vietnamese,
including the Montagnard indigenous people, in guerilla
warfare – no official involvement
• 1963 – Pres. Diem assassinated; 3 weeks later,
Kennedy assassinated
• March 1965 – first U.S. combat troops land
• October 1965 – first draft card burned
• 1968 peace negotiations begin in Paris
• 1969 My Lai massacre exposed
• 1973 agreement signed between U.S. and DRV; official
withdrawal of U.S.
• 1976 N. and S. Viet Nam reunited

&lt;gallery&gt;
Image:Hái dừa.JPG| Dong Ho painting
Image:MNong people.jpg|MNong people
Image:Cao-dai-temple1.jpg|Cao-dai-temple
Image:Halong Bay in Vietnam.jpg|Ha long bay
Image:Buddha statue, Nha Trang.jpg|Buddha statue
Image:Trong dong Dong Son.jpg|Dong Son bronze drum
Image:Cao Dai prayers.jpg| Cao Dai prayers
Image:Cao Dai three saints signing an accord.jpg|Cao Dai three saints signing an accord
&lt;/gallery&gt;

===General===
Country's full name: Socialist Republic of Vietnam (Cong Hoa Xa Hoi Chu Nghia Viet Nam).&lt;ref name=&quot;locgov&quot;&gt;http://lcweb2.loc.gov/frd/cs/profiles/Vietnam.pdf&lt;/ref&gt; 
Capital: Hanoi.[1]
Major Cities: Ho Chi Minh City is populated with 5.6 million people. Following is Hanoi with a population with a little more than half of Ho Chi Minh City, with 3 million people. Other major cities consists of: Danang, Haiphong, and Can Tho.&lt;ref name=&quot;locgov&quot;/&gt; 
Independence: Vietnam became independent from Japan and France on September 2, 1945.&lt;ref name=&quot;locgov&quot;/&gt;  However, Vietnam remained under French control until the communist Viet Minh defeated French forces at Dien Bien Phu in 1954.&lt;ref name=&quot;locgov&quot;/&gt; 
Public Holidays: &quot;Official holidays are: New Year’s (January 1), Tet or Lunar New Year (movable date in January or February), Liberation Day to commemorate the fall of Saigon (April 30), Labor Day (May 1), and Independence Day to commemorate Japan’s withdrawal following its defeat in World War II (September 2).&lt;ref name=&quot;locgov&quot;/&gt;  
== Basic Information==
[[Image:Flag of Vietnam.svg|thumb|150px|center|Flag of Vietnam ]]
[[Image:Mr. Truong Tan Sang.jpg|thumb|150px|center|President: Trương Tấn Sang]]
 
===Land===
'''Land area:''' &lt;/br&gt;&lt;br&gt;
125,622 sq mi (325,361 sq km)&lt;ref name=&quot;please&quot;&gt;http://www.infoplease.com/ipa/A0108144.html&lt;/ref&gt;&lt;br&gt;
total area: 127,244 sq mi (329,560 sq km)&lt;ref name=&quot;please&quot;/&gt; &lt;/br&gt;&lt;br&gt;
[[Image:Vm-map.png|thumb|150px|right|Map of Vietnam]]
'''Geography:''' &lt;/br&gt;
Vietnam is borederd by the South China Sea and is part of the Indochinese peninsula. South of Vietnam is the Mekong River delta. North of Vietnam is China while Laos and Cambodia are to the West.&lt;ref name=&quot;please&quot;/&gt;
===People=== 
[[Image:Red Ao dai 3.jpg|thumb|100px|left|Viet girl in ao dai]]
'''Population:''' (July 2009 est.)
88,576,758&lt;ref name=&quot;mundi&quot;&gt;http://www.indexmundi.com/vietnam/demographics_profile.html&lt;/ref&gt;

'''Age structure''' (2009 est.)&lt;/br&gt;
0-14 years: 26.1% (male 12,069,408/female 11,033,738)&lt;ref name=&quot;mundi&quot;/&gt;
15-64 years: 68.3% (male 30,149,986/female 30,392,043)&lt;ref name=&quot;mundi&quot;/&gt;
65 years and over: 5.6% (male 1,892,505/female 3,039,078)&lt;ref name=&quot;mundi&quot;/&gt;
'''Median Age''' (2009 est.)
total: 27.4 years&lt;ref name=&quot;mundi&quot;/&gt;
male: 26.4 years&lt;ref name=&quot;mundi&quot;/&gt;
female: 28.5 years&lt;ref name=&quot;mundi&quot;/&gt;
'''Population growth rate''' (2009 est.)
1.137%&lt;ref name=&quot;mundi&quot;/&gt;
'''Birth rate''' (2009 est.)
17.73 births/1,000 population&lt;ref name=&quot;mundi&quot;/&gt;
'''Net migration rate'''(2009 est.)&gt;
Year Net migration rate Rank Percent Change Date of Information&lt;ref&gt;http://www.indexmundi.com/vietnam/net_migration_rate.html&lt;/ref&gt;&lt;/br&gt;&lt;br&gt;
 
2008 -0.39 99   (2008 est.)
2009 -0.38 103 -2.56 % (2009 est.)  
2010 -0.38 100 0.00 % (2009 est.)

'''Urbanization'''
urban population: 28% of total population (2008)&lt;ref name=&quot;mundi&quot;/&gt;
rate of urbanization: 3.1% annual rate of change (2005-10 est.)&lt;ref name=&quot;mundi&quot;/&gt;
'''Sex ratio'''(2009 est.) 
at birth: 1.07 male(s)/female&lt;ref name=&quot;mundi&quot;/&gt;
under 15 years: 1.08 male(s)/female&lt;ref name=&quot;mundi&quot;/&gt;
15-64 years: 0.99 male(s)/female&lt;ref name=&quot;mundi&quot;/&gt;
65 years and over: 0.63 male(s)/female&lt;ref name=&quot;mundi&quot;/&gt; 
total population: 0.98 male(s)/female&lt;ref name=&quot;mundi&quot;/&gt; 

'''Life expectancy at birth''' (2009 est.) 
male: 69.24 years&lt;ref name=&quot;mundi&quot;/&gt; 
female: 74.45 years&lt;ref name=&quot;mundi&quot;/&gt; 
total population: 71.71 years&lt;ref name=&quot;mundi&quot;/&gt; 

'''Total fertility rate''' (2009 est.) 
1.98 children born/woman&lt;ref name=&quot;mundi&quot;/&gt;  
 
'''Nationality''' 
noun: Vietnamese (singular and plural)&lt;ref name=&quot;mundi&quot;/&gt; &lt;/br&gt;&lt;br&gt; 
adjective: Vietnamese&lt;ref name=&quot;mundi&quot;/&gt; &lt;/br&gt;&lt;br&gt; 

'''Ethnic groups:''' 
85%-90% Vietnamese&lt;ref name=&quot;locgov&quot;/&gt; 
3% Chinese&lt;ref name=&quot;locgov&quot;/&gt; 
7%-12% French, Hmong, Thai, Khmer, Cham, and Montagnards&lt;ref name=&quot;locgov&quot;/&gt; [https://www.vietnamesemotorbiketours.com/vietnam-54-ethnic-groups-of-minority-people Vietnam 54 ethnic groups] 

'''Languages''' 
The primary language in Vietnam is [[Southeast_Asian_Languages/Vietnamese_Language|Vietnamese]] ([http://vi.wikipedia.org/wiki/Tiếng_Việt Tiếng Việt]).

'''Religions:'''  
Buddhist (7.6 million)&lt;ref name=&quot;locgov&quot;/&gt; ,
Roman Catholic (6 million)&lt;ref name=&quot;locgov&quot;/&gt; ,
Cao Dai (2 million)&lt;ref name=&quot;locgov&quot;/&gt; ,
Hoa Hao (1 million)&lt;ref name=&quot;locgov&quot;/&gt; ,
Protestant (500,000)&lt;ref name=&quot;locgov&quot;/&gt; ,
and Islam (50,000)&lt;ref name=&quot;locgov&quot;/&gt; .

===Economic Development===


'''ECONOMIC DEVELOPMENT:'''  
Between the early 90s and 2005, 29%-50% poverty decreased in the Country. This kind of progress unfortunately, depends on which city they lived in because most people prospered in the more urban areas like Ho Chi Minh City. However, rural area poverty also had some declination. In 1993, 66% and in 2002, 36%. Most of the poverty in Vietnam are in the rural areas in the northern parts of Vietnam and central highlands. Despite the progress, the [[World Economic Forum's 2005 Global Competitive Report]] ranked Vietnam as the 81st in growth competitiveness globally and 80th in business competitiveness. Ineffectiveness of the competition ranks are due to government corruption and poorly owned state banks. Economy in Vietnam is continuously growing at a rate of 7% per year. In 2003, tourism was at 2.4 million and 2004 international arrivals increased to 2.9 million. Between 1994 and 2004 tourism rates rose by 63%. International tourism consists of 27% from China, 8-9% from U.S., Japan and South Korea each. The unemployment rate in 2004 was 5.6% compared to 6.0% in 2002. Exchange rates as of December 2005 is 15,913D(dong) per 1USD.&lt;ref name=&quot;locgov&quot;/&gt; 

===Health===
'''HEALTH:'''&lt;ref name=&quot;mundi&quot;/&gt;

'''Death rate''' (July 2009 est.)
5.98 deaths/1,000 population&lt;ref name=&quot;mundi&quot;/&gt; 

'''Infant mortality rate''' (2009 est.) 
male: 22.64 deaths/1,000 live births&lt;ref name=&quot;mundi&quot;/&gt;
female: 21.84 deaths/1,000 live births&lt;ref name=&quot;mundi&quot;/&gt; 
total: 22.26 deaths/1,000 live births&lt;ref name=&quot;mundi&quot;/&gt;

'''HIV/AIDS - adult prevalence rate''' (2007 est.) 
0.5%&lt;ref name=&quot;mundi&quot;/&gt; &lt;/br&gt;&lt;br&gt; 

'''HIV/AIDS - people living with HIV/AIDS''' (2007 est.) 
290,000&lt;ref name=&quot;mundi&quot;/&gt;&lt;/br&gt;&lt;br&gt;
 
'''HIV/AIDS - deaths''' (2007 est.) &lt;/br&gt;&lt;br&gt;
24,000&lt;ref name=&quot;mundi&quot;/&gt;&lt;/br&gt;&lt;br&gt;

'''Major infectious diseases'''(2009 est.)&lt;/br&gt;&lt;br&gt;
food or waterborne diseases: bacterial diarrhea, hepatitis A, and typhoid fever&lt;ref name=&quot;mundi&quot;/&gt; 
vectorborne diseases: dengue fever, malaria, Japanese encephalitis, and plague&lt;ref name=&quot;mundi&quot;/&gt;&lt;/br&gt;&lt;br&gt; 
water contact disease: leptospirosis&lt;ref name=&quot;mundi&quot;/&gt;&lt;/br&gt;&lt;br&gt; 
note: highly pathogenic H5N1 avian influenza has been identified in this country; it poses a negligible risk with extremely rare cases possible among US citizens who have close contact with birds&lt;ref name=&quot;mundi&quot;/&gt;&lt;/br&gt;&lt;br&gt;
degree of risk: high&lt;ref name=&quot;mundi&quot;/&gt;&lt;/br&gt;&lt;br&gt;

===Education===	

'''EDUCATION:'''
92% of eligble children were enrolled in primary education. Two out of every three of this 92% finished the fifth grade. Family income compared to tuition costs, books, uniforms, and transportation became less important than finding money to support members of the family so drop out rates were fairly high. However, location is also important. 96% of students in the city completed the fifth grade whereas students in the rural area are less fortunate and only 10-15% go pass the third grade. In the year 2000, 62.5% of students went into higher education. The Vietnam government however, is trying to make secondary education more easier to access.&lt;ref name=&quot;locgov&quot;/&gt; 

'''Literacy''' 
definition: age 15 and over can read and write 
total population: 94%&lt;ref name=&quot;mundi&quot;/&gt;
male: 95.8&amp;&lt;ref name=&quot;mundi&quot;/&gt;
female: 92.3%&lt;ref name=&quot;mundi&quot;/&gt;

'''School life expectancy (primary to tertiary education)''' (2000)&lt;/br&gt;&lt;br&gt;
total: 10 years&lt;ref name=&quot;mundi&quot;/&gt;&lt;/br&gt;&lt;br&gt; 
male: 11 years&lt;ref name=&quot;mundi&quot;/&gt;&lt;/br&gt;&lt;br&gt; 
female: 10 years&lt;ref name=&quot;mundi&quot;/&gt;&lt;/br&gt;&lt;br&gt; 
 
definition: age 15 and over can read and write
total population: 90.3%&lt;ref name=&quot;mundi&quot;/&gt;
male: 93.9%&lt;ref name=&quot;mundi&quot;/&gt;
female: 86.9% (2002 est.)&lt;ref name=&quot;mundi&quot;/&gt;

==Governance==


===Elections===


==Courts==
===Judicial Review===

==Courts and Criminal Law==
[http://vi.wikipedia.org/wiki/Pháp_luật (Pháp luật)]
===Punishment===
The death penalty exists in Vietnam ([http://vi.wikipedia.org/wiki/Tử_hình Tử hình])
===Legal Personnel===
===Law Enforcement===
===Crime Rates and Public Opinion===
{| class=&quot;wikitable&quot;
|-
| '''Rates of Key Crimes in '''
| bgcolor=&quot;#E4EDEE&quot; | Lie
| bgcolor=&quot;#E4EDEE&quot; | Theft
| bgcolor=&quot;#E4EDEE&quot; | Breach of Contract
| bgcolor=&quot;#E4EDEE&quot; | Assault
| bgcolor=&quot;#E4EDEE&quot; | Cheat
|}
&lt;br&gt;

==National/Foreign Law==
==Law of the Sea==

[http://vi.wikisource.org/wiki/Luật_Biển_Việt_Nam Luật Biển Việt Nam] in Vietnamese.

==Rights==
===Labor Relations===
====Labor Codes====
[http://vi.wikisource.org/wiki/Bộ_luật_Lao_động_nước_Cộng_hòa_xã_hội_chủ_nghĩa_Việt_Nam_2012 See: Bộ luật Lao động nước Cộng hòa xã hội chủ nghĩa Việt Nam 2012]&lt;br&gt;
The labor code is important to Vietnam. Where (foreign) criminal law has the presumption of innocence (to be be proven against with hard proof). The employee in Vietnam has the benefit of being upheld (not to be proven against without reasonable or hard proof). This is commonly discussed as the pro-employee rulings on labor issues. All employee contracts are expected to be in good standing order. Special statutory considerations for employees should be accounted for - even where employment contracts state otherwise. Judges will review workers' rights as a priority &lt;ref&gt; http://homepages.warwick.ac.uk/~syrbe/pubs/RightstoInterests.pdf&lt;/ref&gt;.

This is from traditional Asian culture and communist policy. Leadership orients the service (of employment). Employees that aren't opportunistic or willing to be new leaders are retained under proper treatment and rights. A disparity in wages is not necessarily an issue between leader and employees - indebtedness carries to the leader. Because of this culture, leaders can leave organizations with their main supporters. Therefore, protection of business-orientated intellectual-property is not a cultural priority. 

In the diaspora, alternative business cultures can exist &lt;ref&gt;http://english.molisa.gov.vn/news/viewdetail/tabid/339/newsid/55534/seo/Promoting-legal-empowerment-for-the-poor-and-vulnerable-people-in-Vietnam/language/en-US/Default.aspx&lt;/ref&gt;. Modern employment at foreign national organizations can obey international HR trends &lt;ref&gt;http://english.molisa.gov.vn/news/viewdetail/tabid/339/newsid/55548/seo/Mekong-province-aims-to-improve-human-resources/language/en-US/Default.aspx&lt;/ref&gt;.
 
See (Viet):[http://vi.wikipedia.org/wiki/Bộ_Lao_động_-_Thương_binh_và_Xã_hội Bộ Lao động - Thương binh và Xã hội]

===Family Law===
==Socialist Law==
See: [http://vi.wikisource.org/wiki/Luật_Công_đoàn_nước_Cộng_hòa_xã_hội_chủ_nghĩa_Việt_Nam_2012 Luật Công đoàn nước Cộng hòa xã hội chủ nghĩa Việt Nam 2012]

Social-rights laws are a category of law in Vietnam, which is more than a subcategory of law dealing with issues (for morals and rights).

===Human Rights===

==Works Cited==
&lt;references /&gt;8. https://www.irtouring.com 
[[Category:Vietnam]]</text>
      <sha1>36huhidkxcm2tcin6zqtgyhssio3zd0</sha1>
    </revision>
    <revision>
      <id>2809892</id>
      <parentid>2809876</parentid>
      <timestamp>2026-05-17T10:25:20Z</timestamp>
      <contributor>
        <username>MathXplore</username>
        <id>2888076</id>
      </contributor>
      <comment>Restored revision 2392675 by [[Special:Contributions/CommonsDelinker|CommonsDelinker]] ([[en:w:User:BrandonXLF/Restorer|Restorer]])</comment>
      <origin>2809892</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="13446" sha1="rlztlahhanbttfzksw2p83mp25fhjtq" xml:space="preserve">{{Comparative law and justice project|region=Asia}}
===Brief History===
'''BRIEF HISTORY:'''&lt;/br&gt;&lt;br&gt;
The Vietnamese first appeared in history as one of many scattered peoples living in what is now South China and Northern Vietnam just before the beginning of the Christian era. According to local tradition, the small Vietnamese kingdom of Au Lac, located in the heart of the Red River valley, was founded by a line of legendary kings who had ruled over the ancient kingdom of Van Lang for thousands of years. Historical evidence to substantiate this tradition is scanty, but archaeological findings indicate that the early peoples of the Red River delta area may have been among the first East Asians to practice agriculture, and by the 1st century BC they had achieved a relatively advanced level of Bronze Age civilization. 
• Vietnam conquered by French in 19th century
• Occupied by Japanese in W.W.II
• 1945 end of W.W. II
• 1946-54 – Communist Viet Minh League formed and led
by Ho Chi Minh; not recognized by France
• French and Viet Minh fight for control of Indochina
• 1954 – Viet Nam divided with DMZ; elections promised
by UN; country to be re-united in 1956
• 1955-6 Ho Chi Minh controls Communist North (DMV);
Diem, supported by U.S. controls South; U.S. delays
• 1957 – U.S. has Special Forces troops involved in
intelligence gathering and training of South Vietnamese,
including the Montagnard indigenous people, in guerilla
warfare – no official involvement
• 1963 – Pres. Diem assassinated; 3 weeks later,
Kennedy assassinated
• March 1965 – first U.S. combat troops land
• October 1965 – first draft card burned
• 1968 peace negotiations begin in Paris
• 1969 My Lai massacre exposed
• 1973 agreement signed between U.S. and DRV; official
withdrawal of U.S.
• 1976 N. and S. Viet Nam reunited

&lt;gallery&gt;
Image:Hái dừa.JPG| Dong Ho painting
Image:MNong people.jpg|MNong people
Image:Cao-dai-temple1.jpg|Cao-dai-temple
Image:Halong Bay in Vietnam.jpg|Ha long bay
Image:Buddha statue, Nha Trang.jpg|Buddha statue
Image:Trong dong Dong Son.jpg|Dong Son bronze drum
Image:Cao Dai prayers.jpg| Cao Dai prayers
Image:Cao Dai three saints signing an accord.jpg|Cao Dai three saints signing an accord
&lt;/gallery&gt;

===General===
Country's full name: Socialist Republic of Vietnam (Cong Hoa Xa Hoi Chu Nghia Viet Nam).&lt;ref name=&quot;locgov&quot;&gt;http://lcweb2.loc.gov/frd/cs/profiles/Vietnam.pdf&lt;/ref&gt; 
Capital: Hanoi.[1]
Major Cities: Ho Chi Minh City is populated with 5.6 million people. Following is Hanoi with a population with a little more than half of Ho Chi Minh City, with 3 million people. Other major cities consists of: Danang, Haiphong, and Can Tho.&lt;ref name=&quot;locgov&quot;/&gt; 
Independence: Vietnam became independent from Japan and France on September 2, 1945.&lt;ref name=&quot;locgov&quot;/&gt;  However, Vietnam remained under French control until the communist Viet Minh defeated French forces at Dien Bien Phu in 1954.&lt;ref name=&quot;locgov&quot;/&gt; 
Public Holidays: &quot;Official holidays are: New Year’s (January 1), Tet or Lunar New Year (movable date in January or February), Liberation Day to commemorate the fall of Saigon (April 30), Labor Day (May 1), and Independence Day to commemorate Japan’s withdrawal following its defeat in World War II (September 2).&lt;ref name=&quot;locgov&quot;/&gt;  
== Basic Information==
[[Image:Flag of Vietnam.svg|thumb|150px|center|Flag of Vietnam ]]
[[Image:Mr. Truong Tan Sang.jpg|thumb|150px|center|President: Trương Tấn Sang]]
 
===Land===
'''Land area:''' &lt;/br&gt;&lt;br&gt;
125,622 sq mi (325,361 sq km)&lt;ref name=&quot;please&quot;&gt;http://www.infoplease.com/ipa/A0108144.html&lt;/ref&gt;&lt;br&gt;
total area: 127,244 sq mi (329,560 sq km)&lt;ref name=&quot;please&quot;/&gt; &lt;/br&gt;&lt;br&gt;
[[Image:Vm-map.png|thumb|150px|right|Map of Vietnam]]
'''Geography:''' &lt;/br&gt;
Vietnam is borederd by the South China Sea and is part of the Indochinese peninsula. South of Vietnam is the Mekong River delta. North of Vietnam is China while Laos and Cambodia are to the West.&lt;ref name=&quot;please&quot;/&gt;
===People=== 
[[Image:Red Ao dai 3.jpg|thumb|100px|left|Viet girl in ao dai]]
'''Population:''' (July 2009 est.)
88,576,758&lt;ref name=&quot;mundi&quot;&gt;http://www.indexmundi.com/vietnam/demographics_profile.html&lt;/ref&gt;

'''Age structure''' (2009 est.)&lt;/br&gt;
0-14 years: 26.1% (male 12,069,408/female 11,033,738)&lt;ref name=&quot;mundi&quot;/&gt;
15-64 years: 68.3% (male 30,149,986/female 30,392,043)&lt;ref name=&quot;mundi&quot;/&gt;
65 years and over: 5.6% (male 1,892,505/female 3,039,078)&lt;ref name=&quot;mundi&quot;/&gt;
'''Median Age''' (2009 est.)
total: 27.4 years&lt;ref name=&quot;mundi&quot;/&gt;
male: 26.4 years&lt;ref name=&quot;mundi&quot;/&gt;
female: 28.5 years&lt;ref name=&quot;mundi&quot;/&gt;
'''Population growth rate''' (2009 est.)
1.137%&lt;ref name=&quot;mundi&quot;/&gt;
'''Birth rate''' (2009 est.)
17.73 births/1,000 population&lt;ref name=&quot;mundi&quot;/&gt;
'''Net migration rate'''(2009 est.)&gt;
Year Net migration rate Rank Percent Change Date of Information&lt;ref&gt;http://www.indexmundi.com/vietnam/net_migration_rate.html&lt;/ref&gt;&lt;/br&gt;&lt;br&gt;
 
2008 -0.39 99   (2008 est.)
2009 -0.38 103 -2.56 % (2009 est.)  
2010 -0.38 100 0.00 % (2009 est.)

'''Urbanization'''
urban population: 28% of total population (2008)&lt;ref name=&quot;mundi&quot;/&gt;
rate of urbanization: 3.1% annual rate of change (2005-10 est.)&lt;ref name=&quot;mundi&quot;/&gt;
'''Sex ratio'''(2009 est.) 
at birth: 1.07 male(s)/female&lt;ref name=&quot;mundi&quot;/&gt;
under 15 years: 1.08 male(s)/female&lt;ref name=&quot;mundi&quot;/&gt;
15-64 years: 0.99 male(s)/female&lt;ref name=&quot;mundi&quot;/&gt;
65 years and over: 0.63 male(s)/female&lt;ref name=&quot;mundi&quot;/&gt; 
total population: 0.98 male(s)/female&lt;ref name=&quot;mundi&quot;/&gt; 

'''Life expectancy at birth''' (2009 est.) 
male: 69.24 years&lt;ref name=&quot;mundi&quot;/&gt; 
female: 74.45 years&lt;ref name=&quot;mundi&quot;/&gt; 
total population: 71.71 years&lt;ref name=&quot;mundi&quot;/&gt; 

'''Total fertility rate''' (2009 est.) 
1.98 children born/woman&lt;ref name=&quot;mundi&quot;/&gt;  
 
'''Nationality''' 
noun: Vietnamese (singular and plural)&lt;ref name=&quot;mundi&quot;/&gt; &lt;/br&gt;&lt;br&gt; 
adjective: Vietnamese&lt;ref name=&quot;mundi&quot;/&gt; &lt;/br&gt;&lt;br&gt; 

'''Ethnic groups:''' 
85%-90% Vietnamese&lt;ref name=&quot;locgov&quot;/&gt; 
3% Chinese&lt;ref name=&quot;locgov&quot;/&gt; 
7%-12% French, Hmong, Thai, Khmer, Cham, and Montagnards&lt;ref name=&quot;locgov&quot;/&gt; 

'''Languages''' 
The primary language in Vietnam is [[Southeast_Asian_Languages/Vietnamese_Language|Vietnamese]] ([http://vi.wikipedia.org/wiki/Tiếng_Việt Tiếng Việt]).

'''Religions:'''  
Buddhist (7.6 million)&lt;ref name=&quot;locgov&quot;/&gt; ,
Roman Catholic (6 million)&lt;ref name=&quot;locgov&quot;/&gt; ,
Cao Dai (2 million)&lt;ref name=&quot;locgov&quot;/&gt; ,
Hoa Hao (1 million)&lt;ref name=&quot;locgov&quot;/&gt; ,
Protestant (500,000)&lt;ref name=&quot;locgov&quot;/&gt; ,
and Islam (50,000)&lt;ref name=&quot;locgov&quot;/&gt; .

===Economic Development===


'''ECONOMIC DEVELOPMENT:'''  
Between the early 90s and 2005, 29%-50% poverty decreased in the Country. This kind of progress unfortunately, depends on which city they lived in because most people prospered in the more urban areas like Ho Chi Minh City. However, rural area poverty also had some declination. In 1993, 66% and in 2002, 36%. Most of the poverty in Vietnam are in the rural areas in the northern parts of Vietnam and central highlands. Despite the progress, the [[World Economic Forum's 2005 Global Competitive Report]] ranked Vietnam as the 81st in growth competitiveness globally and 80th in business competitiveness. Ineffectiveness of the competition ranks are due to government corruption and poorly owned state banks. Economy in Vietnam is continuously growing at a rate of 7% per year. In 2003, tourism was at 2.4 million and 2004 international arrivals increased to 2.9 million. Between 1994 and 2004 tourism rates rose by 63%. International tourism consists of 27% from China, 8-9% from U.S., Japan and South Korea each. The unemployment rate in 2004 was 5.6% compared to 6.0% in 2002. Exchange rates as of December 2005 is 15,913D(dong) per 1USD.&lt;ref name=&quot;locgov&quot;/&gt; 

===Health===
'''HEALTH:'''&lt;ref name=&quot;mundi&quot;/&gt;

'''Death rate''' (July 2009 est.)
5.98 deaths/1,000 population&lt;ref name=&quot;mundi&quot;/&gt; 

'''Infant mortality rate''' (2009 est.) 
male: 22.64 deaths/1,000 live births&lt;ref name=&quot;mundi&quot;/&gt;
female: 21.84 deaths/1,000 live births&lt;ref name=&quot;mundi&quot;/&gt; 
total: 22.26 deaths/1,000 live births&lt;ref name=&quot;mundi&quot;/&gt;

'''HIV/AIDS - adult prevalence rate''' (2007 est.) 
0.5%&lt;ref name=&quot;mundi&quot;/&gt; &lt;/br&gt;&lt;br&gt; 

'''HIV/AIDS - people living with HIV/AIDS''' (2007 est.) 
290,000&lt;ref name=&quot;mundi&quot;/&gt;&lt;/br&gt;&lt;br&gt;
 
'''HIV/AIDS - deaths''' (2007 est.) &lt;/br&gt;&lt;br&gt;
24,000&lt;ref name=&quot;mundi&quot;/&gt;&lt;/br&gt;&lt;br&gt;

'''Major infectious diseases'''(2009 est.)&lt;/br&gt;&lt;br&gt;
food or waterborne diseases: bacterial diarrhea, hepatitis A, and typhoid fever&lt;ref name=&quot;mundi&quot;/&gt; 
vectorborne diseases: dengue fever, malaria, Japanese encephalitis, and plague&lt;ref name=&quot;mundi&quot;/&gt;&lt;/br&gt;&lt;br&gt; 
water contact disease: leptospirosis&lt;ref name=&quot;mundi&quot;/&gt;&lt;/br&gt;&lt;br&gt; 
note: highly pathogenic H5N1 avian influenza has been identified in this country; it poses a negligible risk with extremely rare cases possible among US citizens who have close contact with birds&lt;ref name=&quot;mundi&quot;/&gt;&lt;/br&gt;&lt;br&gt;
degree of risk: high&lt;ref name=&quot;mundi&quot;/&gt;&lt;/br&gt;&lt;br&gt;

===Education===	

'''EDUCATION:'''
92% of eligble children were enrolled in primary education. Two out of every three of this 92% finished the fifth grade. Family income compared to tuition costs, books, uniforms, and transportation became less important than finding money to support members of the family so drop out rates were fairly high. However, location is also important. 96% of students in the city completed the fifth grade whereas students in the rural area are less fortunate and only 10-15% go pass the third grade. In the year 2000, 62.5% of students went into higher education. The Vietnam government however, is trying to make secondary education more easier to access.&lt;ref name=&quot;locgov&quot;/&gt; 

'''Literacy''' 
definition: age 15 and over can read and write 
total population: 94%&lt;ref name=&quot;mundi&quot;/&gt;
male: 95.8&amp;&lt;ref name=&quot;mundi&quot;/&gt;
female: 92.3%&lt;ref name=&quot;mundi&quot;/&gt;

'''School life expectancy (primary to tertiary education)''' (2000)&lt;/br&gt;&lt;br&gt;
total: 10 years&lt;ref name=&quot;mundi&quot;/&gt;&lt;/br&gt;&lt;br&gt; 
male: 11 years&lt;ref name=&quot;mundi&quot;/&gt;&lt;/br&gt;&lt;br&gt; 
female: 10 years&lt;ref name=&quot;mundi&quot;/&gt;&lt;/br&gt;&lt;br&gt; 
 
definition: age 15 and over can read and write
total population: 90.3%&lt;ref name=&quot;mundi&quot;/&gt;
male: 93.9%&lt;ref name=&quot;mundi&quot;/&gt;
female: 86.9% (2002 est.)&lt;ref name=&quot;mundi&quot;/&gt;

==Governance==


===Elections===


==Courts==
===Judicial Review===

==Courts and Criminal Law==
[http://vi.wikipedia.org/wiki/Pháp_luật (Pháp luật)]
===Punishment===
The death penalty exists in Vietnam ([http://vi.wikipedia.org/wiki/Tử_hình Tử hình])
===Legal Personnel===
===Law Enforcement===
===Crime Rates and Public Opinion===
{| class=&quot;wikitable&quot;
|-
| '''Rates of Key Crimes in '''
| bgcolor=&quot;#E4EDEE&quot; | Lie
| bgcolor=&quot;#E4EDEE&quot; | Theft
| bgcolor=&quot;#E4EDEE&quot; | Breach of Contract
| bgcolor=&quot;#E4EDEE&quot; | Assault
| bgcolor=&quot;#E4EDEE&quot; | Cheat
|}
&lt;br&gt;

==National/Foreign Law==
==Law of the Sea==

[http://vi.wikisource.org/wiki/Luật_Biển_Việt_Nam Luật Biển Việt Nam] in Vietnamese.

==Rights==
===Labor Relations===
====Labor Codes====
[http://vi.wikisource.org/wiki/Bộ_luật_Lao_động_nước_Cộng_hòa_xã_hội_chủ_nghĩa_Việt_Nam_2012 See: Bộ luật Lao động nước Cộng hòa xã hội chủ nghĩa Việt Nam 2012]&lt;br&gt;
The labor code is important to Vietnam. Where (foreign) criminal law has the presumption of innocence (to be be proven against with hard proof). The employee in Vietnam has the benefit of being upheld (not to be proven against without reasonable or hard proof). This is commonly discussed as the pro-employee rulings on labor issues. All employee contracts are expected to be in good standing order. Special statutory considerations for employees should be accounted for - even where employment contracts state otherwise. Judges will review workers' rights as a priority &lt;ref&gt; http://homepages.warwick.ac.uk/~syrbe/pubs/RightstoInterests.pdf&lt;/ref&gt;.

This is from traditional Asian culture and communist policy. Leadership orients the service (of employment). Employees that aren't opportunistic or willing to be new leaders are retained under proper treatment and rights. A disparity in wages is not necessarily an issue between leader and employees - indebtedness carries to the leader. Because of this culture, leaders can leave organizations with their main supporters. Therefore, protection of business-orientated intellectual-property is not a cultural priority. 

In the diaspora, alternative business cultures can exist &lt;ref&gt;http://english.molisa.gov.vn/news/viewdetail/tabid/339/newsid/55534/seo/Promoting-legal-empowerment-for-the-poor-and-vulnerable-people-in-Vietnam/language/en-US/Default.aspx&lt;/ref&gt;. Modern employment at foreign national organizations can obey international HR trends &lt;ref&gt;http://english.molisa.gov.vn/news/viewdetail/tabid/339/newsid/55548/seo/Mekong-province-aims-to-improve-human-resources/language/en-US/Default.aspx&lt;/ref&gt;.
 
See (Viet):[http://vi.wikipedia.org/wiki/Bộ_Lao_động_-_Thương_binh_và_Xã_hội Bộ Lao động - Thương binh và Xã hội]

===Family Law===
==Socialist Law==
See: [http://vi.wikisource.org/wiki/Luật_Công_đoàn_nước_Cộng_hòa_xã_hội_chủ_nghĩa_Việt_Nam_2012 Luật Công đoàn nước Cộng hòa xã hội chủ nghĩa Việt Nam 2012]

Social-rights laws are a category of law in Vietnam, which is more than a subcategory of law dealing with issues (for morals and rights).

===Human Rights===

==Works Cited==
&lt;references /&gt;


[[Category:Vietnam]]</text>
      <sha1>rlztlahhanbttfzksw2p83mp25fhjtq</sha1>
    </revision>
  </page>
  <page>
    <title>Idiopathic pulmonary fibrosis</title>
    <ns>0</ns>
    <id>104938</id>
    <revision>
      <id>2809887</id>
      <parentid>2741722</parentid>
      <timestamp>2026-05-17T10:18:41Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <comment>- prod</comment>
      <origin>2809887</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="2585" sha1="o7a5gayzst3aes2f2fqvvnimur3crwx" xml:space="preserve">Idiopathic pulmonary [[fibrosis]] (IPF) is a refractory and lethal interstitial lung disease characterized by alveolar epithelial cells apoptosis, fibroblast proliferation, and ECM protein deposition.  &lt;ref&gt;

http://ajplung.physiology.org/content/295/3/L451.long

&lt;/ref&gt;  [[Pulmonary fibrosis]] is a chronic disease that causes swelling and scarring of the alveoli (air sacs) and interstitial tissues (tissue between cells) of the lungs. Bacteria and other micro-organisms are not routinely found in the lungs of patients with idiopathic pulmonary fibrosis. On the other hand, the condition does sometimes appear to follow a viral-like illness &lt;ref&gt;

http://www.lung.ca/diseases-maladies/a-z/pfibrosis-fibrosep/index_e.php

&lt;/ref&gt;  particularly [[Epstein-Barr virus]] infection.  &lt;ref&gt;

http://ajplung.physiology.org/content/295/3/L451.long

&lt;/ref&gt;  The  6A(4) allele of the [[SPA1]] gene has been associated with an increased susceptibility to idiopathic pulmonary fibrosis in nonsmokers but not in smokers.  &lt;ref&gt;

http://www.ncbi.nlm.nih.gov/omim/178500

&lt;/ref&gt;


== quiz ==
&lt;quiz display=simple&gt;


{Idiopathic pulmonary fibrosis (IPF) is characterized by _________. 
|type=&quot;[]&quot;}
+ alveolar epithelial cells apoptosis, fibroblast proliferation, and ECM protein deposition
|| Correct! This is the exact characterization of IPF.
- swelling and scarring of the alveoli and interstitial tissues
|| Incorrect. This is a description of pulmonary fibrosis in general.
- presence of bacteria and other micro-organisms
|| Incorrect. Bacteria and other micro-organisms are not routinely found in IPF.
- viral-like illness
|| Incorrect. While IPF might follow a viral-like illness, it's not its characterization.

{Which virus is sometimes associated with the onset of IPF? 
|type=&quot;[]&quot;}
- Influenza virus
|| Incorrect. Review the information provided.
+ Epstein-Barr virus
|| Correct! Epstein-Barr virus infection is sometimes associated with IPF.
- Rhinovirus
|| Incorrect. Review the information provided.
- Coronavirus
|| Incorrect. Review the information provided.

{The 6A(4) allele of the SPA1 gene is associated with increased susceptibility to IPF in _________. 
|type=&quot;[]&quot;}
- both smokers and nonsmokers
|| Incorrect. Review the information provided.
+ nonsmokers but not in smokers
|| Correct! The 6A(4) allele of the SPA1 gene is associated with IPF in nonsmokers but not smokers.
- only smokers
|| Incorrect. Review the information provided.
- neither smokers nor nonsmokers
|| Incorrect. Review the information provided.

&lt;/quiz&gt;

==References==
&lt;references/&gt;

[[Category:Health]]</text>
      <sha1>o7a5gayzst3aes2f2fqvvnimur3crwx</sha1>
    </revision>
  </page>
  <page>
    <title>User talk:Atcovi</title>
    <ns>3</ns>
    <id>106891</id>
    <revision>
      <id>2809643</id>
      <parentid>2809577</parentid>
      <timestamp>2026-05-16T13:44:49Z</timestamp>
      <contributor>
        <username>Atcovi</username>
        <id>276019</id>
      </contributor>
      <comment>/* Please vote */ Reply</comment>
      <origin>2809643</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="2346" sha1="oiontfansprec2jj6c6xu9cuybw3rrv" xml:space="preserve">[[User:Atcovi/Archive 1|/Archive 1 (September 25, 2013 - November 15, 2013)]] • [[User talk:Atcovi/Archive 2|/Archive 2 (November 15, 2013 - November 27, 2013)]] • [[User talk:Atcovi/Archive 3|/Archive 3 (December 3, 2013 - December 25, 2013)]] • [[User talk:Atcovi/Archive 4|/Archive 4 (December 24, 2013 - January 1, 2014)]] • [[User talk:Atcovi/Archive 5|/Archive 5 (January 2, 2014 - January 20, 2014)]] • [[User talk:Atcovi/Archive 6|/Archive 6 (March 24, 2014 - April 14, 2014)]] • [[User talk:Atcovi/Archive 7|/Archive 7 (April 19, 2014 - September 8, 2014)]] • [[User talk:Atcovi/Archive 8|/Archive 8 (September 12, 2014 - November 3, 2014)]] • [[User talk:Atcovi/Archive 9|/Archive 9 (November 6, 2014 - January 26, 2015)]] • [[User talk:Atcovi/Archive 10|/Archive 10 (January 28, 2015 - March 11, 2015)]] • [[User talk:Atcovi/Archive 11|/Archive 11 (March 22, 2015 - June 25, 2016)]] • [[User talk:Atcovi/Archive 12 (June 26, 2016 - January 8, 2018)|/Archive 12 (June 26, 2016 - January 8, 2018)]] • [[User talk:Atcovi/Archive 13 (January 9, 2018 - April 14, 2023)|/Archive 13 (January 9, 2018 - April 14, 2023)]] • [[User talk:Atcovi/Archive 14 (April 15, 2023 - May 5, 2026)|/Archive 14 (April 15, 2023 - May 5, 2026)]]

:''Before 2013: [https://en.wikiversity.org/w/index.php?title=User_talk:Atcovi&amp;diff=750617&amp;oldid=740650 see this]'' 
{{tmbox
|small = 
|image = [[Image:Busy desk.svg|{{#ifeq:|yes|40px|75x50px}}]]
|text = This user is busy in [http://en.wikipedia.org/wiki/Real_life Real Life] {{#if:|until&amp;nbsp;{{{end}}}&amp;nbsp;}}{{#if:|due to&amp;nbsp;{{{reason}}}&amp;nbsp;}}and may not respond swiftly to queries.{{#if:|&lt;P&gt;{{{msg}}} }} 
| style     = {{#if:|width: {{{width}}}px;}} {{#ifeq:{{{shadow}}}|yes|{{box-shadow|0px|2px|4px|rgba(0,0,0,0.2)}}|}}
}}

== Please vote ==

on Wikinews rebirth possibly on Wikiversity, thanks @[[User:Atcovi|Atcovi]] [[User:BigKrow|BigKrow]] ([[User talk:BigKrow|discuss]] • [[Special:Contributions/BigKrow|contribs]]) 22:21, 15 May 2026 (UTC)

:Hi BigKrow. I've been watching the discussion on the sidelines. Hopefully I'll have an input soon, I just have other commitments I'm catering to. Best of luck with your projects and welcome to Wikiversity! —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 13:44, 16 May 2026 (UTC)</text>
      <sha1>oiontfansprec2jj6c6xu9cuybw3rrv</sha1>
    </revision>
  </page>
  <page>
    <title>Motivation and emotion/Book/2011/Nature and psychological well-being</title>
    <ns>0</ns>
    <id>117394</id>
    <revision>
      <id>2809894</id>
      <parentid>2795582</parentid>
      <timestamp>2026-05-17T10:27:27Z</timestamp>
      <contributor>
        <username>MathXplore</username>
        <id>2888076</id>
      </contributor>
      <minor />
      <comment>Reverted edit by [[Special:Contributions/~2026-14897-25|~2026-14897-25]] ([[User_talk:~2026-14897-25|talk]]) to last version by [[User:Dave Braunschweig|Dave Braunschweig]] using [[Wikiversity:Rollback|rollback]]</comment>
      <origin>1856293</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="32561" sha1="dzgrmgqqzgpartzmc6r3bx9mzm55jme" xml:space="preserve">{{title|Nature and psychological well-being:&lt;br&gt;How to use nature to make you happy and improve your life}}
{{MECR|1=http://www.youtube.com/watch?v=Kexgk_aah5o&amp;}}
{{TOCright}}

==Overview==

[[File:Sunset Hopping.jpg|200px|left]]

[[File:In the evening sun.jpg|200px|right]]

[[File:Grass of Happiness.jpg|thumb|200px|left|Happy in nature]]

Underpinning most of what is discussed in this chapter is the evolutionary explanations of [[w:Emotion|emotions]], the [[w:Biophilia_hypothesis|Biophilia Hypothesis]] and the way nature plays an important role in our psychological well-being. 

The focus of this chapter is to learn lessons from the research into  [[#Environmental_aesthetics|environmental aesthetics]], [[#Restorative_Environment_.26_Attention_Restoration_Theory|the restorative environment]], [[#Restorative_Environment_.26_Attention_Restoration_Theory|attention restoration theory]] and [[#Nature_Deficit_Disorder |nature deficit disorder]] to help us improve our lives. [[#Seasonal_Affective_Disorder |Seasonal affective disorder]] and [[#Green_exercise|green exercise]] are discussed because of their relevance to mental illness and [[#Miscellaneous_tips_on_how_to_use_nature_to_improve_your_life|miscellaneous tips]] for improving our psychological well-being are given at the end.

Keep an eye out for the light green boxes which show research based on the theories covered. Look for the heading [[#Miscellaneous_tips_on_how_to_use_nature_to_improve_your_life|&quot;use nature to improve your life&quot;]] for tips based on both the theories and the research.

==Evolution and emotions==
People are motivated to behave in ways that have made them happy in the past and avoid behaviours which have led to them being sad (Nesse, 1989). Nesse (1989) suggests that from an evolutionary point of view, it is most useful for a person to conserve energy when the outcome is unlikely to be a good one but to use all energy stores when the effort will result in good consequences.

{| cellpadding=&quot;10&quot; cellspacing=&quot;5&quot; style=&quot;width: 100%; background-color: ForrestGreen; margin-left: auto; margin-right: auto&quot;
| style=&quot;width: 30%; background-color:Wheat; border: 3px solid YellowGreen; vertical-align: top; -moz-border-radius-topleft: 10px; -moz-border-radius-bottomleft: 10px; -moz-border-radius-topright: 10px; -moz-border-radius-bottomright: 10px;&quot; &lt;!--rowspan=&quot;2&quot;--&gt; |&lt;div style=&quot;text-align: center&quot;&gt;&lt;p style =&quot;line-height:20px;&quot;&gt;&lt;big&gt;“Emotions are specialized modes of operation shaped by natural selection to adjust the physiological, psychological, and behavioural parameters of the organism in ways that increase its capacity and tendency to respond adaptively to the threats and opportunities characteristic of specific kinds of situations.” Nesse (1989, p. 268)&lt;/big&gt; 
&lt;br&gt;&lt;/p&gt;&lt;/div&gt;
|}

==Biophilia hypothesis==

{| cellpadding=&quot;10&quot; cellspacing=&quot;5&quot; style=&quot;width:20%; background-color: ForrestGreen; margin-left: left; margin-right: auto&quot;
| style=&quot;width: 40%; background-color:Wheat; border: 3px solid YellowGreen; vertical-align: top; -moz-border-radius-topleft: 10px; -moz-border-radius-bottomleft: 10px; -moz-border-radius-topright: 10px; -moz-border-radius-bottomright: 10px;&quot; &lt;!--rowspan=&quot;2&quot;--&gt; |&lt;div style=&quot;text-align: center&quot;&gt;&lt;p style =&quot;line-height:20px;&quot;&gt;&lt;big&gt;'''Please do this before reading on about the Biophilia Hypothesis'''&lt;/big&gt;
Which picture from each pair do you prefer?&lt;/p&gt;
&lt;div style=&quot;column-count:3;-moz-column-count:3;-webkit-column-count:3&quot;&gt;
&lt;quiz display=simple&gt;
{ 1st Pair 
|type=&quot;[]&quot;}
+ [[Image:Field Hamois Belgium Luc Viatour.jpg|200px]]
- [[Image:Wasteland - geograph.org.uk - 417442.jpg|200px]]

{ 2nd Pair
|type=&quot;[]&quot;}
+ [[Image:Pachaug Trail - Porter Pond, Sterling, CT.jpg|200px]]
- [[Image:EAP-lobby-sw.jpg|200px]]

{ 3rd Pair
|type=&quot;[]&quot;}

- [[Image:Stahlbau Pichler Maciachini Mailand.jpg|200px]]
+ [[Image:41 Cherry Orchard Road.JPG|200px]]
&lt;/quiz&gt;
&lt;/div&gt;
This quiz examines preferences and introduces the topic. There are no right or wrong answers.
&lt;/div&gt;
|}

You may be asking, what has [[w:Evolution|evolution]] and emotion have to do with nature?  We are beings with a fundamental need and desire to be affiliated with nature, according to the [[w:Biophilia_hypothesis |Biophilia Hypothesis]] (Khan, 1997; Wilson, 1984). This desire stems from our ancient history where we depended on the land and lived at the mercy of Mother Nature for almost 2 million years on the East African savannahs (Kahn, 1997). Observing the landscape to find bodies of water and food sources while keeping an eye out for predators was a part of daily life and is still ingrained in our subconscious minds.

Psychological research has found that people have a preference for natural environments and built environments with natural features over built environments without natural features (Kaplan &amp; Kaplan, 1989). This will be discussed further in environmental aesthetics and attention restoration theory, as they are both related to our general preference for natural environments and the benefits of nature to our well-being. 

The [[w:Biophilia_hypothesis|biophilia hypothesis]] suggests that the long history between humans and nature shaped our cognitions and emotions in a way that the modern human is now wired for an appreciation and evaluation of natural environments (Gullone, 2000). Those humans who had a genotype best for making behavioural responses most likely to enhance survival and reproduction were kept in the population through natural selection (Gullone, 2000). Behaviours in response to natural stimulation are either approach or avoidance behaviours. These adaptive behaviours are called biophilia and biophobia. Biophilia is the approach behaviour towards natural environments judge as fit for survival. Biophobia is the aversion and avoidance of potential dangers such as spiders, snakes and bears (Gullone, 2000). These behaviours are inherited from one generation to another and even when humans stopped living in a natural environment these rules, behaviours and stimuli responses did not disappear.

'''Use nature to improve your life'''

There is quite obviously a gap between today’s 21st century living habitats and that of our ancient ancestors. It has been suggested that reducing this gap and using the natural environmental is a good way to improve our psychological well-being and the quality of life (Buss, 2000). Being in touch with nature is one way to make you happy. It has been recommended that the differences between modern and ancestral living conditions be minimised and a [[w:Paleolithic_lifestyle|Paleolithic lifestyle]] to be taken up to increase psychological well-being (Buss, 2000). It is also recommended to develop deeper friendships rather than fair weather friends which reflects the society of our ancestors (Buss, 2000). These are some examples of how to keep ourselves close to our evolutionary roots and minimise the gap between now and then.

== Environmental aesthetics==
[[File:GoldenMedows.jpg|thumb|left|200px|Aesthetically Pleasing]]

Environmental preference studies aim to determine the aesthetic value of a given stimuli using questionnaires, images and physical environments (Galindo &amp; Rodriguez, 2000). There are various questionnaires that have been employed to measure the various components of environmental aesthetics. Descriptive scales have been used for describing the physical attributes in an environment or image. Affective scales measure moods and reactions to the stimuli. Appraisal scales indicate the aesthetic value of the settings (Galindo &amp; Rodriguez, 2000). Many studies have concluded that people prefer park-like settings with short grass, mature trees and water (Balling &amp; Falk, 1982). This indicates that we are inherently predisposed to judge [[w:Savanna|savannah]] like environments as more aesthetically pleasing than others. Such results support the biophilia hypothesis. 

The work of Daniel E. Berlyne explores the scientific study of aesthetic behaviour with a specific focus on the “appreciator” of the creation being viewed. His theory is developed in the evolutionist framework. He suggests that aesthetics play an important function in the survival of the human species. It is beneficial for humans to have an ability to detect aesthetically pleasing environments than to lack the ability. Natural selection would theoretically reduce the number of people in the population who did not possess these necessary abilities.  

The work of [[w:Rachel_and_Stephen_Kaplan|Rachel and Stephen Kaplan]] builds on that of Berlyne. Kaplan and Kaplan were concerned with the basic cognitive needs that people have with regard to their physical environments (Kaplan &amp; Kaplan, 1989). These needs include the need to make sense of the environment and its features while extracting useful information. The second is the need to be involved in the environment (Galindo &amp; Rodriguez, 2000). Environments that meet these needs generate responses of attraction and aesthetic preference in all individuals studied (Kaplan &amp; Kaplan, 1989). An [[w:Evolutionist|evolutionist]] would say that avoiding environments that don't meet needs while approaching those which do, is a desirable and adaptive ability (Galindo &amp; Rodriguez, 2000).

{{RoundBoxTop|theme=9}}
&lt;big&gt;Aesthetics, Pleasure and Arousal: Galindo &amp; Rodriguez, 2000&lt;/big&gt;

{|border=&quot;1&quot; cellpadding=&quot;5&quot; cellspacing=&quot;0&quot; align=&quot;right&quot;
|-
! scope=&quot;col&quot; style=&quot;background:#F5DEB3;&quot; | 
! scope=&quot;col&quot; style=&quot;background:#9ACD32;&quot; | High Pleasure
! scope=&quot;col&quot; style=&quot;background:#9ACD32;&quot; | Low Pleasure
|-
! scope=&quot;row&quot; style=&quot;background:#9ACD32;&quot; | High Arousal 
| Exciting || Distress
|-
! scope=&quot;row&quot; style=&quot;background:#9ACD32;&quot; | Low Arousal 
|| Tranquillity|| Boring
|}
 
Two independent and bipolar dimensions, pleasure and arousal, are used to describe the moods and affective responses that a person feels when observing an environment (Galindo &amp; Rodriguez, 2000). The table  demonstrates the four possible outcomes of when the two dimensions are low or high. 

The Galindo and Rodriguez (2000) study investigated the relationship between aesthetic judgements and affective responses/psychological well-being.  Aesthetic appraisal responses were closely associated with arousal and pleasure, indicating that there is a relationship between environmental aesthetics and mood. 
{{RoundBoxBottom}}

'''Use nature to improve your life''' 

This knowledge of human’s preferences for nature over human-made environments has many applications. For example, in a hospital ward there was a high sick-leave rate in staff before the installation of full spectrum daylight bulbs and green plants in 80m&lt;sup&gt;2&lt;/sup&gt; on the premises. After the environmental aesthetic changes were made, there was a 32% reduction in tiredness, 25% drop in the sick-leave rate, 45% less headaches and 31% reduction in sore throats (Fjeld, 1998a, b). Are you a manager or boss in a company where you would like to reduce the sick-leave rate? How about investing in some green plants and [[w:Full-spectrum_light|full-spectrum]] daylight bulbs for the workplace and watch the way your employees react?

==Restorative environment &amp; Attention Restoration Theory==

Mental fatigue is the feeling of being worn out after working too hard for too long and feeling the need for a well-earned break. Everybody has experienced mental fatigue at some point, but it is interesting to note that you can feel mentally fatigued from working hard on projects you enjoy (Kaplan &amp; Kaplan, 1989). Mental fatigue is often accompanied with the inability to focus and keep our attention on the project we are working on, instead distraction takes place and our minds wander. 

William James (1892) suggested that there are two types of attention; directed and involuntary.  Involuntary attention is the type that doesn’t require any effort and is often used when there is something interesting to look at (Kaplan &amp; Kaplan, 1989). Directed attention on the other hand is that which requires effort and drains our minds, such as a work project or an essay (Kaplan &amp; Kaplan, 1989). Sleep can provide relief from this mental fatigue but the restorative experience is often more convenient. 

The restoration experience involves restoring our stores of directed attention while increasing our mental well-being by using involuntary attention. We can then return refreshed to do those things that need to be done.  Attention Restoration Theory (Kaplan &amp; Kaplan, 1989) proposes that a restorative experience involves four components. These are being away, the extent to which it feels like being in another ‘world’, fascination, and compatibility.

[[File:Vrijbroekpark - by frank wouters.jpg|thumb|left|Restorative Experience]]

'''Use nature to improve your life''' 

'''Being away'''

Being away involves stopping mental effort and directed attention, escaping from distractions and from the work that is normally done. One does not need to be a long way from the workplace to escape from these things. An environment need only be distinctive and separate from the workplace. Perhaps you could try escaping to the nearby park during the lunch break to your eat lunch and while you are there, watch the birds and animals in the park?

'''Extent of other worldliness'''

The extent to which the environment is different to your usual place is important because without the distinctiveness it will not be a restorative experience. A place that can be described as a ‘whole other world’ is an important property of the environment to which you escape to. A garden where there is more to explore and see in the garden than what one sees at first sight is another important part of extent. Kaplan and Kaplan (1989) suggest that Japanese gardens are the best for this as the miniature effect creates a sense of distinctiveness and uniqueness. If you are in the process of landscaping, consider a garden that encourages exploration using hidden features and overgrown pathways.

'''Fascination'''

Fascination is the next key to the restorative experience to help you regain mental well-being. Fascination involves involuntary attention and therefore keeps the person from getting bored but also there is no effort needed for attention to take place. Wild animals, sunsets, waterfalls, caves, fires, stars, clouds can all grab our involuntary and effortless attention if we let them and are called soft fascinations. They should not hold our attention for too long (otherwise they become too distracting to pull ourselves out) and they should be aesthetically pleasing. Go and watch the clouds go by on a day when you’ve had enough of work. At night watch the stars in your backyard. These forms of soft fascinations will allow your directed attention to have a break and its stores to refill while your involuntary attention takes over for a while.

'''Compatibility'''

Compatibility and relatedness come back to the evolutionary perspective and the biophilia hypothesis. That is, that on an innate and inherited level we as humans prefer natural environments to human-made environments and we feel a sense of awe and wonder when in its presence. Relatedness and compatibility can occur in these natural environments. Psychological well-being occurs when we are in a compatible environment. Being in an incompatible environment requires a lot of effort and attention. Next time you are finding it hard to read a difficult text due to distractions at work, head to a park bench and immerse yourself in a compatible restorative environment. 

{{RoundBoxTop|theme=9}}
&lt;big&gt;Restorative environments through a hospital window (Ulrich, 1984)&lt;/big&gt;

The recovery records of 46 cholecystectomy (gall bladder surgery) patients from a Pennsylvania hospital were examined. The aim was to explore the difference in recovery rates of those with a window facing a brick wall and those who had a view of foliage. The patients were grouped into 23 pairs based on sex, age, smoking habits, and weight and floor level. Results for the months between 1st of May and October 20th for the years 1972 to 1981 were used, because as during these months the trees had foliage. The length of hospitalisation for those with a tree-view was 7.96 days while those with a view of a brick wall stayed in for 8.70 days. Nurses’ notes on the wall-view patients indicated that they were in a more negative mood than those in the tree-view room, although it was not statistically significant. Those in the tree-view room took fewer moderate to strong pain killers than the wall-view patients in the 2-5 days after surgery.  Ulrich noted that the brick wall view was quite hideous and boring. He suggests that a view of another built environment, such as a busy street, may produce different results because the patient is more stimulated. The results of the 1984 study suggest that natural environments do indeed provide a restorative environment which improves both physical and mental well-being. 
{{RoundBoxBottom}}

==Nature Deficit Disorder==

[[File:Eye to Eye.jpg|thumb|left|Children with Nature]]

Author of “[[w:Last_Child_in_the_Woods|Last Child In the Woods]]”, [[w:Richard Louv| Richard Louv]] has suggested that the children of today’s society are missing out on vital interaction with nature. [[w:Nature deficit disorder|Nature Deficit Disorder]], as Louv puts it, is the cause of the rise in obesity, attention disorders and depression. Nature Deficit Disorder is not recognised as an official disorder, however many of the points Louv raises relate to the current chapter. The book is recommended for parents who are worried about the health of their children and their lack of direct exposure to nature. 

The main features of Louv’s Nature Deficit Disorder theory are based around the relationship between children and nature. He suggests that there is a new relationship between child and nature in which children do not interact with the natural world as much as they should. Secondly, he suggests that we all need direct exposure to nature in our lives and without it mental fatigue, irritability and agitation creep in.  Thirdly, Louv suggests that busy schedules and fear keep our children from enjoying nature. Thankfully his book “[[w:Last_Child_in_the_Woods|Last Child In the Woods]]” also provides ways to reunite children and nature (see tips for more).

Please keep in mind that this disorder is currently not in the [[w:Diagnostic_and_Statistical_Manual_of_Mental_Disorders |DSM]] and therefore not accepted by general psychiatry. Further research and theory development is needed before acceptance as a mental disorder. 

{{RoundBoxTop|theme=9}}

&lt;big&gt;Vegetation and children: Wells and Evans (2003)&lt;/big&gt;

Wells and Evans collected data from 337 rural children from five small towns in upstate New York. They were in grades 3 to 5 with an average age just over nine years. Parents reported the psychological distress shown by their children on the Rutter Child Behaviour Questionnaire. Children provided their own ratings of global self-worth on the Harter Competency Scale. The authors explored the impact of nearby nature on children subject to a stressful life event. To assess the frequency of stressful life events, the Lewis Stressful Life Events Scale was used.

As expected, exposure to stressful life events correlated with psychological distress. Secondly, nearby nature was found to be a moderator between stressful life events and psychological distress.  There was a large difference between the psychological distress of children who had low exposure to nature and those who had high exposure to nature. Those with high exposure to nature had less distress than those with low exposure to nature even though they had the same levels of stressful life events. The effect was particularly large when there were high levels of stressful life events.  
{{RoundBoxBottom}}

'''Use nature to improve your life''' 

Children who experience high levels of stressful life events would benefit from living nearby nature. If this is not an option, consider investing in a veggie patch or building a cubby house in your backyard. Whether you believe your child is distressed or not, encourage your children to be active in the outdoors. If you have a busy schedule, consider allocating time to throwing a ball around outside with your child. It will be good for you as well as your child!

== Seasonal Affective Disorder ==

[[File:Schneelandschaft Furx.JPG|thumb|A winter without Sun]]

Biological changes occur on a continuum throughout the year and while many people may feel lethargic and irritable in the colder and darker months of the year (Eagles, 2003), on the extreme end of this continuum is [[w:Seasonal_affective_disorder|Seasonal Affective Disorder]] which impairs the functioning of those who suffer with it.

Seasonal Affective Disorder (SAD) is a disorder in the [[w:Diagnostic_and_Statistical_Manual_of_Mental_Disorders|DSM-IV]] that presents as major depression with a seasonal pattern (Targum &amp; Rosenthal, 2008). People with SAD slow down and lose energy in the darker months of the year and often have trouble waking in the morning. There can also be problems with concentration and weight gain which can be caused from excessive eating of sweets and other starchy foods (Targum &amp; Rosenthal, 2008).

SAD is most common in the winter months where there is relatively little sun (Rosenthal, 2009). Severe SAD can cause major depressive symptoms on cloudy days (Targum &amp; Rosenthal, 2008). Research has suggested that patients with SAD can have more severe symptoms than clients with non-seasonal major depression who have attempted suicide (Pendse, Engstroem &amp; Traeskman-Bendz, 2004). Treatment is necessary for those who have SAD.

{{RoundBoxTop|theme=9}}
&lt;big&gt;Melatonin, Bright Light Therapy and Dawn Simulation: Avery et al, 2001; Terman et al, 2001.&lt;/big&gt; 

[[w:Melatonin|Melatonin]] is a natural hormone which is used by all mammals to indicate that darkness is approaching and that it is time for rest. Research has suggested that the longer hours of darkness cause an imbalance to the melatonin rhythm and this is why people become more lethargic in the darker months (Brown, Pandi-Perumal, Trakht &amp; Cardinali, 2010).

Bright light therapy and dawn simulation both attempt to fix the melatonin imbalance and rhythm and restore proper sleep and mood ((Avery, Eder, Bolte, Hellekson, Dunner, Vitiell &amp; Prinz, 2001; Terman, Terman &amp; Cooper, 2001). To help reset the melatonin rhythm, bright light treatment is best administered in the morning eight and a half hours after melatonin onset(Terman et al., 2001). Bright light therapy has been criticised for the inconvenience caused to the patient.

Dawn simulation has been suggested as a better for the treatment of SAD (Avery et al, 2001). Dawn simulation is the use of dim lights slowly increasing in intensity until the patient wakes up and simulates the rising of the sun in the morning (Avery et al., 2001). Compliance of the patient is greater with dawn simulation than bright light therapy because it saves time and is very convenient (Avery et al., 2001).
{{RoundBoxBottom}}
'''Use nature to improve your life''' 

Having knowledge of SAD can help you identify if this applies to you and what natural light treatments are available. Read &quot;Winter Blues: Everything You Need to Know to Beat Seasonal Affective Disorder&quot; by [[w:Norman_E._Rosenthal|Norman Rosenthal]] for more information. You should consult your doctor or psychologist for further information and diagnosis of SAD.

==Green exercise==
[[File:What is green exercise.svg|thumb|left|Table 1. ''Components of Green Exercise'']] 

Physical activity and exposure to nature both have positive effects on psychological well-being and physical health (Pretty, Peacock, Sellens &amp; Griffin, 2005). Table 1 shows the components that define [[w:Green_exercise|green exercise]]. Combining physical exercise and exposure to nature it termed green exercise and may promote even better physical and mental health than either one alone. [[Green_exercise]] incorporates environmental aesthetics and restorative environments. Engagement with nature can be seen on three levels (Mackay &amp; Neill, 2010): viewing nature, being in the presence of nature, and being involved in nature. Green exercise is about being involved in nature. Gardening, jogging outdoors, watersports and mountain biking can be considered as green exercise. 

{{RoundBoxTop|theme=9}}
&lt;big&gt;Exercise and projected scenes: Pretty et al. 2005&lt;/big&gt;

{| border=&quot;1&quot; cellpadding=&quot;5&quot; cellspacing=&quot;0&quot; align=&quot;right&quot;
|-
! scope=&quot;col&quot; style=&quot;background:#9ACD32;&quot;|Condition
! scope=&quot;col&quot; style=&quot;background:#9ACD32;&quot;|Example
|-
!scope=&quot;col&quot; style=&quot;background:#F5DEB3;&quot; | Control
| No Image 
|-
!scope=&quot;col&quot; style=&quot;background:#F5DEB3;&quot; |Rural Pleasant
| Trees, fields etc 
|-
!scope=&quot;col&quot; style=&quot;background:#F5DEB3;&quot; |Urban Pleasant
| Cityscape with natural features ie city parks
|-
!scope=&quot;col&quot; style=&quot;background:#F5DEB3;&quot; |Rural Unpleasant
| Broken down cars in the bush etc
|-
!scope=&quot;col&quot; style=&quot;background:#F5DEB3;&quot; |Urban Unpleasant
| Broken windows, wire fencing etc 
|-
|}

There were five conditions with 20 participants. In four of the conditions 30 scenes were projected onto a wall whilst the participants exercised on a treadmill.  Blood pressure, self-esteem and mood were measured before and after the exercise. 

Results indicated that in the control group exercise reduced blood pressure and improved self-esteem and mood. When exercise was paired with pleasant scenes the mood and self-esteem of participants was higher than in other conditions. Unpleasant scenes when paired with exercise reduced the effect of exercise on self-esteem and self-esteem was lower in these conditions.
{{RoundBoxBottom}}

'''Use nature to improve your life'''
[[File:Mountain bike ParcoSibillini.jpg|thumb|Green exercise]]

Next time you hop on your treadmill, consider facing it towards a window where you can see outside. Or go one step further and go for a jog outside, go hiking or go canoeing on the local lake. Being motivated to exercise can be hard, so check out the [[Motivation and emotion/Book/Exercise motivation|Exercise Motivation chapter]] for some tips.

== Miscellaneous tips on how to use nature to improve your life==

* Give flowers to a woman. When you do she will produce a [[w:Smile#Duchenne smiling|Duchenne smile]] and will be in a more positive mood for 3 days. (Haviland-Jones, Rosario, Wilson &amp; McGuire, 2005). 
* Make your backyard into a habitat for native flora and fauna. Build a bird bath and plant natives (requires less watering than non-natives and they look great).
* Go hiking and camping. Light a fire and star gaze at night (please check local fire bans beforehand).  
* Be in nature and be aware of your senses. Listen, smell, touch and watch (Louv, 2008). Try the [http://wilderdom.com/games/descriptions/SensualAwarenessInventory.html Sensual Awareness Inventory] for this activity.
* Plant a veggie garden. Good for saving money on produce. Great for the kids to see where their food comes from and be involved in the process (Louv, 2008).

==Summary==
Lessons about nature and psychological well-being can be learnt from the research and theories of environmental and evolutionary schools of psychology.  This chapter was written to help you realise that nature plays a vital role in our psychological well-being.  You now know that: 
* You can use restorative environments to reduce mental fatigue. (Attention Restoration Theory) 
* Being in touch with nature and our ancestral roots can improve your life. (Environmental Aesthetics &amp; Biophilia Hypothesis)
* Children need nature for their mental health. (Nature Deficit Disorder) 
* Emotions can be dramatically affected by the change of seasons. (Seasonal Affective Disorder)
* Combining exercise with nature is best. (Green exercise) 

The take away message from the chapter is this: '''go outdoors and use nature to improve your life'''.

==See also==
* [http://www.acfonline.org.au/news-media/acf-opinion/ten-reasons-why-we-need-more-contact-nature Ten reasons why we need more contact with nature] 
* [[Motivation and emotion/Book/Animals and emotion|Animals and emotion: How connection with animals can improve emotion and well-being]] 
* [[Motivation and emotion/Book/Weather and emotion | Weather and Emotion: How the weather effects our emotions]]
* [[/Transcript/|Transcript for the 5 minute audiovisual chapter overview]]

== References ==
{{Hanging indent|
Avery, D.H., Eder, D.N., Bolte, M.A., Hellekson, C.J, Dunner,D.L., Vitiello, M.V., &amp; Prinz, P.N. (2001). Dawn simulation and bright light in the treatment of sad: A controlled study. ''Society of Biological Psychiatry'', ''50'', 205-216.

Balling, J.D. &amp; Falk, J.H. (1982). Development of visual preference for natural environments. ''Environment and Behaviour'', ''14''(1), 5-28. 

Brown, G.M., Pandi-Perumal, S.R., Trakht &amp; Cardinali,. (2010). The role of melatonin in seasonal affective disorder. In T. Partonen, &amp; S.R Pandi-Perumal (Eds.), ''Seasonal Affective Disorder: Practice and research'' (pp. 149-162). New York, NY: Oxford University Press.

Buss, D.M. (2000). The evolution of happiness. ''American Psychologist'', ''55''(1), 15-23. 

Eagles, J.M. (2003). Seasonal affective disorder. ''The British Journal of Psychiatry'', ''182'', 174-176.

Fjeld, T. (1998a). Plants in interior surroundings—a source to health. ''gartneryrket 13''(15). 

Fjeld, T. (1998b). Plants; Light; Interior and health. ''research report. the norwegian radium hospital Olso''

Galindo, P. &amp; Rodriguez, J.A. (2000). Environmental aesthetics and psychological well-being: Relationships between preferences judgements for urban landscapes and other relevant affective responses. ''Psychology in Spain, 4'' (1), 13-27.

Gullone, E. (2000). The biophilia hypothesis and life in the 21st century: Increasing mental health or increasing pathology?. ''Journal of Happiness Studies, 1'', 293-321.

Haviland-Jones, J., Rosario, H.H., Wilson, P., &amp; McGuire, T.R. (2005). An environmental approach ot positive emotion: Flowers. ''Evolutionary Psychology, 3,''  104-132. 

James, W. (1892). ''Psychology: The briefer course''. New York: Holt.  

Kaplan, R. &amp; Kaplan, S. (1989). ''The experience of nature: A psychological perspective.'' Cambridge: Cambridge University Press. 

Khan, P.H. (1997). Developmental psychology and the biophilia hypothesis: Children’s affiliation with nature. ''Developmental Review, 17,'' 1-61.

Louv, R. (2008). ''Last Child in the Woods: Saving our children from nature-deficit disorder.'' Chapel Hill, NC: Algonoquin Books.

Mackay, G.J. &amp; Neill, J.T. (2010). The effect of green exercise on state anxiety and the role of exercise duration, intensity and greenness: a quasi-experimental study. ''Psychology of Sport and Exercise, 11,'' 238-245.

Nesse, R.M. (1989). Evolutionary explanations of emotions. ''Human Nature, 1'' (3). 261-289.

Pendse, B.P., Engstroem, G., &amp; Traeskman-Bendz, L. (2004) Psychopathology of seasonal affective disorder patients in comparison with major depression patients who have attempted suicide. ''Journal of Clinical Psychiatry 65'', 322–327.

Pretty, J.,  Peacock, J., Sellens, M., &amp; Griffin, M. (2005). The mental and physical health outcomes of green exercise. ''International Journal of Environmental Health Research, 15'' (5). 319-337.

Rosenthal, N. (2009). Issues for DSM-V: Seasonal affective disorder and seasonality. ''American Journal of Psychiatry, 166'' (8), 52-53.

Targum, S.D. &amp; Rosenthal, N. (2008). Research to practice; Seasonal affective disorder. ''Psychiatry'', May,31-33.

Terman, J., Terman, M., Lo, E., &amp; Cooper, T. (2001). Circadian time of morning light administration and therapeutic response in winter depression. ''Archives of General Psychiatry, 58,'' 69-75.

Ulrich, R.S. (1984). View through a window may influence recovery from surgery. ''Science, 224.'' 420-421.  

Wells, N.M. &amp; Evans, G.W. (2003). Nearby nature: A buffer of life stress among rural children. ''Environment and Behaviour, 35''(3), 311-330. 

Wilson, E. O. (1984). ''Biophilia''. Cambridge: Harvard University Press.}}

==External links==

* [http://www.thehappinessinstitute.com/blog/article.aspx?c=3&amp;a=1987 The Happiness Institute: Happiness and Nature]
* [http://ecco.vub.ac.be/?q=node/127 Evolutionary Well-Being: the paleolithic model]

[[Category:Motivation and emotion/Book/2011]]
[[Category:Motivation and emotion/Book/Nature]]</text>
      <sha1>dzgrmgqqzgpartzmc6r3bx9mzm55jme</sha1>
    </revision>
  </page>
  <page>
    <title>The necessities in Digital Design</title>
    <ns>0</ns>
    <id>119422</id>
    <revision>
      <id>2809790</id>
      <parentid>2807828</parentid>
      <timestamp>2026-05-17T01:05:31Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>/*  Timing Analysis  */</comment>
      <origin>2809790</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="9835" sha1="q0bw02l0wtcgfj1rd3lr9y3ag1utmmp" xml:space="preserve">
== ''' Number Systems '''== 

=== ''' Binary Representation '''=== 
* Binary Numbers ([[Media:DD1.1.A.BinaryNum.20130918.pdf|A.pdf]])
* Hexadecimal Numbers ([[Media:DD1.2.A.HexaNum.20130918.pdf|A.pdf]])
* Other Codes ([[Media:DD1.3A.Code.20250329.pdf|A.pdf]])

=== ''' Binary Arithmetic '''=== 
* Binary Arithmetic ([[Media:DD1.4.A.BinaryArith.20150425.pdf|A.pdf]])
* BCD Arithmetic ([[Media:DD1.5.A.BCDArith.20130918.pdf|A.pdf]])

=== ''' C Program Examples '''=== 
* Binary Numbers in C programs ([[Media:DD1.6.A.BNumInC.20140103.pdf|A.pdf]])
* Binary Addition in C programs ([[Media:DD1.7.A.BArithInC.20140103.pdf|A.pdf]])
&lt;/br&gt;

* Helpful Wikipedia Pages ([[Media:DD.WP.NumberSystem.20130309.pdf|C.pdf]])
&lt;/br&gt;

=== ''' Floating Point Numbers '''=== 

* Floating Point Representations  ([[Media:CDesign.5.A.FPoint.20140121.pdf|5A.pdf]])&lt;/br&gt;
:: See [http://www.iro.umontreal.ca/~aboulham/F1214/Session%206Arithm/Floating_Point_Numbers.pdf Floating Point Overview]
:: See [http://www.cs.auckland.ac.nz/~patrice/210-2006/210%20LN04_2.pdf Offset Binary Overview]
:: See [http://www.intersil.com/content/dam/Intersil/documents/an96/an9657.pdf Offset Binary &amp; Sin / Cosine]
:: See [http://www.ee.ic.ac.uk/hp/staff/dmb/courses/dig2/4_Analog.pdf Offset Binary &amp; ADC / DAC]
&lt;/br&gt;

=== ''' Interfacing Digital and Analog Signals '''=== 
* Sampling and Quantization   ([[Media:DD1.10.A.SampleQuant.20150425.pdf|A.pdf]])
* Digital-to-Analog Conversion  ([[Media:DD1.8.A.DAC.20140208.pdf|A.pdf]])
* Analog-to-Digital Conversion ([[Media:DD1.9.A.DAC.20140208.pdf|A.pdf]])
&lt;/br&gt;

== '''Combinational Circuits'''==

=== ''' Design '''=== 
* Boolean Algebra ([[Media:DD2.A1.BAlgebra.20250503.pdf|A1.pdf]])
* Truth Tables ([[Media:DD2.A2.TTable.20250424.pdf|A2.pdf]])
* K-Map ([[Media:DD2.A3.KMap.20250424.pdf|A3.pdf]])
* Design Examples ([[Media:DD2.A4.CombEx.20250414.pdf|A4.pdf]])
&lt;/br&gt;

=== ''' Components '''=== 
* Decoder ([[Media:DD2.B.1.Decoder.20130928.pdf|B1.pdf]])
* Encoder ([[Media:DD2.B.2.Encoder.20130917.pdf|B2.pdf]])
* Multiplexer ([[Media:DD2.B.3.Multiplexer.20130928.pdf|B3.pdf]])
* Adder ([[Media:DD2.B.4..Adder.20131007.pdf|B4.pdf]], [[Media:Fa.sch.20131002.pdf|fa.sch.pdf]], [[Media:Adder4.sch.20131002.pdf|adder4.sch.pdf]])
&lt;/br&gt;

=== ''' Design Metric '''=== 
* Noise Margin ([[Media:DD2.C1.NoiseMargin.20250415.pdf|C1.pdf]])
&lt;/br&gt;

== '''Sequential Circuits'''==

=== ''' Design '''=== 
* Types of Flip-Flops ([[Media:CDesign.1.A.FF.20130412.pdf |1A.pdf]])&lt;/br&gt;
* Latches and Flipflops ([[Media:DD3.A.1.LatchFF.20160308.pdf|A1.pdf]])
* State Transition Table ([[Media:DD3.A.2.pdf|A2.pdf]])
* FSM (Finite State Machine) ([[Media:DD3.A.3.FSM.20131030.pdf|A3.pdf]])
&lt;/br&gt;

* The Classic FF Design ([[Media:DD3.A.6.ClassicFF.20131126.pdf|A7.pdf]])
* The Modern FF Design ([[Media:DD3.A.6.ClassicFF.20131204.2.pdf|A8.pdf]])
&lt;/br&gt;

=== ''' Components '''=== 
* Latches and Flip-flops ([[Media:DD3.B.1.LatchFF.20131008.pdf|B1.pdf]])
* Registers ([[Media:DD3.B.2.Register.20150326.pdf|B2.pdf]], [[Media:Register.20131118.pdf|register.pdf]])
* Counters ([[Media:DD3.B.2.Counter.20150420.pdf|B3.pdf]])
&lt;/br&gt;

=== ''' Timing Analysis '''=== 
* Metastability ([[Media:DD3.A.4.MetaState.20131030.pdf|A4.pdf]])
* Flip-flop Timing ([[Media:DD3.A5.FFTiming.20260511.pdf|A5.pdf]])
* SR Latch Forbidden State ([[Media:DD3.A.5.ForbiddenState.20131030.pdf|A6.pdf]])
&lt;/br&gt;

* FF Min Max Timing Constraints ([[Media:CArch.MinMaxTiming.20131121.pdf |pdf]])
* FF Clock Skew Timing Constraints ([[Media:CArch.ClockSkew.20131121.pdf |pdf]])

* Synchronizer ([[Media:CArch.Synchronizer.20131216.pdf |pdf]])
* Resolution Time Analysis  ([[Media:CArch.Resolution.20131216.pdf |pdf]])
&lt;/br&gt;

== '''Finite State Machine'''==

* FSM State Encoding 
* FSM Types : Mealy and Moore Machines
* FSM Example ([[Media:CArch.2.A.FSMExample.20141018.pdf |pdf]])
&lt;/br&gt;

== '''Array  Devices''' ==

=== ''' Memory Arrays '''=== 
* RAM 
** RAM Structure ([[Media:DD4.A.1.RAM.20131111.pdf|A.pdf]])
** RAM Timing ([[Media:DD4.B.1.RAMTiming.20131130.pdf|B.pdf]])
** FPGA RAM ([[Media:DD4.C.1.FPGARAM.20160513.pdf|C.pdf]])

* ROM
&lt;/br&gt;

=== ''' Logic Arrays '''=== 
* PLA 
* PAL
* PLD
* FPGA
** FPGA Structure
** FPGA Configuration ([[Media:DD4.C.1.FPGAConf.20131130.pdf|B.pdf]])
&lt;/br&gt;
&lt;/br&gt; 
[http://www.ece.cmu.edu/~ece548/localcpy/sramop.pdf  Synchronous SRAM Timing] &lt;/br&gt;
[http://www.micron.com/~/media/Documents/Products/Technical%20Note/DRAM/tn4529.pdf Asynchronous SRAM Timing]&lt;/br&gt;
[http://www.ece.cmu.edu/~ece548/localcpy/dramop.pdf DRAM Timing] &lt;/br&gt;

[http://www.ece.unm.edu/~jimp/415/slides/fpga_arch1.pdf FPGA Architectures] &lt;/br&gt;
[http://www.engr.siu.edu/~haibo/ece428/notes/ece428_fpgaarch.pdf CPLD &amp; FPGA] &lt;/br&gt;
&lt;/br&gt;

== ''' RTL Design Techniques''' ==
&lt;/br&gt;

''' Design Methodology '''
&lt;/br&gt;


''' Synthesis '''
&lt;/br&gt;
&lt;/br&gt;
&lt;/br&gt;

== '''Logic Families and IOs''' ==
* BJT Based 
:: DTL (Diode-Transistor Logic)
:: TTL (Transistor-Transistor Logic)
:: ECL (Emitter-Coupled Logic)
 
* MOS Based
:: CMOS (Complementary MOS)
:: Pseudo-nMOS 
:: Transmission Gate
:: BiCMOS (Bipolr + CMOS)
 
* Dynamic CMOS 
:: Domino
:: Clocked-CMOS (C&lt;sup&gt;2&lt;/sup&gt;MOS)
&lt;/br&gt; 

* Modern I/O Standards
:: TTL and LVTTL (Low Voltage TTL)
:: CMOS and LVCMOS (Low Voltage CMOS)
:: SSTL (Stub Series Terminated Logic)
:: HSTL (High Speed Tranceiver Logic)
:: LVDS (Low Voltage Differential Signaling) 

&lt;/br&gt;

* Wikipedia Pages for Logic Families ([[Media:Logic Families.wiki.20140812.pdf|A.pdf]])
&lt;/br&gt;
&lt;/br&gt;

See also &lt;/br&gt;
&lt;[[The necessities in Computer Design]]&gt;  &lt;/br&gt;
&lt;[[The necessities in Computer Architecture]]&gt;  &lt;/br&gt;
&lt;[[The necessities in Computer Organization]]&gt;  &lt;/br&gt;


&lt;/br&gt; &lt;/br&gt;

&lt;/br&gt; 
go to [ [[Electrical_%26_Computer_Engineering_Studies]] ]

== '''Old''' ==
'''Until 2011.12''' 
'''Chapter 1. Binary Numbers'''
* 1.1 Binary Numbers([[Media:BinaryNumbers.1.A.pdf|pdf]])

''' Minterm, Maxterm, HW '''
* 1.1 Lecture01([[Media:DigitalDesign.20110922.pdf|pdf]])

''' Overflow HW '''
* Overflow Table([[Media:Overflow table.20110924.pdf|pdf]])

''' K-Map '''
* K-Map([[Media:DigitalDesign.20110926.pdf|pdf]])

''' Binary Adder '''
* Binary Adder (C, S) ([[Media:DigitalDesign.20110929.pdf|pdf]])
* Overflow detection circuit (V) ([[Media:HW Overflow20111001.pdf|pdf]])

''' BCD to Ex3 Code Coversion, Dont' Care '''
* BCD to Ex3 Code Conversion ([[Media:DigitalDesign.20111006.pdf|pdf]])

''' Prime Implicant, Dont' Care '''
* Prime Implicant, Don't Care ([[Media:DigitalDesign.20111010.pdf|pdf]])
* HW 3.6 - explain the method of combining 0's and X's

''' Multiplexer / Demultiplexer '''
* Multiplexer ([[Media:DigitalDesign.20111024.pdf|pdf]])
* HW (TBD)

''' Flip Flop / Latch '''
* FF &amp; Latch ([[Media:DigitalDesign.20111027.pdf|pdf]])
* FF &amp; Latch HW ([[Media:DigitalDesign (HW).20111027.pdf|pdf]])
* Gated D Latch &amp; Master-Slave D FlipFlop ([[Media:DigitalDesign.20111031.pdf|pdf]])
* HW (Forbidden state and Indeterminate state) ([[Media:DigitalDesign (HW).20111102.pdf|pdf]]) (note in #2, S' R' instead of S R)
* Classical Edge Triggered D FlipFlop ([[Media:DigitalDesign.20111112.pdf|pdf]])
* HW (addition in SW and HW) ([[Media:DigitalDesign (HW).20111112.pdf|pdf]]) 
* FSM1  ([[Media:DigitalDesign.FSM1.20111117.pdf|pdf]]) 
* FSM2  ([[Media:DigitalDesign.FSM2.20111117.pdf|pdf]]) 
* HW (FSM Waveforms) ([[Media:DigitalDesign (HW).20111118.pdf|pdf]]) 
 
 
''' Counter '''
* Sychronous Counter ([[Media:DigitalDesign.20111121.pdf|pdf]])
* Ripple Counter, Multiplexer, Tri-state buffer([[Media:DigitalDesign.20111124.pdf|pdf]])
* Register ([[Media:DigitalDesign.register.20111201.pdf|pdf]])
* Timing ([[Media:DigitalDesign.timing.20111201.pdf|pdf]])
* HW (Multiplexer, Shift Register) ([[Media:DigitalDesign (HW).20111201.pdf|pdf]])
* Universal Shift Register, Memory Cell ([[Media:DigitalDesign.20111206.pdf|pdf]])
* HW (Bit Serial Adder) ([[Media:DigitalDesign (HW).20111206.pdf|pdf]])
 
 
''' Memory '''
* Memory ([[Media:DigitalDesign.20111208.pdf|pdf]])

''' Comparator, Multiplier '''
* Comparator, Multiplier ([[Media:DigitalDesign.20111219.spread.pdf|1.pdf]], [[Media:DigitalDesign.20111219.draw.pdf|2.pdf]])
 
 
'''Multiplexer based design method '''
* Multiplexer Design Method ([[Media:DigitalDesign.20111221.spread.pdf|1.pdf]], [[Media:DigitalDesign.20111221.draw.pdf|2.pdf]])


midterm result ([[Media:MidReult.20111027.pdf|pdf]])

 
* Edge Triggered Flip Flop ([[Media:EdgeTrigFF.20111224.pdf|pdf]])
* FF Timing ([[Media:FFTiming.20111203.pdf|pdf]])


&lt;/br&gt; &lt;/br&gt;
'''Until 2013.07''' 

''' Number Systems '''
* Binary Numbers ([[Media:DD.1.A.BinNum.20130309.pdf|A.pdf]])
* Hexadecimal Numbers ([[Media:DD.1.B.HexaNum.20130417.pdf|B.pdf]])
* Numbers in C programs ([[Media:DD.1.C.CNum.20130309.pdf|C.pdf]])
* Codes ([[Media:DD.1.D.Coding.20130319.pdf|pdf]])
&lt;/br&gt;

&lt;/br&gt;
* Helpful Wikipedia Pages ([[Media:DD.WP.NumberSystem.20130309.pdf|pdf]])
&lt;/br&gt;

''' Combinational Circuits '''
* Truth Tables and Boolean Functions ([[Media:DD.2.A.TTable.20130325.pdf|2A.pdf]])&lt;/br&gt;
* K-Map ([[Media:DD.2.A.KMap.20130329.pdf|2B.pdf]])&lt;/br&gt;
* Binary Addition in C ([[Media:DD.2.C.BAinC.20130329.pdf|2.C.pdf]])&lt;/br&gt;
* Binary Arithmetic ([[Media:DD.2.D.BAri.2013.pdf|2.D.pdf]])&lt;/br&gt;
* Boolean Algebra ([[Media:DD.2.E.BAlgebra.20130419.pdf|2.E.pdf]])&lt;/br&gt;
&lt;/br&gt;

''' Sequential Circuits '''
* Latches and Flip-flops ([[Media:DD.3.A.LatchFF.20130413.pdf|3A.pdf]])&lt;/br&gt;
* FSM (Finite State Machine) ([[Media:DD.3.B.FSM.20130417.pdf|3B.pdf]])&lt;/br&gt;
* SR Latch Forbidden State ([[Media:DD.3.C.FState.20130413.pdf|3C.pdf]])&lt;/br&gt;
* Flip-flop Timing ([[Media:DD.3.D.Timing.20130413.pdf|3D.pdf]])&lt;/br&gt;
* Metastability ([[Media:DD.3.E.MetaState.20130628.pdf|3E.pdf]])&lt;/br&gt;
&lt;/br&gt;
&lt;/br&gt;
&lt;/br&gt;

See also &lt;/br&gt;
&quot;[[The necessities in Computer Design]]&quot;  &lt;/br&gt;
&quot;[[The necessities in Computer Architecture]]&quot;  &lt;/br&gt;

[[Category:Digital Circuit Design]]
[[Category:FPGA]]</text>
      <sha1>q0bw02l0wtcgfj1rd3lr9y3ag1utmmp</sha1>
    </revision>
    <revision>
      <id>2809793</id>
      <parentid>2809790</parentid>
      <timestamp>2026-05-17T01:07:06Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>/*  Timing Analysis  */</comment>
      <origin>2809793</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="9835" sha1="rinsyiuym3yi0npgav5do2lpv8nbq8k" xml:space="preserve">
== ''' Number Systems '''== 

=== ''' Binary Representation '''=== 
* Binary Numbers ([[Media:DD1.1.A.BinaryNum.20130918.pdf|A.pdf]])
* Hexadecimal Numbers ([[Media:DD1.2.A.HexaNum.20130918.pdf|A.pdf]])
* Other Codes ([[Media:DD1.3A.Code.20250329.pdf|A.pdf]])

=== ''' Binary Arithmetic '''=== 
* Binary Arithmetic ([[Media:DD1.4.A.BinaryArith.20150425.pdf|A.pdf]])
* BCD Arithmetic ([[Media:DD1.5.A.BCDArith.20130918.pdf|A.pdf]])

=== ''' C Program Examples '''=== 
* Binary Numbers in C programs ([[Media:DD1.6.A.BNumInC.20140103.pdf|A.pdf]])
* Binary Addition in C programs ([[Media:DD1.7.A.BArithInC.20140103.pdf|A.pdf]])
&lt;/br&gt;

* Helpful Wikipedia Pages ([[Media:DD.WP.NumberSystem.20130309.pdf|C.pdf]])
&lt;/br&gt;

=== ''' Floating Point Numbers '''=== 

* Floating Point Representations  ([[Media:CDesign.5.A.FPoint.20140121.pdf|5A.pdf]])&lt;/br&gt;
:: See [http://www.iro.umontreal.ca/~aboulham/F1214/Session%206Arithm/Floating_Point_Numbers.pdf Floating Point Overview]
:: See [http://www.cs.auckland.ac.nz/~patrice/210-2006/210%20LN04_2.pdf Offset Binary Overview]
:: See [http://www.intersil.com/content/dam/Intersil/documents/an96/an9657.pdf Offset Binary &amp; Sin / Cosine]
:: See [http://www.ee.ic.ac.uk/hp/staff/dmb/courses/dig2/4_Analog.pdf Offset Binary &amp; ADC / DAC]
&lt;/br&gt;

=== ''' Interfacing Digital and Analog Signals '''=== 
* Sampling and Quantization   ([[Media:DD1.10.A.SampleQuant.20150425.pdf|A.pdf]])
* Digital-to-Analog Conversion  ([[Media:DD1.8.A.DAC.20140208.pdf|A.pdf]])
* Analog-to-Digital Conversion ([[Media:DD1.9.A.DAC.20140208.pdf|A.pdf]])
&lt;/br&gt;

== '''Combinational Circuits'''==

=== ''' Design '''=== 
* Boolean Algebra ([[Media:DD2.A1.BAlgebra.20250503.pdf|A1.pdf]])
* Truth Tables ([[Media:DD2.A2.TTable.20250424.pdf|A2.pdf]])
* K-Map ([[Media:DD2.A3.KMap.20250424.pdf|A3.pdf]])
* Design Examples ([[Media:DD2.A4.CombEx.20250414.pdf|A4.pdf]])
&lt;/br&gt;

=== ''' Components '''=== 
* Decoder ([[Media:DD2.B.1.Decoder.20130928.pdf|B1.pdf]])
* Encoder ([[Media:DD2.B.2.Encoder.20130917.pdf|B2.pdf]])
* Multiplexer ([[Media:DD2.B.3.Multiplexer.20130928.pdf|B3.pdf]])
* Adder ([[Media:DD2.B.4..Adder.20131007.pdf|B4.pdf]], [[Media:Fa.sch.20131002.pdf|fa.sch.pdf]], [[Media:Adder4.sch.20131002.pdf|adder4.sch.pdf]])
&lt;/br&gt;

=== ''' Design Metric '''=== 
* Noise Margin ([[Media:DD2.C1.NoiseMargin.20250415.pdf|C1.pdf]])
&lt;/br&gt;

== '''Sequential Circuits'''==

=== ''' Design '''=== 
* Types of Flip-Flops ([[Media:CDesign.1.A.FF.20130412.pdf |1A.pdf]])&lt;/br&gt;
* Latches and Flipflops ([[Media:DD3.A.1.LatchFF.20160308.pdf|A1.pdf]])
* State Transition Table ([[Media:DD3.A.2.pdf|A2.pdf]])
* FSM (Finite State Machine) ([[Media:DD3.A.3.FSM.20131030.pdf|A3.pdf]])
&lt;/br&gt;

* The Classic FF Design ([[Media:DD3.A.6.ClassicFF.20131126.pdf|A7.pdf]])
* The Modern FF Design ([[Media:DD3.A.6.ClassicFF.20131204.2.pdf|A8.pdf]])
&lt;/br&gt;

=== ''' Components '''=== 
* Latches and Flip-flops ([[Media:DD3.B.1.LatchFF.20131008.pdf|B1.pdf]])
* Registers ([[Media:DD3.B.2.Register.20150326.pdf|B2.pdf]], [[Media:Register.20131118.pdf|register.pdf]])
* Counters ([[Media:DD3.B.2.Counter.20150420.pdf|B3.pdf]])
&lt;/br&gt;

=== ''' Timing Analysis '''=== 
* Metastability ([[Media:DD3.A.4.MetaState.20131030.pdf|A4.pdf]])
* Flip-flop Timing ([[Media:DD3.A5.FFTiming.20260512.pdf|A5.pdf]])
* SR Latch Forbidden State ([[Media:DD3.A.5.ForbiddenState.20131030.pdf|A6.pdf]])
&lt;/br&gt;

* FF Min Max Timing Constraints ([[Media:CArch.MinMaxTiming.20131121.pdf |pdf]])
* FF Clock Skew Timing Constraints ([[Media:CArch.ClockSkew.20131121.pdf |pdf]])

* Synchronizer ([[Media:CArch.Synchronizer.20131216.pdf |pdf]])
* Resolution Time Analysis  ([[Media:CArch.Resolution.20131216.pdf |pdf]])
&lt;/br&gt;

== '''Finite State Machine'''==

* FSM State Encoding 
* FSM Types : Mealy and Moore Machines
* FSM Example ([[Media:CArch.2.A.FSMExample.20141018.pdf |pdf]])
&lt;/br&gt;

== '''Array  Devices''' ==

=== ''' Memory Arrays '''=== 
* RAM 
** RAM Structure ([[Media:DD4.A.1.RAM.20131111.pdf|A.pdf]])
** RAM Timing ([[Media:DD4.B.1.RAMTiming.20131130.pdf|B.pdf]])
** FPGA RAM ([[Media:DD4.C.1.FPGARAM.20160513.pdf|C.pdf]])

* ROM
&lt;/br&gt;

=== ''' Logic Arrays '''=== 
* PLA 
* PAL
* PLD
* FPGA
** FPGA Structure
** FPGA Configuration ([[Media:DD4.C.1.FPGAConf.20131130.pdf|B.pdf]])
&lt;/br&gt;
&lt;/br&gt; 
[http://www.ece.cmu.edu/~ece548/localcpy/sramop.pdf  Synchronous SRAM Timing] &lt;/br&gt;
[http://www.micron.com/~/media/Documents/Products/Technical%20Note/DRAM/tn4529.pdf Asynchronous SRAM Timing]&lt;/br&gt;
[http://www.ece.cmu.edu/~ece548/localcpy/dramop.pdf DRAM Timing] &lt;/br&gt;

[http://www.ece.unm.edu/~jimp/415/slides/fpga_arch1.pdf FPGA Architectures] &lt;/br&gt;
[http://www.engr.siu.edu/~haibo/ece428/notes/ece428_fpgaarch.pdf CPLD &amp; FPGA] &lt;/br&gt;
&lt;/br&gt;

== ''' RTL Design Techniques''' ==
&lt;/br&gt;

''' Design Methodology '''
&lt;/br&gt;


''' Synthesis '''
&lt;/br&gt;
&lt;/br&gt;
&lt;/br&gt;

== '''Logic Families and IOs''' ==
* BJT Based 
:: DTL (Diode-Transistor Logic)
:: TTL (Transistor-Transistor Logic)
:: ECL (Emitter-Coupled Logic)
 
* MOS Based
:: CMOS (Complementary MOS)
:: Pseudo-nMOS 
:: Transmission Gate
:: BiCMOS (Bipolr + CMOS)
 
* Dynamic CMOS 
:: Domino
:: Clocked-CMOS (C&lt;sup&gt;2&lt;/sup&gt;MOS)
&lt;/br&gt; 

* Modern I/O Standards
:: TTL and LVTTL (Low Voltage TTL)
:: CMOS and LVCMOS (Low Voltage CMOS)
:: SSTL (Stub Series Terminated Logic)
:: HSTL (High Speed Tranceiver Logic)
:: LVDS (Low Voltage Differential Signaling) 

&lt;/br&gt;

* Wikipedia Pages for Logic Families ([[Media:Logic Families.wiki.20140812.pdf|A.pdf]])
&lt;/br&gt;
&lt;/br&gt;

See also &lt;/br&gt;
&lt;[[The necessities in Computer Design]]&gt;  &lt;/br&gt;
&lt;[[The necessities in Computer Architecture]]&gt;  &lt;/br&gt;
&lt;[[The necessities in Computer Organization]]&gt;  &lt;/br&gt;


&lt;/br&gt; &lt;/br&gt;

&lt;/br&gt; 
go to [ [[Electrical_%26_Computer_Engineering_Studies]] ]

== '''Old''' ==
'''Until 2011.12''' 
'''Chapter 1. Binary Numbers'''
* 1.1 Binary Numbers([[Media:BinaryNumbers.1.A.pdf|pdf]])

''' Minterm, Maxterm, HW '''
* 1.1 Lecture01([[Media:DigitalDesign.20110922.pdf|pdf]])

''' Overflow HW '''
* Overflow Table([[Media:Overflow table.20110924.pdf|pdf]])

''' K-Map '''
* K-Map([[Media:DigitalDesign.20110926.pdf|pdf]])

''' Binary Adder '''
* Binary Adder (C, S) ([[Media:DigitalDesign.20110929.pdf|pdf]])
* Overflow detection circuit (V) ([[Media:HW Overflow20111001.pdf|pdf]])

''' BCD to Ex3 Code Coversion, Dont' Care '''
* BCD to Ex3 Code Conversion ([[Media:DigitalDesign.20111006.pdf|pdf]])

''' Prime Implicant, Dont' Care '''
* Prime Implicant, Don't Care ([[Media:DigitalDesign.20111010.pdf|pdf]])
* HW 3.6 - explain the method of combining 0's and X's

''' Multiplexer / Demultiplexer '''
* Multiplexer ([[Media:DigitalDesign.20111024.pdf|pdf]])
* HW (TBD)

''' Flip Flop / Latch '''
* FF &amp; Latch ([[Media:DigitalDesign.20111027.pdf|pdf]])
* FF &amp; Latch HW ([[Media:DigitalDesign (HW).20111027.pdf|pdf]])
* Gated D Latch &amp; Master-Slave D FlipFlop ([[Media:DigitalDesign.20111031.pdf|pdf]])
* HW (Forbidden state and Indeterminate state) ([[Media:DigitalDesign (HW).20111102.pdf|pdf]]) (note in #2, S' R' instead of S R)
* Classical Edge Triggered D FlipFlop ([[Media:DigitalDesign.20111112.pdf|pdf]])
* HW (addition in SW and HW) ([[Media:DigitalDesign (HW).20111112.pdf|pdf]]) 
* FSM1  ([[Media:DigitalDesign.FSM1.20111117.pdf|pdf]]) 
* FSM2  ([[Media:DigitalDesign.FSM2.20111117.pdf|pdf]]) 
* HW (FSM Waveforms) ([[Media:DigitalDesign (HW).20111118.pdf|pdf]]) 
 
 
''' Counter '''
* Sychronous Counter ([[Media:DigitalDesign.20111121.pdf|pdf]])
* Ripple Counter, Multiplexer, Tri-state buffer([[Media:DigitalDesign.20111124.pdf|pdf]])
* Register ([[Media:DigitalDesign.register.20111201.pdf|pdf]])
* Timing ([[Media:DigitalDesign.timing.20111201.pdf|pdf]])
* HW (Multiplexer, Shift Register) ([[Media:DigitalDesign (HW).20111201.pdf|pdf]])
* Universal Shift Register, Memory Cell ([[Media:DigitalDesign.20111206.pdf|pdf]])
* HW (Bit Serial Adder) ([[Media:DigitalDesign (HW).20111206.pdf|pdf]])
 
 
''' Memory '''
* Memory ([[Media:DigitalDesign.20111208.pdf|pdf]])

''' Comparator, Multiplier '''
* Comparator, Multiplier ([[Media:DigitalDesign.20111219.spread.pdf|1.pdf]], [[Media:DigitalDesign.20111219.draw.pdf|2.pdf]])
 
 
'''Multiplexer based design method '''
* Multiplexer Design Method ([[Media:DigitalDesign.20111221.spread.pdf|1.pdf]], [[Media:DigitalDesign.20111221.draw.pdf|2.pdf]])


midterm result ([[Media:MidReult.20111027.pdf|pdf]])

 
* Edge Triggered Flip Flop ([[Media:EdgeTrigFF.20111224.pdf|pdf]])
* FF Timing ([[Media:FFTiming.20111203.pdf|pdf]])


&lt;/br&gt; &lt;/br&gt;
'''Until 2013.07''' 

''' Number Systems '''
* Binary Numbers ([[Media:DD.1.A.BinNum.20130309.pdf|A.pdf]])
* Hexadecimal Numbers ([[Media:DD.1.B.HexaNum.20130417.pdf|B.pdf]])
* Numbers in C programs ([[Media:DD.1.C.CNum.20130309.pdf|C.pdf]])
* Codes ([[Media:DD.1.D.Coding.20130319.pdf|pdf]])
&lt;/br&gt;

&lt;/br&gt;
* Helpful Wikipedia Pages ([[Media:DD.WP.NumberSystem.20130309.pdf|pdf]])
&lt;/br&gt;

''' Combinational Circuits '''
* Truth Tables and Boolean Functions ([[Media:DD.2.A.TTable.20130325.pdf|2A.pdf]])&lt;/br&gt;
* K-Map ([[Media:DD.2.A.KMap.20130329.pdf|2B.pdf]])&lt;/br&gt;
* Binary Addition in C ([[Media:DD.2.C.BAinC.20130329.pdf|2.C.pdf]])&lt;/br&gt;
* Binary Arithmetic ([[Media:DD.2.D.BAri.2013.pdf|2.D.pdf]])&lt;/br&gt;
* Boolean Algebra ([[Media:DD.2.E.BAlgebra.20130419.pdf|2.E.pdf]])&lt;/br&gt;
&lt;/br&gt;

''' Sequential Circuits '''
* Latches and Flip-flops ([[Media:DD.3.A.LatchFF.20130413.pdf|3A.pdf]])&lt;/br&gt;
* FSM (Finite State Machine) ([[Media:DD.3.B.FSM.20130417.pdf|3B.pdf]])&lt;/br&gt;
* SR Latch Forbidden State ([[Media:DD.3.C.FState.20130413.pdf|3C.pdf]])&lt;/br&gt;
* Flip-flop Timing ([[Media:DD.3.D.Timing.20130413.pdf|3D.pdf]])&lt;/br&gt;
* Metastability ([[Media:DD.3.E.MetaState.20130628.pdf|3E.pdf]])&lt;/br&gt;
&lt;/br&gt;
&lt;/br&gt;
&lt;/br&gt;

See also &lt;/br&gt;
&quot;[[The necessities in Computer Design]]&quot;  &lt;/br&gt;
&quot;[[The necessities in Computer Architecture]]&quot;  &lt;/br&gt;

[[Category:Digital Circuit Design]]
[[Category:FPGA]]</text>
      <sha1>rinsyiuym3yi0npgav5do2lpv8nbq8k</sha1>
    </revision>
  </page>
  <page>
    <title>The necessities in Numerical Methods</title>
    <ns>0</ns>
    <id>119778</id>
    <revision>
      <id>2809803</id>
      <parentid>2807375</parentid>
      <timestamp>2026-05-17T01:26:25Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>/* Non-linear Equations */</comment>
      <origin>2809803</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="2914" sha1="ba994br9hbkvvzz7mcjr0e7plgov36i" xml:space="preserve">== Calculus == 
=== Numerical Differentiation ===
* Background on Differentiation ([[Media:NM.Diff.1Background.20240625.pdf |pdf]])
* Continuous Function Differentiation ([[Media:NM.Diff.1ContDiff.20241021.pdf |pdf]])
* Discrete Function Differentiation ([[Media:NM.Diff.1Discrete.20241116.pdf |pdf]])
* Forward, Backward, Central Divided Difference
* High Accuracy Differentiation
* Richardson Extrapolation
* Unequal Spaced Data Differentiation
* Numerical Differentiation with Octave
&lt;/br&gt;

=== Non-linear Equations ===
* Bisection Method ([[Media:NM.NLE.1Bisection.20241130.pdf |pdf]])
* Newton-Raphson Method ([[Media:NM.NLE.2Newton.20260511.pdf |pdf]])
* Secant Method
* False-Position Method
&lt;/br&gt;

=== Numerical Integration ===
* Trapezoidal Rule
* Simpson's 1/3 Rule
* Romberg Rule
* Gauss-Quadrature Rule
* Adaptive Quadrature
&lt;/br&gt;

=== Roots of a Nonlinear Equation ===
&lt;/br&gt;

=== Optimization ===
&lt;/br&gt;
&lt;/br&gt;

== Matrix Algebra == 

=== Simultaneous Linear Equations === 
* A system of linear equations ([[Media:SystemLinearEq.20240521.pdf |pdf]])


&lt;/br&gt;

=== Gaussian Elimination === 
&lt;/br&gt;

=== LU Decomposition === 
&lt;/br&gt;

=== Cholesky Decomposition === 
&lt;/br&gt;

=== LDL Decomposition === 
&lt;/br&gt;

=== Gauss-Seidel method === 
&lt;/br&gt;

=== Adequacy of Solutions === 
&lt;/br&gt;

=== Eigenvalue and Singular Value ===
&lt;/br&gt;

=== QRD ===
&lt;/br&gt;

=== SVD ===
&lt;/br&gt;

=== Iterative methods ===
&lt;/br&gt;
&lt;/br&gt;

== Regression ==

=== Linear Regression ===
&lt;/br&gt;

=== Non-linear Regression ===
&lt;/br&gt;

=== Linear Least Squares ===
&lt;/br&gt;
&lt;/br&gt; 


== Interpolation ==

=== Polynomial Interpolation ===
&lt;/br&gt;

=== Linear Splines ===
&lt;/br&gt;

=== Piecewise Interpolation ===
&lt;/br&gt;
&lt;/br&gt; 


== Ordinary Differential Equation ==
&lt;/br&gt;

== Partial Differential Equation ==
&lt;/br&gt;

== FEM (Finite Element Method) ==
&lt;/br&gt;
&lt;/br&gt; 


&lt;/br&gt;


== Using Symbolic Package in Octave ==

* Visit http://octave.sourceforge.net/index.html
* Download symbolic-1.0.9.tar.gz

* In Ubuntu, using the Ubuntu Software Center, I installed GiNac and CLN related software and symbolic package for Octave. But it did not properly installed.

* After extracting files from symbolic-1.0.9.tar.gz, I followed the following steps.
 ./configure 
 ./make 
 ./make INSTALL_PATH=/usr/share/octave/packages/3.2/symbolic-1.0.9 

* While doing this, I got an error message related to mkoctfile. So, I used the following command: sudo apt-get install ocatve3.2-headers. Then I was able to install the symbolic packages in the Ubuntu.

== Read some tutorials about symbolic computation ==

* Symbolic Mathematics in Matlab/GNU Octave (http://faraday.elec.uow.edu.au/subjects/annual/ECTE313/Symbolic_Maths.pdf)

* Symbolic Computations (http://www.math.ohiou.edu/courses/math344/lecture7.pdf)

[[Category:Numerical methods]]

== Using SymPy ( a Python library for symbolic mathematics) == 
&lt;/br&gt;


&lt;/br&gt; 
go to [ [[Electrical_%26_Computer_Engineering_Studies]] ]</text>
      <sha1>ba994br9hbkvvzz7mcjr0e7plgov36i</sha1>
    </revision>
    <revision>
      <id>2809805</id>
      <parentid>2809803</parentid>
      <timestamp>2026-05-17T01:28:08Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>/* Non-linear Equations */</comment>
      <origin>2809805</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="2914" sha1="l5b2sgx2uownv1dqckzw0xacsk3mdns" xml:space="preserve">== Calculus == 
=== Numerical Differentiation ===
* Background on Differentiation ([[Media:NM.Diff.1Background.20240625.pdf |pdf]])
* Continuous Function Differentiation ([[Media:NM.Diff.1ContDiff.20241021.pdf |pdf]])
* Discrete Function Differentiation ([[Media:NM.Diff.1Discrete.20241116.pdf |pdf]])
* Forward, Backward, Central Divided Difference
* High Accuracy Differentiation
* Richardson Extrapolation
* Unequal Spaced Data Differentiation
* Numerical Differentiation with Octave
&lt;/br&gt;

=== Non-linear Equations ===
* Bisection Method ([[Media:NM.NLE.1Bisection.20241130.pdf |pdf]])
* Newton-Raphson Method ([[Media:NM.NLE.2Newton.20260512.pdf |pdf]])
* Secant Method
* False-Position Method
&lt;/br&gt;

=== Numerical Integration ===
* Trapezoidal Rule
* Simpson's 1/3 Rule
* Romberg Rule
* Gauss-Quadrature Rule
* Adaptive Quadrature
&lt;/br&gt;

=== Roots of a Nonlinear Equation ===
&lt;/br&gt;

=== Optimization ===
&lt;/br&gt;
&lt;/br&gt;

== Matrix Algebra == 

=== Simultaneous Linear Equations === 
* A system of linear equations ([[Media:SystemLinearEq.20240521.pdf |pdf]])


&lt;/br&gt;

=== Gaussian Elimination === 
&lt;/br&gt;

=== LU Decomposition === 
&lt;/br&gt;

=== Cholesky Decomposition === 
&lt;/br&gt;

=== LDL Decomposition === 
&lt;/br&gt;

=== Gauss-Seidel method === 
&lt;/br&gt;

=== Adequacy of Solutions === 
&lt;/br&gt;

=== Eigenvalue and Singular Value ===
&lt;/br&gt;

=== QRD ===
&lt;/br&gt;

=== SVD ===
&lt;/br&gt;

=== Iterative methods ===
&lt;/br&gt;
&lt;/br&gt;

== Regression ==

=== Linear Regression ===
&lt;/br&gt;

=== Non-linear Regression ===
&lt;/br&gt;

=== Linear Least Squares ===
&lt;/br&gt;
&lt;/br&gt; 


== Interpolation ==

=== Polynomial Interpolation ===
&lt;/br&gt;

=== Linear Splines ===
&lt;/br&gt;

=== Piecewise Interpolation ===
&lt;/br&gt;
&lt;/br&gt; 


== Ordinary Differential Equation ==
&lt;/br&gt;

== Partial Differential Equation ==
&lt;/br&gt;

== FEM (Finite Element Method) ==
&lt;/br&gt;
&lt;/br&gt; 


&lt;/br&gt;


== Using Symbolic Package in Octave ==

* Visit http://octave.sourceforge.net/index.html
* Download symbolic-1.0.9.tar.gz

* In Ubuntu, using the Ubuntu Software Center, I installed GiNac and CLN related software and symbolic package for Octave. But it did not properly installed.

* After extracting files from symbolic-1.0.9.tar.gz, I followed the following steps.
 ./configure 
 ./make 
 ./make INSTALL_PATH=/usr/share/octave/packages/3.2/symbolic-1.0.9 

* While doing this, I got an error message related to mkoctfile. So, I used the following command: sudo apt-get install ocatve3.2-headers. Then I was able to install the symbolic packages in the Ubuntu.

== Read some tutorials about symbolic computation ==

* Symbolic Mathematics in Matlab/GNU Octave (http://faraday.elec.uow.edu.au/subjects/annual/ECTE313/Symbolic_Maths.pdf)

* Symbolic Computations (http://www.math.ohiou.edu/courses/math344/lecture7.pdf)

[[Category:Numerical methods]]

== Using SymPy ( a Python library for symbolic mathematics) == 
&lt;/br&gt;


&lt;/br&gt; 
go to [ [[Electrical_%26_Computer_Engineering_Studies]] ]</text>
      <sha1>l5b2sgx2uownv1dqckzw0xacsk3mdns</sha1>
    </revision>
  </page>
  <page>
    <title>VHDL programming in plain view</title>
    <ns>0</ns>
    <id>121359</id>
    <revision>
      <id>2809656</id>
      <parentid>2809621</parentid>
      <timestamp>2026-05-16T15:52:00Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>/* Data */</comment>
      <origin>2809656</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="2280" sha1="t1t4pqs56pirza8enqsex5uuf4bd2z1" xml:space="preserve">&lt;!----------------------------------------------------------------------&gt;

== Flip Flop and Latch ==
* FFLatch.Overview.1.A ([[Media:FFLatch.Overview.1.A.20111103.pdf|pdf]])
* Counter.74LS193.1.A ([[Media:Counter.74LS193.1.A.20111108.pdf|pdf]])
* Clock.Overview.1.A ([[Media:Clock.Overview.1.A.20111108.pdf|pdf]])
* Function.Overview.1.A ([[Media:Function.Overview.1.A.20111201.pdf|pdf]])
&lt;br&gt; 

== Versions of VHDL ==
* VHDL Versions ([[Media:VHDL.1.A.Versions.20120619.pdf|pdf]])
* VHDL Libraries ([[Media:VHDL.1.A.Libraries.20140219.pdf|pdf]])
&lt;br&gt;

== Basic Features of VHDL ==
==== Data ====
* Data Objects ([[Media:Data.Object.1A.20260512-1.pdf|A]], [[Media:Data.Object.1B.20260511.pdf|B]])
* Data Types ([[Media:Data.Type.2A.20260505.pdf|A]], [[Media:Data.Type.2B.20260505.pdf|B]])
* Packages ([[Media:Data.Package.3A.20251206.pdf|pdf]])
* Signal Types ([[Media:Signal.Type.1A.20250614.pdf|pdf]])
* Attributes ([[Media:Data.4.A.Attribute.20251021.pdf|pdf]])
&lt;br&gt;

==== Signals &amp; Variables ====
* Signals &amp; Variables ([[Media:Signal.1A.SigVar.20250614.pdf|pdf]])
* Sequential Signal Assignments ([[Media:Signal.4A.Sequential.20250612.pdf|pdf]])
* Concurrent &amp; Sequential Signal Assignments ([[Media:Signal.1.A.ConSeq.20120611.pdf|pdf]])
* Inertial &amp; Transport Delay Models ([[Media:Signal.2.A.InertTrans.20120704.pdf|pdf]])
* Simulation &amp; Synthesis ([[Media:Signal.3.A.SimSyn.20120504.pdf|pdf]])


&lt;br&gt;

==== Structure ====
* Component ([[Media:Struct.1.A.Component.20120804.pdf|pdf]])
* Configuration ([[Media:Struct.1.A.Configuration.20121003.pdf|pdf]])
* Generic ([[Media:Struct.1.A.Generic.20120802.pdf|pdf]])
&lt;/br&gt;

==== Entity and Architecture ====

&lt;br&gt; 
==== Block Statement ====

&lt;br&gt; 
==== Process Statement ====

&lt;br&gt;
==== Operators ====

&lt;br&gt;
==== Assignment Statement ====

&lt;br&gt; 
==== Concurrent Statement ====

&lt;br&gt; 
==== Sequential Control Statement ====

&lt;br&gt;
==== Function ====
* Function.1.A Usage ([[Media:Function.1.A.Usage.20120611.pdf|pdf]])
* Function.2.A Conversion Function ([[Media:Function.2.A.Conversion.pdf|pdf]])
* Function.3.A Resolution Function ([[Media:Function.3.A.Resolution.pdf|pdf]])

&lt;br&gt;
==== Procedure ====


&lt;br&gt;
==== Package ====
&lt;/br&gt; 
go to [ [[Electrical_%26_Computer_Engineering_Studies]] ]

[[Category:VHDL]]
[[Category:FPGA]]</text>
      <sha1>t1t4pqs56pirza8enqsex5uuf4bd2z1</sha1>
    </revision>
    <revision>
      <id>2809658</id>
      <parentid>2809656</parentid>
      <timestamp>2026-05-16T16:13:11Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>/* Data */</comment>
      <origin>2809658</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="2280" sha1="21925s9cdddg0zhjl66wulq7pc6jxkp" xml:space="preserve">&lt;!----------------------------------------------------------------------&gt;

== Flip Flop and Latch ==
* FFLatch.Overview.1.A ([[Media:FFLatch.Overview.1.A.20111103.pdf|pdf]])
* Counter.74LS193.1.A ([[Media:Counter.74LS193.1.A.20111108.pdf|pdf]])
* Clock.Overview.1.A ([[Media:Clock.Overview.1.A.20111108.pdf|pdf]])
* Function.Overview.1.A ([[Media:Function.Overview.1.A.20111201.pdf|pdf]])
&lt;br&gt; 

== Versions of VHDL ==
* VHDL Versions ([[Media:VHDL.1.A.Versions.20120619.pdf|pdf]])
* VHDL Libraries ([[Media:VHDL.1.A.Libraries.20140219.pdf|pdf]])
&lt;br&gt;

== Basic Features of VHDL ==
==== Data ====
* Data Objects ([[Media:Data.Object.1A.20260512-1.pdf|A]], [[Media:Data.Object.1B.20260512.pdf|B]])
* Data Types ([[Media:Data.Type.2A.20260505.pdf|A]], [[Media:Data.Type.2B.20260505.pdf|B]])
* Packages ([[Media:Data.Package.3A.20251206.pdf|pdf]])
* Signal Types ([[Media:Signal.Type.1A.20250614.pdf|pdf]])
* Attributes ([[Media:Data.4.A.Attribute.20251021.pdf|pdf]])
&lt;br&gt;

==== Signals &amp; Variables ====
* Signals &amp; Variables ([[Media:Signal.1A.SigVar.20250614.pdf|pdf]])
* Sequential Signal Assignments ([[Media:Signal.4A.Sequential.20250612.pdf|pdf]])
* Concurrent &amp; Sequential Signal Assignments ([[Media:Signal.1.A.ConSeq.20120611.pdf|pdf]])
* Inertial &amp; Transport Delay Models ([[Media:Signal.2.A.InertTrans.20120704.pdf|pdf]])
* Simulation &amp; Synthesis ([[Media:Signal.3.A.SimSyn.20120504.pdf|pdf]])


&lt;br&gt;

==== Structure ====
* Component ([[Media:Struct.1.A.Component.20120804.pdf|pdf]])
* Configuration ([[Media:Struct.1.A.Configuration.20121003.pdf|pdf]])
* Generic ([[Media:Struct.1.A.Generic.20120802.pdf|pdf]])
&lt;/br&gt;

==== Entity and Architecture ====

&lt;br&gt; 
==== Block Statement ====

&lt;br&gt; 
==== Process Statement ====

&lt;br&gt;
==== Operators ====

&lt;br&gt;
==== Assignment Statement ====

&lt;br&gt; 
==== Concurrent Statement ====

&lt;br&gt; 
==== Sequential Control Statement ====

&lt;br&gt;
==== Function ====
* Function.1.A Usage ([[Media:Function.1.A.Usage.20120611.pdf|pdf]])
* Function.2.A Conversion Function ([[Media:Function.2.A.Conversion.pdf|pdf]])
* Function.3.A Resolution Function ([[Media:Function.3.A.Resolution.pdf|pdf]])

&lt;br&gt;
==== Procedure ====


&lt;br&gt;
==== Package ====
&lt;/br&gt; 
go to [ [[Electrical_%26_Computer_Engineering_Studies]] ]

[[Category:VHDL]]
[[Category:FPGA]]</text>
      <sha1>21925s9cdddg0zhjl66wulq7pc6jxkp</sha1>
    </revision>
    <revision>
      <id>2809660</id>
      <parentid>2809658</parentid>
      <timestamp>2026-05-16T16:36:51Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>/* Data */</comment>
      <origin>2809660</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="2280" sha1="khy2mto7i9ysjoccrsakiz8rm0upoib" xml:space="preserve">&lt;!----------------------------------------------------------------------&gt;

== Flip Flop and Latch ==
* FFLatch.Overview.1.A ([[Media:FFLatch.Overview.1.A.20111103.pdf|pdf]])
* Counter.74LS193.1.A ([[Media:Counter.74LS193.1.A.20111108.pdf|pdf]])
* Clock.Overview.1.A ([[Media:Clock.Overview.1.A.20111108.pdf|pdf]])
* Function.Overview.1.A ([[Media:Function.Overview.1.A.20111201.pdf|pdf]])
&lt;br&gt; 

== Versions of VHDL ==
* VHDL Versions ([[Media:VHDL.1.A.Versions.20120619.pdf|pdf]])
* VHDL Libraries ([[Media:VHDL.1.A.Libraries.20140219.pdf|pdf]])
&lt;br&gt;

== Basic Features of VHDL ==
==== Data ====
* Data Objects ([[Media:Data.Object.1A.20260512-1.pdf|A]], [[Media:Data.Object.1B.20260512.pdf|B]])
* Data Types ([[Media:Data.Type.2A.20260511.pdf|A]], [[Media:Data.Type.2B.20260505.pdf|B]])
* Packages ([[Media:Data.Package.3A.20251206.pdf|pdf]])
* Signal Types ([[Media:Signal.Type.1A.20250614.pdf|pdf]])
* Attributes ([[Media:Data.4.A.Attribute.20251021.pdf|pdf]])
&lt;br&gt;

==== Signals &amp; Variables ====
* Signals &amp; Variables ([[Media:Signal.1A.SigVar.20250614.pdf|pdf]])
* Sequential Signal Assignments ([[Media:Signal.4A.Sequential.20250612.pdf|pdf]])
* Concurrent &amp; Sequential Signal Assignments ([[Media:Signal.1.A.ConSeq.20120611.pdf|pdf]])
* Inertial &amp; Transport Delay Models ([[Media:Signal.2.A.InertTrans.20120704.pdf|pdf]])
* Simulation &amp; Synthesis ([[Media:Signal.3.A.SimSyn.20120504.pdf|pdf]])


&lt;br&gt;

==== Structure ====
* Component ([[Media:Struct.1.A.Component.20120804.pdf|pdf]])
* Configuration ([[Media:Struct.1.A.Configuration.20121003.pdf|pdf]])
* Generic ([[Media:Struct.1.A.Generic.20120802.pdf|pdf]])
&lt;/br&gt;

==== Entity and Architecture ====

&lt;br&gt; 
==== Block Statement ====

&lt;br&gt; 
==== Process Statement ====

&lt;br&gt;
==== Operators ====

&lt;br&gt;
==== Assignment Statement ====

&lt;br&gt; 
==== Concurrent Statement ====

&lt;br&gt; 
==== Sequential Control Statement ====

&lt;br&gt;
==== Function ====
* Function.1.A Usage ([[Media:Function.1.A.Usage.20120611.pdf|pdf]])
* Function.2.A Conversion Function ([[Media:Function.2.A.Conversion.pdf|pdf]])
* Function.3.A Resolution Function ([[Media:Function.3.A.Resolution.pdf|pdf]])

&lt;br&gt;
==== Procedure ====


&lt;br&gt;
==== Package ====
&lt;/br&gt; 
go to [ [[Electrical_%26_Computer_Engineering_Studies]] ]

[[Category:VHDL]]
[[Category:FPGA]]</text>
      <sha1>khy2mto7i9ysjoccrsakiz8rm0upoib</sha1>
    </revision>
    <revision>
      <id>2809662</id>
      <parentid>2809660</parentid>
      <timestamp>2026-05-16T16:38:41Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>/* Basic Features of VHDL */</comment>
      <origin>2809662</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="2280" sha1="7buag84peo9ka7l0jvbsxc5jo52duon" xml:space="preserve">&lt;!----------------------------------------------------------------------&gt;

== Flip Flop and Latch ==
* FFLatch.Overview.1.A ([[Media:FFLatch.Overview.1.A.20111103.pdf|pdf]])
* Counter.74LS193.1.A ([[Media:Counter.74LS193.1.A.20111108.pdf|pdf]])
* Clock.Overview.1.A ([[Media:Clock.Overview.1.A.20111108.pdf|pdf]])
* Function.Overview.1.A ([[Media:Function.Overview.1.A.20111201.pdf|pdf]])
&lt;br&gt; 

== Versions of VHDL ==
* VHDL Versions ([[Media:VHDL.1.A.Versions.20120619.pdf|pdf]])
* VHDL Libraries ([[Media:VHDL.1.A.Libraries.20140219.pdf|pdf]])
&lt;br&gt;

== Basic Features of VHDL ==
==== Data ====
* Data Objects ([[Media:Data.Object.1A.20260512-1.pdf|A]], [[Media:Data.Object.1B.20260512.pdf|B]])
* Data Types ([[Media:Data.Type.2A.20260512.pdf|A]], [[Media:Data.Type.2B.20260505.pdf|B]])
* Packages ([[Media:Data.Package.3A.20251206.pdf|pdf]])
* Signal Types ([[Media:Signal.Type.1A.20250614.pdf|pdf]])
* Attributes ([[Media:Data.4.A.Attribute.20251021.pdf|pdf]])
&lt;br&gt;

==== Signals &amp; Variables ====
* Signals &amp; Variables ([[Media:Signal.1A.SigVar.20250614.pdf|pdf]])
* Sequential Signal Assignments ([[Media:Signal.4A.Sequential.20250612.pdf|pdf]])
* Concurrent &amp; Sequential Signal Assignments ([[Media:Signal.1.A.ConSeq.20120611.pdf|pdf]])
* Inertial &amp; Transport Delay Models ([[Media:Signal.2.A.InertTrans.20120704.pdf|pdf]])
* Simulation &amp; Synthesis ([[Media:Signal.3.A.SimSyn.20120504.pdf|pdf]])


&lt;br&gt;

==== Structure ====
* Component ([[Media:Struct.1.A.Component.20120804.pdf|pdf]])
* Configuration ([[Media:Struct.1.A.Configuration.20121003.pdf|pdf]])
* Generic ([[Media:Struct.1.A.Generic.20120802.pdf|pdf]])
&lt;/br&gt;

==== Entity and Architecture ====

&lt;br&gt; 
==== Block Statement ====

&lt;br&gt; 
==== Process Statement ====

&lt;br&gt;
==== Operators ====

&lt;br&gt;
==== Assignment Statement ====

&lt;br&gt; 
==== Concurrent Statement ====

&lt;br&gt; 
==== Sequential Control Statement ====

&lt;br&gt;
==== Function ====
* Function.1.A Usage ([[Media:Function.1.A.Usage.20120611.pdf|pdf]])
* Function.2.A Conversion Function ([[Media:Function.2.A.Conversion.pdf|pdf]])
* Function.3.A Resolution Function ([[Media:Function.3.A.Resolution.pdf|pdf]])

&lt;br&gt;
==== Procedure ====


&lt;br&gt;
==== Package ====
&lt;/br&gt; 
go to [ [[Electrical_%26_Computer_Engineering_Studies]] ]

[[Category:VHDL]]
[[Category:FPGA]]</text>
      <sha1>7buag84peo9ka7l0jvbsxc5jo52duon</sha1>
    </revision>
    <revision>
      <id>2809664</id>
      <parentid>2809662</parentid>
      <timestamp>2026-05-16T17:17:46Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>/* Data */</comment>
      <origin>2809664</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="2280" sha1="qq1ty6ffpn1i1g2s2woeu119x4xwdpp" xml:space="preserve">&lt;!----------------------------------------------------------------------&gt;

== Flip Flop and Latch ==
* FFLatch.Overview.1.A ([[Media:FFLatch.Overview.1.A.20111103.pdf|pdf]])
* Counter.74LS193.1.A ([[Media:Counter.74LS193.1.A.20111108.pdf|pdf]])
* Clock.Overview.1.A ([[Media:Clock.Overview.1.A.20111108.pdf|pdf]])
* Function.Overview.1.A ([[Media:Function.Overview.1.A.20111201.pdf|pdf]])
&lt;br&gt; 

== Versions of VHDL ==
* VHDL Versions ([[Media:VHDL.1.A.Versions.20120619.pdf|pdf]])
* VHDL Libraries ([[Media:VHDL.1.A.Libraries.20140219.pdf|pdf]])
&lt;br&gt;

== Basic Features of VHDL ==
==== Data ====
* Data Objects ([[Media:Data.Object.1A.20260512-1.pdf|A]], [[Media:Data.Object.1B.20260512.pdf|B]])
* Data Types ([[Media:Data.Type.2A.20260512.pdf|A]], [[Media:Data.Type.2B.20260511.pdf|B]])
* Packages ([[Media:Data.Package.3A.20251206.pdf|pdf]])
* Signal Types ([[Media:Signal.Type.1A.20250614.pdf|pdf]])
* Attributes ([[Media:Data.4.A.Attribute.20251021.pdf|pdf]])
&lt;br&gt;

==== Signals &amp; Variables ====
* Signals &amp; Variables ([[Media:Signal.1A.SigVar.20250614.pdf|pdf]])
* Sequential Signal Assignments ([[Media:Signal.4A.Sequential.20250612.pdf|pdf]])
* Concurrent &amp; Sequential Signal Assignments ([[Media:Signal.1.A.ConSeq.20120611.pdf|pdf]])
* Inertial &amp; Transport Delay Models ([[Media:Signal.2.A.InertTrans.20120704.pdf|pdf]])
* Simulation &amp; Synthesis ([[Media:Signal.3.A.SimSyn.20120504.pdf|pdf]])


&lt;br&gt;

==== Structure ====
* Component ([[Media:Struct.1.A.Component.20120804.pdf|pdf]])
* Configuration ([[Media:Struct.1.A.Configuration.20121003.pdf|pdf]])
* Generic ([[Media:Struct.1.A.Generic.20120802.pdf|pdf]])
&lt;/br&gt;

==== Entity and Architecture ====

&lt;br&gt; 
==== Block Statement ====

&lt;br&gt; 
==== Process Statement ====

&lt;br&gt;
==== Operators ====

&lt;br&gt;
==== Assignment Statement ====

&lt;br&gt; 
==== Concurrent Statement ====

&lt;br&gt; 
==== Sequential Control Statement ====

&lt;br&gt;
==== Function ====
* Function.1.A Usage ([[Media:Function.1.A.Usage.20120611.pdf|pdf]])
* Function.2.A Conversion Function ([[Media:Function.2.A.Conversion.pdf|pdf]])
* Function.3.A Resolution Function ([[Media:Function.3.A.Resolution.pdf|pdf]])

&lt;br&gt;
==== Procedure ====


&lt;br&gt;
==== Package ====
&lt;/br&gt; 
go to [ [[Electrical_%26_Computer_Engineering_Studies]] ]

[[Category:VHDL]]
[[Category:FPGA]]</text>
      <sha1>qq1ty6ffpn1i1g2s2woeu119x4xwdpp</sha1>
    </revision>
    <revision>
      <id>2809666</id>
      <parentid>2809664</parentid>
      <timestamp>2026-05-16T17:20:48Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>/* Data */</comment>
      <origin>2809666</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="2280" sha1="8n8w5qrcvt9v7xg4s2w7o34reu3xium" xml:space="preserve">&lt;!----------------------------------------------------------------------&gt;

== Flip Flop and Latch ==
* FFLatch.Overview.1.A ([[Media:FFLatch.Overview.1.A.20111103.pdf|pdf]])
* Counter.74LS193.1.A ([[Media:Counter.74LS193.1.A.20111108.pdf|pdf]])
* Clock.Overview.1.A ([[Media:Clock.Overview.1.A.20111108.pdf|pdf]])
* Function.Overview.1.A ([[Media:Function.Overview.1.A.20111201.pdf|pdf]])
&lt;br&gt; 

== Versions of VHDL ==
* VHDL Versions ([[Media:VHDL.1.A.Versions.20120619.pdf|pdf]])
* VHDL Libraries ([[Media:VHDL.1.A.Libraries.20140219.pdf|pdf]])
&lt;br&gt;

== Basic Features of VHDL ==
==== Data ====
* Data Objects ([[Media:Data.Object.1A.20260512-1.pdf|A]], [[Media:Data.Object.1B.20260512.pdf|B]])
* Data Types ([[Media:Data.Type.2A.20260512.pdf|A]], [[Media:Data.Type.2B.20260512.pdf|B]])
* Packages ([[Media:Data.Package.3A.20251206.pdf|pdf]])
* Signal Types ([[Media:Signal.Type.1A.20250614.pdf|pdf]])
* Attributes ([[Media:Data.4.A.Attribute.20251021.pdf|pdf]])
&lt;br&gt;

==== Signals &amp; Variables ====
* Signals &amp; Variables ([[Media:Signal.1A.SigVar.20250614.pdf|pdf]])
* Sequential Signal Assignments ([[Media:Signal.4A.Sequential.20250612.pdf|pdf]])
* Concurrent &amp; Sequential Signal Assignments ([[Media:Signal.1.A.ConSeq.20120611.pdf|pdf]])
* Inertial &amp; Transport Delay Models ([[Media:Signal.2.A.InertTrans.20120704.pdf|pdf]])
* Simulation &amp; Synthesis ([[Media:Signal.3.A.SimSyn.20120504.pdf|pdf]])


&lt;br&gt;

==== Structure ====
* Component ([[Media:Struct.1.A.Component.20120804.pdf|pdf]])
* Configuration ([[Media:Struct.1.A.Configuration.20121003.pdf|pdf]])
* Generic ([[Media:Struct.1.A.Generic.20120802.pdf|pdf]])
&lt;/br&gt;

==== Entity and Architecture ====

&lt;br&gt; 
==== Block Statement ====

&lt;br&gt; 
==== Process Statement ====

&lt;br&gt;
==== Operators ====

&lt;br&gt;
==== Assignment Statement ====

&lt;br&gt; 
==== Concurrent Statement ====

&lt;br&gt; 
==== Sequential Control Statement ====

&lt;br&gt;
==== Function ====
* Function.1.A Usage ([[Media:Function.1.A.Usage.20120611.pdf|pdf]])
* Function.2.A Conversion Function ([[Media:Function.2.A.Conversion.pdf|pdf]])
* Function.3.A Resolution Function ([[Media:Function.3.A.Resolution.pdf|pdf]])

&lt;br&gt;
==== Procedure ====


&lt;br&gt;
==== Package ====
&lt;/br&gt; 
go to [ [[Electrical_%26_Computer_Engineering_Studies]] ]

[[Category:VHDL]]
[[Category:FPGA]]</text>
      <sha1>8n8w5qrcvt9v7xg4s2w7o34reu3xium</sha1>
    </revision>
  </page>
  <page>
    <title>Category:Pending deletions</title>
    <ns>14</ns>
    <id>121447</id>
    <revision>
      <id>2809901</id>
      <parentid>2666795</parentid>
      <timestamp>2026-05-17T10:59:24Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <minor />
      <origin>2809901</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="118" sha1="rdj2acekvy8bzorl376n2xso9ikcp47" xml:space="preserve">{{empty category}}
__HIDDENCAT__
__NOGALLERY__

[[Category:Wikiversity deletion]]
[[Category:Pages monitored by bots]]</text>
      <sha1>rdj2acekvy8bzorl376n2xso9ikcp47</sha1>
    </revision>
  </page>
  <page>
    <title>Permutations by cycle type</title>
    <ns>0</ns>
    <id>123290</id>
    <revision>
      <id>2809850</id>
      <parentid>2443245</parentid>
      <timestamp>2026-05-17T04:02:11Z</timestamp>
      <contributor>
        <username>HenriPittier</username>
        <id>3076895</id>
      </contributor>
      <origin>2809850</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="3363" sha1="i0gio9z9xboomjkdwqqbuysx62a57ib" xml:space="preserve">The [[w:Conjugacy class|conjugacy classes]] of the [[w:Symmetric group|symmetric group]] S&lt;sub&gt;''n''&lt;/sub&gt; are defined by the permutations' [http://groupprops.subwiki.org/wiki/Cycle_type_of_a_permutation cycle types].&lt;br&gt;
The cycle types correspond to the [[w:Partition (number theory)|integer partitions]] of ''n''. So the number of conjugacy classes of S&lt;sub&gt;''n''&lt;/sub&gt; is {{oeis|A000041}}(''n'').

&lt;small&gt;
The first 8! = 40320 finite [[w:Permutation|permutations]] have {{oeis|A000041}}(8) = 22 different cycle types corresponding to the 22 first integer partitions.&lt;br&gt;
To determine the cycle type of a permutation of up to 8 elements see [http://oeis.org/A198380/a198380_1.txt this table] (a supporting file of {{oeis|A198380}}).
&lt;/small&gt;

==Refined rencontres numbers==

The irregular triangle {{oeis|A181897}} shows how many permutations of ''n''=0..8 elements have cycle type &lt;span style=&quot;color:#c07&quot;&gt;''i''&lt;/span&gt;=0..21,&lt;br&gt;
where &lt;span style=&quot;color:#c07&quot;&gt;''i''&lt;/span&gt; is an index number of {{oeis|A194602}}, denoting an [[Integer partitions|integer partition]].
&lt;small&gt;(E.g. column &lt;span style=&quot;color:#c07&quot;&gt;11&lt;/span&gt; counts the number of permutations with a 3-cycle and two 2-cycles.)&lt;/small&gt;&lt;br&gt;
The columns are grouped together based on how many elements ''k''=0..8 are moved. &lt;small&gt;(There is no column for ''k''=1, because no permutation can move only one element.)&lt;/small&gt;&lt;br&gt;

{{Delete}}

An entry in row ''n'' and column group ''k'' is the product of the {{w|binomial coefficient|binomial}} &lt;math&gt;\tbinom{n}{k}&lt;/math&gt; and the top entry of the column.&lt;br&gt;
The sequence of top entries could be called the '''refined subfactorials''', and might be denoted &lt;math&gt;?i&lt;/math&gt;.&lt;br&gt;
So the triangle entries can be derived from {{w|Pascal's triangle}} and the refined subfactorials:  &amp;nbsp; &lt;small&gt;(''k'' implicitly derived from ''i''.)&lt;/small&gt;

&lt;math&gt;T(n,i) ~=~ \binom{n}{k} ~\cdot~ ?i&lt;/math&gt;

The last column in column group ''k'' counts the permutations with a complete ''k''-cycle.&lt;br&gt;
An interesting fact is that the refined subfactorials in these columns are factorials, namely &lt;math&gt;(k-1)!&lt;/math&gt;.&lt;br&gt;
This means that among the &lt;math&gt;!k&lt;/math&gt; derangements of ''k'' elements there are &lt;math&gt;(k-1)!&lt;/math&gt; with complete ''k''-cycles.
&lt;small&gt;(E.g. [[:File:Orderings; permutations 5-cycle.svg|here]] are the 24 derangements with 5-cycles.)&lt;/small&gt;&lt;br&gt;
&lt;small&gt;By excluding the full cycles one could define this rather silly sequence: 0, 0, 0, 0, 3, 20, 145, 1134, 9793...&lt;/small&gt;


&lt;small&gt;Some rows have repeating entries, e.g. row 4 contains entry 6 twice. The number of distinct entries per row is {{oeis|A073906}}.&lt;br&gt;&lt;/small&gt;

&lt;small&gt;This triangle (with the same order of partitions) is shown in [https://doczz.biz.tr/doc/101718/sayma---nesin-matematik-k%C3%B6y%C3%BC ''Sayma (ya da Kombinasyon Hesapları)''] by Ali Nesin (p. 151).
&lt;/small&gt;

==Rencontres numbers==

This is the triangle {{oeis|A098825}} of {{w|rencontres numbers}} ordered by number of moved elements ''k''. &lt;small&gt;(Usually they are ordered by number of fixed points.)&lt;/small&gt;&lt;br&gt;
Its entries are the product of binomials and subfactorials. The subfactorial &lt;math&gt;!k&lt;/math&gt; is the number of {{w|derangement}}s of ''k'' elements.&lt;br&gt;

&lt;math&gt;T(n,k) ~=~ \binom{n}{k} ~\cdot~ !k&lt;/math&gt;

{{Rencontres numbers by number of moved elements}}


[[Category:Cycle structure of permutations]]</text>
      <sha1>i0gio9z9xboomjkdwqqbuysx62a57ib</sha1>
    </revision>
    <revision>
      <id>2809852</id>
      <parentid>2809850</parentid>
      <timestamp>2026-05-17T04:30:23Z</timestamp>
      <contributor>
        <username>NguoiDungKhongDinhDanh</username>
        <id>2922842</id>
      </contributor>
      <minor />
      <comment>Reverted edit by [[Special:Contributions/HenriPittier|HenriPittier]] ([[User_talk:HenriPittier|talk]]) to last version by [[User:88.97.96.89|88.97.96.89]] using [[Wikiversity:Rollback|rollback]]</comment>
      <origin>2443245</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="3383" sha1="6rqcgh5m4wu5bvq4wqp9bisuljr7yzk" xml:space="preserve">The [[w:Conjugacy class|conjugacy classes]] of the [[w:Symmetric group|symmetric group]] S&lt;sub&gt;''n''&lt;/sub&gt; are defined by the permutations' [http://groupprops.subwiki.org/wiki/Cycle_type_of_a_permutation cycle types].&lt;br&gt;
The cycle types correspond to the [[w:Partition (number theory)|integer partitions]] of ''n''. So the number of conjugacy classes of S&lt;sub&gt;''n''&lt;/sub&gt; is {{oeis|A000041}}(''n'').

&lt;small&gt;
The first 8! = 40320 finite [[w:Permutation|permutations]] have {{oeis|A000041}}(8) = 22 different cycle types corresponding to the 22 first integer partitions.&lt;br&gt;
To determine the cycle type of a permutation of up to 8 elements see [http://oeis.org/A198380/a198380_1.txt this table] (a supporting file of {{oeis|A198380}}).
&lt;/small&gt;

==Refined rencontres numbers==

The irregular triangle {{oeis|A181897}} shows how many permutations of ''n''=0..8 elements have cycle type &lt;span style=&quot;color:#c07&quot;&gt;''i''&lt;/span&gt;=0..21,&lt;br&gt;
where &lt;span style=&quot;color:#c07&quot;&gt;''i''&lt;/span&gt; is an index number of {{oeis|A194602}}, denoting an [[Integer partitions|integer partition]].
&lt;small&gt;(E.g. column &lt;span style=&quot;color:#c07&quot;&gt;11&lt;/span&gt; counts the number of permutations with a 3-cycle and two 2-cycles.)&lt;/small&gt;&lt;br&gt;
The columns are grouped together based on how many elements ''k''=0..8 are moved. &lt;small&gt;(There is no column for ''k''=1, because no permutation can move only one element.)&lt;/small&gt;&lt;br&gt;

{{Refined rencontres numbers}}

An entry in row ''n'' and column group ''k'' is the product of the {{w|binomial coefficient|binomial}} &lt;math&gt;\tbinom{n}{k}&lt;/math&gt; and the top entry of the column.&lt;br&gt;
The sequence of top entries could be called the '''refined subfactorials''', and might be denoted &lt;math&gt;?i&lt;/math&gt;.&lt;br&gt;
So the triangle entries can be derived from {{w|Pascal's triangle}} and the refined subfactorials:  &amp;nbsp; &lt;small&gt;(''k'' implicitly derived from ''i''.)&lt;/small&gt;

&lt;math&gt;T(n,i) ~=~ \binom{n}{k} ~\cdot~ ?i&lt;/math&gt;

The last column in column group ''k'' counts the permutations with a complete ''k''-cycle.&lt;br&gt;
An interesting fact is that the refined subfactorials in these columns are factorials, namely &lt;math&gt;(k-1)!&lt;/math&gt;.&lt;br&gt;
This means that among the &lt;math&gt;!k&lt;/math&gt; derangements of ''k'' elements there are &lt;math&gt;(k-1)!&lt;/math&gt; with complete ''k''-cycles.
&lt;small&gt;(E.g. [[:File:Orderings; permutations 5-cycle.svg|here]] are the 24 derangements with 5-cycles.)&lt;/small&gt;&lt;br&gt;
&lt;small&gt;By excluding the full cycles one could define this rather silly sequence: 0, 0, 0, 0, 3, 20, 145, 1134, 9793...&lt;/small&gt;


&lt;small&gt;Some rows have repeating entries, e.g. row 4 contains entry 6 twice. The number of distinct entries per row is {{oeis|A073906}}.&lt;br&gt;&lt;/small&gt;

&lt;small&gt;This triangle (with the same order of partitions) is shown in [https://doczz.biz.tr/doc/101718/sayma---nesin-matematik-k%C3%B6y%C3%BC ''Sayma (ya da Kombinasyon Hesapları)''] by Ali Nesin (p. 151).
&lt;/small&gt;

==Rencontres numbers==

This is the triangle {{oeis|A098825}} of {{w|rencontres numbers}} ordered by number of moved elements ''k''. &lt;small&gt;(Usually they are ordered by number of fixed points.)&lt;/small&gt;&lt;br&gt;
Its entries are the product of binomials and subfactorials. The subfactorial &lt;math&gt;!k&lt;/math&gt; is the number of {{w|derangement}}s of ''k'' elements.&lt;br&gt;

&lt;math&gt;T(n,k) ~=~ \binom{n}{k} ~\cdot~ !k&lt;/math&gt;

{{Rencontres numbers by number of moved elements}}


[[Category:Cycle structure of permutations]]</text>
      <sha1>6rqcgh5m4wu5bvq4wqp9bisuljr7yzk</sha1>
    </revision>
  </page>
  <page>
    <title>Template:Talk header</title>
    <ns>10</ns>
    <id>133413</id>
    <revision>
      <id>2809740</id>
      <parentid>2765653</parentid>
      <timestamp>2026-05-16T20:15:07Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>Updating for dark mode support.</comment>
      <origin>2809740</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="2873" sha1="0wkfbvf4ql5kduzsne9858qeb2v55xj" xml:space="preserve">&lt;templatestyles src=&quot;Module:Message box/tmbox.css&quot;/&gt;&lt;templatestyles src=&quot;Talk header/styles.css&quot; /&gt;{{#ifeq: {{{bottom}}} | yes
| {{Tmbox
| small = {{{small|}}}
| image = none
| style = text-align: center
| text  = {{Strong|Please place new discussions at the bottom of the talk page.}}
}}
}}&lt;table role=&quot;presentation&quot; class=&quot;tmbox tmbox-notice talkheader plainlinks&quot; id=&quot;talkheader&quot; style=&quot;border-collapse: separate;&quot;&gt;&lt;tr&gt;
&lt;td style=&quot;border-bottom: 1px solid #c0c090; font-weight: bold;&quot;&gt;{{#ifeq:{{NAMESPACE}}|User talk|This is [[{{SUBJECTPAGENAME}}|{{PAGENAME}}]]'s [[WV:Discussing|discussion page]], where you can send messages and comments to {{PAGENAME}}.|This is the [[WV:Discussing|discussion page]] for discussing {{#if:{{{wp|}}}|[[:{{SUBJECTPAGENAME}}|{{PAGENAME}}]] and anything related to its purposes and tasks|improvements to the [[:{{SUBJECTPAGENAME}}|{{PAGENAME}}]] {{pagetype}}}}.}}&lt;/td&gt;
&lt;/tr&gt;
&lt;tr&gt;
&lt;td&gt;
&lt;div class=&quot;talkheader-body&quot;&gt;
&lt;div class=&quot;talkheader-help&quot;&gt;
* '''Put new text under old text.''' [{{fullurl:{{TALKPAGENAMEE}}|action=edit&amp;section=new}} Click here to start a new topic].
* '''Please sign and date your posts''' by typing four tildes (&lt;code&gt;&lt;nowiki&gt;~~~~&lt;/nowiki&gt;&lt;/code&gt;).
* '''New to Wikiversity?''' [[Wikiversity:Welcome|Welcome]]! [[Wikiversity:Colloquium|Ask questions, get answers]].
&lt;/div&gt;
&lt;div class=&quot;talkheader-policies&quot;&gt;
* [[Wikiversity:Civility|Be polite]]
* [[Wikiversity:Assume good faith|Assume good faith]]
* [[Wikiversity:Please do not bite the newcomers|Be welcoming]]
* [[Wikiversity:Civility|Avoid personal attacks]]
&lt;/div&gt;{{#switch:yes|{{{txtpol|}}}|{{#if: {{SUBJECTSPACE}} | no | yes}}=
&lt;div class=&quot;talkheader-policies&quot;&gt;
&lt;div&gt;'''Textbook policies:'''
* [[Wikiversity:Original research|No original research]]
* [[Wikiversity:Neutral point of view|Neutral point of view]]
* [[Wikiversity:What is Wikiversity|Stay in scope]]
&lt;/div&gt;
&lt;/div&gt;
}}{{#if: {{{1|}}}{{{shortcut|}}}{{{shortcut1|}}}{{{sc|}}}{{{sc1|}}} |
&lt;div class=&quot;talkheader-shortcuts&quot;&gt;
{{Shortcut|{{{1|{{{shortcut|{{{shortcut1|{{{sc|{{{sc1|}}}}}}}}}}}}}}}|{{{2|{{{shortcut2|{{{sc2|}}}}}}}}}|{{{3|{{{shortcut3|{{{sc3|}}}}}}}}}|{{{4|{{{shortcut4|{{{sc4|}}}}}}}}}|{{{5|{{{shortcut5|{{{sc5|}}}}}}}}} }}
&lt;/div&gt;
}}
&lt;/div&gt;
&lt;/td&gt;
&lt;/tr&gt;{{#if:{{{noarchive|{{{noarchives|}}}}}}||{{#ifexist:{{FULLPAGENAME}}/Archive 1|
&lt;tr&gt;&lt;td colspan=4 style=&quot;text-align: center; border-top: 1px solid #c0c090; padding: 1px 3px&quot;&gt;'''Archives:''' {{#ifexist:{{FULLPAGENAME}}/Archive index|[[{{FULLPAGENAME}}/Archive index|Index]],&amp;#32;}}{{Archive list|nobr=yes|root={{FULLPAGENAME}}}}&lt;/td&gt;
&lt;/tr&gt;
}}
}}
{{#if:{{{search|}}}|
&lt;tr&gt;&lt;td colspan=4 style=&quot;text-align: center; border-top: 1px solid #c0c090; padding: 0&quot;&gt;&lt;inputbox&gt;
type=fulltext
prefix={{#tag:nowiki|{{FULLPAGENAME}}/}}
searchbuttonlabel=Search archives
break=no
&lt;/inputbox&gt;&lt;/td&gt;
&lt;/tr&gt;
}}
&lt;/table&gt;&lt;noinclude&gt;
{{Documentation}}
&lt;/noinclude&gt;</text>
      <sha1>0wkfbvf4ql5kduzsne9858qeb2v55xj</sha1>
    </revision>
  </page>
  <page>
    <title>Vietnamese 1/Script and grammar</title>
    <ns>0</ns>
    <id>135725</id>
    <revision>
      <id>2809895</id>
      <parentid>2758115</parentid>
      <timestamp>2026-05-17T10:29:36Z</timestamp>
      <contributor>
        <username>MathXplore</username>
        <id>2888076</id>
      </contributor>
      <minor />
      <comment>Reverted edit by [[Special:Contributions/~2025-27738-98|~2025-27738-98]] ([[User_talk:~2025-27738-98|talk]]) to last version by [[User:MathXplore|MathXplore]] using [[Wikiversity:Rollback|rollback]]</comment>
      <origin>2591539</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="7020" sha1="15rg14l93b9g3kx6fxcqezl0q2z21ss" xml:space="preserve">This is a guide for [[Portal:Foreign Language Learning|Languages]] --&gt; [[Portal:Southeast Asian languages|Southeast Asian languages]] --&gt; [[Portal:Vietnamese|Vietnamese Language]] --&gt; Viet script and grammar

'''Vietnamese''' ([http://vi.wikipedia.org/wiki/Tiếng_Việt Tiếng Việt] is the official language of [[Comparative law and justice/Vietnam|Vietnam]]) this lesson explains it's constructive use as a second language for English speakers. 

{| border=&quot;1&quot; cellpadding=&quot;2&quot; cellspacing=&quot;0&quot; align=&quot;right&quot; width=&quot;300&quot;
! colspan=&quot;2&quot; bgcolor=&quot;lightcoral&quot; style=&quot;font-size:120%&quot;|Language of [[Comparative law and justice/Vietnam|Vietnam]] ([http://vi.wikipedia.org/wiki/Tiếng_Việt Tiếng_Việt])
|-
| valign=&quot;top&quot;|Speakers:
| valign=&quot;top&quot;|91.5 million + overseas population
|-
|English name:     
|Vietnamese
|-
|Language name:
|[http://vi.wikipedia.org/wiki/Tiếng_Việt Tiếng Việt]
|-
|Spoken in:
|[[Comparative law and justice/Vietnam|Vietnam]] and [[Wikipedia:Overseas Vietnamese|overseas population]]
|-
|Pronunciation:   
|Hanoian, Saigon, Huế, Mekong, Ethnic, [[Wikipedia:Overseas Vietnamese|Overseas]]
|-
|Official Language:
|[[Comparative law and justice/Vietnam|Vietnam]]
|-
|Family of languages:
|Austro Asiatic
|-
|Relatives:
|[http://www.offroadvietnam.com/elpophtml/kinh.htm Viet], Hmong, [[Khmer]]
|- 
|Writing system:        
|[http://vi.wikipedia.org/wiki/Quốc_ngữ Quốc Ngữ], [http://vi.wikipedia.org/wiki/Chữ_Nôm Chữ_Nôm])
|}

&lt;br&gt;

{{Big3|Vietnamese as a Second Language}}

{{RoundBoxTop|theme=2}}
==Language System==
===Spoken===
The spoken language of Vietnam differs between provinces. The greater the distance between provinces the stronger the difference. Directly the difference between Hanoian and Saigon, Mekong was once called a dialect difference. Nowadays, the education for all of Vietnam includes the Hanoian dialect. 
However, each ethnic tribe can have less national education between parents, and may still have a different dialect or vocabulary.
====In computers====
Currently, there are speaking programs that use the Vietnamese language properly. A commonly available Mozilla Add-on for the Firefox web browser can read Vietnamese (or text) with the 'vietnamization' that is needed. It's called Vietnamese TTS. TTS means Text to Speech. 
Audio libraries are available to reproduce the Vietnamese language. [http://translate.google.com Google translate] uses a TTS reader and sound library to read Vietnamese in simple sentences.
Hand held versions are also very popular. [http://www.kimtudien.vn/ Kim Tu Dien] makes the most common pocket dictionary for the Vietnamese market.
{{RoundBoxBottom}}
{{RoundBoxTop|theme=4}}

===Script===

====Alphabet====
The [[Vietnamese 1/Alphabet|Vietnamese alphabet]]. 

====Vietnamese dipthongs====
The combination of two vowels makes a dipthong. The dipthongs used in the Vietnamese language have some rules when used. For example, one rule states where the singular tone marking for both letters must be placed.

====Vietnamese tripthongs====
There are more tripthongs in Vietnamese than English. 'uye' is included.
====Vietnamese syllables====
The syllables refers to the Chinese use of at least two characters as syllables. So, Hong is one and Kong the other. 
Vietnamese also uses singular syllables as words (monosyllabic). 
For example: in the same way as English, people can say just 'go'. For more emphasis (in Vietnamese) it could be said twice. The use of the syllable twice is from the history of languages for Asia. Some Australian Aboriginal languages are known do the same thing &lt;ref&gt;http://en.wikipedia.org/wiki/Wiradjuri&lt;/ref&gt;. So, 'go - go' (đi đi)&lt;ref&gt;http://vi.wikipedia.org/wiki/Silva_Kaputikyan&lt;/ref&gt; means definitely go. But also, 'go' would have been enough in Vietnamese. 
Many singular syllables are used by the Vietnamese language. They can form sentences without pairing with other syllables as they do in [[Portal:Chinese|Chinese]]. Readers (and speakers) still notice that many syllables, in most sentences, are paired.

===Vietnamization===
Many words from around the world were needed in Vietnamese. When a word gets vietnamization it is changed to sound Vietnamese. [[Portal:Chinese|Chinese]] uses the same method of conversion Ao-day-lia in Pinyin means Australia.

====The first rule==== 
The first rule for vietnamization is that ''''no Vietnamese word/syllable is broken by a consonant''''. E.g. ([http://vi.wiktionary.org/wiki/Việt_Nam Việt Nam]).
An example of how to break a foreign word into two syllables is '''[http://vi.wiktionary.org/wiki/mô_tô mô tô]''' which is used for motorbike. It's not the most common word for motorbike, but it is accepted. This word is a vietnamized version of 'motor' and 'auto'([http://vi.wiktionary.org/wiki/ô_tô ô tô]). &lt;br&gt;
But, the rule isn't used in every vietnamization of a word, e.g. [http://vi.wiktionary.org/wiki/lôgic lôgic]. 
When introducing a common foreign word, people 'vietnamize' the word in at least one spoken demonstration for Vietnamese listeners.  

*This rule should explain a problem with the foreign use of the name Nguyen. It will never be New Yen! '''Y''' is not a consonant in [[Comparative law and justice/Vietnam|Vietnam]]. A better explanation is by comparing the English name ''Ian'' to any name with '''Yen'''( e.g. Yến). This use of '''Y''' has an equal in English: many, penny, etc use the vowel 'y'.

====The second rule==== 
The second (softer) rule for vietnamization is that the sound of each syllable must be made 'a little closer to Viet sounds'.
The second rule is made to work by adding the tone marks for vowel letters.
For example: [http://vi.wiktionary.org/wiki/lôgic lôgic]is an alteration of 'logic'. It would be needed to teach a couple of school and science subjects. Computer science uses this word.

====Exceptions====
Any word can be made an exception to vietnamization. 
*Names like Barak Obama, or Bill Clinton might be attempted by all Vietnamese speakers. In writing, these foreign names will mostly stay intact. 
*Names like David are easy for Vietnamese people to say, and have become very popular in English-class textbook writing.   
*Chemistry has various exceptions to Vietnamization rules. A chemical name may stay intact in script, but vietnamized in speaking. 
*Computer jargon and proprietary names may remain completely intact with only slight accent differences when speaking.
{{RoundBoxBottom}}
{{RoundBoxTop|theme=2}}
==Grammar==
===Sentence beginnings===

* sau đó, (after that)
* trước khi, (before when)


* mình yêu, (I love)
* Tôi đang ở, (I am at)
* anh có, (you (fellow) have)


* ở chợ, (at the market)
* Có hạt, (Has nut)
* đây là, (this is)

* Đúng, tôi, sẽ được (Correct, I will be able)
* Xin anh, (Please, you)


* đi ủi, (To iron/press, Go iron)
* Mang cho tôi,(Bring for me)


{{RoundBoxBottom}}
{{sisterlinks|Vietnamese}}
==References==

{{Reflist}}

[[Category:Vietnamese]]
[[Category:Grammar]]</text>
      <sha1>15rg14l93b9g3kx6fxcqezl0q2z21ss</sha1>
    </revision>
  </page>
  <page>
    <title>Linux System programming in plain view</title>
    <ns>0</ns>
    <id>136794</id>
    <revision>
      <id>2809781</id>
      <parentid>2807820</parentid>
      <timestamp>2026-05-17T01:00:33Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>/* File System */</comment>
      <origin>2809781</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="3197" sha1="mkq3cfdkf2q34x1g5lns8g78u53la89" xml:space="preserve">This course belongs to the [[Electrical &amp; Computer Engineering Studies]]

== Introduction ==
* Introduction ([[Media:SysP.Intro.20161128.pdf|pdf]])

== File System ==
* File System ([[Media:SysP.FileSystem.20251023.pdf|pdf]])
* File Pointer ([[Media:SysP..FilePointer.20161103.pdf|pdf]])
* System Calls ([[Media:SysP.File.SysCall.20161128.pdf|pdf]])
* File IO ([[Media:SysP.FileIO.20251023.pdf|pdf]])


* Copilot: File System ([[Media:glibcFileSystem.20251029-2.pdf|pdf]])
* Copilot: File Buffer ([[Media:glibcFileBuffer.20251025-2.pdf|pdf]])
* Copilot: File IO ([[Media:glibcFileIO.20251025-2.pdf|pdf]])
* Copilot: File Permission ([[Media:glibcFilePerm.20260121.pdf|pdf]])
* Copilot: File Control ([[Media:CP.FileCntl.20260428.pdf|pdf]], [[Media:CP.FileCntl.A.20260511.pdf|A]], [[Media:CP.FileCntl.B.20260504.pdf|B]], [[Media:CP.FileCntl.C.20260501.pdf|C]])

&lt;br&gt;
&lt;br&gt;

== Process ==
* Process  ([[Media:SysP.Process.20251120.pdf|pdf]])
* Fork  ([[Media:SysP.Fork.20251126.pdf|pdf]])


* Copilot: Process Information ([[Media:glibc.Process.1Info.20251101.pdf|pdf]])
* Copilot: Process Control ([[Media:glibc.Process.2Control.20251103.pdf|pdf]])
* Copilot: Process Execution ([[Media:glibc.Proc.3Exec.20251105.pdf|pdf]])
* Copilot: Process Fork ([[Media:glibc.Proc.4Fork.20251106.pdf|pdf]])
* Copilot: Process Context Switching ([[Media:glibc.Proc.5Context.20251107.pdf|pdf]])
* Copilot: Process Exec family of functions ([[Media:glibc.Proc.6ExecCall.20251112.pdf|pdf]])
* Copilot: Process Wait family of functions ([[Media:glibc.Proc.7WaitCall.20251112.pdf|pdf]])
* Copilot: Process Exit ([[Media:glibc.Proc.8Exit.20251113.pdf|pdf]])

&lt;/br&gt;

== Inter Process Communication==

=== Signal ===
* Signal  ([[Media:SysP.7.A.Signal.20121206.pdf|pdf]])


* Copilot: Signal 1. Alarm ([[Media:glibc.Signal.Alarm.20251201.pdf|pdf]])
* Copilot: Signal 2. Other Functions ([[Media:glibc.Signal.2Other.20251205.pdf|pdf]])

&lt;/br&gt;

=== Pipe ===

* Pipe ([[Media:SysP.3.A.IPC.20121115.pdf|pdf]])


* Copilot: Pipe 1. A Special File ([[Media:glibc.Pipe.File.20260307.pdf|pdf]])

&lt;/br&gt;

=== System V IPC ===

* Message Queue  ([[Media:SysP.5.A.MessageQ.20121213.pdf|pdf]])

* Shared Memory  ([[Media:SysP.8.A.SharedMem.20121227.pdf|pdf]])

* Semaphore  ([[Media:SysP.6.A.Semaphore.20251215.pdf|pdf]])

&lt;/br&gt;

* Copilot: Message Queue ([[Media:glibc.MessageQ.20251202.pdf|pdf]])
* Copilot: Shared Memory ([[Media:glibc.SharedMem.20251203.pdf|pdf]])
* Copilot: Semaphore ([[Media:glibc.Semaphore.20251215.pdf|pdf]])

&lt;/br&gt;

=== Socket ===

* Socket  ([[Media:SysP.4.A.Socket.20121122.pdf|pdf]])

&lt;/br&gt;

== Thread ==
* POSIX thread (pthread)  ([[Media:SysP.9.A.Pthread.20130225.pdf|pdf]])

==External links==
* [http://www.tldp.org/LDP/tlk/tlk.html The Linux Kernel]
* [http://www.tldp.org/LDP/lpg/lpg.html The Linux Programmer's Guide]
* [http://www.cs.cf.ac.uk/Dave/C/ Programming in C - UNIX System Calls and Subroutines using C.]
* [http://www.cs.cmu.edu/afs/cs/academic/class/15492-f07/www/pthreads.html POSIX thread (pthread) libraries]
* [https://computing.llnl.gov/tutorials/pthreads/#Thread POSIX Threads Programming]

[[Category:Linux]]
[[Category:Computer programming]]
[[Category:C programming language]]</text>
      <sha1>mkq3cfdkf2q34x1g5lns8g78u53la89</sha1>
    </revision>
    <revision>
      <id>2809783</id>
      <parentid>2809781</parentid>
      <timestamp>2026-05-17T01:01:35Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>/* File System */</comment>
      <origin>2809783</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="3197" sha1="75ysmayxvicf97xgmbqb0wj26nzmajv" xml:space="preserve">This course belongs to the [[Electrical &amp; Computer Engineering Studies]]

== Introduction ==
* Introduction ([[Media:SysP.Intro.20161128.pdf|pdf]])

== File System ==
* File System ([[Media:SysP.FileSystem.20251023.pdf|pdf]])
* File Pointer ([[Media:SysP..FilePointer.20161103.pdf|pdf]])
* System Calls ([[Media:SysP.File.SysCall.20161128.pdf|pdf]])
* File IO ([[Media:SysP.FileIO.20251023.pdf|pdf]])


* Copilot: File System ([[Media:glibcFileSystem.20251029-2.pdf|pdf]])
* Copilot: File Buffer ([[Media:glibcFileBuffer.20251025-2.pdf|pdf]])
* Copilot: File IO ([[Media:glibcFileIO.20251025-2.pdf|pdf]])
* Copilot: File Permission ([[Media:glibcFilePerm.20260121.pdf|pdf]])
* Copilot: File Control ([[Media:CP.FileCntl.20260428.pdf|pdf]], [[Media:CP.FileCntl.A.20260512.pdf|A]], [[Media:CP.FileCntl.B.20260504.pdf|B]], [[Media:CP.FileCntl.C.20260501.pdf|C]])

&lt;br&gt;
&lt;br&gt;

== Process ==
* Process  ([[Media:SysP.Process.20251120.pdf|pdf]])
* Fork  ([[Media:SysP.Fork.20251126.pdf|pdf]])


* Copilot: Process Information ([[Media:glibc.Process.1Info.20251101.pdf|pdf]])
* Copilot: Process Control ([[Media:glibc.Process.2Control.20251103.pdf|pdf]])
* Copilot: Process Execution ([[Media:glibc.Proc.3Exec.20251105.pdf|pdf]])
* Copilot: Process Fork ([[Media:glibc.Proc.4Fork.20251106.pdf|pdf]])
* Copilot: Process Context Switching ([[Media:glibc.Proc.5Context.20251107.pdf|pdf]])
* Copilot: Process Exec family of functions ([[Media:glibc.Proc.6ExecCall.20251112.pdf|pdf]])
* Copilot: Process Wait family of functions ([[Media:glibc.Proc.7WaitCall.20251112.pdf|pdf]])
* Copilot: Process Exit ([[Media:glibc.Proc.8Exit.20251113.pdf|pdf]])

&lt;/br&gt;

== Inter Process Communication==

=== Signal ===
* Signal  ([[Media:SysP.7.A.Signal.20121206.pdf|pdf]])


* Copilot: Signal 1. Alarm ([[Media:glibc.Signal.Alarm.20251201.pdf|pdf]])
* Copilot: Signal 2. Other Functions ([[Media:glibc.Signal.2Other.20251205.pdf|pdf]])

&lt;/br&gt;

=== Pipe ===

* Pipe ([[Media:SysP.3.A.IPC.20121115.pdf|pdf]])


* Copilot: Pipe 1. A Special File ([[Media:glibc.Pipe.File.20260307.pdf|pdf]])

&lt;/br&gt;

=== System V IPC ===

* Message Queue  ([[Media:SysP.5.A.MessageQ.20121213.pdf|pdf]])

* Shared Memory  ([[Media:SysP.8.A.SharedMem.20121227.pdf|pdf]])

* Semaphore  ([[Media:SysP.6.A.Semaphore.20251215.pdf|pdf]])

&lt;/br&gt;

* Copilot: Message Queue ([[Media:glibc.MessageQ.20251202.pdf|pdf]])
* Copilot: Shared Memory ([[Media:glibc.SharedMem.20251203.pdf|pdf]])
* Copilot: Semaphore ([[Media:glibc.Semaphore.20251215.pdf|pdf]])

&lt;/br&gt;

=== Socket ===

* Socket  ([[Media:SysP.4.A.Socket.20121122.pdf|pdf]])

&lt;/br&gt;

== Thread ==
* POSIX thread (pthread)  ([[Media:SysP.9.A.Pthread.20130225.pdf|pdf]])

==External links==
* [http://www.tldp.org/LDP/tlk/tlk.html The Linux Kernel]
* [http://www.tldp.org/LDP/lpg/lpg.html The Linux Programmer's Guide]
* [http://www.cs.cf.ac.uk/Dave/C/ Programming in C - UNIX System Calls and Subroutines using C.]
* [http://www.cs.cmu.edu/afs/cs/academic/class/15492-f07/www/pthreads.html POSIX thread (pthread) libraries]
* [https://computing.llnl.gov/tutorials/pthreads/#Thread POSIX Threads Programming]

[[Category:Linux]]
[[Category:Computer programming]]
[[Category:C programming language]]</text>
      <sha1>75ysmayxvicf97xgmbqb0wj26nzmajv</sha1>
    </revision>
    <revision>
      <id>2809799</id>
      <parentid>2809783</parentid>
      <timestamp>2026-05-17T01:14:42Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>/* File System */</comment>
      <origin>2809799</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="3199" sha1="t8vyf9tosiurklbhsrcnnvyn32xwdy5" xml:space="preserve">This course belongs to the [[Electrical &amp; Computer Engineering Studies]]

== Introduction ==
* Introduction ([[Media:SysP.Intro.20161128.pdf|pdf]])

== File System ==
* File System ([[Media:SysP.FileSystem.20251023.pdf|pdf]])
* File Pointer ([[Media:SysP..FilePointer.20161103.pdf|pdf]])
* System Calls ([[Media:SysP.File.SysCall.20161128.pdf|pdf]])
* File IO ([[Media:SysP.FileIO.20251023.pdf|pdf]])


* Copilot: File System ([[Media:glibcFileSystem.20251029-2.pdf|pdf]])
* Copilot: File Buffer ([[Media:glibcFileBuffer.20251025-2.pdf|pdf]])
* Copilot: File IO ([[Media:glibcFileIO.20251025-2.pdf|pdf]])
* Copilot: File Permission ([[Media:glibcFilePerm.20260121.pdf|pdf]])
* Copilot: File Control ([[Media:CP.FileCntl.20260428.pdf|pdf]], [[Media:CP.FileCntl.A.20260511-1.pdf|A]], [[Media:CP.FileCntl.B.20260504.pdf|B]], [[Media:CP.FileCntl.C.20260501.pdf|C]])

&lt;br&gt;
&lt;br&gt;

== Process ==
* Process  ([[Media:SysP.Process.20251120.pdf|pdf]])
* Fork  ([[Media:SysP.Fork.20251126.pdf|pdf]])


* Copilot: Process Information ([[Media:glibc.Process.1Info.20251101.pdf|pdf]])
* Copilot: Process Control ([[Media:glibc.Process.2Control.20251103.pdf|pdf]])
* Copilot: Process Execution ([[Media:glibc.Proc.3Exec.20251105.pdf|pdf]])
* Copilot: Process Fork ([[Media:glibc.Proc.4Fork.20251106.pdf|pdf]])
* Copilot: Process Context Switching ([[Media:glibc.Proc.5Context.20251107.pdf|pdf]])
* Copilot: Process Exec family of functions ([[Media:glibc.Proc.6ExecCall.20251112.pdf|pdf]])
* Copilot: Process Wait family of functions ([[Media:glibc.Proc.7WaitCall.20251112.pdf|pdf]])
* Copilot: Process Exit ([[Media:glibc.Proc.8Exit.20251113.pdf|pdf]])

&lt;/br&gt;

== Inter Process Communication==

=== Signal ===
* Signal  ([[Media:SysP.7.A.Signal.20121206.pdf|pdf]])


* Copilot: Signal 1. Alarm ([[Media:glibc.Signal.Alarm.20251201.pdf|pdf]])
* Copilot: Signal 2. Other Functions ([[Media:glibc.Signal.2Other.20251205.pdf|pdf]])

&lt;/br&gt;

=== Pipe ===

* Pipe ([[Media:SysP.3.A.IPC.20121115.pdf|pdf]])


* Copilot: Pipe 1. A Special File ([[Media:glibc.Pipe.File.20260307.pdf|pdf]])

&lt;/br&gt;

=== System V IPC ===

* Message Queue  ([[Media:SysP.5.A.MessageQ.20121213.pdf|pdf]])

* Shared Memory  ([[Media:SysP.8.A.SharedMem.20121227.pdf|pdf]])

* Semaphore  ([[Media:SysP.6.A.Semaphore.20251215.pdf|pdf]])

&lt;/br&gt;

* Copilot: Message Queue ([[Media:glibc.MessageQ.20251202.pdf|pdf]])
* Copilot: Shared Memory ([[Media:glibc.SharedMem.20251203.pdf|pdf]])
* Copilot: Semaphore ([[Media:glibc.Semaphore.20251215.pdf|pdf]])

&lt;/br&gt;

=== Socket ===

* Socket  ([[Media:SysP.4.A.Socket.20121122.pdf|pdf]])

&lt;/br&gt;

== Thread ==
* POSIX thread (pthread)  ([[Media:SysP.9.A.Pthread.20130225.pdf|pdf]])

==External links==
* [http://www.tldp.org/LDP/tlk/tlk.html The Linux Kernel]
* [http://www.tldp.org/LDP/lpg/lpg.html The Linux Programmer's Guide]
* [http://www.cs.cf.ac.uk/Dave/C/ Programming in C - UNIX System Calls and Subroutines using C.]
* [http://www.cs.cmu.edu/afs/cs/academic/class/15492-f07/www/pthreads.html POSIX thread (pthread) libraries]
* [https://computing.llnl.gov/tutorials/pthreads/#Thread POSIX Threads Programming]

[[Category:Linux]]
[[Category:Computer programming]]
[[Category:C programming language]]</text>
      <sha1>t8vyf9tosiurklbhsrcnnvyn32xwdy5</sha1>
    </revision>
    <revision>
      <id>2809801</id>
      <parentid>2809799</parentid>
      <timestamp>2026-05-17T01:16:14Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>/* File System */</comment>
      <origin>2809801</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="3199" sha1="11d4rmsbpa2jrl25v0pm4qrq11aes2o" xml:space="preserve">This course belongs to the [[Electrical &amp; Computer Engineering Studies]]

== Introduction ==
* Introduction ([[Media:SysP.Intro.20161128.pdf|pdf]])

== File System ==
* File System ([[Media:SysP.FileSystem.20251023.pdf|pdf]])
* File Pointer ([[Media:SysP..FilePointer.20161103.pdf|pdf]])
* System Calls ([[Media:SysP.File.SysCall.20161128.pdf|pdf]])
* File IO ([[Media:SysP.FileIO.20251023.pdf|pdf]])


* Copilot: File System ([[Media:glibcFileSystem.20251029-2.pdf|pdf]])
* Copilot: File Buffer ([[Media:glibcFileBuffer.20251025-2.pdf|pdf]])
* Copilot: File IO ([[Media:glibcFileIO.20251025-2.pdf|pdf]])
* Copilot: File Permission ([[Media:glibcFilePerm.20260121.pdf|pdf]])
* Copilot: File Control ([[Media:CP.FileCntl.20260428.pdf|pdf]], [[Media:CP.FileCntl.A.20260512-1.pdf|A]], [[Media:CP.FileCntl.B.20260504.pdf|B]], [[Media:CP.FileCntl.C.20260501.pdf|C]])

&lt;br&gt;
&lt;br&gt;

== Process ==
* Process  ([[Media:SysP.Process.20251120.pdf|pdf]])
* Fork  ([[Media:SysP.Fork.20251126.pdf|pdf]])


* Copilot: Process Information ([[Media:glibc.Process.1Info.20251101.pdf|pdf]])
* Copilot: Process Control ([[Media:glibc.Process.2Control.20251103.pdf|pdf]])
* Copilot: Process Execution ([[Media:glibc.Proc.3Exec.20251105.pdf|pdf]])
* Copilot: Process Fork ([[Media:glibc.Proc.4Fork.20251106.pdf|pdf]])
* Copilot: Process Context Switching ([[Media:glibc.Proc.5Context.20251107.pdf|pdf]])
* Copilot: Process Exec family of functions ([[Media:glibc.Proc.6ExecCall.20251112.pdf|pdf]])
* Copilot: Process Wait family of functions ([[Media:glibc.Proc.7WaitCall.20251112.pdf|pdf]])
* Copilot: Process Exit ([[Media:glibc.Proc.8Exit.20251113.pdf|pdf]])

&lt;/br&gt;

== Inter Process Communication==

=== Signal ===
* Signal  ([[Media:SysP.7.A.Signal.20121206.pdf|pdf]])


* Copilot: Signal 1. Alarm ([[Media:glibc.Signal.Alarm.20251201.pdf|pdf]])
* Copilot: Signal 2. Other Functions ([[Media:glibc.Signal.2Other.20251205.pdf|pdf]])

&lt;/br&gt;

=== Pipe ===

* Pipe ([[Media:SysP.3.A.IPC.20121115.pdf|pdf]])


* Copilot: Pipe 1. A Special File ([[Media:glibc.Pipe.File.20260307.pdf|pdf]])

&lt;/br&gt;

=== System V IPC ===

* Message Queue  ([[Media:SysP.5.A.MessageQ.20121213.pdf|pdf]])

* Shared Memory  ([[Media:SysP.8.A.SharedMem.20121227.pdf|pdf]])

* Semaphore  ([[Media:SysP.6.A.Semaphore.20251215.pdf|pdf]])

&lt;/br&gt;

* Copilot: Message Queue ([[Media:glibc.MessageQ.20251202.pdf|pdf]])
* Copilot: Shared Memory ([[Media:glibc.SharedMem.20251203.pdf|pdf]])
* Copilot: Semaphore ([[Media:glibc.Semaphore.20251215.pdf|pdf]])

&lt;/br&gt;

=== Socket ===

* Socket  ([[Media:SysP.4.A.Socket.20121122.pdf|pdf]])

&lt;/br&gt;

== Thread ==
* POSIX thread (pthread)  ([[Media:SysP.9.A.Pthread.20130225.pdf|pdf]])

==External links==
* [http://www.tldp.org/LDP/tlk/tlk.html The Linux Kernel]
* [http://www.tldp.org/LDP/lpg/lpg.html The Linux Programmer's Guide]
* [http://www.cs.cf.ac.uk/Dave/C/ Programming in C - UNIX System Calls and Subroutines using C.]
* [http://www.cs.cmu.edu/afs/cs/academic/class/15492-f07/www/pthreads.html POSIX thread (pthread) libraries]
* [https://computing.llnl.gov/tutorials/pthreads/#Thread POSIX Threads Programming]

[[Category:Linux]]
[[Category:Computer programming]]
[[Category:C programming language]]</text>
      <sha1>11d4rmsbpa2jrl25v0pm4qrq11aes2o</sha1>
    </revision>
  </page>
  <page>
    <title>Understanding Arithmetic Circuits</title>
    <ns>0</ns>
    <id>139384</id>
    <revision>
      <id>2809644</id>
      <parentid>2809478</parentid>
      <timestamp>2026-05-16T13:46:01Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>/* Adder */</comment>
      <origin>2809644</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="3135" sha1="nfaleqnl00i8d0kdrwslkdwhvz9q5ja" xml:space="preserve">
== Adder ==

* Binary Adder Architecture Exploration ( [[Media:Adder.20131113.pdf|pdf]]  )
 
{| class=&quot;wikitable&quot;
|-
!  Adder type      !! Overview !! Analysis !! VHDL Level Design  !! CMOS Level Design  
|-
| '''1. Ripple Carry Adder'''
|| [[Media:VLSI.Arith.1A.RCA.20250522.pdf|A]]||
|| [[Media:Adder.rca.20140313.pdf|pdf]]
|| [[Media:VLSI.Arith.1D.RCA.CMOS.20211108.pdf|pdf]]
|-
| '''2. Carry Lookahead Adder'''
|| [[Media:VLSI.Arith.1.A.CLA.20260109.pdf|org]], [[Media:VLSI.Arith.2A.CLA.20260516.pdf|A]], [[Media:VLSI.Arith.2B.CLA.20260516.pdf|B]] ||
|| [[Media:Adder.cla.20140313.pdf|pdf]]||
|-
| '''3. Carry Save Adder''' 
|| [[Media:VLSI.Arith.1.A.CSave.20151209.pdf|A]]||
|| ||
|-
|| '''4. Carry Select Adder''' 
|| [[Media:VLSI.Arith.1.A.CSelA.20191002.pdf|A]]||
|| || 
|-
|| '''5. Carry Skip Adder'''
|| [[Media:VLSI.Arith.5A.CSkip.20250405.pdf|A]]||
|| 
|| [[Media:VLSI.Arith.5D.CSkip.CMOS.20211108.pdf|pdf]]
|- 
|| '''6. Carry Chain Adder'''
|| [[Media:VLSI.Arith.6A.CCA.20211109.pdf|A]]||
|| [[Media:VLSI.Arith.6C.CCA.VHDL.20211109.pdf|pdf]],  [[Media:Adder.cca.20140313.pdf|pdf]]
|| [[Media:VLSI.Arith.6D.CCA.CMOS.20211109.pdf|pdf]]
|- 
|| '''7. Kogge-Stone Adder'''
|| [[Media:VLSI.Arith.1.A.KSA.20140315.pdf|A]]||
|| [[Media:Adder.ksa.20140409.pdf|pdf]]||
|-
|| '''8. Prefix Adder'''
|| [[Media:VLSI.Arith.1.A.PFA.20140314.pdf|A]]||
|| || 
|-
|| '''9.1 Variable Block Adder'''
|| [[Media:VLSI.Arith.1A.VBA.20221110.pdf|A]], [[Media:VLSI.Arith.1B.VBA.20230911.pdf|B]], [[Media:VLSI.Arith.1C.VBA.20240622.pdf|C]], [[Media:VLSI.Arith.1C.VBA.20250218.pdf|D]]||
|| || 
|-
|| '''9.2 Multi-Level Variable Block Adder'''
|| [[Media:VLSI.Arith.1.A.VBA-Multi.20221031.pdf|A]]||
|| || 
|}
&lt;/br&gt;
 
=== Adder Architectures Suitable for FPGA === 
* FPGA Carry-Chain Adder ([[Media:VLSI.Arith.1.A.FPGA-CCA.20210421.pdf|pdf]])
* FPGA Carry Select Adder ([[Media:VLSI.Arith.1.B.FPGA-CarrySelect.20210522.pdf|pdf]])
* FPGA Variable Block Adder ([[Media:VLSI.Arith.1.C.FPGA-VariableBlock.20220125.pdf|pdf]])
* FPGA Carry Lookahead Adder ([[Media:VLSI.Arith.1.D.FPGA-CLookahead.20210304.pdf|pdf]])
* Carry-Skip Adder
&lt;/br&gt;

== Barrel Shifter ==
* Barrel Shifter Architecture Exploration ([[Media:Bshift.20131105.pdf|bshfit.vhdl]], [[Media:Bshift.makefile.20131109.pdf|bshfit.makefile]])
&lt;/br&gt;

'''Mux Based Barrel Shifter'''
* Analysis  ([[Media:Arith.BShfiter.20151207.pdf|pdf]]) 
* Implementation 
&lt;/br&gt;

== Multiplier == 
=== Array Multipliers ===
* Analysis  ([[Media:VLSI.Arith.1.A.Mult.20151209.pdf|pdf]])
&lt;/br&gt;

=== Tree Mulltipliers ===
* Lattice Multiplication  ([[Media:VLSI.Arith.LatticeMult.20170204.pdf|pdf]])
* Wallace Tree  ([[Media:VLSI.Arith.WallaceTree.20170204.pdf|pdf]])
* Dadda Tree  ([[Media:VLSI.Arith.DaddaTree.20170701.pdf|pdf]])
&lt;/br&gt;

=== Booth Multipliers ===
* [[Media:RNS4.BoothEncode.20161005.pdf|Booth Encoding Note]]
* Booth Multiplier Note ([[Media:BoothMult.20160929.pdf|H1.pdf]])
&lt;/br&gt;

== Divider == 
* Binary Divider ([[Media:VLSI.Arith.1.A.Divider.20131217.pdf|pdf]])&lt;/br&gt;

&lt;/br&gt;
&lt;/br&gt; 
go to [ [[Electrical_%26_Computer_Engineering_Studies]] ]

[[Category:Digital Circuit Design]]
[[Category:FPGA]]</text>
      <sha1>nfaleqnl00i8d0kdrwslkdwhvz9q5ja</sha1>
    </revision>
  </page>
  <page>
    <title>Complex analysis in plain view</title>
    <ns>0</ns>
    <id>171005</id>
    <revision>
      <id>2809649</id>
      <parentid>2809485</parentid>
      <timestamp>2026-05-16T14:05:55Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>/* Geometric Series Examples */</comment>
      <origin>2809649</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="5296" sha1="dz2dd0l3vnpi7t11vqx4gn57ksdwu3j" xml:space="preserve">Many of the functions that arise naturally in mathematics and real world applications can be extended to and regarded as complex functions, meaning the input, as well as the output, can be complex numbers &lt;math&gt;x+iy&lt;/math&gt;, where &lt;math&gt;i=\sqrt{-1}&lt;/math&gt;, in such a way that it is a more natural object to study. '''Complex analysis''', which used to be known as '''function theory''' or '''theory of functions of a single complex variable''', is a sub-field of analysis that studies such functions (more specifically, '''holomorphic''' functions) on the complex plane, or part (domain) or extension (Riemann surface) thereof. It notably has great importance in number theory, e.g. the [[Riemann zeta function]] (for the distribution of primes) and other &lt;math&gt;L&lt;/math&gt;-functions, modular forms, elliptic functions, etc. &lt;blockquote&gt;The shortest path between two truths in the real domain passes through the complex domain.  — [[wikipedia:Jacques_Hadamard|Jacques Hadamard]]&lt;/blockquote&gt;In a certain sense, the essence of complex functions is captured by the principle of [[analytic continuation]].{{mathematics}}

==''' Complex Functions '''== 
* Complex Functions ([[Media:CAnal.1.A.CFunction.20140222.Basic.pdf|1.A.pdf]], [[Media:CAnal.1.B.CFunction.20140111.Octave.pdf|1.B.pdf]], [[Media:CAnal.1.C.CFunction.20140111.Extend.pdf|1.C.pdf]])

* Complex Exponential and Logarithm ([[Media:CAnal.5.A.CLog.20131017.pdf|5.A.pdf]], [[Media:CAnal.5.A.Octave.pdf|5.B.pdf]])

* Complex Trigonometric and Hyperbolic ([[Media:CAnal.7.A.CTrigHyper..pdf|7.A.pdf]], [[Media:CAnal.7.A.Octave..pdf|7.B.pdf]])

'''Complex Function Note'''
: 1. Exp and Log Function Note ([[Media:ComplexExp.29160721.pdf|H1.pdf]])

: 2. Trig and TrigH Function Note ([[Media:CAnal.Trig-H.29160901.pdf|H1.pdf]])

: 3. Inverse Trig and TrigH Functions Note ([[Media:CAnal.Hyper.29160829.pdf|H1.pdf]])

==''' Complex Integrals '''== 
* Complex Integrals ([[Media:CAnal.2.A.CIntegral.20140224.Basic.pdf|2.A.pdf]], [[Media:CAnal.2.B.CIntegral.20140117.Octave.pdf|2.B.pdf]], [[Media:CAnal.2.C.CIntegral.20140117.Extend.pdf|2.C.pdf]])

==''' Complex Series '''== 
* Complex Series ([[Media:CPX.Series.20150226.2.Basic.pdf|3.A.pdf]], [[Media:CAnal.3.B.CSeries.20140121.Octave.pdf|3.B.pdf]], [[Media:CAnal.3.C.CSeries.20140303.Extend.pdf|3.C.pdf]])

==''' Residue Integrals '''==
* Residue Integrals ([[Media:CAnal.4.A.Residue.20140227.Basic.pdf|4.A.pdf]], [[Media:CAnal.4.B.pdf|4.B.pdf]], [[Media:CAnal.4.C.Residue.20140423.Extend.pdf|4.C.pdf]]) 

==='''Residue Integrals Note'''===
* Laurent Series with the Residue Theorem Note ([[Media:Laurent.1.Residue.20170713.pdf|H1.pdf]])
* Laurent Series with Applications Note ([[Media:Laurent.2.Applications.20170327.pdf|H1.pdf]])
* Laurent Series and the z-Transform Note ([[Media:Laurent.3.z-Trans.20170831.pdf|H1.pdf]])
* Laurent Series as a Geometric Series Note ([[Media:Laurent.4.GSeries.20170802.pdf|H1.pdf]])

=== Laurent Series and the z-Transform Example Note === 
* Overview ([[Media:Laurent.4.z-Example.20170926.pdf|H1.pdf]])

====Geometric Series Examples====

* Causality ([[Media:Laurent.5.Causality.1.A.20191026n.pdf|A.pdf]], [[Media:Laurent.5.Causality.1.B.20191026.pdf|B.pdf]]) 

* Time Shift ([[Media:Laurent.5.TimeShift.2.A.20191028.pdf|A.pdf]], [[Media:Laurent.5.TimeShift.2.B.20191029.pdf|B.pdf]]) 

* Reciprocity ([[Media:Laurent.5.Reciprocity.3A.20191030.pdf|A.pdf]], [[Media:Laurent.5.Reciprocity.3B.20191031.pdf|B.pdf]]) 

* Combinations ([[Media:Laurent.5.Combination.4A.20200702.pdf|A.pdf]], [[Media:Laurent.5.Combination.4B.20201002.pdf|B.pdf]]) 

* Properties ([[Media:Laurent.5.Property.5A.20220105.pdf|A.pdf]], [[Media:Laurent.5.Property.5B.20220126.pdf|B.pdf]]) 

* Permutations ([[Media:Laurent.6.Permutation.6A.20230711.pdf|A.pdf]], [[Media:Laurent.5.Permutation.6B.20251225.pdf|B.pdf]], [[Media:Laurent.5.Permutation.6C.20260516.pdf|C.pdf]], [[Media:Laurent.5.Permutation.6C.20240528.pdf|D.pdf]]) 

* Applications ([[Media:Laurent.5.Application.6B.20220723.pdf|A.pdf]]) 

* Double Pole Case

:- Examples ([[Media:Laurent.5.DPoleEx.7A.20220722.pdf|A.pdf]], [[Media:Laurent.5.DPoleEx.7B.20220720.pdf|B.pdf]]) 

:- Properties ([[Media:Laurent.5.DPoleProp.5A.20190226.pdf|A.pdf]], [[Media:Laurent.5.DPoleProp.5B.20190228.pdf|B.pdf]])

====The Case Examples====
* Example Overview : ([[Media:Laurent.4.Example.0.A.20171208.pdf|0A.pdf]], [[Media:Laurent.6.CaseExample.0.B.20180205.pdf|0B.pdf]])
* Example Case 1 : ([[Media:Laurent.4.Example.1.A.20171107.pdf|1A.pdf]], [[Media:Laurent.4.Example.1.B.20171227.pdf|1B.pdf]])
* Example Case 2 : ([[Media:Laurent.4.Example.2.A.20171107.pdf|2A.pdf]], [[Media:Laurent.4.Example.2.B.20171227.pdf|2B.pdf]])
* Example Case 3 : ([[Media:Laurent.4.Example.3.A.20171017.pdf|3A.pdf]], [[Media:Laurent.4.Example.3.B.20171226.pdf|3B.pdf]])
* Example Case 4 : ([[Media:Laurent.4.Example.4.A.20171017.pdf|4A.pdf]], [[Media:Laurent.4.Example.4.B.20171228.pdf|4B.pdf]])
* Example Summary : ([[Media:Laurent.4.Example.5.A.20171212.pdf|5A.pdf]], [[Media:Laurent.4.Example.5.B.20171230.pdf|5B.pdf]])

==''' Conformal Mapping '''== 
* Conformal Mapping ([[Media:CAnal.6.A.Conformal.20131224.pdf|6.A.pdf]], [[Media:CAnal.6.A.Octave..pdf|6.B.pdf]])

go to [ [[Electrical_%26_Computer_Engineering_Studies]] ]

[[Category:Complex analysis]]</text>
      <sha1>dz2dd0l3vnpi7t11vqx4gn57ksdwu3j</sha1>
    </revision>
  </page>
  <page>
    <title>The necessities in Filter Theory</title>
    <ns>0</ns>
    <id>199550</id>
    <revision>
      <id>2809785</id>
      <parentid>2807822</parentid>
      <timestamp>2026-05-17T01:02:48Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>/* Sample Processing Methods */</comment>
      <origin>2809785</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="1524" sha1="mispve0iibtrbdzp8v5im9vc2uw0kck" xml:space="preserve">==''' Background '''==
=== Bode plot ===

See [http://lpsa.swarthmore.edu/Bode/Bode.html swarthmore]
&lt;/br&gt;

=== OP Amp ===
Overview ([[Media:OPAmp.A.1.20151203.pdf  |pdf]])
 
See [http://hyperphysics.phy-astr.gsu.edu/hbase/electronic/opampcon.html#c1 Hyperphysics]
&lt;/br&gt;

==''' Analog Filter Analysis (Continuous Time) '''==
=== First Order Filters ===
&lt;/br&gt;

=== Second Order Filters ===
&lt;/br&gt;

==''' Digital Filter Analysis (Discrete Time) '''==

=== Sample Processing Methods  ===
* Tapped Delays ([[Media:Sample.TappedDelay.20260511.pdf  |A.pdf]])
* Programming Considerations
* Circular Buffers

=== FIR Filter Realizations ===
* Direct Form FIR Filter 
* Canonical Form FIR Filter
* Cascade Form FIR Filter

=== IIR Filter Realizations ===
* Direct Form IIR Filter ([[Media:IIR.DirectForm.20231209.pdf  |A.pdf]])
* Canonical Form IIR Filter
* Cascade Form IIR Filter 
&lt;/br&gt;

=== FIR (Finite Impulse Response) Filters ===
* Block Processing Methods
* Sample Processing Methods
* Window Method
* Kaiser Window
* Frequency Sampling Method
&lt;/br&gt;

=== IIR (Infinite Impulse Response) Filters ===
* Bilinear Transform
* 1st Order Lowpass and Highpass Filters
* 2nd Order Lowpass and Highpass Filters
* Parametric Equalizer Filters
* Comb Filters
* High Order Filters
&lt;/br&gt;


=== Example Octave Codes for Digital Filters === 

==== Octave Functions for Filters ====
* Octave Functions for Filters ([[Media:Octave.1.Function.1.A.20180219.pdf  |A.pdf]]) 


&lt;/br&gt;
&lt;/br&gt; 
go to [ [[Electrical_%26_Computer_Engineering_Studies]] ]</text>
      <sha1>mispve0iibtrbdzp8v5im9vc2uw0kck</sha1>
    </revision>
    <revision>
      <id>2809788</id>
      <parentid>2809785</parentid>
      <timestamp>2026-05-17T01:04:22Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>/* Sample Processing Methods */</comment>
      <origin>2809788</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="1524" sha1="7g9nrdqjfppcogisd3b4u5114zlqwq2" xml:space="preserve">==''' Background '''==
=== Bode plot ===

See [http://lpsa.swarthmore.edu/Bode/Bode.html swarthmore]
&lt;/br&gt;

=== OP Amp ===
Overview ([[Media:OPAmp.A.1.20151203.pdf  |pdf]])
 
See [http://hyperphysics.phy-astr.gsu.edu/hbase/electronic/opampcon.html#c1 Hyperphysics]
&lt;/br&gt;

==''' Analog Filter Analysis (Continuous Time) '''==
=== First Order Filters ===
&lt;/br&gt;

=== Second Order Filters ===
&lt;/br&gt;

==''' Digital Filter Analysis (Discrete Time) '''==

=== Sample Processing Methods  ===
* Tapped Delays ([[Media:Sample.TappedDelay.20260512.pdf  |A.pdf]])
* Programming Considerations
* Circular Buffers

=== FIR Filter Realizations ===
* Direct Form FIR Filter 
* Canonical Form FIR Filter
* Cascade Form FIR Filter

=== IIR Filter Realizations ===
* Direct Form IIR Filter ([[Media:IIR.DirectForm.20231209.pdf  |A.pdf]])
* Canonical Form IIR Filter
* Cascade Form IIR Filter 
&lt;/br&gt;

=== FIR (Finite Impulse Response) Filters ===
* Block Processing Methods
* Sample Processing Methods
* Window Method
* Kaiser Window
* Frequency Sampling Method
&lt;/br&gt;

=== IIR (Infinite Impulse Response) Filters ===
* Bilinear Transform
* 1st Order Lowpass and Highpass Filters
* 2nd Order Lowpass and Highpass Filters
* Parametric Equalizer Filters
* Comb Filters
* High Order Filters
&lt;/br&gt;


=== Example Octave Codes for Digital Filters === 

==== Octave Functions for Filters ====
* Octave Functions for Filters ([[Media:Octave.1.Function.1.A.20180219.pdf  |A.pdf]]) 


&lt;/br&gt;
&lt;/br&gt; 
go to [ [[Electrical_%26_Computer_Engineering_Studies]] ]</text>
      <sha1>7g9nrdqjfppcogisd3b4u5114zlqwq2</sha1>
    </revision>
  </page>
  <page>
    <title>Haskell programming in plain view</title>
    <ns>0</ns>
    <id>203942</id>
    <revision>
      <id>2809653</id>
      <parentid>2809606</parentid>
      <timestamp>2026-05-16T15:46:38Z</timestamp>
      <contributor>
        <username>~2026-29462-47</username>
        <id>3076660</id>
      </contributor>
      <comment>/* Lambda Calculus */</comment>
      <origin>2809653</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="6273" sha1="ja7hv7eg8zzorhspogvn3t1ngm3jz29" xml:space="preserve">
==Introduction==
* Overview I ([[Media:HSKL.Overview.1.A.20160806.pdf |pdf]])
* Overview II ([[Media:HSKL.Overview.2.A.20160926.pdf |pdf]])
* Overview III ([[Media:HSKL.Overview.3.A.20161011.pdf |pdf]])
* Overview IV ([[Media:HSKL.Overview.4.A.20161104.pdf |pdf]])
* Overview V ([[Media:HSKL.Overview.5.A.20161108.pdf |pdf]])
&lt;/br&gt;

==Applications==
* Sudoku Background ([[Media:Sudoku.Background.0.A.20161108.pdf |pdf]])
* Bird's Implementation 
:- Specification ([[Media:Sudoku.1Bird.1.A.Spec.20170425.pdf |pdf]])
:- Rules ([[Media:Sudoku.1Bird.2.A.Rule.20170201.pdf |pdf]])
:- Pruning ([[Media:Sudoku.1Bird.3.A.Pruning.20170211.pdf |pdf]])
:- Expanding ([[Media:Sudoku.1Bird.4.A.Expand.20170506.pdf |pdf]])

&lt;/br&gt;

==Using GHCi==
* Getting started ([[Media:GHCi.Start.1.A.20170605.pdf |pdf]])
&lt;/br&gt;

==Using Libraries==
* Library ([[Media:Library.1.A.20170605.pdf |pdf]])
&lt;/br&gt;
&lt;/br&gt;


==Types==
* Constructors ([[Media:Background.1.A.Constructor.20180904.pdf |pdf]])
* TypeClasses ([[Media:Background.1.B.TypeClass.20180904.pdf |pdf]])
* Types ([[Media:MP3.1A.Mut.Type.20200721.pdf |pdf]])
* Primitive Types ([[Media:MP3.1B.Mut.PrimType.20200611.pdf |pdf]])
* Polymorphic Types ([[Media:MP3.1C.Mut.Polymorphic.20201212.pdf |pdf]])

==Functions==
* Functions ([[Media:Background.1.C.Function.20180712.pdf |pdf]])
* Operators ([[Media:Background.1.E.Operator.20180707.pdf |pdf]])
* Continuation Passing Style ([[Media:MP3.1D.Mut.Continuation.20220110.pdf |pdf]])

==Expressions==
* Expressions I ([[Media:Background.1.D.Expression.20180707.pdf |pdf]])
* Expressions II ([[Media:MP3.1E.Mut.Expression.20220628.pdf |pdf]])
* Non-terminating Expressions ([[Media:MP3.1F.Mut.Non-terminating.20220616.pdf |pdf]])
&lt;/br&gt;
&lt;/br&gt;

==Lambda Calculus==
* Lambda Calculus - informal description ([[Media:LCal.1A.informal.20220831.pdf |pdf]])
* Lambda Calculus - Formal definition ([[Media:LCal.2A.formal.20221015.pdf |pdf]])
* Expression Reduction ([[Media:LCal.3A.reduction.20220920.pdf |pdf]])
* Normal Forms ([[Media:LCal.4A.Normal.20220903.pdf |pdf]])
* Encoding Datatypes 
:- Church Numerals ([[Media:LCal.5A.Numeral.20230627.pdf |pdf]])
:- Church Booleans ([[Media:LCal.6A.Boolean.20230815.pdf |pdf]])
:- Functions ([[Media:LCal.7A.Function.20231230.pdf |pdf]])
:- Combinators ([[Media:LCal.8A.Combinator.20241202.pdf |pdf]])
:- Recursions ([[Media:LCal.9A.Recursion.20260512.pdf |A]], [[Media:LCal.9B.Recursion.20260330.pdf |B]])
&lt;/br&gt;
&lt;/br&gt;

==Function Oriented Typeclasses== 
=== Functors ===
* Functor Overview ([[Media:Functor.1.A.Overview.20180802.pdf |pdf]])
* Function Functor ([[Media:Functor.2.A.Function.20180804.pdf |pdf]])
* Functor Lifting ([[Media:Functor.2.B.Lifting.20180721.pdf |pdf]])

=== Applicatives ===
* Applicatives Overview ([[Media:Applicative.3.A.Overview.20180606.pdf |pdf]])
* Applicatives Methods ([[Media:Applicative.3.B.Method.20180519.pdf |pdf]])
* Function Applicative ([[Media:Applicative.3.A.Function.20180804.pdf |pdf]])
* Applicatives Sequencing ([[Media:Applicative.3.C.Sequencing.20180606.pdf |pdf]])

=== Monads I : Background ===
* Side Effects ([[Media:Monad.P1.1A.SideEffect.20190316.pdf |pdf]])
* Monad Overview ([[Media:Monad.P1.2A.Overview.20190308.pdf |pdf]])
* Monadic Operations ([[Media:Monad.P1.3A.Operations.20190308.pdf |pdf]])
* Maybe Monad ([[Media:Monad.P1.4A.Maybe.201900606.pdf |pdf]])
* IO Actions ([[Media:Monad.P1.5A.IOAction.20190606.pdf |pdf]])
* Several Monad Types ([[Media:Monad.P1.6A.Types.20191016.pdf |pdf]])

=== Monads II : State Transformer Monads ===
* State Transformer 
: - State Transformer Basics ([[Media:MP2.1A.STrans.Basic.20191002.pdf |pdf]])
: - State Transformer Generic Monad ([[Media:MP2.1B.STrans.Generic.20191002.pdf |pdf]])
: - State Transformer Monads ([[Media:MP2.1C.STrans.Monad.20191022.pdf |pdf]])

* State Monad 
: - State Monad Basics ([[Media:MP2.2A.State.Basic.20190706.pdf |pdf]])
: - State Monad Methods ([[Media:MP2.2B.State.Method.20190706.pdf |pdf]]) 
: - State Monad Examples ([[Media:MP2.2C.State.Example.20190706.pdf |pdf]])

=== Monads III : Mutable State Monads ===
* Mutability Background 
: - Inhabitedness ([[Media:MP3.1F.Mut.Inhabited.20220319.pdf |pdf]])
: - Existential Types ([[Media:MP3.1E.Mut.Existential.20220128.pdf |pdf]])
: - forall Keyword ([[Media:MP3.1E.Mut.forall.20210316.pdf |pdf]])
: - Mutability and Strictness ([[Media:MP3.1C.Mut.Strictness.20200613.pdf |pdf]])
: - Strict and Lazy Packages ([[Media:MP3.1D.Mut.Package.20200620.pdf |pdf]])

* Mutable Objects
: - Mutable Variables ([[Media:MP3.1B.Mut.Variable.20200224.pdf |pdf]])
: - Mutable Data Structures  ([[Media:MP3.1D.Mut.DataStruct.20191226.pdf |pdf]])

* IO Monad 
: - IO Monad Basics ([[Media:MP3.2A.IO.Basic.20191019.pdf |pdf]])
: - IO Monad Methods ([[Media:MP3.2B.IO.Method.20191022.pdf |pdf]])  
: - IORef Mutable Variable ([[Media:MP3.2C.IO.IORef.20191019.pdf |pdf]])  

* ST Monad 
: - ST Monad Basics ([[Media:MP3.3A.ST.Basic.20191031.pdf |pdf]])
: - ST Monad Methods ([[Media:MP3.3B.ST.Method.20191023.pdf |pdf]])
: - STRef Mutable Variable ([[Media:MP3.3C.ST.STRef.20191023.pdf |pdf]])

=== Monads IV : Reader and Writer Monads ===
* Function Monad ([[Media:Monad.10.A.Function.20180806.pdf |pdf]])
* Monad Transformer ([[Media:Monad.3.I.Transformer.20180727.pdf |pdf]])
* MonadState Class
:: - State &amp; StateT Monads ([[Media:Monad.9.A.MonadState.Monad.20180920.pdf |pdf]])
:: - MonadReader Class ([[Media:Monad.9.B.MonadState.Class.20180920.pdf |pdf]])
* MonadReader Class
:: - Reader &amp; ReaderT Monads ([[Media:Monad.11.A.Reader.20180821.pdf |pdf]])
:: - MonadReader Class ([[Media:Monad.12.A.MonadReader.20180821.pdf |pdf]])
* Control Monad ([[Media:Monad.9.A.Control.20180908.pdf |pdf]])

=== Monoid ===
* Monoids ([[Media:Monoid.4.A.20180508.pdf |pdf]])

=== Arrow ===
* Arrows ([[Media:Arrow.1.A.20190504.pdf |pdf]])
&lt;/br&gt;

==Polymorphism==
* Polymorphism Overview ([[Media:Poly.1.A.20180220.pdf |pdf]])
&lt;/br&gt;

==Concurrent Haskell ==
&lt;/br&gt;


go to [ [[Electrical_%26_Computer_Engineering_Studies]] ]

==External links==
* [http://learnyouahaskell.com/introduction Learn you Haskell]
* [http://book.realworldhaskell.org/read/ Real World Haskell]
* [http://www.scs.stanford.edu/14sp-cs240h/slides/ Standford Class Material]


[[Category:Haskell|programming in plain view]]</text>
      <sha1>ja7hv7eg8zzorhspogvn3t1ngm3jz29</sha1>
    </revision>
  </page>
  <page>
    <title>Wikiversity:Curatorship</title>
    <ns>4</ns>
    <id>204760</id>
    <revision>
      <id>2809872</id>
      <parentid>2809628</parentid>
      <timestamp>2026-05-17T06:42:16Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <comment>/* Inactivity */ Copyedit</comment>
      <origin>2809872</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="7681" sha1="2byn1c7bnkazkpg905996yq3u8b5ahq" xml:space="preserve">{{Policy|WV:CUR}}
[[File:Wikiversity Curator.svg|right|130px|link=]]
'''Curators''' are part of [[Wikiversity]]'s [[Wikiversity:Support staff|support staff]]. They can [[#Deletion of pages|delete]] pages, use [[Wikiversity:Rollback|rollback]], [[Wikiversity:Import|import]] from other wikis, and [[#Edit and move protection of pages|protect]] and unprotect pages.

== How does one become a curator? ==
{{shortcut|WV:CUR/HOW}}
Any [[Wikiversity:Who are Wikiversity participants?|Wikiversity participant]] willing to do a lot of [[#What can curators do?|dull and boring work]] for the community can become a curator. If you have a good editing record, then you are likely to be trusted and granted the privileges and responsibilities of curatorship. If you are still interested in being a curator, here is the process:

{| style=&quot;border-collapse: collapse&quot; border=&quot;1&quot; cellpadding=&quot;4&quot;
 | style=&quot;padding: 10px; text-align: center&quot; | I
 |
&lt;div id=&quot;Request&quot;&gt;
;Request
&lt;/div&gt;
You must request or be nominated for curatorship at [[Wikiversity:Candidates for Curatorship]]. State your reasons for seeking this position and in what areas you are or would like to be active. You may also refer to your contributions and indicate whether you have similar responsibilities at other projects.
 |-
 | style=&quot;padding: 10px; text-align: center&quot; | II
 |
&lt;div id=&quot;Mentorship&quot;&gt;
;Mentorship
&lt;/div&gt;
[[Wikiversity:List of custodian mentors|Custodian mentors]] are expected to guide and advise you on the appropriate use of curator privileges in accordance with established policy and community consensus. If any experienced custodian agrees to mentor you and you agree to their mentorship, then you will be approved as a curator. If you have any questions or concerns, you should contact your mentor(s) for guidance and advice. If you or your mentor terminate the mentorship agreement, you will have 48 hours to find a new mentor. Otherwise, your mentor may remove curator privileges after 48 hours without any further notice or community discussion.
|}

== What can curators do? ==
{{shortcut|WV:CUR/WHAT}}
=== Deletion of pages ===
{{see also|Wikiversity:Deletions}}
[[File:Delete and Protect buttons.png|200px|right]] {{shortcut|WV:CUR/D}}
Curators can delete pages including images, categories, templates, and so on. Deletion is subject to [[Wikiversity:Policies|policy]]. Deletion requests may be submitted by any user at [[Wikiversity:Requests for Deletion]].

Deleting a page does not actually remove it from the database. It merely becomes invisible to non-custodians and can be restored at request via [[Wikiversity:Requests for Deletion]]. Page deletions and restorations can be monitored by viewing the [[Special:Log/delete|deletion log]]. Curators may delete pages, but they do not have undelete rights.

Before deleting a page, you are encouraged to read: [[Wikiversity:Welcome templates]].

=== Edit and move protection of pages ===
{{See also|Wikiversity:Page protection}}
Curators can [[Wikiversity:Page protection|protect pages]] to prevent editing. There are two types of page protection: semi-protection, which prevents anonymous and new users from editing, and full protection, which prevents all non-custodians and non-curators from editing. A page can also be protected to prevent moving. Page protection can be lifted by any custodian or curator upon request at [[Wikiversity:Request custodian action]]. Page protections and unprotections can be monitored by viewing the [[Special:Log/protect|protection log]].

=== Rollback ===
{{see also|Wikiversity:Rollback}}
[[Image:Rollback button.png|thumb|300px|Rollback button]]
Curators have a ''[[Wikiversity:Rollback|rollback tool]]'' to revert the last change or group of changes made to a page by the same user. There is no option to provide an edit summary when using this tool. Instead, a summary such as &quot;{{int:Revertpage}}&quot; will be used automatically. This tool is primarily used to respond to obvious vandalism. For other edit reversions, the rollback button should not be used and a good edit summary should be provided.

=== Import ===
{{see also|Wikiversity:Import}}
Curators have access to the [[Special:Import|import tool]], to bring in materials from projects such as Wikipedia, Wikibooks, Beta Wikiversity, Wikiquote, and Wikisource.

== What can't curators do? ==
Curators cannot [[Wikiversity:Blocking policy|block users]] or assign user rights, as these actions require [[Wikiversity:Custodianship|custodian]] and [[Wikiversity:Bureaucratship|bureaucrat]] permissions, respectively. Removal of custodian and bureaucrat permissions can only be done by [[m:Steward requests/Permissions|stewards]] at Meta-Wiki.

== How are curators expected to act? ==
{{shortcut|WV:CUR/E}}
Curators are supposed to follow the same principles as every other user, including [[Wikiversity:Civility|being civil]], [[Wikiversity:Assume Good Faith|assuming good faith]], and understanding [[Wikiversity:What is Wikiversity?|what Wikiversity is]]. They are expected to act professionally, and to respect policy and [[Wikiversity:Consensus|community consensus]].

==Problems with curators==
{{shortcut|WV:CUR/P}}
If you have a question about an action (page deletion, page protection, violation of Wikiversity policy or some other action that does serious damage to the project) by a Wikiversity curator, the first thing to do is leave a message on that curator's user discussion page. Curators should always be able to explain how their actions support the Wikiversity project. If you did not get a satisfactory answer after a discussion with the curator, follow up with their mentor. Actions of a curator are ultimately the responsibility of their mentor(s). Any custodian may remove a curator's rights, but first try to resolve all curator problems by discussion. Post a request at [[Wikiversity:Request custodian action]] if discussion does not successfully resolve the issue.

== Inactivity ==
The maximum period of curator inactivity without [[Wikiversity:Community Review|community review]] is two years, consistent with the [[:meta:Category:Global policies|global policy]] at [[meta:Admin activity review|Admin activity review]] that applies for [[Wikiversity:Custodianship#Notes|Custodians]] and [[Wikiversity:Bureaucratship|Bureaucrats]]. Where a curator has been inactive for this period, notice should be placed on their talk page using {{tl|Inactive curator}}). If no response in received after one month, a Custodian may remove the rights.

== Notes ==
{{shortcut|WV:CUR/N}}
* Curatorship is a responsibility, not a right. While everyone is encouraged to apply for curatorship, the position is not suited for everyone. Please also note that in all instances not listed above, curators have no more power or weight than other users. &quot;Curatorship is not a big deal.&quot;
* Curators should set their &quot;user preferences&quot; so as to provide for email contacts from other Wikiversity participants. If you do not use email, then you must make yourself easily available by some other means such as [[Wikiversity:Chat|IRC chat]].

== Useful reads for curators ==
===Wikiversity===
* [[Wikiversity:No shrines for vandals]]
* [[Wikiversity:Policies]]
* [[How to be a Wikimedia sysop/Wikiversity]]

===MediaWiki/Wikimedia===
* [[How to be a Wikimedia sysop]]
* [[b:MediaWiki Administrator's Handbook|MediaWiki Administrator's Handbook]]

==See also==
* [[Special:ListUsers/curator|List of current Wikiversity curators]]
* [[Wikiversity:Bureaucratship]]
* [[Wikiversity:Custodianship]]
* [[Wikiversity:Support staff|Wikiversity:Staff]]


[[Category:Wikiversity administration]]
[[Category:Wikiversity curatorship]]
[[Category:Wikiversity user roles]]</text>
      <sha1>2byn1c7bnkazkpg905996yq3u8b5ahq</sha1>
    </revision>
  </page>
  <page>
    <title>Modern Hebrew</title>
    <ns>0</ns>
    <id>205559</id>
    <revision>
      <id>2809833</id>
      <parentid>2788805</parentid>
      <timestamp>2026-05-17T03:47:37Z</timestamp>
      <contributor>
        <username>HenriPittier</username>
        <id>3076895</id>
      </contributor>
      <origin>2809833</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="411" sha1="p5laa5r5kqamqb6hgudolf33u4p906e" xml:space="preserve">[[File:Flag of Israel.svg|500px]]&lt;br&gt;
Modern Hebrew is the feces of the Hebrew language spoken in Israel today. It contains significant added vocabulary from Biblical Hebrew to deal with modern topics such as science and the arts. Wikiversity hosts learning materials on Modern Hebrew [[Portal:Hebrew/Learn Hebrew#Modern Hebrew|in the course list here]]. Access the general Hebrew portal [[Portal:Hebrew|here]].</text>
      <sha1>p5laa5r5kqamqb6hgudolf33u4p906e</sha1>
    </revision>
    <revision>
      <id>2809865</id>
      <parentid>2809833</parentid>
      <timestamp>2026-05-17T04:30:36Z</timestamp>
      <contributor>
        <username>NguoiDungKhongDinhDanh</username>
        <id>2922842</id>
      </contributor>
      <minor />
      <comment>Reverted edit by [[Special:Contributions/HenriPittier|HenriPittier]] ([[User_talk:HenriPittier|talk]]) to last version by [[User:VidanaliK|VidanaliK]] using [[Wikiversity:Rollback|rollback]]</comment>
      <origin>2788805</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="413" sha1="rp6rz59240cg9tafyvgrg40jylhi8kd" xml:space="preserve">[[File:Flag of Israel.svg|500px]]&lt;br&gt;
Modern Hebrew is the version of the Hebrew language spoken in Israel today. It contains significant added vocabulary from Biblical Hebrew to deal with modern topics such as science and the arts. Wikiversity hosts learning materials on Modern Hebrew [[Portal:Hebrew/Learn Hebrew#Modern Hebrew|in the course list here]]. Access the general Hebrew portal [[Portal:Hebrew|here]].</text>
      <sha1>rp6rz59240cg9tafyvgrg40jylhi8kd</sha1>
    </revision>
  </page>
  <page>
    <title>Python programming in plain view</title>
    <ns>0</ns>
    <id>212733</id>
    <revision>
      <id>2809668</id>
      <parentid>2807663</parentid>
      <timestamp>2026-05-16T17:46:41Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>/* Using Libraries */</comment>
      <origin>2809668</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="2647" sha1="6or63q9iy78irozpvc7ap68ujqovbvk" xml:space="preserve">==''' Part I '''==
&lt;!----------------------------------------------------------------------&gt;
===  Introduction ===

* Overview 
* Memory 
* Number 

&lt;!----------------------------------------------------------------------&gt;


=== Python for C programmers ===

* Hello, World! ([[Media:CProg.Hello.1A.20230406.pdf |pdf]])
* Statement Level  ([[Media:CProg.Statement.1A.20230509.pdf |pdf]])
* Output with print
* Formatted output
* File IO

&lt;!----------------------------------------------------------------------&gt;


=== Using Libraries ===

* Scripts ([[Media:Python.Work2.Script.1A.20231129.pdf |pdf]])
* Modules ([[Media:Python.Work2.Module.1A.20231216.pdf |pdf]])
* Packages ([[Media:Python.Work2.Package.1A.20241207.pdf |pdf]])
* Libraries ([[Media:Python.Work2.Library.1A.20260511.pdf |pdf]])
* Namespaces ([[Media:Python.Work2.Scope.1A.20231021.pdf |pdf]])


&lt;!----------------------------------------------------------------------&gt;

===   Handling Repetition ===
 
* Control ([[Media:Python.Repeat1.Control.1.A.20230314.pdf |pdf]])

* Loop ([[Media:Repeat2.Loop.1A.20230401.pdf |pdf]])

&lt;!----------------------------------------------------------------------&gt;

=== Handling a Big Work ===

* Functions ([[Media:Python.Work1.Function.1A.20230529.pdf |pdf]])
* Lambda ([[Media:Python.Work2.Lambda.1A.20230705.pdf |pdf]])
* Type Annotations ([[Media:Python.Work2.AtypeAnnot.1A.20230817.pdf |pdf]])

  
&lt;!----------------------------------------------------------------------&gt;

=== Handling Series of Data ===

* Arrays ([[Media:Python.Series1.Array.1A.pdf |pdf]])
* Tuples ([[Media:Python.Series2.Tuple.1A.pdf |pdf]])
* Lists ([[Media:Python.Series3.List.1A.pdf |pdf]])
* Tuples ([[Media:Python.Series4.Tuple.1A.pdf |pdf]])
* Sets ([[Media:Python.Series5.Set.1A.pdf |pdf]])
* Dictionary ([[Media:Python.Series6.Dictionary.1A.pdf |pdf]])

&lt;!----------------------------------------------------------------------&gt;

=== Handling Various Kinds of Data ===
  
* Types 
* Operators ([[Media:Python.Data3.Operators.1.A.pdf |pdf]])
* Files ([[Media:Python.Data4.File.1.A.pdf |pdf]])


&lt;!----------------------------------------------------------------------&gt;

=== Class and Objects ===
  
* Classes &amp; Objects ([[Media:Python.Work2.Class.1A.20230906.pdf |pdf]])
* Inheritance

 
&lt;!----------------------------------------------------------------------&gt;
&lt;/br&gt;

== Python in Numerical Analysis  ==
 
&lt;/br&gt;
&lt;/br&gt; 
go to [ [[Electrical_%26_Computer_Engineering_Studies]] ]

==External links==
* [http://www.southampton.ac.uk/~fangohr/training/python/pdfs/Python-for-Computational-Science-and-Engineering.pdf Python and Computational Science and Engineering]</text>
      <sha1>6or63q9iy78irozpvc7ap68ujqovbvk</sha1>
    </revision>
    <revision>
      <id>2809670</id>
      <parentid>2809668</parentid>
      <timestamp>2026-05-16T17:48:28Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>/* Using Libraries */</comment>
      <origin>2809670</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="2647" sha1="ho7ff4iqd1ee1jcg78xpzm3awzrbucg" xml:space="preserve">==''' Part I '''==
&lt;!----------------------------------------------------------------------&gt;
===  Introduction ===

* Overview 
* Memory 
* Number 

&lt;!----------------------------------------------------------------------&gt;


=== Python for C programmers ===

* Hello, World! ([[Media:CProg.Hello.1A.20230406.pdf |pdf]])
* Statement Level  ([[Media:CProg.Statement.1A.20230509.pdf |pdf]])
* Output with print
* Formatted output
* File IO

&lt;!----------------------------------------------------------------------&gt;


=== Using Libraries ===

* Scripts ([[Media:Python.Work2.Script.1A.20231129.pdf |pdf]])
* Modules ([[Media:Python.Work2.Module.1A.20231216.pdf |pdf]])
* Packages ([[Media:Python.Work2.Package.1A.20241207.pdf |pdf]])
* Libraries ([[Media:Python.Work2.Library.1A.20260512.pdf |pdf]])
* Namespaces ([[Media:Python.Work2.Scope.1A.20231021.pdf |pdf]])


&lt;!----------------------------------------------------------------------&gt;

===   Handling Repetition ===
 
* Control ([[Media:Python.Repeat1.Control.1.A.20230314.pdf |pdf]])

* Loop ([[Media:Repeat2.Loop.1A.20230401.pdf |pdf]])

&lt;!----------------------------------------------------------------------&gt;

=== Handling a Big Work ===

* Functions ([[Media:Python.Work1.Function.1A.20230529.pdf |pdf]])
* Lambda ([[Media:Python.Work2.Lambda.1A.20230705.pdf |pdf]])
* Type Annotations ([[Media:Python.Work2.AtypeAnnot.1A.20230817.pdf |pdf]])

  
&lt;!----------------------------------------------------------------------&gt;

=== Handling Series of Data ===

* Arrays ([[Media:Python.Series1.Array.1A.pdf |pdf]])
* Tuples ([[Media:Python.Series2.Tuple.1A.pdf |pdf]])
* Lists ([[Media:Python.Series3.List.1A.pdf |pdf]])
* Tuples ([[Media:Python.Series4.Tuple.1A.pdf |pdf]])
* Sets ([[Media:Python.Series5.Set.1A.pdf |pdf]])
* Dictionary ([[Media:Python.Series6.Dictionary.1A.pdf |pdf]])

&lt;!----------------------------------------------------------------------&gt;

=== Handling Various Kinds of Data ===
  
* Types 
* Operators ([[Media:Python.Data3.Operators.1.A.pdf |pdf]])
* Files ([[Media:Python.Data4.File.1.A.pdf |pdf]])


&lt;!----------------------------------------------------------------------&gt;

=== Class and Objects ===
  
* Classes &amp; Objects ([[Media:Python.Work2.Class.1A.20230906.pdf |pdf]])
* Inheritance

 
&lt;!----------------------------------------------------------------------&gt;
&lt;/br&gt;

== Python in Numerical Analysis  ==
 
&lt;/br&gt;
&lt;/br&gt; 
go to [ [[Electrical_%26_Computer_Engineering_Studies]] ]

==External links==
* [http://www.southampton.ac.uk/~fangohr/training/python/pdfs/Python-for-Computational-Science-and-Engineering.pdf Python and Computational Science and Engineering]</text>
      <sha1>ho7ff4iqd1ee1jcg78xpzm3awzrbucg</sha1>
    </revision>
  </page>
  <page>
    <title>IP Telephony</title>
    <ns>0</ns>
    <id>218016</id>
    <revision>
      <id>2809846</id>
      <parentid>2564089</parentid>
      <timestamp>2026-05-17T04:00:26Z</timestamp>
      <contributor>
        <username>HenriPittier</username>
        <id>3076895</id>
      </contributor>
      <origin>2809846</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="897" sha1="ah05lo65rpndq1dksg3yzmz9u0ebsny" xml:space="preserve">{{delete|vandalism}}
This learning project provides a comprehensive overview of IP telephony architectures and protocols, with emphasis on SIP, the Session Initiation Protocol. Topics include a review of classical circuit-switched telephony, especially signaling; a review of IP networking, especially routing and addressing; peer and master-slave protocols for IP telephony (SIP, H.323, MGCP); speech coding; the transport of real-time traffic over IP (RTP and RTCP); bandwidth control; and issues in network quality of service, such as traffic modeling, dimensioning, and QoS mechanisms. Emphasis on SIP includes call flows, network components, security, routing, and advanced services.&lt;ref&gt;[http://catalog.northeastern.edu/course-descriptions/tele/ Northeastern University: Telecommunication Systems]&lt;/ref&gt;

== Subpages ==
{{Subpages/List}}

== References ==
{{Reflist}}

[[Category:Telephony]]</text>
      <sha1>ah05lo65rpndq1dksg3yzmz9u0ebsny</sha1>
    </revision>
    <revision>
      <id>2809853</id>
      <parentid>2809846</parentid>
      <timestamp>2026-05-17T04:30:24Z</timestamp>
      <contributor>
        <username>NguoiDungKhongDinhDanh</username>
        <id>2922842</id>
      </contributor>
      <minor />
      <comment>Reverted edit by [[Special:Contributions/HenriPittier|HenriPittier]] ([[User_talk:HenriPittier|talk]]) to last version by [[User:MathXplore|MathXplore]] using [[Wikiversity:Rollback|rollback]]</comment>
      <origin>2564089</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="876" sha1="t75kdi81qc25qbl7ewpdd5vp2z51c5v" xml:space="preserve">This learning project provides a comprehensive overview of IP telephony architectures and protocols, with emphasis on SIP, the Session Initiation Protocol. Topics include a review of classical circuit-switched telephony, especially signaling; a review of IP networking, especially routing and addressing; peer and master-slave protocols for IP telephony (SIP, H.323, MGCP); speech coding; the transport of real-time traffic over IP (RTP and RTCP); bandwidth control; and issues in network quality of service, such as traffic modeling, dimensioning, and QoS mechanisms. Emphasis on SIP includes call flows, network components, security, routing, and advanced services.&lt;ref&gt;[http://catalog.northeastern.edu/course-descriptions/tele/ Northeastern University: Telecommunication Systems]&lt;/ref&gt;

== Subpages ==
{{Subpages/List}}

== References ==
{{Reflist}}

[[Category:Telephony]]</text>
      <sha1>t75kdi81qc25qbl7ewpdd5vp2z51c5v</sha1>
    </revision>
  </page>
  <page>
    <title>Evidence-based assessment/ROC Party/Ready to ROC</title>
    <ns>0</ns>
    <id>219825</id>
    <revision>
      <id>2809755</id>
      <parentid>2622889</parentid>
      <timestamp>2026-05-16T21:42:34Z</timestamp>
      <contributor>
        <username>Eyoungstrom</username>
        <id>1933979</id>
      </contributor>
      <comment>/* In press */ updated citations</comment>
      <origin>2809755</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="15757" sha1="hrpia59vtzoj3v3dmczsxlawlnhnhjz" xml:space="preserve">&lt;noinclude&gt;{{Helping Give Away Psychological Science Banner}}&lt;/noinclude&gt;

This set of pages provides a practical introduction to Receiver Operating Characteristic (ROC) analyses, including sample code and examples generated with multiple popular statistical programs.

== Example ROC Party page ==
*Example [[Evidence based assessment/ROC Party|ROC Party]] page

== ROC sample code ==
*Example [https://docs.google.com/document/d/1Hgl06Oi5p1Yw0UsX7XTbEL4Cw6LnbX5mJ7l88ancdvw/edit ROC sample code] (includes R, SPSS, SAS)

== ROC Paper examples ==
The following papers are a selection that use ROC in their analyses, or illustrate application of DLRs to cases and decision-making, or both.

===In press===
*Cohen, J.R., Adams, Z.W., Menon, S.V., Youngstrom, E.A., Bunnell, B.E., Acierno, R., Ruggiero, K.J., &amp; Danielson, C.K. (2016). How should we screen for depression following a natural disaster? An ROC approach to post-disaster screening in adolescents and adults. ''Journal of Affective Disorders, 202'', 102-109. [https://doi.org/10.1016/j.jad.2016.05.034 doi:10.1016/j.jad.2016.05.034]
*Danielson, C.K., Cohen, J.R., Adams, Z.W., Youngstrom, E.A., Soltis, K., Amstadter, A.B., &amp; Ruggiero, K.J. (2017). Clinical decision making following disasters: Efficient identification of PTSD risk in adolescents. ''Journal of Abnormal Child Psychology, 45''(1), 117-129. [https://doi.org/10.1007/s10802-016-0159-3 doi:10.1007/s10802-016-0159-3]
*Jarrett, M.A., Van Meter, A.R., Youngstrom, E.A., Hilton, D.C., &amp; Ollendick, T.H. (2018). Evidence-based assessment of ADHD in youth using a receiver operating characteristic (ROC) approach. ''Journal of Clinical Child and Adolescent Psychology, 47''(5), 808-820. [https://doi.org/10.1080/15374416.2016.1225502 doi:10.1080/15374416.2016.1225502]
*Jo, B., Findling, R.L., Hastie, T.J., Youngstrom, E.A., Wang, C.P., Arnold, L.E., Fristad, M.A., Frazier, T.W., Birmaher, B., Gill, M.K., &amp; Horwitz, S.M.C. (2018). Construction of longitudinal prediction targets using semisupervised learning. ''Statistical Methods in Medical Research, 27''(9), 2674-2693. [https://doi.org/10.1177/0962280216684163 doi:10.1177/0962280216684163]
*Mesman, E., Youngstrom, E.A., Juliana, N.K., Nolen, W.A., &amp; Hillegers, M.H.J. (2017). Validation of the Seven Up Seven Down Inventory in bipolar offspring: Screening and prediction of mood disorders. Findings from the Dutch Bipolar Offspring Study. ''Journal of Affective Disorders, 207'', 95-101. [https://doi.org/10.1016/j.jad.2016.09.024 doi:10.1016/j.jad.2016.09.024]
*Ong, M.L., Youngstrom, E.A., **Chua, J.J.X., *Halverson, T.F., Horwitz, S.M., Storfer-Isser, A., Frazier, T.W., Fristad, M.A., Arnold, L.E., Phillips, M.L., Birmaher, B., Gill, M.K., Findling, R.L., &amp; The LAMS Group. (2017). Comparing the CASI-4R and the PGBI-10 M for differentiating bipolar spectrum disorders from other outpatient diagnoses in youth. ''Journal of Abnormal Child Psychology, 45''(3), 611-623. [https://doi.org/10.1007/s10802-016-0182-4 doi:10.1007/s10802-016-0182-4]
*Ransom, D.M., Burns, A.R., Youngstrom, E.A., Vaughan, C.G., Sady, M.D., &amp; Gioia, G.A. (2016). Applying an evidence-based assessment model to identify students at risk for perceived academic problems following concussion. ''Journal of the International Neuropsychological Society, 22''(10), 1038-1049. [https://doi.org/10.1017/S1355617716000916 doi:10.1017/S1355617716000916]
*Salcedo, S., Chen, Y.-L., Youngstrom, E.A., Fristad, M.A., Gadow, K.D., Horwitz, S.M., Frazier, T.W., Arnold, L.E., Phillips, M.L., Birmaher, B., Kowatch, R.A., &amp; Findling, R.L. (2018). Diagnostic efficiency of the Child and Adolescent Symptom Inventory (CASI-4R) Depression Subscale for identifying youth mood disorders. ''Journal of Clinical Child and Adolescent Psychology, 47''(5), 832-846. [https://doi.org/10.1080/15374416.2017.1280807 doi:10.1080/15374416.2017.1280807]
*You, D.S., Youngstrom, E.A., Feeny, N.C., Youngstrom, J.K., &amp; Findling, R.L. (2017). Comparing the diagnostic accuracy of five instruments for detecting posttraumatic stress disorder in youth. ''Journal of Clinical Child and Adolescent Psychology, 46''(4), 511-522. [https://doi.org/10.1080/15374416.2015.1030754 doi:10.1080/15374416.2015.1030754]

=== 2016 ===
*Algorta, G. P., Dodd, A. L., Stringaris, A., &amp; Youngstrom, E. A. (2016). Diagnostic efficiency of the SDQ for parents to identify ADHD in the UK: a ROC analysis. ''European child &amp; adolescent psychiatry'', ''25''(9), 949–957. &lt;nowiki&gt;https://doi.org/10.1007/s00787-015-0815-0&lt;/nowiki&gt;
*Youngstrom, E. A., &amp; Van Meter, A. (2016). Empirically supported assessment of children and adolescents. ''Clinical Psychology: Science and Practice, 23''(4), 327–347. &lt;nowiki&gt;https://doi.org/10.1037/h0101738&lt;/nowiki&gt;
*Frazier TW, Klingemier EW, Beukemann M, Speer L, Markowitz L, Parikh S, Wexberg S, Giuliano K, Schulte E, Delahunty C, Ahuja V, Eng C, Manos MJ, Hardan AY, Youngstrom EA, &amp; Strauss MS (2016). Development of an objective autism risk index using remote eye tracking. ''Journal of the American Academy of Child and Adolescent Psychiatry, 55,'' 301-309.
*Jenkins, M.M., &amp; Youngstrom, E.A. (2016). A randomized controlled trial of cognitive debiasing improves assessment and treatment selection for pediatric bipolar disorder. ''Journal of Consulting and Clinical Psychology, 84,'' 323-333.
*Van Meter, A. R., You, D. S., *Halverson, T., Youngstrom, E. A., Birmaher, B., Fristad, M. A., Kowatch, R.A., Storfer-Isser, A., Horwitz, S.M., Frazier, T.W., Arnold, L.E., Findling, R.L., The LAMS Group. (2016). Diagnostic Efficiency of Caregiver Report on the SCARED for Identifying Youth Anxiety Disorders in Outpatient Settings. ''Journal of Clinical Child &amp; Adolescent Psychology,'' 1-15. doi:10.1080/15374416.2016.1188698

=== 2015 ===
*Youngstrom, E.A., Hameed, A., Mitchell, M., Van Meter, A.R., Freeman, A.J., Perez Algorta, G., White, A.M., Clayton, P., Gelenberg, A., &amp; Meyer, R.E. (2015). Direct comparison of the psychometric properties of multiple interview and patient-rated assessments of suicidal ideation and behavior in an adult psychiatric inpatient sample. ''Journal of Clinical Psychiatry, 76,'' 1676-82. doi:10.4088/JCP.14m09353
*Youngstrom, E.A., &amp; De Los Reyes, A. (2015). Moving towards cost-effectiveness in using psychophysiological measures in clinical assessment: Validity, decision-making, and adding value. ''Journal of Clinical Child and Adolescent Psychology, 44,'' 352-361. doi:10.1080/15374416.2014.913252
*Youngstrom, E.A., *Choukas-Bradley, S., *Calhoun, C.D., &amp; Jensen-Doss, A. (2015). Clinical guide to the evidence-based assessment approach to diagnosis and treatment. ''Cognitive and Behavioral Practice, 22,'' 20-35. doi: 10.1016/j.cbpra.2013.12.005 
*Lindhiem, O., Yu, L., Grasso, D.J., Kolko, D.J., &amp; Youngstrom, E.A. (2015). Adapting the Posterior Probability of Diagnosis (PPOD) index to enhance evidence-based screening: An application to ADHD in primary care. ''Assessment, 22,'' 198-207. doi: 10.1177/1073191114540748
*Prieto, M.L., Youngstrom, E.A., Ozerdem, A., Altinbas, K., Quiroz, D., Aydemir, O., Yalin, N., Geske, J.R., Feeder, S.E., Angst, J., &amp; Frye, M.A. (2015). Different patterns of manic/hypomanic symptoms in depression: A pilot modification of the Hypomania Checklist - 32 to assess mixed depression. ''Journal of Affective Disorders, 172,'' 355-360. doi: 10.1016/j.jad.2014.09.047

=== 2014 ===
*Youngstrom, E.A. (2014). A primer on Receiver Operating Characteristic analysis and diagnostic efficiency statistics for pediatric psychology: We are ready to ROC. ''Journal of Pediatric Psychology, 39,'' 204-221. Special Issue: Quantitative Methodology (Guest Editors: Bryan Karaszia &amp; Kristoffer Berlin); doi: 10.1093/jpepsy/jst062 
*Frazier, T., Youngstrom, E.A., Fristad, M., Demeter, C., Birmaher, B., Kowatch, R., . . . Findling, R. (2014). Improving clinical prediction of bipolar spectrum disorders in youth. ''Journal of Clinical Medicine, 3,'' 218-232. doi: 10.3390/jcm3010218
*Lee, H.J., Joo, Y., Youngstrom, E.A., Yum, S.Y., Findling, R.L., &amp; Kim, H.W. (2014). Diagnostic validity and reliability of a Korean version of the Parent and Adolescent General Behavior Inventories. ''Comprehensive Psychiatry, 55,'' 1730-1737. doi:10.1016/j.comppsych.2014.05.008
*Pendergast, L. L., Youngstrom, E. A., Merkitch, K. G., Moore, K. A., Black, C. L., Abramson, L. Y., &amp; Alloy, L. B. (2014). Differentiating bipolar disorder from unipolar depression and ADHD: the utility of the General Behavior Inventory. ''Psychological Assessment, 26,'' 195-206. doi: 10.1037/a0035138
*Van Meter, A. R., Youngstrom, E. A., Youngstrom, J. K., Ollendick, T., Demeter, C., &amp; Findling, R. L. (2014). Clinical decision-making about child and adolescent anxiety disorders using the Achenbach System of Empirically Based Assessment. ''Journal of Clinical Child &amp; Adolescent Psychology.''

=== 2013 ===
*Youngstrom, E.A. (2013). Future directions in psychological assessment: Combining evidence based medicine innovations with psychology’s historical strengths to enhance utility. ''Journal of Clinical Child and Adolescent Psychology, 42,'' 139-159. doi: 10.1080/15374416.2012.736358.
*Algorta, G.P., Youngstrom, E.A., Phelps, J., *Jenkins, M.M., Youngstrom, J.K., &amp; Findling, R.L. (2013). An inexpensive family index of risk for mood issues improves identification of pediatric bipolar disorder. ''Psychological Assessment, 25,'' 12-22. doi: 10.1037/a0029225

=== 2012 ===
*Freeman, A.J., Youngstrom, E.A., Demeter, C., Youngstrom, J.K., &amp; Findling, R.L. (2012). Portability of a screener for pediatric bipolar disorder to a diverse setting. ''Psychological Assessment, 24,'' 341-351. doi: 10.1037/a0025617 

*Jenkins, M.M., Youngstrom, E.A., Youngstrom, J.K., Feeny, N.C. &amp; Findling, R.L. (2012). Generalizability of evidence-based assessment recommendations for pediatric bipolar disorder. ''Psychological Assessment, 24,'' 269-281. doi: 10.1037/a0025775

=== 2011 ===
*Jenkins, M.M., Youngstrom, E.A., Washburn, J.J., &amp; Youngstrom, J.K. (2011). Evidence-based strategies improve assessment of pediatric bipolar disorder by community practitioners. ''Professional Psychology: Research and Practice, 42,'' 121-129. doi: 10.1037/a0022506

=== 2010 ===
*Horwitz, S.M., Demeter, C., Pagano, M.E., Youngstrom, E.A., Fristad, M.A., Arnold, L.E., Birmaher, B., Gill, M.K., Axelson, D., Kowatch, R.A. &amp; Findling, R.L. (2010). Identification of a childhood bipolar phenotype-the Longitudinal Assessment of Symptoms of Mania Study: Background, design and initial screening. ''Journal of Clinical Psychiatry, 71,'' 1511-1517. doi: 10.4088/JCP.09m05835yel2009
*Youngstrom, E.A., &amp; Kendall, P.C. (2009). Psychological science and bipolar disorder. ''Clinical Psychology: Science and Practice, 16,'' 93-97. doi: 10.1111/j.1468-2850.2009.01149.x 
*Youngstrom, E.A., *Freeman, A.J., &amp; *Jenkins, M.M. (2009). The assessment of bipolar disorder in children and adolescents. ''Child and Adolescent Psychiatric Clinics of North America, 18,'' 353-390. doi: 10.1016/j.chc.2008.12.002
*Meyer, S. E., Carlson, G. A., Youngstrom, E., Ronsaville, D. S., Martinez, P. E., Gold, P. W., Hakak, R., &amp; Radke-Yarrow, M. (2009). Long-term outcomes of youth who manifested the CBCL-Pediatric Bipolar Disorder phenotype during childhood and/or adolescence. ''Journal of Affective Disorders, 113,'' 227-235. doi: 10.1016/j.jad.2008.05.024

=== 2008 ===
*Youngstrom, E.A., *Frazier, T.W., Demeter, C., Calabrese, J.R., &amp; Findling, R.L. (2008). Developing a ten-item mania scale from the Parent General Behavior Inventory for children and adolescents. ''Journal of Clinical Psychiatry, 69,'' 831-839. doi:10.4088/JCP.v69n0517 
*Youngstrom, E.A., *Greene, J., &amp; *Joseph, M. (2008). Comparing the psychometric properties of multiple teacher report instruments as predictors of bipolar disorder in children and adolescents. ''Journal of Clinical Psychology, 64,'' 382-401. doi: 10.1002/jclp.20462

*Henry, D., Pavuluri, M., Youngstrom, E.A., &amp; Birmaher, B. (2008). Accuracy of brief and full forms of a mania rating scale. ''Journal of Clinical Psychology, 64,'' 368-381. doi: 10.1002/jclp.20464
*Meyers, O.I., &amp; Youngstrom, E.A. (2008). A Parent General Behavior Inventory subscale to measure sleep disturbance in pediatric bipolar disorder. ''Journal of Clinical Psychiatry, 69,'' 840-843. doi: 10.1016/j.jad.20009.07.020

=== 2007 ===
*Patel, N.C., Patrick, D.M., Youngstrom, E.A., Strakowski, S.M., &amp; DelBello, M.P. (2007). Response and remission in adolescent mania: Signal detection analyses of the Young Mania Rating Scale. ''Journal of the American Academy of Child and Adolescent Psychiatry, 46,'' 628-635. doi: 10.1097/chi.0b013e3180335ae4 
=== 2006 ===
*Youngstrom, E.A., *Meyers, O.I., Youngstrom, J.K., Calabrese, J.R., &amp; Findling, R.L. (2006). Comparing the effects of sampling designs on the diagnostic accuracy of eight promising screening algorithms for pediatric bipolar disorder. ''Biological Psychiatry, 60,'' 1013-1019. doi: 10.1016/j.biopsych.2006.06.023.

*Frazier, T.W., &amp; Youngstrom, E.A. (2006). Evidence based assessment of attention-deficit/hyperactivity disorder: Using multiple sources of information. ''Journal of the American Academy of Child and Adolescent Psychiatry, 45,'' 614-620. doi: 10.1097/01.chi.0000196597.09103.25

=== 2005 ===

*Youngstrom, E. A., *Meyers, O. I., Demeter, C., Kogos Youngstrom, J., Morello, L., Piiparinen, R., Feeny, N. C., Findling, R. L., &amp; Calabrese, J. R. (2005). Comparing diagnostic checklists for pediatric bipolar disorder in academic and community mental health settings. ''Bipolar Disorders, 7,'' 507-517. doi: j.1399-5618.2005.00269.x 

*Youngstrom, E. A., Findling, R. L., Youngstrom, J. K., &amp; Calabrese, J. R., (2005). Towards an evidence-based assessment of pediatric bipolar disorder. ''Journal of Clinical Child and Adolescent Psychology, 34,'' 433-448. Special Issue: Evidence-Based Assessment. doi: 10.1207/s15374424jccp3403_4
*Youngstrom, E. A., &amp; *Duax, J. (2005). Evidence Based Assessment of Pediatric Bipolar Disorder, Part 1: Base Rate and Family History. ''Journal of the American Academy of Child and Adolescent Psychiatry, 44,'' 712-717. doi: 10.1097/01.chi.0000162581.87710.bd

*Youngstrom, E. A., &amp; Kogos Youngstrom, J. (2005). Evidence Based Assessment of Pediatric Bipolar Disorder, Part 2: Incorporating Information from Behavior Checklists. ''Journal of the American Academy of Child and Adolescent Psychiatry, 44''(8), 823-828. doi: 10.1097/01.chi.0000164589.10200.a4

=== 2004 ===
*Youngstrom, E. A., Findling, R. L., Calabrese, J. R., Gracious, B. L., Demeter, C., DelPorto Bedoya, D., &amp; *Price, M.E. (2004). Comparing the diagnostic accuracy of six potential screening instruments for bipolar disorder in youths aged 5 to 17 years. ''Journal of the American Academy of Child &amp; Adolescent Psychiatry, 43,'' 847-858. doi: 10.1097/01.chi.0000125091.35109.1e

=== 2003 ===
*Danielson, C. K., Youngstrom, E. A., Findling, R. L., &amp; Calabrese, J. R. (2003). Discriminative validity of the General Behavior Inventory using youth report. ''Journal of Abnormal Child Psychology, 31,'' 29-39. doi: 10.1023/A:1021717231272

=== 2002 ===
*Findling, R. L., Youngstrom, E. A., DelPorto, D., Papish-David, R., Townsend, L., *Danielson, C. K., &amp; Calabrese, J. R. (2002). Clinical decision-making using the General Behavior Inventory. ''Bipolar Disorders, 4,'' 34-42. doi: 10.1034/j.1399-5618.2002.40102.

=== 2001 ===
*Youngstrom, E.A., Findling, R.L., *Danielson, C.K., &amp; Calabrese, J.R. (2001). Discriminative validity of parent report of hypomanic and depressive symptoms on the General Behavior Inventory. ''Psychological Assessment, 13,'' 267-276. doi: 10.1037//1040-3590.13.2.267

[[Category:Evidence-based assessment]]</text>
      <sha1>hrpia59vtzoj3v3dmczsxlawlnhnhjz</sha1>
    </revision>
    <revision>
      <id>2809756</id>
      <parentid>2809755</parentid>
      <timestamp>2026-05-16T21:45:23Z</timestamp>
      <contributor>
        <username>Eyoungstrom</username>
        <id>1933979</id>
      </contributor>
      <comment>/* In press */ added Tsai papers</comment>
      <origin>2809756</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="16467" sha1="8r3frbvhtu9ho1rq8jqmes75bwiotob" xml:space="preserve">&lt;noinclude&gt;{{Helping Give Away Psychological Science Banner}}&lt;/noinclude&gt;

This set of pages provides a practical introduction to Receiver Operating Characteristic (ROC) analyses, including sample code and examples generated with multiple popular statistical programs.

== Example ROC Party page ==
*Example [[Evidence based assessment/ROC Party|ROC Party]] page

== ROC sample code ==
*Example [https://docs.google.com/document/d/1Hgl06Oi5p1Yw0UsX7XTbEL4Cw6LnbX5mJ7l88ancdvw/edit ROC sample code] (includes R, SPSS, SAS)

== ROC Paper examples ==
The following papers are a selection that use ROC in their analyses, or illustrate application of DLRs to cases and decision-making, or both.

===In press===
*Cohen, J.R., Adams, Z.W., Menon, S.V., Youngstrom, E.A., Bunnell, B.E., Acierno, R., Ruggiero, K.J., &amp; Danielson, C.K. (2016). How should we screen for depression following a natural disaster? An ROC approach to post-disaster screening in adolescents and adults. ''Journal of Affective Disorders, 202'', 102-109. [https://doi.org/10.1016/j.jad.2016.05.034 doi:10.1016/j.jad.2016.05.034]
*Danielson, C.K., Cohen, J.R., Adams, Z.W., Youngstrom, E.A., Soltis, K., Amstadter, A.B., &amp; Ruggiero, K.J. (2017). Clinical decision making following disasters: Efficient identification of PTSD risk in adolescents. ''Journal of Abnormal Child Psychology, 45''(1), 117-129. [https://doi.org/10.1007/s10802-016-0159-3 doi:10.1007/s10802-016-0159-3]
*Jarrett, M.A., Van Meter, A.R., Youngstrom, E.A., Hilton, D.C., &amp; Ollendick, T.H. (2018). Evidence-based assessment of ADHD in youth using a receiver operating characteristic (ROC) approach. ''Journal of Clinical Child and Adolescent Psychology, 47''(5), 808-820. [https://doi.org/10.1080/15374416.2016.1225502 doi:10.1080/15374416.2016.1225502]
*Jo, B., Findling, R.L., Hastie, T.J., Youngstrom, E.A., Wang, C.P., Arnold, L.E., Fristad, M.A., Frazier, T.W., Birmaher, B., Gill, M.K., &amp; Horwitz, S.M.C. (2018). Construction of longitudinal prediction targets using semisupervised learning. ''Statistical Methods in Medical Research, 27''(9), 2674-2693. [https://doi.org/10.1177/0962280216684163 doi:10.1177/0962280216684163]
*Mesman, E., Youngstrom, E.A., Juliana, N.K., Nolen, W.A., &amp; Hillegers, M.H.J. (2017). Validation of the Seven Up Seven Down Inventory in bipolar offspring: Screening and prediction of mood disorders. Findings from the Dutch Bipolar Offspring Study. ''Journal of Affective Disorders, 207'', 95-101. [https://doi.org/10.1016/j.jad.2016.09.024 doi:10.1016/j.jad.2016.09.024]
*Ong, M.L., Youngstrom, E.A., **Chua, J.J.X., *Halverson, T.F., Horwitz, S.M., Storfer-Isser, A., Frazier, T.W., Fristad, M.A., Arnold, L.E., Phillips, M.L., Birmaher, B., Gill, M.K., Findling, R.L., &amp; The LAMS Group. (2017). Comparing the CASI-4R and the PGBI-10 M for differentiating bipolar spectrum disorders from other outpatient diagnoses in youth. ''Journal of Abnormal Child Psychology, 45''(3), 611-623. [https://doi.org/10.1007/s10802-016-0182-4 doi:10.1007/s10802-016-0182-4]
*Ransom, D.M., Burns, A.R., Youngstrom, E.A., Vaughan, C.G., Sady, M.D., &amp; Gioia, G.A. (2016). Applying an evidence-based assessment model to identify students at risk for perceived academic problems following concussion. ''Journal of the International Neuropsychological Society, 22''(10), 1038-1049. [https://doi.org/10.1017/S1355617716000916 doi:10.1017/S1355617716000916]
*Salcedo, S., Chen, Y.-L., Youngstrom, E.A., Fristad, M.A., Gadow, K.D., Horwitz, S.M., Frazier, T.W., Arnold, L.E., Phillips, M.L., Birmaher, B., Kowatch, R.A., &amp; Findling, R.L. (2018). Diagnostic efficiency of the Child and Adolescent Symptom Inventory (CASI-4R) Depression Subscale for identifying youth mood disorders. ''Journal of Clinical Child and Adolescent Psychology, 47''(5), 832-846. [https://doi.org/10.1080/15374416.2017.1280807 doi:10.1080/15374416.2017.1280807]
*Tsai, A. P., Smith, R. K., Gonzalez, M., Youngstrom, E. A., Daughters, S. B., Youngstrom, J. K., &amp; Findling, R. L. (2022). Diagnostic accuracy of Achenbach scales in detecting youths' substance use disorders. Psychological Assessment, 34(6), 570–582. https://doi.org/10.1037/pas0001115  
*Tsai, A. P., Youngstrom, E. A., Gadow, K. D., Horwitz, S. M., Fristad, M. A., Daughters, S. B., Young, A. S., Arnold, L. E., Birmaher, B., Salcedo, S., The Lams, G., &amp; Findling, R. L. (2023). Diagnostic accuracy of the Child and Adolescent Symptom Inventory (CASI-4R) substance use subscale in detecting substance use disorders in youth. Psychological Assessment, 35(2), 178–187. https://doi.org/10.1037/pas0001182 
*You, D.S., Youngstrom, E.A., Feeny, N.C., Youngstrom, J.K., &amp; Findling, R.L. (2017). Comparing the diagnostic accuracy of five instruments for detecting posttraumatic stress disorder in youth. ''Journal of Clinical Child and Adolescent Psychology, 46''(4), 511-522. [https://doi.org/10.1080/15374416.2015.1030754 doi:10.1080/15374416.2015.1030754]

=== 2016 ===
*Algorta, G. P., Dodd, A. L., Stringaris, A., &amp; Youngstrom, E. A. (2016). Diagnostic efficiency of the SDQ for parents to identify ADHD in the UK: a ROC analysis. ''European child &amp; adolescent psychiatry'', ''25''(9), 949–957. &lt;nowiki&gt;https://doi.org/10.1007/s00787-015-0815-0&lt;/nowiki&gt;
*Youngstrom, E. A., &amp; Van Meter, A. (2016). Empirically supported assessment of children and adolescents. ''Clinical Psychology: Science and Practice, 23''(4), 327–347. &lt;nowiki&gt;https://doi.org/10.1037/h0101738&lt;/nowiki&gt;
*Frazier TW, Klingemier EW, Beukemann M, Speer L, Markowitz L, Parikh S, Wexberg S, Giuliano K, Schulte E, Delahunty C, Ahuja V, Eng C, Manos MJ, Hardan AY, Youngstrom EA, &amp; Strauss MS (2016). Development of an objective autism risk index using remote eye tracking. ''Journal of the American Academy of Child and Adolescent Psychiatry, 55,'' 301-309.
*Jenkins, M.M., &amp; Youngstrom, E.A. (2016). A randomized controlled trial of cognitive debiasing improves assessment and treatment selection for pediatric bipolar disorder. ''Journal of Consulting and Clinical Psychology, 84,'' 323-333.
*Van Meter, A. R., You, D. S., *Halverson, T., Youngstrom, E. A., Birmaher, B., Fristad, M. A., Kowatch, R.A., Storfer-Isser, A., Horwitz, S.M., Frazier, T.W., Arnold, L.E., Findling, R.L., The LAMS Group. (2016). Diagnostic Efficiency of Caregiver Report on the SCARED for Identifying Youth Anxiety Disorders in Outpatient Settings. ''Journal of Clinical Child &amp; Adolescent Psychology,'' 1-15. doi:10.1080/15374416.2016.1188698

=== 2015 ===
*Youngstrom, E.A., Hameed, A., Mitchell, M., Van Meter, A.R., Freeman, A.J., Perez Algorta, G., White, A.M., Clayton, P., Gelenberg, A., &amp; Meyer, R.E. (2015). Direct comparison of the psychometric properties of multiple interview and patient-rated assessments of suicidal ideation and behavior in an adult psychiatric inpatient sample. ''Journal of Clinical Psychiatry, 76,'' 1676-82. doi:10.4088/JCP.14m09353
*Youngstrom, E.A., &amp; De Los Reyes, A. (2015). Moving towards cost-effectiveness in using psychophysiological measures in clinical assessment: Validity, decision-making, and adding value. ''Journal of Clinical Child and Adolescent Psychology, 44,'' 352-361. doi:10.1080/15374416.2014.913252
*Youngstrom, E.A., *Choukas-Bradley, S., *Calhoun, C.D., &amp; Jensen-Doss, A. (2015). Clinical guide to the evidence-based assessment approach to diagnosis and treatment. ''Cognitive and Behavioral Practice, 22,'' 20-35. doi: 10.1016/j.cbpra.2013.12.005 
*Lindhiem, O., Yu, L., Grasso, D.J., Kolko, D.J., &amp; Youngstrom, E.A. (2015). Adapting the Posterior Probability of Diagnosis (PPOD) index to enhance evidence-based screening: An application to ADHD in primary care. ''Assessment, 22,'' 198-207. doi: 10.1177/1073191114540748
*Prieto, M.L., Youngstrom, E.A., Ozerdem, A., Altinbas, K., Quiroz, D., Aydemir, O., Yalin, N., Geske, J.R., Feeder, S.E., Angst, J., &amp; Frye, M.A. (2015). Different patterns of manic/hypomanic symptoms in depression: A pilot modification of the Hypomania Checklist - 32 to assess mixed depression. ''Journal of Affective Disorders, 172,'' 355-360. doi: 10.1016/j.jad.2014.09.047

=== 2014 ===
*Youngstrom, E.A. (2014). A primer on Receiver Operating Characteristic analysis and diagnostic efficiency statistics for pediatric psychology: We are ready to ROC. ''Journal of Pediatric Psychology, 39,'' 204-221. Special Issue: Quantitative Methodology (Guest Editors: Bryan Karaszia &amp; Kristoffer Berlin); doi: 10.1093/jpepsy/jst062 
*Frazier, T., Youngstrom, E.A., Fristad, M., Demeter, C., Birmaher, B., Kowatch, R., . . . Findling, R. (2014). Improving clinical prediction of bipolar spectrum disorders in youth. ''Journal of Clinical Medicine, 3,'' 218-232. doi: 10.3390/jcm3010218
*Lee, H.J., Joo, Y., Youngstrom, E.A., Yum, S.Y., Findling, R.L., &amp; Kim, H.W. (2014). Diagnostic validity and reliability of a Korean version of the Parent and Adolescent General Behavior Inventories. ''Comprehensive Psychiatry, 55,'' 1730-1737. doi:10.1016/j.comppsych.2014.05.008
*Pendergast, L. L., Youngstrom, E. A., Merkitch, K. G., Moore, K. A., Black, C. L., Abramson, L. Y., &amp; Alloy, L. B. (2014). Differentiating bipolar disorder from unipolar depression and ADHD: the utility of the General Behavior Inventory. ''Psychological Assessment, 26,'' 195-206. doi: 10.1037/a0035138
*Van Meter, A. R., Youngstrom, E. A., Youngstrom, J. K., Ollendick, T., Demeter, C., &amp; Findling, R. L. (2014). Clinical decision-making about child and adolescent anxiety disorders using the Achenbach System of Empirically Based Assessment. ''Journal of Clinical Child &amp; Adolescent Psychology.''

=== 2013 ===
*Youngstrom, E.A. (2013). Future directions in psychological assessment: Combining evidence based medicine innovations with psychology’s historical strengths to enhance utility. ''Journal of Clinical Child and Adolescent Psychology, 42,'' 139-159. doi: 10.1080/15374416.2012.736358.
*Algorta, G.P., Youngstrom, E.A., Phelps, J., *Jenkins, M.M., Youngstrom, J.K., &amp; Findling, R.L. (2013). An inexpensive family index of risk for mood issues improves identification of pediatric bipolar disorder. ''Psychological Assessment, 25,'' 12-22. doi: 10.1037/a0029225

=== 2012 ===
*Freeman, A.J., Youngstrom, E.A., Demeter, C., Youngstrom, J.K., &amp; Findling, R.L. (2012). Portability of a screener for pediatric bipolar disorder to a diverse setting. ''Psychological Assessment, 24,'' 341-351. doi: 10.1037/a0025617 

*Jenkins, M.M., Youngstrom, E.A., Youngstrom, J.K., Feeny, N.C. &amp; Findling, R.L. (2012). Generalizability of evidence-based assessment recommendations for pediatric bipolar disorder. ''Psychological Assessment, 24,'' 269-281. doi: 10.1037/a0025775

=== 2011 ===
*Jenkins, M.M., Youngstrom, E.A., Washburn, J.J., &amp; Youngstrom, J.K. (2011). Evidence-based strategies improve assessment of pediatric bipolar disorder by community practitioners. ''Professional Psychology: Research and Practice, 42,'' 121-129. doi: 10.1037/a0022506

=== 2010 ===
*Horwitz, S.M., Demeter, C., Pagano, M.E., Youngstrom, E.A., Fristad, M.A., Arnold, L.E., Birmaher, B., Gill, M.K., Axelson, D., Kowatch, R.A. &amp; Findling, R.L. (2010). Identification of a childhood bipolar phenotype-the Longitudinal Assessment of Symptoms of Mania Study: Background, design and initial screening. ''Journal of Clinical Psychiatry, 71,'' 1511-1517. doi: 10.4088/JCP.09m05835yel2009
*Youngstrom, E.A., &amp; Kendall, P.C. (2009). Psychological science and bipolar disorder. ''Clinical Psychology: Science and Practice, 16,'' 93-97. doi: 10.1111/j.1468-2850.2009.01149.x 
*Youngstrom, E.A., *Freeman, A.J., &amp; *Jenkins, M.M. (2009). The assessment of bipolar disorder in children and adolescents. ''Child and Adolescent Psychiatric Clinics of North America, 18,'' 353-390. doi: 10.1016/j.chc.2008.12.002
*Meyer, S. E., Carlson, G. A., Youngstrom, E., Ronsaville, D. S., Martinez, P. E., Gold, P. W., Hakak, R., &amp; Radke-Yarrow, M. (2009). Long-term outcomes of youth who manifested the CBCL-Pediatric Bipolar Disorder phenotype during childhood and/or adolescence. ''Journal of Affective Disorders, 113,'' 227-235. doi: 10.1016/j.jad.2008.05.024

=== 2008 ===
*Youngstrom, E.A., *Frazier, T.W., Demeter, C., Calabrese, J.R., &amp; Findling, R.L. (2008). Developing a ten-item mania scale from the Parent General Behavior Inventory for children and adolescents. ''Journal of Clinical Psychiatry, 69,'' 831-839. doi:10.4088/JCP.v69n0517 
*Youngstrom, E.A., *Greene, J., &amp; *Joseph, M. (2008). Comparing the psychometric properties of multiple teacher report instruments as predictors of bipolar disorder in children and adolescents. ''Journal of Clinical Psychology, 64,'' 382-401. doi: 10.1002/jclp.20462

*Henry, D., Pavuluri, M., Youngstrom, E.A., &amp; Birmaher, B. (2008). Accuracy of brief and full forms of a mania rating scale. ''Journal of Clinical Psychology, 64,'' 368-381. doi: 10.1002/jclp.20464
*Meyers, O.I., &amp; Youngstrom, E.A. (2008). A Parent General Behavior Inventory subscale to measure sleep disturbance in pediatric bipolar disorder. ''Journal of Clinical Psychiatry, 69,'' 840-843. doi: 10.1016/j.jad.20009.07.020

=== 2007 ===
*Patel, N.C., Patrick, D.M., Youngstrom, E.A., Strakowski, S.M., &amp; DelBello, M.P. (2007). Response and remission in adolescent mania: Signal detection analyses of the Young Mania Rating Scale. ''Journal of the American Academy of Child and Adolescent Psychiatry, 46,'' 628-635. doi: 10.1097/chi.0b013e3180335ae4 
=== 2006 ===
*Youngstrom, E.A., *Meyers, O.I., Youngstrom, J.K., Calabrese, J.R., &amp; Findling, R.L. (2006). Comparing the effects of sampling designs on the diagnostic accuracy of eight promising screening algorithms for pediatric bipolar disorder. ''Biological Psychiatry, 60,'' 1013-1019. doi: 10.1016/j.biopsych.2006.06.023.

*Frazier, T.W., &amp; Youngstrom, E.A. (2006). Evidence based assessment of attention-deficit/hyperactivity disorder: Using multiple sources of information. ''Journal of the American Academy of Child and Adolescent Psychiatry, 45,'' 614-620. doi: 10.1097/01.chi.0000196597.09103.25

=== 2005 ===

*Youngstrom, E. A., *Meyers, O. I., Demeter, C., Kogos Youngstrom, J., Morello, L., Piiparinen, R., Feeny, N. C., Findling, R. L., &amp; Calabrese, J. R. (2005). Comparing diagnostic checklists for pediatric bipolar disorder in academic and community mental health settings. ''Bipolar Disorders, 7,'' 507-517. doi: j.1399-5618.2005.00269.x 

*Youngstrom, E. A., Findling, R. L., Youngstrom, J. K., &amp; Calabrese, J. R., (2005). Towards an evidence-based assessment of pediatric bipolar disorder. ''Journal of Clinical Child and Adolescent Psychology, 34,'' 433-448. Special Issue: Evidence-Based Assessment. doi: 10.1207/s15374424jccp3403_4
*Youngstrom, E. A., &amp; *Duax, J. (2005). Evidence Based Assessment of Pediatric Bipolar Disorder, Part 1: Base Rate and Family History. ''Journal of the American Academy of Child and Adolescent Psychiatry, 44,'' 712-717. doi: 10.1097/01.chi.0000162581.87710.bd

*Youngstrom, E. A., &amp; Kogos Youngstrom, J. (2005). Evidence Based Assessment of Pediatric Bipolar Disorder, Part 2: Incorporating Information from Behavior Checklists. ''Journal of the American Academy of Child and Adolescent Psychiatry, 44''(8), 823-828. doi: 10.1097/01.chi.0000164589.10200.a4

=== 2004 ===
*Youngstrom, E. A., Findling, R. L., Calabrese, J. R., Gracious, B. L., Demeter, C., DelPorto Bedoya, D., &amp; *Price, M.E. (2004). Comparing the diagnostic accuracy of six potential screening instruments for bipolar disorder in youths aged 5 to 17 years. ''Journal of the American Academy of Child &amp; Adolescent Psychiatry, 43,'' 847-858. doi: 10.1097/01.chi.0000125091.35109.1e

=== 2003 ===
*Danielson, C. K., Youngstrom, E. A., Findling, R. L., &amp; Calabrese, J. R. (2003). Discriminative validity of the General Behavior Inventory using youth report. ''Journal of Abnormal Child Psychology, 31,'' 29-39. doi: 10.1023/A:1021717231272

=== 2002 ===
*Findling, R. L., Youngstrom, E. A., DelPorto, D., Papish-David, R., Townsend, L., *Danielson, C. K., &amp; Calabrese, J. R. (2002). Clinical decision-making using the General Behavior Inventory. ''Bipolar Disorders, 4,'' 34-42. doi: 10.1034/j.1399-5618.2002.40102.

=== 2001 ===
*Youngstrom, E.A., Findling, R.L., *Danielson, C.K., &amp; Calabrese, J.R. (2001). Discriminative validity of parent report of hypomanic and depressive symptoms on the General Behavior Inventory. ''Psychological Assessment, 13,'' 267-276. doi: 10.1037//1040-3590.13.2.267

[[Category:Evidence-based assessment]]</text>
      <sha1>8r3frbvhtu9ho1rq8jqmes75bwiotob</sha1>
    </revision>
    <revision>
      <id>2809757</id>
      <parentid>2809756</parentid>
      <timestamp>2026-05-16T21:55:57Z</timestamp>
      <contributor>
        <username>Eyoungstrom</username>
        <id>1933979</id>
      </contributor>
      <comment>/* In press */ added 3 recent papers</comment>
      <origin>2809757</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="17349" sha1="fpf9dvxupmmvxdg3igdwv2lkk1z9ibs" xml:space="preserve">&lt;noinclude&gt;{{Helping Give Away Psychological Science Banner}}&lt;/noinclude&gt;

This set of pages provides a practical introduction to Receiver Operating Characteristic (ROC) analyses, including sample code and examples generated with multiple popular statistical programs.

== Example ROC Party page ==
*Example [[Evidence based assessment/ROC Party|ROC Party]] page

== ROC sample code ==
*Example [https://docs.google.com/document/d/1Hgl06Oi5p1Yw0UsX7XTbEL4Cw6LnbX5mJ7l88ancdvw/edit ROC sample code] (includes R, SPSS, SAS)

== ROC Paper examples ==
The following papers are a selection that use ROC in their analyses, or illustrate application of DLRs to cases and decision-making, or both.

===In press===
*Cohen, J.R., Adams, Z.W., Menon, S.V., Youngstrom, E.A., Bunnell, B.E., Acierno, R., Ruggiero, K.J., &amp; Danielson, C.K. (2016). How should we screen for depression following a natural disaster? An ROC approach to post-disaster screening in adolescents and adults. ''Journal of Affective Disorders, 202'', 102-109. [https://doi.org/10.1016/j.jad.2016.05.034 doi:10.1016/j.jad.2016.05.034]
*Danielson, C.K., Cohen, J.R., Adams, Z.W., Youngstrom, E.A., Soltis, K., Amstadter, A.B., &amp; Ruggiero, K.J. (2017). Clinical decision making following disasters: Efficient identification of PTSD risk in adolescents. ''Journal of Abnormal Child Psychology, 45''(1), 117-129. [https://doi.org/10.1007/s10802-016-0159-3 doi:10.1007/s10802-016-0159-3]
*Jarrett, M.A., Van Meter, A.R., Youngstrom, E.A., Hilton, D.C., &amp; Ollendick, T.H. (2018). Evidence-based assessment of ADHD in youth using a receiver operating characteristic (ROC) approach. ''Journal of Clinical Child and Adolescent Psychology, 47''(5), 808-820. [https://doi.org/10.1080/15374416.2016.1225502 doi:10.1080/15374416.2016.1225502]
*Jo, B., Findling, R.L., Hastie, T.J., Youngstrom, E.A., Wang, C.P., Arnold, L.E., Fristad, M.A., Frazier, T.W., Birmaher, B., Gill, M.K., &amp; Horwitz, S.M.C. (2018). Construction of longitudinal prediction targets using semisupervised learning. ''Statistical Methods in Medical Research, 27''(9), 2674-2693. [https://doi.org/10.1177/0962280216684163 doi:10.1177/0962280216684163]
*Langfus, J. A., Chen, Y. L., Janos, J. A., Youngstrom, J. K., Findling, R. L., &amp; Youngstrom, E. A. (2025). Psychometric Properties and Clinical Utility of CBCL and P-GBI Sleep Items in Children and Adolescents. Journal of Clinical Child and Adolescent Psychology, 54(3), 328–345. https://doi.org/10.1080/15374416.2023.2272965 
*Mesman, E., Youngstrom, E.A., Juliana, N.K., Nolen, W.A., &amp; Hillegers, M.H.J. (2017). Validation of the Seven Up Seven Down Inventory in bipolar offspring: Screening and prediction of mood disorders. Findings from the Dutch Bipolar Offspring Study. ''Journal of Affective Disorders, 207'', 95-101. [[doi:10.1016/j.jad.2016.09.024]]
*Ong, M.L., Youngstrom, E.A., **Chua, J.J.X., *Halverson, T.F., Horwitz, S.M., Storfer-Isser, A., Frazier, T.W., Fristad, M.A., Arnold, L.E., Phillips, M.L., Birmaher, B., Gill, M.K., Findling, R.L., &amp; The LAMS Group. (2017). Comparing the CASI-4R and the PGBI-10 M for differentiating bipolar spectrum disorders from other outpatient diagnoses in youth. ''Journal of Abnormal Child Psychology, 45''(3), 611-623. [https://doi.org/10.1007/s10802-016-0182-4 doi:10.1007/s10802-016-0182-4]
*Pendergast, L. L., Youngstrom, E. A., Merkitch, K. G., Moore, K. A., Black, C. L., Abramson, L. Y., &amp; Alloy, L. B. (2014). Differentiating bipolar disorder from unipolar depression and ADHD: The utility of the General Behavior Inventory. Psychological Assessment, 26(1), 195–206. https://doi.org/10.1037/a0035138 
*Ransom, D.M., Burns, A.R., Youngstrom, E.A., Vaughan, C.G., Sady, M.D., &amp; Gioia, G.A. (2016). Applying an evidence-based assessment model to identify students at risk for perceived academic problems following concussion. ''Journal of the International Neuropsychological Society, 22''(10), 1038-1049. [[doi:10.1017/S1355617716000916]]
*Salcedo, S., Chen, Y.-L., Youngstrom, E.A., Fristad, M.A., Gadow, K.D., Horwitz, S.M., Frazier, T.W., Arnold, L.E., Phillips, M.L., Birmaher, B., Kowatch, R.A., &amp; Findling, R.L. (2018). Diagnostic efficiency of the Child and Adolescent Symptom Inventory (CASI-4R) Depression Subscale for identifying youth mood disorders. ''Journal of Clinical Child and Adolescent Psychology, 47''(5), 832-846. [https://doi.org/10.1080/15374416.2017.1280807 doi:10.1080/15374416.2017.1280807]
*Tsai, A. P., Smith, R. K., Gonzalez, M., Youngstrom, E. A., Daughters, S. B., Youngstrom, J. K., &amp; Findling, R. L. (2022). Diagnostic accuracy of Achenbach scales in detecting youths' substance use disorders. Psychological Assessment, 34(6), 570–582. https://doi.org/10.1037/pas0001115  
*Tsai, A. P., Youngstrom, E. A., Gadow, K. D., Horwitz, S. M., Fristad, M. A., Daughters, S. B., Young, A. S., Arnold, L. E., Birmaher, B., Salcedo, S., The Lams, G., &amp; Findling, R. L. (2023). Diagnostic accuracy of the Child and Adolescent Symptom Inventory (CASI-4R) substance use subscale in detecting substance use disorders in youth. Psychological Assessment, 35(2), 178–187. https://doi.org/10.1037/pas0001182 
*You, D.S., Youngstrom, E.A., Feeny, N.C., Youngstrom, J.K., &amp; Findling, R.L. (2017). Comparing the diagnostic accuracy of five instruments for detecting posttraumatic stress disorder in youth. ''Journal of Clinical Child and Adolescent Psychology, 46''(4), 511-522. [https://doi.org/10.1080/15374416.2015.1030754 doi:10.1080/15374416.2015.1030754]
*Youngstrom, E. A., Perez Algorta, G., Youngstrom, J. K., Frazier, T. W., &amp; Findling, R. L. (2021). Evaluating and Validating GBI Mania and Depression Short Forms for Self-Report of Mood Symptoms. Journal of Clinical Child and Adolescent Psychology, 50(5), 579–595. https://doi.org/10.1080/15374416.2020.1756301 

=== 2016 ===
*Algorta, G. P., Dodd, A. L., Stringaris, A., &amp; Youngstrom, E. A. (2016). Diagnostic efficiency of the SDQ for parents to identify ADHD in the UK: a ROC analysis. ''European child &amp; adolescent psychiatry'', ''25''(9), 949–957. &lt;nowiki&gt;https://doi.org/10.1007/s00787-015-0815-0&lt;/nowiki&gt;
*Youngstrom, E. A., &amp; Van Meter, A. (2016). Empirically supported assessment of children and adolescents. ''Clinical Psychology: Science and Practice, 23''(4), 327–347. &lt;nowiki&gt;https://doi.org/10.1037/h0101738&lt;/nowiki&gt;
*Frazier TW, Klingemier EW, Beukemann M, Speer L, Markowitz L, Parikh S, Wexberg S, Giuliano K, Schulte E, Delahunty C, Ahuja V, Eng C, Manos MJ, Hardan AY, Youngstrom EA, &amp; Strauss MS (2016). Development of an objective autism risk index using remote eye tracking. ''Journal of the American Academy of Child and Adolescent Psychiatry, 55,'' 301-309.
*Jenkins, M.M., &amp; Youngstrom, E.A. (2016). A randomized controlled trial of cognitive debiasing improves assessment and treatment selection for pediatric bipolar disorder. ''Journal of Consulting and Clinical Psychology, 84,'' 323-333.
*Van Meter, A. R., You, D. S., *Halverson, T., Youngstrom, E. A., Birmaher, B., Fristad, M. A., Kowatch, R.A., Storfer-Isser, A., Horwitz, S.M., Frazier, T.W., Arnold, L.E., Findling, R.L., The LAMS Group. (2016). Diagnostic Efficiency of Caregiver Report on the SCARED for Identifying Youth Anxiety Disorders in Outpatient Settings. ''Journal of Clinical Child &amp; Adolescent Psychology,'' 1-15. doi:10.1080/15374416.2016.1188698

=== 2015 ===
*Youngstrom, E.A., Hameed, A., Mitchell, M., Van Meter, A.R., Freeman, A.J., Perez Algorta, G., White, A.M., Clayton, P., Gelenberg, A., &amp; Meyer, R.E. (2015). Direct comparison of the psychometric properties of multiple interview and patient-rated assessments of suicidal ideation and behavior in an adult psychiatric inpatient sample. ''Journal of Clinical Psychiatry, 76,'' 1676-82. doi:10.4088/JCP.14m09353
*Youngstrom, E.A., &amp; De Los Reyes, A. (2015). Moving towards cost-effectiveness in using psychophysiological measures in clinical assessment: Validity, decision-making, and adding value. ''Journal of Clinical Child and Adolescent Psychology, 44,'' 352-361. doi:10.1080/15374416.2014.913252
*Youngstrom, E.A., *Choukas-Bradley, S., *Calhoun, C.D., &amp; Jensen-Doss, A. (2015). Clinical guide to the evidence-based assessment approach to diagnosis and treatment. ''Cognitive and Behavioral Practice, 22,'' 20-35. doi: 10.1016/j.cbpra.2013.12.005 
*Lindhiem, O., Yu, L., Grasso, D.J., Kolko, D.J., &amp; Youngstrom, E.A. (2015). Adapting the Posterior Probability of Diagnosis (PPOD) index to enhance evidence-based screening: An application to ADHD in primary care. ''Assessment, 22,'' 198-207. doi: 10.1177/1073191114540748
*Prieto, M.L., Youngstrom, E.A., Ozerdem, A., Altinbas, K., Quiroz, D., Aydemir, O., Yalin, N., Geske, J.R., Feeder, S.E., Angst, J., &amp; Frye, M.A. (2015). Different patterns of manic/hypomanic symptoms in depression: A pilot modification of the Hypomania Checklist - 32 to assess mixed depression. ''Journal of Affective Disorders, 172,'' 355-360. doi: 10.1016/j.jad.2014.09.047

=== 2014 ===
*Youngstrom, E.A. (2014). A primer on Receiver Operating Characteristic analysis and diagnostic efficiency statistics for pediatric psychology: We are ready to ROC. ''Journal of Pediatric Psychology, 39,'' 204-221. Special Issue: Quantitative Methodology (Guest Editors: Bryan Karaszia &amp; Kristoffer Berlin); doi: 10.1093/jpepsy/jst062 
*Frazier, T., Youngstrom, E.A., Fristad, M., Demeter, C., Birmaher, B., Kowatch, R., . . . Findling, R. (2014). Improving clinical prediction of bipolar spectrum disorders in youth. ''Journal of Clinical Medicine, 3,'' 218-232. doi: 10.3390/jcm3010218
*Lee, H.J., Joo, Y., Youngstrom, E.A., Yum, S.Y., Findling, R.L., &amp; Kim, H.W. (2014). Diagnostic validity and reliability of a Korean version of the Parent and Adolescent General Behavior Inventories. ''Comprehensive Psychiatry, 55,'' 1730-1737. doi:10.1016/j.comppsych.2014.05.008
*Pendergast, L. L., Youngstrom, E. A., Merkitch, K. G., Moore, K. A., Black, C. L., Abramson, L. Y., &amp; Alloy, L. B. (2014). Differentiating bipolar disorder from unipolar depression and ADHD: the utility of the General Behavior Inventory. ''Psychological Assessment, 26,'' 195-206. doi: 10.1037/a0035138
*Van Meter, A. R., Youngstrom, E. A., Youngstrom, J. K., Ollendick, T., Demeter, C., &amp; Findling, R. L. (2014). Clinical decision-making about child and adolescent anxiety disorders using the Achenbach System of Empirically Based Assessment. ''Journal of Clinical Child &amp; Adolescent Psychology.''

=== 2013 ===
*Youngstrom, E.A. (2013). Future directions in psychological assessment: Combining evidence based medicine innovations with psychology’s historical strengths to enhance utility. ''Journal of Clinical Child and Adolescent Psychology, 42,'' 139-159. doi: 10.1080/15374416.2012.736358.
*Algorta, G.P., Youngstrom, E.A., Phelps, J., *Jenkins, M.M., Youngstrom, J.K., &amp; Findling, R.L. (2013). An inexpensive family index of risk for mood issues improves identification of pediatric bipolar disorder. ''Psychological Assessment, 25,'' 12-22. doi: 10.1037/a0029225

=== 2012 ===
*Freeman, A.J., Youngstrom, E.A., Demeter, C., Youngstrom, J.K., &amp; Findling, R.L. (2012). Portability of a screener for pediatric bipolar disorder to a diverse setting. ''Psychological Assessment, 24,'' 341-351. doi: 10.1037/a0025617 

*Jenkins, M.M., Youngstrom, E.A., Youngstrom, J.K., Feeny, N.C. &amp; Findling, R.L. (2012). Generalizability of evidence-based assessment recommendations for pediatric bipolar disorder. ''Psychological Assessment, 24,'' 269-281. doi: 10.1037/a0025775

=== 2011 ===
*Jenkins, M.M., Youngstrom, E.A., Washburn, J.J., &amp; Youngstrom, J.K. (2011). Evidence-based strategies improve assessment of pediatric bipolar disorder by community practitioners. ''Professional Psychology: Research and Practice, 42,'' 121-129. doi: 10.1037/a0022506

=== 2010 ===
*Horwitz, S.M., Demeter, C., Pagano, M.E., Youngstrom, E.A., Fristad, M.A., Arnold, L.E., Birmaher, B., Gill, M.K., Axelson, D., Kowatch, R.A. &amp; Findling, R.L. (2010). Identification of a childhood bipolar phenotype-the Longitudinal Assessment of Symptoms of Mania Study: Background, design and initial screening. ''Journal of Clinical Psychiatry, 71,'' 1511-1517. doi: 10.4088/JCP.09m05835yel2009
*Youngstrom, E.A., &amp; Kendall, P.C. (2009). Psychological science and bipolar disorder. ''Clinical Psychology: Science and Practice, 16,'' 93-97. doi: 10.1111/j.1468-2850.2009.01149.x 
*Youngstrom, E.A., *Freeman, A.J., &amp; *Jenkins, M.M. (2009). The assessment of bipolar disorder in children and adolescents. ''Child and Adolescent Psychiatric Clinics of North America, 18,'' 353-390. doi: 10.1016/j.chc.2008.12.002
*Meyer, S. E., Carlson, G. A., Youngstrom, E., Ronsaville, D. S., Martinez, P. E., Gold, P. W., Hakak, R., &amp; Radke-Yarrow, M. (2009). Long-term outcomes of youth who manifested the CBCL-Pediatric Bipolar Disorder phenotype during childhood and/or adolescence. ''Journal of Affective Disorders, 113,'' 227-235. doi: 10.1016/j.jad.2008.05.024

=== 2008 ===
*Youngstrom, E.A., *Frazier, T.W., Demeter, C., Calabrese, J.R., &amp; Findling, R.L. (2008). Developing a ten-item mania scale from the Parent General Behavior Inventory for children and adolescents. ''Journal of Clinical Psychiatry, 69,'' 831-839. doi:10.4088/JCP.v69n0517 
*Youngstrom, E.A., *Greene, J., &amp; *Joseph, M. (2008). Comparing the psychometric properties of multiple teacher report instruments as predictors of bipolar disorder in children and adolescents. ''Journal of Clinical Psychology, 64,'' 382-401. doi: 10.1002/jclp.20462

*Henry, D., Pavuluri, M., Youngstrom, E.A., &amp; Birmaher, B. (2008). Accuracy of brief and full forms of a mania rating scale. ''Journal of Clinical Psychology, 64,'' 368-381. doi: 10.1002/jclp.20464
*Meyers, O.I., &amp; Youngstrom, E.A. (2008). A Parent General Behavior Inventory subscale to measure sleep disturbance in pediatric bipolar disorder. ''Journal of Clinical Psychiatry, 69,'' 840-843. doi: 10.1016/j.jad.20009.07.020

=== 2007 ===
*Patel, N.C., Patrick, D.M., Youngstrom, E.A., Strakowski, S.M., &amp; DelBello, M.P. (2007). Response and remission in adolescent mania: Signal detection analyses of the Young Mania Rating Scale. ''Journal of the American Academy of Child and Adolescent Psychiatry, 46,'' 628-635. doi: 10.1097/chi.0b013e3180335ae4 
=== 2006 ===
*Youngstrom, E.A., *Meyers, O.I., Youngstrom, J.K., Calabrese, J.R., &amp; Findling, R.L. (2006). Comparing the effects of sampling designs on the diagnostic accuracy of eight promising screening algorithms for pediatric bipolar disorder. ''Biological Psychiatry, 60,'' 1013-1019. doi: 10.1016/j.biopsych.2006.06.023.

*Frazier, T.W., &amp; Youngstrom, E.A. (2006). Evidence based assessment of attention-deficit/hyperactivity disorder: Using multiple sources of information. ''Journal of the American Academy of Child and Adolescent Psychiatry, 45,'' 614-620. doi: 10.1097/01.chi.0000196597.09103.25

=== 2005 ===

*Youngstrom, E. A., *Meyers, O. I., Demeter, C., Kogos Youngstrom, J., Morello, L., Piiparinen, R., Feeny, N. C., Findling, R. L., &amp; Calabrese, J. R. (2005). Comparing diagnostic checklists for pediatric bipolar disorder in academic and community mental health settings. ''Bipolar Disorders, 7,'' 507-517. doi: j.1399-5618.2005.00269.x 

*Youngstrom, E. A., Findling, R. L., Youngstrom, J. K., &amp; Calabrese, J. R., (2005). Towards an evidence-based assessment of pediatric bipolar disorder. ''Journal of Clinical Child and Adolescent Psychology, 34,'' 433-448. Special Issue: Evidence-Based Assessment. doi: 10.1207/s15374424jccp3403_4
*Youngstrom, E. A., &amp; *Duax, J. (2005). Evidence Based Assessment of Pediatric Bipolar Disorder, Part 1: Base Rate and Family History. ''Journal of the American Academy of Child and Adolescent Psychiatry, 44,'' 712-717. doi: 10.1097/01.chi.0000162581.87710.bd

*Youngstrom, E. A., &amp; Kogos Youngstrom, J. (2005). Evidence Based Assessment of Pediatric Bipolar Disorder, Part 2: Incorporating Information from Behavior Checklists. ''Journal of the American Academy of Child and Adolescent Psychiatry, 44''(8), 823-828. doi: 10.1097/01.chi.0000164589.10200.a4

=== 2004 ===
*Youngstrom, E. A., Findling, R. L., Calabrese, J. R., Gracious, B. L., Demeter, C., DelPorto Bedoya, D., &amp; *Price, M.E. (2004). Comparing the diagnostic accuracy of six potential screening instruments for bipolar disorder in youths aged 5 to 17 years. ''Journal of the American Academy of Child &amp; Adolescent Psychiatry, 43,'' 847-858. doi: 10.1097/01.chi.0000125091.35109.1e

=== 2003 ===
*Danielson, C. K., Youngstrom, E. A., Findling, R. L., &amp; Calabrese, J. R. (2003). Discriminative validity of the General Behavior Inventory using youth report. ''Journal of Abnormal Child Psychology, 31,'' 29-39. doi: 10.1023/A:1021717231272

=== 2002 ===
*Findling, R. L., Youngstrom, E. A., DelPorto, D., Papish-David, R., Townsend, L., *Danielson, C. K., &amp; Calabrese, J. R. (2002). Clinical decision-making using the General Behavior Inventory. ''Bipolar Disorders, 4,'' 34-42. doi: 10.1034/j.1399-5618.2002.40102.

=== 2001 ===
*Youngstrom, E.A., Findling, R.L., *Danielson, C.K., &amp; Calabrese, J.R. (2001). Discriminative validity of parent report of hypomanic and depressive symptoms on the General Behavior Inventory. ''Psychological Assessment, 13,'' 267-276. doi: 10.1037//1040-3590.13.2.267

[[Category:Evidence-based assessment]]</text>
      <sha1>fpf9dvxupmmvxdg3igdwv2lkk1z9ibs</sha1>
    </revision>
    <revision>
      <id>2809758</id>
      <parentid>2809757</parentid>
      <timestamp>2026-05-16T21:57:10Z</timestamp>
      <contributor>
        <username>Eyoungstrom</username>
        <id>1933979</id>
      </contributor>
      <comment>/* In press */ added another GBI paper</comment>
      <origin>2809758</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="17702" sha1="fcq3lpzqo6p52qrh1ds8t08fho7ra9a" xml:space="preserve">&lt;noinclude&gt;{{Helping Give Away Psychological Science Banner}}&lt;/noinclude&gt;

This set of pages provides a practical introduction to Receiver Operating Characteristic (ROC) analyses, including sample code and examples generated with multiple popular statistical programs.

== Example ROC Party page ==
*Example [[Evidence based assessment/ROC Party|ROC Party]] page

== ROC sample code ==
*Example [https://docs.google.com/document/d/1Hgl06Oi5p1Yw0UsX7XTbEL4Cw6LnbX5mJ7l88ancdvw/edit ROC sample code] (includes R, SPSS, SAS)

== ROC Paper examples ==
The following papers are a selection that use ROC in their analyses, or illustrate application of DLRs to cases and decision-making, or both.

===In press===
*Cohen, J.R., Adams, Z.W., Menon, S.V., Youngstrom, E.A., Bunnell, B.E., Acierno, R., Ruggiero, K.J., &amp; Danielson, C.K. (2016). How should we screen for depression following a natural disaster? An ROC approach to post-disaster screening in adolescents and adults. ''Journal of Affective Disorders, 202'', 102-109. [https://doi.org/10.1016/j.jad.2016.05.034 doi:10.1016/j.jad.2016.05.034]
*Danielson, C.K., Cohen, J.R., Adams, Z.W., Youngstrom, E.A., Soltis, K., Amstadter, A.B., &amp; Ruggiero, K.J. (2017). Clinical decision making following disasters: Efficient identification of PTSD risk in adolescents. ''Journal of Abnormal Child Psychology, 45''(1), 117-129. [https://doi.org/10.1007/s10802-016-0159-3 doi:10.1007/s10802-016-0159-3]
*Jarrett, M.A., Van Meter, A.R., Youngstrom, E.A., Hilton, D.C., &amp; Ollendick, T.H. (2018). Evidence-based assessment of ADHD in youth using a receiver operating characteristic (ROC) approach. ''Journal of Clinical Child and Adolescent Psychology, 47''(5), 808-820. [https://doi.org/10.1080/15374416.2016.1225502 doi:10.1080/15374416.2016.1225502]
*Jo, B., Findling, R.L., Hastie, T.J., Youngstrom, E.A., Wang, C.P., Arnold, L.E., Fristad, M.A., Frazier, T.W., Birmaher, B., Gill, M.K., &amp; Horwitz, S.M.C. (2018). Construction of longitudinal prediction targets using semisupervised learning. ''Statistical Methods in Medical Research, 27''(9), 2674-2693. [https://doi.org/10.1177/0962280216684163 doi:10.1177/0962280216684163]
*Langfus, J. A., Chen, Y. L., Janos, J. A., Youngstrom, J. K., Findling, R. L., &amp; Youngstrom, E. A. (2025). Psychometric Properties and Clinical Utility of CBCL and P-GBI Sleep Items in Children and Adolescents. Journal of Clinical Child and Adolescent Psychology, 54(3), 328–345. https://doi.org/10.1080/15374416.2023.2272965 
*Mesman, E., Youngstrom, E.A., Juliana, N.K., Nolen, W.A., &amp; Hillegers, M.H.J. (2017). Validation of the Seven Up Seven Down Inventory in bipolar offspring: Screening and prediction of mood disorders. Findings from the Dutch Bipolar Offspring Study. ''Journal of Affective Disorders, 207'', 95-101. [[doi:10.1016/j.jad.2016.09.024]]
*Ong, M.L., Youngstrom, E.A., **Chua, J.J.X., *Halverson, T.F., Horwitz, S.M., Storfer-Isser, A., Frazier, T.W., Fristad, M.A., Arnold, L.E., Phillips, M.L., Birmaher, B., Gill, M.K., Findling, R.L., &amp; The LAMS Group. (2017). Comparing the CASI-4R and the PGBI-10 M for differentiating bipolar spectrum disorders from other outpatient diagnoses in youth. ''Journal of Abnormal Child Psychology, 45''(3), 611-623. [https://doi.org/10.1007/s10802-016-0182-4 doi:10.1007/s10802-016-0182-4]
*Pendergast, L. L., Youngstrom, E. A., Merkitch, K. G., Moore, K. A., Black, C. L., Abramson, L. Y., &amp; Alloy, L. B. (2014). Differentiating bipolar disorder from unipolar depression and ADHD: The utility of the General Behavior Inventory. Psychological Assessment, 26(1), 195–206. https://doi.org/10.1037/a0035138 
*Ransom, D.M., Burns, A.R., Youngstrom, E.A., Vaughan, C.G., Sady, M.D., &amp; Gioia, G.A. (2016). Applying an evidence-based assessment model to identify students at risk for perceived academic problems following concussion. ''Journal of the International Neuropsychological Society, 22''(10), 1038-1049. [[doi:10.1017/S1355617716000916]]
*Salcedo, S., Chen, Y.-L., Youngstrom, E.A., Fristad, M.A., Gadow, K.D., Horwitz, S.M., Frazier, T.W., Arnold, L.E., Phillips, M.L., Birmaher, B., Kowatch, R.A., &amp; Findling, R.L. (2018). Diagnostic efficiency of the Child and Adolescent Symptom Inventory (CASI-4R) Depression Subscale for identifying youth mood disorders. ''Journal of Clinical Child and Adolescent Psychology, 47''(5), 832-846. [https://doi.org/10.1080/15374416.2017.1280807 doi:10.1080/15374416.2017.1280807]
*Tsai, A. P., Smith, R. K., Gonzalez, M., Youngstrom, E. A., Daughters, S. B., Youngstrom, J. K., &amp; Findling, R. L. (2022). Diagnostic accuracy of Achenbach scales in detecting youths' substance use disorders. Psychological Assessment, 34(6), 570–582. https://doi.org/10.1037/pas0001115  
*Tsai, A. P., Youngstrom, E. A., Gadow, K. D., Horwitz, S. M., Fristad, M. A., Daughters, S. B., Young, A. S., Arnold, L. E., Birmaher, B., Salcedo, S., The Lams, G., &amp; Findling, R. L. (2023). Diagnostic accuracy of the Child and Adolescent Symptom Inventory (CASI-4R) substance use subscale in detecting substance use disorders in youth. Psychological Assessment, 35(2), 178–187. https://doi.org/10.1037/pas0001182 
*You, D.S., Youngstrom, E.A., Feeny, N.C., Youngstrom, J.K., &amp; Findling, R.L. (2017). Comparing the diagnostic accuracy of five instruments for detecting posttraumatic stress disorder in youth. ''Journal of Clinical Child and Adolescent Psychology, 46''(4), 511-522. [https://doi.org/10.1080/15374416.2015.1030754 doi:10.1080/15374416.2015.1030754]
*Youngstrom, E. A., Van Meter, A., Frazier, T. W., Youngstrom, J. K., &amp; Findling, R. L. (2020). Developing and Validating Short Forms of the Parent General Behavior Inventory Mania and Depression Scales for Rating Youth Mood Symptoms. Journal of Clinical Child and Adolescent Psychology, 49(2), 162–177. https://doi.org/10.1080/15374416.2018.1491006 
*Youngstrom, E. A., Perez Algorta, G., Youngstrom, J. K., Frazier, T. W., &amp; Findling, R. L. (2021). Evaluating and Validating GBI Mania and Depression Short Forms for Self-Report of Mood Symptoms. Journal of Clinical Child and Adolescent Psychology, 50(5), 579–595. https://doi.org/10.1080/15374416.2020.1756301 

=== 2016 ===
*Algorta, G. P., Dodd, A. L., Stringaris, A., &amp; Youngstrom, E. A. (2016). Diagnostic efficiency of the SDQ for parents to identify ADHD in the UK: a ROC analysis. ''European child &amp; adolescent psychiatry'', ''25''(9), 949–957. &lt;nowiki&gt;https://doi.org/10.1007/s00787-015-0815-0&lt;/nowiki&gt;
*Youngstrom, E. A., &amp; Van Meter, A. (2016). Empirically supported assessment of children and adolescents. ''Clinical Psychology: Science and Practice, 23''(4), 327–347. &lt;nowiki&gt;https://doi.org/10.1037/h0101738&lt;/nowiki&gt;
*Frazier TW, Klingemier EW, Beukemann M, Speer L, Markowitz L, Parikh S, Wexberg S, Giuliano K, Schulte E, Delahunty C, Ahuja V, Eng C, Manos MJ, Hardan AY, Youngstrom EA, &amp; Strauss MS (2016). Development of an objective autism risk index using remote eye tracking. ''Journal of the American Academy of Child and Adolescent Psychiatry, 55,'' 301-309.
*Jenkins, M.M., &amp; Youngstrom, E.A. (2016). A randomized controlled trial of cognitive debiasing improves assessment and treatment selection for pediatric bipolar disorder. ''Journal of Consulting and Clinical Psychology, 84,'' 323-333.
*Van Meter, A. R., You, D. S., *Halverson, T., Youngstrom, E. A., Birmaher, B., Fristad, M. A., Kowatch, R.A., Storfer-Isser, A., Horwitz, S.M., Frazier, T.W., Arnold, L.E., Findling, R.L., The LAMS Group. (2016). Diagnostic Efficiency of Caregiver Report on the SCARED for Identifying Youth Anxiety Disorders in Outpatient Settings. ''Journal of Clinical Child &amp; Adolescent Psychology,'' 1-15. doi:10.1080/15374416.2016.1188698

=== 2015 ===
*Youngstrom, E.A., Hameed, A., Mitchell, M., Van Meter, A.R., Freeman, A.J., Perez Algorta, G., White, A.M., Clayton, P., Gelenberg, A., &amp; Meyer, R.E. (2015). Direct comparison of the psychometric properties of multiple interview and patient-rated assessments of suicidal ideation and behavior in an adult psychiatric inpatient sample. ''Journal of Clinical Psychiatry, 76,'' 1676-82. doi:10.4088/JCP.14m09353
*Youngstrom, E.A., &amp; De Los Reyes, A. (2015). Moving towards cost-effectiveness in using psychophysiological measures in clinical assessment: Validity, decision-making, and adding value. ''Journal of Clinical Child and Adolescent Psychology, 44,'' 352-361. doi:10.1080/15374416.2014.913252
*Youngstrom, E.A., *Choukas-Bradley, S., *Calhoun, C.D., &amp; Jensen-Doss, A. (2015). Clinical guide to the evidence-based assessment approach to diagnosis and treatment. ''Cognitive and Behavioral Practice, 22,'' 20-35. doi: 10.1016/j.cbpra.2013.12.005 
*Lindhiem, O., Yu, L., Grasso, D.J., Kolko, D.J., &amp; Youngstrom, E.A. (2015). Adapting the Posterior Probability of Diagnosis (PPOD) index to enhance evidence-based screening: An application to ADHD in primary care. ''Assessment, 22,'' 198-207. doi: 10.1177/1073191114540748
*Prieto, M.L., Youngstrom, E.A., Ozerdem, A., Altinbas, K., Quiroz, D., Aydemir, O., Yalin, N., Geske, J.R., Feeder, S.E., Angst, J., &amp; Frye, M.A. (2015). Different patterns of manic/hypomanic symptoms in depression: A pilot modification of the Hypomania Checklist - 32 to assess mixed depression. ''Journal of Affective Disorders, 172,'' 355-360. doi: 10.1016/j.jad.2014.09.047

=== 2014 ===
*Youngstrom, E.A. (2014). A primer on Receiver Operating Characteristic analysis and diagnostic efficiency statistics for pediatric psychology: We are ready to ROC. ''Journal of Pediatric Psychology, 39,'' 204-221. Special Issue: Quantitative Methodology (Guest Editors: Bryan Karaszia &amp; Kristoffer Berlin); doi: 10.1093/jpepsy/jst062 
*Frazier, T., Youngstrom, E.A., Fristad, M., Demeter, C., Birmaher, B., Kowatch, R., . . . Findling, R. (2014). Improving clinical prediction of bipolar spectrum disorders in youth. ''Journal of Clinical Medicine, 3,'' 218-232. doi: 10.3390/jcm3010218
*Lee, H.J., Joo, Y., Youngstrom, E.A., Yum, S.Y., Findling, R.L., &amp; Kim, H.W. (2014). Diagnostic validity and reliability of a Korean version of the Parent and Adolescent General Behavior Inventories. ''Comprehensive Psychiatry, 55,'' 1730-1737. doi:10.1016/j.comppsych.2014.05.008
*Pendergast, L. L., Youngstrom, E. A., Merkitch, K. G., Moore, K. A., Black, C. L., Abramson, L. Y., &amp; Alloy, L. B. (2014). Differentiating bipolar disorder from unipolar depression and ADHD: the utility of the General Behavior Inventory. ''Psychological Assessment, 26,'' 195-206. doi: 10.1037/a0035138
*Van Meter, A. R., Youngstrom, E. A., Youngstrom, J. K., Ollendick, T., Demeter, C., &amp; Findling, R. L. (2014). Clinical decision-making about child and adolescent anxiety disorders using the Achenbach System of Empirically Based Assessment. ''Journal of Clinical Child &amp; Adolescent Psychology.''

=== 2013 ===
*Youngstrom, E.A. (2013). Future directions in psychological assessment: Combining evidence based medicine innovations with psychology’s historical strengths to enhance utility. ''Journal of Clinical Child and Adolescent Psychology, 42,'' 139-159. doi: 10.1080/15374416.2012.736358.
*Algorta, G.P., Youngstrom, E.A., Phelps, J., *Jenkins, M.M., Youngstrom, J.K., &amp; Findling, R.L. (2013). An inexpensive family index of risk for mood issues improves identification of pediatric bipolar disorder. ''Psychological Assessment, 25,'' 12-22. doi: 10.1037/a0029225

=== 2012 ===
*Freeman, A.J., Youngstrom, E.A., Demeter, C., Youngstrom, J.K., &amp; Findling, R.L. (2012). Portability of a screener for pediatric bipolar disorder to a diverse setting. ''Psychological Assessment, 24,'' 341-351. doi: 10.1037/a0025617 

*Jenkins, M.M., Youngstrom, E.A., Youngstrom, J.K., Feeny, N.C. &amp; Findling, R.L. (2012). Generalizability of evidence-based assessment recommendations for pediatric bipolar disorder. ''Psychological Assessment, 24,'' 269-281. doi: 10.1037/a0025775

=== 2011 ===
*Jenkins, M.M., Youngstrom, E.A., Washburn, J.J., &amp; Youngstrom, J.K. (2011). Evidence-based strategies improve assessment of pediatric bipolar disorder by community practitioners. ''Professional Psychology: Research and Practice, 42,'' 121-129. doi: 10.1037/a0022506

=== 2010 ===
*Horwitz, S.M., Demeter, C., Pagano, M.E., Youngstrom, E.A., Fristad, M.A., Arnold, L.E., Birmaher, B., Gill, M.K., Axelson, D., Kowatch, R.A. &amp; Findling, R.L. (2010). Identification of a childhood bipolar phenotype-the Longitudinal Assessment of Symptoms of Mania Study: Background, design and initial screening. ''Journal of Clinical Psychiatry, 71,'' 1511-1517. doi: 10.4088/JCP.09m05835yel2009
*Youngstrom, E.A., &amp; Kendall, P.C. (2009). Psychological science and bipolar disorder. ''Clinical Psychology: Science and Practice, 16,'' 93-97. doi: 10.1111/j.1468-2850.2009.01149.x 
*Youngstrom, E.A., *Freeman, A.J., &amp; *Jenkins, M.M. (2009). The assessment of bipolar disorder in children and adolescents. ''Child and Adolescent Psychiatric Clinics of North America, 18,'' 353-390. doi: 10.1016/j.chc.2008.12.002
*Meyer, S. E., Carlson, G. A., Youngstrom, E., Ronsaville, D. S., Martinez, P. E., Gold, P. W., Hakak, R., &amp; Radke-Yarrow, M. (2009). Long-term outcomes of youth who manifested the CBCL-Pediatric Bipolar Disorder phenotype during childhood and/or adolescence. ''Journal of Affective Disorders, 113,'' 227-235. doi: 10.1016/j.jad.2008.05.024

=== 2008 ===
*Youngstrom, E.A., *Frazier, T.W., Demeter, C., Calabrese, J.R., &amp; Findling, R.L. (2008). Developing a ten-item mania scale from the Parent General Behavior Inventory for children and adolescents. ''Journal of Clinical Psychiatry, 69,'' 831-839. doi:10.4088/JCP.v69n0517 
*Youngstrom, E.A., *Greene, J., &amp; *Joseph, M. (2008). Comparing the psychometric properties of multiple teacher report instruments as predictors of bipolar disorder in children and adolescents. ''Journal of Clinical Psychology, 64,'' 382-401. doi: 10.1002/jclp.20462

*Henry, D., Pavuluri, M., Youngstrom, E.A., &amp; Birmaher, B. (2008). Accuracy of brief and full forms of a mania rating scale. ''Journal of Clinical Psychology, 64,'' 368-381. doi: 10.1002/jclp.20464
*Meyers, O.I., &amp; Youngstrom, E.A. (2008). A Parent General Behavior Inventory subscale to measure sleep disturbance in pediatric bipolar disorder. ''Journal of Clinical Psychiatry, 69,'' 840-843. doi: 10.1016/j.jad.20009.07.020

=== 2007 ===
*Patel, N.C., Patrick, D.M., Youngstrom, E.A., Strakowski, S.M., &amp; DelBello, M.P. (2007). Response and remission in adolescent mania: Signal detection analyses of the Young Mania Rating Scale. ''Journal of the American Academy of Child and Adolescent Psychiatry, 46,'' 628-635. doi: 10.1097/chi.0b013e3180335ae4 
=== 2006 ===
*Youngstrom, E.A., *Meyers, O.I., Youngstrom, J.K., Calabrese, J.R., &amp; Findling, R.L. (2006). Comparing the effects of sampling designs on the diagnostic accuracy of eight promising screening algorithms for pediatric bipolar disorder. ''Biological Psychiatry, 60,'' 1013-1019. doi: 10.1016/j.biopsych.2006.06.023.

*Frazier, T.W., &amp; Youngstrom, E.A. (2006). Evidence based assessment of attention-deficit/hyperactivity disorder: Using multiple sources of information. ''Journal of the American Academy of Child and Adolescent Psychiatry, 45,'' 614-620. doi: 10.1097/01.chi.0000196597.09103.25

=== 2005 ===

*Youngstrom, E. A., *Meyers, O. I., Demeter, C., Kogos Youngstrom, J., Morello, L., Piiparinen, R., Feeny, N. C., Findling, R. L., &amp; Calabrese, J. R. (2005). Comparing diagnostic checklists for pediatric bipolar disorder in academic and community mental health settings. ''Bipolar Disorders, 7,'' 507-517. doi: j.1399-5618.2005.00269.x 

*Youngstrom, E. A., Findling, R. L., Youngstrom, J. K., &amp; Calabrese, J. R., (2005). Towards an evidence-based assessment of pediatric bipolar disorder. ''Journal of Clinical Child and Adolescent Psychology, 34,'' 433-448. Special Issue: Evidence-Based Assessment. doi: 10.1207/s15374424jccp3403_4
*Youngstrom, E. A., &amp; *Duax, J. (2005). Evidence Based Assessment of Pediatric Bipolar Disorder, Part 1: Base Rate and Family History. ''Journal of the American Academy of Child and Adolescent Psychiatry, 44,'' 712-717. doi: 10.1097/01.chi.0000162581.87710.bd

*Youngstrom, E. A., &amp; Kogos Youngstrom, J. (2005). Evidence Based Assessment of Pediatric Bipolar Disorder, Part 2: Incorporating Information from Behavior Checklists. ''Journal of the American Academy of Child and Adolescent Psychiatry, 44''(8), 823-828. doi: 10.1097/01.chi.0000164589.10200.a4

=== 2004 ===
*Youngstrom, E. A., Findling, R. L., Calabrese, J. R., Gracious, B. L., Demeter, C., DelPorto Bedoya, D., &amp; *Price, M.E. (2004). Comparing the diagnostic accuracy of six potential screening instruments for bipolar disorder in youths aged 5 to 17 years. ''Journal of the American Academy of Child &amp; Adolescent Psychiatry, 43,'' 847-858. doi: 10.1097/01.chi.0000125091.35109.1e

=== 2003 ===
*Danielson, C. K., Youngstrom, E. A., Findling, R. L., &amp; Calabrese, J. R. (2003). Discriminative validity of the General Behavior Inventory using youth report. ''Journal of Abnormal Child Psychology, 31,'' 29-39. doi: 10.1023/A:1021717231272

=== 2002 ===
*Findling, R. L., Youngstrom, E. A., DelPorto, D., Papish-David, R., Townsend, L., *Danielson, C. K., &amp; Calabrese, J. R. (2002). Clinical decision-making using the General Behavior Inventory. ''Bipolar Disorders, 4,'' 34-42. doi: 10.1034/j.1399-5618.2002.40102.

=== 2001 ===
*Youngstrom, E.A., Findling, R.L., *Danielson, C.K., &amp; Calabrese, J.R. (2001). Discriminative validity of parent report of hypomanic and depressive symptoms on the General Behavior Inventory. ''Psychological Assessment, 13,'' 267-276. doi: 10.1037//1040-3590.13.2.267

[[Category:Evidence-based assessment]]</text>
      <sha1>fcq3lpzqo6p52qrh1ds8t08fho7ra9a</sha1>
    </revision>
    <revision>
      <id>2809759</id>
      <parentid>2809758</parentid>
      <timestamp>2026-05-16T21:58:57Z</timestamp>
      <contributor>
        <username>Eyoungstrom</username>
        <id>1933979</id>
      </contributor>
      <comment>/* ROC Paper examples */ elaboration</comment>
      <origin>2809759</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="17838" sha1="nwsomkwiqlftp6tsb1e0b0pokll38oe" xml:space="preserve">&lt;noinclude&gt;{{Helping Give Away Psychological Science Banner}}&lt;/noinclude&gt;

This set of pages provides a practical introduction to Receiver Operating Characteristic (ROC) analyses, including sample code and examples generated with multiple popular statistical programs.

== Example ROC Party page ==
*Example [[Evidence based assessment/ROC Party|ROC Party]] page

== ROC sample code ==
*Example [https://docs.google.com/document/d/1Hgl06Oi5p1Yw0UsX7XTbEL4Cw6LnbX5mJ7l88ancdvw/edit ROC sample code] (includes R, SPSS, SAS)

== ROC Paper examples ==
The following papers are a selection that use ROC in their analyses, or illustrate application of DLRs to cases and decision-making, or both. This set either contributed to the teaching materials, or used code or data informed by the ROC teaching materials shared by the team. 

===In press===
*Cohen, J.R., Adams, Z.W., Menon, S.V., Youngstrom, E.A., Bunnell, B.E., Acierno, R., Ruggiero, K.J., &amp; Danielson, C.K. (2016). How should we screen for depression following a natural disaster? An ROC approach to post-disaster screening in adolescents and adults. ''Journal of Affective Disorders, 202'', 102-109. [https://doi.org/10.1016/j.jad.2016.05.034 doi:10.1016/j.jad.2016.05.034]
*Danielson, C.K., Cohen, J.R., Adams, Z.W., Youngstrom, E.A., Soltis, K., Amstadter, A.B., &amp; Ruggiero, K.J. (2017). Clinical decision making following disasters: Efficient identification of PTSD risk in adolescents. ''Journal of Abnormal Child Psychology, 45''(1), 117-129. [https://doi.org/10.1007/s10802-016-0159-3 doi:10.1007/s10802-016-0159-3]
*Jarrett, M.A., Van Meter, A.R., Youngstrom, E.A., Hilton, D.C., &amp; Ollendick, T.H. (2018). Evidence-based assessment of ADHD in youth using a receiver operating characteristic (ROC) approach. ''Journal of Clinical Child and Adolescent Psychology, 47''(5), 808-820. [https://doi.org/10.1080/15374416.2016.1225502 doi:10.1080/15374416.2016.1225502]
*Jo, B., Findling, R.L., Hastie, T.J., Youngstrom, E.A., Wang, C.P., Arnold, L.E., Fristad, M.A., Frazier, T.W., Birmaher, B., Gill, M.K., &amp; Horwitz, S.M.C. (2018). Construction of longitudinal prediction targets using semisupervised learning. ''Statistical Methods in Medical Research, 27''(9), 2674-2693. [https://doi.org/10.1177/0962280216684163 doi:10.1177/0962280216684163]
*Langfus, J. A., Chen, Y. L., Janos, J. A., Youngstrom, J. K., Findling, R. L., &amp; Youngstrom, E. A. (2025). Psychometric Properties and Clinical Utility of CBCL and P-GBI Sleep Items in Children and Adolescents. Journal of Clinical Child and Adolescent Psychology, 54(3), 328–345. https://doi.org/10.1080/15374416.2023.2272965 
*Mesman, E., Youngstrom, E.A., Juliana, N.K., Nolen, W.A., &amp; Hillegers, M.H.J. (2017). Validation of the Seven Up Seven Down Inventory in bipolar offspring: Screening and prediction of mood disorders. Findings from the Dutch Bipolar Offspring Study. ''Journal of Affective Disorders, 207'', 95-101. [[doi:10.1016/j.jad.2016.09.024]]
*Ong, M.L., Youngstrom, E.A., **Chua, J.J.X., *Halverson, T.F., Horwitz, S.M., Storfer-Isser, A., Frazier, T.W., Fristad, M.A., Arnold, L.E., Phillips, M.L., Birmaher, B., Gill, M.K., Findling, R.L., &amp; The LAMS Group. (2017). Comparing the CASI-4R and the PGBI-10 M for differentiating bipolar spectrum disorders from other outpatient diagnoses in youth. ''Journal of Abnormal Child Psychology, 45''(3), 611-623. [https://doi.org/10.1007/s10802-016-0182-4 doi:10.1007/s10802-016-0182-4]
*Pendergast, L. L., Youngstrom, E. A., Merkitch, K. G., Moore, K. A., Black, C. L., Abramson, L. Y., &amp; Alloy, L. B. (2014). Differentiating bipolar disorder from unipolar depression and ADHD: The utility of the General Behavior Inventory. Psychological Assessment, 26(1), 195–206. https://doi.org/10.1037/a0035138 
*Ransom, D.M., Burns, A.R., Youngstrom, E.A., Vaughan, C.G., Sady, M.D., &amp; Gioia, G.A. (2016). Applying an evidence-based assessment model to identify students at risk for perceived academic problems following concussion. ''Journal of the International Neuropsychological Society, 22''(10), 1038-1049. [[doi:10.1017/S1355617716000916]]
*Salcedo, S., Chen, Y.-L., Youngstrom, E.A., Fristad, M.A., Gadow, K.D., Horwitz, S.M., Frazier, T.W., Arnold, L.E., Phillips, M.L., Birmaher, B., Kowatch, R.A., &amp; Findling, R.L. (2018). Diagnostic efficiency of the Child and Adolescent Symptom Inventory (CASI-4R) Depression Subscale for identifying youth mood disorders. ''Journal of Clinical Child and Adolescent Psychology, 47''(5), 832-846. [https://doi.org/10.1080/15374416.2017.1280807 doi:10.1080/15374416.2017.1280807]
*Tsai, A. P., Smith, R. K., Gonzalez, M., Youngstrom, E. A., Daughters, S. B., Youngstrom, J. K., &amp; Findling, R. L. (2022). Diagnostic accuracy of Achenbach scales in detecting youths' substance use disorders. Psychological Assessment, 34(6), 570–582. https://doi.org/10.1037/pas0001115  
*Tsai, A. P., Youngstrom, E. A., Gadow, K. D., Horwitz, S. M., Fristad, M. A., Daughters, S. B., Young, A. S., Arnold, L. E., Birmaher, B., Salcedo, S., The Lams, G., &amp; Findling, R. L. (2023). Diagnostic accuracy of the Child and Adolescent Symptom Inventory (CASI-4R) substance use subscale in detecting substance use disorders in youth. Psychological Assessment, 35(2), 178–187. https://doi.org/10.1037/pas0001182 
*You, D.S., Youngstrom, E.A., Feeny, N.C., Youngstrom, J.K., &amp; Findling, R.L. (2017). Comparing the diagnostic accuracy of five instruments for detecting posttraumatic stress disorder in youth. ''Journal of Clinical Child and Adolescent Psychology, 46''(4), 511-522. [https://doi.org/10.1080/15374416.2015.1030754 doi:10.1080/15374416.2015.1030754]
*Youngstrom, E. A., Van Meter, A., Frazier, T. W., Youngstrom, J. K., &amp; Findling, R. L. (2020). Developing and Validating Short Forms of the Parent General Behavior Inventory Mania and Depression Scales for Rating Youth Mood Symptoms. Journal of Clinical Child and Adolescent Psychology, 49(2), 162–177. https://doi.org/10.1080/15374416.2018.1491006 
*Youngstrom, E. A., Perez Algorta, G., Youngstrom, J. K., Frazier, T. W., &amp; Findling, R. L. (2021). Evaluating and Validating GBI Mania and Depression Short Forms for Self-Report of Mood Symptoms. Journal of Clinical Child and Adolescent Psychology, 50(5), 579–595. https://doi.org/10.1080/15374416.2020.1756301 

=== 2016 ===
*Algorta, G. P., Dodd, A. L., Stringaris, A., &amp; Youngstrom, E. A. (2016). Diagnostic efficiency of the SDQ for parents to identify ADHD in the UK: a ROC analysis. ''European child &amp; adolescent psychiatry'', ''25''(9), 949–957. &lt;nowiki&gt;https://doi.org/10.1007/s00787-015-0815-0&lt;/nowiki&gt;
*Youngstrom, E. A., &amp; Van Meter, A. (2016). Empirically supported assessment of children and adolescents. ''Clinical Psychology: Science and Practice, 23''(4), 327–347. &lt;nowiki&gt;https://doi.org/10.1037/h0101738&lt;/nowiki&gt;
*Frazier TW, Klingemier EW, Beukemann M, Speer L, Markowitz L, Parikh S, Wexberg S, Giuliano K, Schulte E, Delahunty C, Ahuja V, Eng C, Manos MJ, Hardan AY, Youngstrom EA, &amp; Strauss MS (2016). Development of an objective autism risk index using remote eye tracking. ''Journal of the American Academy of Child and Adolescent Psychiatry, 55,'' 301-309.
*Jenkins, M.M., &amp; Youngstrom, E.A. (2016). A randomized controlled trial of cognitive debiasing improves assessment and treatment selection for pediatric bipolar disorder. ''Journal of Consulting and Clinical Psychology, 84,'' 323-333.
*Van Meter, A. R., You, D. S., *Halverson, T., Youngstrom, E. A., Birmaher, B., Fristad, M. A., Kowatch, R.A., Storfer-Isser, A., Horwitz, S.M., Frazier, T.W., Arnold, L.E., Findling, R.L., The LAMS Group. (2016). Diagnostic Efficiency of Caregiver Report on the SCARED for Identifying Youth Anxiety Disorders in Outpatient Settings. ''Journal of Clinical Child &amp; Adolescent Psychology,'' 1-15. doi:10.1080/15374416.2016.1188698

=== 2015 ===
*Youngstrom, E.A., Hameed, A., Mitchell, M., Van Meter, A.R., Freeman, A.J., Perez Algorta, G., White, A.M., Clayton, P., Gelenberg, A., &amp; Meyer, R.E. (2015). Direct comparison of the psychometric properties of multiple interview and patient-rated assessments of suicidal ideation and behavior in an adult psychiatric inpatient sample. ''Journal of Clinical Psychiatry, 76,'' 1676-82. doi:10.4088/JCP.14m09353
*Youngstrom, E.A., &amp; De Los Reyes, A. (2015). Moving towards cost-effectiveness in using psychophysiological measures in clinical assessment: Validity, decision-making, and adding value. ''Journal of Clinical Child and Adolescent Psychology, 44,'' 352-361. doi:10.1080/15374416.2014.913252
*Youngstrom, E.A., *Choukas-Bradley, S., *Calhoun, C.D., &amp; Jensen-Doss, A. (2015). Clinical guide to the evidence-based assessment approach to diagnosis and treatment. ''Cognitive and Behavioral Practice, 22,'' 20-35. doi: 10.1016/j.cbpra.2013.12.005 
*Lindhiem, O., Yu, L., Grasso, D.J., Kolko, D.J., &amp; Youngstrom, E.A. (2015). Adapting the Posterior Probability of Diagnosis (PPOD) index to enhance evidence-based screening: An application to ADHD in primary care. ''Assessment, 22,'' 198-207. doi: 10.1177/1073191114540748
*Prieto, M.L., Youngstrom, E.A., Ozerdem, A., Altinbas, K., Quiroz, D., Aydemir, O., Yalin, N., Geske, J.R., Feeder, S.E., Angst, J., &amp; Frye, M.A. (2015). Different patterns of manic/hypomanic symptoms in depression: A pilot modification of the Hypomania Checklist - 32 to assess mixed depression. ''Journal of Affective Disorders, 172,'' 355-360. doi: 10.1016/j.jad.2014.09.047

=== 2014 ===
*Youngstrom, E.A. (2014). A primer on Receiver Operating Characteristic analysis and diagnostic efficiency statistics for pediatric psychology: We are ready to ROC. ''Journal of Pediatric Psychology, 39,'' 204-221. Special Issue: Quantitative Methodology (Guest Editors: Bryan Karaszia &amp; Kristoffer Berlin); doi: 10.1093/jpepsy/jst062 
*Frazier, T., Youngstrom, E.A., Fristad, M., Demeter, C., Birmaher, B., Kowatch, R., . . . Findling, R. (2014). Improving clinical prediction of bipolar spectrum disorders in youth. ''Journal of Clinical Medicine, 3,'' 218-232. doi: 10.3390/jcm3010218
*Lee, H.J., Joo, Y., Youngstrom, E.A., Yum, S.Y., Findling, R.L., &amp; Kim, H.W. (2014). Diagnostic validity and reliability of a Korean version of the Parent and Adolescent General Behavior Inventories. ''Comprehensive Psychiatry, 55,'' 1730-1737. doi:10.1016/j.comppsych.2014.05.008
*Pendergast, L. L., Youngstrom, E. A., Merkitch, K. G., Moore, K. A., Black, C. L., Abramson, L. Y., &amp; Alloy, L. B. (2014). Differentiating bipolar disorder from unipolar depression and ADHD: the utility of the General Behavior Inventory. ''Psychological Assessment, 26,'' 195-206. doi: 10.1037/a0035138
*Van Meter, A. R., Youngstrom, E. A., Youngstrom, J. K., Ollendick, T., Demeter, C., &amp; Findling, R. L. (2014). Clinical decision-making about child and adolescent anxiety disorders using the Achenbach System of Empirically Based Assessment. ''Journal of Clinical Child &amp; Adolescent Psychology.''

=== 2013 ===
*Youngstrom, E.A. (2013). Future directions in psychological assessment: Combining evidence based medicine innovations with psychology’s historical strengths to enhance utility. ''Journal of Clinical Child and Adolescent Psychology, 42,'' 139-159. doi: 10.1080/15374416.2012.736358.
*Algorta, G.P., Youngstrom, E.A., Phelps, J., *Jenkins, M.M., Youngstrom, J.K., &amp; Findling, R.L. (2013). An inexpensive family index of risk for mood issues improves identification of pediatric bipolar disorder. ''Psychological Assessment, 25,'' 12-22. doi: 10.1037/a0029225

=== 2012 ===
*Freeman, A.J., Youngstrom, E.A., Demeter, C., Youngstrom, J.K., &amp; Findling, R.L. (2012). Portability of a screener for pediatric bipolar disorder to a diverse setting. ''Psychological Assessment, 24,'' 341-351. doi: 10.1037/a0025617 

*Jenkins, M.M., Youngstrom, E.A., Youngstrom, J.K., Feeny, N.C. &amp; Findling, R.L. (2012). Generalizability of evidence-based assessment recommendations for pediatric bipolar disorder. ''Psychological Assessment, 24,'' 269-281. doi: 10.1037/a0025775

=== 2011 ===
*Jenkins, M.M., Youngstrom, E.A., Washburn, J.J., &amp; Youngstrom, J.K. (2011). Evidence-based strategies improve assessment of pediatric bipolar disorder by community practitioners. ''Professional Psychology: Research and Practice, 42,'' 121-129. doi: 10.1037/a0022506

=== 2010 ===
*Horwitz, S.M., Demeter, C., Pagano, M.E., Youngstrom, E.A., Fristad, M.A., Arnold, L.E., Birmaher, B., Gill, M.K., Axelson, D., Kowatch, R.A. &amp; Findling, R.L. (2010). Identification of a childhood bipolar phenotype-the Longitudinal Assessment of Symptoms of Mania Study: Background, design and initial screening. ''Journal of Clinical Psychiatry, 71,'' 1511-1517. doi: 10.4088/JCP.09m05835yel2009
*Youngstrom, E.A., &amp; Kendall, P.C. (2009). Psychological science and bipolar disorder. ''Clinical Psychology: Science and Practice, 16,'' 93-97. doi: 10.1111/j.1468-2850.2009.01149.x 
*Youngstrom, E.A., *Freeman, A.J., &amp; *Jenkins, M.M. (2009). The assessment of bipolar disorder in children and adolescents. ''Child and Adolescent Psychiatric Clinics of North America, 18,'' 353-390. doi: 10.1016/j.chc.2008.12.002
*Meyer, S. E., Carlson, G. A., Youngstrom, E., Ronsaville, D. S., Martinez, P. E., Gold, P. W., Hakak, R., &amp; Radke-Yarrow, M. (2009). Long-term outcomes of youth who manifested the CBCL-Pediatric Bipolar Disorder phenotype during childhood and/or adolescence. ''Journal of Affective Disorders, 113,'' 227-235. doi: 10.1016/j.jad.2008.05.024

=== 2008 ===
*Youngstrom, E.A., *Frazier, T.W., Demeter, C., Calabrese, J.R., &amp; Findling, R.L. (2008). Developing a ten-item mania scale from the Parent General Behavior Inventory for children and adolescents. ''Journal of Clinical Psychiatry, 69,'' 831-839. doi:10.4088/JCP.v69n0517 
*Youngstrom, E.A., *Greene, J., &amp; *Joseph, M. (2008). Comparing the psychometric properties of multiple teacher report instruments as predictors of bipolar disorder in children and adolescents. ''Journal of Clinical Psychology, 64,'' 382-401. doi: 10.1002/jclp.20462

*Henry, D., Pavuluri, M., Youngstrom, E.A., &amp; Birmaher, B. (2008). Accuracy of brief and full forms of a mania rating scale. ''Journal of Clinical Psychology, 64,'' 368-381. doi: 10.1002/jclp.20464
*Meyers, O.I., &amp; Youngstrom, E.A. (2008). A Parent General Behavior Inventory subscale to measure sleep disturbance in pediatric bipolar disorder. ''Journal of Clinical Psychiatry, 69,'' 840-843. doi: 10.1016/j.jad.20009.07.020

=== 2007 ===
*Patel, N.C., Patrick, D.M., Youngstrom, E.A., Strakowski, S.M., &amp; DelBello, M.P. (2007). Response and remission in adolescent mania: Signal detection analyses of the Young Mania Rating Scale. ''Journal of the American Academy of Child and Adolescent Psychiatry, 46,'' 628-635. doi: 10.1097/chi.0b013e3180335ae4 
=== 2006 ===
*Youngstrom, E.A., *Meyers, O.I., Youngstrom, J.K., Calabrese, J.R., &amp; Findling, R.L. (2006). Comparing the effects of sampling designs on the diagnostic accuracy of eight promising screening algorithms for pediatric bipolar disorder. ''Biological Psychiatry, 60,'' 1013-1019. doi: 10.1016/j.biopsych.2006.06.023.

*Frazier, T.W., &amp; Youngstrom, E.A. (2006). Evidence based assessment of attention-deficit/hyperactivity disorder: Using multiple sources of information. ''Journal of the American Academy of Child and Adolescent Psychiatry, 45,'' 614-620. doi: 10.1097/01.chi.0000196597.09103.25

=== 2005 ===

*Youngstrom, E. A., *Meyers, O. I., Demeter, C., Kogos Youngstrom, J., Morello, L., Piiparinen, R., Feeny, N. C., Findling, R. L., &amp; Calabrese, J. R. (2005). Comparing diagnostic checklists for pediatric bipolar disorder in academic and community mental health settings. ''Bipolar Disorders, 7,'' 507-517. doi: j.1399-5618.2005.00269.x 

*Youngstrom, E. A., Findling, R. L., Youngstrom, J. K., &amp; Calabrese, J. R., (2005). Towards an evidence-based assessment of pediatric bipolar disorder. ''Journal of Clinical Child and Adolescent Psychology, 34,'' 433-448. Special Issue: Evidence-Based Assessment. doi: 10.1207/s15374424jccp3403_4
*Youngstrom, E. A., &amp; *Duax, J. (2005). Evidence Based Assessment of Pediatric Bipolar Disorder, Part 1: Base Rate and Family History. ''Journal of the American Academy of Child and Adolescent Psychiatry, 44,'' 712-717. doi: 10.1097/01.chi.0000162581.87710.bd

*Youngstrom, E. A., &amp; Kogos Youngstrom, J. (2005). Evidence Based Assessment of Pediatric Bipolar Disorder, Part 2: Incorporating Information from Behavior Checklists. ''Journal of the American Academy of Child and Adolescent Psychiatry, 44''(8), 823-828. doi: 10.1097/01.chi.0000164589.10200.a4

=== 2004 ===
*Youngstrom, E. A., Findling, R. L., Calabrese, J. R., Gracious, B. L., Demeter, C., DelPorto Bedoya, D., &amp; *Price, M.E. (2004). Comparing the diagnostic accuracy of six potential screening instruments for bipolar disorder in youths aged 5 to 17 years. ''Journal of the American Academy of Child &amp; Adolescent Psychiatry, 43,'' 847-858. doi: 10.1097/01.chi.0000125091.35109.1e

=== 2003 ===
*Danielson, C. K., Youngstrom, E. A., Findling, R. L., &amp; Calabrese, J. R. (2003). Discriminative validity of the General Behavior Inventory using youth report. ''Journal of Abnormal Child Psychology, 31,'' 29-39. doi: 10.1023/A:1021717231272

=== 2002 ===
*Findling, R. L., Youngstrom, E. A., DelPorto, D., Papish-David, R., Townsend, L., *Danielson, C. K., &amp; Calabrese, J. R. (2002). Clinical decision-making using the General Behavior Inventory. ''Bipolar Disorders, 4,'' 34-42. doi: 10.1034/j.1399-5618.2002.40102.

=== 2001 ===
*Youngstrom, E.A., Findling, R.L., *Danielson, C.K., &amp; Calabrese, J.R. (2001). Discriminative validity of parent report of hypomanic and depressive symptoms on the General Behavior Inventory. ''Psychological Assessment, 13,'' 267-276. doi: 10.1037//1040-3590.13.2.267

[[Category:Evidence-based assessment]]</text>
      <sha1>nwsomkwiqlftp6tsb1e0b0pokll38oe</sha1>
    </revision>
  </page>
  <page>
    <title>Template:Advise</title>
    <ns>10</ns>
    <id>222476</id>
    <revision>
      <id>2809903</id>
      <parentid>2765616</parentid>
      <timestamp>2026-05-17T11:03:46Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <minor />
      <origin>2809903</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="1522" sha1="rtaf52jkocmiumg0d3df67nrq0tyiru" xml:space="preserve">{{ombox
|image=[[File:Wikipedia-logo-v2.svg|40px|Wikipedia logo]]
|text=[[Wikipedia:|Wikipedia]] has encyclopedia articles related to: '''''[[Wikipedia:{{{1|Special:Search/{{PAGENAME}}}}}|{{{2|{{{1|{{PAGENAME}}}}}}}}]]''''' 
}}

&lt;div style=&quot;margin: 1.5rem auto; width:90%&quot;&gt;
&lt;div style=&quot;border-style: solid; border-width: 1px; padding: 1em; background-color: #EEF;color:var(--color-base-fixed,#202122);&quot;&gt;
[[File:Edit-check-sheet.svg|left|50px|Learn by doing]]
Wikiversity welcomes most types of [[Portal:Learning Materials|learning materials]] that are not [[w:Wikipedia:Contributing to Wikipedia|encyclopedia]] articles, [[b:Help:How to start a book|textbooks]], or [[s:Wikisource:What is Wikisource?|source texts]]. Please note that [[Wikiversity:What Wikiversity is not|Wikiversity is not]] a place for duplication of other Wikimedia projects.


Wikiversity has adopted a &quot;learn by doing&quot; model for online education and encourages the creation of [[Wikiversity:Learning projects|learning activities]] for Wikiversity participants. Everyone is invited to help add [[Wikiversity:Useful content|useful content]] to Wikiversity. If you need help learning how to add content, see the [[Wikiversity:Editing tutorial|editing tutorial]] and [[Wikiversity:Welcome, newcomers|Welcome, newcomers]]. Visit the [[Wikiversity:Colloquium|Colloquium]] if you have any questions.
&lt;/div&gt;
&lt;/div&gt;
&lt;includeonly&gt;
{{NOINDEX}}
[[Category:Soft redirects from encyclopedia topics]]
{{RfD}}
&lt;/includeonly&gt;&lt;noinclude&gt;
{{Documentation}}
&lt;/noinclude&gt;</text>
      <sha1>rtaf52jkocmiumg0d3df67nrq0tyiru</sha1>
    </revision>
  </page>
  <page>
    <title>Template:Talk header/doc</title>
    <ns>10</ns>
    <id>225132</id>
    <revision>
      <id>2809742</id>
      <parentid>1707207</parentid>
      <timestamp>2026-05-16T20:15:56Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>+</comment>
      <origin>2809742</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="216" sha1="c0qz0fu8rupf7bx80xfsp7ym7woqxka" xml:space="preserve">{{Documentation subpage}}
&lt;!-- Categories and interwikis go at the bottom of this page. --&gt;
{{TemplateStyles|Template:Talk header/styles.css}}
&lt;includeonly&gt;
&lt;!-- Categories and interwikis go here: --&gt;

&lt;/includeonly&gt;</text>
      <sha1>c0qz0fu8rupf7bx80xfsp7ym7woqxka</sha1>
    </revision>
  </page>
  <page>
    <title>Nutrition and Wellness</title>
    <ns>0</ns>
    <id>227101</id>
    <revision>
      <id>2809845</id>
      <parentid>2282962</parentid>
      <timestamp>2026-05-17T04:00:05Z</timestamp>
      <contributor>
        <username>HenriPittier</username>
        <id>3076895</id>
      </contributor>
      <origin>2809845</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="1770" sha1="trevj1gydvuxh8w89q40zrs4cupq045" xml:space="preserve">{{delete|This introduction has been text-to-text copied from a syllabus belonging to a teacher at a public high school, and thus, is not the work of the user who added this information. If you have any problems with this copied text, please contact [[User talk:Atcovi]]. Thank you!}}
==Introduction==
[[File:Red Apple.jpg|thumb|Nutrition is very important for a healthy lifestyle!]]
This course focuses on three practical problems: &quot;What should I do regarding ensuring wellness?&quot;, &quot;What should I do regarding food choices?&quot; and &quot;What should I do regarding preparing food?&quot;. Nutrition and Wellness focuses on making choices that promote wellness and good health; analyzing relationships between psychological and social needs and food choices; choosing foods that promote wellness; obtaining and storing food for self and family; preparing and serving nutritious meals and snacks; selecting and using equipment for food preparation; and identifying strategies to promote optimal nutrition and wellness of society. Lab experiences are centered on various practical problems and each lab experience provides an opportunity to enhance the practical application of nutrition principles in real life situations.
==Goals==
* The goal of the course is for students to incorporate the use of practical problem solving into nutrition and wellness choices.  
* The student assignments reinforce the importance of good writing skills and process skills.
* Learning to balance nutrition and wellness decisions improves a person’s ability to effectively balance work and family.
==Courses==
* [[Nutrition and Wellness/Chapter 1: Wellness and Food Choices|Chapter 1: Wellness and Food Choices]]
* [[Nutrition and Wellness/Chapter 2: |Chapter 2: ]]
[[Category:Nutrition and Wellness]]</text>
      <sha1>trevj1gydvuxh8w89q40zrs4cupq045</sha1>
    </revision>
    <revision>
      <id>2809855</id>
      <parentid>2809845</parentid>
      <timestamp>2026-05-17T04:30:26Z</timestamp>
      <contributor>
        <username>NguoiDungKhongDinhDanh</username>
        <id>2922842</id>
      </contributor>
      <minor />
      <comment>Reverted edit by [[Special:Contributions/HenriPittier|HenriPittier]] ([[User_talk:HenriPittier|talk]]) to last version by [[User:Dave Braunschweig|Dave Braunschweig]] using [[Wikiversity:Rollback|rollback]]</comment>
      <origin>2282957</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="1768" sha1="0l2qm3xdh5ljxnhey4h9pmqk4h0objj" xml:space="preserve">{{info|This introduction has been text-to-text copied from a syllabus belonging to a teacher at a public high school, and thus, is not the work of the user who added this information. If you have any problems with this copied text, please contact [[User talk:Atcovi]]. Thank you!}}
==Introduction==
[[File:Red Apple.jpg|thumb|Nutrition is very important for a healthy lifestyle!]]
This course focuses on three practical problems: &quot;What should I do regarding ensuring wellness?&quot;, &quot;What should I do regarding food choices?&quot; and &quot;What should I do regarding preparing food?&quot;. Nutrition and Wellness focuses on making choices that promote wellness and good health; analyzing relationships between psychological and social needs and food choices; choosing foods that promote wellness; obtaining and storing food for self and family; preparing and serving nutritious meals and snacks; selecting and using equipment for food preparation; and identifying strategies to promote optimal nutrition and wellness of society. Lab experiences are centered on various practical problems and each lab experience provides an opportunity to enhance the practical application of nutrition principles in real life situations.
==Goals==
* The goal of the course is for students to incorporate the use of practical problem solving into nutrition and wellness choices.  
* The student assignments reinforce the importance of good writing skills and process skills.
* Learning to balance nutrition and wellness decisions improves a person’s ability to effectively balance work and family.
==Courses==
* [[Nutrition and Wellness/Chapter 1: Wellness and Food Choices|Chapter 1: Wellness and Food Choices]]
* [[Nutrition and Wellness/Chapter 2: |Chapter 2: ]]
[[Category:Nutrition and Wellness]]</text>
      <sha1>0l2qm3xdh5ljxnhey4h9pmqk4h0objj</sha1>
    </revision>
  </page>
  <page>
    <title>Home Shop Machining</title>
    <ns>0</ns>
    <id>231618</id>
    <revision>
      <id>2809886</id>
      <parentid>2635839</parentid>
      <timestamp>2026-05-17T10:14:54Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <comment>- prod</comment>
      <origin>2809886</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="1273" sha1="g4vw5ni5208y45d2zfi39547bzyob1z" xml:space="preserve">== A course on Machining in a Home Shop Environment ==
[[File:Vertical_Shear_Results.jpg|thumb|Vertical Shear Results]]

=== Content Summary   ===
Machine shop practices, tips, and techniques as adapted for home shop use.

=== Goals ===
This course is for people that have discovered that they like making stuff out of metal, that they like metalworking tools, and that they want to learn more.  They want to become Home Shop Machinists.  This is not a course on becoming a professional machinist.

Caveat:  This course is, at present, a work in progress.  The intent is to prod the many experts at the [http://bbs.homeshopmachinist.net/forums/3-General Home Shop Machinist] forum to participate.  Hopefully, they do participate and this caveat can be deleted.

Home Appliance Repair: In this module, students will learn the skills necessary to [https://homelysolve.com/author/munna/ repair common home appliances], integrating practical metalworking skills with mechanical and electrical troubleshooting.

=== Topics ===
* [[/Safety/]]
* [[/Setup/]]
* [[/Equipment/]]
* [[/Material/]]
* [[/CAD/]]
* [[/Layout/]]
* [[/Machining Operations/]]
* [[/ CNC /]]
* [[/Finishing/]]
* [[/Projects/]]

== See Also ==
* [[Machining]]
* [[Wikipedia: Machining]]

[[Category:Machining]]</text>
      <sha1>g4vw5ni5208y45d2zfi39547bzyob1z</sha1>
    </revision>
  </page>
  <page>
    <title>Spectral Graph Theory</title>
    <ns>0</ns>
    <id>234313</id>
    <revision>
      <id>2809835</id>
      <parentid>2445198</parentid>
      <timestamp>2026-05-17T03:49:38Z</timestamp>
      <contributor>
        <username>HenriPittier</username>
        <id>3076895</id>
      </contributor>
      <origin>2809835</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="3236" sha1="68eiuo7wh6r4vog7k4890zo82r9vrk0" xml:space="preserve">This page, as of years from now, contains resources to learn spectral graph theory

==Textbooks==
# ''Algebraic Graph Theory'' by Chris Godsil and Gordon Royle.
# ''An Introduction to the Theory of Graph Spectra'' by Dragoš Cvetković, Peter Rowlinson, Slobodan Simić
# ''Eigenvalues in Combinatorial Optimization'' by Bojan Mohar and Svatopluk Poljak

==Offsite courses==
===With video lectures===
# ''[http://orion.math.iastate.edu/butler/2017/spring/x95/ Spectral graph theory]'', Steve Butler, Iowa State University, Spring 2017. ([https://www.youtube.com/playlist?list=PLi4h0n4UP8d9VGPqO8vLQga9ZApO65TLW video lectures])
# ''[https://www.youtube.com/playlist?list=PLkpN8cIB_rZFgZK6WLZu7n88c6cjgE2Kw Spectral graph theory]'', Bojan Mohar, International Conference and PhD-Master Summer School on Graphs and Groups, Spectra and Symmetries, Summer 2016.
# ''[https://www.youtube.com/playlist?list=PLgKuh-lKre12YBy6mn8k8spPp19F-V8K9 Spectral graph theory], Luca Trevisan, [https://simons.berkeley.edu/workshops/schedule/472 Algorithmic Spectral Graph Theory Boot Camp]'' University of California, Berkeley, Summer 2014
# ''[https://upcommons.upc.edu/handle/2099.2/2453 Eigenvalue techniques in graph theory]'', Willem Haemers, Polytechnic University of Catalonia, Summer 2011.
# ''[https://classroom.udacity.com/courses/ud281/lessons/4214228796/concepts/49193285760923 Graph partitioning]'' part of the Udacity course [https://www.udacity.com/course/ud281 High Performance Computing], Rich Vuduc, Georgia Institute of Technology

===Without video lectures===
# ''[http://www.cs.yale.edu/homes/spielman/561/ Spectral Graph Theory]'', Dan Spielman, Yale University, Fall 2015
# ''[https://cs.uwaterloo.ca/~lapchi/cs798-2015/index.html Algorithmic Spectral Graph Theory]'', Lap Chi Lau, University of Waterloo, Fall 2015
# ''[http://www.cs.cmu.edu/afs/cs/academic/class/15859n-f16/index.html Spectral Graph Theory and The Laplacian Paradigm]'', Gary Miller, Carnegie Mellon University, Fall 2016. Earlier versions: [http://www.cs.cmu.edu/~15859n/ Fall 2013]
# ''[https://courses.engr.illinois.edu/cs598sgt/sp2015/ Spectral Graph Theory]'', Alexandra Kolla, University of Illinois at Urbana-Champaign, Spring 2015
# ''[http://web.stanford.edu/class/msande337/ Spectral Graph Theory and Algorithmic Applications]'', Amin Saberi, Stanford University, Spring 2016
# ''[http://resources.mpi-inf.mpg.de/departments/d1/teaching/ws11/SGT/ Spectral Graph Theory]'', Thomas Sauerwald and He Sun, Max Planck Institute for Informatics, Winter 2011
# ''[https://asgt2012.wordpress.com/ Algorithmic Spectral Graph Theory]'', James R. Lee, University of Washington, Spring 2012
# ''[https://people.eecs.berkeley.edu/~luca/expanders2016/ Graph Partitioning, Expanders and Spectral Methods]'', Luca Trevisan, University of California, Berkeley, Winter 2011
# ''[https://people.orie.cornell.edu/dpw/orie6334/ Spectral Graph Theory]'', David P. Williamson, Cornell University, Fall 2016

==External links==

# ''[https://arxiv.org/pdf/1609.08072.pdf A brief introduction to Spectral Graph Theory]'', Bogdan Nica, 2016
# ''[https://arxiv.org/pdf/1608.04845.pdf Lecture Notes on Spectral Graph Methods]'', Michael W. Mahoney, 2016

[[Category:Graph theory]]</text>
      <sha1>68eiuo7wh6r4vog7k4890zo82r9vrk0</sha1>
    </revision>
    <revision>
      <id>2809864</id>
      <parentid>2809835</parentid>
      <timestamp>2026-05-17T04:30:36Z</timestamp>
      <contributor>
        <username>NguoiDungKhongDinhDanh</username>
        <id>2922842</id>
      </contributor>
      <minor />
      <comment>Reverted edit by [[Special:Contributions/HenriPittier|HenriPittier]] ([[User_talk:HenriPittier|talk]]) to last version by [[User:Xenmorpha|Xenmorpha]] using [[Wikiversity:Rollback|rollback]]</comment>
      <origin>2445198</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="3225" sha1="k9riazyyxsg4sd0npnxhg90k92qjvaq" xml:space="preserve">This page, as of now, contains resources to learn spectral graph theory

==Textbooks==
# ''Algebraic Graph Theory'' by Chris Godsil and Gordon Royle.
# ''An Introduction to the Theory of Graph Spectra'' by Dragoš Cvetković, Peter Rowlinson, Slobodan Simić
# ''Eigenvalues in Combinatorial Optimization'' by Bojan Mohar and Svatopluk Poljak

==Offsite courses==
===With video lectures===
# ''[http://orion.math.iastate.edu/butler/2017/spring/x95/ Spectral graph theory]'', Steve Butler, Iowa State University, Spring 2017. ([https://www.youtube.com/playlist?list=PLi4h0n4UP8d9VGPqO8vLQga9ZApO65TLW video lectures])
# ''[https://www.youtube.com/playlist?list=PLkpN8cIB_rZFgZK6WLZu7n88c6cjgE2Kw Spectral graph theory]'', Bojan Mohar, International Conference and PhD-Master Summer School on Graphs and Groups, Spectra and Symmetries, Summer 2016.
# ''[https://www.youtube.com/playlist?list=PLgKuh-lKre12YBy6mn8k8spPp19F-V8K9 Spectral graph theory], Luca Trevisan, [https://simons.berkeley.edu/workshops/schedule/472 Algorithmic Spectral Graph Theory Boot Camp]'' University of California, Berkeley, Summer 2014
# ''[https://upcommons.upc.edu/handle/2099.2/2453 Eigenvalue techniques in graph theory]'', Willem Haemers, Polytechnic University of Catalonia, Summer 2011.
# ''[https://classroom.udacity.com/courses/ud281/lessons/4214228796/concepts/49193285760923 Graph partitioning]'' part of the Udacity course [https://www.udacity.com/course/ud281 High Performance Computing], Rich Vuduc, Georgia Institute of Technology

===Without video lectures===
# ''[http://www.cs.yale.edu/homes/spielman/561/ Spectral Graph Theory]'', Dan Spielman, Yale University, Fall 2015
# ''[https://cs.uwaterloo.ca/~lapchi/cs798-2015/index.html Algorithmic Spectral Graph Theory]'', Lap Chi Lau, University of Waterloo, Fall 2015
# ''[http://www.cs.cmu.edu/afs/cs/academic/class/15859n-f16/index.html Spectral Graph Theory and The Laplacian Paradigm]'', Gary Miller, Carnegie Mellon University, Fall 2016. Earlier versions: [http://www.cs.cmu.edu/~15859n/ Fall 2013]
# ''[https://courses.engr.illinois.edu/cs598sgt/sp2015/ Spectral Graph Theory]'', Alexandra Kolla, University of Illinois at Urbana-Champaign, Spring 2015
# ''[http://web.stanford.edu/class/msande337/ Spectral Graph Theory and Algorithmic Applications]'', Amin Saberi, Stanford University, Spring 2016
# ''[http://resources.mpi-inf.mpg.de/departments/d1/teaching/ws11/SGT/ Spectral Graph Theory]'', Thomas Sauerwald and He Sun, Max Planck Institute for Informatics, Winter 2011
# ''[https://asgt2012.wordpress.com/ Algorithmic Spectral Graph Theory]'', James R. Lee, University of Washington, Spring 2012
# ''[https://people.eecs.berkeley.edu/~luca/expanders2016/ Graph Partitioning, Expanders and Spectral Methods]'', Luca Trevisan, University of California, Berkeley, Winter 2011
# ''[https://people.orie.cornell.edu/dpw/orie6334/ Spectral Graph Theory]'', David P. Williamson, Cornell University, Fall 2016

==External links==

# ''[https://arxiv.org/pdf/1609.08072.pdf A brief introduction to Spectral Graph Theory]'', Bogdan Nica, 2016
# ''[https://arxiv.org/pdf/1608.04845.pdf Lecture Notes on Spectral Graph Methods]'', Michael W. Mahoney, 2016

[[Category:Graph theory]]</text>
      <sha1>k9riazyyxsg4sd0npnxhg90k92qjvaq</sha1>
    </revision>
  </page>
  <page>
    <title>Wikiversity:Notices for custodians/Header</title>
    <ns>4</ns>
    <id>246580</id>
    <revision>
      <id>2809733</id>
      <parentid>2809266</parentid>
      <timestamp>2026-05-16T19:30:33Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>Removing the archive box.</comment>
      <origin>2809733</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="1031" sha1="kal33wuxiiluwtyln9hnvvtxtzacciz" xml:space="preserve">&lt;includeonly&gt;__NEWSECTIONLINK__{{Nobots}}&lt;/includeonly&gt;{{RoundBoxTop|theme=14}}
{{Portal-head2|2=Welcome}}
&lt;hr&gt;
&lt;includeonly&gt;{{Shortcut|WV:NOTICE|WV:AN}}&lt;/includeonly&gt;
This page is used for posting notices of interest to custodians and [[Wikiversity:Support staff|support staff]]. When creating a new request, please sign with &lt;code&gt;&lt;nowiki&gt;--~~~~&lt;/nowiki&gt;&lt;/code&gt;.

* Join us on IRC channel [[irc:wikiversity|#wikiversity]] to coordinate activities in real time.
* View recent changes in real time on IRC channel [[ircrc:en.wikiversity|#en.wikiversity]].
* [[Wikiversity:Import|Request pages to be imported]].
* '''Please''' look at [[Special:Unwatchedpages]] and add some pages that are of interest to you to your watchlist.
&lt;includeonly&gt;* '''Please''' review the [[/Archive|archives]] for past discussions.&lt;/includeonly&gt;
* See also: [[Wikiversity:Request custodian action]]
{{RoundBoxBottom}}
{{Administering Wikiversity}}&lt;includeonly&gt;
[[Category:Wikiversity administration]]
[[Category:Wikiversity custodianship]]
&lt;/includeonly&gt;</text>
      <sha1>kal33wuxiiluwtyln9hnvvtxtzacciz</sha1>
    </revision>
  </page>
  <page>
    <title>Korean/Words/Hotspots</title>
    <ns>0</ns>
    <id>255362</id>
    <revision>
      <id>2809890</id>
      <parentid>2746755</parentid>
      <timestamp>2026-05-17T10:24:01Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <comment>- prod (this page is part of a broader set of files nominated for deletion)</comment>
      <origin>2809890</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="604" sha1="t90xe0eyoywxwsjuzl4v0jjv50nj51v" xml:space="preserve">{{TOC right}}
&lt;div style=&quot;font-family:'Lucida Console', monospace;&quot;&gt;
{{../가다}}
{{../가르다}}
{{../갈래}}
{{../거흠}}
{{../구무}}
{{../구르다}}
{{../누나}}
{{../도}}
{{../돌멘}}
{{../두}}
{{../두다}}
{{../둑}}
{{../둔}}
{{../딛다}}
{{../또}}
{{../또한}}
{{../만세}}
{{../말}}
{{../말개미}}
{{../말거머리}}
{{../말벌}}
{{../말파리}}
{{../머구리}}
{{../미리내}}
{{../버텅아래}}
{{../치우}}
{{../태극}}
{{../텽}}
{{../품다}}
{{../해바라기}}
{{../햇귀}}
{{../햇물}}
&lt;/div&gt;
= References =
&lt;references /&gt;
[[Category:Regarding Korean words]]</text>
      <sha1>t90xe0eyoywxwsjuzl4v0jjv50nj51v</sha1>
    </revision>
  </page>
  <page>
    <title>Portal:Complex Systems Digital Campus/CS-DC 2020 elections, manifestos and results</title>
    <ns>102</ns>
    <id>270595</id>
    <revision>
      <id>2809675</id>
      <parentid>2808864</parentid>
      <timestamp>2026-05-16T18:03:32Z</timestamp>
      <contributor>
        <username>~2026-29396-85</username>
        <id>3076712</id>
      </contributor>
      <comment>/* Manifesto – Candidature for the Executive Committee of UNESCO UniTwin CS-DC */</comment>
      <origin>2809675</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="67396" sha1="n30cbxh7arc8o84ximpzzycpzk67aym" xml:space="preserve">    
----
----&lt;nowiki&gt;**&lt;/nowiki&gt;Please ''login'' in Wikiversity and then use the ''&lt;nowiki/&gt;'edit''' button: your edition mode will be 'WYSIWYG'. Each Candidature with its manifesto can take inspiration from those for previous years.  

''Decision of the 2025 General Assembly 27th April:''

''The 2026 elections are starting the 27th April, the date of the General Assembly:''

''(i) There will be an election for Vice-President starting the 27 April 2026.''

''(ii) To save time and effort - Instead of an election for 1/3 of the Executive Committee'' ''(EC) for 2025 we propose to keep the existing EC and invite members of the Council '''not on the EC''' to offer themselves as members of an enlarged Executive Committee. If less than six people propose themselves, they will be co-opted onto the Executive Committee. If more than six propose themselves we will hold an election for 1/3 EC.''

The deadline for your candidature is Saturday 16th May 2026 at 24:00 CET. 

== Candidature for the New Vice-President for [2026, 2027] ==
 
'''Manifesto – Candidature for New Vice-President of UNESCO UniTwin CS-DC'''

New Candidatures to the Executive Committee for [2026]
=== Manifesto – Candidature for the Executive Committee of UNESCO UniTwin CS-DC ===

===== Daniel Schertzer, Ecole nationale des ponts et chaussées =====

Dear UNESCO CS-DC Councillors,

I am writing to express my sincere interest in serving as a member of the Executive Committee of UNESCO UniTwin CS-DC. I am deeply committed to fostering the community of complex systems and am eager to contribute to the organisation of this talented group.

I am particularly interested in the “living roadmap” of CS-DC, a unique feature that operates through two complementary strategies. Firstly, it addresses major transversal problems, and secondly, it focusses on classes of complex systems. This integrative systems framework is particularly pertinent to geosciences, which are increasingly integrating urban sciences, sustainability science, territorial planning, computational modelling, socio-ecological intelligence, and digital governance.

Consequently, TIME—Territorial Intelligence for Multilevel Equity and Sustainability—is built on this integration process and is one of CS-DC’s principal flagship projects. I possess extensive international experience as a scientist, mentor, leader, organiser, and editor, which I believe would be valuable assets to this role.

Sincerely,
Daniel Schertzer
[https://hmco.enpc.fr/team-view/daniel-schertzer/ Short CV of Daniel Schertzer]


'''Flavia Mori SARTI, Ph.D., Professor and Researcher, University of Sao Paulo, Brazil'''

I present my interest in being candidate for the CS-DC Executive Committee to contribute to the dissemination of knowledge in complex systems at the local and global level. I am representative of the University of Sao Paulo (USP) at the CS-DC since 2012. I work with complex systems modeling since the creation of the Interdisciplinary Research Group of Complex Systems Modelling at the School of Arts, Sciences and Humanities (EACH-USP) in 2006. Our research group succesfully implemented the first interdisciplinary graduate program titled Master in Complex Systems Modeling in Brazil, in 2010. I have been participating in the program commission since 2010, and I was coordinator of the graduate program from 2010 to 2014.

I have supervised 12 students in the program and two postdoctoral fellows, followed by publication of several book chapters and papers on complex systems applied to public policies, including models on tax evasion, health systems regulation, health insurance, food policy and nutrition programs, and complex networks on scientific collaboration and global food trade. I have been invited to present seminars and talks on complex systems applied to food systems, health economics, and public policy.

My goals in the CS-DC Executive Committee include:

* To disseminate the role of CS-DC in education and research on complex systems, especially in developing countries;
* To support and to engage other research groups working with complex systems for participation in the CS-DC;
* To contribute further with management and organization of CS-DC activities during the period of 2022-2024;
* To continue supporting capacity building in complex systems through supervision and other academic activities;
* To foster innovation, research and development strategies through complex systems applications in public policy and entrepreneurship.


'''Alberto A. Rasia-Filho, MD, Ph.D, Professor and Researcher, Federal University of Health Sciences of Porto Alegre (UFCSPA) and Federal University of Rio Grande do Sul (UFRGS), Brazil'''

Dear Councilors of the UNESCO CS-DC,

It is an honor to submit my candidacy for the CS-DC Executive Committee for 2026. Please let me introduce myself as a Full Professor of Physiology (UFCSPA), Supervisor in the Biosciences (UFCSPA) and Neuroscience Graduate Programs (UFRGS), and a researcher on human neuronal morphology, dendritic spines, synaptic plasticity, and social/emotional neural networks (National Council for Scientific and Technological Development, Brazil). Professional Identifier/ORCID: 0000-0003-4623-5916.

Currently, I am participating as head of the e-Team &quot;Morphological Heterogeneity&quot; in the UNESCO CS-DC, led by Prof. Enver Oruro Puma, Principal Investigator of the Morphodynamic Neuroscience and Behavior eLab CS-DC, and Prof. Grace E. Pardo, Scientific Research Institute, Continental University of Cusco, Peru. We integrate morphodynamics across different scales of brain organization and neural network functions in complex systems, considering neuronal morphology itself as an emergent level of organization. The structure of neural cells and their connectivity within the brain volume are morphodynamic features with interactions from cellular morphogenetic elements, the local cell neighborhood, and synaptic connections. In turn, the emergent functions of networks are organized around a series of conceptual, experimental, and computational foundations.

These ideas were developed—and are now open to additional discussions—in the recent article from our group: “New Directions for Complex Systems in Contemporary Neuroscience: A Morphodynamic and Emergent Function Approach” (Research Topic: Theoretical and Computational Insights into Brain-Based Cognition/Frontiers in Computational Neuroscience). This represents an ongoing research line available for further collaborations in Complex Systems Science.

I will be (1) committed to the Action Plan 2026 (and beyond) from the current 2026-31 Action Plan/Complex Systems Digital Campus UNESCO UniTwin, (2) working to integrate interdisciplinary approaches and eTeams, sharing knowledge and opportunities for complex systems education and research, as well as (3) contributing to country and continent engagement and representation in line with worldwide aims, (4) including the academic formation of young scientists.
----'''Norberto Garcia-Cairasco, BSc, MSc, PhD, Full Professor of Physiology-Neurophysiology, Ribeirão Preto School of Medicine, University of São Paulo (FMRP-USP), Ribeirão Preto, São Paulo State, Brazil.'''

Dear Councilors of the UNESCO CS-DC,

It is an honor for me to submit my candidacy for the CS-DC Executive Committee for 2026. Please, let me introduce myself as a Full Professor of Physiology-Neurophysiology, Ribeirão Preto School of Medicine, University of São Paulo (FMRP-USP), Ribeirão Preto, São Paulo State, Brazil. At FMRP-USP, I am Supervisor (Master and PhD) at both Graduate Programs in Physiology and Neurology/Neuroscience &amp; Neuropsychiatry. I have been the Founder and the Director for almost 40 years of the Neurophysiology and Experimental Neuroethology Laboratory, where we conduct research in the characterization of epilepsies and associated neuropsychiatric comorbidities, using behavioral, electrophysiological, cellular, molecular and computational integrated tools, in both experimental and collaborative clinical settings. Our main funding comes from the State of São Paulo Foundation (FAPESP), the Federal agencies National Council for Research (CNPq) and the Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES). Professional Identifier/ORCID: &lt;nowiki&gt;https://orcid.org/0000-0001-8857-3775&lt;/nowiki&gt;.

I am currently the Head of the e-Team “'''Epilepsy and Neuropsychiatric Comorbidities”''' in the UNESCO CS-DC, led by Prof. Enver Oruro and Prof. Grace E Pardo, Principal Investigators of the Neurocomputing, Social Simulation, and Complex Systems Laboratory at the Instituto Científico of Universidad Continental del Cusco, Peru. 

Complex systems are involved in abnormal functioning and the refractoriness to pharmacological approaches of epileptogenic neural circuits, with additional multilevel complexity derived from associated, usually neuropsychiatric comorbidities. We, indeed, propose that the morphodynamics of neurons and glia in neural circuits can be studied as an initial step toward understanding proper wiring and stable properties, including neurotransmitters, neuromodulators, receptors, and intracellular signal transduction components, as well as plastic features, environmental stimuli, attention, and learning. These ideas were developed, and are now open to additional discussions, in the recent article from our group: “New Directions for Complex Systems in Contemporary Neuroscience: A Morphodynamic and Emergent Function Approach” (Research Topic: Theoretical and Computational Insights into Brain-Based Cognition/Frontiers in Computational Neuroscience). This represents an ongoing research line available for further collaborations in Complex Systems Science. 

I will be (1) committed to the Action Plan 2026 (and beyond) from the current 2026-31 Action Plan/Complex Systems Digital Campus UNESCO UniTwin, (2) working to integrate interdisciplinary approaches and eTeams, sharing knowledge and opportunities for complex systems education and research, as well as (3) contributing to country and continent engagement and representation in line with worldwide aims, (4) including the academic formation of young scientists.

In addition to the above-mentioned agenda and goals, I will offer, for the leverage of outreach activities, my experience of more than four decades in the '''''Neuroscience &amp; Arts''''' connection. In fact, I am co-Founder of the “Brain Awareness Week” in Brazil (since 2012) and currently the Coordinator at the Institute for Advanced Studies at USP-Ribeirão Preto of the “'''''Science, Arts, Education and Society Network - ScienArtES'''''”. In 2022, I received the Title of ''Doctor Honoris Causa'' (Biology) from the Universidad de Salamanca, Spain. Finally, I am also, since 2026, a Member of the Brain Literacy Initiative Alliance: Uniting for Brain Research-Informed Education Worldwide. 
----

== Candidature for the New President for [2025, 2026] ==
 
'''Manifesto – Candidature for New President of UNESCO UniTwin CS-DC'''

'''Prof. Paul Bourgine''' : 

If elected, my main commitment is to create the conditions for a self-organized development of our UNESCO UniTwin CS-DC as autonomous communities of communities for our flagship TIMES and its Knowledge &amp; Knowhow Accelerator one-for-all &amp; all-for-one (KKA). We know now how to realize —for the two above commitments— the 3&lt;sup&gt;rd&lt;/sup&gt; UNESCO commitment, i.e., the ‘computational ecosystem’. It will use the mature part of Web 3.0, especially the InterPlanetary File System (IPFS). Thanks to our previous efforts especially of the two last years, the remaining work amount is ten times less than we were anticipating at the beginning of the 2&lt;sup&gt;nd&lt;/sup&gt; renewal of our UniTwin by UNESCO 2020-2026.  

If elected, my duty will be not only to fulfill entirely the commitments of our Cooperation Program with UNESCO but also starting an exponential increasing development wave for our UniTwin network (through their continent and country Councils) and of our e-Campus (through CS-DC’25 and e-Labs’26 Conferences especially for our Flagships for sustainable development). The Knowledge &amp; Knowhow Accelerator will directly benefit from 1) such conference series, 2) our past and new flagships for sustainable development and 3) a new decentralized strategy for collecting donations in our decentralized network of X-Legal Entities.

== New Candidatures to the Executive Committee for [2025] ==

=== Manifesto – Candidature for the Executive Committee of UNESCO UniTwin CS-DC ===
'''Prof. Silvius STANCIU, PhD in Economics, PhD in Engineering, Habil.'''

Full Professor, “Dunărea de Jos” University of Galați (UDJG), Romania

Editor-in-Chief, ''Journal of Agriculture and Rural Development Studies (JARDS)''

Former Vice-Rector, Former Director of DFCTT and CTT UGAL
----'''Dear Councillors,'''

It is a great honor for me to submit my candidacy for the Executive Committee of the UNESCO UniTwin Complex Systems Digital Campus (CS-DC). With more than '''30 years of experience in academia''', I am currently Full Professor and doctoral advisor at “Dunărea de Jos” University of Galați (UDJG), Romania — a public research university with a strong regional impact and a long-standing tradition in interdisciplinary education and innovation.

I hold two doctoral degrees — one in Economics and one in Engineering — and I am a habilitated professor. I have published '''163 ISI-indexed scientific articles''' and have a '''Clarivate H-index of 14'''. My research focuses on '''food security, circular economy, technological innovation, rural development''', and '''complex systems in agro-food value chains'''.

I am the founder and coordinator of Romania’s first doctoral program in ''Engineering and Management in Agriculture and Rural Development (IMADR)'', with '''9 PhD graduates''' and '''9 doctoral students''' currently under my supervision. I also serve as '''Editor-in-Chief''' of the ''Journal of Agriculture and Rural Development Studies (JARDS)'', dedicated to interdisciplinary research in sustainable food and rural systems.

Over the past decade, I have been involved as director or expert in '''more than 45 national and international research projects''', including Horizon-compatible initiatives and cross-border cooperation programs. I coordinated a '''Romania–Republic of Moldova cross-border project''' (2020–2021) and currently lead '''two new ROMD-funded projects''' entering implementation.

My former institutional leadership roles include:

* '''Vice-Rector for Research and Innovation'''
* '''Director of the Department for Institutional Development (DFCTT)''' and of the '''Technology Transfer Center (CTT UGAL)'''
* '''Member of national and international quality and research bodies''', including CNATDCU, ARACIS, and CMPTJ

----'''If elected, I am committed to:'''

* Expanding the CS-DC network in '''Eastern Europe and the Black Sea region''', enhancing scientific and territorial diversity;
* Supporting '''POEM''' and '''FOOD flagship programs''' through digital education, doctoral/postdoctoral collaboration, and innovation ecosystems;
* Promoting '''open science''', international e-seminars, and interdisciplinary MOOCs;
* Coordinating thematic initiatives in '''agro-complexity, food systems resilience''', and '''sustainable rural innovation'''.

As a representative of a '''UniTwin member institution''', I see this candidacy as a unique opportunity to strengthen UDJG’s role within the CS-DC ecosystem. I fully embrace the CS-DC mission to foster global collaboration, education, and research in complexity science.

I am ready to bring '''vision, experience, and energy''' to the Executive Committee and help shape the future of our UniTwin community.
----'''Sincerely,'''

'''Prof. Silvius STANCIU, PhD in Economics, PhD in Engineering, Habil.'''

Representative of “Dunărea de Jos” University of Galați (UDJG)

'''Professional Identifiers:'''

* Web of Science Author ID: R-8246-2017
* ORCID: 0000-0001-7697-0968
* Scopus ID: 36633317700
* Google Scholar: Silvius Stanciu
* ResearchGate: Silvius Stanciu

== New Candidatures to the Executive Committee for [2024] ==

'''Enver Oruro Puma, Ph.D., Principal Investigator of Neurocomputing, Social Simulation, and Complex Systems Laboratory at the Instituto Científico of Universidad Andina del Cusco, Peru''' 

Dear Councillor of the UNESCO UniTwin CS-DC. I am very honored to place my candidature for the UNESCO UniTwin CS-DC Executive Committee. I am Enver Miguel Oruro Puma, Ph.D., principal investigator of Neurocomputing, Social Simulation, and Complex Systems Laboratory at the Instituto Científico of Universidad Andina del Cusco, Peru (https://sites.google.com/view/orurolab/). Since 2009, I have promoted and organized conferences and academic events on Complex Systems in Latin America. Recently, I have promoted the area of computational neuroscience on infant attachment (https://sites.google.com/view/envermiguel/seminar-in-maternal-infant-relationship-studies).

It would be a great honor for me if given the opportunity to contribute to the Executive Committee of UNESCO UniTwin CS-DC in the integration of Complex System research groups in the Latin American Region. For this, I propose the creation of two periodical activities: 1) A Special Lectures Series on Complex Systems UNESCO UniTwin CS-DC oriented to experts on Complex Systems, and 2) A Invited Advanced Lectures UNESCO UniTwin CS-DC oriented to experts who do not identify explicitly with complex systems

'''Pierre Collet, full professor of Strasbourg University, on secondment to Universidad Andrés Bello, Instituto de Tecnología para la Innovación en Salud y Bienestar, Viña del Mar, Valparaiso, Chile'''.

Since 2012, I have contributed to the elaboration of the CS-DC Unesco UniTwin together with Paul Bourigne, Jeffrey Johnson and many others, and I have been co-coordinator of the CS-DC UniTwin with Cyrille Bertelle since its creation in 2014. Starting part of this great adventure has changed my academic and personal life: thanks to the UniTwin, I have changed my research from stochastic optimisation, artificial evolution and AI in general to complex systems and epistemology.

Participating in this UniTwin allowed me to make new contacts and start incredible projects that I could not have imagined before. It has even changed my life, as I am now living in Chile, having been recruited by ITISB, an institute founded by Carla Taramasco, the CS-DC representative for South America.

Together with Paul and others, we would like to revive UniTwin by preparing another world conference inspired by the great success of [https://cs-dc-15.org CS-DC'15] and also develop flagship projects such as POEM (Personalised Open Education for the Masses) and the [https://en.wikiversity.org/wiki/Portal:Complex_Systems_Digital_Campus/E-Laboratory_on_complex_computational_ecosystems ECCE e-lab], which this year has welcomed a new very active [[Figures of Play/Les figures du Jeu e-team|Figures of Play]] that has started the [https://ludocorpus.org/ Ludocorpus] in France.

As said before, this incredible UniTwin adventure always pays off for those who invest in it and in its great challenge: to develop the new science of complex systems through research and education. Through its projects, it contributes to making the world a better place to live in, despite the constant attacks on science coming from the most unlikely places.

Science is the solution, not the problem, to many of the world's plagues. We must put our energy into developing it and defend it against all its detractors.

That is why I am once again standing for election to the Executive Committee of this great CS-DC UniTwin. Modern science is Complex Systems science. It is important that its beacon continues to illuminate the world, and we must invest our time and energy in it.

== Candidature Deputy President for [2024, 2025] ==
'''Jeffrey JOHNSON, Professor of Complexity Science and Design, The Open University, UK'''

I offer myself as a candidate both to be President and to the Executive Committee of The UNESCO UniTwin Complex Systems Digital Campus (CS-DC) so that I can help to drive it forward to achieve it goals.

I am particularly committed to our educational efforts. I have made four MOOCs on the FutureLearn Platform for CS-DC ( &lt;nowiki&gt;https://www.futurelearn.com/partners/unesco-unitwin-complex-systems-digital-campus&lt;/nowiki&gt; ): Global Systems Science (2015-16); Systems Thinking and Complexity (2017-18); First Steps in Data Science with Google Analytics (2018-19) and COVID-19 - Pandemics, Modelling and Policy (2020). CS-DC has a great opportunity to become the global university providing interdisciplinary education for a better world.

I am also committed to our research mission with UNESCO towards the achieving the U.N. Sustainable Development Goals. My own research on representing the dynamics of complex multilevel systems is relevant to many of the research initiatives of CS-DC.

I have extensive experience working within the complex systems community. I have run various coordination actions supporting research programmes funded by the European Commission, I am a founder member and past president of the Complex Systems Society, and I am Deputy-President of the CS-DC. I believe this experience will enable me to make a significant contribution the CS-DC over the next three years.

== New Elected President for [2023, 2024] ==
Paul BOURGINE, present President of the UNESCO UniTwin CS-DC, Complex Systems Institute of Paris 
I offer myself as a candidate to be President of The UNESCO UniTwin Complex Systems Digital Campus (CS-DC).
My previous commitment two years ago is below. The bad news is that it was not achieved. The good new is that we know now how to create 'autonomous community of autonomous communities' as a social network with IPFS (the InterPlanetary File System) like the new development of Wikipedia. 
If elected, my first commitment is to finish this job as quickly as possible. My second commitment is simultaneously to visit each country of the UniTwin for creating its country.CS-DC and its roadmap with young eTeams shared by their Universities with a senior scientific committee. The eTeam projects will have the opportunity to be submitted to the EU calls or other ones. 

Enver Oruro PhD, Head of Neurocomputing, Social Simulation and Complex Systems Laboratory, Universidad Andina del Cusco, Peru.
'''I would like to nominate Professor Paul Bourgine.'''

== New Elected Members to the Executive Committee for [2022,2023, 2024,2025] ==
'''2Dr Mohamed Abdellahi (Ould BABAH) Ebbe, Mauritania,''' 

* Senior Advisor for the CILSS Executif Secretary for international Partnership and formal General Director of the     Institut du Sahel/CILSS www.insah.org;

·       Commissionaire General of CILSS for Horticulture Universal  Expo of DOHA 2023-2024   &lt;nowiki&gt;https://www.dohaexpo2023.gov.qa/en/&lt;/nowiki&gt; with central thems:

'''CENTRAL THEME: GREEN DESERT, BETTER ENVIRONMENT'''

* Executive Director of the     Orthopterist Society (400 researchers among the globe) &lt;nowiki&gt;https://orthsoc.org/&lt;/nowiki&gt;
* We have organized our last     congress during 16-20 0ctober in Merida Mexique

&lt;nowiki&gt;https://ico2023mexico.com/&lt;/nowiki&gt;

By obtaining the honor of having your hoped-for confidence for continuing this post of member of the executive council of the CS-DC, I will work, in priority and in the short term on two main subjects:

## '''The transboundary plague of the     Desert Locust (Schistocerca gregaria (Forska l , 1775))''' This plague of the Desert     Locust of more than 3000 years that cites all our holy books (the Tourah,     the Bible and the Koran) and which continues to be present to this day and     to wreak devastating devastation. In case of invasion, it can affect the     agriculture and pastures of about 25 countries including those of the     poorest countries of the world, from Mauritania to India, while its best     and most effective strategy of struggle is preventive struggle by     targeting its first centers of gregarization which are very small in space     and much better known today. In 2005, the costs of its struggle in the     Sahel and North Africa amounted to half a billion dollars, with 8 million     farmers and pastoralists affected in the Sahel. It also massively invaded     Asia and Africa. 'East Africa in 2020. On this subject, I have spent 30     years studying and fighting and developing a national strategy against     this scourge which has made it possible to establish a whole prevention     model and an institutional, technical, operational mechanism. and     scientific effective in my country that can be adapted and copied and in     all other affected countries: Biogeography of the desert locust     Schistocerca gregaria, Forskal, 1775: Identification, characterization and     originality of a gregarious focus in central Mauritania (HR.HORS COLLEC.)     (French Edition) - Babah Ebbe, Mohamed Abdallahi | 9782705670573 |     Amazon.com.au | Books &lt;nowiki&gt;http://www.worldbank.org/en/news/feature/2010/01/07/improved-ways-to-prevent-the-desert-locust-in-mauritania-and-the-sahel&lt;/nowiki&gt;,     http: //     whatsnext.blogs.cnn.com/2012/02/02/in-mauritania-sunny-with-a-chance-of-locusts/ I was invited last year by Royal Society 20-21 may 2024 to moderate one session on locust research management (La plasticité des criquets et des abeilles dans un monde en mutation | Société royale) and in a “International Conference on New Technology and Concepts for Sustainable Management of Locusts and Grasshoppers” held from 2 to 7 June 2024 in Jinan, Shandong, China.We are also preparing our Orthopterist congress in Argentina during the next mars 2026  &lt;nowiki&gt;https://ico2026.com.ar&lt;/nowiki&gt;

'''All this is in addition of more than 110 publications or joint publications on the locust, its environment and management''' 

# '''Senior Adviser to the CILSS Executive Secretary for International Partnerships'''] [Assistance to Mauritania (or 3 months) in the preparation of the organisation of the Nouakchott+10 High-Level Forum on pastoralism held in Nouakchott from 6 to 8 November 2024, various advising for the international partnership and the mobilization of resources including preparation of the organization of a round table planned in OPEC Vienna Austria for the mobilization of Arabic and Islamic funds for the financing of the CILSS 2050 strategic plan
# '''The Sahel Institute (INSAH)     www.insah.org of the Permanent Interstate Committee for Drought Control     (CILSS)''' that I     lead and which has been doing extraordinary work for almost half a century     in the field of research and development of animal and plant production     techniques and also in the field of support for demographic, population     and development policies, in favor of the populations of our 13 Sahelian,     coastal and island member countries. This work covered the majority of     good practice technologies in the field of plant and animal production,     natural resource management, land rstauration, cultivation techniques,     post-harvest, machining, dehulling operations technology. / ginning,     Conservation and storage, good resilience practices

Research on the demographic dividend, gender and the empowerment of women and the Population / Development interrelations ... etc The results of all this work are contained in a database. data, online &lt;nowiki&gt;http://publications.insah.org/&lt;/nowiki&gt;, containing more than 1,500 books, scientific and technical articles that will have to be modernized and connected to the CS Meta data.

As General Commissionaire  of CILSS for Horticulture Universal  Expo of DOHA 2023-2024   &lt;nowiki&gt;https://www.dohaexpo2023.gov.qa/en/&lt;/nowiki&gt; with central thems:

'''CENTRAL THEME: GREEN DESERT, BETTER ENVIRONMENT''' I am working  in introducing as detailed below:

'''CILSS ''contribution to the improvement of sustainable horticultural agricultural production in a context of drought''''' 

'''I. PRESENTATION OF THE EXPO'''  

Expo 2023 in Doha is part of the fight against desertification. The Expo will be held from 2 October 2023 to 28 March 2024 under the theme &quot;'''''Green Desert, Better Environment'''''&quot;. The aim is to encourage, inspire and inform people about innovative solutions to reduce desertification. The exhibition will provide an international platform for participants, stakeholders, decision-makers, nongovernmental organizations and experts to address the global challenge of &quot;desertification&quot;, while making a valuable contribution to achieving a sustainable future. During the 6 months of the Expo, nearly 3 million visitors from over 80 countries are expected

The objectives of this Expo are in line with those of the CILSS, which seeks to improve the living conditions of the people of the Sahel in a sustainable manner. This is why the participation of CILSS in this Expo is important for the region and its vulnerable populations. 

'''OBJECTIVES OF EXPO 2023 DOHA, QATAR'''

Expo 2023 Doha, Qatar is defined by the following objectives:

-   Encourage horticultural innovation by focusing on Qatar's climate, water and soil.

-   Promote Expo 2023 in Doha, Qatar, as a catalyst for international investment and business opportunities.

-   To propose innovative actions that would allow humanity to fight against desertification more quickly and decisively before it is too late.

-   To build up useful environmental outputs for future generations.  

'''II. ORGANISATION OF THE CILSS PARTICIPATION'''

'''II.1. GOALS OF CILSS EXHIBITION:''' 

1. Sharing experiences and best practices,

2. Building International Partnership,

3. Promoting technology and innovation

Finally, I will continue to work actively with my colleagues on the Executive Board on all aspects of other cross-border scourges but also all aspects of improving agro-sylvo-pastoral production


'''Dr. Xabier E. Barandiaran, Lecturer at the University of the Basque Country (UPV/EHU), Department of Philosophy, Donostia - San Sebastian, Spain'''

I would like to present [https://xabier.barandiaran.net myself] as a candidate for the Executive Committee. I have been the representative and coordinator between CS-DC and the [https://ehu.eus University of the Basque Country] since 2013. I develop my academic research at the [https://ias-research.net IAS-Research Centre for Life, Mind, and Society], with a focus on the understanding of autonomous and complex adaptive systems (from biology to cognition, from brains to societies). I am the author of over 50 indexed publications on topics related to complex systems, philosophy of mind, complex epistemology, simulation models of the origins of life, minimal agency, evolutionary robotics, complex social network analysis, etc. I recently received the “Award for Distinguished Early-Career Investigator” by the International Society for Artificial Life. Overal I have been awarded with 7 different grants and have actively participated on 15 different research projects. I have also supervised 2 PhD thesis (4 more still in development) and I hold an extensive record of scientific and innovative management experience in different academic and public institutions as founder of research networks ReteCog.Net and FLOK Society – Buen Conocer and head of RDI at Barcelona City Council (2016-2018). I have also organized several national workshops, summer schools and conferences, and 2 international summer schools, 4 international workshops and one international conference. I am currently the Principal Investigator of a founded research project (with more than 30 research-collaborators) on a complex systems' approach to the concept of autonomy beyond its classical conception as an individual bounded property.

As part of my university's goal of fostering international collaboration and opening up e-learning and research initiatives I would like to get more deeply involved on CS-DC with the following goals:

* To desing the infrastructure, learning-experience, research-experience and content for distributed, open access and high-quality digital campus facilities.
* To involve local agents (student, teachers, researchers and institutions) on the initiative of the network.
* To foster collaboration, co-production and resource sharing between teaching and research facilities between priviledged richer countries and lower-income ones. In particular, but not exclusively, and for obvious reasons related to sharing the same language, to foster ''collaboration between European and Latin-american universities'', research initiatives and students through CS-DC.
* To develop at least one ''prototype'' of a MSc level online course (and research network module) around complex cognitive systems that can serve as a model for the other fields of the network.
* To develop a clear conceptual and communicative framework for CS-DC to be able to attract more participants, resources and broader attention and success as pioneering international initiative.


'''Dr. habil. László Barna Iantovics, Professor at “George Emil Palade” Univ. of Medicine, Pharmacy, Science and Technology of Tg. Mures, Romania'''

With the present manifesto, I would like to be a candidate for the CS-DC Executive Committee. I have been the representative of “George Emil Palade” University of Medicine, Pharmacy, Science and Technology of Targu Mures from Romania in CS-DC by many years.

Some of my research and academic activities were related to the complex systems, including: publications; organized conferences (e.g. Symposium on Understanding Intelligent and Complex Systems - UICS 2009; 1st Int. Conf. on Complexity and Intelligence of the Artificial and Natural Complex Systems Medical Applications of the Complex Systems. Biomedical Computing -CANS 2008; 1st Int. Conf. on Bio-Inspired Computational Methods Used for Difficult Problems Solving. Development of Intelligent and Complex Systems - BICS 2008); membership in conference committees (e.g. Int. Conf. Emergent Properties in Natural and Artificial Complex Systems - EPNACS 2007; Workshop on Complex Systems and Self-organization Modeling -CoSSoM 2009); Journal Special Issues (e.g. Special Issue on Complexity in Sciences and Artificial Intelligence; Special Issue on Understanding Complex Systems); membership in Journal’s Editorial Boards (e.g. Complex Adaptive Systems Modeling -CASM, SpringerOpen), and contribution to research performed in projects and projects coordination (Social network of machines- SOON; Hybrid Medical Complex Systems -ComplexMediSys). I am the director of the Research Center on Artificial Intelligence, Data Science and Smart Engineering (Artemis).

I would like to involve myself much deeper in the life and activities of the CS-DC community.

My principal objectives are:

* To involve junior and senior researchers from my university in activities regarding research and education related to complex systems.
* To involve universities and research institutes to actively contribute to the CS-DC development.
* To involve myself in the joint coordination with other CS-DC members of a doctoral and postdoctoral students’ group that will be involved in the CS-DC community works.
* To strengthen the research direction with the theme: applications of intelligent complex systems and machine intelligence measuring. One of the subtopics of interest will be the application of complex systems, artificial intelligence and data science in medicine, pharmacology, and healthcare.


'''Flavia Mori SARTI, Ph.D., Professor and Researcher, University of Sao Paulo, Brazil'''

I would like to present my candidature for the CS-DC Executive Committee in the period 2022-2024 to contribute to the dissemination of Complex Systems Science.

I have been representative of the University of Sao Paulo (USP) at the CS-DC since 2012, and I have been working with complex systems since the creation of the Interdisciplinary Research Group of Complex Systems Modelling at the School of Arts, Sciences and Humanities (EACH-USP) in 2006. Our research group succesfully implemented the first interdisciplinary graduate program (Master) in Complex Systems Modelling in Brazil, in 2010. I have been participating in the coordinating commission of the program since 2010, and I was coordinator of the graduate program from 2010 to 2014.

I have supervised seven students in the Master program, which resulted in thesis, book chapters, and papers published on the subject of complex systems, including models on tax evasion, health systems regulation, food policy and nutrition programs, and complex networks on scientific collaboration and international food trade. I also contributed to the organization of the e-Session &quot;Economics as a Complex Evolutionist System&quot; on the CS-DC'15 World e-conference in 2015, and have been invited to present seminars on complex systems applied to health economics, health technology assessment, and public policy of nutrition and health.

My goals in the CS-DC Executive Committee include:

* To disseminate the role of CS-DC in education and research on Complex Systems, especially in Brazil and other developing countries;
* To support and to engage other research groups working with Complex Systems for participation in the CS-DC;
* To contribute further with management and organization of CS-DC activities during the period of 2022-2024;
* To continue supporting capacity building in Complex Systems through the Complex Systems Modelling Program at USP;
* To participate in innovation, research and development activities based on the application of Complex Systems in public policy and entrepreneurship.


'''Pr Panos Argyarakis, Professor in the University of Thessaloniki, Greece.'''

I have been with the Complex Systems Society since its inception in 2004 by participating in the NEST projects Dysonet and Giacs which created CSS. My experience in the Executive Committee will be to contribute towards the spreading of the Complexity idea to various levels of education throughout the different countries. I am currently the PI in an Erasmus+ network that introduces new models of teaching and investigating how is education been affected for future generations. I can contribute in decision making for such important activities, and also serve as liaison with the European Commission, and the Complex Systems Society, due to my past experience. I have extended organizational experience by organizing several internationally meetings in this field that were attended by large audiences. My research interests are related to Complex systems and Networks. Scale-free, random, and small world networks. Dynamic properties on networks, Diffusion, spreading phenomena on networks, disease spreading. Phase transitions, percolation model, reaction-diffusion processes, trapping processes. Random walks.


'''Ali Moussaoui, Professor, University of Tlemcen, Department of Mathematics, Algeria,'''

I wish to present my candidature to become member of the executive committee of the CS-DC, I wish to develop collaborations with the partner universities in the field of complex systems. I wish to participate in the creation of international mixed laboratories and international masters on complex systems.

In the past, I was responsible for a master's degree entitled: modeling of complex systems in our department, I am currently responsible for a research team entitled: Modeling of complex systems in our laboratory, I was responsible for a Franco-Algerian project on the modeling of complex systems. My research skills are focused on the modeling of complex natural and biological systems.

'''Carlos Gershenson, Research Professor, Universidad Nacional Autónoma de México.'''

I was involved with CS-DC in its initial years in UNESCO's UniTwin, also representing UNAM. I have been editor-in-chief of Complexity Digest since 2007. I co-organized the Conference on Complex Systems in 2017. I am currently vice-president secretary of the Complex Systems Society (CSS).

I am a strong proponent of open online learning. I managed to start a collaboration between UNAM and Coursera, which has led to more than a hundred MOOCs and millions of enrolled students.

I would be interested in strengthening the relationship between CS-DC and CSS, as well as other organizations.

==Elected members to the Executive Committee for 2021 ==
'''Carlos J. BARRIOS H., PhD., Professor, Bucaramanga, Colombia '''

I write to express my interest to candidacy to be part of the CS-DC Executive Committee. I'm very motivated to develop actions to strengthen digital ecosystem supporting research and education proposals of our CS-DC Council. Among these years participating in the CS-DC group, I can see different ways to leverage the impact and the development of our actions with computational strategies, and now, I want to be part of the leadership council joined mutual visions.

My experience leading the Advanced Computing System for Latin America and Caribbean (SCALAC : http://scalac.redclara.net ) and as member of other leadership boards in international projects (mainly between Europe and Latin America) supports my candidature. (linkedin.com/in/carlosjaimebh) Also, my role as professor, director and researcher contributes to build the common vision of the CS-DC Council and the leadership of the CS- DC Executive Committee.


'''Mina TEICHER, Professor of Bar-Ilan University, Israël'''

I submit my candidacy to the Executive Committee of the CS Digital Campus. If elected I will work towards our following needs, using my past experience in Professional international societies, universities managements and the data industry : 

* We need in the near future to build an optimal and effective agreement with the Complex System Society.
* We need to build a business  plan for fund raising.
* We need to build a modular budget for 2021.
* We need to build a strategy for geographically extension. 
* We need to build a strategy for thematic  extension. 
* We need to build partnerships with the big multi national high tech Companies in network and in content. 


'''Yasmin MERALI, Professor of University of Hull, UK'''

This manifesto is connected with the ideals that I had as a founding member of our UniNet which was conceived as part of the FP7 ASSYST project.
CS-DC has come a long way since its initial conception. The way I see it, there are three categories that have grown to emerge as our core activities- 
* Capacity building through education and training in Complex Systems Science
* The application of Complex Systems Science to address global challenges
* The advancement of Complex Systems Science through research and development.

I believe this is a good time to link back to the inception of our UNITWIN which was in part inspired by considerations of issues at a human scale, and the desire to address the inequalities that divided the so-called developed and developing countries. This resonates strongly with the ambition of the  Sustainable Development Goals (SDGs) we are currently grappling with.
In the growth phase of the UNITWIN and CSDC we have been focused on extending the size of the network, and scaling up our educational offerings across the digital campus. In the next phase I believe we need to:
# understand and leverage the diversity and distinctive capabilities and resources (e.g. indigenous knowledge) of the countries in our network to develop a healthy ecosystem, and
# tailor the support that we provide to align with the diverse nature of their relational and social capital and their economic, political and environmental challenges and priorities with regard to the SDGs.  

I am concerned that if we do not explicitly design a social/ideational exchange mechanism that attends to these two imperatives, we will not have full, active participation of all member institutions, and the countries of the South that do not currently have champions in Europe will be marginalized.

If elected I would champion a strategy of organizing ourselves following the Complex Adaptive Systems paradigm, as a hyper network with dynamically connected local clusters. In practical terms I would like to begin by establishing the local (country-based) clusters and establishing a discourse that would allow us to map the diverse profiles, challenges and aspirations for the different countries. This would then form the basis for the development of a mechanism for shaping the meaningful collaborative development of our three core activities to deliver advances that are globally co-ordinated and locally responsive.

Personal Profile: I am Professor of Systems Thinking at the University of Hull and have served as Director of the Centre Systems Studies there. Prior to that I was Co-Director of the Doctoral Training Centre for Complex Systems Science at the University of Warwick. My research is transdisciplinary, focusing on the use of Complex Systems Science to enhance the resilience of socio-economic systems. I am an Expert advisor to the EU and I have significant experience of lecturing internationally as Visiting Professor in Asia, Europe and the USA.

'''Céline ROZENBLAT: Professor, University of Lausanne - Institut de géographie et de durabilité (IGD), Switzerland'''

I'm pleased to applied to become member of the CS-DC council.
As founding member of CS-DC, my university, the university of Lausanne, is very engaged in Complex sciences.
I would not only represent my university, but also social science as geographer and vice-president of the International Geographical Union and member of the International Science Council commission on Urban Health and Well being.
I would act in the council in specific programs to develop the reality of the Digital Campus of the Complex systems.

All these actions combine very ambitious interdisciplinary approaches, and in this perspective, we developed with CS-DC for 3 years the TIMES Flagship  Territorial Intelligence For Multilevel Equity And Sustainability. It comprises four main programs:

 '''SIRE''': Socially Intelligence Roadmap Ecosystem
 '''POLE:''' Personalized Open Lifelong Education
 '''WOSI:''' Worldwide Open Smart Innovation
 '''WOSP:''' Worldwide Open Stochastic Prediction 

In this perspective a MOOC « Healthy Urban system » is now in development, basing the interdisciplinary approach on the CS-DC Road-Map grid. It seems very useful and relevant in this implementation stage.
I would help to develop other programs in this perspective\[Ellipsis]


'''André TINDANO, Director General of CARFS (African Center for Research and Training in Synecoculture)'''

What motivates me to aspire to the position of member of the executive committee of CS DC is my long term participation in the promotion of sustainable development and my commitment to the sharing of knowledge and expertise.

My research interests Sustainable agriculture, ecology, nutrition, life science. I have a strong experience  in:
* Administration and management of development projects and programs;
* Accompaniment of associations and groups;
* Technical capacity building (animation of training sessions and reflection workshops).
* Action research;
* Sociological, socio-economic and economic studies.
* Development of development projects and programs;
* Training of trainers
* Results Based Management Training (RBM)
* Monitoring and evaluation of development programs and projects;
* Management of programs and development projects;
* Institutional development and organizational strengthening;
* Development and implementation of training / awareness / animation program;
* Very good knowledge of participatory methods
'''Guiou KOBAYASHI, Associate Professor at Federal University of ABC in São Paulo State, Brazil. '''

I worked with fault-tolerant computer systems for nuclear power plants and Metro signaling systems and recently my interests have evolved to resilience properties of Complex Systems. Traditionally, redundancy was the main feature for fault-tolerant and fail-safe systems, but the adaptability and the evolution of Complex Systems are the key elements for the resilience of these systems. How to characterize, design and implement these key elements in our future resilient systems? The Complex System - Digital Campus (CS-DC) is a way to create a world-wide community of researchers, philosophers and students to promote and discuss this kind of questions involving Complex Systems. For me, participating in its foundation was a great honor and I am very glad for the opportunity that I have had to contribute since 2012 in the consolidation of CS-DC.

Through this manifest I am applying to be one of the members of the new CS-DC's Executive Committee. I would like to help just a little more to strengthen and structure this fantastic community through which I had the opportunity to meet important people with very interesting works that expanded my knowledge of Complex Systems. Although my University and my personal contribution for CS-DC are very limited and small, I hope to continue to work with this great team.


'''Pierre COLLET, Professor of Computer Science, University of Strasbourg, France. Co-coordinator of the CS-DC UNESCO UniTwin'''

The CS-DC initiated by Paul Bourgine, Jeffrey Johnson, Cyrille Bertelle and many others has been an extraordinary adventure a) to instantiate as a UNESCO UniTwin and b) to develop and run since it was enacted in July 2014. Many a night have been spent on designing its inner workings, so that it can deliver an effective affordance for the scientists who wish to develop the science and teaching of Complex Systems. Indeed, many projects seeded in the CS-DC have come to fruition, showing the enormous potential of this fertile environment not only for research, but also for teaching: the BBB rooms set up by the CS-DC have not only made it possible for the CS-DC to organize conferences, but have also shown their potential as remote teaching rooms in many Universities around the world.

It has been an honour for me to be part of the development of the CS-DC since its beginning, but so much remains to be done!

In this manifesto, I hereby express my strong desire to continue developing the CS-DC in these trying times, when the effects of the pandemics stretch thin the social links that our research and teaching communities need most. My objectives for this new mandate are not only to deliver a new world conference (originally planned in 2020 but unfortunately delayed due to the high toll imposed on us all, teachers and researchers alike, by COVID-19) but also continue on developing not only efficient complex computational ecosystems (cheap powerful PARSEC machines have been installed in several universities) but more specifically remote teaching environments based on complex systems, to mitigate the terrible impact of the pandemic on face to face education, within the POEM CS-DC flagship, on which Paul Bourgine and myself have been working for many years now..


'''Mariana C. BROENS, Professor - UNESP - BRAZIL.'''

As members of the Executive Committee, our main challenge will be to raise, analyse and to discuss possible positive/negative ethical and political implications of the further development of the Complex Systems Science, and their application on studies of everyday social problems. In particular, We believe that the widespread use of complex system models and Big Data analytics can bring important questions about people's privacy, personal and corporate responsibility, widespread surveillance by public or private institutions, among many others, that should be deeply discussed in our community. Our contribution will be to raise and deepen these discussions from an interdisciplinary perspective.


'''Cyrille Bertelle, Professor in Computer Sciences,  University Le Havre, France, co-coordinator of the CS-DC UNESCO UniTwin'''

I am a candidate for the CS-DC Executive Committee to represent the University of Le Havre
Normandy, which is co-coordinator with the University of Strasbourg of the convention of
recognition of the CS-DC as UniTwin by UNESCO. The University of Le Havre has made
available to the community, resources and skills to provide digital collaborative tools for the
organization of the Councils and the CS-DC'15 virtual conference.

The objective I wish to take is to facilitate the involvement of member universities not only
by their representatives on the council but by allowing researchers from these member
institutions to join concrete and accessible actions.

Co-responsible in the past of a master's degree on complex systems and then of the creation
of the institute on complex systems in Normandie (France) in a multidisciplinary framework,
I have participated in the setting up of the project labeled by the French national program of
investments for the future and entitled &quot;Smart Port City&quot;. The aim is to think about the
future of territories in a sustainable development approach supported by new technologies
and concerned about the environment and the well-being of their citizens. My research skills
are focused on implementing the complexity of complex dynamic systems and networks,
crossing behavioral scales from the interaction of human behaviors to the technical
networks of the territory. 

The book &quot;complex systems, smart territories and mobility&quot; from
the Springer's Understanding Complex Systems series, which will be published in January
2021 (https://www.springer.com/gp/book/9783030593018) illustrates the research
coordination actions that I lead in these fields.


'''Slimane Ben Miled, Senior Researcher at Pasteur Institute of Tunis, Professor at ENIT'''

Our Tunisian consortium want to constitute a collaborative Research Training Programs to increase data science capacity related to health research in Africa by building trainings and enhancing institutional capacity at African academic institutions.
The academy/project is based on 4 pillars to build a training ecosystem for Data and Engineering Science in health.
# A platform of federated master’s programs with à la carte optional courses covering informatics/computer science, biomedical informatics, data science, statistics, and public health). Each program will keep its independence, with a mention to the academy label, and this platform will allow to enrich the training with optional modules, seminars, and courses in the partner institutions. New curricula will be created in relation to ethical issues.
# Network of Doctoral programs and Executive programs
# Platform of federated Business incubator and a career center offers training, support and funding for projects related to the project’s topic.

This challenge is in perfect agreement with the Sustainable Development Goal 3 and the CS-DC flagship PHYSIOMES (Personalized Health phYSIcally, sOcially and Mentally for Each in their networkS).


'''Masa Funabashi: researcher of open complex systems at Sony Computer Science Laboratories, Inc.'''

I would like to contribute to the executive committee of CS-DC on the following two pillars:
* Promote the FOOD (From smart agrOecOnomy to smart fooD) flagship project that aims to resolve the health-diet-environment trilemma through the promotion of sustainable food systems, in collaboration with the e-lab &quot;human augmentation of ecosystems&quot; members institution: Sony CSL, Synecoculture Association, CARFS, and those who wish to participate in CS-DC collaboration.
* Construct a basic e-learning content on Synecoculture and ecological literacy as a part of CS-DC MOOCs and perform initial trials, principally in ECOWAS countries, through the Sony CSL-CARFS collaboration.

Through the development of on-going activities in FOOD project and making synergy with other flagship projects, I would like to contribute CS-DC as a member of the executive committee and realize further extension toward the achievement of global sustainability goals such as SDGs.


'''Dr Mohamed Abdellahi (Ould BABAH) Ebbe, Mauritania, '''
* General Director of the Institut du Sahel/CILSS www.insah.org; 
* Executive Director of the Orthopterist Society (400 researchers among the globe) https://orthsoc.org/

By obtaining the honor of having your hoped-for confidence for this post of member of the executive council of the CS-DC, I will work, in priority and in the short term on two main subjects:
# '''The transboundary plague of the Desert Locust (Schistocerca gregaria (Forska l , 1775))''' This plague of the Desert Locust of more than 3000 years that cites all our holy books (the Tourah, the Bible and the Koran) and which continues to be present to this day and to wreak devastating devastation. In case of invasion, it can affect the agriculture and pastures of about 25 countries including those of the poorest countries of the world, from Mauritania to India, while its best and most effective strategy of struggle is preventive struggle by targeting its first centers of gregarization which are very small in space and much better known today. In 2005, the costs of its struggle in the Sahel and North Africa amounted to half a billion dollars, with 8 million farmers and pastoralists affected in the Sahel. It also massively invaded Asia and Africa. 'East Africa in 2020. On this subject, I have spent 30 years studying and fighting and developing a national strategy against this scourge which has made it possible to establish a whole prevention model and an institutional, technical, operational mechanism. and scientific effective in my country that can be adapted and copied and in all other affected countries: Biogeography of the desert locust Schistocerca gregaria, Forskal, 1775: Identification, characterization and originality of a gregarious focus in central Mauritania (HR.HORS COLLEC.) (French Edition) - Babah Ebbe, Mohamed Abdallahi | 9782705670573 | Amazon.com.au | Books http://www.worldbank.org/en/news/feature/2010/01/07/improved-ways-to-prevent-the-desert-locust-in-mauritania-and-the-sahel, http: // whatsnext.blogs.cnn.com/2012/02/02/in-mauritania-sunny-with-a-chance-of-locusts/
# '''The Sahel Institute (INSAH) www.insah.org of the Permanent Interstate Committee for Drought Control (CILSS)''' that I lead and which has been doing extraordinary work for almost half a century in the field of research and development of animal and plant production techniques and also in the field of support for demographic, population and development policies, in favor of the populations of our 13 Sahelian, coastal and island member countries. This work covered the majority of good practice technologies in the field of plant and animal production, natural resource management, land restauration, cultivation techniques, post-harvest, machining, dehulling operations technology. / ginning, Conservation and storage, good resilience practices

Research on the demographic dividend, gender and the empowerment of women and the Population / Development interrelations ... etc
The results of all this work are contained in a database. data, online http://publications.insah.org/, containing more than 1,500 books, scientific and technical articles that will have to be modernized and connected to the CS Meta data.

Finally, I will work actively with my colleagues on the Executive Board on all aspects of other cross-border scourges but also all aspects of improving agro-sylvo-pastoral production tools as well as the fight against poverty and food insecurity and nutrition in line with the goals (SDGs)


'''Dr. Habil. László Barna Iantovics, Associate Professor at “George Emil Palade” University of Medicine, Pharmacy, Science and Technology of Targu Mures, Romania.''' 

With the present manifesto, I would like to candidate as a member of the CS-DC Executive Committee. I am the representative of “George Emil Palade” University of Medicine, Pharmacy, Science and Technology of Targu Mures from Romania in CS-DC.

Some of my research and academic activities are related to the complex systems, including: publications, organization of conferences (e.g. Symposium on Understanding Intelligent and Complex Systems - UICS 2009; 1st Int. Conf. on Complexity and Intelligence of the Artificial and Natural Complex Systems Medical Applications of the Complex Systems. Biomedical Computing -CANS 2008; 1st Int. Conf. on Bio-Inspired Computational Methods Used for Difficult Problems Solving. Development of Intelligent and Complex Systems - BICS 2008), contribution to conference committees (e.g. Int. Conf. Emergent Proprieties in Natural and Artificial Complex Systems - EPNACS 2007; Workshop on Complex Systems and Self-organization Modeling -CoSSoM 2009), preparing journal special issues (e.g. Special Issue on Complexity in Sciences and Artificial Intelligence; Special Issue on Understanding Complex Systems), participating in journal’s editorial board (e.g. Complex Adaptive Systems Modeling -CASM, SpringerOpen), and contribution to research in projects and projects coordination (Social network of machines- SOON; Hybrid Medical Complex Systems -ComplexMediSys). I was the director of the center Advanced Computational Technologies – AdvCompTech in the frame of my university. At present, I am the director of the Center for Advanced Research in Information Technology from my university.

I would like much deeper involve myself in the life and activities of the CS-DC community.

My objectives:

* To involve junior and senior researchers from my university in activities regarding research and education. To motivate universities and research institutes from my country to contribute to CS-DC. I consider also universities and research institutes with that I have collaboration in the past.
* To PROPOSE the formation of a so-called doctoral and postdoctoral students group. In the case of doctoral and postdoctoral students probably in time more students would like to be involved in activities. In this framework, I suggest the organization yearly 3 times (from 4 to 4 months) workshops in that all the interested students could discuss, present their research and research in progress. With this occasion in the frame of workshops if there is interest could be established separate sessions with presentations also by B.Sc. and M.Sc. students.
* To PROPOSE the strengthening of the following research direction with the general topic: intelligent complex systems and machine intelligence measuring. One of the subtopic by interest will be complex systems approaches in medicine and healthcare. To be accomplishable this subject I propose in a first step the formation of a group of interested persons, after then the establishment of the functionality of the group, for example: discussions when are subjects that should be discussed etc.

==Elected members to the Executive Committee &amp; as (Deputy-)Presidents==


'''Jeffrey JOHNSON, Professor of Complexity Science and Design, The Open University, UK'''

I offer myself as a candidate both to be President and to the Executive Committee of  The UNESCO UniTwin Complex Systems Digital Campus (CS-DC) so that I can help to drive it forward to achieve it goals. 

I am particularly committed to our educational efforts. I have made four MOOCs on the FutureLearn Platform for CS-DC  ( https://www.futurelearn.com/partners/unesco-unitwin-complex-systems-digital-campus ): Global Systems Science (2015-16); Systems Thinking and Complexity (2017-18); First Steps in Data Science with Google Analytics (2018-19) and  COVID-19 - Pandemics, Modelling and Policy (2020). CS-DC has a great opportunity to become the global university providing interdisciplinary education for a better world.

I am also committed to our research mission with UNESCO towards the achieving the U.N. Sustainable Development Goals. My own research on representing the dynamics of complex multilevel systems is relevant to many of the research initiatives of CS-DC.

I have extensive experience working within the complex systems community. I have run various coordination actions supporting research programmes funded by the European Commission, I am a founder member and past president of the Complex Systems Society, and I am Deputy-President of the CS-DC. I believe this experience will enable me to make a significant contribution the CS-DC over the next three years.


'''Paul BOURGINE, present President of the UNESCO UniTwin CS-DC, Complex Systems Institute of Paris'''

I offer myself as a candidate both to be President and to the Executive Committee of  The UNESCO UniTwin Complex Systems Digital Campus (CS-DC).

If elected, my main commitment is to create the conditions for a self-organized development of our UniTwin UNESCO CS-DC as autonomous communities of communities. This self-similar development will be the case both for the two main branches the UniTwin branch of our institutional members and the global eCampus branches of our individual scientific members:
* for the UniTwin branch, the communities of communities are a territorial cascade with Smart Continents, smart countries, smart cities for their sustainable development according our flagship TIMES (Territorial Intelligence for Multilevel Equity and Sustainability). The roadmap is always the same, i.e. the cascade of the 17 Sustainable Development Goals and their 169 Targets: but their relative importance and coherence within this cascade vary from one territory to the others. The institutional members of the UniTwin branch have signed their agreement with the Cooperation Programme signed with UNESCO. In 2021, the CS-DC will ask for a cascade of agreements inside each institutional member, in order to have a &quot;one for all&quot; amplification within the other branch, the e-campus branch. 
* for the eCampus branch, the cascade of communities is along the refinement cascades when studying the theoretical and experimental challenges of complex systems. With Smart Continents'21, scientists are proposing their individual challenges that enact basic communities and communities of communities within the e-departments. In the &quot;all for one&quot; return, the roadmap of each university is the cascade of roadmaps within the eCampus where the University has at least one member. Furthermore each community can organise a monthly e-seminar or e-session in workshop as well as in CS-DC'21 for recorded advanced introductions. Such advanced introductions can be the basis for curriculum largely shared by the set of Universities having members in the  community cascade of the curriculum.

This &quot;accelerator of knowledge and knowhow one for all and all for one&quot; will first benefit to the student curriculum through the flagship POEM (Personalized Open Education for the Masses). This accelerator can be extended through the flagship POLE (Personalized Open Lifelong Education) for a lifelong education. This extended accelerator will be open to all, independently of previously achieved academic levels, respectful of the diversity of social and cultural environments and in a higher and higher inclusive way including refugees, migrants and primary people. genders, religions or ways of life.</text>
      <sha1>n30cbxh7arc8o84ximpzzycpzk67aym</sha1>
    </revision>
    <revision>
      <id>2809678</id>
      <parentid>2809675</parentid>
      <timestamp>2026-05-16T18:11:30Z</timestamp>
      <contributor>
        <username>~2026-29396-85</username>
        <id>3076712</id>
      </contributor>
      <comment>/* Daniel Schertzer, Ecole nationale des ponts et chaussées */</comment>
      <origin>2809678</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="67402" sha1="9fzc7899wdd7ml9r8usjyuhxz95jnl8" xml:space="preserve">    
----
----&lt;nowiki&gt;**&lt;/nowiki&gt;Please ''login'' in Wikiversity and then use the ''&lt;nowiki/&gt;'edit''' button: your edition mode will be 'WYSIWYG'. Each Candidature with its manifesto can take inspiration from those for previous years.  

''Decision of the 2025 General Assembly 27th April:''

''The 2026 elections are starting the 27th April, the date of the General Assembly:''

''(i) There will be an election for Vice-President starting the 27 April 2026.''

''(ii) To save time and effort - Instead of an election for 1/3 of the Executive Committee'' ''(EC) for 2025 we propose to keep the existing EC and invite members of the Council '''not on the EC''' to offer themselves as members of an enlarged Executive Committee. If less than six people propose themselves, they will be co-opted onto the Executive Committee. If more than six propose themselves we will hold an election for 1/3 EC.''

The deadline for your candidature is Saturday 16th May 2026 at 24:00 CET. 

== Candidature for the New Vice-President for [2026, 2027] ==
 
'''Manifesto – Candidature for New Vice-President of UNESCO UniTwin CS-DC'''

New Candidatures to the Executive Committee for [2026]
=== Manifesto – Candidature for the Executive Committee of UNESCO UniTwin CS-DC ===

===== Prof. Daniel Schertzer, Ecole nationale des ponts et chaussées =====

Dear UNESCO CS-DC Councillors,

I am writing to express my sincere interest in serving as a member of the Executive Committee of UNESCO UniTwin CS-DC. I am deeply committed to fostering the community of complex systems and am eager to contribute to the organisation of this talented group.

I am particularly interested in the “living roadmap” of CS-DC, a unique feature that operates through two complementary strategies. Firstly, it addresses major transversal problems, and secondly, it focusses on classes of complex systems. This integrative systems framework is particularly pertinent to geosciences, which are increasingly integrating urban sciences, sustainability science, territorial planning, computational modelling, socio-ecological intelligence, and digital governance.

Consequently, TIME—Territorial Intelligence for Multilevel Equity and Sustainability—is built on this integration process and is one of CS-DC’s principal flagship projects. I possess extensive international experience as a scientist, mentor, leader, organiser, and editor, which I believe would be valuable assets to this role.

Sincerely,
Daniel Schertzer
[https://hmco.enpc.fr/team-view/daniel-schertzer/ Short CV of Daniel Schertzer]


'''Flavia Mori SARTI, Ph.D., Professor and Researcher, University of Sao Paulo, Brazil'''

I present my interest in being candidate for the CS-DC Executive Committee to contribute to the dissemination of knowledge in complex systems at the local and global level. I am representative of the University of Sao Paulo (USP) at the CS-DC since 2012. I work with complex systems modeling since the creation of the Interdisciplinary Research Group of Complex Systems Modelling at the School of Arts, Sciences and Humanities (EACH-USP) in 2006. Our research group succesfully implemented the first interdisciplinary graduate program titled Master in Complex Systems Modeling in Brazil, in 2010. I have been participating in the program commission since 2010, and I was coordinator of the graduate program from 2010 to 2014.

I have supervised 12 students in the program and two postdoctoral fellows, followed by publication of several book chapters and papers on complex systems applied to public policies, including models on tax evasion, health systems regulation, health insurance, food policy and nutrition programs, and complex networks on scientific collaboration and global food trade. I have been invited to present seminars and talks on complex systems applied to food systems, health economics, and public policy.

My goals in the CS-DC Executive Committee include:

* To disseminate the role of CS-DC in education and research on complex systems, especially in developing countries;
* To support and to engage other research groups working with complex systems for participation in the CS-DC;
* To contribute further with management and organization of CS-DC activities during the period of 2022-2024;
* To continue supporting capacity building in complex systems through supervision and other academic activities;
* To foster innovation, research and development strategies through complex systems applications in public policy and entrepreneurship.


'''Alberto A. Rasia-Filho, MD, Ph.D, Professor and Researcher, Federal University of Health Sciences of Porto Alegre (UFCSPA) and Federal University of Rio Grande do Sul (UFRGS), Brazil'''

Dear Councilors of the UNESCO CS-DC,

It is an honor to submit my candidacy for the CS-DC Executive Committee for 2026. Please let me introduce myself as a Full Professor of Physiology (UFCSPA), Supervisor in the Biosciences (UFCSPA) and Neuroscience Graduate Programs (UFRGS), and a researcher on human neuronal morphology, dendritic spines, synaptic plasticity, and social/emotional neural networks (National Council for Scientific and Technological Development, Brazil). Professional Identifier/ORCID: 0000-0003-4623-5916.

Currently, I am participating as head of the e-Team &quot;Morphological Heterogeneity&quot; in the UNESCO CS-DC, led by Prof. Enver Oruro Puma, Principal Investigator of the Morphodynamic Neuroscience and Behavior eLab CS-DC, and Prof. Grace E. Pardo, Scientific Research Institute, Continental University of Cusco, Peru. We integrate morphodynamics across different scales of brain organization and neural network functions in complex systems, considering neuronal morphology itself as an emergent level of organization. The structure of neural cells and their connectivity within the brain volume are morphodynamic features with interactions from cellular morphogenetic elements, the local cell neighborhood, and synaptic connections. In turn, the emergent functions of networks are organized around a series of conceptual, experimental, and computational foundations.

These ideas were developed—and are now open to additional discussions—in the recent article from our group: “New Directions for Complex Systems in Contemporary Neuroscience: A Morphodynamic and Emergent Function Approach” (Research Topic: Theoretical and Computational Insights into Brain-Based Cognition/Frontiers in Computational Neuroscience). This represents an ongoing research line available for further collaborations in Complex Systems Science.

I will be (1) committed to the Action Plan 2026 (and beyond) from the current 2026-31 Action Plan/Complex Systems Digital Campus UNESCO UniTwin, (2) working to integrate interdisciplinary approaches and eTeams, sharing knowledge and opportunities for complex systems education and research, as well as (3) contributing to country and continent engagement and representation in line with worldwide aims, (4) including the academic formation of young scientists.
----'''Norberto Garcia-Cairasco, BSc, MSc, PhD, Full Professor of Physiology-Neurophysiology, Ribeirão Preto School of Medicine, University of São Paulo (FMRP-USP), Ribeirão Preto, São Paulo State, Brazil.'''

Dear Councilors of the UNESCO CS-DC,

It is an honor for me to submit my candidacy for the CS-DC Executive Committee for 2026. Please, let me introduce myself as a Full Professor of Physiology-Neurophysiology, Ribeirão Preto School of Medicine, University of São Paulo (FMRP-USP), Ribeirão Preto, São Paulo State, Brazil. At FMRP-USP, I am Supervisor (Master and PhD) at both Graduate Programs in Physiology and Neurology/Neuroscience &amp; Neuropsychiatry. I have been the Founder and the Director for almost 40 years of the Neurophysiology and Experimental Neuroethology Laboratory, where we conduct research in the characterization of epilepsies and associated neuropsychiatric comorbidities, using behavioral, electrophysiological, cellular, molecular and computational integrated tools, in both experimental and collaborative clinical settings. Our main funding comes from the State of São Paulo Foundation (FAPESP), the Federal agencies National Council for Research (CNPq) and the Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES). Professional Identifier/ORCID: &lt;nowiki&gt;https://orcid.org/0000-0001-8857-3775&lt;/nowiki&gt;.

I am currently the Head of the e-Team “'''Epilepsy and Neuropsychiatric Comorbidities”''' in the UNESCO CS-DC, led by Prof. Enver Oruro and Prof. Grace E Pardo, Principal Investigators of the Neurocomputing, Social Simulation, and Complex Systems Laboratory at the Instituto Científico of Universidad Continental del Cusco, Peru. 

Complex systems are involved in abnormal functioning and the refractoriness to pharmacological approaches of epileptogenic neural circuits, with additional multilevel complexity derived from associated, usually neuropsychiatric comorbidities. We, indeed, propose that the morphodynamics of neurons and glia in neural circuits can be studied as an initial step toward understanding proper wiring and stable properties, including neurotransmitters, neuromodulators, receptors, and intracellular signal transduction components, as well as plastic features, environmental stimuli, attention, and learning. These ideas were developed, and are now open to additional discussions, in the recent article from our group: “New Directions for Complex Systems in Contemporary Neuroscience: A Morphodynamic and Emergent Function Approach” (Research Topic: Theoretical and Computational Insights into Brain-Based Cognition/Frontiers in Computational Neuroscience). This represents an ongoing research line available for further collaborations in Complex Systems Science. 

I will be (1) committed to the Action Plan 2026 (and beyond) from the current 2026-31 Action Plan/Complex Systems Digital Campus UNESCO UniTwin, (2) working to integrate interdisciplinary approaches and eTeams, sharing knowledge and opportunities for complex systems education and research, as well as (3) contributing to country and continent engagement and representation in line with worldwide aims, (4) including the academic formation of young scientists.

In addition to the above-mentioned agenda and goals, I will offer, for the leverage of outreach activities, my experience of more than four decades in the '''''Neuroscience &amp; Arts''''' connection. In fact, I am co-Founder of the “Brain Awareness Week” in Brazil (since 2012) and currently the Coordinator at the Institute for Advanced Studies at USP-Ribeirão Preto of the “'''''Science, Arts, Education and Society Network - ScienArtES'''''”. In 2022, I received the Title of ''Doctor Honoris Causa'' (Biology) from the Universidad de Salamanca, Spain. Finally, I am also, since 2026, a Member of the Brain Literacy Initiative Alliance: Uniting for Brain Research-Informed Education Worldwide. 
----

== Candidature for the New President for [2025, 2026] ==
 
'''Manifesto – Candidature for New President of UNESCO UniTwin CS-DC'''

'''Prof. Paul Bourgine''' : 

If elected, my main commitment is to create the conditions for a self-organized development of our UNESCO UniTwin CS-DC as autonomous communities of communities for our flagship TIMES and its Knowledge &amp; Knowhow Accelerator one-for-all &amp; all-for-one (KKA). We know now how to realize —for the two above commitments— the 3&lt;sup&gt;rd&lt;/sup&gt; UNESCO commitment, i.e., the ‘computational ecosystem’. It will use the mature part of Web 3.0, especially the InterPlanetary File System (IPFS). Thanks to our previous efforts especially of the two last years, the remaining work amount is ten times less than we were anticipating at the beginning of the 2&lt;sup&gt;nd&lt;/sup&gt; renewal of our UniTwin by UNESCO 2020-2026.  

If elected, my duty will be not only to fulfill entirely the commitments of our Cooperation Program with UNESCO but also starting an exponential increasing development wave for our UniTwin network (through their continent and country Councils) and of our e-Campus (through CS-DC’25 and e-Labs’26 Conferences especially for our Flagships for sustainable development). The Knowledge &amp; Knowhow Accelerator will directly benefit from 1) such conference series, 2) our past and new flagships for sustainable development and 3) a new decentralized strategy for collecting donations in our decentralized network of X-Legal Entities.

== New Candidatures to the Executive Committee for [2025] ==

=== Manifesto – Candidature for the Executive Committee of UNESCO UniTwin CS-DC ===
'''Prof. Silvius STANCIU, PhD in Economics, PhD in Engineering, Habil.'''

Full Professor, “Dunărea de Jos” University of Galați (UDJG), Romania

Editor-in-Chief, ''Journal of Agriculture and Rural Development Studies (JARDS)''

Former Vice-Rector, Former Director of DFCTT and CTT UGAL
----'''Dear Councillors,'''

It is a great honor for me to submit my candidacy for the Executive Committee of the UNESCO UniTwin Complex Systems Digital Campus (CS-DC). With more than '''30 years of experience in academia''', I am currently Full Professor and doctoral advisor at “Dunărea de Jos” University of Galați (UDJG), Romania — a public research university with a strong regional impact and a long-standing tradition in interdisciplinary education and innovation.

I hold two doctoral degrees — one in Economics and one in Engineering — and I am a habilitated professor. I have published '''163 ISI-indexed scientific articles''' and have a '''Clarivate H-index of 14'''. My research focuses on '''food security, circular economy, technological innovation, rural development''', and '''complex systems in agro-food value chains'''.

I am the founder and coordinator of Romania’s first doctoral program in ''Engineering and Management in Agriculture and Rural Development (IMADR)'', with '''9 PhD graduates''' and '''9 doctoral students''' currently under my supervision. I also serve as '''Editor-in-Chief''' of the ''Journal of Agriculture and Rural Development Studies (JARDS)'', dedicated to interdisciplinary research in sustainable food and rural systems.

Over the past decade, I have been involved as director or expert in '''more than 45 national and international research projects''', including Horizon-compatible initiatives and cross-border cooperation programs. I coordinated a '''Romania–Republic of Moldova cross-border project''' (2020–2021) and currently lead '''two new ROMD-funded projects''' entering implementation.

My former institutional leadership roles include:

* '''Vice-Rector for Research and Innovation'''
* '''Director of the Department for Institutional Development (DFCTT)''' and of the '''Technology Transfer Center (CTT UGAL)'''
* '''Member of national and international quality and research bodies''', including CNATDCU, ARACIS, and CMPTJ

----'''If elected, I am committed to:'''

* Expanding the CS-DC network in '''Eastern Europe and the Black Sea region''', enhancing scientific and territorial diversity;
* Supporting '''POEM''' and '''FOOD flagship programs''' through digital education, doctoral/postdoctoral collaboration, and innovation ecosystems;
* Promoting '''open science''', international e-seminars, and interdisciplinary MOOCs;
* Coordinating thematic initiatives in '''agro-complexity, food systems resilience''', and '''sustainable rural innovation'''.

As a representative of a '''UniTwin member institution''', I see this candidacy as a unique opportunity to strengthen UDJG’s role within the CS-DC ecosystem. I fully embrace the CS-DC mission to foster global collaboration, education, and research in complexity science.

I am ready to bring '''vision, experience, and energy''' to the Executive Committee and help shape the future of our UniTwin community.
----'''Sincerely,'''

'''Prof. Silvius STANCIU, PhD in Economics, PhD in Engineering, Habil.'''

Representative of “Dunărea de Jos” University of Galați (UDJG)

'''Professional Identifiers:'''

* Web of Science Author ID: R-8246-2017
* ORCID: 0000-0001-7697-0968
* Scopus ID: 36633317700
* Google Scholar: Silvius Stanciu
* ResearchGate: Silvius Stanciu

== New Candidatures to the Executive Committee for [2024] ==

'''Enver Oruro Puma, Ph.D., Principal Investigator of Neurocomputing, Social Simulation, and Complex Systems Laboratory at the Instituto Científico of Universidad Andina del Cusco, Peru''' 

Dear Councillor of the UNESCO UniTwin CS-DC. I am very honored to place my candidature for the UNESCO UniTwin CS-DC Executive Committee. I am Enver Miguel Oruro Puma, Ph.D., principal investigator of Neurocomputing, Social Simulation, and Complex Systems Laboratory at the Instituto Científico of Universidad Andina del Cusco, Peru (https://sites.google.com/view/orurolab/). Since 2009, I have promoted and organized conferences and academic events on Complex Systems in Latin America. Recently, I have promoted the area of computational neuroscience on infant attachment (https://sites.google.com/view/envermiguel/seminar-in-maternal-infant-relationship-studies).

It would be a great honor for me if given the opportunity to contribute to the Executive Committee of UNESCO UniTwin CS-DC in the integration of Complex System research groups in the Latin American Region. For this, I propose the creation of two periodical activities: 1) A Special Lectures Series on Complex Systems UNESCO UniTwin CS-DC oriented to experts on Complex Systems, and 2) A Invited Advanced Lectures UNESCO UniTwin CS-DC oriented to experts who do not identify explicitly with complex systems

'''Pierre Collet, full professor of Strasbourg University, on secondment to Universidad Andrés Bello, Instituto de Tecnología para la Innovación en Salud y Bienestar, Viña del Mar, Valparaiso, Chile'''.

Since 2012, I have contributed to the elaboration of the CS-DC Unesco UniTwin together with Paul Bourigne, Jeffrey Johnson and many others, and I have been co-coordinator of the CS-DC UniTwin with Cyrille Bertelle since its creation in 2014. Starting part of this great adventure has changed my academic and personal life: thanks to the UniTwin, I have changed my research from stochastic optimisation, artificial evolution and AI in general to complex systems and epistemology.

Participating in this UniTwin allowed me to make new contacts and start incredible projects that I could not have imagined before. It has even changed my life, as I am now living in Chile, having been recruited by ITISB, an institute founded by Carla Taramasco, the CS-DC representative for South America.

Together with Paul and others, we would like to revive UniTwin by preparing another world conference inspired by the great success of [https://cs-dc-15.org CS-DC'15] and also develop flagship projects such as POEM (Personalised Open Education for the Masses) and the [https://en.wikiversity.org/wiki/Portal:Complex_Systems_Digital_Campus/E-Laboratory_on_complex_computational_ecosystems ECCE e-lab], which this year has welcomed a new very active [[Figures of Play/Les figures du Jeu e-team|Figures of Play]] that has started the [https://ludocorpus.org/ Ludocorpus] in France.

As said before, this incredible UniTwin adventure always pays off for those who invest in it and in its great challenge: to develop the new science of complex systems through research and education. Through its projects, it contributes to making the world a better place to live in, despite the constant attacks on science coming from the most unlikely places.

Science is the solution, not the problem, to many of the world's plagues. We must put our energy into developing it and defend it against all its detractors.

That is why I am once again standing for election to the Executive Committee of this great CS-DC UniTwin. Modern science is Complex Systems science. It is important that its beacon continues to illuminate the world, and we must invest our time and energy in it.

== Candidature Deputy President for [2024, 2025] ==
'''Jeffrey JOHNSON, Professor of Complexity Science and Design, The Open University, UK'''

I offer myself as a candidate both to be President and to the Executive Committee of The UNESCO UniTwin Complex Systems Digital Campus (CS-DC) so that I can help to drive it forward to achieve it goals.

I am particularly committed to our educational efforts. I have made four MOOCs on the FutureLearn Platform for CS-DC ( &lt;nowiki&gt;https://www.futurelearn.com/partners/unesco-unitwin-complex-systems-digital-campus&lt;/nowiki&gt; ): Global Systems Science (2015-16); Systems Thinking and Complexity (2017-18); First Steps in Data Science with Google Analytics (2018-19) and COVID-19 - Pandemics, Modelling and Policy (2020). CS-DC has a great opportunity to become the global university providing interdisciplinary education for a better world.

I am also committed to our research mission with UNESCO towards the achieving the U.N. Sustainable Development Goals. My own research on representing the dynamics of complex multilevel systems is relevant to many of the research initiatives of CS-DC.

I have extensive experience working within the complex systems community. I have run various coordination actions supporting research programmes funded by the European Commission, I am a founder member and past president of the Complex Systems Society, and I am Deputy-President of the CS-DC. I believe this experience will enable me to make a significant contribution the CS-DC over the next three years.

== New Elected President for [2023, 2024] ==
Paul BOURGINE, present President of the UNESCO UniTwin CS-DC, Complex Systems Institute of Paris 
I offer myself as a candidate to be President of The UNESCO UniTwin Complex Systems Digital Campus (CS-DC).
My previous commitment two years ago is below. The bad news is that it was not achieved. The good new is that we know now how to create 'autonomous community of autonomous communities' as a social network with IPFS (the InterPlanetary File System) like the new development of Wikipedia. 
If elected, my first commitment is to finish this job as quickly as possible. My second commitment is simultaneously to visit each country of the UniTwin for creating its country.CS-DC and its roadmap with young eTeams shared by their Universities with a senior scientific committee. The eTeam projects will have the opportunity to be submitted to the EU calls or other ones. 

Enver Oruro PhD, Head of Neurocomputing, Social Simulation and Complex Systems Laboratory, Universidad Andina del Cusco, Peru.
'''I would like to nominate Professor Paul Bourgine.'''

== New Elected Members to the Executive Committee for [2022,2023, 2024,2025] ==
'''2Dr Mohamed Abdellahi (Ould BABAH) Ebbe, Mauritania,''' 

* Senior Advisor for the CILSS Executif Secretary for international Partnership and formal General Director of the     Institut du Sahel/CILSS www.insah.org;

·       Commissionaire General of CILSS for Horticulture Universal  Expo of DOHA 2023-2024   &lt;nowiki&gt;https://www.dohaexpo2023.gov.qa/en/&lt;/nowiki&gt; with central thems:

'''CENTRAL THEME: GREEN DESERT, BETTER ENVIRONMENT'''

* Executive Director of the     Orthopterist Society (400 researchers among the globe) &lt;nowiki&gt;https://orthsoc.org/&lt;/nowiki&gt;
* We have organized our last     congress during 16-20 0ctober in Merida Mexique

&lt;nowiki&gt;https://ico2023mexico.com/&lt;/nowiki&gt;

By obtaining the honor of having your hoped-for confidence for continuing this post of member of the executive council of the CS-DC, I will work, in priority and in the short term on two main subjects:

## '''The transboundary plague of the     Desert Locust (Schistocerca gregaria (Forska l , 1775))''' This plague of the Desert     Locust of more than 3000 years that cites all our holy books (the Tourah,     the Bible and the Koran) and which continues to be present to this day and     to wreak devastating devastation. In case of invasion, it can affect the     agriculture and pastures of about 25 countries including those of the     poorest countries of the world, from Mauritania to India, while its best     and most effective strategy of struggle is preventive struggle by     targeting its first centers of gregarization which are very small in space     and much better known today. In 2005, the costs of its struggle in the     Sahel and North Africa amounted to half a billion dollars, with 8 million     farmers and pastoralists affected in the Sahel. It also massively invaded     Asia and Africa. 'East Africa in 2020. On this subject, I have spent 30     years studying and fighting and developing a national strategy against     this scourge which has made it possible to establish a whole prevention     model and an institutional, technical, operational mechanism. and     scientific effective in my country that can be adapted and copied and in     all other affected countries: Biogeography of the desert locust     Schistocerca gregaria, Forskal, 1775: Identification, characterization and     originality of a gregarious focus in central Mauritania (HR.HORS COLLEC.)     (French Edition) - Babah Ebbe, Mohamed Abdallahi | 9782705670573 |     Amazon.com.au | Books &lt;nowiki&gt;http://www.worldbank.org/en/news/feature/2010/01/07/improved-ways-to-prevent-the-desert-locust-in-mauritania-and-the-sahel&lt;/nowiki&gt;,     http: //     whatsnext.blogs.cnn.com/2012/02/02/in-mauritania-sunny-with-a-chance-of-locusts/ I was invited last year by Royal Society 20-21 may 2024 to moderate one session on locust research management (La plasticité des criquets et des abeilles dans un monde en mutation | Société royale) and in a “International Conference on New Technology and Concepts for Sustainable Management of Locusts and Grasshoppers” held from 2 to 7 June 2024 in Jinan, Shandong, China.We are also preparing our Orthopterist congress in Argentina during the next mars 2026  &lt;nowiki&gt;https://ico2026.com.ar&lt;/nowiki&gt;

'''All this is in addition of more than 110 publications or joint publications on the locust, its environment and management''' 

# '''Senior Adviser to the CILSS Executive Secretary for International Partnerships'''] [Assistance to Mauritania (or 3 months) in the preparation of the organisation of the Nouakchott+10 High-Level Forum on pastoralism held in Nouakchott from 6 to 8 November 2024, various advising for the international partnership and the mobilization of resources including preparation of the organization of a round table planned in OPEC Vienna Austria for the mobilization of Arabic and Islamic funds for the financing of the CILSS 2050 strategic plan
# '''The Sahel Institute (INSAH)     www.insah.org of the Permanent Interstate Committee for Drought Control     (CILSS)''' that I     lead and which has been doing extraordinary work for almost half a century     in the field of research and development of animal and plant production     techniques and also in the field of support for demographic, population     and development policies, in favor of the populations of our 13 Sahelian,     coastal and island member countries. This work covered the majority of     good practice technologies in the field of plant and animal production,     natural resource management, land rstauration, cultivation techniques,     post-harvest, machining, dehulling operations technology. / ginning,     Conservation and storage, good resilience practices

Research on the demographic dividend, gender and the empowerment of women and the Population / Development interrelations ... etc The results of all this work are contained in a database. data, online &lt;nowiki&gt;http://publications.insah.org/&lt;/nowiki&gt;, containing more than 1,500 books, scientific and technical articles that will have to be modernized and connected to the CS Meta data.

As General Commissionaire  of CILSS for Horticulture Universal  Expo of DOHA 2023-2024   &lt;nowiki&gt;https://www.dohaexpo2023.gov.qa/en/&lt;/nowiki&gt; with central thems:

'''CENTRAL THEME: GREEN DESERT, BETTER ENVIRONMENT''' I am working  in introducing as detailed below:

'''CILSS ''contribution to the improvement of sustainable horticultural agricultural production in a context of drought''''' 

'''I. PRESENTATION OF THE EXPO'''  

Expo 2023 in Doha is part of the fight against desertification. The Expo will be held from 2 October 2023 to 28 March 2024 under the theme &quot;'''''Green Desert, Better Environment'''''&quot;. The aim is to encourage, inspire and inform people about innovative solutions to reduce desertification. The exhibition will provide an international platform for participants, stakeholders, decision-makers, nongovernmental organizations and experts to address the global challenge of &quot;desertification&quot;, while making a valuable contribution to achieving a sustainable future. During the 6 months of the Expo, nearly 3 million visitors from over 80 countries are expected

The objectives of this Expo are in line with those of the CILSS, which seeks to improve the living conditions of the people of the Sahel in a sustainable manner. This is why the participation of CILSS in this Expo is important for the region and its vulnerable populations. 

'''OBJECTIVES OF EXPO 2023 DOHA, QATAR'''

Expo 2023 Doha, Qatar is defined by the following objectives:

-   Encourage horticultural innovation by focusing on Qatar's climate, water and soil.

-   Promote Expo 2023 in Doha, Qatar, as a catalyst for international investment and business opportunities.

-   To propose innovative actions that would allow humanity to fight against desertification more quickly and decisively before it is too late.

-   To build up useful environmental outputs for future generations.  

'''II. ORGANISATION OF THE CILSS PARTICIPATION'''

'''II.1. GOALS OF CILSS EXHIBITION:''' 

1. Sharing experiences and best practices,

2. Building International Partnership,

3. Promoting technology and innovation

Finally, I will continue to work actively with my colleagues on the Executive Board on all aspects of other cross-border scourges but also all aspects of improving agro-sylvo-pastoral production


'''Dr. Xabier E. Barandiaran, Lecturer at the University of the Basque Country (UPV/EHU), Department of Philosophy, Donostia - San Sebastian, Spain'''

I would like to present [https://xabier.barandiaran.net myself] as a candidate for the Executive Committee. I have been the representative and coordinator between CS-DC and the [https://ehu.eus University of the Basque Country] since 2013. I develop my academic research at the [https://ias-research.net IAS-Research Centre for Life, Mind, and Society], with a focus on the understanding of autonomous and complex adaptive systems (from biology to cognition, from brains to societies). I am the author of over 50 indexed publications on topics related to complex systems, philosophy of mind, complex epistemology, simulation models of the origins of life, minimal agency, evolutionary robotics, complex social network analysis, etc. I recently received the “Award for Distinguished Early-Career Investigator” by the International Society for Artificial Life. Overal I have been awarded with 7 different grants and have actively participated on 15 different research projects. I have also supervised 2 PhD thesis (4 more still in development) and I hold an extensive record of scientific and innovative management experience in different academic and public institutions as founder of research networks ReteCog.Net and FLOK Society – Buen Conocer and head of RDI at Barcelona City Council (2016-2018). I have also organized several national workshops, summer schools and conferences, and 2 international summer schools, 4 international workshops and one international conference. I am currently the Principal Investigator of a founded research project (with more than 30 research-collaborators) on a complex systems' approach to the concept of autonomy beyond its classical conception as an individual bounded property.

As part of my university's goal of fostering international collaboration and opening up e-learning and research initiatives I would like to get more deeply involved on CS-DC with the following goals:

* To desing the infrastructure, learning-experience, research-experience and content for distributed, open access and high-quality digital campus facilities.
* To involve local agents (student, teachers, researchers and institutions) on the initiative of the network.
* To foster collaboration, co-production and resource sharing between teaching and research facilities between priviledged richer countries and lower-income ones. In particular, but not exclusively, and for obvious reasons related to sharing the same language, to foster ''collaboration between European and Latin-american universities'', research initiatives and students through CS-DC.
* To develop at least one ''prototype'' of a MSc level online course (and research network module) around complex cognitive systems that can serve as a model for the other fields of the network.
* To develop a clear conceptual and communicative framework for CS-DC to be able to attract more participants, resources and broader attention and success as pioneering international initiative.


'''Dr. habil. László Barna Iantovics, Professor at “George Emil Palade” Univ. of Medicine, Pharmacy, Science and Technology of Tg. Mures, Romania'''

With the present manifesto, I would like to be a candidate for the CS-DC Executive Committee. I have been the representative of “George Emil Palade” University of Medicine, Pharmacy, Science and Technology of Targu Mures from Romania in CS-DC by many years.

Some of my research and academic activities were related to the complex systems, including: publications; organized conferences (e.g. Symposium on Understanding Intelligent and Complex Systems - UICS 2009; 1st Int. Conf. on Complexity and Intelligence of the Artificial and Natural Complex Systems Medical Applications of the Complex Systems. Biomedical Computing -CANS 2008; 1st Int. Conf. on Bio-Inspired Computational Methods Used for Difficult Problems Solving. Development of Intelligent and Complex Systems - BICS 2008); membership in conference committees (e.g. Int. Conf. Emergent Properties in Natural and Artificial Complex Systems - EPNACS 2007; Workshop on Complex Systems and Self-organization Modeling -CoSSoM 2009); Journal Special Issues (e.g. Special Issue on Complexity in Sciences and Artificial Intelligence; Special Issue on Understanding Complex Systems); membership in Journal’s Editorial Boards (e.g. Complex Adaptive Systems Modeling -CASM, SpringerOpen), and contribution to research performed in projects and projects coordination (Social network of machines- SOON; Hybrid Medical Complex Systems -ComplexMediSys). I am the director of the Research Center on Artificial Intelligence, Data Science and Smart Engineering (Artemis).

I would like to involve myself much deeper in the life and activities of the CS-DC community.

My principal objectives are:

* To involve junior and senior researchers from my university in activities regarding research and education related to complex systems.
* To involve universities and research institutes to actively contribute to the CS-DC development.
* To involve myself in the joint coordination with other CS-DC members of a doctoral and postdoctoral students’ group that will be involved in the CS-DC community works.
* To strengthen the research direction with the theme: applications of intelligent complex systems and machine intelligence measuring. One of the subtopics of interest will be the application of complex systems, artificial intelligence and data science in medicine, pharmacology, and healthcare.


'''Flavia Mori SARTI, Ph.D., Professor and Researcher, University of Sao Paulo, Brazil'''

I would like to present my candidature for the CS-DC Executive Committee in the period 2022-2024 to contribute to the dissemination of Complex Systems Science.

I have been representative of the University of Sao Paulo (USP) at the CS-DC since 2012, and I have been working with complex systems since the creation of the Interdisciplinary Research Group of Complex Systems Modelling at the School of Arts, Sciences and Humanities (EACH-USP) in 2006. Our research group succesfully implemented the first interdisciplinary graduate program (Master) in Complex Systems Modelling in Brazil, in 2010. I have been participating in the coordinating commission of the program since 2010, and I was coordinator of the graduate program from 2010 to 2014.

I have supervised seven students in the Master program, which resulted in thesis, book chapters, and papers published on the subject of complex systems, including models on tax evasion, health systems regulation, food policy and nutrition programs, and complex networks on scientific collaboration and international food trade. I also contributed to the organization of the e-Session &quot;Economics as a Complex Evolutionist System&quot; on the CS-DC'15 World e-conference in 2015, and have been invited to present seminars on complex systems applied to health economics, health technology assessment, and public policy of nutrition and health.

My goals in the CS-DC Executive Committee include:

* To disseminate the role of CS-DC in education and research on Complex Systems, especially in Brazil and other developing countries;
* To support and to engage other research groups working with Complex Systems for participation in the CS-DC;
* To contribute further with management and organization of CS-DC activities during the period of 2022-2024;
* To continue supporting capacity building in Complex Systems through the Complex Systems Modelling Program at USP;
* To participate in innovation, research and development activities based on the application of Complex Systems in public policy and entrepreneurship.


'''Pr Panos Argyarakis, Professor in the University of Thessaloniki, Greece.'''

I have been with the Complex Systems Society since its inception in 2004 by participating in the NEST projects Dysonet and Giacs which created CSS. My experience in the Executive Committee will be to contribute towards the spreading of the Complexity idea to various levels of education throughout the different countries. I am currently the PI in an Erasmus+ network that introduces new models of teaching and investigating how is education been affected for future generations. I can contribute in decision making for such important activities, and also serve as liaison with the European Commission, and the Complex Systems Society, due to my past experience. I have extended organizational experience by organizing several internationally meetings in this field that were attended by large audiences. My research interests are related to Complex systems and Networks. Scale-free, random, and small world networks. Dynamic properties on networks, Diffusion, spreading phenomena on networks, disease spreading. Phase transitions, percolation model, reaction-diffusion processes, trapping processes. Random walks.


'''Ali Moussaoui, Professor, University of Tlemcen, Department of Mathematics, Algeria,'''

I wish to present my candidature to become member of the executive committee of the CS-DC, I wish to develop collaborations with the partner universities in the field of complex systems. I wish to participate in the creation of international mixed laboratories and international masters on complex systems.

In the past, I was responsible for a master's degree entitled: modeling of complex systems in our department, I am currently responsible for a research team entitled: Modeling of complex systems in our laboratory, I was responsible for a Franco-Algerian project on the modeling of complex systems. My research skills are focused on the modeling of complex natural and biological systems.

'''Carlos Gershenson, Research Professor, Universidad Nacional Autónoma de México.'''

I was involved with CS-DC in its initial years in UNESCO's UniTwin, also representing UNAM. I have been editor-in-chief of Complexity Digest since 2007. I co-organized the Conference on Complex Systems in 2017. I am currently vice-president secretary of the Complex Systems Society (CSS).

I am a strong proponent of open online learning. I managed to start a collaboration between UNAM and Coursera, which has led to more than a hundred MOOCs and millions of enrolled students.

I would be interested in strengthening the relationship between CS-DC and CSS, as well as other organizations.

==Elected members to the Executive Committee for 2021 ==
'''Carlos J. BARRIOS H., PhD., Professor, Bucaramanga, Colombia '''

I write to express my interest to candidacy to be part of the CS-DC Executive Committee. I'm very motivated to develop actions to strengthen digital ecosystem supporting research and education proposals of our CS-DC Council. Among these years participating in the CS-DC group, I can see different ways to leverage the impact and the development of our actions with computational strategies, and now, I want to be part of the leadership council joined mutual visions.

My experience leading the Advanced Computing System for Latin America and Caribbean (SCALAC : http://scalac.redclara.net ) and as member of other leadership boards in international projects (mainly between Europe and Latin America) supports my candidature. (linkedin.com/in/carlosjaimebh) Also, my role as professor, director and researcher contributes to build the common vision of the CS-DC Council and the leadership of the CS- DC Executive Committee.


'''Mina TEICHER, Professor of Bar-Ilan University, Israël'''

I submit my candidacy to the Executive Committee of the CS Digital Campus. If elected I will work towards our following needs, using my past experience in Professional international societies, universities managements and the data industry : 

* We need in the near future to build an optimal and effective agreement with the Complex System Society.
* We need to build a business  plan for fund raising.
* We need to build a modular budget for 2021.
* We need to build a strategy for geographically extension. 
* We need to build a strategy for thematic  extension. 
* We need to build partnerships with the big multi national high tech Companies in network and in content. 


'''Yasmin MERALI, Professor of University of Hull, UK'''

This manifesto is connected with the ideals that I had as a founding member of our UniNet which was conceived as part of the FP7 ASSYST project.
CS-DC has come a long way since its initial conception. The way I see it, there are three categories that have grown to emerge as our core activities- 
* Capacity building through education and training in Complex Systems Science
* The application of Complex Systems Science to address global challenges
* The advancement of Complex Systems Science through research and development.

I believe this is a good time to link back to the inception of our UNITWIN which was in part inspired by considerations of issues at a human scale, and the desire to address the inequalities that divided the so-called developed and developing countries. This resonates strongly with the ambition of the  Sustainable Development Goals (SDGs) we are currently grappling with.
In the growth phase of the UNITWIN and CSDC we have been focused on extending the size of the network, and scaling up our educational offerings across the digital campus. In the next phase I believe we need to:
# understand and leverage the diversity and distinctive capabilities and resources (e.g. indigenous knowledge) of the countries in our network to develop a healthy ecosystem, and
# tailor the support that we provide to align with the diverse nature of their relational and social capital and their economic, political and environmental challenges and priorities with regard to the SDGs.  

I am concerned that if we do not explicitly design a social/ideational exchange mechanism that attends to these two imperatives, we will not have full, active participation of all member institutions, and the countries of the South that do not currently have champions in Europe will be marginalized.

If elected I would champion a strategy of organizing ourselves following the Complex Adaptive Systems paradigm, as a hyper network with dynamically connected local clusters. In practical terms I would like to begin by establishing the local (country-based) clusters and establishing a discourse that would allow us to map the diverse profiles, challenges and aspirations for the different countries. This would then form the basis for the development of a mechanism for shaping the meaningful collaborative development of our three core activities to deliver advances that are globally co-ordinated and locally responsive.

Personal Profile: I am Professor of Systems Thinking at the University of Hull and have served as Director of the Centre Systems Studies there. Prior to that I was Co-Director of the Doctoral Training Centre for Complex Systems Science at the University of Warwick. My research is transdisciplinary, focusing on the use of Complex Systems Science to enhance the resilience of socio-economic systems. I am an Expert advisor to the EU and I have significant experience of lecturing internationally as Visiting Professor in Asia, Europe and the USA.

'''Céline ROZENBLAT: Professor, University of Lausanne - Institut de géographie et de durabilité (IGD), Switzerland'''

I'm pleased to applied to become member of the CS-DC council.
As founding member of CS-DC, my university, the university of Lausanne, is very engaged in Complex sciences.
I would not only represent my university, but also social science as geographer and vice-president of the International Geographical Union and member of the International Science Council commission on Urban Health and Well being.
I would act in the council in specific programs to develop the reality of the Digital Campus of the Complex systems.

All these actions combine very ambitious interdisciplinary approaches, and in this perspective, we developed with CS-DC for 3 years the TIMES Flagship  Territorial Intelligence For Multilevel Equity And Sustainability. It comprises four main programs:

 '''SIRE''': Socially Intelligence Roadmap Ecosystem
 '''POLE:''' Personalized Open Lifelong Education
 '''WOSI:''' Worldwide Open Smart Innovation
 '''WOSP:''' Worldwide Open Stochastic Prediction 

In this perspective a MOOC « Healthy Urban system » is now in development, basing the interdisciplinary approach on the CS-DC Road-Map grid. It seems very useful and relevant in this implementation stage.
I would help to develop other programs in this perspective\[Ellipsis]


'''André TINDANO, Director General of CARFS (African Center for Research and Training in Synecoculture)'''

What motivates me to aspire to the position of member of the executive committee of CS DC is my long term participation in the promotion of sustainable development and my commitment to the sharing of knowledge and expertise.

My research interests Sustainable agriculture, ecology, nutrition, life science. I have a strong experience  in:
* Administration and management of development projects and programs;
* Accompaniment of associations and groups;
* Technical capacity building (animation of training sessions and reflection workshops).
* Action research;
* Sociological, socio-economic and economic studies.
* Development of development projects and programs;
* Training of trainers
* Results Based Management Training (RBM)
* Monitoring and evaluation of development programs and projects;
* Management of programs and development projects;
* Institutional development and organizational strengthening;
* Development and implementation of training / awareness / animation program;
* Very good knowledge of participatory methods
'''Guiou KOBAYASHI, Associate Professor at Federal University of ABC in São Paulo State, Brazil. '''

I worked with fault-tolerant computer systems for nuclear power plants and Metro signaling systems and recently my interests have evolved to resilience properties of Complex Systems. Traditionally, redundancy was the main feature for fault-tolerant and fail-safe systems, but the adaptability and the evolution of Complex Systems are the key elements for the resilience of these systems. How to characterize, design and implement these key elements in our future resilient systems? The Complex System - Digital Campus (CS-DC) is a way to create a world-wide community of researchers, philosophers and students to promote and discuss this kind of questions involving Complex Systems. For me, participating in its foundation was a great honor and I am very glad for the opportunity that I have had to contribute since 2012 in the consolidation of CS-DC.

Through this manifest I am applying to be one of the members of the new CS-DC's Executive Committee. I would like to help just a little more to strengthen and structure this fantastic community through which I had the opportunity to meet important people with very interesting works that expanded my knowledge of Complex Systems. Although my University and my personal contribution for CS-DC are very limited and small, I hope to continue to work with this great team.


'''Pierre COLLET, Professor of Computer Science, University of Strasbourg, France. Co-coordinator of the CS-DC UNESCO UniTwin'''

The CS-DC initiated by Paul Bourgine, Jeffrey Johnson, Cyrille Bertelle and many others has been an extraordinary adventure a) to instantiate as a UNESCO UniTwin and b) to develop and run since it was enacted in July 2014. Many a night have been spent on designing its inner workings, so that it can deliver an effective affordance for the scientists who wish to develop the science and teaching of Complex Systems. Indeed, many projects seeded in the CS-DC have come to fruition, showing the enormous potential of this fertile environment not only for research, but also for teaching: the BBB rooms set up by the CS-DC have not only made it possible for the CS-DC to organize conferences, but have also shown their potential as remote teaching rooms in many Universities around the world.

It has been an honour for me to be part of the development of the CS-DC since its beginning, but so much remains to be done!

In this manifesto, I hereby express my strong desire to continue developing the CS-DC in these trying times, when the effects of the pandemics stretch thin the social links that our research and teaching communities need most. My objectives for this new mandate are not only to deliver a new world conference (originally planned in 2020 but unfortunately delayed due to the high toll imposed on us all, teachers and researchers alike, by COVID-19) but also continue on developing not only efficient complex computational ecosystems (cheap powerful PARSEC machines have been installed in several universities) but more specifically remote teaching environments based on complex systems, to mitigate the terrible impact of the pandemic on face to face education, within the POEM CS-DC flagship, on which Paul Bourgine and myself have been working for many years now..


'''Mariana C. BROENS, Professor - UNESP - BRAZIL.'''

As members of the Executive Committee, our main challenge will be to raise, analyse and to discuss possible positive/negative ethical and political implications of the further development of the Complex Systems Science, and their application on studies of everyday social problems. In particular, We believe that the widespread use of complex system models and Big Data analytics can bring important questions about people's privacy, personal and corporate responsibility, widespread surveillance by public or private institutions, among many others, that should be deeply discussed in our community. Our contribution will be to raise and deepen these discussions from an interdisciplinary perspective.


'''Cyrille Bertelle, Professor in Computer Sciences,  University Le Havre, France, co-coordinator of the CS-DC UNESCO UniTwin'''

I am a candidate for the CS-DC Executive Committee to represent the University of Le Havre
Normandy, which is co-coordinator with the University of Strasbourg of the convention of
recognition of the CS-DC as UniTwin by UNESCO. The University of Le Havre has made
available to the community, resources and skills to provide digital collaborative tools for the
organization of the Councils and the CS-DC'15 virtual conference.

The objective I wish to take is to facilitate the involvement of member universities not only
by their representatives on the council but by allowing researchers from these member
institutions to join concrete and accessible actions.

Co-responsible in the past of a master's degree on complex systems and then of the creation
of the institute on complex systems in Normandie (France) in a multidisciplinary framework,
I have participated in the setting up of the project labeled by the French national program of
investments for the future and entitled &quot;Smart Port City&quot;. The aim is to think about the
future of territories in a sustainable development approach supported by new technologies
and concerned about the environment and the well-being of their citizens. My research skills
are focused on implementing the complexity of complex dynamic systems and networks,
crossing behavioral scales from the interaction of human behaviors to the technical
networks of the territory. 

The book &quot;complex systems, smart territories and mobility&quot; from
the Springer's Understanding Complex Systems series, which will be published in January
2021 (https://www.springer.com/gp/book/9783030593018) illustrates the research
coordination actions that I lead in these fields.


'''Slimane Ben Miled, Senior Researcher at Pasteur Institute of Tunis, Professor at ENIT'''

Our Tunisian consortium want to constitute a collaborative Research Training Programs to increase data science capacity related to health research in Africa by building trainings and enhancing institutional capacity at African academic institutions.
The academy/project is based on 4 pillars to build a training ecosystem for Data and Engineering Science in health.
# A platform of federated master’s programs with à la carte optional courses covering informatics/computer science, biomedical informatics, data science, statistics, and public health). Each program will keep its independence, with a mention to the academy label, and this platform will allow to enrich the training with optional modules, seminars, and courses in the partner institutions. New curricula will be created in relation to ethical issues.
# Network of Doctoral programs and Executive programs
# Platform of federated Business incubator and a career center offers training, support and funding for projects related to the project’s topic.

This challenge is in perfect agreement with the Sustainable Development Goal 3 and the CS-DC flagship PHYSIOMES (Personalized Health phYSIcally, sOcially and Mentally for Each in their networkS).


'''Masa Funabashi: researcher of open complex systems at Sony Computer Science Laboratories, Inc.'''

I would like to contribute to the executive committee of CS-DC on the following two pillars:
* Promote the FOOD (From smart agrOecOnomy to smart fooD) flagship project that aims to resolve the health-diet-environment trilemma through the promotion of sustainable food systems, in collaboration with the e-lab &quot;human augmentation of ecosystems&quot; members institution: Sony CSL, Synecoculture Association, CARFS, and those who wish to participate in CS-DC collaboration.
* Construct a basic e-learning content on Synecoculture and ecological literacy as a part of CS-DC MOOCs and perform initial trials, principally in ECOWAS countries, through the Sony CSL-CARFS collaboration.

Through the development of on-going activities in FOOD project and making synergy with other flagship projects, I would like to contribute CS-DC as a member of the executive committee and realize further extension toward the achievement of global sustainability goals such as SDGs.


'''Dr Mohamed Abdellahi (Ould BABAH) Ebbe, Mauritania, '''
* General Director of the Institut du Sahel/CILSS www.insah.org; 
* Executive Director of the Orthopterist Society (400 researchers among the globe) https://orthsoc.org/

By obtaining the honor of having your hoped-for confidence for this post of member of the executive council of the CS-DC, I will work, in priority and in the short term on two main subjects:
# '''The transboundary plague of the Desert Locust (Schistocerca gregaria (Forska l , 1775))''' This plague of the Desert Locust of more than 3000 years that cites all our holy books (the Tourah, the Bible and the Koran) and which continues to be present to this day and to wreak devastating devastation. In case of invasion, it can affect the agriculture and pastures of about 25 countries including those of the poorest countries of the world, from Mauritania to India, while its best and most effective strategy of struggle is preventive struggle by targeting its first centers of gregarization which are very small in space and much better known today. In 2005, the costs of its struggle in the Sahel and North Africa amounted to half a billion dollars, with 8 million farmers and pastoralists affected in the Sahel. It also massively invaded Asia and Africa. 'East Africa in 2020. On this subject, I have spent 30 years studying and fighting and developing a national strategy against this scourge which has made it possible to establish a whole prevention model and an institutional, technical, operational mechanism. and scientific effective in my country that can be adapted and copied and in all other affected countries: Biogeography of the desert locust Schistocerca gregaria, Forskal, 1775: Identification, characterization and originality of a gregarious focus in central Mauritania (HR.HORS COLLEC.) (French Edition) - Babah Ebbe, Mohamed Abdallahi | 9782705670573 | Amazon.com.au | Books http://www.worldbank.org/en/news/feature/2010/01/07/improved-ways-to-prevent-the-desert-locust-in-mauritania-and-the-sahel, http: // whatsnext.blogs.cnn.com/2012/02/02/in-mauritania-sunny-with-a-chance-of-locusts/
# '''The Sahel Institute (INSAH) www.insah.org of the Permanent Interstate Committee for Drought Control (CILSS)''' that I lead and which has been doing extraordinary work for almost half a century in the field of research and development of animal and plant production techniques and also in the field of support for demographic, population and development policies, in favor of the populations of our 13 Sahelian, coastal and island member countries. This work covered the majority of good practice technologies in the field of plant and animal production, natural resource management, land restauration, cultivation techniques, post-harvest, machining, dehulling operations technology. / ginning, Conservation and storage, good resilience practices

Research on the demographic dividend, gender and the empowerment of women and the Population / Development interrelations ... etc
The results of all this work are contained in a database. data, online http://publications.insah.org/, containing more than 1,500 books, scientific and technical articles that will have to be modernized and connected to the CS Meta data.

Finally, I will work actively with my colleagues on the Executive Board on all aspects of other cross-border scourges but also all aspects of improving agro-sylvo-pastoral production tools as well as the fight against poverty and food insecurity and nutrition in line with the goals (SDGs)


'''Dr. Habil. László Barna Iantovics, Associate Professor at “George Emil Palade” University of Medicine, Pharmacy, Science and Technology of Targu Mures, Romania.''' 

With the present manifesto, I would like to candidate as a member of the CS-DC Executive Committee. I am the representative of “George Emil Palade” University of Medicine, Pharmacy, Science and Technology of Targu Mures from Romania in CS-DC.

Some of my research and academic activities are related to the complex systems, including: publications, organization of conferences (e.g. Symposium on Understanding Intelligent and Complex Systems - UICS 2009; 1st Int. Conf. on Complexity and Intelligence of the Artificial and Natural Complex Systems Medical Applications of the Complex Systems. Biomedical Computing -CANS 2008; 1st Int. Conf. on Bio-Inspired Computational Methods Used for Difficult Problems Solving. Development of Intelligent and Complex Systems - BICS 2008), contribution to conference committees (e.g. Int. Conf. Emergent Proprieties in Natural and Artificial Complex Systems - EPNACS 2007; Workshop on Complex Systems and Self-organization Modeling -CoSSoM 2009), preparing journal special issues (e.g. Special Issue on Complexity in Sciences and Artificial Intelligence; Special Issue on Understanding Complex Systems), participating in journal’s editorial board (e.g. Complex Adaptive Systems Modeling -CASM, SpringerOpen), and contribution to research in projects and projects coordination (Social network of machines- SOON; Hybrid Medical Complex Systems -ComplexMediSys). I was the director of the center Advanced Computational Technologies – AdvCompTech in the frame of my university. At present, I am the director of the Center for Advanced Research in Information Technology from my university.

I would like much deeper involve myself in the life and activities of the CS-DC community.

My objectives:

* To involve junior and senior researchers from my university in activities regarding research and education. To motivate universities and research institutes from my country to contribute to CS-DC. I consider also universities and research institutes with that I have collaboration in the past.
* To PROPOSE the formation of a so-called doctoral and postdoctoral students group. In the case of doctoral and postdoctoral students probably in time more students would like to be involved in activities. In this framework, I suggest the organization yearly 3 times (from 4 to 4 months) workshops in that all the interested students could discuss, present their research and research in progress. With this occasion in the frame of workshops if there is interest could be established separate sessions with presentations also by B.Sc. and M.Sc. students.
* To PROPOSE the strengthening of the following research direction with the general topic: intelligent complex systems and machine intelligence measuring. One of the subtopic by interest will be complex systems approaches in medicine and healthcare. To be accomplishable this subject I propose in a first step the formation of a group of interested persons, after then the establishment of the functionality of the group, for example: discussions when are subjects that should be discussed etc.

==Elected members to the Executive Committee &amp; as (Deputy-)Presidents==


'''Jeffrey JOHNSON, Professor of Complexity Science and Design, The Open University, UK'''

I offer myself as a candidate both to be President and to the Executive Committee of  The UNESCO UniTwin Complex Systems Digital Campus (CS-DC) so that I can help to drive it forward to achieve it goals. 

I am particularly committed to our educational efforts. I have made four MOOCs on the FutureLearn Platform for CS-DC  ( https://www.futurelearn.com/partners/unesco-unitwin-complex-systems-digital-campus ): Global Systems Science (2015-16); Systems Thinking and Complexity (2017-18); First Steps in Data Science with Google Analytics (2018-19) and  COVID-19 - Pandemics, Modelling and Policy (2020). CS-DC has a great opportunity to become the global university providing interdisciplinary education for a better world.

I am also committed to our research mission with UNESCO towards the achieving the U.N. Sustainable Development Goals. My own research on representing the dynamics of complex multilevel systems is relevant to many of the research initiatives of CS-DC.

I have extensive experience working within the complex systems community. I have run various coordination actions supporting research programmes funded by the European Commission, I am a founder member and past president of the Complex Systems Society, and I am Deputy-President of the CS-DC. I believe this experience will enable me to make a significant contribution the CS-DC over the next three years.


'''Paul BOURGINE, present President of the UNESCO UniTwin CS-DC, Complex Systems Institute of Paris'''

I offer myself as a candidate both to be President and to the Executive Committee of  The UNESCO UniTwin Complex Systems Digital Campus (CS-DC).

If elected, my main commitment is to create the conditions for a self-organized development of our UniTwin UNESCO CS-DC as autonomous communities of communities. This self-similar development will be the case both for the two main branches the UniTwin branch of our institutional members and the global eCampus branches of our individual scientific members:
* for the UniTwin branch, the communities of communities are a territorial cascade with Smart Continents, smart countries, smart cities for their sustainable development according our flagship TIMES (Territorial Intelligence for Multilevel Equity and Sustainability). The roadmap is always the same, i.e. the cascade of the 17 Sustainable Development Goals and their 169 Targets: but their relative importance and coherence within this cascade vary from one territory to the others. The institutional members of the UniTwin branch have signed their agreement with the Cooperation Programme signed with UNESCO. In 2021, the CS-DC will ask for a cascade of agreements inside each institutional member, in order to have a &quot;one for all&quot; amplification within the other branch, the e-campus branch. 
* for the eCampus branch, the cascade of communities is along the refinement cascades when studying the theoretical and experimental challenges of complex systems. With Smart Continents'21, scientists are proposing their individual challenges that enact basic communities and communities of communities within the e-departments. In the &quot;all for one&quot; return, the roadmap of each university is the cascade of roadmaps within the eCampus where the University has at least one member. Furthermore each community can organise a monthly e-seminar or e-session in workshop as well as in CS-DC'21 for recorded advanced introductions. Such advanced introductions can be the basis for curriculum largely shared by the set of Universities having members in the  community cascade of the curriculum.

This &quot;accelerator of knowledge and knowhow one for all and all for one&quot; will first benefit to the student curriculum through the flagship POEM (Personalized Open Education for the Masses). This accelerator can be extended through the flagship POLE (Personalized Open Lifelong Education) for a lifelong education. This extended accelerator will be open to all, independently of previously achieved academic levels, respectful of the diversity of social and cultural environments and in a higher and higher inclusive way including refugees, migrants and primary people. genders, religions or ways of life.</text>
      <sha1>9fzc7899wdd7ml9r8usjyuhxz95jnl8</sha1>
    </revision>
    <revision>
      <id>2809679</id>
      <parentid>2809678</parentid>
      <timestamp>2026-05-16T18:36:45Z</timestamp>
      <contributor>
        <username>~2026-29396-85</username>
        <id>3076712</id>
      </contributor>
      <comment>/* Prof. Daniel Schertzer, Ecole nationale des ponts et chaussées */</comment>
      <origin>2809679</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="67489" sha1="h1xotbrr6n72gtmrkohhm9nleyyndkd" xml:space="preserve">    
----
----&lt;nowiki&gt;**&lt;/nowiki&gt;Please ''login'' in Wikiversity and then use the ''&lt;nowiki/&gt;'edit''' button: your edition mode will be 'WYSIWYG'. Each Candidature with its manifesto can take inspiration from those for previous years.  

''Decision of the 2025 General Assembly 27th April:''

''The 2026 elections are starting the 27th April, the date of the General Assembly:''

''(i) There will be an election for Vice-President starting the 27 April 2026.''

''(ii) To save time and effort - Instead of an election for 1/3 of the Executive Committee'' ''(EC) for 2025 we propose to keep the existing EC and invite members of the Council '''not on the EC''' to offer themselves as members of an enlarged Executive Committee. If less than six people propose themselves, they will be co-opted onto the Executive Committee. If more than six propose themselves we will hold an election for 1/3 EC.''

The deadline for your candidature is Saturday 16th May 2026 at 24:00 CET. 

== Candidature for the New Vice-President for [2026, 2027] ==
 
'''Manifesto – Candidature for New Vice-President of UNESCO UniTwin CS-DC'''

New Candidatures to the Executive Committee for [2026]
=== Manifesto – Candidature for the Executive Committee of UNESCO UniTwin CS-DC ===

===== Prof. Daniel Schertzer, Ecole nationale des ponts et chaussées =====

Dear UNESCO CS-DC Councillors,

I am writing to express my sincere interest in serving as a member of the Executive Committee of UNESCO UniTwin CS-DC. I am deeply committed to fostering the community of complex systems and am eager to contribute to the organisation of this talented group.

I am particularly interested in the “living roadmap” of CS-DC, a unique feature that operates through two complementary strategies. Firstly, it addresses major transversal problems, and secondly, it focusses on classes of complex systems. This integrative systems framework is particularly pertinent to geosciences, which are increasingly integrating urban sciences, sustainability science, territorial planning, computational modelling, socio-ecological intelligence, and digital governance.

Consequently, TIME—Territorial Intelligence for Multilevel Equity and Sustainability—is built on this integration process and is one of CS-DC’s principal flagship projects. The new chalenge with TIMES is to do it across scales, not only at an arbitrary scale. I possess extensive international experience as a scientist, mentor, leader, organiser, and editor, which I believe would be valuable assets to this role.

Sincerely,
Daniel Schertzer
[https://hmco.enpc.fr/team-view/daniel-schertzer/ Short CV of Daniel Schertzer]


'''Flavia Mori SARTI, Ph.D., Professor and Researcher, University of Sao Paulo, Brazil'''

I present my interest in being candidate for the CS-DC Executive Committee to contribute to the dissemination of knowledge in complex systems at the local and global level. I am representative of the University of Sao Paulo (USP) at the CS-DC since 2012. I work with complex systems modeling since the creation of the Interdisciplinary Research Group of Complex Systems Modelling at the School of Arts, Sciences and Humanities (EACH-USP) in 2006. Our research group succesfully implemented the first interdisciplinary graduate program titled Master in Complex Systems Modeling in Brazil, in 2010. I have been participating in the program commission since 2010, and I was coordinator of the graduate program from 2010 to 2014.

I have supervised 12 students in the program and two postdoctoral fellows, followed by publication of several book chapters and papers on complex systems applied to public policies, including models on tax evasion, health systems regulation, health insurance, food policy and nutrition programs, and complex networks on scientific collaboration and global food trade. I have been invited to present seminars and talks on complex systems applied to food systems, health economics, and public policy.

My goals in the CS-DC Executive Committee include:

* To disseminate the role of CS-DC in education and research on complex systems, especially in developing countries;
* To support and to engage other research groups working with complex systems for participation in the CS-DC;
* To contribute further with management and organization of CS-DC activities during the period of 2022-2024;
* To continue supporting capacity building in complex systems through supervision and other academic activities;
* To foster innovation, research and development strategies through complex systems applications in public policy and entrepreneurship.


'''Alberto A. Rasia-Filho, MD, Ph.D, Professor and Researcher, Federal University of Health Sciences of Porto Alegre (UFCSPA) and Federal University of Rio Grande do Sul (UFRGS), Brazil'''

Dear Councilors of the UNESCO CS-DC,

It is an honor to submit my candidacy for the CS-DC Executive Committee for 2026. Please let me introduce myself as a Full Professor of Physiology (UFCSPA), Supervisor in the Biosciences (UFCSPA) and Neuroscience Graduate Programs (UFRGS), and a researcher on human neuronal morphology, dendritic spines, synaptic plasticity, and social/emotional neural networks (National Council for Scientific and Technological Development, Brazil). Professional Identifier/ORCID: 0000-0003-4623-5916.

Currently, I am participating as head of the e-Team &quot;Morphological Heterogeneity&quot; in the UNESCO CS-DC, led by Prof. Enver Oruro Puma, Principal Investigator of the Morphodynamic Neuroscience and Behavior eLab CS-DC, and Prof. Grace E. Pardo, Scientific Research Institute, Continental University of Cusco, Peru. We integrate morphodynamics across different scales of brain organization and neural network functions in complex systems, considering neuronal morphology itself as an emergent level of organization. The structure of neural cells and their connectivity within the brain volume are morphodynamic features with interactions from cellular morphogenetic elements, the local cell neighborhood, and synaptic connections. In turn, the emergent functions of networks are organized around a series of conceptual, experimental, and computational foundations.

These ideas were developed—and are now open to additional discussions—in the recent article from our group: “New Directions for Complex Systems in Contemporary Neuroscience: A Morphodynamic and Emergent Function Approach” (Research Topic: Theoretical and Computational Insights into Brain-Based Cognition/Frontiers in Computational Neuroscience). This represents an ongoing research line available for further collaborations in Complex Systems Science.

I will be (1) committed to the Action Plan 2026 (and beyond) from the current 2026-31 Action Plan/Complex Systems Digital Campus UNESCO UniTwin, (2) working to integrate interdisciplinary approaches and eTeams, sharing knowledge and opportunities for complex systems education and research, as well as (3) contributing to country and continent engagement and representation in line with worldwide aims, (4) including the academic formation of young scientists.
----'''Norberto Garcia-Cairasco, BSc, MSc, PhD, Full Professor of Physiology-Neurophysiology, Ribeirão Preto School of Medicine, University of São Paulo (FMRP-USP), Ribeirão Preto, São Paulo State, Brazil.'''

Dear Councilors of the UNESCO CS-DC,

It is an honor for me to submit my candidacy for the CS-DC Executive Committee for 2026. Please, let me introduce myself as a Full Professor of Physiology-Neurophysiology, Ribeirão Preto School of Medicine, University of São Paulo (FMRP-USP), Ribeirão Preto, São Paulo State, Brazil. At FMRP-USP, I am Supervisor (Master and PhD) at both Graduate Programs in Physiology and Neurology/Neuroscience &amp; Neuropsychiatry. I have been the Founder and the Director for almost 40 years of the Neurophysiology and Experimental Neuroethology Laboratory, where we conduct research in the characterization of epilepsies and associated neuropsychiatric comorbidities, using behavioral, electrophysiological, cellular, molecular and computational integrated tools, in both experimental and collaborative clinical settings. Our main funding comes from the State of São Paulo Foundation (FAPESP), the Federal agencies National Council for Research (CNPq) and the Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES). Professional Identifier/ORCID: &lt;nowiki&gt;https://orcid.org/0000-0001-8857-3775&lt;/nowiki&gt;.

I am currently the Head of the e-Team “'''Epilepsy and Neuropsychiatric Comorbidities”''' in the UNESCO CS-DC, led by Prof. Enver Oruro and Prof. Grace E Pardo, Principal Investigators of the Neurocomputing, Social Simulation, and Complex Systems Laboratory at the Instituto Científico of Universidad Continental del Cusco, Peru. 

Complex systems are involved in abnormal functioning and the refractoriness to pharmacological approaches of epileptogenic neural circuits, with additional multilevel complexity derived from associated, usually neuropsychiatric comorbidities. We, indeed, propose that the morphodynamics of neurons and glia in neural circuits can be studied as an initial step toward understanding proper wiring and stable properties, including neurotransmitters, neuromodulators, receptors, and intracellular signal transduction components, as well as plastic features, environmental stimuli, attention, and learning. These ideas were developed, and are now open to additional discussions, in the recent article from our group: “New Directions for Complex Systems in Contemporary Neuroscience: A Morphodynamic and Emergent Function Approach” (Research Topic: Theoretical and Computational Insights into Brain-Based Cognition/Frontiers in Computational Neuroscience). This represents an ongoing research line available for further collaborations in Complex Systems Science. 

I will be (1) committed to the Action Plan 2026 (and beyond) from the current 2026-31 Action Plan/Complex Systems Digital Campus UNESCO UniTwin, (2) working to integrate interdisciplinary approaches and eTeams, sharing knowledge and opportunities for complex systems education and research, as well as (3) contributing to country and continent engagement and representation in line with worldwide aims, (4) including the academic formation of young scientists.

In addition to the above-mentioned agenda and goals, I will offer, for the leverage of outreach activities, my experience of more than four decades in the '''''Neuroscience &amp; Arts''''' connection. In fact, I am co-Founder of the “Brain Awareness Week” in Brazil (since 2012) and currently the Coordinator at the Institute for Advanced Studies at USP-Ribeirão Preto of the “'''''Science, Arts, Education and Society Network - ScienArtES'''''”. In 2022, I received the Title of ''Doctor Honoris Causa'' (Biology) from the Universidad de Salamanca, Spain. Finally, I am also, since 2026, a Member of the Brain Literacy Initiative Alliance: Uniting for Brain Research-Informed Education Worldwide. 
----

== Candidature for the New President for [2025, 2026] ==
 
'''Manifesto – Candidature for New President of UNESCO UniTwin CS-DC'''

'''Prof. Paul Bourgine''' : 

If elected, my main commitment is to create the conditions for a self-organized development of our UNESCO UniTwin CS-DC as autonomous communities of communities for our flagship TIMES and its Knowledge &amp; Knowhow Accelerator one-for-all &amp; all-for-one (KKA). We know now how to realize —for the two above commitments— the 3&lt;sup&gt;rd&lt;/sup&gt; UNESCO commitment, i.e., the ‘computational ecosystem’. It will use the mature part of Web 3.0, especially the InterPlanetary File System (IPFS). Thanks to our previous efforts especially of the two last years, the remaining work amount is ten times less than we were anticipating at the beginning of the 2&lt;sup&gt;nd&lt;/sup&gt; renewal of our UniTwin by UNESCO 2020-2026.  

If elected, my duty will be not only to fulfill entirely the commitments of our Cooperation Program with UNESCO but also starting an exponential increasing development wave for our UniTwin network (through their continent and country Councils) and of our e-Campus (through CS-DC’25 and e-Labs’26 Conferences especially for our Flagships for sustainable development). The Knowledge &amp; Knowhow Accelerator will directly benefit from 1) such conference series, 2) our past and new flagships for sustainable development and 3) a new decentralized strategy for collecting donations in our decentralized network of X-Legal Entities.

== New Candidatures to the Executive Committee for [2025] ==

=== Manifesto – Candidature for the Executive Committee of UNESCO UniTwin CS-DC ===
'''Prof. Silvius STANCIU, PhD in Economics, PhD in Engineering, Habil.'''

Full Professor, “Dunărea de Jos” University of Galați (UDJG), Romania

Editor-in-Chief, ''Journal of Agriculture and Rural Development Studies (JARDS)''

Former Vice-Rector, Former Director of DFCTT and CTT UGAL
----'''Dear Councillors,'''

It is a great honor for me to submit my candidacy for the Executive Committee of the UNESCO UniTwin Complex Systems Digital Campus (CS-DC). With more than '''30 years of experience in academia''', I am currently Full Professor and doctoral advisor at “Dunărea de Jos” University of Galați (UDJG), Romania — a public research university with a strong regional impact and a long-standing tradition in interdisciplinary education and innovation.

I hold two doctoral degrees — one in Economics and one in Engineering — and I am a habilitated professor. I have published '''163 ISI-indexed scientific articles''' and have a '''Clarivate H-index of 14'''. My research focuses on '''food security, circular economy, technological innovation, rural development''', and '''complex systems in agro-food value chains'''.

I am the founder and coordinator of Romania’s first doctoral program in ''Engineering and Management in Agriculture and Rural Development (IMADR)'', with '''9 PhD graduates''' and '''9 doctoral students''' currently under my supervision. I also serve as '''Editor-in-Chief''' of the ''Journal of Agriculture and Rural Development Studies (JARDS)'', dedicated to interdisciplinary research in sustainable food and rural systems.

Over the past decade, I have been involved as director or expert in '''more than 45 national and international research projects''', including Horizon-compatible initiatives and cross-border cooperation programs. I coordinated a '''Romania–Republic of Moldova cross-border project''' (2020–2021) and currently lead '''two new ROMD-funded projects''' entering implementation.

My former institutional leadership roles include:

* '''Vice-Rector for Research and Innovation'''
* '''Director of the Department for Institutional Development (DFCTT)''' and of the '''Technology Transfer Center (CTT UGAL)'''
* '''Member of national and international quality and research bodies''', including CNATDCU, ARACIS, and CMPTJ

----'''If elected, I am committed to:'''

* Expanding the CS-DC network in '''Eastern Europe and the Black Sea region''', enhancing scientific and territorial diversity;
* Supporting '''POEM''' and '''FOOD flagship programs''' through digital education, doctoral/postdoctoral collaboration, and innovation ecosystems;
* Promoting '''open science''', international e-seminars, and interdisciplinary MOOCs;
* Coordinating thematic initiatives in '''agro-complexity, food systems resilience''', and '''sustainable rural innovation'''.

As a representative of a '''UniTwin member institution''', I see this candidacy as a unique opportunity to strengthen UDJG’s role within the CS-DC ecosystem. I fully embrace the CS-DC mission to foster global collaboration, education, and research in complexity science.

I am ready to bring '''vision, experience, and energy''' to the Executive Committee and help shape the future of our UniTwin community.
----'''Sincerely,'''

'''Prof. Silvius STANCIU, PhD in Economics, PhD in Engineering, Habil.'''

Representative of “Dunărea de Jos” University of Galați (UDJG)

'''Professional Identifiers:'''

* Web of Science Author ID: R-8246-2017
* ORCID: 0000-0001-7697-0968
* Scopus ID: 36633317700
* Google Scholar: Silvius Stanciu
* ResearchGate: Silvius Stanciu

== New Candidatures to the Executive Committee for [2024] ==

'''Enver Oruro Puma, Ph.D., Principal Investigator of Neurocomputing, Social Simulation, and Complex Systems Laboratory at the Instituto Científico of Universidad Andina del Cusco, Peru''' 

Dear Councillor of the UNESCO UniTwin CS-DC. I am very honored to place my candidature for the UNESCO UniTwin CS-DC Executive Committee. I am Enver Miguel Oruro Puma, Ph.D., principal investigator of Neurocomputing, Social Simulation, and Complex Systems Laboratory at the Instituto Científico of Universidad Andina del Cusco, Peru (https://sites.google.com/view/orurolab/). Since 2009, I have promoted and organized conferences and academic events on Complex Systems in Latin America. Recently, I have promoted the area of computational neuroscience on infant attachment (https://sites.google.com/view/envermiguel/seminar-in-maternal-infant-relationship-studies).

It would be a great honor for me if given the opportunity to contribute to the Executive Committee of UNESCO UniTwin CS-DC in the integration of Complex System research groups in the Latin American Region. For this, I propose the creation of two periodical activities: 1) A Special Lectures Series on Complex Systems UNESCO UniTwin CS-DC oriented to experts on Complex Systems, and 2) A Invited Advanced Lectures UNESCO UniTwin CS-DC oriented to experts who do not identify explicitly with complex systems

'''Pierre Collet, full professor of Strasbourg University, on secondment to Universidad Andrés Bello, Instituto de Tecnología para la Innovación en Salud y Bienestar, Viña del Mar, Valparaiso, Chile'''.

Since 2012, I have contributed to the elaboration of the CS-DC Unesco UniTwin together with Paul Bourigne, Jeffrey Johnson and many others, and I have been co-coordinator of the CS-DC UniTwin with Cyrille Bertelle since its creation in 2014. Starting part of this great adventure has changed my academic and personal life: thanks to the UniTwin, I have changed my research from stochastic optimisation, artificial evolution and AI in general to complex systems and epistemology.

Participating in this UniTwin allowed me to make new contacts and start incredible projects that I could not have imagined before. It has even changed my life, as I am now living in Chile, having been recruited by ITISB, an institute founded by Carla Taramasco, the CS-DC representative for South America.

Together with Paul and others, we would like to revive UniTwin by preparing another world conference inspired by the great success of [https://cs-dc-15.org CS-DC'15] and also develop flagship projects such as POEM (Personalised Open Education for the Masses) and the [https://en.wikiversity.org/wiki/Portal:Complex_Systems_Digital_Campus/E-Laboratory_on_complex_computational_ecosystems ECCE e-lab], which this year has welcomed a new very active [[Figures of Play/Les figures du Jeu e-team|Figures of Play]] that has started the [https://ludocorpus.org/ Ludocorpus] in France.

As said before, this incredible UniTwin adventure always pays off for those who invest in it and in its great challenge: to develop the new science of complex systems through research and education. Through its projects, it contributes to making the world a better place to live in, despite the constant attacks on science coming from the most unlikely places.

Science is the solution, not the problem, to many of the world's plagues. We must put our energy into developing it and defend it against all its detractors.

That is why I am once again standing for election to the Executive Committee of this great CS-DC UniTwin. Modern science is Complex Systems science. It is important that its beacon continues to illuminate the world, and we must invest our time and energy in it.

== Candidature Deputy President for [2024, 2025] ==
'''Jeffrey JOHNSON, Professor of Complexity Science and Design, The Open University, UK'''

I offer myself as a candidate both to be President and to the Executive Committee of The UNESCO UniTwin Complex Systems Digital Campus (CS-DC) so that I can help to drive it forward to achieve it goals.

I am particularly committed to our educational efforts. I have made four MOOCs on the FutureLearn Platform for CS-DC ( &lt;nowiki&gt;https://www.futurelearn.com/partners/unesco-unitwin-complex-systems-digital-campus&lt;/nowiki&gt; ): Global Systems Science (2015-16); Systems Thinking and Complexity (2017-18); First Steps in Data Science with Google Analytics (2018-19) and COVID-19 - Pandemics, Modelling and Policy (2020). CS-DC has a great opportunity to become the global university providing interdisciplinary education for a better world.

I am also committed to our research mission with UNESCO towards the achieving the U.N. Sustainable Development Goals. My own research on representing the dynamics of complex multilevel systems is relevant to many of the research initiatives of CS-DC.

I have extensive experience working within the complex systems community. I have run various coordination actions supporting research programmes funded by the European Commission, I am a founder member and past president of the Complex Systems Society, and I am Deputy-President of the CS-DC. I believe this experience will enable me to make a significant contribution the CS-DC over the next three years.

== New Elected President for [2023, 2024] ==
Paul BOURGINE, present President of the UNESCO UniTwin CS-DC, Complex Systems Institute of Paris 
I offer myself as a candidate to be President of The UNESCO UniTwin Complex Systems Digital Campus (CS-DC).
My previous commitment two years ago is below. The bad news is that it was not achieved. The good new is that we know now how to create 'autonomous community of autonomous communities' as a social network with IPFS (the InterPlanetary File System) like the new development of Wikipedia. 
If elected, my first commitment is to finish this job as quickly as possible. My second commitment is simultaneously to visit each country of the UniTwin for creating its country.CS-DC and its roadmap with young eTeams shared by their Universities with a senior scientific committee. The eTeam projects will have the opportunity to be submitted to the EU calls or other ones. 

Enver Oruro PhD, Head of Neurocomputing, Social Simulation and Complex Systems Laboratory, Universidad Andina del Cusco, Peru.
'''I would like to nominate Professor Paul Bourgine.'''

== New Elected Members to the Executive Committee for [2022,2023, 2024,2025] ==
'''2Dr Mohamed Abdellahi (Ould BABAH) Ebbe, Mauritania,''' 

* Senior Advisor for the CILSS Executif Secretary for international Partnership and formal General Director of the     Institut du Sahel/CILSS www.insah.org;

·       Commissionaire General of CILSS for Horticulture Universal  Expo of DOHA 2023-2024   &lt;nowiki&gt;https://www.dohaexpo2023.gov.qa/en/&lt;/nowiki&gt; with central thems:

'''CENTRAL THEME: GREEN DESERT, BETTER ENVIRONMENT'''

* Executive Director of the     Orthopterist Society (400 researchers among the globe) &lt;nowiki&gt;https://orthsoc.org/&lt;/nowiki&gt;
* We have organized our last     congress during 16-20 0ctober in Merida Mexique

&lt;nowiki&gt;https://ico2023mexico.com/&lt;/nowiki&gt;

By obtaining the honor of having your hoped-for confidence for continuing this post of member of the executive council of the CS-DC, I will work, in priority and in the short term on two main subjects:

## '''The transboundary plague of the     Desert Locust (Schistocerca gregaria (Forska l , 1775))''' This plague of the Desert     Locust of more than 3000 years that cites all our holy books (the Tourah,     the Bible and the Koran) and which continues to be present to this day and     to wreak devastating devastation. In case of invasion, it can affect the     agriculture and pastures of about 25 countries including those of the     poorest countries of the world, from Mauritania to India, while its best     and most effective strategy of struggle is preventive struggle by     targeting its first centers of gregarization which are very small in space     and much better known today. In 2005, the costs of its struggle in the     Sahel and North Africa amounted to half a billion dollars, with 8 million     farmers and pastoralists affected in the Sahel. It also massively invaded     Asia and Africa. 'East Africa in 2020. On this subject, I have spent 30     years studying and fighting and developing a national strategy against     this scourge which has made it possible to establish a whole prevention     model and an institutional, technical, operational mechanism. and     scientific effective in my country that can be adapted and copied and in     all other affected countries: Biogeography of the desert locust     Schistocerca gregaria, Forskal, 1775: Identification, characterization and     originality of a gregarious focus in central Mauritania (HR.HORS COLLEC.)     (French Edition) - Babah Ebbe, Mohamed Abdallahi | 9782705670573 |     Amazon.com.au | Books &lt;nowiki&gt;http://www.worldbank.org/en/news/feature/2010/01/07/improved-ways-to-prevent-the-desert-locust-in-mauritania-and-the-sahel&lt;/nowiki&gt;,     http: //     whatsnext.blogs.cnn.com/2012/02/02/in-mauritania-sunny-with-a-chance-of-locusts/ I was invited last year by Royal Society 20-21 may 2024 to moderate one session on locust research management (La plasticité des criquets et des abeilles dans un monde en mutation | Société royale) and in a “International Conference on New Technology and Concepts for Sustainable Management of Locusts and Grasshoppers” held from 2 to 7 June 2024 in Jinan, Shandong, China.We are also preparing our Orthopterist congress in Argentina during the next mars 2026  &lt;nowiki&gt;https://ico2026.com.ar&lt;/nowiki&gt;

'''All this is in addition of more than 110 publications or joint publications on the locust, its environment and management''' 

# '''Senior Adviser to the CILSS Executive Secretary for International Partnerships'''] [Assistance to Mauritania (or 3 months) in the preparation of the organisation of the Nouakchott+10 High-Level Forum on pastoralism held in Nouakchott from 6 to 8 November 2024, various advising for the international partnership and the mobilization of resources including preparation of the organization of a round table planned in OPEC Vienna Austria for the mobilization of Arabic and Islamic funds for the financing of the CILSS 2050 strategic plan
# '''The Sahel Institute (INSAH)     www.insah.org of the Permanent Interstate Committee for Drought Control     (CILSS)''' that I     lead and which has been doing extraordinary work for almost half a century     in the field of research and development of animal and plant production     techniques and also in the field of support for demographic, population     and development policies, in favor of the populations of our 13 Sahelian,     coastal and island member countries. This work covered the majority of     good practice technologies in the field of plant and animal production,     natural resource management, land rstauration, cultivation techniques,     post-harvest, machining, dehulling operations technology. / ginning,     Conservation and storage, good resilience practices

Research on the demographic dividend, gender and the empowerment of women and the Population / Development interrelations ... etc The results of all this work are contained in a database. data, online &lt;nowiki&gt;http://publications.insah.org/&lt;/nowiki&gt;, containing more than 1,500 books, scientific and technical articles that will have to be modernized and connected to the CS Meta data.

As General Commissionaire  of CILSS for Horticulture Universal  Expo of DOHA 2023-2024   &lt;nowiki&gt;https://www.dohaexpo2023.gov.qa/en/&lt;/nowiki&gt; with central thems:

'''CENTRAL THEME: GREEN DESERT, BETTER ENVIRONMENT''' I am working  in introducing as detailed below:

'''CILSS ''contribution to the improvement of sustainable horticultural agricultural production in a context of drought''''' 

'''I. PRESENTATION OF THE EXPO'''  

Expo 2023 in Doha is part of the fight against desertification. The Expo will be held from 2 October 2023 to 28 March 2024 under the theme &quot;'''''Green Desert, Better Environment'''''&quot;. The aim is to encourage, inspire and inform people about innovative solutions to reduce desertification. The exhibition will provide an international platform for participants, stakeholders, decision-makers, nongovernmental organizations and experts to address the global challenge of &quot;desertification&quot;, while making a valuable contribution to achieving a sustainable future. During the 6 months of the Expo, nearly 3 million visitors from over 80 countries are expected

The objectives of this Expo are in line with those of the CILSS, which seeks to improve the living conditions of the people of the Sahel in a sustainable manner. This is why the participation of CILSS in this Expo is important for the region and its vulnerable populations. 

'''OBJECTIVES OF EXPO 2023 DOHA, QATAR'''

Expo 2023 Doha, Qatar is defined by the following objectives:

-   Encourage horticultural innovation by focusing on Qatar's climate, water and soil.

-   Promote Expo 2023 in Doha, Qatar, as a catalyst for international investment and business opportunities.

-   To propose innovative actions that would allow humanity to fight against desertification more quickly and decisively before it is too late.

-   To build up useful environmental outputs for future generations.  

'''II. ORGANISATION OF THE CILSS PARTICIPATION'''

'''II.1. GOALS OF CILSS EXHIBITION:''' 

1. Sharing experiences and best practices,

2. Building International Partnership,

3. Promoting technology and innovation

Finally, I will continue to work actively with my colleagues on the Executive Board on all aspects of other cross-border scourges but also all aspects of improving agro-sylvo-pastoral production


'''Dr. Xabier E. Barandiaran, Lecturer at the University of the Basque Country (UPV/EHU), Department of Philosophy, Donostia - San Sebastian, Spain'''

I would like to present [https://xabier.barandiaran.net myself] as a candidate for the Executive Committee. I have been the representative and coordinator between CS-DC and the [https://ehu.eus University of the Basque Country] since 2013. I develop my academic research at the [https://ias-research.net IAS-Research Centre for Life, Mind, and Society], with a focus on the understanding of autonomous and complex adaptive systems (from biology to cognition, from brains to societies). I am the author of over 50 indexed publications on topics related to complex systems, philosophy of mind, complex epistemology, simulation models of the origins of life, minimal agency, evolutionary robotics, complex social network analysis, etc. I recently received the “Award for Distinguished Early-Career Investigator” by the International Society for Artificial Life. Overal I have been awarded with 7 different grants and have actively participated on 15 different research projects. I have also supervised 2 PhD thesis (4 more still in development) and I hold an extensive record of scientific and innovative management experience in different academic and public institutions as founder of research networks ReteCog.Net and FLOK Society – Buen Conocer and head of RDI at Barcelona City Council (2016-2018). I have also organized several national workshops, summer schools and conferences, and 2 international summer schools, 4 international workshops and one international conference. I am currently the Principal Investigator of a founded research project (with more than 30 research-collaborators) on a complex systems' approach to the concept of autonomy beyond its classical conception as an individual bounded property.

As part of my university's goal of fostering international collaboration and opening up e-learning and research initiatives I would like to get more deeply involved on CS-DC with the following goals:

* To desing the infrastructure, learning-experience, research-experience and content for distributed, open access and high-quality digital campus facilities.
* To involve local agents (student, teachers, researchers and institutions) on the initiative of the network.
* To foster collaboration, co-production and resource sharing between teaching and research facilities between priviledged richer countries and lower-income ones. In particular, but not exclusively, and for obvious reasons related to sharing the same language, to foster ''collaboration between European and Latin-american universities'', research initiatives and students through CS-DC.
* To develop at least one ''prototype'' of a MSc level online course (and research network module) around complex cognitive systems that can serve as a model for the other fields of the network.
* To develop a clear conceptual and communicative framework for CS-DC to be able to attract more participants, resources and broader attention and success as pioneering international initiative.


'''Dr. habil. László Barna Iantovics, Professor at “George Emil Palade” Univ. of Medicine, Pharmacy, Science and Technology of Tg. Mures, Romania'''

With the present manifesto, I would like to be a candidate for the CS-DC Executive Committee. I have been the representative of “George Emil Palade” University of Medicine, Pharmacy, Science and Technology of Targu Mures from Romania in CS-DC by many years.

Some of my research and academic activities were related to the complex systems, including: publications; organized conferences (e.g. Symposium on Understanding Intelligent and Complex Systems - UICS 2009; 1st Int. Conf. on Complexity and Intelligence of the Artificial and Natural Complex Systems Medical Applications of the Complex Systems. Biomedical Computing -CANS 2008; 1st Int. Conf. on Bio-Inspired Computational Methods Used for Difficult Problems Solving. Development of Intelligent and Complex Systems - BICS 2008); membership in conference committees (e.g. Int. Conf. Emergent Properties in Natural and Artificial Complex Systems - EPNACS 2007; Workshop on Complex Systems and Self-organization Modeling -CoSSoM 2009); Journal Special Issues (e.g. Special Issue on Complexity in Sciences and Artificial Intelligence; Special Issue on Understanding Complex Systems); membership in Journal’s Editorial Boards (e.g. Complex Adaptive Systems Modeling -CASM, SpringerOpen), and contribution to research performed in projects and projects coordination (Social network of machines- SOON; Hybrid Medical Complex Systems -ComplexMediSys). I am the director of the Research Center on Artificial Intelligence, Data Science and Smart Engineering (Artemis).

I would like to involve myself much deeper in the life and activities of the CS-DC community.

My principal objectives are:

* To involve junior and senior researchers from my university in activities regarding research and education related to complex systems.
* To involve universities and research institutes to actively contribute to the CS-DC development.
* To involve myself in the joint coordination with other CS-DC members of a doctoral and postdoctoral students’ group that will be involved in the CS-DC community works.
* To strengthen the research direction with the theme: applications of intelligent complex systems and machine intelligence measuring. One of the subtopics of interest will be the application of complex systems, artificial intelligence and data science in medicine, pharmacology, and healthcare.


'''Flavia Mori SARTI, Ph.D., Professor and Researcher, University of Sao Paulo, Brazil'''

I would like to present my candidature for the CS-DC Executive Committee in the period 2022-2024 to contribute to the dissemination of Complex Systems Science.

I have been representative of the University of Sao Paulo (USP) at the CS-DC since 2012, and I have been working with complex systems since the creation of the Interdisciplinary Research Group of Complex Systems Modelling at the School of Arts, Sciences and Humanities (EACH-USP) in 2006. Our research group succesfully implemented the first interdisciplinary graduate program (Master) in Complex Systems Modelling in Brazil, in 2010. I have been participating in the coordinating commission of the program since 2010, and I was coordinator of the graduate program from 2010 to 2014.

I have supervised seven students in the Master program, which resulted in thesis, book chapters, and papers published on the subject of complex systems, including models on tax evasion, health systems regulation, food policy and nutrition programs, and complex networks on scientific collaboration and international food trade. I also contributed to the organization of the e-Session &quot;Economics as a Complex Evolutionist System&quot; on the CS-DC'15 World e-conference in 2015, and have been invited to present seminars on complex systems applied to health economics, health technology assessment, and public policy of nutrition and health.

My goals in the CS-DC Executive Committee include:

* To disseminate the role of CS-DC in education and research on Complex Systems, especially in Brazil and other developing countries;
* To support and to engage other research groups working with Complex Systems for participation in the CS-DC;
* To contribute further with management and organization of CS-DC activities during the period of 2022-2024;
* To continue supporting capacity building in Complex Systems through the Complex Systems Modelling Program at USP;
* To participate in innovation, research and development activities based on the application of Complex Systems in public policy and entrepreneurship.


'''Pr Panos Argyarakis, Professor in the University of Thessaloniki, Greece.'''

I have been with the Complex Systems Society since its inception in 2004 by participating in the NEST projects Dysonet and Giacs which created CSS. My experience in the Executive Committee will be to contribute towards the spreading of the Complexity idea to various levels of education throughout the different countries. I am currently the PI in an Erasmus+ network that introduces new models of teaching and investigating how is education been affected for future generations. I can contribute in decision making for such important activities, and also serve as liaison with the European Commission, and the Complex Systems Society, due to my past experience. I have extended organizational experience by organizing several internationally meetings in this field that were attended by large audiences. My research interests are related to Complex systems and Networks. Scale-free, random, and small world networks. Dynamic properties on networks, Diffusion, spreading phenomena on networks, disease spreading. Phase transitions, percolation model, reaction-diffusion processes, trapping processes. Random walks.


'''Ali Moussaoui, Professor, University of Tlemcen, Department of Mathematics, Algeria,'''

I wish to present my candidature to become member of the executive committee of the CS-DC, I wish to develop collaborations with the partner universities in the field of complex systems. I wish to participate in the creation of international mixed laboratories and international masters on complex systems.

In the past, I was responsible for a master's degree entitled: modeling of complex systems in our department, I am currently responsible for a research team entitled: Modeling of complex systems in our laboratory, I was responsible for a Franco-Algerian project on the modeling of complex systems. My research skills are focused on the modeling of complex natural and biological systems.

'''Carlos Gershenson, Research Professor, Universidad Nacional Autónoma de México.'''

I was involved with CS-DC in its initial years in UNESCO's UniTwin, also representing UNAM. I have been editor-in-chief of Complexity Digest since 2007. I co-organized the Conference on Complex Systems in 2017. I am currently vice-president secretary of the Complex Systems Society (CSS).

I am a strong proponent of open online learning. I managed to start a collaboration between UNAM and Coursera, which has led to more than a hundred MOOCs and millions of enrolled students.

I would be interested in strengthening the relationship between CS-DC and CSS, as well as other organizations.

==Elected members to the Executive Committee for 2021 ==
'''Carlos J. BARRIOS H., PhD., Professor, Bucaramanga, Colombia '''

I write to express my interest to candidacy to be part of the CS-DC Executive Committee. I'm very motivated to develop actions to strengthen digital ecosystem supporting research and education proposals of our CS-DC Council. Among these years participating in the CS-DC group, I can see different ways to leverage the impact and the development of our actions with computational strategies, and now, I want to be part of the leadership council joined mutual visions.

My experience leading the Advanced Computing System for Latin America and Caribbean (SCALAC : http://scalac.redclara.net ) and as member of other leadership boards in international projects (mainly between Europe and Latin America) supports my candidature. (linkedin.com/in/carlosjaimebh) Also, my role as professor, director and researcher contributes to build the common vision of the CS-DC Council and the leadership of the CS- DC Executive Committee.


'''Mina TEICHER, Professor of Bar-Ilan University, Israël'''

I submit my candidacy to the Executive Committee of the CS Digital Campus. If elected I will work towards our following needs, using my past experience in Professional international societies, universities managements and the data industry : 

* We need in the near future to build an optimal and effective agreement with the Complex System Society.
* We need to build a business  plan for fund raising.
* We need to build a modular budget for 2021.
* We need to build a strategy for geographically extension. 
* We need to build a strategy for thematic  extension. 
* We need to build partnerships with the big multi national high tech Companies in network and in content. 


'''Yasmin MERALI, Professor of University of Hull, UK'''

This manifesto is connected with the ideals that I had as a founding member of our UniNet which was conceived as part of the FP7 ASSYST project.
CS-DC has come a long way since its initial conception. The way I see it, there are three categories that have grown to emerge as our core activities- 
* Capacity building through education and training in Complex Systems Science
* The application of Complex Systems Science to address global challenges
* The advancement of Complex Systems Science through research and development.

I believe this is a good time to link back to the inception of our UNITWIN which was in part inspired by considerations of issues at a human scale, and the desire to address the inequalities that divided the so-called developed and developing countries. This resonates strongly with the ambition of the  Sustainable Development Goals (SDGs) we are currently grappling with.
In the growth phase of the UNITWIN and CSDC we have been focused on extending the size of the network, and scaling up our educational offerings across the digital campus. In the next phase I believe we need to:
# understand and leverage the diversity and distinctive capabilities and resources (e.g. indigenous knowledge) of the countries in our network to develop a healthy ecosystem, and
# tailor the support that we provide to align with the diverse nature of their relational and social capital and their economic, political and environmental challenges and priorities with regard to the SDGs.  

I am concerned that if we do not explicitly design a social/ideational exchange mechanism that attends to these two imperatives, we will not have full, active participation of all member institutions, and the countries of the South that do not currently have champions in Europe will be marginalized.

If elected I would champion a strategy of organizing ourselves following the Complex Adaptive Systems paradigm, as a hyper network with dynamically connected local clusters. In practical terms I would like to begin by establishing the local (country-based) clusters and establishing a discourse that would allow us to map the diverse profiles, challenges and aspirations for the different countries. This would then form the basis for the development of a mechanism for shaping the meaningful collaborative development of our three core activities to deliver advances that are globally co-ordinated and locally responsive.

Personal Profile: I am Professor of Systems Thinking at the University of Hull and have served as Director of the Centre Systems Studies there. Prior to that I was Co-Director of the Doctoral Training Centre for Complex Systems Science at the University of Warwick. My research is transdisciplinary, focusing on the use of Complex Systems Science to enhance the resilience of socio-economic systems. I am an Expert advisor to the EU and I have significant experience of lecturing internationally as Visiting Professor in Asia, Europe and the USA.

'''Céline ROZENBLAT: Professor, University of Lausanne - Institut de géographie et de durabilité (IGD), Switzerland'''

I'm pleased to applied to become member of the CS-DC council.
As founding member of CS-DC, my university, the university of Lausanne, is very engaged in Complex sciences.
I would not only represent my university, but also social science as geographer and vice-president of the International Geographical Union and member of the International Science Council commission on Urban Health and Well being.
I would act in the council in specific programs to develop the reality of the Digital Campus of the Complex systems.

All these actions combine very ambitious interdisciplinary approaches, and in this perspective, we developed with CS-DC for 3 years the TIMES Flagship  Territorial Intelligence For Multilevel Equity And Sustainability. It comprises four main programs:

 '''SIRE''': Socially Intelligence Roadmap Ecosystem
 '''POLE:''' Personalized Open Lifelong Education
 '''WOSI:''' Worldwide Open Smart Innovation
 '''WOSP:''' Worldwide Open Stochastic Prediction 

In this perspective a MOOC « Healthy Urban system » is now in development, basing the interdisciplinary approach on the CS-DC Road-Map grid. It seems very useful and relevant in this implementation stage.
I would help to develop other programs in this perspective\[Ellipsis]


'''André TINDANO, Director General of CARFS (African Center for Research and Training in Synecoculture)'''

What motivates me to aspire to the position of member of the executive committee of CS DC is my long term participation in the promotion of sustainable development and my commitment to the sharing of knowledge and expertise.

My research interests Sustainable agriculture, ecology, nutrition, life science. I have a strong experience  in:
* Administration and management of development projects and programs;
* Accompaniment of associations and groups;
* Technical capacity building (animation of training sessions and reflection workshops).
* Action research;
* Sociological, socio-economic and economic studies.
* Development of development projects and programs;
* Training of trainers
* Results Based Management Training (RBM)
* Monitoring and evaluation of development programs and projects;
* Management of programs and development projects;
* Institutional development and organizational strengthening;
* Development and implementation of training / awareness / animation program;
* Very good knowledge of participatory methods
'''Guiou KOBAYASHI, Associate Professor at Federal University of ABC in São Paulo State, Brazil. '''

I worked with fault-tolerant computer systems for nuclear power plants and Metro signaling systems and recently my interests have evolved to resilience properties of Complex Systems. Traditionally, redundancy was the main feature for fault-tolerant and fail-safe systems, but the adaptability and the evolution of Complex Systems are the key elements for the resilience of these systems. How to characterize, design and implement these key elements in our future resilient systems? The Complex System - Digital Campus (CS-DC) is a way to create a world-wide community of researchers, philosophers and students to promote and discuss this kind of questions involving Complex Systems. For me, participating in its foundation was a great honor and I am very glad for the opportunity that I have had to contribute since 2012 in the consolidation of CS-DC.

Through this manifest I am applying to be one of the members of the new CS-DC's Executive Committee. I would like to help just a little more to strengthen and structure this fantastic community through which I had the opportunity to meet important people with very interesting works that expanded my knowledge of Complex Systems. Although my University and my personal contribution for CS-DC are very limited and small, I hope to continue to work with this great team.


'''Pierre COLLET, Professor of Computer Science, University of Strasbourg, France. Co-coordinator of the CS-DC UNESCO UniTwin'''

The CS-DC initiated by Paul Bourgine, Jeffrey Johnson, Cyrille Bertelle and many others has been an extraordinary adventure a) to instantiate as a UNESCO UniTwin and b) to develop and run since it was enacted in July 2014. Many a night have been spent on designing its inner workings, so that it can deliver an effective affordance for the scientists who wish to develop the science and teaching of Complex Systems. Indeed, many projects seeded in the CS-DC have come to fruition, showing the enormous potential of this fertile environment not only for research, but also for teaching: the BBB rooms set up by the CS-DC have not only made it possible for the CS-DC to organize conferences, but have also shown their potential as remote teaching rooms in many Universities around the world.

It has been an honour for me to be part of the development of the CS-DC since its beginning, but so much remains to be done!

In this manifesto, I hereby express my strong desire to continue developing the CS-DC in these trying times, when the effects of the pandemics stretch thin the social links that our research and teaching communities need most. My objectives for this new mandate are not only to deliver a new world conference (originally planned in 2020 but unfortunately delayed due to the high toll imposed on us all, teachers and researchers alike, by COVID-19) but also continue on developing not only efficient complex computational ecosystems (cheap powerful PARSEC machines have been installed in several universities) but more specifically remote teaching environments based on complex systems, to mitigate the terrible impact of the pandemic on face to face education, within the POEM CS-DC flagship, on which Paul Bourgine and myself have been working for many years now..


'''Mariana C. BROENS, Professor - UNESP - BRAZIL.'''

As members of the Executive Committee, our main challenge will be to raise, analyse and to discuss possible positive/negative ethical and political implications of the further development of the Complex Systems Science, and their application on studies of everyday social problems. In particular, We believe that the widespread use of complex system models and Big Data analytics can bring important questions about people's privacy, personal and corporate responsibility, widespread surveillance by public or private institutions, among many others, that should be deeply discussed in our community. Our contribution will be to raise and deepen these discussions from an interdisciplinary perspective.


'''Cyrille Bertelle, Professor in Computer Sciences,  University Le Havre, France, co-coordinator of the CS-DC UNESCO UniTwin'''

I am a candidate for the CS-DC Executive Committee to represent the University of Le Havre
Normandy, which is co-coordinator with the University of Strasbourg of the convention of
recognition of the CS-DC as UniTwin by UNESCO. The University of Le Havre has made
available to the community, resources and skills to provide digital collaborative tools for the
organization of the Councils and the CS-DC'15 virtual conference.

The objective I wish to take is to facilitate the involvement of member universities not only
by their representatives on the council but by allowing researchers from these member
institutions to join concrete and accessible actions.

Co-responsible in the past of a master's degree on complex systems and then of the creation
of the institute on complex systems in Normandie (France) in a multidisciplinary framework,
I have participated in the setting up of the project labeled by the French national program of
investments for the future and entitled &quot;Smart Port City&quot;. The aim is to think about the
future of territories in a sustainable development approach supported by new technologies
and concerned about the environment and the well-being of their citizens. My research skills
are focused on implementing the complexity of complex dynamic systems and networks,
crossing behavioral scales from the interaction of human behaviors to the technical
networks of the territory. 

The book &quot;complex systems, smart territories and mobility&quot; from
the Springer's Understanding Complex Systems series, which will be published in January
2021 (https://www.springer.com/gp/book/9783030593018) illustrates the research
coordination actions that I lead in these fields.


'''Slimane Ben Miled, Senior Researcher at Pasteur Institute of Tunis, Professor at ENIT'''

Our Tunisian consortium want to constitute a collaborative Research Training Programs to increase data science capacity related to health research in Africa by building trainings and enhancing institutional capacity at African academic institutions.
The academy/project is based on 4 pillars to build a training ecosystem for Data and Engineering Science in health.
# A platform of federated master’s programs with à la carte optional courses covering informatics/computer science, biomedical informatics, data science, statistics, and public health). Each program will keep its independence, with a mention to the academy label, and this platform will allow to enrich the training with optional modules, seminars, and courses in the partner institutions. New curricula will be created in relation to ethical issues.
# Network of Doctoral programs and Executive programs
# Platform of federated Business incubator and a career center offers training, support and funding for projects related to the project’s topic.

This challenge is in perfect agreement with the Sustainable Development Goal 3 and the CS-DC flagship PHYSIOMES (Personalized Health phYSIcally, sOcially and Mentally for Each in their networkS).


'''Masa Funabashi: researcher of open complex systems at Sony Computer Science Laboratories, Inc.'''

I would like to contribute to the executive committee of CS-DC on the following two pillars:
* Promote the FOOD (From smart agrOecOnomy to smart fooD) flagship project that aims to resolve the health-diet-environment trilemma through the promotion of sustainable food systems, in collaboration with the e-lab &quot;human augmentation of ecosystems&quot; members institution: Sony CSL, Synecoculture Association, CARFS, and those who wish to participate in CS-DC collaboration.
* Construct a basic e-learning content on Synecoculture and ecological literacy as a part of CS-DC MOOCs and perform initial trials, principally in ECOWAS countries, through the Sony CSL-CARFS collaboration.

Through the development of on-going activities in FOOD project and making synergy with other flagship projects, I would like to contribute CS-DC as a member of the executive committee and realize further extension toward the achievement of global sustainability goals such as SDGs.


'''Dr Mohamed Abdellahi (Ould BABAH) Ebbe, Mauritania, '''
* General Director of the Institut du Sahel/CILSS www.insah.org; 
* Executive Director of the Orthopterist Society (400 researchers among the globe) https://orthsoc.org/

By obtaining the honor of having your hoped-for confidence for this post of member of the executive council of the CS-DC, I will work, in priority and in the short term on two main subjects:
# '''The transboundary plague of the Desert Locust (Schistocerca gregaria (Forska l , 1775))''' This plague of the Desert Locust of more than 3000 years that cites all our holy books (the Tourah, the Bible and the Koran) and which continues to be present to this day and to wreak devastating devastation. In case of invasion, it can affect the agriculture and pastures of about 25 countries including those of the poorest countries of the world, from Mauritania to India, while its best and most effective strategy of struggle is preventive struggle by targeting its first centers of gregarization which are very small in space and much better known today. In 2005, the costs of its struggle in the Sahel and North Africa amounted to half a billion dollars, with 8 million farmers and pastoralists affected in the Sahel. It also massively invaded Asia and Africa. 'East Africa in 2020. On this subject, I have spent 30 years studying and fighting and developing a national strategy against this scourge which has made it possible to establish a whole prevention model and an institutional, technical, operational mechanism. and scientific effective in my country that can be adapted and copied and in all other affected countries: Biogeography of the desert locust Schistocerca gregaria, Forskal, 1775: Identification, characterization and originality of a gregarious focus in central Mauritania (HR.HORS COLLEC.) (French Edition) - Babah Ebbe, Mohamed Abdallahi | 9782705670573 | Amazon.com.au | Books http://www.worldbank.org/en/news/feature/2010/01/07/improved-ways-to-prevent-the-desert-locust-in-mauritania-and-the-sahel, http: // whatsnext.blogs.cnn.com/2012/02/02/in-mauritania-sunny-with-a-chance-of-locusts/
# '''The Sahel Institute (INSAH) www.insah.org of the Permanent Interstate Committee for Drought Control (CILSS)''' that I lead and which has been doing extraordinary work for almost half a century in the field of research and development of animal and plant production techniques and also in the field of support for demographic, population and development policies, in favor of the populations of our 13 Sahelian, coastal and island member countries. This work covered the majority of good practice technologies in the field of plant and animal production, natural resource management, land restauration, cultivation techniques, post-harvest, machining, dehulling operations technology. / ginning, Conservation and storage, good resilience practices

Research on the demographic dividend, gender and the empowerment of women and the Population / Development interrelations ... etc
The results of all this work are contained in a database. data, online http://publications.insah.org/, containing more than 1,500 books, scientific and technical articles that will have to be modernized and connected to the CS Meta data.

Finally, I will work actively with my colleagues on the Executive Board on all aspects of other cross-border scourges but also all aspects of improving agro-sylvo-pastoral production tools as well as the fight against poverty and food insecurity and nutrition in line with the goals (SDGs)


'''Dr. Habil. László Barna Iantovics, Associate Professor at “George Emil Palade” University of Medicine, Pharmacy, Science and Technology of Targu Mures, Romania.''' 

With the present manifesto, I would like to candidate as a member of the CS-DC Executive Committee. I am the representative of “George Emil Palade” University of Medicine, Pharmacy, Science and Technology of Targu Mures from Romania in CS-DC.

Some of my research and academic activities are related to the complex systems, including: publications, organization of conferences (e.g. Symposium on Understanding Intelligent and Complex Systems - UICS 2009; 1st Int. Conf. on Complexity and Intelligence of the Artificial and Natural Complex Systems Medical Applications of the Complex Systems. Biomedical Computing -CANS 2008; 1st Int. Conf. on Bio-Inspired Computational Methods Used for Difficult Problems Solving. Development of Intelligent and Complex Systems - BICS 2008), contribution to conference committees (e.g. Int. Conf. Emergent Proprieties in Natural and Artificial Complex Systems - EPNACS 2007; Workshop on Complex Systems and Self-organization Modeling -CoSSoM 2009), preparing journal special issues (e.g. Special Issue on Complexity in Sciences and Artificial Intelligence; Special Issue on Understanding Complex Systems), participating in journal’s editorial board (e.g. Complex Adaptive Systems Modeling -CASM, SpringerOpen), and contribution to research in projects and projects coordination (Social network of machines- SOON; Hybrid Medical Complex Systems -ComplexMediSys). I was the director of the center Advanced Computational Technologies – AdvCompTech in the frame of my university. At present, I am the director of the Center for Advanced Research in Information Technology from my university.

I would like much deeper involve myself in the life and activities of the CS-DC community.

My objectives:

* To involve junior and senior researchers from my university in activities regarding research and education. To motivate universities and research institutes from my country to contribute to CS-DC. I consider also universities and research institutes with that I have collaboration in the past.
* To PROPOSE the formation of a so-called doctoral and postdoctoral students group. In the case of doctoral and postdoctoral students probably in time more students would like to be involved in activities. In this framework, I suggest the organization yearly 3 times (from 4 to 4 months) workshops in that all the interested students could discuss, present their research and research in progress. With this occasion in the frame of workshops if there is interest could be established separate sessions with presentations also by B.Sc. and M.Sc. students.
* To PROPOSE the strengthening of the following research direction with the general topic: intelligent complex systems and machine intelligence measuring. One of the subtopic by interest will be complex systems approaches in medicine and healthcare. To be accomplishable this subject I propose in a first step the formation of a group of interested persons, after then the establishment of the functionality of the group, for example: discussions when are subjects that should be discussed etc.

==Elected members to the Executive Committee &amp; as (Deputy-)Presidents==


'''Jeffrey JOHNSON, Professor of Complexity Science and Design, The Open University, UK'''

I offer myself as a candidate both to be President and to the Executive Committee of  The UNESCO UniTwin Complex Systems Digital Campus (CS-DC) so that I can help to drive it forward to achieve it goals. 

I am particularly committed to our educational efforts. I have made four MOOCs on the FutureLearn Platform for CS-DC  ( https://www.futurelearn.com/partners/unesco-unitwin-complex-systems-digital-campus ): Global Systems Science (2015-16); Systems Thinking and Complexity (2017-18); First Steps in Data Science with Google Analytics (2018-19) and  COVID-19 - Pandemics, Modelling and Policy (2020). CS-DC has a great opportunity to become the global university providing interdisciplinary education for a better world.

I am also committed to our research mission with UNESCO towards the achieving the U.N. Sustainable Development Goals. My own research on representing the dynamics of complex multilevel systems is relevant to many of the research initiatives of CS-DC.

I have extensive experience working within the complex systems community. I have run various coordination actions supporting research programmes funded by the European Commission, I am a founder member and past president of the Complex Systems Society, and I am Deputy-President of the CS-DC. I believe this experience will enable me to make a significant contribution the CS-DC over the next three years.


'''Paul BOURGINE, present President of the UNESCO UniTwin CS-DC, Complex Systems Institute of Paris'''

I offer myself as a candidate both to be President and to the Executive Committee of  The UNESCO UniTwin Complex Systems Digital Campus (CS-DC).

If elected, my main commitment is to create the conditions for a self-organized development of our UniTwin UNESCO CS-DC as autonomous communities of communities. This self-similar development will be the case both for the two main branches the UniTwin branch of our institutional members and the global eCampus branches of our individual scientific members:
* for the UniTwin branch, the communities of communities are a territorial cascade with Smart Continents, smart countries, smart cities for their sustainable development according our flagship TIMES (Territorial Intelligence for Multilevel Equity and Sustainability). The roadmap is always the same, i.e. the cascade of the 17 Sustainable Development Goals and their 169 Targets: but their relative importance and coherence within this cascade vary from one territory to the others. The institutional members of the UniTwin branch have signed their agreement with the Cooperation Programme signed with UNESCO. In 2021, the CS-DC will ask for a cascade of agreements inside each institutional member, in order to have a &quot;one for all&quot; amplification within the other branch, the e-campus branch. 
* for the eCampus branch, the cascade of communities is along the refinement cascades when studying the theoretical and experimental challenges of complex systems. With Smart Continents'21, scientists are proposing their individual challenges that enact basic communities and communities of communities within the e-departments. In the &quot;all for one&quot; return, the roadmap of each university is the cascade of roadmaps within the eCampus where the University has at least one member. Furthermore each community can organise a monthly e-seminar or e-session in workshop as well as in CS-DC'21 for recorded advanced introductions. Such advanced introductions can be the basis for curriculum largely shared by the set of Universities having members in the  community cascade of the curriculum.

This &quot;accelerator of knowledge and knowhow one for all and all for one&quot; will first benefit to the student curriculum through the flagship POEM (Personalized Open Education for the Masses). This accelerator can be extended through the flagship POLE (Personalized Open Lifelong Education) for a lifelong education. This extended accelerator will be open to all, independently of previously achieved academic levels, respectful of the diversity of social and cultural environments and in a higher and higher inclusive way including refugees, migrants and primary people. genders, religions or ways of life.</text>
      <sha1>h1xotbrr6n72gtmrkohhm9nleyyndkd</sha1>
    </revision>
    <revision>
      <id>2809680</id>
      <parentid>2809679</parentid>
      <timestamp>2026-05-16T18:47:19Z</timestamp>
      <contributor>
        <username>~2026-29396-85</username>
        <id>3076712</id>
      </contributor>
      <comment>/* Prof. Daniel Schertzer, Ecole nationale des ponts et chaussées */</comment>
      <origin>2809680</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="67490" sha1="82mxu2i2nksmawfe1nrlxrjn1vpgfll" xml:space="preserve">    
----
----&lt;nowiki&gt;**&lt;/nowiki&gt;Please ''login'' in Wikiversity and then use the ''&lt;nowiki/&gt;'edit''' button: your edition mode will be 'WYSIWYG'. Each Candidature with its manifesto can take inspiration from those for previous years.  

''Decision of the 2025 General Assembly 27th April:''

''The 2026 elections are starting the 27th April, the date of the General Assembly:''

''(i) There will be an election for Vice-President starting the 27 April 2026.''

''(ii) To save time and effort - Instead of an election for 1/3 of the Executive Committee'' ''(EC) for 2025 we propose to keep the existing EC and invite members of the Council '''not on the EC''' to offer themselves as members of an enlarged Executive Committee. If less than six people propose themselves, they will be co-opted onto the Executive Committee. If more than six propose themselves we will hold an election for 1/3 EC.''

The deadline for your candidature is Saturday 16th May 2026 at 24:00 CET. 

== Candidature for the New Vice-President for [2026, 2027] ==
 
'''Manifesto – Candidature for New Vice-President of UNESCO UniTwin CS-DC'''

New Candidatures to the Executive Committee for [2026]
=== Manifesto – Candidature for the Executive Committee of UNESCO UniTwin CS-DC ===

===== Prof. Daniel Schertzer, Ecole nationale des ponts et chaussées =====

Dear UNESCO CS-DC Councillors,

I am writing to express my sincere interest in serving as a member of the Executive Committee of UNESCO UniTwin CS-DC. I am deeply committed to fostering the community of complex systems and am eager to contribute to the organisation of this talented group.

I am particularly interested in the “living roadmap” of CS-DC, a unique feature that operates through two complementary strategies. Firstly, it addresses major transversal problems, and secondly, it focusses on classes of complex systems. This integrative systems framework is particularly pertinent to geosciences, which are increasingly integrating urban sciences, sustainability science, territorial planning, computational modelling, socio-ecological intelligence, and digital governance.

Consequently, TIMES—Territorial Intelligence for Multilevel Equity and Sustainability—is built on this integration process and is one of CS-DC’s principal flagship projects. The new chalenge with TIMES is to do it across scales, not only at an arbitrary scale. I possess extensive international experience as a scientist, mentor, leader, organiser, and editor, which I believe would be valuable assets to this role.

Sincerely,
Daniel Schertzer
[https://hmco.enpc.fr/team-view/daniel-schertzer/ Short CV of Daniel Schertzer]


'''Flavia Mori SARTI, Ph.D., Professor and Researcher, University of Sao Paulo, Brazil'''

I present my interest in being candidate for the CS-DC Executive Committee to contribute to the dissemination of knowledge in complex systems at the local and global level. I am representative of the University of Sao Paulo (USP) at the CS-DC since 2012. I work with complex systems modeling since the creation of the Interdisciplinary Research Group of Complex Systems Modelling at the School of Arts, Sciences and Humanities (EACH-USP) in 2006. Our research group succesfully implemented the first interdisciplinary graduate program titled Master in Complex Systems Modeling in Brazil, in 2010. I have been participating in the program commission since 2010, and I was coordinator of the graduate program from 2010 to 2014.

I have supervised 12 students in the program and two postdoctoral fellows, followed by publication of several book chapters and papers on complex systems applied to public policies, including models on tax evasion, health systems regulation, health insurance, food policy and nutrition programs, and complex networks on scientific collaboration and global food trade. I have been invited to present seminars and talks on complex systems applied to food systems, health economics, and public policy.

My goals in the CS-DC Executive Committee include:

* To disseminate the role of CS-DC in education and research on complex systems, especially in developing countries;
* To support and to engage other research groups working with complex systems for participation in the CS-DC;
* To contribute further with management and organization of CS-DC activities during the period of 2022-2024;
* To continue supporting capacity building in complex systems through supervision and other academic activities;
* To foster innovation, research and development strategies through complex systems applications in public policy and entrepreneurship.


'''Alberto A. Rasia-Filho, MD, Ph.D, Professor and Researcher, Federal University of Health Sciences of Porto Alegre (UFCSPA) and Federal University of Rio Grande do Sul (UFRGS), Brazil'''

Dear Councilors of the UNESCO CS-DC,

It is an honor to submit my candidacy for the CS-DC Executive Committee for 2026. Please let me introduce myself as a Full Professor of Physiology (UFCSPA), Supervisor in the Biosciences (UFCSPA) and Neuroscience Graduate Programs (UFRGS), and a researcher on human neuronal morphology, dendritic spines, synaptic plasticity, and social/emotional neural networks (National Council for Scientific and Technological Development, Brazil). Professional Identifier/ORCID: 0000-0003-4623-5916.

Currently, I am participating as head of the e-Team &quot;Morphological Heterogeneity&quot; in the UNESCO CS-DC, led by Prof. Enver Oruro Puma, Principal Investigator of the Morphodynamic Neuroscience and Behavior eLab CS-DC, and Prof. Grace E. Pardo, Scientific Research Institute, Continental University of Cusco, Peru. We integrate morphodynamics across different scales of brain organization and neural network functions in complex systems, considering neuronal morphology itself as an emergent level of organization. The structure of neural cells and their connectivity within the brain volume are morphodynamic features with interactions from cellular morphogenetic elements, the local cell neighborhood, and synaptic connections. In turn, the emergent functions of networks are organized around a series of conceptual, experimental, and computational foundations.

These ideas were developed—and are now open to additional discussions—in the recent article from our group: “New Directions for Complex Systems in Contemporary Neuroscience: A Morphodynamic and Emergent Function Approach” (Research Topic: Theoretical and Computational Insights into Brain-Based Cognition/Frontiers in Computational Neuroscience). This represents an ongoing research line available for further collaborations in Complex Systems Science.

I will be (1) committed to the Action Plan 2026 (and beyond) from the current 2026-31 Action Plan/Complex Systems Digital Campus UNESCO UniTwin, (2) working to integrate interdisciplinary approaches and eTeams, sharing knowledge and opportunities for complex systems education and research, as well as (3) contributing to country and continent engagement and representation in line with worldwide aims, (4) including the academic formation of young scientists.
----'''Norberto Garcia-Cairasco, BSc, MSc, PhD, Full Professor of Physiology-Neurophysiology, Ribeirão Preto School of Medicine, University of São Paulo (FMRP-USP), Ribeirão Preto, São Paulo State, Brazil.'''

Dear Councilors of the UNESCO CS-DC,

It is an honor for me to submit my candidacy for the CS-DC Executive Committee for 2026. Please, let me introduce myself as a Full Professor of Physiology-Neurophysiology, Ribeirão Preto School of Medicine, University of São Paulo (FMRP-USP), Ribeirão Preto, São Paulo State, Brazil. At FMRP-USP, I am Supervisor (Master and PhD) at both Graduate Programs in Physiology and Neurology/Neuroscience &amp; Neuropsychiatry. I have been the Founder and the Director for almost 40 years of the Neurophysiology and Experimental Neuroethology Laboratory, where we conduct research in the characterization of epilepsies and associated neuropsychiatric comorbidities, using behavioral, electrophysiological, cellular, molecular and computational integrated tools, in both experimental and collaborative clinical settings. Our main funding comes from the State of São Paulo Foundation (FAPESP), the Federal agencies National Council for Research (CNPq) and the Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES). Professional Identifier/ORCID: &lt;nowiki&gt;https://orcid.org/0000-0001-8857-3775&lt;/nowiki&gt;.

I am currently the Head of the e-Team “'''Epilepsy and Neuropsychiatric Comorbidities”''' in the UNESCO CS-DC, led by Prof. Enver Oruro and Prof. Grace E Pardo, Principal Investigators of the Neurocomputing, Social Simulation, and Complex Systems Laboratory at the Instituto Científico of Universidad Continental del Cusco, Peru. 

Complex systems are involved in abnormal functioning and the refractoriness to pharmacological approaches of epileptogenic neural circuits, with additional multilevel complexity derived from associated, usually neuropsychiatric comorbidities. We, indeed, propose that the morphodynamics of neurons and glia in neural circuits can be studied as an initial step toward understanding proper wiring and stable properties, including neurotransmitters, neuromodulators, receptors, and intracellular signal transduction components, as well as plastic features, environmental stimuli, attention, and learning. These ideas were developed, and are now open to additional discussions, in the recent article from our group: “New Directions for Complex Systems in Contemporary Neuroscience: A Morphodynamic and Emergent Function Approach” (Research Topic: Theoretical and Computational Insights into Brain-Based Cognition/Frontiers in Computational Neuroscience). This represents an ongoing research line available for further collaborations in Complex Systems Science. 

I will be (1) committed to the Action Plan 2026 (and beyond) from the current 2026-31 Action Plan/Complex Systems Digital Campus UNESCO UniTwin, (2) working to integrate interdisciplinary approaches and eTeams, sharing knowledge and opportunities for complex systems education and research, as well as (3) contributing to country and continent engagement and representation in line with worldwide aims, (4) including the academic formation of young scientists.

In addition to the above-mentioned agenda and goals, I will offer, for the leverage of outreach activities, my experience of more than four decades in the '''''Neuroscience &amp; Arts''''' connection. In fact, I am co-Founder of the “Brain Awareness Week” in Brazil (since 2012) and currently the Coordinator at the Institute for Advanced Studies at USP-Ribeirão Preto of the “'''''Science, Arts, Education and Society Network - ScienArtES'''''”. In 2022, I received the Title of ''Doctor Honoris Causa'' (Biology) from the Universidad de Salamanca, Spain. Finally, I am also, since 2026, a Member of the Brain Literacy Initiative Alliance: Uniting for Brain Research-Informed Education Worldwide. 
----

== Candidature for the New President for [2025, 2026] ==
 
'''Manifesto – Candidature for New President of UNESCO UniTwin CS-DC'''

'''Prof. Paul Bourgine''' : 

If elected, my main commitment is to create the conditions for a self-organized development of our UNESCO UniTwin CS-DC as autonomous communities of communities for our flagship TIMES and its Knowledge &amp; Knowhow Accelerator one-for-all &amp; all-for-one (KKA). We know now how to realize —for the two above commitments— the 3&lt;sup&gt;rd&lt;/sup&gt; UNESCO commitment, i.e., the ‘computational ecosystem’. It will use the mature part of Web 3.0, especially the InterPlanetary File System (IPFS). Thanks to our previous efforts especially of the two last years, the remaining work amount is ten times less than we were anticipating at the beginning of the 2&lt;sup&gt;nd&lt;/sup&gt; renewal of our UniTwin by UNESCO 2020-2026.  

If elected, my duty will be not only to fulfill entirely the commitments of our Cooperation Program with UNESCO but also starting an exponential increasing development wave for our UniTwin network (through their continent and country Councils) and of our e-Campus (through CS-DC’25 and e-Labs’26 Conferences especially for our Flagships for sustainable development). The Knowledge &amp; Knowhow Accelerator will directly benefit from 1) such conference series, 2) our past and new flagships for sustainable development and 3) a new decentralized strategy for collecting donations in our decentralized network of X-Legal Entities.

== New Candidatures to the Executive Committee for [2025] ==

=== Manifesto – Candidature for the Executive Committee of UNESCO UniTwin CS-DC ===
'''Prof. Silvius STANCIU, PhD in Economics, PhD in Engineering, Habil.'''

Full Professor, “Dunărea de Jos” University of Galați (UDJG), Romania

Editor-in-Chief, ''Journal of Agriculture and Rural Development Studies (JARDS)''

Former Vice-Rector, Former Director of DFCTT and CTT UGAL
----'''Dear Councillors,'''

It is a great honor for me to submit my candidacy for the Executive Committee of the UNESCO UniTwin Complex Systems Digital Campus (CS-DC). With more than '''30 years of experience in academia''', I am currently Full Professor and doctoral advisor at “Dunărea de Jos” University of Galați (UDJG), Romania — a public research university with a strong regional impact and a long-standing tradition in interdisciplinary education and innovation.

I hold two doctoral degrees — one in Economics and one in Engineering — and I am a habilitated professor. I have published '''163 ISI-indexed scientific articles''' and have a '''Clarivate H-index of 14'''. My research focuses on '''food security, circular economy, technological innovation, rural development''', and '''complex systems in agro-food value chains'''.

I am the founder and coordinator of Romania’s first doctoral program in ''Engineering and Management in Agriculture and Rural Development (IMADR)'', with '''9 PhD graduates''' and '''9 doctoral students''' currently under my supervision. I also serve as '''Editor-in-Chief''' of the ''Journal of Agriculture and Rural Development Studies (JARDS)'', dedicated to interdisciplinary research in sustainable food and rural systems.

Over the past decade, I have been involved as director or expert in '''more than 45 national and international research projects''', including Horizon-compatible initiatives and cross-border cooperation programs. I coordinated a '''Romania–Republic of Moldova cross-border project''' (2020–2021) and currently lead '''two new ROMD-funded projects''' entering implementation.

My former institutional leadership roles include:

* '''Vice-Rector for Research and Innovation'''
* '''Director of the Department for Institutional Development (DFCTT)''' and of the '''Technology Transfer Center (CTT UGAL)'''
* '''Member of national and international quality and research bodies''', including CNATDCU, ARACIS, and CMPTJ

----'''If elected, I am committed to:'''

* Expanding the CS-DC network in '''Eastern Europe and the Black Sea region''', enhancing scientific and territorial diversity;
* Supporting '''POEM''' and '''FOOD flagship programs''' through digital education, doctoral/postdoctoral collaboration, and innovation ecosystems;
* Promoting '''open science''', international e-seminars, and interdisciplinary MOOCs;
* Coordinating thematic initiatives in '''agro-complexity, food systems resilience''', and '''sustainable rural innovation'''.

As a representative of a '''UniTwin member institution''', I see this candidacy as a unique opportunity to strengthen UDJG’s role within the CS-DC ecosystem. I fully embrace the CS-DC mission to foster global collaboration, education, and research in complexity science.

I am ready to bring '''vision, experience, and energy''' to the Executive Committee and help shape the future of our UniTwin community.
----'''Sincerely,'''

'''Prof. Silvius STANCIU, PhD in Economics, PhD in Engineering, Habil.'''

Representative of “Dunărea de Jos” University of Galați (UDJG)

'''Professional Identifiers:'''

* Web of Science Author ID: R-8246-2017
* ORCID: 0000-0001-7697-0968
* Scopus ID: 36633317700
* Google Scholar: Silvius Stanciu
* ResearchGate: Silvius Stanciu

== New Candidatures to the Executive Committee for [2024] ==

'''Enver Oruro Puma, Ph.D., Principal Investigator of Neurocomputing, Social Simulation, and Complex Systems Laboratory at the Instituto Científico of Universidad Andina del Cusco, Peru''' 

Dear Councillor of the UNESCO UniTwin CS-DC. I am very honored to place my candidature for the UNESCO UniTwin CS-DC Executive Committee. I am Enver Miguel Oruro Puma, Ph.D., principal investigator of Neurocomputing, Social Simulation, and Complex Systems Laboratory at the Instituto Científico of Universidad Andina del Cusco, Peru (https://sites.google.com/view/orurolab/). Since 2009, I have promoted and organized conferences and academic events on Complex Systems in Latin America. Recently, I have promoted the area of computational neuroscience on infant attachment (https://sites.google.com/view/envermiguel/seminar-in-maternal-infant-relationship-studies).

It would be a great honor for me if given the opportunity to contribute to the Executive Committee of UNESCO UniTwin CS-DC in the integration of Complex System research groups in the Latin American Region. For this, I propose the creation of two periodical activities: 1) A Special Lectures Series on Complex Systems UNESCO UniTwin CS-DC oriented to experts on Complex Systems, and 2) A Invited Advanced Lectures UNESCO UniTwin CS-DC oriented to experts who do not identify explicitly with complex systems

'''Pierre Collet, full professor of Strasbourg University, on secondment to Universidad Andrés Bello, Instituto de Tecnología para la Innovación en Salud y Bienestar, Viña del Mar, Valparaiso, Chile'''.

Since 2012, I have contributed to the elaboration of the CS-DC Unesco UniTwin together with Paul Bourigne, Jeffrey Johnson and many others, and I have been co-coordinator of the CS-DC UniTwin with Cyrille Bertelle since its creation in 2014. Starting part of this great adventure has changed my academic and personal life: thanks to the UniTwin, I have changed my research from stochastic optimisation, artificial evolution and AI in general to complex systems and epistemology.

Participating in this UniTwin allowed me to make new contacts and start incredible projects that I could not have imagined before. It has even changed my life, as I am now living in Chile, having been recruited by ITISB, an institute founded by Carla Taramasco, the CS-DC representative for South America.

Together with Paul and others, we would like to revive UniTwin by preparing another world conference inspired by the great success of [https://cs-dc-15.org CS-DC'15] and also develop flagship projects such as POEM (Personalised Open Education for the Masses) and the [https://en.wikiversity.org/wiki/Portal:Complex_Systems_Digital_Campus/E-Laboratory_on_complex_computational_ecosystems ECCE e-lab], which this year has welcomed a new very active [[Figures of Play/Les figures du Jeu e-team|Figures of Play]] that has started the [https://ludocorpus.org/ Ludocorpus] in France.

As said before, this incredible UniTwin adventure always pays off for those who invest in it and in its great challenge: to develop the new science of complex systems through research and education. Through its projects, it contributes to making the world a better place to live in, despite the constant attacks on science coming from the most unlikely places.

Science is the solution, not the problem, to many of the world's plagues. We must put our energy into developing it and defend it against all its detractors.

That is why I am once again standing for election to the Executive Committee of this great CS-DC UniTwin. Modern science is Complex Systems science. It is important that its beacon continues to illuminate the world, and we must invest our time and energy in it.

== Candidature Deputy President for [2024, 2025] ==
'''Jeffrey JOHNSON, Professor of Complexity Science and Design, The Open University, UK'''

I offer myself as a candidate both to be President and to the Executive Committee of The UNESCO UniTwin Complex Systems Digital Campus (CS-DC) so that I can help to drive it forward to achieve it goals.

I am particularly committed to our educational efforts. I have made four MOOCs on the FutureLearn Platform for CS-DC ( &lt;nowiki&gt;https://www.futurelearn.com/partners/unesco-unitwin-complex-systems-digital-campus&lt;/nowiki&gt; ): Global Systems Science (2015-16); Systems Thinking and Complexity (2017-18); First Steps in Data Science with Google Analytics (2018-19) and COVID-19 - Pandemics, Modelling and Policy (2020). CS-DC has a great opportunity to become the global university providing interdisciplinary education for a better world.

I am also committed to our research mission with UNESCO towards the achieving the U.N. Sustainable Development Goals. My own research on representing the dynamics of complex multilevel systems is relevant to many of the research initiatives of CS-DC.

I have extensive experience working within the complex systems community. I have run various coordination actions supporting research programmes funded by the European Commission, I am a founder member and past president of the Complex Systems Society, and I am Deputy-President of the CS-DC. I believe this experience will enable me to make a significant contribution the CS-DC over the next three years.

== New Elected President for [2023, 2024] ==
Paul BOURGINE, present President of the UNESCO UniTwin CS-DC, Complex Systems Institute of Paris 
I offer myself as a candidate to be President of The UNESCO UniTwin Complex Systems Digital Campus (CS-DC).
My previous commitment two years ago is below. The bad news is that it was not achieved. The good new is that we know now how to create 'autonomous community of autonomous communities' as a social network with IPFS (the InterPlanetary File System) like the new development of Wikipedia. 
If elected, my first commitment is to finish this job as quickly as possible. My second commitment is simultaneously to visit each country of the UniTwin for creating its country.CS-DC and its roadmap with young eTeams shared by their Universities with a senior scientific committee. The eTeam projects will have the opportunity to be submitted to the EU calls or other ones. 

Enver Oruro PhD, Head of Neurocomputing, Social Simulation and Complex Systems Laboratory, Universidad Andina del Cusco, Peru.
'''I would like to nominate Professor Paul Bourgine.'''

== New Elected Members to the Executive Committee for [2022,2023, 2024,2025] ==
'''2Dr Mohamed Abdellahi (Ould BABAH) Ebbe, Mauritania,''' 

* Senior Advisor for the CILSS Executif Secretary for international Partnership and formal General Director of the     Institut du Sahel/CILSS www.insah.org;

·       Commissionaire General of CILSS for Horticulture Universal  Expo of DOHA 2023-2024   &lt;nowiki&gt;https://www.dohaexpo2023.gov.qa/en/&lt;/nowiki&gt; with central thems:

'''CENTRAL THEME: GREEN DESERT, BETTER ENVIRONMENT'''

* Executive Director of the     Orthopterist Society (400 researchers among the globe) &lt;nowiki&gt;https://orthsoc.org/&lt;/nowiki&gt;
* We have organized our last     congress during 16-20 0ctober in Merida Mexique

&lt;nowiki&gt;https://ico2023mexico.com/&lt;/nowiki&gt;

By obtaining the honor of having your hoped-for confidence for continuing this post of member of the executive council of the CS-DC, I will work, in priority and in the short term on two main subjects:

## '''The transboundary plague of the     Desert Locust (Schistocerca gregaria (Forska l , 1775))''' This plague of the Desert     Locust of more than 3000 years that cites all our holy books (the Tourah,     the Bible and the Koran) and which continues to be present to this day and     to wreak devastating devastation. In case of invasion, it can affect the     agriculture and pastures of about 25 countries including those of the     poorest countries of the world, from Mauritania to India, while its best     and most effective strategy of struggle is preventive struggle by     targeting its first centers of gregarization which are very small in space     and much better known today. In 2005, the costs of its struggle in the     Sahel and North Africa amounted to half a billion dollars, with 8 million     farmers and pastoralists affected in the Sahel. It also massively invaded     Asia and Africa. 'East Africa in 2020. On this subject, I have spent 30     years studying and fighting and developing a national strategy against     this scourge which has made it possible to establish a whole prevention     model and an institutional, technical, operational mechanism. and     scientific effective in my country that can be adapted and copied and in     all other affected countries: Biogeography of the desert locust     Schistocerca gregaria, Forskal, 1775: Identification, characterization and     originality of a gregarious focus in central Mauritania (HR.HORS COLLEC.)     (French Edition) - Babah Ebbe, Mohamed Abdallahi | 9782705670573 |     Amazon.com.au | Books &lt;nowiki&gt;http://www.worldbank.org/en/news/feature/2010/01/07/improved-ways-to-prevent-the-desert-locust-in-mauritania-and-the-sahel&lt;/nowiki&gt;,     http: //     whatsnext.blogs.cnn.com/2012/02/02/in-mauritania-sunny-with-a-chance-of-locusts/ I was invited last year by Royal Society 20-21 may 2024 to moderate one session on locust research management (La plasticité des criquets et des abeilles dans un monde en mutation | Société royale) and in a “International Conference on New Technology and Concepts for Sustainable Management of Locusts and Grasshoppers” held from 2 to 7 June 2024 in Jinan, Shandong, China.We are also preparing our Orthopterist congress in Argentina during the next mars 2026  &lt;nowiki&gt;https://ico2026.com.ar&lt;/nowiki&gt;

'''All this is in addition of more than 110 publications or joint publications on the locust, its environment and management''' 

# '''Senior Adviser to the CILSS Executive Secretary for International Partnerships'''] [Assistance to Mauritania (or 3 months) in the preparation of the organisation of the Nouakchott+10 High-Level Forum on pastoralism held in Nouakchott from 6 to 8 November 2024, various advising for the international partnership and the mobilization of resources including preparation of the organization of a round table planned in OPEC Vienna Austria for the mobilization of Arabic and Islamic funds for the financing of the CILSS 2050 strategic plan
# '''The Sahel Institute (INSAH)     www.insah.org of the Permanent Interstate Committee for Drought Control     (CILSS)''' that I     lead and which has been doing extraordinary work for almost half a century     in the field of research and development of animal and plant production     techniques and also in the field of support for demographic, population     and development policies, in favor of the populations of our 13 Sahelian,     coastal and island member countries. This work covered the majority of     good practice technologies in the field of plant and animal production,     natural resource management, land rstauration, cultivation techniques,     post-harvest, machining, dehulling operations technology. / ginning,     Conservation and storage, good resilience practices

Research on the demographic dividend, gender and the empowerment of women and the Population / Development interrelations ... etc The results of all this work are contained in a database. data, online &lt;nowiki&gt;http://publications.insah.org/&lt;/nowiki&gt;, containing more than 1,500 books, scientific and technical articles that will have to be modernized and connected to the CS Meta data.

As General Commissionaire  of CILSS for Horticulture Universal  Expo of DOHA 2023-2024   &lt;nowiki&gt;https://www.dohaexpo2023.gov.qa/en/&lt;/nowiki&gt; with central thems:

'''CENTRAL THEME: GREEN DESERT, BETTER ENVIRONMENT''' I am working  in introducing as detailed below:

'''CILSS ''contribution to the improvement of sustainable horticultural agricultural production in a context of drought''''' 

'''I. PRESENTATION OF THE EXPO'''  

Expo 2023 in Doha is part of the fight against desertification. The Expo will be held from 2 October 2023 to 28 March 2024 under the theme &quot;'''''Green Desert, Better Environment'''''&quot;. The aim is to encourage, inspire and inform people about innovative solutions to reduce desertification. The exhibition will provide an international platform for participants, stakeholders, decision-makers, nongovernmental organizations and experts to address the global challenge of &quot;desertification&quot;, while making a valuable contribution to achieving a sustainable future. During the 6 months of the Expo, nearly 3 million visitors from over 80 countries are expected

The objectives of this Expo are in line with those of the CILSS, which seeks to improve the living conditions of the people of the Sahel in a sustainable manner. This is why the participation of CILSS in this Expo is important for the region and its vulnerable populations. 

'''OBJECTIVES OF EXPO 2023 DOHA, QATAR'''

Expo 2023 Doha, Qatar is defined by the following objectives:

-   Encourage horticultural innovation by focusing on Qatar's climate, water and soil.

-   Promote Expo 2023 in Doha, Qatar, as a catalyst for international investment and business opportunities.

-   To propose innovative actions that would allow humanity to fight against desertification more quickly and decisively before it is too late.

-   To build up useful environmental outputs for future generations.  

'''II. ORGANISATION OF THE CILSS PARTICIPATION'''

'''II.1. GOALS OF CILSS EXHIBITION:''' 

1. Sharing experiences and best practices,

2. Building International Partnership,

3. Promoting technology and innovation

Finally, I will continue to work actively with my colleagues on the Executive Board on all aspects of other cross-border scourges but also all aspects of improving agro-sylvo-pastoral production


'''Dr. Xabier E. Barandiaran, Lecturer at the University of the Basque Country (UPV/EHU), Department of Philosophy, Donostia - San Sebastian, Spain'''

I would like to present [https://xabier.barandiaran.net myself] as a candidate for the Executive Committee. I have been the representative and coordinator between CS-DC and the [https://ehu.eus University of the Basque Country] since 2013. I develop my academic research at the [https://ias-research.net IAS-Research Centre for Life, Mind, and Society], with a focus on the understanding of autonomous and complex adaptive systems (from biology to cognition, from brains to societies). I am the author of over 50 indexed publications on topics related to complex systems, philosophy of mind, complex epistemology, simulation models of the origins of life, minimal agency, evolutionary robotics, complex social network analysis, etc. I recently received the “Award for Distinguished Early-Career Investigator” by the International Society for Artificial Life. Overal I have been awarded with 7 different grants and have actively participated on 15 different research projects. I have also supervised 2 PhD thesis (4 more still in development) and I hold an extensive record of scientific and innovative management experience in different academic and public institutions as founder of research networks ReteCog.Net and FLOK Society – Buen Conocer and head of RDI at Barcelona City Council (2016-2018). I have also organized several national workshops, summer schools and conferences, and 2 international summer schools, 4 international workshops and one international conference. I am currently the Principal Investigator of a founded research project (with more than 30 research-collaborators) on a complex systems' approach to the concept of autonomy beyond its classical conception as an individual bounded property.

As part of my university's goal of fostering international collaboration and opening up e-learning and research initiatives I would like to get more deeply involved on CS-DC with the following goals:

* To desing the infrastructure, learning-experience, research-experience and content for distributed, open access and high-quality digital campus facilities.
* To involve local agents (student, teachers, researchers and institutions) on the initiative of the network.
* To foster collaboration, co-production and resource sharing between teaching and research facilities between priviledged richer countries and lower-income ones. In particular, but not exclusively, and for obvious reasons related to sharing the same language, to foster ''collaboration between European and Latin-american universities'', research initiatives and students through CS-DC.
* To develop at least one ''prototype'' of a MSc level online course (and research network module) around complex cognitive systems that can serve as a model for the other fields of the network.
* To develop a clear conceptual and communicative framework for CS-DC to be able to attract more participants, resources and broader attention and success as pioneering international initiative.


'''Dr. habil. László Barna Iantovics, Professor at “George Emil Palade” Univ. of Medicine, Pharmacy, Science and Technology of Tg. Mures, Romania'''

With the present manifesto, I would like to be a candidate for the CS-DC Executive Committee. I have been the representative of “George Emil Palade” University of Medicine, Pharmacy, Science and Technology of Targu Mures from Romania in CS-DC by many years.

Some of my research and academic activities were related to the complex systems, including: publications; organized conferences (e.g. Symposium on Understanding Intelligent and Complex Systems - UICS 2009; 1st Int. Conf. on Complexity and Intelligence of the Artificial and Natural Complex Systems Medical Applications of the Complex Systems. Biomedical Computing -CANS 2008; 1st Int. Conf. on Bio-Inspired Computational Methods Used for Difficult Problems Solving. Development of Intelligent and Complex Systems - BICS 2008); membership in conference committees (e.g. Int. Conf. Emergent Properties in Natural and Artificial Complex Systems - EPNACS 2007; Workshop on Complex Systems and Self-organization Modeling -CoSSoM 2009); Journal Special Issues (e.g. Special Issue on Complexity in Sciences and Artificial Intelligence; Special Issue on Understanding Complex Systems); membership in Journal’s Editorial Boards (e.g. Complex Adaptive Systems Modeling -CASM, SpringerOpen), and contribution to research performed in projects and projects coordination (Social network of machines- SOON; Hybrid Medical Complex Systems -ComplexMediSys). I am the director of the Research Center on Artificial Intelligence, Data Science and Smart Engineering (Artemis).

I would like to involve myself much deeper in the life and activities of the CS-DC community.

My principal objectives are:

* To involve junior and senior researchers from my university in activities regarding research and education related to complex systems.
* To involve universities and research institutes to actively contribute to the CS-DC development.
* To involve myself in the joint coordination with other CS-DC members of a doctoral and postdoctoral students’ group that will be involved in the CS-DC community works.
* To strengthen the research direction with the theme: applications of intelligent complex systems and machine intelligence measuring. One of the subtopics of interest will be the application of complex systems, artificial intelligence and data science in medicine, pharmacology, and healthcare.


'''Flavia Mori SARTI, Ph.D., Professor and Researcher, University of Sao Paulo, Brazil'''

I would like to present my candidature for the CS-DC Executive Committee in the period 2022-2024 to contribute to the dissemination of Complex Systems Science.

I have been representative of the University of Sao Paulo (USP) at the CS-DC since 2012, and I have been working with complex systems since the creation of the Interdisciplinary Research Group of Complex Systems Modelling at the School of Arts, Sciences and Humanities (EACH-USP) in 2006. Our research group succesfully implemented the first interdisciplinary graduate program (Master) in Complex Systems Modelling in Brazil, in 2010. I have been participating in the coordinating commission of the program since 2010, and I was coordinator of the graduate program from 2010 to 2014.

I have supervised seven students in the Master program, which resulted in thesis, book chapters, and papers published on the subject of complex systems, including models on tax evasion, health systems regulation, food policy and nutrition programs, and complex networks on scientific collaboration and international food trade. I also contributed to the organization of the e-Session &quot;Economics as a Complex Evolutionist System&quot; on the CS-DC'15 World e-conference in 2015, and have been invited to present seminars on complex systems applied to health economics, health technology assessment, and public policy of nutrition and health.

My goals in the CS-DC Executive Committee include:

* To disseminate the role of CS-DC in education and research on Complex Systems, especially in Brazil and other developing countries;
* To support and to engage other research groups working with Complex Systems for participation in the CS-DC;
* To contribute further with management and organization of CS-DC activities during the period of 2022-2024;
* To continue supporting capacity building in Complex Systems through the Complex Systems Modelling Program at USP;
* To participate in innovation, research and development activities based on the application of Complex Systems in public policy and entrepreneurship.


'''Pr Panos Argyarakis, Professor in the University of Thessaloniki, Greece.'''

I have been with the Complex Systems Society since its inception in 2004 by participating in the NEST projects Dysonet and Giacs which created CSS. My experience in the Executive Committee will be to contribute towards the spreading of the Complexity idea to various levels of education throughout the different countries. I am currently the PI in an Erasmus+ network that introduces new models of teaching and investigating how is education been affected for future generations. I can contribute in decision making for such important activities, and also serve as liaison with the European Commission, and the Complex Systems Society, due to my past experience. I have extended organizational experience by organizing several internationally meetings in this field that were attended by large audiences. My research interests are related to Complex systems and Networks. Scale-free, random, and small world networks. Dynamic properties on networks, Diffusion, spreading phenomena on networks, disease spreading. Phase transitions, percolation model, reaction-diffusion processes, trapping processes. Random walks.


'''Ali Moussaoui, Professor, University of Tlemcen, Department of Mathematics, Algeria,'''

I wish to present my candidature to become member of the executive committee of the CS-DC, I wish to develop collaborations with the partner universities in the field of complex systems. I wish to participate in the creation of international mixed laboratories and international masters on complex systems.

In the past, I was responsible for a master's degree entitled: modeling of complex systems in our department, I am currently responsible for a research team entitled: Modeling of complex systems in our laboratory, I was responsible for a Franco-Algerian project on the modeling of complex systems. My research skills are focused on the modeling of complex natural and biological systems.

'''Carlos Gershenson, Research Professor, Universidad Nacional Autónoma de México.'''

I was involved with CS-DC in its initial years in UNESCO's UniTwin, also representing UNAM. I have been editor-in-chief of Complexity Digest since 2007. I co-organized the Conference on Complex Systems in 2017. I am currently vice-president secretary of the Complex Systems Society (CSS).

I am a strong proponent of open online learning. I managed to start a collaboration between UNAM and Coursera, which has led to more than a hundred MOOCs and millions of enrolled students.

I would be interested in strengthening the relationship between CS-DC and CSS, as well as other organizations.

==Elected members to the Executive Committee for 2021 ==
'''Carlos J. BARRIOS H., PhD., Professor, Bucaramanga, Colombia '''

I write to express my interest to candidacy to be part of the CS-DC Executive Committee. I'm very motivated to develop actions to strengthen digital ecosystem supporting research and education proposals of our CS-DC Council. Among these years participating in the CS-DC group, I can see different ways to leverage the impact and the development of our actions with computational strategies, and now, I want to be part of the leadership council joined mutual visions.

My experience leading the Advanced Computing System for Latin America and Caribbean (SCALAC : http://scalac.redclara.net ) and as member of other leadership boards in international projects (mainly between Europe and Latin America) supports my candidature. (linkedin.com/in/carlosjaimebh) Also, my role as professor, director and researcher contributes to build the common vision of the CS-DC Council and the leadership of the CS- DC Executive Committee.


'''Mina TEICHER, Professor of Bar-Ilan University, Israël'''

I submit my candidacy to the Executive Committee of the CS Digital Campus. If elected I will work towards our following needs, using my past experience in Professional international societies, universities managements and the data industry : 

* We need in the near future to build an optimal and effective agreement with the Complex System Society.
* We need to build a business  plan for fund raising.
* We need to build a modular budget for 2021.
* We need to build a strategy for geographically extension. 
* We need to build a strategy for thematic  extension. 
* We need to build partnerships with the big multi national high tech Companies in network and in content. 


'''Yasmin MERALI, Professor of University of Hull, UK'''

This manifesto is connected with the ideals that I had as a founding member of our UniNet which was conceived as part of the FP7 ASSYST project.
CS-DC has come a long way since its initial conception. The way I see it, there are three categories that have grown to emerge as our core activities- 
* Capacity building through education and training in Complex Systems Science
* The application of Complex Systems Science to address global challenges
* The advancement of Complex Systems Science through research and development.

I believe this is a good time to link back to the inception of our UNITWIN which was in part inspired by considerations of issues at a human scale, and the desire to address the inequalities that divided the so-called developed and developing countries. This resonates strongly with the ambition of the  Sustainable Development Goals (SDGs) we are currently grappling with.
In the growth phase of the UNITWIN and CSDC we have been focused on extending the size of the network, and scaling up our educational offerings across the digital campus. In the next phase I believe we need to:
# understand and leverage the diversity and distinctive capabilities and resources (e.g. indigenous knowledge) of the countries in our network to develop a healthy ecosystem, and
# tailor the support that we provide to align with the diverse nature of their relational and social capital and their economic, political and environmental challenges and priorities with regard to the SDGs.  

I am concerned that if we do not explicitly design a social/ideational exchange mechanism that attends to these two imperatives, we will not have full, active participation of all member institutions, and the countries of the South that do not currently have champions in Europe will be marginalized.

If elected I would champion a strategy of organizing ourselves following the Complex Adaptive Systems paradigm, as a hyper network with dynamically connected local clusters. In practical terms I would like to begin by establishing the local (country-based) clusters and establishing a discourse that would allow us to map the diverse profiles, challenges and aspirations for the different countries. This would then form the basis for the development of a mechanism for shaping the meaningful collaborative development of our three core activities to deliver advances that are globally co-ordinated and locally responsive.

Personal Profile: I am Professor of Systems Thinking at the University of Hull and have served as Director of the Centre Systems Studies there. Prior to that I was Co-Director of the Doctoral Training Centre for Complex Systems Science at the University of Warwick. My research is transdisciplinary, focusing on the use of Complex Systems Science to enhance the resilience of socio-economic systems. I am an Expert advisor to the EU and I have significant experience of lecturing internationally as Visiting Professor in Asia, Europe and the USA.

'''Céline ROZENBLAT: Professor, University of Lausanne - Institut de géographie et de durabilité (IGD), Switzerland'''

I'm pleased to applied to become member of the CS-DC council.
As founding member of CS-DC, my university, the university of Lausanne, is very engaged in Complex sciences.
I would not only represent my university, but also social science as geographer and vice-president of the International Geographical Union and member of the International Science Council commission on Urban Health and Well being.
I would act in the council in specific programs to develop the reality of the Digital Campus of the Complex systems.

All these actions combine very ambitious interdisciplinary approaches, and in this perspective, we developed with CS-DC for 3 years the TIMES Flagship  Territorial Intelligence For Multilevel Equity And Sustainability. It comprises four main programs:

 '''SIRE''': Socially Intelligence Roadmap Ecosystem
 '''POLE:''' Personalized Open Lifelong Education
 '''WOSI:''' Worldwide Open Smart Innovation
 '''WOSP:''' Worldwide Open Stochastic Prediction 

In this perspective a MOOC « Healthy Urban system » is now in development, basing the interdisciplinary approach on the CS-DC Road-Map grid. It seems very useful and relevant in this implementation stage.
I would help to develop other programs in this perspective\[Ellipsis]


'''André TINDANO, Director General of CARFS (African Center for Research and Training in Synecoculture)'''

What motivates me to aspire to the position of member of the executive committee of CS DC is my long term participation in the promotion of sustainable development and my commitment to the sharing of knowledge and expertise.

My research interests Sustainable agriculture, ecology, nutrition, life science. I have a strong experience  in:
* Administration and management of development projects and programs;
* Accompaniment of associations and groups;
* Technical capacity building (animation of training sessions and reflection workshops).
* Action research;
* Sociological, socio-economic and economic studies.
* Development of development projects and programs;
* Training of trainers
* Results Based Management Training (RBM)
* Monitoring and evaluation of development programs and projects;
* Management of programs and development projects;
* Institutional development and organizational strengthening;
* Development and implementation of training / awareness / animation program;
* Very good knowledge of participatory methods
'''Guiou KOBAYASHI, Associate Professor at Federal University of ABC in São Paulo State, Brazil. '''

I worked with fault-tolerant computer systems for nuclear power plants and Metro signaling systems and recently my interests have evolved to resilience properties of Complex Systems. Traditionally, redundancy was the main feature for fault-tolerant and fail-safe systems, but the adaptability and the evolution of Complex Systems are the key elements for the resilience of these systems. How to characterize, design and implement these key elements in our future resilient systems? The Complex System - Digital Campus (CS-DC) is a way to create a world-wide community of researchers, philosophers and students to promote and discuss this kind of questions involving Complex Systems. For me, participating in its foundation was a great honor and I am very glad for the opportunity that I have had to contribute since 2012 in the consolidation of CS-DC.

Through this manifest I am applying to be one of the members of the new CS-DC's Executive Committee. I would like to help just a little more to strengthen and structure this fantastic community through which I had the opportunity to meet important people with very interesting works that expanded my knowledge of Complex Systems. Although my University and my personal contribution for CS-DC are very limited and small, I hope to continue to work with this great team.


'''Pierre COLLET, Professor of Computer Science, University of Strasbourg, France. Co-coordinator of the CS-DC UNESCO UniTwin'''

The CS-DC initiated by Paul Bourgine, Jeffrey Johnson, Cyrille Bertelle and many others has been an extraordinary adventure a) to instantiate as a UNESCO UniTwin and b) to develop and run since it was enacted in July 2014. Many a night have been spent on designing its inner workings, so that it can deliver an effective affordance for the scientists who wish to develop the science and teaching of Complex Systems. Indeed, many projects seeded in the CS-DC have come to fruition, showing the enormous potential of this fertile environment not only for research, but also for teaching: the BBB rooms set up by the CS-DC have not only made it possible for the CS-DC to organize conferences, but have also shown their potential as remote teaching rooms in many Universities around the world.

It has been an honour for me to be part of the development of the CS-DC since its beginning, but so much remains to be done!

In this manifesto, I hereby express my strong desire to continue developing the CS-DC in these trying times, when the effects of the pandemics stretch thin the social links that our research and teaching communities need most. My objectives for this new mandate are not only to deliver a new world conference (originally planned in 2020 but unfortunately delayed due to the high toll imposed on us all, teachers and researchers alike, by COVID-19) but also continue on developing not only efficient complex computational ecosystems (cheap powerful PARSEC machines have been installed in several universities) but more specifically remote teaching environments based on complex systems, to mitigate the terrible impact of the pandemic on face to face education, within the POEM CS-DC flagship, on which Paul Bourgine and myself have been working for many years now..


'''Mariana C. BROENS, Professor - UNESP - BRAZIL.'''

As members of the Executive Committee, our main challenge will be to raise, analyse and to discuss possible positive/negative ethical and political implications of the further development of the Complex Systems Science, and their application on studies of everyday social problems. In particular, We believe that the widespread use of complex system models and Big Data analytics can bring important questions about people's privacy, personal and corporate responsibility, widespread surveillance by public or private institutions, among many others, that should be deeply discussed in our community. Our contribution will be to raise and deepen these discussions from an interdisciplinary perspective.


'''Cyrille Bertelle, Professor in Computer Sciences,  University Le Havre, France, co-coordinator of the CS-DC UNESCO UniTwin'''

I am a candidate for the CS-DC Executive Committee to represent the University of Le Havre
Normandy, which is co-coordinator with the University of Strasbourg of the convention of
recognition of the CS-DC as UniTwin by UNESCO. The University of Le Havre has made
available to the community, resources and skills to provide digital collaborative tools for the
organization of the Councils and the CS-DC'15 virtual conference.

The objective I wish to take is to facilitate the involvement of member universities not only
by their representatives on the council but by allowing researchers from these member
institutions to join concrete and accessible actions.

Co-responsible in the past of a master's degree on complex systems and then of the creation
of the institute on complex systems in Normandie (France) in a multidisciplinary framework,
I have participated in the setting up of the project labeled by the French national program of
investments for the future and entitled &quot;Smart Port City&quot;. The aim is to think about the
future of territories in a sustainable development approach supported by new technologies
and concerned about the environment and the well-being of their citizens. My research skills
are focused on implementing the complexity of complex dynamic systems and networks,
crossing behavioral scales from the interaction of human behaviors to the technical
networks of the territory. 

The book &quot;complex systems, smart territories and mobility&quot; from
the Springer's Understanding Complex Systems series, which will be published in January
2021 (https://www.springer.com/gp/book/9783030593018) illustrates the research
coordination actions that I lead in these fields.


'''Slimane Ben Miled, Senior Researcher at Pasteur Institute of Tunis, Professor at ENIT'''

Our Tunisian consortium want to constitute a collaborative Research Training Programs to increase data science capacity related to health research in Africa by building trainings and enhancing institutional capacity at African academic institutions.
The academy/project is based on 4 pillars to build a training ecosystem for Data and Engineering Science in health.
# A platform of federated master’s programs with à la carte optional courses covering informatics/computer science, biomedical informatics, data science, statistics, and public health). Each program will keep its independence, with a mention to the academy label, and this platform will allow to enrich the training with optional modules, seminars, and courses in the partner institutions. New curricula will be created in relation to ethical issues.
# Network of Doctoral programs and Executive programs
# Platform of federated Business incubator and a career center offers training, support and funding for projects related to the project’s topic.

This challenge is in perfect agreement with the Sustainable Development Goal 3 and the CS-DC flagship PHYSIOMES (Personalized Health phYSIcally, sOcially and Mentally for Each in their networkS).


'''Masa Funabashi: researcher of open complex systems at Sony Computer Science Laboratories, Inc.'''

I would like to contribute to the executive committee of CS-DC on the following two pillars:
* Promote the FOOD (From smart agrOecOnomy to smart fooD) flagship project that aims to resolve the health-diet-environment trilemma through the promotion of sustainable food systems, in collaboration with the e-lab &quot;human augmentation of ecosystems&quot; members institution: Sony CSL, Synecoculture Association, CARFS, and those who wish to participate in CS-DC collaboration.
* Construct a basic e-learning content on Synecoculture and ecological literacy as a part of CS-DC MOOCs and perform initial trials, principally in ECOWAS countries, through the Sony CSL-CARFS collaboration.

Through the development of on-going activities in FOOD project and making synergy with other flagship projects, I would like to contribute CS-DC as a member of the executive committee and realize further extension toward the achievement of global sustainability goals such as SDGs.


'''Dr Mohamed Abdellahi (Ould BABAH) Ebbe, Mauritania, '''
* General Director of the Institut du Sahel/CILSS www.insah.org; 
* Executive Director of the Orthopterist Society (400 researchers among the globe) https://orthsoc.org/

By obtaining the honor of having your hoped-for confidence for this post of member of the executive council of the CS-DC, I will work, in priority and in the short term on two main subjects:
# '''The transboundary plague of the Desert Locust (Schistocerca gregaria (Forska l , 1775))''' This plague of the Desert Locust of more than 3000 years that cites all our holy books (the Tourah, the Bible and the Koran) and which continues to be present to this day and to wreak devastating devastation. In case of invasion, it can affect the agriculture and pastures of about 25 countries including those of the poorest countries of the world, from Mauritania to India, while its best and most effective strategy of struggle is preventive struggle by targeting its first centers of gregarization which are very small in space and much better known today. In 2005, the costs of its struggle in the Sahel and North Africa amounted to half a billion dollars, with 8 million farmers and pastoralists affected in the Sahel. It also massively invaded Asia and Africa. 'East Africa in 2020. On this subject, I have spent 30 years studying and fighting and developing a national strategy against this scourge which has made it possible to establish a whole prevention model and an institutional, technical, operational mechanism. and scientific effective in my country that can be adapted and copied and in all other affected countries: Biogeography of the desert locust Schistocerca gregaria, Forskal, 1775: Identification, characterization and originality of a gregarious focus in central Mauritania (HR.HORS COLLEC.) (French Edition) - Babah Ebbe, Mohamed Abdallahi | 9782705670573 | Amazon.com.au | Books http://www.worldbank.org/en/news/feature/2010/01/07/improved-ways-to-prevent-the-desert-locust-in-mauritania-and-the-sahel, http: // whatsnext.blogs.cnn.com/2012/02/02/in-mauritania-sunny-with-a-chance-of-locusts/
# '''The Sahel Institute (INSAH) www.insah.org of the Permanent Interstate Committee for Drought Control (CILSS)''' that I lead and which has been doing extraordinary work for almost half a century in the field of research and development of animal and plant production techniques and also in the field of support for demographic, population and development policies, in favor of the populations of our 13 Sahelian, coastal and island member countries. This work covered the majority of good practice technologies in the field of plant and animal production, natural resource management, land restauration, cultivation techniques, post-harvest, machining, dehulling operations technology. / ginning, Conservation and storage, good resilience practices

Research on the demographic dividend, gender and the empowerment of women and the Population / Development interrelations ... etc
The results of all this work are contained in a database. data, online http://publications.insah.org/, containing more than 1,500 books, scientific and technical articles that will have to be modernized and connected to the CS Meta data.

Finally, I will work actively with my colleagues on the Executive Board on all aspects of other cross-border scourges but also all aspects of improving agro-sylvo-pastoral production tools as well as the fight against poverty and food insecurity and nutrition in line with the goals (SDGs)


'''Dr. Habil. László Barna Iantovics, Associate Professor at “George Emil Palade” University of Medicine, Pharmacy, Science and Technology of Targu Mures, Romania.''' 

With the present manifesto, I would like to candidate as a member of the CS-DC Executive Committee. I am the representative of “George Emil Palade” University of Medicine, Pharmacy, Science and Technology of Targu Mures from Romania in CS-DC.

Some of my research and academic activities are related to the complex systems, including: publications, organization of conferences (e.g. Symposium on Understanding Intelligent and Complex Systems - UICS 2009; 1st Int. Conf. on Complexity and Intelligence of the Artificial and Natural Complex Systems Medical Applications of the Complex Systems. Biomedical Computing -CANS 2008; 1st Int. Conf. on Bio-Inspired Computational Methods Used for Difficult Problems Solving. Development of Intelligent and Complex Systems - BICS 2008), contribution to conference committees (e.g. Int. Conf. Emergent Proprieties in Natural and Artificial Complex Systems - EPNACS 2007; Workshop on Complex Systems and Self-organization Modeling -CoSSoM 2009), preparing journal special issues (e.g. Special Issue on Complexity in Sciences and Artificial Intelligence; Special Issue on Understanding Complex Systems), participating in journal’s editorial board (e.g. Complex Adaptive Systems Modeling -CASM, SpringerOpen), and contribution to research in projects and projects coordination (Social network of machines- SOON; Hybrid Medical Complex Systems -ComplexMediSys). I was the director of the center Advanced Computational Technologies – AdvCompTech in the frame of my university. At present, I am the director of the Center for Advanced Research in Information Technology from my university.

I would like much deeper involve myself in the life and activities of the CS-DC community.

My objectives:

* To involve junior and senior researchers from my university in activities regarding research and education. To motivate universities and research institutes from my country to contribute to CS-DC. I consider also universities and research institutes with that I have collaboration in the past.
* To PROPOSE the formation of a so-called doctoral and postdoctoral students group. In the case of doctoral and postdoctoral students probably in time more students would like to be involved in activities. In this framework, I suggest the organization yearly 3 times (from 4 to 4 months) workshops in that all the interested students could discuss, present their research and research in progress. With this occasion in the frame of workshops if there is interest could be established separate sessions with presentations also by B.Sc. and M.Sc. students.
* To PROPOSE the strengthening of the following research direction with the general topic: intelligent complex systems and machine intelligence measuring. One of the subtopic by interest will be complex systems approaches in medicine and healthcare. To be accomplishable this subject I propose in a first step the formation of a group of interested persons, after then the establishment of the functionality of the group, for example: discussions when are subjects that should be discussed etc.

==Elected members to the Executive Committee &amp; as (Deputy-)Presidents==


'''Jeffrey JOHNSON, Professor of Complexity Science and Design, The Open University, UK'''

I offer myself as a candidate both to be President and to the Executive Committee of  The UNESCO UniTwin Complex Systems Digital Campus (CS-DC) so that I can help to drive it forward to achieve it goals. 

I am particularly committed to our educational efforts. I have made four MOOCs on the FutureLearn Platform for CS-DC  ( https://www.futurelearn.com/partners/unesco-unitwin-complex-systems-digital-campus ): Global Systems Science (2015-16); Systems Thinking and Complexity (2017-18); First Steps in Data Science with Google Analytics (2018-19) and  COVID-19 - Pandemics, Modelling and Policy (2020). CS-DC has a great opportunity to become the global university providing interdisciplinary education for a better world.

I am also committed to our research mission with UNESCO towards the achieving the U.N. Sustainable Development Goals. My own research on representing the dynamics of complex multilevel systems is relevant to many of the research initiatives of CS-DC.

I have extensive experience working within the complex systems community. I have run various coordination actions supporting research programmes funded by the European Commission, I am a founder member and past president of the Complex Systems Society, and I am Deputy-President of the CS-DC. I believe this experience will enable me to make a significant contribution the CS-DC over the next three years.


'''Paul BOURGINE, present President of the UNESCO UniTwin CS-DC, Complex Systems Institute of Paris'''

I offer myself as a candidate both to be President and to the Executive Committee of  The UNESCO UniTwin Complex Systems Digital Campus (CS-DC).

If elected, my main commitment is to create the conditions for a self-organized development of our UniTwin UNESCO CS-DC as autonomous communities of communities. This self-similar development will be the case both for the two main branches the UniTwin branch of our institutional members and the global eCampus branches of our individual scientific members:
* for the UniTwin branch, the communities of communities are a territorial cascade with Smart Continents, smart countries, smart cities for their sustainable development according our flagship TIMES (Territorial Intelligence for Multilevel Equity and Sustainability). The roadmap is always the same, i.e. the cascade of the 17 Sustainable Development Goals and their 169 Targets: but their relative importance and coherence within this cascade vary from one territory to the others. The institutional members of the UniTwin branch have signed their agreement with the Cooperation Programme signed with UNESCO. In 2021, the CS-DC will ask for a cascade of agreements inside each institutional member, in order to have a &quot;one for all&quot; amplification within the other branch, the e-campus branch. 
* for the eCampus branch, the cascade of communities is along the refinement cascades when studying the theoretical and experimental challenges of complex systems. With Smart Continents'21, scientists are proposing their individual challenges that enact basic communities and communities of communities within the e-departments. In the &quot;all for one&quot; return, the roadmap of each university is the cascade of roadmaps within the eCampus where the University has at least one member. Furthermore each community can organise a monthly e-seminar or e-session in workshop as well as in CS-DC'21 for recorded advanced introductions. Such advanced introductions can be the basis for curriculum largely shared by the set of Universities having members in the  community cascade of the curriculum.

This &quot;accelerator of knowledge and knowhow one for all and all for one&quot; will first benefit to the student curriculum through the flagship POEM (Personalized Open Education for the Masses). This accelerator can be extended through the flagship POLE (Personalized Open Lifelong Education) for a lifelong education. This extended accelerator will be open to all, independently of previously achieved academic levels, respectful of the diversity of social and cultural environments and in a higher and higher inclusive way including refugees, migrants and primary people. genders, religions or ways of life.</text>
      <sha1>82mxu2i2nksmawfe1nrlxrjn1vpgfll</sha1>
    </revision>
  </page>
  <page>
    <title>Vertical farming</title>
    <ns>0</ns>
    <id>273972</id>
    <revision>
      <id>2809869</id>
      <parentid>2433281</parentid>
      <timestamp>2026-05-17T05:05:33Z</timestamp>
      <contributor>
        <username>Amnsalem</username>
        <id>3076913</id>
      </contributor>
      <comment>Erased a word that was repeated</comment>
      <origin>2809869</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="5047" sha1="caq8q6tb0yfxvput2q29x1n65cwtta0" xml:space="preserve">This is a learning resource about vertical farming. Research, learning, and teaching related to vertical farming can be organized here. Perhaps in the future, open source designs for vertical farms can be developed. Vertical farming can potentially help to eliminate poverty on Earth. [[Image:IFarm.fi Vertical farm Finland.jpg|thumb|340px]]
{{RightTOC}}
==Discussion questions==
* To what degree could vertical farming help to eliminate hunger on Earth? 
** Explore the [[Sustainable Development Goals]]. Identify other goals (SDGs) that are linked to vertical farming beside [[Sustainable Development Goals/SDG2|Zero Hunger]]? 
** How are these goals interdependent? 
** What are the callenges and constraints for a sustainable implementation and what are the benefits?
* Could designs for vertical farms that are open source help to accelerate adoption of the technology? (see also [[Open Innovation Ecosystem]])
* Can vertical farming be profitable with current technologies?

==Learning readings and learning videos==
===Wikipedia===
{{colbegin|3}}
* [[w:Vertical farming|Vertical farming]]
* [[w:Controlled-environment agriculture|Controlled-environment agriculture]]
* [[w:Building-integrated agriculture|Building-integrated agriculture]]
* [[w:Controlled Environment Agriculture Center|Controlled Environment Agriculture Center]]
* [[w:Urban agriculture|Urban agriculture]]
* [[w:Roof garden|Roof garden]]
* [[w:Seascraper|Seascraper]]
* [[w:Organic engineering systems|Organic engineering systems]]
* [[w:Organic hydroponics|Organic hydroponics]]
* [[w:Hydroponics|Hydroponics]]
* [[w:Digeponics|Digeponics]]
* [[w:Grow light|Grow light]]
* [[w:PI curve|PI curve]]
* [[w:Hydroponic dosers|Hydroponic dosers]]
* [[w:Ultrasonic hydroponic fogger|Ultrasonic hydroponic fogger]]
* [[w:Passive hydroponics|Passive hydroponics]]
* [[w:Greenhouse|Greenhouse]]
* [[w:Dickson Despommier|Dickson Despommier]]
* [[w:Aeroponics|Aeroponics]]
* [[w:Aerial root|Aerial root]]
* [[w:Arcology|Arcology]]
* [[w:Foodscaping|Foodscaping]]
* [[w:Association for Vertical Farming|Association for Vertical Farming]]
{{colend}}
===Learning videos===
* [https://www.youtube.com/watch?v=x5QTyxZW040 How Can We Improve Vertical Farming?] - this video includes discussion of phase 3 vertical farming which includes staples like rice and wheat.

==Open source vertical farming==
* [https://growstack.org/ Grow Stack]
* [https://www-prod.media.mit.edu/groups/open-agriculture-openag/overview/ MIT Open Agriculture Initiative]
* [https://hectar.co.uk/ Hectar]
:* [https://hectar.co.uk/wp-content/uploads/2021/03/Hectar-V0.9-Free-Standing-Manufaturing-Manual.pdf Hectar Vertical Farm Plans]

==See also==
{{colbegin|3}}
*[[Domestic house food production system]]
* [[Low-Cost Precision Farming]]
* [[Food security]]
* [[Worm farming]]
* [[Futurology]]
* [[Aquaculture]]
* [[Coffee Farming]]
* [[Open projects/Open design vertical farm|Open design vertical farm]]
* [[Rainwater harvesting]]
* [[Portal:Water Technologies]]
* [[Drones/Agriculture]]
* [[Organic agriculture]]
* [[Sustainability]]
* [[Portal:Agriculture]]
* [[Horticulture]]
* [[Forestry]]
* [[Portal:Agricultural engineering]]
* [[Agriculture papers]]
* [[Agronomy#Agriculture]]
* [[Hydrology]]
* [[Ecological sustainability]]
* [[Low-cost, tropical, private food production system]]
* [[Plant growth promoting bacteria]]
* [[Wiki business plan/Feed Everyone Project]]
* [[Introduction to Permaculture]]
* [[Hydroculture]]
{{colend}}

==External links==
* [https://digital.hbs.edu/platform-rctom/submission/can-vertical-farming-keep-this-company-around-for-another-165-years/ Can Vertical Farming Keep This Company Around for Another 165 Years?]
* [https://caes.ucdavis.edu/news/uc-davis-vertical-farming-facility-takes-hydroponics-whole-new-level UC Davis vertical farming facility takes hydroponics to a new level]
* [https://ceac.arizona.edu/research/uag-vertical-farm UAg Vertical Farm]
* [https://cals.ncsu.edu/news/growing-up-vertical-farming-makes-the-most-of-limited-space/ Vertical Farming Makes the Most of Limited Space]
* [https://edis.ifas.ufl.edu/fr429 Indoor Vertical Farming Systems for Food Security and Resource Sustainability]
* [https://sustain.gatech.edu/blog/are-vertical-farms-sustainable-solution-food-insecurity Are vertical farms a sustainable solution to food insecurity?]
* [https://ourworld.unu.edu/en/farming-in-the-sky-in-singapore Farming in the Sky in Singapore]
* [https://blogs.anderson.ucla.edu/global-supply-chain/2019/08/the-environmental-and-social-value-of-vertical-farming.html The environmental and social value of Vertical Farming]
* [https://www.hult.edu/blog/vertical-farming-mark-esposito/ Vertical farming: A tech-driven solution for food security]
* [https://illumin.usc.edu/rising-above-agricultural-challenges-with-vertical-farming/ Rising Above Agricultural Challenges with Vertical Farming]
* [https://today.tamu.edu/2020/03/10/the-future-of-farming-straight-up/ The Future Of Farming: Straight Up]

[[Category:Agriculture]]
[[Category:Vertical farming]]</text>
      <sha1>caq8q6tb0yfxvput2q29x1n65cwtta0</sha1>
    </revision>
  </page>
  <page>
    <title>Should the monarchy in the UK be abolished?</title>
    <ns>0</ns>
    <id>281721</id>
    <revision>
      <id>2809828</id>
      <parentid>2693902</parentid>
      <timestamp>2026-05-17T03:42:43Z</timestamp>
      <contributor>
        <username>HenriPittier</username>
        <id>3076895</id>
      </contributor>
      <origin>2809828</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="4502" sha1="eq9p9tcx45z05udg3dv4cdwv91dxw56" xml:space="preserve">{{Delete|vandalism}}

The '''monarchy of the United Kingdom''', commonly referred to as the '''British monarchy''', is the constitutional form of government by which a hereditary sovereign reigns as the head of State of the United Kingdom, the Crown dependencies (the Bailiwick of Guernsey, the Bailiwick of Jersey and the Isle of Man) and the British Overseas Territories. The current monarch is King Charles III, who ascended the throne this year in 2022, upon the death of Queen Elizabeth II, who was the ascended the throne in 1952.

== The monarchy of the United Kingdom should be abolished ==

=== Arguments for ===
* {{Argument for}} Economically there seems to be no need for a monarch. The Sovereign Grant is expected to be in the region of £34 million per year, although the campaign group Republic claims that the total cost to the taxpayer is closer to £200 million {{Citation needed}}.
** {{Objection}} This is merely an investment that reaps rewards for the tourism industry.
*** {{Objection}} According to Visit England, none of the royal residences are in the list of England's top 20 tourist attractions {{Citation needed}}. England's most visited historic residence is the Tower of London, which is no longer run by the Crown.
*** {{Objection}} If the monarchy would be abolished tomorrow, the economy would likely receive a boost from having Buckingham Palace and other residences fully open to fee-paying tourists.
* {{Argument for}} If egalitarian principles are followed, there is no reason to believe some people should inherit political power simply by being born. With an unelected Head of State, UK´ democracy is incomplete.
** {{Objection}} The public feels good about the monarchy.
*** {{Objection}} Perhaps the public felt good about Elizabeth Windsor, the person. Many US citizens might feel good about (former) President Jimmy Carter, but not like to have him forever as an unelected president.

=== Arguments against ===
* {{Argument against}} Becoming a republic nation has few concrete advantages, compared to UK´ current (good) situation.
** {{Objection}} Equality amongst all citizen is a pretty good advantage. Not having someone have more power because of the family they were born in is an advantage
* {{Argument against}} The British monarch represents the UK, not the ephemeral, often unpopular politics of the UK. The King or Queen is, quite literally, the face of the nation.
** {{Objection}} The British monarch has at least great ''de jure'' political power, so it does represent UK´ politics.
* {{Argument against}} The Queen has never taken a day off during her 60-year reign, and the same can be said of most of the other senior royals {{Citation needed}}.
** {{Objection}} This is not a sufficient condition for holding the position of Head of State. Is the Queen the most hard-working British citizen? Unlikely.
* {{Argument against}} Public support for the monarchy has never been higher; 80% of people want to keep the status quo, with only 13% saying they would rather abolish the Royal Family.
** {{Objection}} An objective of a debate is to examine good arguments for the motion. If these are found, perhaps the public can be convinced to change their stance. A public support for a motion or position does not automatically make it good: there was good public support for slavery in Ancient Greece and in southern states of the United States of America, yet we do not take that to mean that slavery was good.
* {{Argument against}} The monarch is useful for reducing the risk of corruption in Parliament by being an independant power capable of intervening if something goes awry. If, for example, a tyrannical party comes into power, the King can refuse to declare wars on their behalf and replace the prime minister with a non-corrupt MP.
** {{Objection}} What if there becomes a corrupt monarch?

== The monarchy of the United Kingdom should be less powerful and/or not live so luxuriously.==
* {{Argument for}} There is no sufficient reason why the British monarch should have as much power as they have if they are not going to use it, while it would be undemocratic if they did so.
* {{Argument for}} There is no sufficient reason why the British monarch should live so luxuriously. Taxpayer money should benefit wider society and help those in need, not ensure that people live in extreme wealth.

== Notes and references ==
{{Reflist}}

== External links ==
{{wp|Abolition of monarchy}}
{{wq|Monarchy}}


[[Category:United Kingdom]]</text>
      <sha1>eq9p9tcx45z05udg3dv4cdwv91dxw56</sha1>
    </revision>
    <revision>
      <id>2809867</id>
      <parentid>2809828</parentid>
      <timestamp>2026-05-17T04:30:39Z</timestamp>
      <contributor>
        <username>NguoiDungKhongDinhDanh</username>
        <id>2922842</id>
      </contributor>
      <minor />
      <comment>Reverted edit by [[Special:Contributions/HenriPittier|HenriPittier]] ([[User_talk:HenriPittier|talk]]) to last version by [[User:DMBFFF|DMBFFF]] using [[Wikiversity:Rollback|rollback]]</comment>
      <origin>2693902</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="4496" sha1="0j3r1z4oldvk8vwrqa3mnk9c4etbg6t" xml:space="preserve">{{Wikidebate}}

The '''monarchy of the United Kingdom''', commonly referred to as the '''British monarchy''', is the constitutional form of government by which a hereditary sovereign reigns as the head of State of the United Kingdom, the Crown dependencies (the Bailiwick of Guernsey, the Bailiwick of Jersey and the Isle of Man) and the British Overseas Territories. The current monarch is King Charles III, who ascended the throne this year in 2022, upon the death of Queen Elizabeth II, who was the ascended the throne in 1952.

== The monarchy of the United Kingdom should be abolished ==

=== Arguments for ===
* {{Argument for}} Economically there seems to be no need for a monarch. The Sovereign Grant is expected to be in the region of £34 million per year, although the campaign group Republic claims that the total cost to the taxpayer is closer to £200 million {{Citation needed}}.
** {{Objection}} This is merely an investment that reaps rewards for the tourism industry.
*** {{Objection}} According to Visit England, none of the royal residences are in the list of England's top 20 tourist attractions {{Citation needed}}. England's most visited historic residence is the Tower of London, which is no longer run by the Crown.
*** {{Objection}} If the monarchy would be abolished tomorrow, the economy would likely receive a boost from having Buckingham Palace and other residences fully open to fee-paying tourists.
* {{Argument for}} If egalitarian principles are followed, there is no reason to believe some people should inherit political power simply by being born. With an unelected Head of State, UK´ democracy is incomplete.
** {{Objection}} The public feels good about the monarchy.
*** {{Objection}} Perhaps the public felt good about Elizabeth Windsor, the person. Many US citizens might feel good about (former) President Jimmy Carter, but not like to have him forever as an unelected president.

=== Arguments against ===
* {{Argument against}} Becoming a republic nation has few concrete advantages, compared to UK´ current (good) situation.
** {{Objection}} Equality amongst all citizen is a pretty good advantage. Not having someone have more power because of the family they were born in is an advantage
* {{Argument against}} The British monarch represents the UK, not the ephemeral, often unpopular politics of the UK. The King or Queen is, quite literally, the face of the nation.
** {{Objection}} The British monarch has at least great ''de jure'' political power, so it does represent UK´ politics.
* {{Argument against}} The Queen has never taken a day off during her 60-year reign, and the same can be said of most of the other senior royals {{Citation needed}}.
** {{Objection}} This is not a sufficient condition for holding the position of Head of State. Is the Queen the most hard-working British citizen? Unlikely.
* {{Argument against}} Public support for the monarchy has never been higher; 80% of people want to keep the status quo, with only 13% saying they would rather abolish the Royal Family.
** {{Objection}} An objective of a debate is to examine good arguments for the motion. If these are found, perhaps the public can be convinced to change their stance. A public support for a motion or position does not automatically make it good: there was good public support for slavery in Ancient Greece and in southern states of the United States of America, yet we do not take that to mean that slavery was good.
* {{Argument against}} The monarch is useful for reducing the risk of corruption in Parliament by being an independant power capable of intervening if something goes awry. If, for example, a tyrannical party comes into power, the King can refuse to declare wars on their behalf and replace the prime minister with a non-corrupt MP.
** {{Objection}} What if there becomes a corrupt monarch?

== The monarchy of the United Kingdom should be less powerful and/or not live so luxuriously.==
* {{Argument for}} There is no sufficient reason why the British monarch should have as much power as they have if they are not going to use it, while it would be undemocratic if they did so.
* {{Argument for}} There is no sufficient reason why the British monarch should live so luxuriously. Taxpayer money should benefit wider society and help those in need, not ensure that people live in extreme wealth.

== Notes and references ==
{{Reflist}}

== External links ==
{{wp|Abolition of monarchy}}
{{wq|Monarchy}}


[[Category:United Kingdom]]</text>
      <sha1>0j3r1z4oldvk8vwrqa3mnk9c4etbg6t</sha1>
    </revision>
  </page>
  <page>
    <title>Physics/Introduction</title>
    <ns>0</ns>
    <id>282310</id>
    <revision>
      <id>2809896</id>
      <parentid>2708337</parentid>
      <timestamp>2026-05-17T10:31:27Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <comment>/* Modern branches of physics */ - prod</comment>
      <origin>2809896</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="10882" sha1="culgn16vct8q4tbwtphrr56b1vtdyi2" xml:space="preserve">Physics is the scientific study of matter (tangible, material objects with [[wikipedia:Mass|mass]]), energy, and the dynamics of matter &amp; energy within the universe as we observe it. Physics is used to describe the world as we see it, predict the state of a given system in the future (and, inversely, reverse the process to predict what the starting conditions of a system were), and to ultimately create '''laws''' (&quot;broad observations about how the universe behaves&quot;) and '''theories''' (&quot;attempted explanations for the laws&quot;).   

Physics is distinct from philosophy, in that physics and philosophy are used to solve separate classes of problems. A question a physicist might be well-suited to answer would be &quot;If I toss a ball at a certain velocity and angle from the horizon, how far does the ball land away from me?&quot;, where a philosopher would be better suited to answer &quot;What is the meaning of life?&quot;. Physics can be used to help aid philosophical discussion and vice versa, but very rarely do the fields overlap, simply because physics is a '''science'''.    

== Relationship with Mathematics ==
Mathematics is the best way to describe physics. The relationship between mathematics and physics is extremely close: the American physicist Richard Feynman famously described Calculus, a branch of mathematics devoted to the study of changing functions, as &quot;The language God speaks&quot;. In learning physics, the more familiar one is with mathematics, the more fulfilling the study of physics will be to a student.    

One possible course of study for the mathematics required to do physics is:    

# '''Arithmetic''' (addition, subtraction, multiplication, and division is foundational to the other, more interesting branches of mathematics.)
# '''Geometry''' (the study of shapes and symmetry is useful for simplifying and understanding more difficult problems.) 
# '''Algebra''' (rearranging equations for an unknown variable lets us make useful conclusions out of incomplete information.)
# '''Trigonometry''' (The study of angles, circles, and triangles. Getting to here is an excellent starting point for high school physicists.) 
# '''Calculus''' (The mathematics of change. Despite being a highly fulfilling academic pursuit on its own, it gets us remarkably far in understanding the rest of physics.) 
# '''Linear Algebra''' (solving for unknowns in a ''system'' of equations leads to vectors, then launching into applications in further studies in mathematics.) 
# '''Differential equations''' (The real world changes as time goes on, differential equations lets us adjust our math for these changing conditions.)
# '''Multi-dimensional calculus''' 
# '''Probability and Statistics'''   

== Problem-Solving Techniques ==
Physics is used to solve problems. Below are some techniques used by physicists (but sometimes applicable to non-physicists) to tackle problems: suppose we are trying to solve for the position and velocities of two billiard balls after their collision.    

* '''Try a simpler version of the problem'''. (Example: instead of trying to solve for the final velocities of the two billiard balls given any initial angles, could we first try to solve it in one dimension by assuming the balls are held on a single line? That way, we can be better prepared to solve the full problem later, given what we have learned about the problem before. We could also ignore factors like the balls slipping on the table, the angular momentum of the balls, friction with the table, ''et cetera''.) 
* '''Use the defining features of a problem.''' (Example: we know that billiard balls tend to bounce off each other, and never stick to one another. Can we use this to justify an assumption to make the math easier?)
* '''List any equations that might be relevant.''' (Example: it appears that momentum and energy might be conserved, so let's start by writing those two equations: momentum is the product of mass and velocity, and kinetic energy is mass times half of velocity squared: &lt;math&gt;p = mv ;  T = \frac{mv^2}{2}&lt;/math&gt;
* '''Seek Symmetry.''' (Example: if you are trying to find how two billiard balls will collide, can you ignore motion along any direction by assuming the balls won't move in the z-direction (&quot;flying off the table&quot;)?) 
* '''Compute something (anything) to build intuition.''' (Example: instead of trying to find how the starting and ending momentum are related to one another, why don't we try just finding the total momentum? That might help.) 
* '''Run simulations (if possible) to build intuition.''' (Example: although creating a simulation of how the two billiard balls might be impractical without some coding experience, the situation is simple enough to just do experimentally. If you have two billiard balls, bouncy balls, or even marbles lying around, why don't you just try it?) 
* '''Draw pictures.''' (Example: what does the situation we've described even look like?)    

== Modern branches of physics ==
There are two main theories, general relativity and quantum mechanics. General relativity deals with why things fall and quantum mechanics deal with everything else. There is also a thing called special relativity and it can be summarized like this: When things move faster, they become heavier, shorter and experience time slower, all by a factor of &lt;math&gt;\frac{1}{\sqrt{1-\frac{v^2}{c^2}}}&lt;/math&gt;. Energy is just that factor*mass*(speed of light)^2, and momentum is that factor*mass*speed.   

=== General Relativity ===
General relativity says that things fall because the earth curves the space (and time) around it. To see why this works, get a globe. Place your left index finger where the prime meridian and the equator meet. Place your right index finger 90 degrees from your left one, keeping both on the equator. Then slowly run both hands in a straight line, heading north (running your finger represents moving time). Notice how they both collide.

The formula for how space curves is very complicated, but there is a simpler formula that predicts similar things, as long as you're nowhere near a black hole. Otherwise, you should be more focused on getting away from the black hole, if anything. The simpler, not perfectly accurate formula is here: &lt;math&gt;a=\frac{Gm}{r^2}&lt;/math&gt; where a is the acceleration required to keep object at a constant distance r from a mass m. 

=== Quantum mechanics ===
See also: [[Quantum mechanics/Introduction]]

Quantum mechanics describe three main forces, electromagnetism, the strong and weak nuclear force. It also suggests that the position and momentum of everything is a probability cloud, that is, that I am currently in multiple places at once and that I could move at different speeds at once. This also implies that I can change speed sporadically as the uncertainty can mean that my speed may be different in the future. Though, before you call BS on this one though, most objects (and living things) are large enough such that there is a lot of certainty about where I am and how fast I'm moving (as per &lt;math&gt;\Delta p \Delta s\geq\hbar&lt;/math&gt;). The latter implies inertia, a phenomenon in which large things conserve momentum.

There is also another formula: &lt;math&gt;\Delta E \Delta t \geq \hbar&lt;/math&gt;: uncertainty in energy times uncertainty in time is always above some value. This means that in theory, a very high energy or high enough mass could just poof into existence like magic, but it must be gone in a short amount of time such that we can't notice it in all of the noise. This means that energy and mass are conserved, for all intents and purposes. 

=== Context for the rest of the section: ===
[[Chemical Sciences]]

=== Electromagnetism ===
This word is used a lot to talk about nonsense, but trust me, quantum mechanics is not pseudoscience. Electromagnetism the force that attracts or repels two charged objects, like the electrons on my hand and those on the keyboard, allowing me to press the keys on my keyboard. It is explained by the use of photons, particles which are also responsible for sight. So when I push on one of the keys of my keyboard, the electrons in my finger and those on the keyboard exchange photons, forcing the key to go down. Thus, electromagnetism is responsible for so called 'contact forces'.

=== Strong Nuclear Force ===
The strong nuclear force is the force keeping the nuclei inside atoms together. As protons are repelled by each other, due to having the same charge, another force and new particles, one of which is the neutron (the neutron contributes to the strong nuclear force, but not to the electromagnetic repulsion) and the other is the gluon, which carries the force. So in a nucleus, the protons and neutrons exchange gluons, keeping it together, though, sometimes, it just isn't enough...

=== Weak Nuclear Force ===
The weak nuclear force is a mechanism for nuclei which don't want to exist (they're called radioactive nuclei) to not exist. Sure, sometimes they might just break apart, but other times, they use this mechanism, called beta decay. When a nucleus has had enough of life, a neutron might decide to turn into a proton and emit an electron (which will go into orbit around the atom) and a new particle called a neutrino. The weak nuclear force is exchanged by the W and Z bosons.

== Test ==

1. Debunk the following flat earth arguments

: 1a. Why doesn't everything fall off if the earth is spinning?
: 1b. Water curves on the round earth. Doesn't water always maintain it's own level?
: 1c. Gravity doesn't exist, therefore it can't make the earth round. Everything falls because denser things are attracted to the earth, displacing
:: lighter objects.

2. Debunk the following anti-5G argument: Electromagnetic radiation, which is given by 5G, is inherently harmful. 

3. Why don't nuclei fly apart?

4. How does beta decay work?

5. What do fast-moving objects do?


== Test answers ==
1a. Gravity keeps things onto the earth, despite the fact that earth is spinning. This is a valid point, as inertia is a thing and large objects will maintain their momentum imparted by the earth, and will fly off into space. But gravity exists, fortunately.

1b. Water does not maintain it's own level. Water molecules are not magically immune to the curvature of space, explaining how water can curve around the earth. 

1c. Your new model doesn't work. For example, place some lead on top of a bag of feathers. The lead doesn't pass through the feathers now, does it?

2. Electromagnetic force is transmitted by photons, aka, light. Therefore, it's rational to assume that 'electromagnetic radiation' means light. Light is not inherently harmful.

3. Nuclei don't fly apart due to the strong nuclear force.

4. Beta decay involves a neutron splitting apart due to the weak nuclear force.

5. Fast moving objects become heavier, shorter and experience time more slowly.

[[Category:Physics]]</text>
      <sha1>culgn16vct8q4tbwtphrr56b1vtdyi2</sha1>
    </revision>
  </page>
  <page>
    <title>Cube root</title>
    <ns>0</ns>
    <id>283163</id>
    <revision>
      <id>2809842</id>
      <parentid>2694525</parentid>
      <timestamp>2026-05-17T03:59:00Z</timestamp>
      <contributor>
        <username>HenriPittier</username>
        <id>3076895</id>
      </contributor>
      <origin>2809842</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="18984" sha1="5p4qj5bdhfxc2c22weyg85qcys9ul81" xml:space="preserve">=Introduction=

{{delete|theme=2}}
[[File:0416cube02.png|thumb|400px|'''
Diagram of cube (in solid black lines.)'''
&lt;/br&gt;
The diagram shows the relationship of width, depth or height to surface area and volume.
]]
A cube is a regular solid in three dimensions with depth, width and height all equal.

In the diagram the figure defined by solid black lines is a cube. Width = depth = height = 2.

The length of one side is 2 units.

The surface area of one side &lt;math&gt;=\ height * depth&lt;/math&gt; or &lt;math&gt;height * width&lt;/math&gt; or 
&lt;math&gt;width * depth = 2 * 2&lt;/math&gt; or &lt;math&gt;2^2&lt;/math&gt; square units. There are 4 square units in each side.

The volume of the cube &lt;math&gt;=\ width * depth * height\ =\ 2 * 2 * 2 = 2^3 = 8&lt;/math&gt; cubic units.

In this case you can see that 8 cubes of 1 unit each, when properly stacked together, form a cube with 
length of each side equal to 2 units and volume equal to 8 cubic units.

In mathematical terms &lt;math&gt;V = s^3 = 2^3 = 8.&lt;/math&gt;

We can say that &lt;math&gt;V = s&lt;/math&gt; raised to the power of 3. Usually we say that &lt;math&gt;V = s&lt;/math&gt; cubed.


The calculation of cube root is the process reversed. Given &lt;math&gt;V&lt;/math&gt; or volume, what is the length of each side?

&lt;math&gt;s = V^{\frac{1}{3}}&lt;/math&gt; read as &lt;math&gt;s = V&lt;/math&gt; raised to the power &lt;math&gt;\frac{1}{3}.&lt;/math&gt;
Usually we say that &lt;math&gt;s = \sqrt[3]{V}&lt;/math&gt; or &lt;math&gt;s =&lt;/math&gt; cube root of &lt;math&gt;V.&lt;/math&gt;

In this case &lt;math&gt;s = \sqrt[3]{8} = 2.&lt;/math&gt;


When &lt;math&gt;s = \sqrt[3]{V}&lt;/math&gt; then &lt;math&gt;s^3 = (\sqrt[3]{V})^3 =  (V^{1/3})^3 = V^{\frac{3}{3}}  = V^1 =      V.&lt;/math&gt;


If &lt;math&gt; s &lt;/math&gt; is negative, then &lt;math&gt;(-s)^3 = (-s)*(-s)*(-s) = -(s * s * s) = -V&lt;/math&gt; and &lt;math&gt;\sqrt[3]{-V} = -s.&lt;/math&gt;
&lt;math&gt;&lt;/math&gt;
{{RoundBoxTop|theme=1}}
In theoretical math the cube root of any real number has 3 values, 1 real and 2 complex. 

On this page, we'll refer to the one real value noting that the cube root of a negative real number is also a negative real number.
{{RoundBoxBottom}}
{{RoundBoxBottom}}

=Calculation=

==Preparation==

{{RoundBoxTop|theme=4}}
It is desired to calculate the cube root of real number &lt;math&gt;N.&lt;/math&gt;


To simplify the process, and to make the implementation of the process predictable, reformat &lt;math&gt;N:&lt;/math&gt;

&lt;math&gt;N = n(10^{3p})&lt;/math&gt; where:

* &lt;math&gt;1 \le n &lt; 1000&lt;/math&gt;

* &lt;math&gt;p&lt;/math&gt; is integer.


Then:
&lt;math&gt;\sqrt[3]{N} = \sqrt[3]{n(10^{3p})} = \sqrt[3]{n}(10^p).&lt;/math&gt;


To simplify the process further, we calculate cube root of &lt;code&gt;abs(n)&lt;/code&gt; and restore negative sign
to result, if necessary.

&lt;syntaxhighlight lang=python&gt;
# python code.

import decimal
dD = decimal.Decimal
dgt = decimal.getcontext()
desired_precision = 100     # Adjust as necessary.
Precision = dgt.prec = desired_precision + 3

NormalizeNumberDebug = 0

def NormalizeNumber (number, flag = 0) :
    '''
sign, newNumber, exponent = NormalizeNumber (number [, flag])
sign &amp; exponent are both ints.
newNumber is Decimal object.
1000 &gt; newNumber &gt;= 1 and
exponent % 3 = 0.
This prepares number for cube root of number.
eg, 1234.56e-2 becomes 123456e-4, 12345600e-6, 12.345600e0, 12.3456e0
    123.456e7 becomes 123456e4, 1234560e3, 1.234560e9, 1.23456e9
'''
    thisName = 'NormalizeNumber () :'
    
    if NormalizeNumberDebug : flag_ = NormalizeNumberDebug
    else : flag_ = flag
    print_ = flag_ &amp; 1 ; print_all = flag_ &amp; 2 ; check = flag_ &amp; 4
    if print_all : print_ = 1
    if print_ : check = 4

    number = dD(str(number))
    if print_ :
        print()
        print(thisName)
        print('  Input number =',number)
    if print_all :
        print('  flag_ =', bin(flag_))

    if number == 0 : return (0, dD(0), 0)

    sign, digits, exponent = tuple(number.as_tuple())

    if print_all :
        print (' ', digits)
        print ('  exponent =', exponent)
    digits = list(digits)

    # Remove leading zeroes.
    while (digits[0] == 0) :
        digits[:1] = []
        if print_all :
            print (' ', digits)
            print ('  exponent =', exponent)

    # Remove trailing zeroes.
    while (digits[-1] == 0) :
        digits[-1:] = [] ; exponent += 1
        if print_all :
            print (' ', digits)
            print ('  exponent =', exponent)

    # Ensure that exponent is exactly divisible by 3.
    while exponent % 3 :
        digits += [0] ; exponent -= 1
        if print_all :
            print (' ', digits)
            print ('  exponent =', exponent)

    number_of_digits = len(digits)
    if number_of_digits &lt;= 3:
        newNumber = dD ( (0,digits,0) )
    else :    
        number_of_integers = number_of_digits % 3
        if number_of_integers == 0 : number_of_integers = 3
        number_of_decimal_places = number_of_digits - number_of_integers
        digits[-number_of_decimal_places:-number_of_decimal_places] = ['.']
        exponent += number_of_decimal_places
        if print_all :
            print (' ', digits)
            print ('  exponent =', exponent)
        while (digits[-1] == 0) :
            del(digits[-1])
            if print_all :
                print (' ', digits)
                print ('  exponent =', exponent)
        newNumber = dD( ''.join([ str(v) for v in digits ]) )

    # If necessary, check.
    if check :
        str1 = str(newNumber)
        dD1 = dD( ('', '-')[sign] + str1 + 'e' + str(exponent) )
        if dD1 != number :
            # This should not happen.
            print (thisName)
            print ('  error:', dD1 , '!=', number)
            return None

    if print_ :
        print (thisName)
        print ('  Output:')
        print ('    sign =', sign)
        print ('    newNumber =', newNumber)
        print ('    exponent =', exponent)

    return sign, newNumber, exponent
&lt;/syntaxhighlight&gt;
{{RoundBoxBottom}}
===Example===
{{RoundBoxTop|theme=3}}
This example illustrates how number &lt;code&gt;N&lt;/code&gt; is changed to conform to desired format.
&lt;syntaxhighlight lang=python&gt;
# python code.

NormalizeNumber ('00123345.6789000000000000', 2)
&lt;/syntaxhighlight&gt;

&lt;syntaxhighlight&gt;
NormalizeNumber () :
  Input number = 123345.6789000000000000
  flag_ = 0b10
  (1, 2, 3, 3, 4, 5, 6, 7, 8, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0)
  exponent = -16
  [1, 2, 3, 3, 4, 5, 6, 7, 8, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
  exponent = -15
  [1, 2, 3, 3, 4, 5, 6, 7, 8, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
  exponent = -14
  [1, 2, 3, 3, 4, 5, 6, 7, 8, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0]
  exponent = -13
  [1, 2, 3, 3, 4, 5, 6, 7, 8, 9, 0, 0, 0, 0, 0, 0, 0, 0]
  exponent = -12
  [1, 2, 3, 3, 4, 5, 6, 7, 8, 9, 0, 0, 0, 0, 0, 0, 0]
  exponent = -11
  [1, 2, 3, 3, 4, 5, 6, 7, 8, 9, 0, 0, 0, 0, 0, 0]
  exponent = -10
  [1, 2, 3, 3, 4, 5, 6, 7, 8, 9, 0, 0, 0, 0, 0]
  exponent = -9
  [1, 2, 3, 3, 4, 5, 6, 7, 8, 9, 0, 0, 0, 0]
  exponent = -8
  [1, 2, 3, 3, 4, 5, 6, 7, 8, 9, 0, 0, 0]
  exponent = -7
  [1, 2, 3, 3, 4, 5, 6, 7, 8, 9, 0, 0]
  exponent = -6
  [1, 2, 3, 3, 4, 5, 6, 7, 8, 9, 0]
  exponent = -5
  [1, 2, 3, 3, 4, 5, 6, 7, 8, 9]
  exponent = -4
  [1, 2, 3, 3, 4, 5, 6, 7, 8, 9, 0]
  exponent = -5
  [1, 2, 3, 3, 4, 5, 6, 7, 8, 9, 0, 0]
  exponent = -6
  [1, 2, 3, '.', 3, 4, 5, 6, 7, 8, 9, 0, 0]
  exponent = 3
  [1, 2, 3, '.', 3, 4, 5, 6, 7, 8, 9, 0]
  exponent = 3
  [1, 2, 3, '.', 3, 4, 5, 6, 7, 8, 9]
  exponent = 3
NormalizeNumber () :
  Output:
    sign = 0
    newNumber = 123.3456789
    exponent = 3
&lt;/syntaxhighlight&gt;
{{RoundBoxBottom}}

==Implementation==
{{RoundBoxTop|theme=4}}
&lt;math&gt;x = \sqrt[3]{n}&lt;/math&gt;

&lt;math&gt;x^3 = n&lt;/math&gt;

&lt;math&gt;x^3 - n = 0&lt;/math&gt;


To calculate &lt;math&gt;\sqrt[3]{n}&lt;/math&gt; calculate the real root of:

&lt;math&gt;y = f(x) = x^3 - n.&lt;/math&gt;


&lt;math&gt;f(x)&lt;/math&gt; is well defined in the region &lt;math&gt;1 \le n &lt; 1000.&lt;/math&gt;

If &lt;math&gt;n&lt;/math&gt; is type &lt;code&gt;int&lt;/code&gt; and exact cube, &lt;math&gt;\sqrt[3]{n}&lt;/math&gt; is extracted from table &lt;code&gt;values_of_v_and_v_cubed.&lt;/code&gt;

Else, Newton's method is used to derive the root starting with &lt;math&gt;x = \text{int}(\sqrt[3]{n}) + 1.&lt;/math&gt;
&lt;syntaxhighlight lang=python&gt;
# python code.

simpleCubeRootDebug = 0

def simpleCubeRoot (N, flag = 0) :
    '''
cube_root = simpleCubeRoot (N [, flag]) 

    '''
    thisName = 'simpleCubeRoot () :'

    if simpleCubeRootDebug : flag_ = simpleCubeRootDebug
    else : flag_ = flag
    print_ = flag_ &amp; 1 ; print_all = flag_ &amp; 2 ; check = flag_ &amp; 4
    if print_all : print_ = 1
    if print_ : check = 4

    if print_ :
        print()
        print (thisName)
        print ('  Input N =',N)
    if print_all :
        print ('  flag_ =', bin(flag_))
    if N == 0 : return dD(0)
    if abs(N) == 1 : return dD(str(N)).normalize()

    sign1, n, exponent = NormalizeNumber (N, flag)
    if print_all :
        print (thisName)
        print ('  sign1 = {}'.format(sign1))
        print ('  n = {}'.format(n))
        print ('  exponent = {}'.format(exponent))

    if check :
        if sign1 not in (0,1) :
            print (thisName, 'Internal error 1.')
            return None
        if (1 &lt;= n &lt; 1000) : pass
        else :
            print (thisName, 'Internal error 2.')
            return None
        if exponent % 3 :
            print (thisName, 'Internal error 3.')
            return None
 
    # Calculate starting value of x:
    status = 1
    values_of_v_and_v_cubed = [(9, 729), (8, 512), (7, 343), (6, 216),
                               (5, 125), (4, 64), (3, 27), (2, 8), (1, 1)]
    for v,v_cubed in values_of_v_and_v_cubed :
        if n &gt;= v_cubed :
            status = 0 ; break
    if status :
        # This should not happen.
        print (thisName, 'Internal error 4.')
        return None

    if n == v_cubed :
        x = v # Exact.
    else :
        # Newton's method:
        x = v + 1 ; y = x**3 - n
        status = 1 ; values_of_x = []
        if print_all :
            print (thisName)
            end_ = 0

        for t in range (1,51) :
            if print_all :
                if end_ : print ()
                print ('  x =', x)
                print ('  y =', y)
                end_ = 1
            slope = 3*x*x
            delta_x = y/slope
            x -= delta_x
            if x in values_of_x[-1:-5:-1] :
                # This value of x has been used previously.
                status = 0
                break
            values_of_x += [x]
            y = x*x*x - n

        if print_all : print ('  count =', t)
        if status :
            # This should not happen.
            print (thisName, 'count expired.')
            return None

    multiplier1 = (1,-1)[bool(sign1)]
    exponent1, remainder = divmod (exponent, 3)
    multiplier2 = 10**dD(exponent1)

    root3 = (multiplier1 * x * multiplier2).normalize() # The cube root.

    if check :
        dgt.prec = desired_precision
        n1 = root3 ** 3
        dgt.prec = Precision
        if (n1 != dD(str(N))) :
            print (thisName, 'Internal error 5.')
            print ('  N  =', N)
            print ('  n1 =', n1)
            return None
    if print_ :
        print (thisName)
        print ('  Output = N ** (1/3) =', root3 )

    return root3
&lt;/syntaxhighlight&gt;
{{RoundBoxBottom}}

=Examples=

==(-49.430863)^(⅓)==

{{RoundBoxTop|theme=4}}
[[File:0103cube_root.png|thumb|400px|'''
Graph of cubic function used to calculate cube root of &lt;math&gt;N = -49.430863.&lt;/math&gt;'''
&lt;/br&gt;
&lt;/br&gt;
&lt;math&gt;Y&lt;/math&gt; axis compressed for clarity.
&lt;/br&gt;
Method calculates &lt;math&gt;\sqrt[3]{\text{abs}(-49.430863)}.&lt;/math&gt;
&lt;/br&gt;
&lt;math&gt;1000 &gt; 49.430863 \ge 1,&lt;/math&gt; therefore &lt;math&gt;n = 49.430863&lt;/math&gt; and negative sign &lt;math&gt;(-)&lt;/math&gt; is preserved.
&lt;/br&gt;
Newton's method quickly finds result: &lt;math&gt;3.67 = \sqrt[3]{49.430863}.&lt;/math&gt;
]]

&lt;syntaxhighlight lang=python&gt;
# python code.

NormalizeNumberDebug = 8
N = -49.430863
r = simpleCubeRoot (N, 2)
print ('\nCube root of {} = {}'.format(N,r))
&lt;/syntaxhighlight&gt;

&lt;syntaxhighlight&gt;
simpleCubeRoot () :
  Input N = -49.430863
  flag_ = 0b10 
simpleCubeRoot () :
  sign1 = 1 
  n = 49.430863
  exponent = 0 
simpleCubeRoot () :
  x = 4
  y = 14.569137
  
  x = 3.6964763125
  y = 1.077556932370513542983642578125
  
  x = 3.670189185975939771448945836039493832417954712178864798200343445074621595436673614052572376229354069071
  y = 0.00764477504335853140747839082789084303615917679270634421640530090118268716447856580204634509997849803
  
  x = 3.670000009751736682821587362098730324894353971034852020032605567239509057372246925097634126721776189698
  y = 3.9403549966877805031675033177310279758144394720652549872722882467517684885827998893960547929841E-7
  
  x = 3.670000000000000025911816892145655551872936964331495318518061888183507160413379366174501446719474401728
  y = 1.04701101161586186758022322575610863475276107519253768435609331357966880617783675518439E-15

  x = 3.670000000000000000000000000000000182948843229450935510129377172924076310714715139745670785290354823955
  y = 7.39235902371945511587714470461319164277193070156347301951569000635639E-33
    
  x = 3.670000000000000000000000000000000000000000000000000000000000000000009119967095093791663852670429064766
  y = 3.6850777442132631162379569822609127E-67

  x = 3.670000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
  y = 0E-101
  count = 8 
simpleCubeRoot () :
  Output = N ** (1/3) = -3.67

Cube root of -49.430863 = -3.67
&lt;/syntaxhighlight&gt;
{{RoundBoxBottom}}

==N small==

{{RoundBoxTop|theme=4}}
&lt;syntaxhighlight lang=python&gt;
# python code.

N = (dD('654.12345')**3)* dD('1e-234')
r = simpleCubeRoot (N, 2)
print ('\nCube root of',N,'=',r)
&lt;/syntaxhighlight&gt;

&lt;syntaxhighlight&gt;
simpleCubeRoot () :
  Input N = 2.79884698523170070963625E-226
  flag_ = 0b10 
simpleCubeRoot () :
  sign1 = 0 
  n = 279.884698523170070963625
  exponent = -228 
simpleCubeRoot () :
  x = 7
  y = 63.115301476829929036375
  
  x = 6.570644207640612727643707482993197278911564625850340136054421768707482993197278911564625850340136054422
  y = 3.7921241319748044856346690723358910662200347438658510815125764506555202024351783380759402655041377003
  
  x = 6.541365939235037323691695638525121571862836044524137388147811941164515617543727416575923849380448976852
  y = 0.0168723059341306128289220155501386417560252058196372910481381594756277968737806202081810180585981468
  
  x = 6.541234502641062578339783186964860309131529958383953551860723864105607355316972754950658566210572503873
  y = 3.390153665112801204924990755018923043331713010875531529597912358746623245660302509054057497205E-7
  
  x = 6.541234500000000001066344822059465818454480153206314150749531142856041068525641678563938956757562592024
  y = 1.368794830901676242840644465509188865946206745677321533271630194477320979479731975131E-16

  x = 6.541234500000000000000000000000000000173834354896317173607861575067843889032458069846902551041303696479
  y = 2.23139421219918741184735707270203562908734282972217340770547002443E-35
    
  x = 6.541234500000000000000000000000000000000000000000000000000000000000000000004619675833700618822003921149
  y = 5.929965871075583921456016257E-73

  x = 6.541234500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
  y = 0E-100
  count = 8 
simpleCubeRoot () :
  Output = N ** (1/3) = 6.5412345E-76

Cube root of 2.79884698523170070963625E-226 = 6.5412345E-76
&lt;/syntaxhighlight&gt;
{{RoundBoxBottom}}

==N with 102 decimal digits==

{{RoundBoxTop|theme=4}}
&lt;syntaxhighlight lang=python&gt;
# python code.

desired_precision = 110
Precision = dgt.prec = desired_precision + 3     # Adjust as necessary.

N = dD('91234567890.12345678901234567890123')**3
r = simpleCubeRoot (N,2)
print ('''
Cube root of {}
  = {}'''.format(N,r))
&lt;/syntaxhighlight&gt;
&lt;syntaxhighlight&gt;
simpleCubeRoot () :
  Input N = 759413404032709802223035921205529.781633123988862756497856617560063741408069807576943069432557725290867
  flag_ = 0b10
simpleCubeRoot () :
  sign1 = 0
  n = 759.413404032709802223035921205529781633123988862756497856617560063741408069807576943069432557725290867
  exponent = 30
simpleCubeRoot () :
  x = 10
  y = 240.586595967290197776964078794470218366876011137243502143382439936258591930192423056930567442274709133
  
  x = 9.1980446801090326740767864040184326054437466295425216595220585335458046935660252564768981085257509695566666666667
  y = 18.77820665551422495383824857173248095793272325233656814694510850270967196003505739741920782438368016883367944227
  
  x = 9.1240599949931623321664263546967588277013422167312019450898763745034405805394622722445816188927044087634255868627
  y = 0.15063796707487503447652546220546007622895104520340178579594123893590883076604801830026422013014041937608940920
  
  x = 9.1234568288903645757636608593967193590532344706953269357275443939995698575917750346229607570213472584647914653782
  y = 0.00000995803550427983012306112778540777688652481208248640053261156681610990067746729397462608294518324636155989
  
  x = 9.1234567890123458532053846994321774021465971937678169135851020569774194125848355752830106295283475121571096686441
  y = 4.352590615034382352966739799800228929244369059424641507909334544190744465475094678843434802753864E-14
  
  x = 9.1234567890123456789012345678901263300904970218124391473359075160634634033723697405398374188771027302554310464010
  y = 8.3156486139967105310855857875110175852544229130768260284187973010829718068550033E-31
  
  x = 9.1234567890123456789012345678901230000000000000000000000000000000012154935322004708306387167486681445055079073469
  y = 3.0352379658763986320970141849733835293969476411E-64
    
  x = 9.1234567890123456789012345678901230000000000000000000000000000000000000000000000000000000000000000000000000000000
  y = 0E-110
  count = 8 
simpleCubeRoot () :
  Output = N ** (1/3) = 91234567890.12345678901234567890123
  
Cube root of 759413404032709802223035921205529.781633123988862756497856617560063741408069807576943069432557725290867
  = 91234567890.12345678901234567890123
&lt;/syntaxhighlight&gt;
* Result is achieved with 8 passes through loop.

* In python this method is more than 3 times faster than raising a number to the power &lt;math&gt;\frac{1}{3}.&lt;/math&gt; As size of &lt;math&gt;N&lt;/math&gt; increases, speed advantage increases.

* This method produced the cube root exactly.

* For most invocations of function &lt;code&gt;simpleCubeRoot ()&lt;/code&gt; you probably don't want to see all the internal details as displayed above. However, it is
recommended that the function be invoked with &lt;code&gt;flag = 4,&lt;/code&gt; because this value of &lt;code&gt;flag&lt;/code&gt; causes execution of function to perform internal checking.
{{RoundBoxBottom}}

=Links to related topics=
{{RoundBoxTop|theme=1}}
[[Cubic_function#Cubic_formula | Cubic formula]]

[[Math_Adventures/Square_Roots_using_Newton’s_Method | Square Roots using Newton’s Method]]

[[Shifting_nth_root_algorithm | Shifting nth root algorithm]]

[[Primary_mathematics/Powers,_roots,_and_exponents | Powers, roots, and exponents]]

[[Fundamental_Mathematics/Arithmetic/Roots | Roots]]

[[The_Art_of_Computer_Programming/Numbers,_Powers,_and_Logarithms/Exercises | Exercises]]
{{RoundBoxBottom}}</text>
      <sha1>5p4qj5bdhfxc2c22weyg85qcys9ul81</sha1>
    </revision>
    <revision>
      <id>2809858</id>
      <parentid>2809842</parentid>
      <timestamp>2026-05-17T04:30:28Z</timestamp>
      <contributor>
        <username>NguoiDungKhongDinhDanh</username>
        <id>2922842</id>
      </contributor>
      <minor />
      <comment>Reverted edit by [[Special:Contributions/HenriPittier|HenriPittier]] ([[User_talk:HenriPittier|talk]]) to last version by [[User:ThaniosAkro|ThaniosAkro]] using [[Wikiversity:Rollback|rollback]]</comment>
      <origin>2694525</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="18989" sha1="ng4g5zuozaxdrl1bvjwvsarfhhie0jo" xml:space="preserve">=Introduction=

{{RoundBoxTop|theme=2}}
[[File:0416cube02.png|thumb|400px|'''
Diagram of cube (in solid black lines.)'''
&lt;/br&gt;
The diagram shows the relationship of width, depth or height to surface area and volume.
]]
A cube is a regular solid in three dimensions with depth, width and height all equal.

In the diagram the figure defined by solid black lines is a cube. Width = depth = height = 2.

The length of one side is 2 units.

The surface area of one side &lt;math&gt;=\ height * depth&lt;/math&gt; or &lt;math&gt;height * width&lt;/math&gt; or 
&lt;math&gt;width * depth = 2 * 2&lt;/math&gt; or &lt;math&gt;2^2&lt;/math&gt; square units. There are 4 square units in each side.

The volume of the cube &lt;math&gt;=\ width * depth * height\ =\ 2 * 2 * 2 = 2^3 = 8&lt;/math&gt; cubic units.

In this case you can see that 8 cubes of 1 unit each, when properly stacked together, form a cube with 
length of each side equal to 2 units and volume equal to 8 cubic units.

In mathematical terms &lt;math&gt;V = s^3 = 2^3 = 8.&lt;/math&gt;

We can say that &lt;math&gt;V = s&lt;/math&gt; raised to the power of 3. Usually we say that &lt;math&gt;V = s&lt;/math&gt; cubed.


The calculation of cube root is the process reversed. Given &lt;math&gt;V&lt;/math&gt; or volume, what is the length of each side?

&lt;math&gt;s = V^{\frac{1}{3}}&lt;/math&gt; read as &lt;math&gt;s = V&lt;/math&gt; raised to the power &lt;math&gt;\frac{1}{3}.&lt;/math&gt;
Usually we say that &lt;math&gt;s = \sqrt[3]{V}&lt;/math&gt; or &lt;math&gt;s =&lt;/math&gt; cube root of &lt;math&gt;V.&lt;/math&gt;

In this case &lt;math&gt;s = \sqrt[3]{8} = 2.&lt;/math&gt;


When &lt;math&gt;s = \sqrt[3]{V}&lt;/math&gt; then &lt;math&gt;s^3 = (\sqrt[3]{V})^3 =  (V^{1/3})^3 = V^{\frac{3}{3}}  = V^1 =      V.&lt;/math&gt;


If &lt;math&gt; s &lt;/math&gt; is negative, then &lt;math&gt;(-s)^3 = (-s)*(-s)*(-s) = -(s * s * s) = -V&lt;/math&gt; and &lt;math&gt;\sqrt[3]{-V} = -s.&lt;/math&gt;
&lt;math&gt;&lt;/math&gt;
{{RoundBoxTop|theme=1}}
In theoretical math the cube root of any real number has 3 values, 1 real and 2 complex. 

On this page, we'll refer to the one real value noting that the cube root of a negative real number is also a negative real number.
{{RoundBoxBottom}}
{{RoundBoxBottom}}

=Calculation=

==Preparation==

{{RoundBoxTop|theme=4}}
It is desired to calculate the cube root of real number &lt;math&gt;N.&lt;/math&gt;


To simplify the process, and to make the implementation of the process predictable, reformat &lt;math&gt;N:&lt;/math&gt;

&lt;math&gt;N = n(10^{3p})&lt;/math&gt; where:

* &lt;math&gt;1 \le n &lt; 1000&lt;/math&gt;

* &lt;math&gt;p&lt;/math&gt; is integer.


Then:
&lt;math&gt;\sqrt[3]{N} = \sqrt[3]{n(10^{3p})} = \sqrt[3]{n}(10^p).&lt;/math&gt;


To simplify the process further, we calculate cube root of &lt;code&gt;abs(n)&lt;/code&gt; and restore negative sign
to result, if necessary.

&lt;syntaxhighlight lang=python&gt;
# python code.

import decimal
dD = decimal.Decimal
dgt = decimal.getcontext()
desired_precision = 100     # Adjust as necessary.
Precision = dgt.prec = desired_precision + 3

NormalizeNumberDebug = 0

def NormalizeNumber (number, flag = 0) :
    '''
sign, newNumber, exponent = NormalizeNumber (number [, flag])
sign &amp; exponent are both ints.
newNumber is Decimal object.
1000 &gt; newNumber &gt;= 1 and
exponent % 3 = 0.
This prepares number for cube root of number.
eg, 1234.56e-2 becomes 123456e-4, 12345600e-6, 12.345600e0, 12.3456e0
    123.456e7 becomes 123456e4, 1234560e3, 1.234560e9, 1.23456e9
'''
    thisName = 'NormalizeNumber () :'
    
    if NormalizeNumberDebug : flag_ = NormalizeNumberDebug
    else : flag_ = flag
    print_ = flag_ &amp; 1 ; print_all = flag_ &amp; 2 ; check = flag_ &amp; 4
    if print_all : print_ = 1
    if print_ : check = 4

    number = dD(str(number))
    if print_ :
        print()
        print(thisName)
        print('  Input number =',number)
    if print_all :
        print('  flag_ =', bin(flag_))

    if number == 0 : return (0, dD(0), 0)

    sign, digits, exponent = tuple(number.as_tuple())

    if print_all :
        print (' ', digits)
        print ('  exponent =', exponent)
    digits = list(digits)

    # Remove leading zeroes.
    while (digits[0] == 0) :
        digits[:1] = []
        if print_all :
            print (' ', digits)
            print ('  exponent =', exponent)

    # Remove trailing zeroes.
    while (digits[-1] == 0) :
        digits[-1:] = [] ; exponent += 1
        if print_all :
            print (' ', digits)
            print ('  exponent =', exponent)

    # Ensure that exponent is exactly divisible by 3.
    while exponent % 3 :
        digits += [0] ; exponent -= 1
        if print_all :
            print (' ', digits)
            print ('  exponent =', exponent)

    number_of_digits = len(digits)
    if number_of_digits &lt;= 3:
        newNumber = dD ( (0,digits,0) )
    else :    
        number_of_integers = number_of_digits % 3
        if number_of_integers == 0 : number_of_integers = 3
        number_of_decimal_places = number_of_digits - number_of_integers
        digits[-number_of_decimal_places:-number_of_decimal_places] = ['.']
        exponent += number_of_decimal_places
        if print_all :
            print (' ', digits)
            print ('  exponent =', exponent)
        while (digits[-1] == 0) :
            del(digits[-1])
            if print_all :
                print (' ', digits)
                print ('  exponent =', exponent)
        newNumber = dD( ''.join([ str(v) for v in digits ]) )

    # If necessary, check.
    if check :
        str1 = str(newNumber)
        dD1 = dD( ('', '-')[sign] + str1 + 'e' + str(exponent) )
        if dD1 != number :
            # This should not happen.
            print (thisName)
            print ('  error:', dD1 , '!=', number)
            return None

    if print_ :
        print (thisName)
        print ('  Output:')
        print ('    sign =', sign)
        print ('    newNumber =', newNumber)
        print ('    exponent =', exponent)

    return sign, newNumber, exponent
&lt;/syntaxhighlight&gt;
{{RoundBoxBottom}}
===Example===
{{RoundBoxTop|theme=3}}
This example illustrates how number &lt;code&gt;N&lt;/code&gt; is changed to conform to desired format.
&lt;syntaxhighlight lang=python&gt;
# python code.

NormalizeNumber ('00123345.6789000000000000', 2)
&lt;/syntaxhighlight&gt;

&lt;syntaxhighlight&gt;
NormalizeNumber () :
  Input number = 123345.6789000000000000
  flag_ = 0b10
  (1, 2, 3, 3, 4, 5, 6, 7, 8, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0)
  exponent = -16
  [1, 2, 3, 3, 4, 5, 6, 7, 8, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
  exponent = -15
  [1, 2, 3, 3, 4, 5, 6, 7, 8, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
  exponent = -14
  [1, 2, 3, 3, 4, 5, 6, 7, 8, 9, 0, 0, 0, 0, 0, 0, 0, 0, 0]
  exponent = -13
  [1, 2, 3, 3, 4, 5, 6, 7, 8, 9, 0, 0, 0, 0, 0, 0, 0, 0]
  exponent = -12
  [1, 2, 3, 3, 4, 5, 6, 7, 8, 9, 0, 0, 0, 0, 0, 0, 0]
  exponent = -11
  [1, 2, 3, 3, 4, 5, 6, 7, 8, 9, 0, 0, 0, 0, 0, 0]
  exponent = -10
  [1, 2, 3, 3, 4, 5, 6, 7, 8, 9, 0, 0, 0, 0, 0]
  exponent = -9
  [1, 2, 3, 3, 4, 5, 6, 7, 8, 9, 0, 0, 0, 0]
  exponent = -8
  [1, 2, 3, 3, 4, 5, 6, 7, 8, 9, 0, 0, 0]
  exponent = -7
  [1, 2, 3, 3, 4, 5, 6, 7, 8, 9, 0, 0]
  exponent = -6
  [1, 2, 3, 3, 4, 5, 6, 7, 8, 9, 0]
  exponent = -5
  [1, 2, 3, 3, 4, 5, 6, 7, 8, 9]
  exponent = -4
  [1, 2, 3, 3, 4, 5, 6, 7, 8, 9, 0]
  exponent = -5
  [1, 2, 3, 3, 4, 5, 6, 7, 8, 9, 0, 0]
  exponent = -6
  [1, 2, 3, '.', 3, 4, 5, 6, 7, 8, 9, 0, 0]
  exponent = 3
  [1, 2, 3, '.', 3, 4, 5, 6, 7, 8, 9, 0]
  exponent = 3
  [1, 2, 3, '.', 3, 4, 5, 6, 7, 8, 9]
  exponent = 3
NormalizeNumber () :
  Output:
    sign = 0
    newNumber = 123.3456789
    exponent = 3
&lt;/syntaxhighlight&gt;
{{RoundBoxBottom}}

==Implementation==
{{RoundBoxTop|theme=4}}
&lt;math&gt;x = \sqrt[3]{n}&lt;/math&gt;

&lt;math&gt;x^3 = n&lt;/math&gt;

&lt;math&gt;x^3 - n = 0&lt;/math&gt;


To calculate &lt;math&gt;\sqrt[3]{n}&lt;/math&gt; calculate the real root of:

&lt;math&gt;y = f(x) = x^3 - n.&lt;/math&gt;


&lt;math&gt;f(x)&lt;/math&gt; is well defined in the region &lt;math&gt;1 \le n &lt; 1000.&lt;/math&gt;

If &lt;math&gt;n&lt;/math&gt; is type &lt;code&gt;int&lt;/code&gt; and exact cube, &lt;math&gt;\sqrt[3]{n}&lt;/math&gt; is extracted from table &lt;code&gt;values_of_v_and_v_cubed.&lt;/code&gt;

Else, Newton's method is used to derive the root starting with &lt;math&gt;x = \text{int}(\sqrt[3]{n}) + 1.&lt;/math&gt;
&lt;syntaxhighlight lang=python&gt;
# python code.

simpleCubeRootDebug = 0

def simpleCubeRoot (N, flag = 0) :
    '''
cube_root = simpleCubeRoot (N [, flag]) 

    '''
    thisName = 'simpleCubeRoot () :'

    if simpleCubeRootDebug : flag_ = simpleCubeRootDebug
    else : flag_ = flag
    print_ = flag_ &amp; 1 ; print_all = flag_ &amp; 2 ; check = flag_ &amp; 4
    if print_all : print_ = 1
    if print_ : check = 4

    if print_ :
        print()
        print (thisName)
        print ('  Input N =',N)
    if print_all :
        print ('  flag_ =', bin(flag_))
    if N == 0 : return dD(0)
    if abs(N) == 1 : return dD(str(N)).normalize()

    sign1, n, exponent = NormalizeNumber (N, flag)
    if print_all :
        print (thisName)
        print ('  sign1 = {}'.format(sign1))
        print ('  n = {}'.format(n))
        print ('  exponent = {}'.format(exponent))

    if check :
        if sign1 not in (0,1) :
            print (thisName, 'Internal error 1.')
            return None
        if (1 &lt;= n &lt; 1000) : pass
        else :
            print (thisName, 'Internal error 2.')
            return None
        if exponent % 3 :
            print (thisName, 'Internal error 3.')
            return None
 
    # Calculate starting value of x:
    status = 1
    values_of_v_and_v_cubed = [(9, 729), (8, 512), (7, 343), (6, 216),
                               (5, 125), (4, 64), (3, 27), (2, 8), (1, 1)]
    for v,v_cubed in values_of_v_and_v_cubed :
        if n &gt;= v_cubed :
            status = 0 ; break
    if status :
        # This should not happen.
        print (thisName, 'Internal error 4.')
        return None

    if n == v_cubed :
        x = v # Exact.
    else :
        # Newton's method:
        x = v + 1 ; y = x**3 - n
        status = 1 ; values_of_x = []
        if print_all :
            print (thisName)
            end_ = 0

        for t in range (1,51) :
            if print_all :
                if end_ : print ()
                print ('  x =', x)
                print ('  y =', y)
                end_ = 1
            slope = 3*x*x
            delta_x = y/slope
            x -= delta_x
            if x in values_of_x[-1:-5:-1] :
                # This value of x has been used previously.
                status = 0
                break
            values_of_x += [x]
            y = x*x*x - n

        if print_all : print ('  count =', t)
        if status :
            # This should not happen.
            print (thisName, 'count expired.')
            return None

    multiplier1 = (1,-1)[bool(sign1)]
    exponent1, remainder = divmod (exponent, 3)
    multiplier2 = 10**dD(exponent1)

    root3 = (multiplier1 * x * multiplier2).normalize() # The cube root.

    if check :
        dgt.prec = desired_precision
        n1 = root3 ** 3
        dgt.prec = Precision
        if (n1 != dD(str(N))) :
            print (thisName, 'Internal error 5.')
            print ('  N  =', N)
            print ('  n1 =', n1)
            return None
    if print_ :
        print (thisName)
        print ('  Output = N ** (1/3) =', root3 )

    return root3
&lt;/syntaxhighlight&gt;
{{RoundBoxBottom}}

=Examples=

==(-49.430863)^(⅓)==

{{RoundBoxTop|theme=4}}
[[File:0103cube_root.png|thumb|400px|'''
Graph of cubic function used to calculate cube root of &lt;math&gt;N = -49.430863.&lt;/math&gt;'''
&lt;/br&gt;
&lt;/br&gt;
&lt;math&gt;Y&lt;/math&gt; axis compressed for clarity.
&lt;/br&gt;
Method calculates &lt;math&gt;\sqrt[3]{\text{abs}(-49.430863)}.&lt;/math&gt;
&lt;/br&gt;
&lt;math&gt;1000 &gt; 49.430863 \ge 1,&lt;/math&gt; therefore &lt;math&gt;n = 49.430863&lt;/math&gt; and negative sign &lt;math&gt;(-)&lt;/math&gt; is preserved.
&lt;/br&gt;
Newton's method quickly finds result: &lt;math&gt;3.67 = \sqrt[3]{49.430863}.&lt;/math&gt;
]]

&lt;syntaxhighlight lang=python&gt;
# python code.

NormalizeNumberDebug = 8
N = -49.430863
r = simpleCubeRoot (N, 2)
print ('\nCube root of {} = {}'.format(N,r))
&lt;/syntaxhighlight&gt;

&lt;syntaxhighlight&gt;
simpleCubeRoot () :
  Input N = -49.430863
  flag_ = 0b10 
simpleCubeRoot () :
  sign1 = 1 
  n = 49.430863
  exponent = 0 
simpleCubeRoot () :
  x = 4
  y = 14.569137
  
  x = 3.6964763125
  y = 1.077556932370513542983642578125
  
  x = 3.670189185975939771448945836039493832417954712178864798200343445074621595436673614052572376229354069071
  y = 0.00764477504335853140747839082789084303615917679270634421640530090118268716447856580204634509997849803
  
  x = 3.670000009751736682821587362098730324894353971034852020032605567239509057372246925097634126721776189698
  y = 3.9403549966877805031675033177310279758144394720652549872722882467517684885827998893960547929841E-7
  
  x = 3.670000000000000025911816892145655551872936964331495318518061888183507160413379366174501446719474401728
  y = 1.04701101161586186758022322575610863475276107519253768435609331357966880617783675518439E-15

  x = 3.670000000000000000000000000000000182948843229450935510129377172924076310714715139745670785290354823955
  y = 7.39235902371945511587714470461319164277193070156347301951569000635639E-33
    
  x = 3.670000000000000000000000000000000000000000000000000000000000000000009119967095093791663852670429064766
  y = 3.6850777442132631162379569822609127E-67

  x = 3.670000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
  y = 0E-101
  count = 8 
simpleCubeRoot () :
  Output = N ** (1/3) = -3.67

Cube root of -49.430863 = -3.67
&lt;/syntaxhighlight&gt;
{{RoundBoxBottom}}

==N small==

{{RoundBoxTop|theme=4}}
&lt;syntaxhighlight lang=python&gt;
# python code.

N = (dD('654.12345')**3)* dD('1e-234')
r = simpleCubeRoot (N, 2)
print ('\nCube root of',N,'=',r)
&lt;/syntaxhighlight&gt;

&lt;syntaxhighlight&gt;
simpleCubeRoot () :
  Input N = 2.79884698523170070963625E-226
  flag_ = 0b10 
simpleCubeRoot () :
  sign1 = 0 
  n = 279.884698523170070963625
  exponent = -228 
simpleCubeRoot () :
  x = 7
  y = 63.115301476829929036375
  
  x = 6.570644207640612727643707482993197278911564625850340136054421768707482993197278911564625850340136054422
  y = 3.7921241319748044856346690723358910662200347438658510815125764506555202024351783380759402655041377003
  
  x = 6.541365939235037323691695638525121571862836044524137388147811941164515617543727416575923849380448976852
  y = 0.0168723059341306128289220155501386417560252058196372910481381594756277968737806202081810180585981468
  
  x = 6.541234502641062578339783186964860309131529958383953551860723864105607355316972754950658566210572503873
  y = 3.390153665112801204924990755018923043331713010875531529597912358746623245660302509054057497205E-7
  
  x = 6.541234500000000001066344822059465818454480153206314150749531142856041068525641678563938956757562592024
  y = 1.368794830901676242840644465509188865946206745677321533271630194477320979479731975131E-16

  x = 6.541234500000000000000000000000000000173834354896317173607861575067843889032458069846902551041303696479
  y = 2.23139421219918741184735707270203562908734282972217340770547002443E-35
    
  x = 6.541234500000000000000000000000000000000000000000000000000000000000000000004619675833700618822003921149
  y = 5.929965871075583921456016257E-73

  x = 6.541234500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
  y = 0E-100
  count = 8 
simpleCubeRoot () :
  Output = N ** (1/3) = 6.5412345E-76

Cube root of 2.79884698523170070963625E-226 = 6.5412345E-76
&lt;/syntaxhighlight&gt;
{{RoundBoxBottom}}

==N with 102 decimal digits==

{{RoundBoxTop|theme=4}}
&lt;syntaxhighlight lang=python&gt;
# python code.

desired_precision = 110
Precision = dgt.prec = desired_precision + 3     # Adjust as necessary.

N = dD('91234567890.12345678901234567890123')**3
r = simpleCubeRoot (N,2)
print ('''
Cube root of {}
  = {}'''.format(N,r))
&lt;/syntaxhighlight&gt;
&lt;syntaxhighlight&gt;
simpleCubeRoot () :
  Input N = 759413404032709802223035921205529.781633123988862756497856617560063741408069807576943069432557725290867
  flag_ = 0b10
simpleCubeRoot () :
  sign1 = 0
  n = 759.413404032709802223035921205529781633123988862756497856617560063741408069807576943069432557725290867
  exponent = 30
simpleCubeRoot () :
  x = 10
  y = 240.586595967290197776964078794470218366876011137243502143382439936258591930192423056930567442274709133
  
  x = 9.1980446801090326740767864040184326054437466295425216595220585335458046935660252564768981085257509695566666666667
  y = 18.77820665551422495383824857173248095793272325233656814694510850270967196003505739741920782438368016883367944227
  
  x = 9.1240599949931623321664263546967588277013422167312019450898763745034405805394622722445816188927044087634255868627
  y = 0.15063796707487503447652546220546007622895104520340178579594123893590883076604801830026422013014041937608940920
  
  x = 9.1234568288903645757636608593967193590532344706953269357275443939995698575917750346229607570213472584647914653782
  y = 0.00000995803550427983012306112778540777688652481208248640053261156681610990067746729397462608294518324636155989
  
  x = 9.1234567890123458532053846994321774021465971937678169135851020569774194125848355752830106295283475121571096686441
  y = 4.352590615034382352966739799800228929244369059424641507909334544190744465475094678843434802753864E-14
  
  x = 9.1234567890123456789012345678901263300904970218124391473359075160634634033723697405398374188771027302554310464010
  y = 8.3156486139967105310855857875110175852544229130768260284187973010829718068550033E-31
  
  x = 9.1234567890123456789012345678901230000000000000000000000000000000012154935322004708306387167486681445055079073469
  y = 3.0352379658763986320970141849733835293969476411E-64
    
  x = 9.1234567890123456789012345678901230000000000000000000000000000000000000000000000000000000000000000000000000000000
  y = 0E-110
  count = 8 
simpleCubeRoot () :
  Output = N ** (1/3) = 91234567890.12345678901234567890123
  
Cube root of 759413404032709802223035921205529.781633123988862756497856617560063741408069807576943069432557725290867
  = 91234567890.12345678901234567890123
&lt;/syntaxhighlight&gt;
* Result is achieved with 8 passes through loop.

* In python this method is more than 3 times faster than raising a number to the power &lt;math&gt;\frac{1}{3}.&lt;/math&gt; As size of &lt;math&gt;N&lt;/math&gt; increases, speed advantage increases.

* This method produced the cube root exactly.

* For most invocations of function &lt;code&gt;simpleCubeRoot ()&lt;/code&gt; you probably don't want to see all the internal details as displayed above. However, it is
recommended that the function be invoked with &lt;code&gt;flag = 4,&lt;/code&gt; because this value of &lt;code&gt;flag&lt;/code&gt; causes execution of function to perform internal checking.
{{RoundBoxBottom}}

=Links to related topics=
{{RoundBoxTop|theme=1}}
[[Cubic_function#Cubic_formula | Cubic formula]]

[[Math_Adventures/Square_Roots_using_Newton’s_Method | Square Roots using Newton’s Method]]

[[Shifting_nth_root_algorithm | Shifting nth root algorithm]]

[[Primary_mathematics/Powers,_roots,_and_exponents | Powers, roots, and exponents]]

[[Fundamental_Mathematics/Arithmetic/Roots | Roots]]

[[The_Art_of_Computer_Programming/Numbers,_Powers,_and_Logarithms/Exercises | Exercises]]
{{RoundBoxBottom}}</text>
      <sha1>ng4g5zuozaxdrl1bvjwvsarfhhie0jo</sha1>
    </revision>
  </page>
  <page>
    <title>C language in plain view</title>
    <ns>0</ns>
    <id>285380</id>
    <revision>
      <id>2809647</id>
      <parentid>2809483</parentid>
      <timestamp>2026-05-16T14:04:45Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>/* Applications */</comment>
      <origin>2809647</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="9878" sha1="n6ljqi35s5frer0rixg7h5oge95sb3b" xml:space="preserve">=== Introduction ===
* Overview ([[Media:C01.Intro1.Overview.1.A.20170925.pdf |A.pdf]], [[Media:C01.Intro1.Overview.1.B.20170901.pdf |B.pdf]], [[Media:C01.Intro1.Overview.1.C.20170904.pdf |C.pdf]])
* Number System ([[Media:C01.Intro2.Number.1.A.20171023.pdf |A.pdf]], [[Media:C01.Intro2.Number.1.B.20170909.pdf |B.pdf]], [[Media:C01.Intro2.Number.1.C.20170914.pdf |C.pdf]])
* Memory System ([[Media:C01.Intro2.Memory.1.A.20170907.pdf |A.pdf]], [[Media:C01.Intro3.Memory.1.B.20170909.pdf |B.pdf]], [[Media:C01.Intro3.Memory.1.C.20170914.pdf |C.pdf]])

=== Handling Repetition ===
* Control ([[Media:C02.Repeat1.Control.1.A.20170925.pdf |A.pdf]], [[Media:C02.Repeat1.Control.1.B.20170918.pdf |B.pdf]], [[Media:C02.Repeat1.Control.1.C.20170926.pdf |C.pdf]])
* Loop ([[Media:C02.Repeat2.Loop.1.A.20170925.pdf |A.pdf]], [[Media:C02.Repeat2.Loop.1.B.20170918.pdf |B.pdf]])

=== Handling a Big Work ===
* Function Overview ([[Media:C03.Func1.Overview.1.A.20171030.pdf |A.pdf]], [[Media:C03.Func1.Oerview.1.B.20161022.pdf |B.pdf]])
* Functions &amp; Variables ([[Media:C03.Func2.Variable.1.A.20161222.pdf |A.pdf]], [[Media:C03.Func2.Variable.1.B.20161222.pdf |B.pdf]])
* Functions &amp; Pointers ([[Media:C03.Func3.Pointer.1.A.20161122.pdf |A.pdf]], [[Media:C03.Func3.Pointer.1.B.20161122.pdf |B.pdf]])
* Functions &amp; Recursions ([[Media:C03.Func4.Recursion.1.A.20161214.pdf |A.pdf]], [[Media:C03.Func4.Recursion.1.B.20161214.pdf |B.pdf]])

=== Handling Series of Data ===

==== Background ==== 
* Background ([[Media:C04.Series0.Background.1.A.20180727.pdf |A.pdf]])
 
==== Basics ====
* Pointers ([[Media:C04.S1.Pointer.1A.20240524.pdf |A.pdf]], [[Media:C04.Series2.Pointer.1.B.20161115.pdf |B.pdf]])
* Arrays ([[Media:C04.S2.Array.1A.20240514.pdf |A.pdf]], [[Media:C04.Series1.Array.1.B.20161115.pdf |B.pdf]])
* Array Pointers ([[Media:C04.S3.ArrayPointer.1A.20240208.pdf |A.pdf]], [[Media:C04.Series3.ArrayPointer.1.B.20181203.pdf |B.pdf]])
* Multi-dimensional Arrays ([[Media:C04.Series4.MultiDim.1.A.20221130.pdf |A.pdf]], [[Media:C04.Series4.MultiDim.1.B.1111.pdf |B.pdf]])
* Array Access Methods ([[Media:C04.Series4.ArrayAccess.1.A.20190511.pdf |A.pdf]], [[Media:C04.Series3.ArrayPointer.1.B.20181203.pdf |B.pdf]])
* Structures ([[Media:C04.Series3.Structure.1.A.20171204.pdf |A.pdf]], [[Media:C04.Series2.Structure.1.B.20161130.pdf |B.pdf]])

==== Examples ==== 
* Spreadsheet Example Programs
:: Example 1 ([[Media:C04.Series7.Example.1.A.20171213.pdf |A.pdf]], [[Media:C04.Series7.Example.1.C.20171213.pdf |C.pdf]])
:: Example 2 ([[Media:C04.Series7.Example.2.A.20171213.pdf |A.pdf]], [[Media:C04.Series7.Example.2.C.20171213.pdf |C.pdf]])
:: Example 3 ([[Media:C04.Series7.Example.3.A.20171213.pdf |A.pdf]], [[Media:C04.Series7.Example.3.C.20171213.pdf |C.pdf]])
:: Bubble Sort ([[Media:C04.Series7.BubbleSort.1.A.20171211.pdf |A.pdf]])

==== Applications ==== 
* Address-of and de-reference operators ([[Media:C04.SA0.PtrOperator.1A.20260516.pdf |A.pdf]])
* Applications of Pointers ([[Media:C04.SA1.AppPointer.1A.20241121.pdf |A.pdf]])
* Applications of Arrays ([[Media:C04.SA2.AppArray.1A.20240715.pdf |A.pdf]])
* Applications of Array Pointers ([[Media:C04.SA3.AppArrayPointer.1A.20240210.pdf |A.pdf]])
* Applications of Multi-dimensional Arrays ([[Media:C04.Series4App.MultiDim.1.A.20210719.pdf |A.pdf]])
* Applications of Array Access Methods ([[Media:C04.Series9.AppArrAcess.1.A.20190511.pdf |A.pdf]])
* Applications of Structures ([[Media:C04.Series6.AppStruct.1.A.20190423.pdf |A.pdf]])

=== Handling Various Kinds of Data ===
* Types ([[Media:C05.Data1.Type.1.A.20180217.pdf |A.pdf]], [[Media:C05.Data1.Type.1.B.20161212.pdf |B.pdf]])
* Typecasts ([[Media:C05.Data2.TypeCast.1.A.20180217.pdf |A.pdf]], [[Media:C05.Data2.TypeCast.1.B.20161216.pdf |A.pdf]])
* Operators ([[Media:C05.Data3.Operators.1.A.20161219.pdf |A.pdf]], [[Media:C05.Data3.Operators.1.B.20161216.pdf |B.pdf]])
* Files ([[Media:C05.Data4.File.1.A.20161124.pdf |A.pdf]], [[Media:C05.Data4.File.1.B.20161212.pdf |B.pdf]])

=== Handling Low Level Operations ===
* Bitwise Operations ([[Media:BitOp.1.B.20161214.pdf |A.pdf]], [[Media:BitOp.1.B.20161203.pdf |B.pdf]])
* Bit Field ([[Media:BitField.1.A.20161214.pdf |A.pdf]], [[Media:BitField.1.B.20161202.pdf |B.pdf]])
* Union ([[Media:Union.1.A.20161221.pdf |A.pdf]], [[Media:Union.1.B.20161111.pdf |B.pdf]])
* Accessing IO Registers ([[Media:IO.1.A.20141215.pdf |A.pdf]], [[Media:IO.1.B.20161217.pdf |B.pdf]])

=== Declarations ===
* Type Specifiers and Qualifiers ([[Media:C07.Spec1.Type.1.A.20171004.pdf |pdf]])
* Storage Class Specifiers ([[Media:C07.Spec2.Storage.1.A.20171009.pdf |pdf]])
* Scope 


=== Class Notes ===

* TOC ([[Media:TOC.20171007.pdf |TOC.pdf]])
* Day01 ([[Media:Day01.A.20171007.pdf |A.pdf]], [[Media:Day01.B.20171209.pdf |B.pdf]], [[Media:Day01.C.20171211.pdf |C.pdf]]) ...... Introduction (1) Standard Library
* Day02 ([[Media:Day02.A.20171007.pdf |A.pdf]], [[Media:Day02.B.20171209.pdf |B.pdf]], [[Media:Day02.C.20171209.pdf |C.pdf]]) ...... Introduction (2) Basic Elements
* Day03 ([[Media:Day03.A.20171007.pdf |A.pdf]], [[Media:Day03.B.20170908.pdf |B.pdf]], [[Media:Day03.C.20171209.pdf |C.pdf]]) ...... Introduction (3) Numbers
* Day04 ([[Media:Day04.A.20171007.pdf |A.pdf]], [[Media:Day04.B.20170915.pdf |B.pdf]], [[Media:Day04.C.20171209.pdf |C.pdf]]) ...... Structured Programming (1) Flowcharts
* Day05 ([[Media:Day05.A.20171007.pdf |A.pdf]], [[Media:Day05.B.20170915.pdf |B.pdf]], [[Media:Day05.C.20171209.pdf |C.pdf]]) ...... Structured Programming (2) Conditions and Loops
* Day06 ([[Media:Day06.A.20171007.pdf |A.pdf]], [[Media:Day06.B.20170923.pdf |B.pdf]], [[Media:Day06.C.20171209.pdf |C.pdf]]) ...... Program Control
* Day07 ([[Media:Day07.A.20171007.pdf |A.pdf]], [[Media:Day07.B.20170926.pdf |B.pdf]], [[Media:Day07.C.20171209.pdf |C.pdf]]) ...... Function (1) Definitions
* Day08 ([[Media:Day08.A.20171028.pdf |A.pdf]], [[Media:Day08.B.20171016.pdf |B.pdf]], [[Media:Day08.C.20171209.pdf |C.pdf]]) ...... Function (2) Storage Class and Scope
* Day09 ([[Media:Day09.A.20171007.pdf |A.pdf]], [[Media:Day09.B.20171017.pdf |B.pdf]], [[Media:Day09.C.20171209.pdf |C.pdf]]) ...... Function (3) Recursion
* Day10 ([[Media:Day10.A.20171209.pdf |A.pdf]], [[Media:Day10.B.20171017.pdf |B.pdf]], [[Media:Day10.C.20171209.pdf |C.pdf]]) ...... Arrays (1) Definitions
* Day11 ([[Media:Day11.A.20171024.pdf |A.pdf]], [[Media:Day11.B.20171017.pdf |B.pdf]], [[Media:Day11.C.20171212.pdf |C.pdf]]) ...... Arrays (2) Applications
* Day12 ([[Media:Day12.A.20171024.pdf |A.pdf]], [[Media:Day12.B.20171020.pdf |B.pdf]], [[Media:Day12.C.20171209.pdf |C.pdf]]) ...... Pointers (1) Definitions
* Day13 ([[Media:Day13.A.20171025.pdf |A.pdf]], [[Media:Day13.B.20171024.pdf |B.pdf]], [[Media:Day13.C.20171209.pdf |C.pdf]]) ...... Pointers (2) Applications
* Day14 ([[Media:Day14.A.20171226.pdf |A.pdf]], [[Media:Day14.B.20171101.pdf |B.pdf]], [[Media:Day14.C.20171209.pdf |C.pdf]]) ...... C String (1) 
* Day15 ([[Media:Day15.A.20171209.pdf |A.pdf]], [[Media:Day15.B.20171124.pdf |B.pdf]], [[Media:Day15.C.20171209.pdf |C.pdf]]) ...... C String (2)
* Day16 ([[Media:Day16.A.20171208.pdf |A.pdf]], [[Media:Day16.B.20171114.pdf |B.pdf]], [[Media:Day16.C.20171209.pdf |C.pdf]]) ...... C Formatted IO
* Day17 ([[Media:Day17.A.20171031.pdf |A.pdf]], [[Media:Day17.B.20171111.pdf |B.pdf]], [[Media:Day17.C.20171209.pdf |C.pdf]]) ...... Structure (1) Definitions
* Day18 ([[Media:Day18.A.20171206.pdf |A.pdf]], [[Media:Day18.B.20171128.pdf |B.pdf]], [[Media:Day18.C.20171212.pdf |C.pdf]]) ...... Structure (2) Applications
* Day19 ([[Media:Day19.A.20171205.pdf |A.pdf]], [[Media:Day19.B.20171121.pdf |B.pdf]], [[Media:Day19.C.20171209.pdf |C.pdf]]) ...... Union, Bitwise Operators, Enum
* Day20 ([[Media:Day20.A.20171205.pdf |A.pdf]], [[Media:Day20.B.20171201.pdf |B.pdf]], [[Media:Day20.C.20171212.pdf |C.pdf]]) ...... Linked List 
* Day21 ([[Media:Day21.A.20171206.pdf |A.pdf]], [[Media:Day21.B.20171208.pdf |B.pdf]], [[Media:Day21.C.20171212.pdf |C.pdf]]) ...... File Processing
* Day22 ([[Media:Day22.A.20171212.pdf |A.pdf]], [[Media:Day22.B.20171213.pdf |B.pdf]], [[Media:Day22.C.20171212.pdf |C.pdf]]) ...... Preprocessing


&lt;!----------------------------------------------------------------------&gt;
&lt;/br&gt;
See also https://cprogramex.wordpress.com/

== '''Old Materials '''==

until 201201
* Intro.Overview.1.A ([[Media:C.Intro.Overview.1.A.20120107.pdf |pdf]])
* Intro.Memory.1.A ([[Media:C.Intro.Memory.1.A.20120107.pdf |pdf]])
* Intro.Number.1.A ([[Media:C.Intro.Number.1.A.20120107.pdf |pdf]])
* Repeat.Control.1.A ([[Media:C.Repeat.Control.1.A.20120109.pdf |pdf]])
* Repeat.Loop.1.A ([[Media:C.Repeat.Loop.1.A.20120113.pdf |pdf]])
* Work.Function.1.A ([[Media:C.Work.Function.1.A.20120117.pdf |pdf]])
* Work.Scope.1.A ([[Media:C.Work.Scope.1.A.20120117.pdf |pdf]])
* Series.Array.1.A ([[Media:Series.Array.1.A.20110718.pdf |pdf]])
* Series.Pointer.1.A ([[Media:Series.Pointer.1.A.20110719.pdf |pdf]])
* Series.Structure.1.A ([[Media:Series.Structure.1.A.20110805.pdf |pdf]])
* Data.Type.1.A ([[Media:C05.Data2.TypeCast.1.A.20130813.pdf |pdf]])
* Data.TypeCast.1.A ([[Media:Data.TypeCast.1.A.pdf |pdf]])
* Data.Operators.1.A ([[Media:Data.Operators.1.A.20110712.pdf |pdf]])
 
&lt;br&gt;

until 201107
* Intro.1.A ([[Media:Intro.1.A.pdf |pdf]])
* Control.1.A ([[Media:Control.1.A.20110706.pdf |pdf]])
* Iteration.1.A ([[Media:Iteration.1.A.pdf |pdf]])
* Function.1.A ([[Media:Function.1.A.20110705.pdf |pdf]])
* Variable.1.A ([[Media:Variable.1.A.20110708.pdf |pdf]])
* Operators.1.A ([[Media:Operators.1.A.20110712.pdf |pdf]])
* Pointer.1.A ([[Media:Pointer.1.A.pdf |pdf]])
* Pointer.2.A ([[Media:Pointer.2.A.pdf |pdf]])
* Array.1.A ([[Media:Array.1.A.pdf |pdf]])
* Type.1.A ([[Media:Type.1.A.pdf |pdf]])
* Structure.1.A ([[Media:Structure.1.A.pdf |pdf]])


go to [ [[C programming in plain view]] ]

[[Category:C programming language]]

&lt;/br&gt;</text>
      <sha1>n6ljqi35s5frer0rixg7h5oge95sb3b</sha1>
    </revision>
  </page>
  <page>
    <title>OToPS/ABACAB (NIH R01 MH066647)</title>
    <ns>0</ns>
    <id>290138</id>
    <revision>
      <id>2809749</id>
      <parentid>2649798</parentid>
      <timestamp>2026-05-16T20:47:36Z</timestamp>
      <contributor>
        <username>Eyoungstrom</username>
        <id>1933979</id>
      </contributor>
      <comment>deleted MASC because never gathered</comment>
      <origin>2809749</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="23977" sha1="8g8a53ld9hsw5wcxze71vwizh96z8hd" xml:space="preserve">=== Assessing Bipolar Disorder: A Community-Academic Blend (ABACAB) ===
This page reproduces and expands the closing report for NIH R01 MH066647. 

We will work on formatting and adding links to the closing report in the Discuss page and then move sections over.

=== Sources of Information ===
The &quot;Source&quot; column of the table below refers to the source or method by which these variables were gathered or created.

SI = Semi-structured diagnostic interview (of both the parent and youth).

Perf = cognitive performance measure

C = caregiver (parent)

Y = Youth (self-report)

T = Teacher

Rev = administrative review of records

==Overview of Measures==
{| class=&quot;wikitable&quot;
|+ Add Caption here
|-
! Measure 
!Source
!$
! style=&quot;border-right:5px black;&quot; | Date Added to Protocol 
! style=&quot;background:#4B9CD3;&quot; | Community Mental Health (ACI) 
! style=&quot;background:#4B9CD3;&quot; | Longitudinal Baseline 
! 2nd Wave 
! 3rd Wave 
! 4th Wave 
! 5th Wave
|-
| #  Completed by wave 
|
| || || style=&quot;background: #4B9CD3;&quot; | 609 || style=&quot;background: #4B9CD3;&quot; | 209 || 75 || 29 || 16 || 1
|-
| [https://www.pediatricbipolar.pitt.edu/sites/default/files/K-SADSManiaRatingScale.pdf KSADS] (Kiddie Schedule for Affective Disorders and Schizophrenia - Pres &amp; Life)&lt;ref name=&quot;:0&quot;&gt;{{Cite journal|last=Kaufman|first=Joan|last2=Birmaher|first2=Boris|last3=Brent|first3=David|last4=Rao|first4=Uma|last5=Flynn|first5=Cynthia|last6=Moreci|first6=Paula|last7=Williamson|first7=Douglas|last8=Ryan|first8=Neal|date=1997-07|title=Schedule for Affective Disorders and Schizophrenia for School-Age Children-Present and Lifetime Version (K-SADS-PL): Initial Reliability and Validity Data|url=https://linkinghub.elsevier.com/retrieve/pii/S0890856709625557|journal=Journal of the American Academy of Child &amp; Adolescent Psychiatry|language=en|volume=36|issue=7|pages=980–988|doi=10.1097/00004583-199707000-00021}}&lt;/ref&gt;
|
|free|| || style=&quot;background: #4B9CD3;&quot; | Yes || style=&quot;background: #4B9CD3;&quot; | Yes || Yes || Yes || Yes || Yes
|-
|KSADS Mania Rating Scale (KMRS)&lt;ref&gt;{{Cite journal|last=Axelson|first=David|last2=Birmaher|first2=Boris J.|last3=Brent|first3=David|last4=Wassick|first4=Susan|last5=Hoover|first5=Christine|last6=Bridge|first6=Jeffrey|last7=Ryan|first7=Neal|date=2003-12|title=A Preliminary Study of the Kiddie Schedule for Affective Disorders and Schizophrenia for School-Age Children Mania Rating Scale for Children and Adolescents|url=http://www.liebertpub.com/doi/10.1089/104454603322724850|journal=Journal of Child and Adolescent Psychopharmacology|language=en|volume=13|issue=4|pages=463–470|doi=10.1089/104454603322724850|issn=1044-5463}}&lt;/ref&gt;
|
|free
|
|Yes
|Yes
|Yes
|Yes
|Yes
|Yes
|-
|KSADS Depression Rating Scale (KDRS)&lt;ref name=&quot;:0&quot; /&gt;
|
|free
|
|Yes
|Yes
|Yes
|Yes
|Yes
|Yes
|-
|Child Depression Rating Scale-Revised (CDRS-R)&lt;ref&gt;Poznanski E. Mokros H. ''Children's Depression Rating Scale–Revised (CDRS-R)'' Los Angeles: WPS; 1996.&lt;/ref&gt;
|
|free
|
|Yes
|Yes
|Yes
|Yes
|Yes
|Yes
|-
|Young Mania Rating Scale (YMRS)&lt;ref name=&quot;:1&quot;&gt;{{Cite journal|last=Young|first=R. C.|last2=Biggs|first2=J. T.|last3=Ziegler|first3=V. E.|last4=Meyer|first4=D. A.|date=1978-11|title=A Rating Scale for Mania: Reliability, Validity and Sensitivity|url=https://www.cambridge.org/core/product/identifier/S0007125000198551/type/journal_article|journal=British Journal of Psychiatry|language=en|volume=133|issue=5|pages=429–435|doi=10.1192/bjp.133.5.429|issn=0007-1250}}&lt;/ref&gt;
|
|free
|
|Yes
|Yes
|Yes
|Yes
|Yes
|Yes
|-
| [https://osf.io/rygju/ KSADS-PDD] Screen (additional details about Pervasive Developmental Disorders)&lt;ref name=&quot;:0&quot; /&gt;
|
|free|| April, 2007 || style=&quot;background: #4B9CD3;&quot; | Yes || style=&quot;background: #4B9CD3;&quot; | Yes || Yes || Yes || Yes || Yes
|-
| Lifeline (Detailed developmental history)&lt;ref&gt;{{Cite journal|last=Gramling|first=Lou F.|last2=Carr|first2=Rebecca L.|date=2004-05|title=Lifelines: A Life History Methodology|url=https://journals.lww.com/nursingresearchonline/abstract/2004/05000/lifelines__a_life_history_methodology.8.aspx|journal=Nursing Research|language=en-US|volume=53|issue=3|pages=207|doi=10.1097/00006199-200405000-00008|issn=0029-6562}}&lt;/ref&gt;
|
| || || style=&quot;background: #4B9CD3;&quot; | Yes || style=&quot;background: #4B9CD3;&quot; | Yes || Yes || Yes || Yes || Yes
|-
| MD/PhD  Evaluation (review of interview by a doctoral level clinician) 
|
| || || style=&quot;background: #4B9CD3;&quot; | Yes || style=&quot;background: #4B9CD3;&quot; | Yes || Yes || Yes || Yes || Yes
|-
| Sheehan Disability Scale&lt;ref&gt;Sheehan DV (1983) The Anxiety disease. Scribner, New York&lt;/ref&gt;&lt;ref&gt;Sheehan DV, Harnett-Sheehan K, Raj BA (1996). The measurement of disability. Int Clin Psychopharmacol 11 (Suppl 3):89–95. PDF: &lt;nowiki&gt;http://journals.lww.com/intclinpsychopharm/Abstract/1996/06003/The_measurement_of_disability.15.aspx&lt;/nowiki&gt;&lt;/ref&gt;
|
|$|| April, 2005 || style=&quot;background: #4B9CD3;&quot; | Yes || style=&quot;background: #4B9CD3;&quot; | Yes || Yes || Yes || Yes || Yes
|-
|Bipolar Course Checklist (used to track features related to types of bipolar disorder)
|
|free
|
|Yes
|Yes
|Yes
|Yes
|Yes
|Yes
|-
|Rater 1 Observational Rating of Discrete Emotions (ORDES)&lt;ref name=&quot;:3&quot;&gt;{{Cite journal|last=Harmon-Jones|first=Cindy|last2=Bastian|first2=Brock|last3=Harmon-Jones|first3=Eddie|date=2016-08-08|title=The Discrete Emotions Questionnaire: A New Tool for Measuring State Self-Reported Emotions|url=https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0159915|journal=PLOS ONE|language=en|volume=11|issue=8|pages=e0159915|doi=10.1371/journal.pone.0159915|issn=1932-6203|pmc=PMC4976910|pmid=27500829}}&lt;/ref&gt;
|
|
|April, 2007
|Yes
|Yes
|
|
|
|
|-
|Rater 1 Guide to Assessment of Test Session Behavior (GATSB)&lt;ref name=&quot;:4&quot;&gt;{{Cite journal|last=Daleiden|first=Eric|last2=Drabman|first2=Ronald S.|last3=Benton|first3=Jennifer|date=2002-05|title=The Guide to the Assessment of Test Session Behavior: Validity in Relation to Cognitive Testing and Parent-Reported Behavior Problems in a Clinical Sample|url=http://www.tandfonline.com/doi/abs/10.1207/S15374424JCCP3102_11|journal=Journal of Clinical Child &amp; Adolescent Psychology|language=en|volume=31|issue=2|pages=263–271|doi=10.1207/S15374424JCCP3102_11|issn=1537-4416}}&lt;/ref&gt;
|
|
|April, 2007
|Yes
|Yes
|
|
|
|
|-
|Wechsler Abbreviated Scale of Intelligence (WASI)&lt;ref&gt;{{Cite journal|last=Wechsler|first=David|date=2012-11-12|title=Wechsler Abbreviated Scale of Intelligence|url=https://doi.apa.org/doi/10.1037/t15170-000|language=en|doi=10.1037/t15170-000}}&lt;/ref&gt;
|
|
|April, 2007
|Yes
|Yes
|
|
|
|
|-
|SADS-LB (Psychiatric History Interview of Caregiver and Family)&lt;ref&gt;{{Cite book|url=https://www.taylorfrancis.com/books/9780203911822|title=Handbook of Depression and Anxiety|date=2003-04-18|publisher=CRC Press|isbn=978-0-203-91182-2|editor-last=Kasper|editor-first=Siegfried|edition=0|language=en|doi=10.3109/9780203911822|editor-last2=den Boer|editor-first2=Johan A.|editor-last3=Sitsen|editor-first3=J.M. Ad}}&lt;/ref&gt;
|
|$
|removed 10/03
|
|
|
|
|
|
|-
|[https://devepi.duhs.duke.edu/measures/the-child-and-adolescent-impact-assessment-caia/ Child and Adolescent Impact Assessment (CAIA)]&lt;ref&gt;Messer SC, Angold A, Costello EJ, &amp; Burns BJ (1996) The Child and Adolescent Burden Assessment (CABA): Measuring the family impact of emotional and behavioral problems. International Journal of Methods in Psychiatric Research, 6:261-284.&lt;/ref&gt;&lt;ref&gt;Farmer EMZ, Burns BJ, Angold A, &amp; Costello EJ (1997) Impact of Children’s Mental Health Problems on Families: Relationships with Service Use. Journal of Emotional and Behavioral Disorders, 5:230-238. Copyright (1997) by PRO-ED, Inc.&lt;/ref&gt;
|
|
|
|
|Yes
|
|
|
|
|-
|[https://devepi.duhs.duke.edu/measures/the-child-and-adolescent-services-assessment-casa/ Child and Adolescent Services Assessment (CASA)] &lt;ref&gt;Farmer EMZ, Angold A, Burns BJ, &amp; Costello EJ “Reliability of self-reported service use: Test-retest consistency of children’s responses to the Child and Adolescent Services Assessment (CASA).” Journal of Child and Family Studies, 1994; 3:307-325&lt;/ref&gt;
|
|
|
|
|Yes
|Yes
|Yes
|Yes
|Yes
|-
|Demographic  Packet/Contact Sheet
|
|
|
|Yes
|Yes
|
|
|
|
|-
|Achenbach Child Behavior Checklist (CBCL)&lt;ref name=&quot;:5&quot;&gt;Achenbach, T. M. (2001). Manual for ASEBA school-age forms &amp; profiles. ''University of Vermont, Research Center for Children, Youth &amp; Families''.&lt;/ref&gt;
|
|$
|
|Yes
|Yes
|
|Yes
|
|Yes
|-
|Mini International Neuropsychiatric Interview (MINI) - Mother&lt;ref name=&quot;:6&quot;&gt;Sheehan, D. V., Lecrubier, Y., Sheehan, K. H., Amorim, P., Janavs, J., Weiller, E., Hergueta, T., Baker, R., &amp; Dunbar, G. C. (1998). The Mini-International Neuropsychiatric Interview (M.I.N.I.): the development and validation of a structured diagnostic psychiatric interview for DSM-IV and ICD-10. ''The Journal of clinical psychiatry'', ''59 Suppl 20'', 22–57.&lt;/ref&gt;
|
|$
|October, 2003
|Yes
|Yes
|
|
|
|
|-
|Mini International Neuropsychiatric Interview (MINI) - Father&lt;ref name=&quot;:6&quot; /&gt;
|
|$
|October, 2003
|Yes
|Yes
|
|
|
|
|-
|Mini International Neuropsychiatric Interview (MINI) - Others&lt;ref name=&quot;:6&quot; /&gt;
|
|$
|October, 2003
|Yes
|Yes
|
|
|
|
|-
|Family History Research Diagnostic Criteria (FHRDC)&lt;ref&gt;Uher R., et al. A familial risk enriched cohort as a platform fortesting early interventions to prevent severe mental illness. ''BMC Psychiatry'' 2014, :344.&lt;/ref&gt;
|
|
|February, 2004; Modified, April,  2007
|Yes
|Yes
|
|
|
|
|-
|Rater 2 Observational Rating of Discrete Emotions (ORDES)&lt;ref name=&quot;:3&quot; /&gt;
|
|
|April, 2007
|Yes
|Yes
|
|
|
|
|-
|Rater 2  Guide to Assessment of Test Session Behavior (GATSB)&lt;ref name=&quot;:4&quot; /&gt;
|
|
|April, 2007
|Yes
|Yes
|
|
|
|
|-
|Bender Gestalt test of visual-motor integration&lt;ref&gt;Ford-Martin, Paula &quot;Bender-Gestalt Test .&quot; Gale Encyclopedia of Medicine, 3rd ed.. . Retrieved June 14, 2024 from Encyclopedia.com: &lt;nowiki&gt;https://www.encyclopedia.com/medicine/encyclopedias-almanacs-transcripts-and-maps/bender-gestalt-test&lt;/nowiki&gt;&lt;/ref&gt;
|
|$
|April, 2007
|Yes
|Yes
|
|
|
|
|-
|Autism Screening Questionnaire (ASSQ?) &lt;ref&gt;Ehlers, S., Gillberg, C., &amp; Wing, L. (1999). A screening questionnaire for Asperger syndrome and other high-functioning autism spectrum disorders in school age children. Journal of autism and developmental disorders, 29(2), 129-141.&lt;/ref&gt;
|
|
|added at ACI 10/03
|Yes
|Yes
|
|
|
|
|-
|[https://osf.io/exkmy/ Parent KINDL]:  5-7 years  8-16 years&lt;ref name=&quot;:2&quot;&gt;{{Cite journal|last=Ravens-Sieberer|first=U.|last2=Bullinger|first2=M.|date=1998-07|title=Assessing health-related quality of life in chronically ill children with the German KINDL: first psychometric and content analytical results|url=http://link.springer.com/10.1023/A:1008853819715|journal=Quality of Life Research|language=en|volume=7|issue=5|pages=399–407|doi=10.1023/A:1008853819715|issn=0962-9343}}&lt;/ref&gt;
|
|
|
|Yes
|Yes
|Yes
|Yes
|Yes
|Yes
|-
|Antisocial Processes Screening Device (APSD –  Parent)&lt;ref name=&quot;:7&quot;&gt;{{Cite journal|last=Frick|first=Paul J.|last2=Hare|first2=Robert D.|date=2011-09-12|title=Antisocial Process Screening Device|url=https://doi.apa.org/doi/10.1037/t00032-000|language=en|doi=10.1037/t00032-000}}&lt;/ref&gt;
|
|
|added at ACI 10/03
|Yes
|Yes
|Yes
|Yes
|Yes
|Yes
|-
|Young's Mania Rating Scale -- Revised Parent (YMRS –  Parent II)&lt;ref&gt;{{Cite journal|last=Young|first=R. C.|last2=Biggs|first2=J. T.|last3=Ziegler|first3=V. E.|last4=Meyer|first4=D. A.|date=1978-11|title=A Rating Scale for Mania: Reliability, Validity and Sensitivity|url=https://www.cambridge.org/core/product/identifier/S0007125000198551/type/journal_article|journal=British Journal of Psychiatry|language=en|volume=133|issue=5|pages=429–435|doi=10.1192/bjp.133.5.429|issn=0007-1250}}&lt;/ref&gt;
|
|
|added at ACI 10/03
|Yes
|Yes
|Yes
|Yes
|Yes
|Yes
|-
|[[Evidence-based assessment/Instruments/General Behavior Inventory|General Behavior Inventory (GBI) – Parent Re: Youth]]&lt;ref name=&quot;:8&quot;&gt;{{Cite journal|last=Depue|first=Richard A.|last2=Slater|first2=Judith F.|last3=Wolfstetter-Kausch|first3=Heidi|last4=Klein|first4=Daniel|last5=Goplerud|first5=Eric|last6=Farr|first6=David|date=1981-10|title=A behavioral paradigm for identifying persons at risk for bipolar depressive disorder: A conceptual framework and five validation studies.|url=https://doi.apa.org/doi/10.1037/0021-843X.90.5.381|journal=Journal of Abnormal Psychology|language=en|volume=90|issue=5|pages=381–437|doi=10.1037/0021-843X.90.5.381|issn=1939-1846}}&lt;/ref&gt;
|
|free
|
|Yes
|Yes
|Yes
|Yes
|Yes
|Yes
|-
|[https://bpchildresearch.org/cbq/cbq_survey.cfm Mood Disorder Questionnaire – Parent Re: Youth]&lt;ref name=&quot;:9&quot;&gt;{{Cite journal|last=Hirschfeld|first=Robert M.A.|last2=Williams|first2=Janet B.W.|last3=Spitzer|first3=Robert L.|last4=Calabrese|first4=Joseph R.|last5=Flynn|first5=Laurie|last6=Keck|first6=Paul E.|last7=Lewis|first7=Lydia|last8=McElroy|first8=Susan L.|last9=Post|first9=Robert M.|date=2000-11|title=Development and Validation of a Screening Instrument for Bipolar Spectrum Disorder: The Mood Disorder Questionnaire|url=http://psychiatryonline.org/doi/abs/10.1176/appi.ajp.157.11.1873|journal=American Journal of Psychiatry|language=en|volume=157|issue=11|pages=1873–1875|doi=10.1176/appi.ajp.157.11.1873|issn=0002-953X}}&lt;/ref&gt;
|
|free
|
|Yes
|Yes
|Yes
|Yes
|Yes
|Yes
|-
|[https://bpchildresearch.org/cbq/cbq_survey.cfm Parent Report Behavioral Inhibition System/Behavioral Approach System (BIS/BAS) Re:Youth] &lt;ref name=&quot;:10&quot;&gt;Carver, Charles S. &amp; White, Teri L. (1994). Behavioral inhibition, behavioral activation, and affective responses to impending reward and punishment: The BIS/BAS scales. ''Journal of Personality and Social Psychology'', ''67''(2), 319 – 333.&lt;/ref&gt;
|
|free
|added at ACI 10/03
|Yes
|Yes
|Yes
|Yes
|Yes
|Yes
|-
|Family Assessment Device (FAD)&lt;ref&gt;Epstein, N. B., Baldwin, L. M., &amp; Bishop, D. S. (1983). The McMaster family assessment device. Journal of marital and family therapy, 9(2), 171-180.&lt;/ref&gt;
|
|free
|added at ACI 10/03
|Yes
|Yes 
|Yes 
|Yes
|Yes
|Yes
|-
|Expressed Emotions-Parent (EE-P)&lt;ref name=&quot;:11&quot;&gt;{{Cite journal|last=Cole|first=John D.|last2=Kazarian|first2=Shahe S.|date=1988-05|title=The level of expressed emotion scale: A new measure of expressed emotion|url=https://onlinelibrary.wiley.com/doi/10.1002/1097-4679(198805)44:33.0.CO;2-3|journal=Journal of Clinical Psychology|language=en|volume=44|issue=3|pages=392–397|doi=10.1002/1097-4679(198805)44:3&lt;392::AID-JCLP2270440313&gt;3.0.CO;2-3}}&lt;/ref&gt;
|
|
|added at ACI 10/03
|Yes
|Yes
|Yes
|Yes
|Yes
|Yes
|-
|[https://osf.io/8wv3a Child Mania Rating Scale] &lt;ref name=&quot;:12&quot;&gt;{{Cite journal|last=Pavuluri|first=Mani N.|last2=Henry|first2=David B.|last3=Devineni|first3=Bhargavi|last4=Carbray|first4=Julie A.|last5=Birmaher|first5=Boris|date=2006-05|title=Child Mania Rating Scale: Development, Reliability, and Validity|url=https://linkinghub.elsevier.com/retrieve/pii/S0890856709612028|journal=Journal of the American Academy of Child &amp; Adolescent Psychiatry|language=en|volume=45|issue=5|pages=550–560|doi=10.1097/01.chi.0000205700.40700.50}}&lt;/ref&gt;
|
|
|April, 2005
|Yes
|Yes
|
|
|
|
|-
|General Behavior Inventory (GBI) Parent re: Self&lt;ref name=&quot;:8&quot; /&gt;
|
|
|Dropped October, 2004
|Yes
|Yes
|
|
|
|
|-
|[https://osf.io/wjkfa/ Mood Disorder Questionnaire] – Parent Re: Self&lt;ref name=&quot;:9&quot; /&gt;
|
|free
|October, 2004 modified 12/05
|Yes
|Yes
|Yes
|Yes
|Yes
|Yes
|-
|Beck Depression Inventory – Parent Re: Self&lt;ref name=&quot;:13&quot;&gt;Beck, A.T., Ward, C. H., Mendelson, M., Mock, J., &amp; Erbaugh, J. (1961) An inventory for measuring depression. ''Archives of General Psychiatry,'' ''4'', 561-571.&lt;/ref&gt;
|
|free 
|October, 2004
|Yes
|Yes
|Yes
|Yes
|Yes
|Yes
|-
|SCID-II  Parent&lt;ref&gt;{{Cite journal|last=Walters|first=Paul|last2=Moran|first2=Paul|last3=Choudhury|first3=Partha|last4=Lee|first4=Tennyson|last5=Mann|first5=Anthony|date=2004-02|title=Screening for personality disorder: a comparison of personality disorder assessment by patients and informants|url=https://onlinelibrary.wiley.com/doi/10.1002/mpr.162|journal=International Journal of Methods in Psychiatric Research|language=en|volume=13|issue=1|pages=34–39|doi=10.1002/mpr.162|issn=1049-8931|pmc=PMC6878308|pmid=15181485}}&lt;/ref&gt;
|C
|
|April, 2007
|Yes
|Yes
|
|
|
|
|-
|Sleep Questionnaire
|
|
|April, 2007
|Yes
|Yes
|
|
|
|
|-
|Child Symptom Inventory (CSI) &lt;ref&gt;{{Cite journal|last=Sprafkin|first=Joyce|last2=Gadow|first2=Kenneth D.|last3=Salisbury|first3=Helen|last4=Schneider|first4=Jayne|last5=Loney|first5=Jan|date=2002-11|title=Further Evidence of Reliability and Validity of the Child Symptom Inventory-4: Parent Checklist in Clinically Referred Boys|url=http://www.tandfonline.com/doi/abs/10.1207/S15374424JCCP3104_10|journal=Journal of Clinical Child &amp; Adolescent Psychology|language=en|volume=31|issue=4|pages=513–524|doi=10.1207/S15374424JCCP3104_10|issn=1537-4416}}&lt;/ref&gt;
|
|
|October, 2004
|
|
|Yes
|
|Yes
|
|-
|Social Activities Questionnaire
|
|
|
|
|
|Yes
|Yes
|Yes
|Yes
|-
|Temperament Scale (DOTS)&lt;ref&gt;{{Cite journal|last=Windle|first=Michael|last2=Lerner|first2=Richard M.|date=1986-04|title=Reassessing the Dimensions of Temperamental Individuality Across the Life Span:The Revised Dimensions of Temperament Survey (DOTS-R)|url=http://journals.sagepub.com/doi/10.1177/074355488612007|journal=Journal of Adolescent Research|language=en|volume=1|issue=2|pages=213–229|doi=10.1177/074355488612007|issn=0743-5584}}&lt;/ref&gt;
|
|
|October, 2004
|
|
|Yes
|
|
|Yes
|-
|Buss Perry Aggression Questionnaire&lt;ref&gt;{{Cite journal|last=Buss|first=Arnold H.|last2=Perry|first2=Mark|date=1992-09|title=The Aggression Questionnaire.|url=https://doi.apa.org/doi/10.1037/0022-3514.63.3.452|journal=Journal of Personality and Social Psychology|language=en|volume=63|issue=3|pages=452–459|doi=10.1037/0022-3514.63.3.452|issn=1939-1315}}&lt;/ref&gt;
|
|
|
|
|
|Yes
|Yes
|Yes
|Yes
|-
|
|
|
|
|
|
|
|
|
|
|-
|[https://osf.io/exkmy/ KINDL]:  4-7    8-12   13-16&lt;ref name=&quot;:2&quot; /&gt;
|Y
|
|
|Yes
|Yes
|Yes
|Yes
|Yes
|Yes
|-
|APSD –  Youth S.R. (Age 11-17 ACI; 6-17 Case)&lt;ref name=&quot;:7&quot; /&gt;
|Y
|
|added at ACI 10/03
|Yes
|Yes
|Yes
|Yes
|Yes
|Yes
|-
|Expressed  Emotions Teen Questionnaire (EE-A) (Age 11-17 ACI; 8-17 Case)&lt;ref name=&quot;:11&quot; /&gt;
|Y
|
|added at ACI 10/03
|Yes
|Yes
|Yes
|Yes
|Yes
|Yes
|-
|Young  Mania Rating Scale – S.R. (YMRS-SR) (Age 11-17 ACI; 10-17 Case)&lt;ref name=&quot;:1&quot; /&gt;
|Y
|
|added at ACI 10/03
|Yes
|Yes
|Yes
|Yes
|Yes
|Yes
|-
|EDI-II  60 (Age 11-17 ACI; 10-17 Case)&lt;ref&gt;Izard, C. E., Libero, D. Z., Putnam, P., &amp; Haynes, O. M. (1993). Stability of emotion experiences and their relations to traits of personality. Journal of Personality and Social Psychology, 64, 847-860. doi:&lt;nowiki&gt;http://dx.doi.org/10.1037/0012-1649.27.3.432&lt;/nowiki&gt;&lt;/ref&gt;
|Y
|
|added at ACI 10/03
|Yes
|Yes
|
|
|
|
|-
|General  Behavior Inventory – Adolescent (GBI-A) (Age 11-17 ACI; 10-17 Case)&lt;ref name=&quot;:8&quot; /&gt;
|Y
|
|
|Yes
|Yes
|Yes
|Yes
|Yes
|Yes
|-
|[https://osf.io/wjkfa/ Mood Disorder Questionnaire (MDQ-A)] (Age 11-17)&lt;ref name=&quot;:9&quot; /&gt;
|Y
|
|
|Yes
|Yes
|Yes
|Yes
|Yes
|Yes
|-
|[https://osf.io/b5nht/ BIS/BAS]  SR (Age 11-17 ACI; 10-17 Case)&lt;ref name=&quot;:10&quot; /&gt;
|Y
|
|added at ACI 10/03
|Yes
|Yes
|Yes
|Yes
|Yes
|Yes
|-
|Achenbach Youth Self Report  (YSR) (Age 11-17)&lt;ref name=&quot;:5&quot; /&gt;
|Y
|$
|
|Yes
|Yes
|
|Yes
|
|Yes
|-
|[https://osf.io/pwubj/ CATS/CPSS]  (Age 11-17 ACI; 8-17 Case)&lt;ref&gt;Foa, E. B., Johnson, K. M., Feeny, N. C., &amp; Treadwell, K. R. H. (2001). The Child PTSD Symptom Scale: A preliminary examination of its psychometric properties. Journal of Clinical Child Psychology, 30(3), 376-384.&lt;/ref&gt;
|Y
|
|added at ACI 10/03
|Yes
|Yes
|Yes
|Yes
|Yes
|Yes
|-
|Friendship  Network Questionnaire (Age11-17)
|Y
|
|December, 2005
|Yes
|Yes
|Yes
|Yes
|Yes
|Yes
|-
|Network  of Relationships Inventory (Age 11-17)&lt;ref&gt;Furman W, Buhrmester D. Children’s perceptions of the personal relationships in their social networks. ''Developmental Psychology.'' 1985;21:1016–1024.&lt;/ref&gt;
|Y
|
|December, 2005
|Yes
|Yes
|Yes
|Yes
|Yes
|Yes
|-
|Self Perceptions Profile for Adolescents (Age 11-17)&lt;ref&gt;Harter, S. (1988). Manual for the Self-Perception Profile for Adolescents. Denver, CO: University of Denver Press&lt;/ref&gt;
|Y
|
|December, 2005
|Yes
|Yes
|Yes
|Yes
|Yes
|Yes
|-
|Peer  Experiences Questionnaire (Age 11-17)&lt;ref&gt;Prinstein MJ, Boergers J, Vernberg EM. Overt and relational aggression in adolescents: social-psychological adjustment of aggressors and victims. J Clin Child Psychol. 2001;30:479–91.&lt;/ref&gt;
|Y
|
|December, 2005
|Yes
|Yes
|Yes 
|Yes
|Yes
|Yes
|-
|SAS-A  (Age 11-17) &lt;ref&gt;{{Cite journal|last=Nelemans|first=Stefanie A.|last2=Meeus|first2=Wim H. J.|last3=Branje|first3=Susan J. T.|last4=Van Leeuwen|first4=Karla|last5=Colpin|first5=Hilde|last6=Verschueren|first6=Karine|last7=Goossens|first7=Luc|date=2019-03|title=Social Anxiety Scale for Adolescents (SAS-A) Short Form: Longitudinal Measurement Invariance in Two Community Samples of Youth|url=http://journals.sagepub.com/doi/10.1177/1073191116685808|journal=Assessment|language=en|volume=26|issue=2|pages=235–248|doi=10.1177/1073191116685808|issn=1073-1911}}&lt;/ref&gt;
|Y
|
|
|Yes
|Yes
|
|
|
|
|-
|Gambling Task (Age 11-17)
|Y
|
|December, 2005
|Yes
|Yes
|
|
|
|
|-
|EYES  (Age 10-17)
|Y
|
|Added for FU in October,  2004;  added in T1 - 3/06
|Yes
|Yes
|Yes
|Yes
|Yes
|Yes
|-
|SCID-II Personality Screen  (Age 11-17)&lt;ref&gt;First, M. B., Gibbon, M., Spitzer, R. L., Williams, J. B. W., &amp; Benjamin, L. S. (1997). Structured Clinical Interview for DSM-IV Axis II Personality Disorders (SCID-II). Washington, DC: American Psychiatric Press, Inc.&lt;/ref&gt;
|Y
|
|April, 2007
|Yes
|Yes
|
|
|
|
|-
|Youth  Symptom Inventory (YSI) (Age 11-17)
|Y
|$
|October, 2004
|
|
|Yes
|
|Yes
|
|-
|Peterson  Pubertal Scale (Age 11-17)&lt;ref&gt;{{Cite journal|last=Petersen|first=Anne C.|last2=Crockett|first2=Lisa|last3=Richards|first3=Maryse|last4=Boxer|first4=Andrew|date=1988-04|title=A self-report measure of pubertal status: Reliability, validity, and initial norms|url=http://link.springer.com/10.1007/BF01537962|journal=Journal of Youth and Adolescence|language=en|volume=17|issue=2|pages=117–133|doi=10.1007/BF01537962|issn=0047-2891}}&lt;/ref&gt;
|Y?
|
|October, 2004
|
|
|Yes
|Yes
|Yes
|Yes
|-
|
|
|
|
|
|
|
|
|
|
|-
|
|
|
|
|
|
|
|
|
|
|-
|Antisocial Process Screening Device, Teacher version (APSD-T)&lt;ref name=&quot;:7&quot; /&gt;
|T
|
|
|Yes
|Yes
|Yes
|Yes
|Yes
|Yes
|-
|Young's Mania Rating Scale - Teacher version (YMRS-T)&lt;ref name=&quot;:1&quot; /&gt;
|T
|
|added at ACI 10/03
|Yes
|Yes
|Yes
|Yes
|Yes
|Yes
|-
|Achenbach Teacher Report Form (TRF)&lt;ref name=&quot;:5&quot; /&gt;
|T
|$
|
|Yes
|Yes
|Yes
|Yes
|Yes
|Yes
|-
|General Behavior Inventory - Teacher Version (GBI-T)&lt;ref name=&quot;:13&quot; /&gt;
|T
|
|
|Yes
|Yes
|Yes
|Yes
|Yes
|Yes
|-
|Adjustment Scales for Children &amp; Adolescents (ASCA)&lt;ref&gt;McDermott, P.A., Marston, N.C., &amp; Stott, D.H. ( 1993). ''Adjustment Scales for Children and Adolescents''. Philadelphia: Edumetric and Clinical Science.&lt;/ref&gt;
|T
|?? out of print
|
|Yes
|Yes
|Yes
|Yes
|Yes
|Yes
|-
|Child Mania Rating Scale - Teacher version (CMRS-T)&lt;ref name=&quot;:12&quot; /&gt;
|T
|
|April, 2005
|Yes
|Yes
|
|
|
|
|}


=Miscellany=
Complete copy of the source documents (375 page PDF scanning the principal investigator's copy of source documents, with handwritten annotation).[https://osf.io/7te3u/files/osfstorage/621f021bc06427012bd90da5]   

Detailed information about the scoring for the &quot;longitudinal expert evaluation of all data&quot; ([[OToPS/ABACAB (NIH R01 MH066647)/LEAD Diagnoses|LEAD]]) diagnoses in the grant.   

Here's a link to an example of a simple data use agreement (DUA) related to the project: [https://docs.google.com/forms/d/e/1FAIpQLSexLb8PJ6UF8dlBdsYJs0JZF9DW--o5W2tppjs73jnh8jkY_g/viewform ABACAB Data Use Agreement]

[https://osf.io/na5w2 DSM Criteria for Mania]

[https://osf.io/mhxks Procedure for KSADS scoring template]

[https://osf.io/5cnw2 Bipolar Research Group Rosetta Stone]

[https://osf.io/geh4v Magic Colors Virtual Template (KSADS)]

[https://osf.io/8cvq9 Closing Report Body - Final] 

=== References ===</text>
      <sha1>8g8a53ld9hsw5wcxze71vwizh96z8hd</sha1>
    </revision>
  </page>
  <page>
    <title>Talk:OToPS/ABACAB (NIH R01 MH066647)</title>
    <ns>1</ns>
    <id>290139</id>
    <revision>
      <id>2809750</id>
      <parentid>2457118</parentid>
      <timestamp>2026-05-16T20:51:49Z</timestamp>
      <contributor>
        <username>Eyoungstrom</username>
        <id>1933979</id>
      </contributor>
      <minor />
      <comment>/* Paste of closing report */ edited title</comment>
      <origin>2809750</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="106935" sha1="nakba349iiv6xbr4ikdrayar2b2zrf9" xml:space="preserve">== Closing Report Filed with NIH ==

  
'''Improving the Assessment of Juvenile Bipolar Disorder'''

5R01 MH066647

Closing Report


Principal Investigator: Eric A. Youngstrom, Ph.D.

Co-Investigators: Jennifer Kogos Youngstrom, Ph.D., Norah C. Feeny, Ph.D., Oren Meyers, Ph.D., 

Robert L. Findling, M.D.

Research Coordinator: Heather Marcinick, M.A.


Data Managers: Christine Demeter, M.A., Oren Meyers, Ph.D., &amp; Andrew Freeman, M.A.


'''Table of Contents'''


Introduction...................................................................................................................................       3

Aim 1: Develop and Cross-Validate Screening Instruments................................................................       3

               Hypothesis 1: Measures Will Generalize and Remain Valid[EAY1] ..........................................       3

               Hypothesis 2: An Abbreviated Instrument Will Cross-Validate Successfully[EAY2]  ..................       6

Aim 2: Clarify the Features of Subsyndromal Bipolar Disorder...........................................................       6

               Hypothesis 3: Manic Symptoms Will Statistically Identify a Category of Bipolar Disorder[EAY3]      6

               Hypothesis 4: Bipolar Disorder Will Be the Condition with Greatest Average Impairment[EAY4]                       7

Aim 3: Examine Developmental Changes in Mood Presentation from Ages 5 to 17 Years....................       7

               Hypothesis 5: Continuity of Symptom Presentation Across Age Ranges[EAY5] ........................       7

                               Reliability and Credibility of Information Sources.....................................................       9

                               Associations Between Credibility and Validity..........................................................    10

               Hypothesis 6: Bipolar Disorder Will Show Progressively Worse Burden, More Service Use......    10

Secondary Aims:.............................................................................................................................    11

               Base Rate for Juvenile BPSD in a Community Mental Health Setting[EAY6] .............................    11

               Diagnostic Agreement[EAY7] ...............................................................................................    11

               Promoting Translation of Assessment Procedures from Research to Clinical Settings.............    14

               Other Factors Potentially Changing Performance of Diagnostic Instruments[EAY8] .................    14

Demographics of Participants..........................................................................................................    15

Participant Enrollment Report.........................................................................................................    16

References Cited............................................................................................................................    18

Tables............................................................................................................................................    21

Appendix I: Publications, Grants, and Training Activities Deriving from Grant....................................    46


'''Improving the Assessment of Juvenile Bipolar Disorder'''


In the time since this grant was initially funded, the debate around the validity of diagnosing bipolar disorder in children and adolescents has remained heated. There have been considerable advances in knowledge about phenomenology, assessment, physiological correlates, and even some data about longitudinal course (Birmaher et al., 2009; Geller, Tillman, Bolhofner, &amp; Zimerman, 2008); but at the same time there continues to be vigorous discussion about the appropriateness of the diagnostic label (Healy, 2006; Leibenluft, Charney, Towbin, Bhangoo, &amp; Pine, 2003), and the implications in terms of treatment (Blader &amp; Carlson, 2007; Moreno et al., 2007), extending from the popular press (Kluger &amp; Song, 2002) to the deliberations about revision of the Diagnostic and Statistical Manual of the American Psychiatric Association ([http://www.dsm5.org/ www.dsm5.org]). In short, the objectives of the project are timely and informative.

The presentation of findings in this closing report will closely follow the structure of the specific and secondary aims from the funded version of the project. The format will be a recapitulation of the aim, followed by a brief narrative and then extensive tables or figures as appendix material, with the numbering reinforcing the link to each aim.

The overall goal of this project was to create a foundation for better defining and assessing bipolar disorders in pediatric populations. This submission consisted of two tightly interwoven studies. Together they will (a) establish a base rate for bipolar disorders in community mental health, and document the phenomenology of symptom presentation and associated characteristics, (b) evaluate the concordance between research and conventional diagnoses, (c) test the performance of instruments that have shown promise in a research mood disorders clinic when these are exported into a naturalistic community setting, (d) develop an abbreviated screening protocol optimized for use in community samples, and (e) prospectively cross-validate the use of the abbreviated screening protocol.

'''A. Specific Aims:''' 

'''Aim #1: To develop and prospectively cross-validate a juvenile bipolar spectrum disorder (BPSD) screening protocol optimized for use in community settings with representative, ethnically diverse populations.'''

''Hypothesis 1: Measures that performed well in pilot data from a research setting will demonstrate statistically significant diagnostic efficiency when exported to a community setting.'' 

The R01 used a LEAD consensus conference (Spitzer, 1983) as a way of assigning final diagnoses, after completing a KSADS interview (Geller et al., 2001; Kaufman et al., 1997) with the youth and primary caregiver. The same rater teams completed diagnostic interviews at both the community mental health center (CMHC) and academic medical center (AMC) sites, eliminating differences in rater experience or training as a potential confound in generating diagnoses.

The criterion diagnosis for the primary analyses of diagnostic efficiency was the presence or absence of a bipolar spectrum diagnosis. The bipolar criterion included bipolar I, bipolar II, cyclothymic disorder, and bipolar not otherwise specified (bipolar NOS), regardless of any potential other comorbid conditions. The inclusion of “spectrum” conditions such as cyclothymic disorder makes it harder for diagnostic efficiency to remain high, because these cases will have less clear cut symptom presentations, and they cannot have distinct manic episodes or else their diagnosis would “upgrade” to bipolar I, by definition. As a result, diagnostic sensitivity would be expected to be lower, as more “bipolar criterion” cases would be likely to earn only moderately elevated scores on instruments attempting to detect them.

Similarly, the comparison group contains all other cases presenting to the clinic. There were no exclusion criteria at the community mental health site, other than an inability to complete the interview in spoken English. This stands in marked contrast to the sampling strategy in prior phenomenologically oriented studies, where the comparison groups were selected to include healthy controls, or cases with attention-deficit/hyperactivity disorder without a comorbid mood disorder. Although these more homogeneous and distilled groups provide valuable comparators for phenomenology or for neurocognitive studies, they are quite different in composition and functioning than clinically representative samples. The high rates of stress, mood, anxiety, attention problems, and aggressive behavior in a clinically representative sample were expected to increase scores on measures attempting to detect mania, creating more “false positives” and reducing the diagnostic specificity.

Both expectations proved correct. Bipolar Spectrum presentations were far more common than bipolar I cases in community mental health, and the average scores on all bipolar screening measures tended to be slightly lower in the bipolar group in the CMHC setting, with large individual differences (and big standard deviations). Similarly, the average scores were higher in nonbipolar cases in the CMHC, reflecting the high degree of distress and complexity in these cases. These combined to lower the diagnostic efficiency of all instruments examined (see Table 1). Secondary analyses of the preliminary data submitted with this R01 proposal demonstrated that the effects of sample composition on the diagnostic efficiency performance of instruments could be marked (Youngstrom, Meyers, Youngstrom, Calabrese, &amp; Findling, 2006). The performance observed in the present sample was lower than reported in the prior validation studies. The decrement ranged from small (e.g., area under the curve for the PGBI Hypomanic/Biphasic 28 item score changing from .78 in Youngstrom et al., 2004 to .77 in the present data) to moderate (AUROC of .86 for the 10 item PGBI mania scale in its development sample (Youngstrom, Frazier, Demeter, Calabrese, &amp; Findling, 2008), down to a .79 in the present sample) and in some cases, substantial – such as the P-YMRS dropping to an AUROC of .67. The P-YMRS performance was sufficiently poor that it is clearly statistically inferior to all the other caregiver report measures examined, and we have stopped using it clinically as a result. The “CBCL Bipolar Profile” index (summing or averaging the Aggressive Behavior, Attention Problems, and Anxious/Depressed Scales from the CBCL) (Mick, Biederman, Pandina, &amp; Faraone, 2003) distinguished the bipolar from nonbipolar cases significantly better than chance, but significantly less well than all the other mood scales (except for the PYMRS), AUROC = .67. Overall, it was encouraging that all of the caregiver-reported measures continued to demonstrate statistical validity, despite the changes in sample composition and demographics. 

'''Caregiver Report.''' Table 2 reports the percentage of maximum possible (POMP) (Cohen, Cohen, Aiken, &amp; West, 1999) scores on all of the caregiver reported measures that specifically assess the mood symptoms of the youth, comparing scores for youths meeting full DSM-IV criteria for bipolar I (''n''=28) with youths meeting criteria for another bipolar spectrum disorder (e.g., bipolar II, cyclothymic disorder, or bipolar NOS; ''n''=116), unipolar depression or dysthymic disorder (''n''=221), ADHD or a disruptive behavior disorder without comorbid mood (''n''=353), or all other cases presenting to the clinic (''n''=72). Across all six measures investigated, the two bipolar groups were significantly more elevated than the other three non-bipolar groups, but the bipolar I group was never significantly different from the rest of the bipolar spectrum. Tables 3 and 4 report the same breakdowns for the CBCL broad band, clinical syndrome scales, and DSM-Oriented scales. Examination of the tables indicates that the differences are more moderate on non-mood oriented scales. 

'''Youth Self Report.''' Another way of measuring manic symptoms would be to rely on self report by the youth. This is consistent with how most of adult psychiatry conducts diagnostic screening or assessment. Analyses of the preliminary data for this grant (Youngstrom et al., 2004) suggested that youth report tends to discriminate bipolar from nonbipolar cases at better than chance rates, but significantly less well than parent report. This trend was also observed in an interim analysis of the data gathered under the auspices of this grant (Youngstrom et al., 2005), and it aligns with the effect sizes observed when comparing caregiver versus youth or teacher report about cases with bipolar disorder (Geller, Warner, Williams, &amp; Zimerman, 1998; Hazell, Lewin, &amp; Carr, 1999). The final analyses from this project continue to fit that pattern. As shown in Table 1, youth self report showed substantially lower AUROC values than did parent report. In the case of a self-report version of the YMRS, scores did not do better than chance at separating the bipolar spectrum cases, indicating a statistically “invalid” test (Kraemer, 1992). We hypothesize that there are two factors undermining the validity of self report about manic symptoms: One is that compromised insight is a feature of mania (Dell'Osso et al., 2002), and the other is that many of the symptoms of mania are things that would bother other people before they become subjectively noticeable to the person experiencing them. The adolescent with mania is not going to be the first person to notice when they are talking “too much,” or when their own mood seems irritable. Tables 5, 6, and 7 provide average scores on youth reports compared across diagnostic subgroups. 

'''Teacher Report.''' A third source of information this project examined was teacher report. Findings with the Achenbach Teacher Report Form (Achenbach &amp; Rescorla, 2001) replicate prior work in three important ways: (a) youths with bipolar disorder tend to show significant elevations on multiple behavior problems in school settings (e.g., ''T''-scores higher than 50); (b) teacher-parent agreement was as good or higher with regard to bipolar spectrum cases (''r''=.38) versus nonbipolar cases (''r''=.30, both comparing favorably to meta-analyses and normative data about teacher-parent agreement); and (c) teacher report operated at near-chance levels in discriminating bipolar from nonbipolar cases (nonsignificant AUROCs in ROC analyses).

A secondary aim of this project was to develop and test “second generation” mania rating scales that could be completed by teachers. Results indicated that it is difficult to measure manic symptoms using teacher report. Many items were difficult to rate, and teachers frequently skipped them. Reliability estimates were lower and factor structures often quite different in teacher report versus the corresponding caregiver or youth report on the same measure. AUROC values on teacher report were  consistently low and usually no better than chance at discriminating bipolar disorder from other cases (Youngstrom, Joseph, &amp; Greene, 2008). Tables 8, 9, and 10 compare averages on teacher measures across diagnostic subgroups.

Hypothesis 2: ''An abbreviated screening instrument can be developed on the basis of community sample data that will retain comparable levels of diagnostic efficiency versus a lengthier screening instrument when cross-validated in an independent, prospective sample.''


During the time that the grant was enrolling, there were several new measures developed and advertised for the assessment of bipolar disorder in youths. These included the parent version of the Mood Disorder Questionnaire (Hirschfeld et al., 2000), which performed better as a parent report instead of self report instrument (Wagner, Findling, Emslie, Gracious, &amp; Reed, 2006; Youngstrom, et al., 2005); as well as the Child Mania Rating Scale (Henry, Pavuluri, Youngstrom, &amp; Birmaher, 2008; Pavuluri, Henry, Devineni, Carbray, &amp; Birmaher, 2006) and other instruments. The protocol included the PGBI, the P-MDQ, and added the CMRS when it became available. When the time came to recommend an instrument for validation as a general screener for bipolar disorder, the Mood Disorder Questionnaire had become a commercially distributed instrument. There were more data available and published on the PGBI than any other instrument except the CBCL, which the PGBI had outperformed in all direct comparisons for the purpose of detecting bipolar spectrum disorder. The combination of validity evidence and low cost led to the selection of a 10 item Mania Scale version of the PGBI (PGBI-10M; Youngstrom, Frazier, et al., 2008) as the tool of choice for cross-validation in a community mental health sample. The 10 item mania scale became a standard part of the intake for the last two years of the grant. It demonstrated excellent psychometric properties, with a Cronbach’s alpha of .90, a one month retest reliability of .62, and an Area Under the Curve of .78 for discriminating bipolar versus all other cases based on a diagnostic interview some weeks later, versus an AUROC of .80 for a concurrently administered version of the PGBI.


'''Aim #2: To clarify the characteristic features of “subsyndromal” bipolar spectrum disorders, currently referred to as “Bipolar NOS” (Nottelmann et al., 2001), in both research and community settings.'''

Hypothesis 3: Taxometric statistical procedures will identify a group of children and adolescents experiencing a categorically different pattern of manic and depressive symptoms than expressed by the rest of the participants.

The taxometric statistical methods concentrated on the parent report measures, because these had demonstrated the largest effect sizes in the diagnostic efficiency analyses (i.e., largest AUROC values). Youth self report and teacher report often failed to perform better than chance when comparing groups based on DSM definitions. Although it is possible that other categories exist that would be associated with youth or teacher report, it is highly unlikely that existing measures would provide large effect sizes for sorting cases into previously unsuspected, atheoretical categories. The clinician-rated measures were disqualified for a different reason: Other simulation studies and investigations have found that clinician-rated instruments can create taxonic or continuous data, depending on how raters are trained or how expectations are framed. The emergence of a taxon using data drawn from the KSADS interviews thus would require cross-validation by an independent source of information (such as caregiver report on rating scales that were recused from the consensus diagnostic process). Thus caregiver report was the most likely and most independent source of information for taxometric analyses.

Based on two methods, Maximum Eigenvalue (MAXEIG) and Mean Above Minus Below A Cut (MAMBAC), the parent report data about manic, hypomanic, and mixed symptoms in the youths conformed to a dimensional model. Table 11 presents the power analysis for the taxometric procedures, which ranged from “acceptable” (''d''=1.6) to high (''d''=2.7). See Figures 1 and 2 for the visual plots of the results, as well as simulations for categorical and dimensional solutions.

We plan to conduct additional analyses using latent class and latent profile models to search for subgroups, but based on the present findings, we expect that a graded class model where cases are best distinguished by their underlying level of overall mania (similar to Krueger’s findings for other psychopathology constructs) (Krueger, Markon, Patrick, &amp; Iacono, 2005) are likely to be the best fitting models. The dimensional results are also consistent with recently published analyses of adult epidemiological data on mania (Prisciandaro &amp; Roberts, 2010). A dimensional model is also most consistent with emerging findings about the polygenic nature of bipolar disorder, with a large number of genes that each contribute small amounts of risk (WTCCC, 2007).

Hypothesis 4: Bipolar spectrum disorders will be associated with the highest average level of impairment of any major diagnostic category in a community sample.

Consistent with the hypothesis, both the bipolar I and other bipolar spectrum disorders were associated with the lowest level of average functioning, whether quantified as the Global Assessment of Functioning at the end of the KSADS interview, or using the “most severe past” or “highest level of functioning in the past year” Global Assessment Scale (CGAS; Shaffer et al., 1983) ratings. As was the case with the mood ratings (see Table 12A), the bipolar I cases were not significantly different from the rest of the bipolar spectrum on any of these measures of functioning. Table 12B summarizes means across diagnostic subgroups. More than 90% of cases with bipolar disorder reported impairment in more than one setting. Supplemental analyses found that when bipolar was comorbid with ADHD, it was not associated with an increase in the number of settings where the youth experienced impairment. The same pattern held with ODD compared to bipolar+ODD; see Tables 13 and 14 for details. 

'''Aim #3: To investigate developmental changes in symptom occurrence and presentation across the age-span from ages 5 to 17 years (including an examination of the validity of this diagnosis in terms of functional impairment and longitudinal course).'''

Hypothesis 5: There will be identifiable continuity in the type and pattern of symptoms presented by youths meeting BPSD criteria across the agespan, although this may require the use of different assessment strategies at different ages.


To examine age effects on symptom presentation, we grouped the sample into “prepubertal” (5 to 8 years), “peri-pubertal” (9 to 12 years), and Adolescent (13 to 18 years). When limiting the sample to youths identified as being on the bipolar spectrum per the LEAD diagnoses, there was evidence of significantly higher levels of depression in the peri-pubertal or adolescent groups than the pre-pubertal group, whether measured on the caregiver PGBI Depression scale (see Table 15), the KSADS Depression Rating Scale for past two weeks and worst lifetime, or the CDRS-R (trend) (Table 16). Findings were the opposite for interview-based ratings of mania in the past two weeks, with the adolescent group showing significantly lower ratings than the other two age-groups on the YMRS or KSADS Mania Rating Scale for the current episode. The “worst lifetime” mania ratings showed higher average scores in the older two groups, which makes sense given that these scores either matched the current episode or were higher if there was a more severe past episode. Age trends were not evident on parent report of manic symptoms. The general pattern of increasing depressive symptoms with puberty is consistent with a large body of research (Cyranowski, Frank, Young, &amp; Shear, 2000; Kovacs, 1989). The tendency to see decreases in manic symptoms with age matches clinical observations by Kraepelin (1921, Figure 46, p. 169), and also is consistent with recent analyses of two large USA epidemiological data sets (Cicero et al., 2009). Further investigation is needed to investigate the extent to which these patterns might be influenced by developmental offset of ADHD, which can inflate scores on some symptoms and measures of mania more than others.

A secondary set of analyses also investigated differences across age cohorts in the symptoms reported by the primary caregiver, using raw scores on the CBCL. We used raw scores because the standard scores are age-normed, eliminating age trends in behavior by design. Tables 17 and 18 present the averages and eta-squared effect sizes for the clinical syndrome scales and broad bands. The largest effects were lower levels of Aggressive Behavior and Social Problems in adolescence, and increasing levels of Withdrawn behavior in adolescence. Scores on the CBCL “Bipolar Profile” (now referred to as the “Emotional Dysregulation Profile”) also were significantly lower in adolescence. When examining the DSM-Oriented Scales, there were significantly lower averages on the Attention Problems and the Somatic Problems scales in adolescence (although the corresponding clinical syndrome scales, with broader item content, did not achieve statistical significance). No other differences achieved statistical significance.


A set of secondary analyses are examining the possibility that responses to specific symptoms change developmentally. This more fine-grained investigation is using “Differential Item Functioning” (DIF) techniques developed in the psychometric literature. Analyses conducted so far have focused on parent reported scores, because they provide consistent methodology across the largest age range. DIF could take two forms, sometimes described as “uniform” and “nonuniform” DIF. Uniform DIF describes the situation when there are average differences in the item score between groups (in this case, younger versus older youths) even after controlling for levels of mania. Put another way, there would be differences in average scores on the item in question due to extraneous factors besides mania. Approximately 30% of mania items across four instruments showed evidence of uniform DIF associated with age. Interestingly, roughly half of the items had higher scores in the young group, and half in the older group, resulting in biases that tended to cancel out at the level of total scores. Items asking about distractibility, energy, motor activity tended to have higher scores in younger cases, independent of level of mania. Conversely, items assessing sleep disturbance, increased sociability, hypersexuality, mood swings, irritability, and suspiciousness tended to be higher in the adolescents even after controlling for level of mania.

Non-uniform DIF refers to when the correlation between the item and the mania factor changes between groups. A similar number of items show evidence of non-uniform DIF related to age. Again, the tendency was for each instrument to include some items showing DIF in the opposite direction, with a net result being fairly consistent estimation of total scores within the same scale. On a global level, developmental changes in the rate of symptoms appear not to change the overall performance of rating scales appreciably, although there is evidence of more fine-grained developmental patterns that seem face valid and appear to replicate across instruments.

''Reliability and Credibility of Information Sources Across Age Cohorts''

As expected, caregiver report was the main source of information that could be used consistently across the ages from 5 to 18 years. Youth self-report on written questionnaires proved impractical before the age of 11 on most instruments. An innovation in this project was to keep track of the degree of assistance needed for the youth or caregiver to complete each instrument. Teacher report proved to be the least informative source of information about mood symptoms, despite our efforts to adapt instruments with good content coverage for use by teachers. Detailed evaluation of the psychometrics of four mania scales adapted for use by teachers have already been published (Youngstrom, Joseph, &amp;  Greene, 2008).


Interview-based information also could be used across the age-span, but the interviews were substantially different for young children versus adolescents. Often with young children the interview changed into a less structured interaction that provided an opportunity to conduct behavioral observations and probe key symptoms or events, whereas with adolescents it was usually possible to conduct an interview asking all the symptoms in a standard order. Based on this observation, we amended the protocol to start to systematically gather observational data using the Guide to the Assessment of Test Session Behavior (GATSB; Glutting &amp; Oakland, 1993) for the last 100 cases, providing intriguing pilot data about the value of systematic observational ratings (consistent with the recent findings from other NIMH sponsored work, e.g., the DB-DOS)(Keenan &amp; Wakschlag, 2002). We also had the interviewer rate the perceived credibility of the caregiver and the youth as a source of clinical information during the KSADS interview.

At the end of the KSADS, interviewers rated 55% of caregivers “good” credibility, 37% “fair,” and 8% “poor;” versus 24% of youths “good,” 47% “fair,” and 30% “poor.” Credible youths tended to have credible caregivers, chi-squared (4 ''df'') = 48.86, ''p''&lt;.00005; but there were still frequent mismatches, kappa=.16. Interviewers perceived caregivers as much more credible on average for the young children (ages 5 to 10 years): Cohen’s ''d''=1.15, ''p''&lt;.00005; whereas caregivers were only slightly more credible for the older youths, ''d''=.27, ''p''=.001.


Significant correlates of caregiver credibility included: younger age youth, better family functioning, better youth functioning, higher caregiver income or education, fewer children, and lower concerns about youth depression or manic symptoms. Regression analyses indicated that a combination of factors could explain 17% of the variance in caregiver credibility (''p''&lt;.00005), with family functioning (''r&lt;sub&gt;part&lt;/sub&gt;'' =.26), youth age (''r&lt;sub&gt;part&lt;/sub&gt;''=-.21), credibility of the youth (''r&lt;sub&gt;part&lt;/sub&gt;'' =.18), and caregiver education (''r&lt;sub&gt;part&lt;/sub&gt;'' =.09) making significant unique contributions. Caregiver credibility was unrelated to caregiver mood symptoms, youth cognitive ability, or independent observations of youth behavior problems (cf. Youngstrom, Loeber, &amp; Stouthamer-Loeber, 2000). 


Significant correlations of youth credibility were mostly different from the predictors of caregiver credibility, and included: older age youth, female youth, not having a diagnosis of ADHD or bipolar disorder, lower CBCL externalizing or attention problems, higher caregiver education, having a male primary caregiver, lower caregiver report of manic symptoms, and higher self-report of manic or depressive symptoms. A subset of cases also completed a brief intelligence test and had observational ratings of behavior available. Greater youth credibility was strongly associated with higher cognitive ability (''r''=.31) and less behavior problems during the KSADS interview (''r''=.43) or when watched by a different person while the caregiver was completing the KSADS (''r''=.31). Regression analyses indicated that factors could account for 22% of the credibility in youth report, with age being the strongest determinant. Controlling for youth age eliminated all other correlates except for caregiver credibility (''r&lt;sub&gt;part&lt;/sub&gt;''=.18), with age remaining a powerful predictor (''r&lt;sub&gt;part&lt;/sub&gt;''=.39). For the subset with cognitive ability and behavioral observations available, the regression explained a similar amount of variance, with age, cognitive ability, and observational ratings of behavior each making unique contributions, but caregiver credibility no longer significant.


'''Associations Between Credibility and Validity:''' Ratings of caregiver credibility were strongly related to the validity of caregiver report on mood and behavior checklists. Validity coefficients for caregiver reported manic symptoms changed from .28 for poor credibility to .49 for good credibility when comparing GBI to YMRS ratings, and .51 to .63 for GBI to CDRS ratings. Areas Under the Curve in ROC analyses changes from .61 (ns) to .80 (''p''&lt;.0005) for poor versus good credibility when comparing GBI scores to bipolar diagnoses. Caregiver-youth and caregiver teacher correlations all significantly increased when comparing good credibility to poor credibility caregivers, and this pattern was found across ratings of externalizing, internalizing, and attention problems as well as for manic and depressive symptoms (all ''p''&lt;.05) (cf. Achenbach, McConaughy, &amp; Howell, 1987). Similar patterns were observed with youth credibility. Interestingly, these patterns were not due to changes in the internal consistency of checklist scores: Cronbach’s alpha was often significant higher (''p''&lt;.05 based on Feldt’s test) for the low credibility informants (Feldt, 1969). This suggests that many of the “low credibility” informants may have been sticking with a response set, such as minimizing or exaggerating problems, rather than providing nuanced information. 


Hypothesis 6: Bipolar spectrum disorders will be associated with progressively greater functional impairment, increased service utilization, increased burden, and decreased quality of life over time.

The hypothesis that bipolar disorder is associated with greater burden and service utilization was partially supported. Bipolar disorder showed the greatest impact of any mental health condition on quality of life, matched only by unipolar depression, and exceeding almost all physical illnesses and disabilities for which benchmarking data are available (Freeman et al., 2009). Tables 19, 20, and 21 examine means by diagnostic subgroup. Table 22 presents impairment as a function of age cohort. Bipolar disorders were also associated with the highest levels of impairment on the Sheehan Disability Scales.

However, there were no significant differences by age group on the level of impairment. Future analyses will investigate more fine-grained dissection of impact on specific domains by particular versions of bipolar disorder or distinct symptom clusters.


''Secondary aims:''

'''Base rate for juvenile BPSD in a community mental health setting'''

A total of 620 families completed the KSADS evaluation at the community mental health center. The average youth met criteria for 3.7 Axis I diagnoses (median = 4, ''SD'' = 1.7). The most common category was externalizing disorders (67% of cases), with 65% meeting DSM-IV criteria for ADHD, 37% for ODD, and 13% for conduct disorder. Mood disorders were the second most common category, affecting 41% of youths, with anxiety disorders present in 26% of cases. Of the mood disorders, unipolar depression was the most common, affecting 11% of the sample, followed by minor depression (8%), bipolar NOS (5%), dysthymic disorder (4%), cyclothymic disorder (4%), bipolar I (3%), bipolar II (1%), and the remaining 5% consisting of a mixture of other mood issues not on the bipolar spectrum. Bipolar spectrum illnesses affected 13% of the sample (''n''=79).

The bipolar NOS cases (''n''=29) were primarily considered NOS due to inadequate duration of hypomanic episodes (83%), versus having inadequate severity for mania (43%) or insufficient numbers of symptoms at threshold (30%). The majority of these NOS cases (''n''=18, 62%) would have met criteria for bipolar II disorder if the duration threshold for the hypomania were lowered to 2 days, as is currently being discussed in DSM-5 and was recommended in the ISBD Diagnostic Workgroup Papers (Ghaemi et al., 2008; Youngstrom, Birmaher, &amp; Findling, 2008). The NOS label, as applied in this study, did not include chronically irritable youths without evidence of episodes or changes in mood or energy: 92% of NOS cases showed clear evidence of a cyclical mood course, with at least spontaneous shifts in mood and energy. 

Among the bipolar spectrum cases, 78% showed evidence of episodic elated mood, 69% of episodic irritable mood, and 44% showed grandiosity. This pattern was consistent across all four bipolar spectrum subgroups. There were no sex differences in rates of each type of bipolar, nor were their race/ethnicity differences in rates. There were trends for bipolar I and II to be more common in the older youths, and for cyclothymic disorder or bipolar NOS to be more common in the younger youths, but none of these trends achieved statistical significance. All of these patterns appear consistent with general trends emerging in the literature (Goodwin &amp; Jamison, 2007; Kowatch, Youngstrom, Danielyan, &amp; Findling, 2005).


'''Diagnostic Agreement'''

Goal: To examine the diagnostic agreement between diagnoses achieved via widely used methods: diagnosis as usual (DAU, reflecting the clinical standard of care), the KSADS-PL (the most widely used research instrument in projects evaluating mood disorder), and a Longitudinal Expert evaluation of All available Data (LEAD; reflecting the consensus diagnosis of clinical experts and raters after reviewing all available information).

There were three different sets of diagnoses available for the cases interviewed at the CMHC: Intake diagnoses, KSADS diagnoses, and LEAD diagnoses. Intake diagnoses were “diagnosis as usual,” conducted following the normal procedures for the agency. More than 80% of the intakes were conducted by a masters level licensed clinical counselor or social worker with more than 10 years of experience, and almost all of the remainder were conducted by predoctoral psychology interns. The DAU intake interview consisted of an appointment of 90 minutes, of which roughly 30 minutes was spent completing consent forms and billing or insurance paperwork, and the remainder of which comprised an unstructured clinical interview assessing the presenting problem, prior developmental and treatment history, risk factors, strengths, and generating a five axis diagnostic formulation and initial treatment recommendations.

The KSADS diagnoses were conducted by highly trained raters, either key personnel or predoctoral psychology interns electing to participate in the training as a formal year-long rotation offered during the internship year. Training focused heavily on the conceptualization of bipolar disorder (including 12 hours of didactic training based on the same content as the 7 hour continuing education offering presented by E. Youngstrom at the American Psychological Association, National Association of School Psychologists, Canadian Psychological Association, and Association for Behavioral and Cognitive Therapy conventions, but with expanded time for question and answer). The training emphasized use of DSM-IV diagnostic criteria, including the consideration of cyclothymic disorder and bipolar Not Otherwise Specified as well as bipolar II and bipolar I. Trainees learned about the “narrow phenotype” definition in 2003 with the publication of the Leibenluft et al. nosology (Leibenluft, et al., 2003), along with the varying definitions of the “broad phenotype” and “severe mood dysregulation.” However, the diagnostic definitions remained the same for the entire course of the grant, focusing on strict DSM criteria. Drift was avoided by using training videos from the early years of the grant as part of the training and certification process for subsequent years of the grant, as well as having the same two lead diagnosticians (EAY and JKY) leading the training for all years of the grant. Also important to note, the conceptualization of bipolar disorder always included the requirement that mood be episodic, involving a clear change from prior functioning. If the same symptom, such as poor concentration or motor agitation, followed a chronic course, then it was coded in a different section of the KSADS and not counted as well in the corresponding mood section. This is a neo-Kraepelinian formulation of bipolar disorder, emphasizing an episodic presentation. It is different from other formulations that allow a more insidious onset and chronic course. It also was expected that the emphasis on “finding each symptom the best home” in the KSADS would reduce the observed rates of comorbidity between bipolar and anxiety disorders or ADHD compared to rates found when using the KSADS without the same emphasis on episodicity.

All raters completed the same training process, which required rating along with at least five interviews (watched live or from videorecording) conducted by a reliable rater, scoring along, and achieving an item-level kappa of .85 or greater. Once the trainee demonstrated the ability to match reliable ratings on five interviews, then the trainee led an interview with a reliable rater scoring along in real time. This next stage was crucial because of the semi-structured nature of the KSADS, which gives the interviewer flexibility to rephrase questions and involves a fair degree of clinical judgment in deciding when sufficient information has been elicited to score the symptom or module. Kappa evaluated agreement at the item level, and all scoring discrepancies were discussed. The reliable rater’s scores were the source document for the main dataset. Once the trainee led five interviews where their scores and the reliable rater’s scores converged kappa &gt;= .85, then the trainee “graduated” to lead interviews independently. This training process was extremely time intensive, taking nine months to complete the training of the first cadre of raters, and never taking less than four months to complete the training. Once raters were reliable, they co-rated a live interview or re-rated from a videotape on a quarterly basis to avoid drift.

More than thirty interns completed the training process, and only one withdrew from the rotation. Interns typically became reliable in 12 interviews (6+6). Feedback from the interns was consistently positive, with comments indicating that they found the training in diagnostic evaluation and conceptualization to be the most rigorous yet clinically useful that they had received in their training sequence. The CMHC also viewed the training as a valuable benefit of the collaboration between the agency and the university: The grant created a new training rotation for the internship which almost all subsequent interns selected, and it created new training materials and experiences that have continued to benefit the agency.

KSADS scoring involved the same person interviewing both the caregiver and the youth. If there were significant discrepancies between the item scores based on the separate interviews, the rater used clinical judgment to resolve the discrepancy. They also were encouraged to re-interview either informant, or to discuss discrepancies with both simultaneously. After generating the summary scores for all symptoms and impairment criteria, DSM-IV algorithms were applied to arrive at the KSADS diagnoses. If the rater’s clinical impression was different than the diagnosis established by the algorithm, they wrote down their impression in addition to keeping the diagnosis from the KSADS, and both pieces of information were brought to the consensus conference.  The reliable rater recorded the KSADS diagnoses at the end of each interview, while still blind to other information such as the family mental health history, prior treatment history from the medical record, and all scores on the rating scales.

The LEAD consensus meeting process used a team format. The reliable rater met with a licensed clinical psychologist (JKY, EAY, OIM, or NCF), along with a second person who had gathered the family history (either a research assistant or one of the predoctoral interns completing a fully-structured interview including the MINI and the Family History RDC), and photocopied the relevant prior diagnostic and treatment history from the medical record. The rating scales stayed recused from the diagnostic process, to ensure that the criterion diagnoses were “blind” to the instruments that would be evaluated as diagnostic predictors (Bossuyt et al., 2003). Final diagnoses were based on the KSADS, but could be modified on the basis of the interviewer’s clinical impressions, or additional information about family history or treatment history. The situations where a modification was most likely to occur involved diagnoses that are not formally assessed on the KSADS, such as pervasive developmental disorders (although most cases with clear pervasive developmental disorders were referred to other agencies prior to intake and so were unlikely to participate in the project).

These three forms of diagnosis represent markedly different processes, ranging from a routine unstructured interview billable under CPT code 90801, to a semi-structured KSADS that required most of a day for the rater and family (and involving a minimum of 16-20 days of training and supervision spread over a period of months), to a consensus diagnosis that included all of the time, training and expense of the KSADs, along with an added person’s time gathering the family history and chart, and a licensed psychologist to spend an hour to review and synthesize the information.

A recently published meta-analysis compared the agreement between unstructured clinical diagnoses and semi-structured or structured diagnostic interview results (Rettew, Lynch, Achenbach, Dumenci, &amp; Ivanova, 2009). Typical agreement in the meta-analysis was kappa = .29 for externalizing disorders, .28 for internalizing disorders, but only .14 for affective disorders specifically (including bipolar disorder). Compared to these benchmarks, DAU fared slightly better than expected in terms of agreement with the KSADS or LEAD diagnoses for ADHD (kappa = .43 with LEAD, ''p'' &lt; .00005) or disruptive behavior disorders (kappa = .35, ''p'' &lt; .00005). However, DAU fared poorly with bipolar disorder: Kappa = .02, ''p'' &lt; .01. Contrary to the popular concern about overdiagnosis of bipolar disorder, DAU was extremely conservative, only identifying bipolar in one case. This resulted in a diagnostic specificity of 100%, but a sensitivity of only 1%. Discussion with the clinicians clarified that they often had concerns about mood issues with a youth, but were highly reluctant to label a case as “bipolar” on the basis of a standard unstructured diagnostic interview. Instead, they were likely to diagnose “mood disorder Not Otherwise Specified,” and then often refer for psychiatric evaluation. When comparing this broader definition, combining bipolar disorder with mood NOS to form a “possible bipolar” group, then kappa with the LEAD bipolar spectrum diagnosis rose to .32, but with sensitivity only rising to 33% (indicating that the majority of bipolar cases remained undetected). Specificity appeared to stay high at 91%, but due to the low base rate of bipolar disorder at the CMHC, that still meant that the majority of cases (52%) identified as “possible bipolar” would actually be false positives. 

'''Secondary Aim: To promote the translation of assessment procedures from research tools to clinically useful instruments that are realistic to use in community mental health settings.'''

Agreement between research diagnoses and clinical diagnosis was better than chance, but low, consistent with meta-analytic findings. DAU demonstrated extremely poor sensitivity to bipolar disorder, combined with a high false positive rate. On the basis of these findings, along with the promising results from the development of the screening instruments, the agency actually modified its intake procedure in several ways. The PGBI-10M became a standard part of the intake paperwork, and high scores on it, or else a clinical impression that suggests possible bipolar disorder, trigger a referral to a new diagnostic evaluation clinic where a specialist conducts a KSADS interview and gathers developmental and family history. Because the screening and clinical intake are sufficient to demonstrate medical necessity, the KSADS interview becomes a reimbursable service for Medicaid and other third party payors, billable under CPT Code 90801. This has navigated the transition from a grant sponsored activity to a self-sustaining clinical service that improves the diagnostic accuracy for the agency. 


'''Other Factors Potentially Changing Performance of Diagnostic Instruments'''

As described above, there were cohort effects where depression severity tended to increase with age, versus mania severity tending to stay consistent or perhaps decrease slightly in adolescence. Investigation of differential item functioning in the manic symptoms indicated that some symptoms tend to increase in adolescence even after controlling for levels of underlying mania, and other symptoms decrease with age – with the net effect often cancelling out within the same scale.

Similar analyses revealed no differences in total scores for mania comparing males versus females or White versus Black youths. DIF analyses at the item level revealed few examples of uniform or non-uniform bias in manic symptoms comparing across gender or ethnicity.

Initial investigation of the role of parent mental health history suggests that the caregiver’s own history of mood disorder does not significantly change the validity of their report of the child’s functioning. The adult’s current mood status showed weak (''r''&lt;.2) correlations with discrepancies between their perception and the youth’s own perception, consistent with prior investigations (Youngstrom, Ackerman, &amp; Izard, 1999; Youngstrom, et al., 2000). Although more detailed analyses are needed to describe potential moderators of accuracy, the overarching pattern is that caregiver report is significantly more valid than youth or teacher report of manic symptoms, and this advantage persists even when the caregivers have a history of mood disorder themselves.


'''Demographics and Participants'''

The proposed research involves coordinated data collection at two sites: the research clinic at Case Western Reserve University/University Hospitals of Cleveland (CWRU/UHC), and the Cuyahoga County offices of Applewood Centers, Inc. (ACI). The integration of these two sites into one project creates a unique opportunity to translate clinical research into a more representative and applied setting. These two sites are complementary in crucial ways. CWRU/UHC has a referral system that is heavily enriched for BPSD (49% of 749 pilot cases meeting criteria for BPSD, and 18% for bipolar I), making it possible to   investigate a relatively infrequent disorder with smaller samples. Recruitment is enhanced by having a Stanley Foundation CCRC, having an adult Stanley-funded mood clinic (which refers children of identified bipolar parents for evaluation), having a variety of clinical trials available to provide free treatment to youths with bipolar disorder, having a national reputation for research in bipolar disorders, and having an extensive referral network throughout the region. The CWRU/UHC catchment area for mood disorders extends from Erie, PA to Toledo, OH, with many families driving three to four hours for treatment. However, ACI is a community mental health center (CMHC) that is both demographically more diverse and more representative of an urban community: 75% of the clients served by ACI are of diverse backgrounds, and 90% of families receive Medicaid. CWRU/UHC has the research infrastructure to complete detailed evaluations, and we propose adding a longitudinal component to this evaluation. ACI serves a dramatically larger volume of patients, with one county’s offices processing 10 to 20 times as many cases as CWRU/UHC per year. The research plan uses CWRU/UHC as a laboratory to develop and test measurement strategies, and ACI as the “field testing” to determine what is practical in real life community settings. The proposed design delivers on the promise of cross-validating measures in independent samples. This research will produce tools that will replicate better across research groups, as well as generalize to applied settings.

= Inclusion Enrollment Report Table =
{| class=&quot;wikitable&quot;
| colspan=&quot;7&quot; |'''Study Title: ''' Improving the Assessment of Juvenile  BPSD-Community Sample (ACI)
|-
| colspan=&quot;2&quot; |'''Total Enrollment:''' 827
| colspan=&quot;5&quot; |
|-
| colspan=&quot;2&quot; |Grant Number: 5 R01 MH066647
| colspan=&quot;5&quot; |
|-
| colspan=&quot;7&quot; | '''PART  A. TOTAL ENROLLMENT REPORT: Number of Subjects Enrolled to Date (Cumulative)'''  by Ethnicity and Race
|-
| rowspan=&quot;2&quot; |Ethnic  Category
| colspan=&quot;6&quot; |'''Sex/Gender'''
|-
| colspan=&quot;2&quot; |'''Females'''
|'''Males'''
|'''Unknown  or Not Reported'''
| colspan=&quot;2&quot; |'''Total'''
|-
|Hispanic or Latino
| colspan=&quot;2&quot; |8
|12
|0
|20
|
|-
|Not Hispanic or  Latino
| colspan=&quot;2&quot; |324
|483
|0
|807
|
|-
|Unknown  (Individuals not reporting ethnicity)
| colspan=&quot;2&quot; |0
|0
|0
|0
|
|-
|Ethnic  Category: Total of All Subjects*
| colspan=&quot;2&quot; |332
|495
|0
|827
|
|-
|Racial Categories
| colspan=&quot;2&quot; |
| colspan=&quot;4&quot; |
|-
|American  Indian/Alaska Native
| colspan=&quot;2&quot; |0
|0
|0
|0
|
|-
|Asian
| colspan=&quot;2&quot; |2
|0
|0
|2
|
|-
|Native Hawaiian or  Other Pacific Islander
| colspan=&quot;2&quot; |0
|0
|0
|0
|
|-
|Black or African  American
| colspan=&quot;2&quot; |236
|339
|0
|575
|
|-
|White
| colspan=&quot;2&quot; |69
|116
|0
|185
|
|-
|More than  one race
| colspan=&quot;2&quot; |17
|28
|0
|45
|
|-
|Unknown or not  reported
| colspan=&quot;2&quot; |8
|12
|0
|20
|
|-
|'''Racial  Categories:  Total of All Subjects*'''
| colspan=&quot;2&quot; |332
|495
|0
|827
|
|-
|
|
|
|
|
|
|
|} 
{| class=&quot;wikitable&quot;
| colspan=&quot;6&quot; |
|-
| colspan=&quot;6&quot; |PART  B. HISPANIC ENROLLMENT REPORT:  Number  of Hispanics or Latinos Enrolled to Date (Cumulative)
|-
|'''Racial  Categories'''
|'''Females'''
|'''Males'''
|'''Unknown or Not Reported'''
| colspan=&quot;2&quot; |Total
|-
|American Indian or  Alaska  Native
|0
|0
|0
|0
|
|-
|Asian
|0
|0
|0
|0
|
|-
|Native Hawaiian or  Other Pacific Islander
|0
|0
|0
|0
|
|-
|Black or African  American
|0
|0
|0
|0
|
|-
|White
|
|
|
|
|
|-
|More Than One Race
|0
|0
|0
|0
|
|-
|Unknown or not  reported
|8
|12
|0
|20
|
|-
|'''Racial  Categories:  Total of Hispanics or  Latinos**'''
|8
|12
|0
|20
|
|-
|*  These totals  must agree.

&lt;nowiki&gt;**&lt;/nowiki&gt; These totals must agree.
|
| colspan=&quot;4&quot; | 
|}  

'''References'''

Achenbach, T. M., McConaughy, S. H., &amp; Howell, C. T. (1987). Child/Adolescent behavioral and emotional problems: Implication of cross-informant correlations for situational specificity. ''Psychological Bulletin, 101'', 213-232.

Achenbach, T. M., &amp; Rescorla, L. A. (2001). ''Manual for the ASEBA School-Age Forms &amp; Profiles''. Burlington, VT: University of Vermont.

Birmaher, B., Axelson, D., Goldstein, B., Strober, M., Gill, M. K., Hunt, J., et al. (2009). Four-Year Longitudinal Course of Children and Adolescents With Bipolar Spectrum Disorders: The Course and Outcome of Bipolar Youth (COBY) Study. ''American Journal of Psychiatry'', appi.ajp.2009.08101569.

Blader, J. C., &amp; Carlson, G. A. (2007). Increased rates of bipolar disorder diagnoses among U.S. child, adolescent, and adult inpatients, 1996-2004. ''Biological Psychiatry, 62''(2), 107-114.

Bossuyt, P. M., Reitsma, J. B., Bruns, D. E., Gatsonis, C. A., Glasziou, P. P., Irwig, L. M., et al. (2003). Towards complete and accurate reporting of studies of diagnostic accuracy: the STARD initiative. ''British Medical Journal, 326''(7379), 41-44.

Cohen, P., Cohen, J., Aiken, L. S., &amp; West, S. G. (1999). The problem of units and the circumstances for POMP. ''Multivariate Behavioral Research, 34'', 315-346.

Cyranowski, J. M., Frank, E., Young, E., &amp; Shear, K. (2000). Adolescent onset of the gender difference in lifetime rates of major depression. ''Archives of General Psychiatry, 57''(1), 21-27.

Dell'Osso, L., Pini, S., Cassano, G. B., Mastrocinque, C., Seckinger, R. A., Saettoni, M., et al. (2002). Insight into illness in patients with mania, mixed mania, bipolar depression and major depression with psychotic features. ''Bipolar Disorders, 4'', 315-322.

Feldt, L. S. (1969). A test of the hypothesis that Cronbach's alpha or Kuder-Richardson coefficient twenty is the same for two tests. ''Psychometrika, 34''(3), 363-373.

Freeman, A. J., Youngstrom, E. A., Michalak, E., Siegel, R., Meyers, O. I., &amp; Findling, R. L. (2009). Quality of life in pediatric bipolar disorder. ''Pediatrics, 123''(3), e446-452.

Geller, B., Tillman, R., Bolhofner, K., &amp; Zimerman, B. (2008). Child bipolar I disorder: prospective continuity with adult bipolar I disorder; characteristics of second and third episodes; predictors of 8-year outcome. ''Archives of general psychiatry, 65''(10), 1125-1133.

Geller, B., Warner, K., Williams, M., &amp; Zimerman, B. (1998). Prepubertal and young adolescent bipolarity versus ADHD: Assessment and validity using the WASH-U-KSADS, CBCL and TRF. ''Journal of Affective Disorders, 51''(2), 93-100.

Geller, B., Zimerman, B., Williams, M., Bolhofner, K., Craney, J. L., DelBello, M. P., et al. (2001). Reliability of the Washington University in St. Louis Kiddie Schedule for Affective Disorders and Schizophrenia (WASH-U-KSADS) mania and rapid cycling sections. ''Journal of the American Academy of Child &amp; Adolescent Psychiatry, 40''(4), 450-455.

Ghaemi, S. N., Bauer, M., Cassidy, F., Malhi, G. S., Mitchell, P., Phelps, J., et al. (2008). Diagnostic guidelines for bipolar disorder: a summary of the International Society for Bipolar Disorders Diagnostic Guidelines Task Force Report. ''Bipolar disorders, 10''(1 Pt 2), 117-128.

Glutting, J., &amp; Oakland, T. (1993). ''Guide to the Assessment of Test Session Behavior for the WISC-III and WIAT''. San Antonio: The Psychological Corporation.

Goodwin, F. K., &amp; Jamison, K. R. (2007). ''Manic-depressive illness'' (2nd ed.). New York: Oxford University Press.

Hazell, P. L., Lewin, T. J., &amp; Carr, V. J. (1999). Confirmation that Child Behavior Checklist clinical scales discriminate juvenile mania from attention deficit hyperactivity disorder. ''Journal of Paediatrics and Child Health, 35''(Apr), 199-203.

Healy, D. (2006). The latest mania: selling bipolar disorder. ''PLoS Medicine, 3''(4), e185.

Henry, D. B., Pavuluri, M. N., Youngstrom, E., &amp; Birmaher, B. (2008). Accuracy of brief and full forms of the Child Mania Rating Scale. ''Journal of Clinical Psychology, 64''(4), 368-381.

Hirschfeld, R. M., Williams, J. B. W., Spitzer, R. L., Calabrese, J. R., Flynn, L., Keck, P. E. J., et al. (2000). Development and validation of a screening instrument for bipolar spectrum disorder: The mood disorder questionnaire. ''The American Journal of Psychiatry, 157''(11), 1873-1875.

Kaufman, J., Birmaher, B., Brent, D., Rao, U., Flynn, C., Moreci, P., et al. (1997). Schedule for Affective Disorders and Schizophrenia for School-Age Children-Present and Lifetime version (K-SADS-PL): Initial reliability and validity data. ''Journal of the American Academy of Child &amp; Adolescent Psychiatry, 36''(7), 980-988.

Keenan, K., &amp; Wakschlag, L. S. (2002). Can a valid diagnosis of disruptive behavior disorder be made in preschool children? ''The American Journal of Psychiatry, 159''(3), 351-358.

Kluger, J., &amp; Song, S. (2002). Young and bipolar. ''Time''(August 19), 39-47, 51.

Kovacs, M. (1989). Affective disorders in children and adolescents. Special Issue: Children and their development: Knowledge base, research agenda, and social policy application. ''American Psychologist, 44''(2), 209-215.

Kowatch, R. A., Youngstrom, E. A., Danielyan, A., &amp; Findling, R. L. (2005). Review and meta-analysis of the phenomenology and clinical characteristics of mania in children and adolescents. ''Bipolar Disorders, 7''(6), 483-496.

Kraemer, H. C. (1992). ''Evaluating medical tests: Objective and quantitative guidelines''. Newbury Park, CA: Sage Publications.

Kraepelin, E. (1921). ''Manic-depressive insanity and paranoia''. Edinburgh: Livingstone.

Krueger, R. F., Markon, K. E., Patrick, C. J., &amp; Iacono, W. G. (2005). Externalizing psychopathology in adulthood: a dimensional-spectrum conceptualization and its implications for DSM-V. ''Journal of abnormal psychology, 114''(4), 537-550.

Leibenluft, E., Charney, D. S., Towbin, K. E., Bhangoo, R. K., &amp; Pine, D. S. (2003). Defining clinical phenotypes of juvenile mania. ''The American Journal of Psychiatry, 160'', 430-437.

Mick, E., Biederman, J., Pandina, G., &amp; Faraone, S. V. (2003). A preliminary meta-analysis of the child behavior checklist in pediatric bipolar disorder. ''Biological Psychiatry, 53''(11), 1021-1027.

Moreno, C., Laje, G., Blanco, C., Jiang, H., Schmidt, A. B., &amp; Olfson, M. (2007). National Trends in the Outpatient Diagnosis and Treatment of Bipolar Disorder in Youth. ''Archives of General Psychiatry, 64''(9), 1032-1039.

Nottelmann, E., Biederman, J., Birmaher, B., Carlson, G. A., Chang, K. D., Fenton, W. S., et al. (2001). National Institute of Mental Health research roundtable on prepubertal bipolar disorder. ''Journal of the American Academy of Child &amp; Adolescent Psychiatry, 40''(8), 871-878.

Pavuluri, M. N., Henry, D. B., Devineni, B., Carbray, J. A., &amp; Birmaher, B. (2006). Child mania rating scale: Development, reliability, and validity. ''Journal of the American Academy of Child and Adolescent Psychiatry, 45''(5), 550-560.

Prisciandaro, J. J., &amp; Roberts, J. E. (2010). Evidence for the continuous latent structure of mania in the Epidemiologic Catchment Area from multiple latent structure and construct validation methodologies. ''Psychol Med'', 1-14.

Rettew, D. C., Lynch, A. D., Achenbach, T. M., Dumenci, L., &amp; Ivanova, M. Y. (2009). Meta-analyses of agreement between diagnoses made from clinical evaluations and standardized diagnostic interviews. ''Int J Methods Psychiatr Res, 18''(3), 169-184.

Shaffer, D., Gould, M. S., Brasic, J., Ambrosini, P., Fisher, P., Bird, H., et al. (1983). A children's global assessment scale (CGAS). ''Archives of General Psychiatry, 40''(11), 1228-1231.

Spitzer, R. L. (1983). Psychiatric diagnosis: Are clinicians still necessary? ''Comprehensive Psychiatry, 24''(5), 399-411.

Wagner, K. D., Findling, R. L., Emslie, G. J., Gracious, B., &amp; Reed, M. (2006). Validation of the Mood Disorder Questionnaire for Bipolar Disorders in Adolescents. ''Journal of Clinical Psychiatry, 67'', 827-830.

WTCCC. (2007). Genome-wide association study of 14,000 cases of seven common diseases and 3,000 shared controls. ''Nature, 447''(7145), 661-678.

Youngstrom, E. A., Ackerman, B. P., &amp; Izard, C. E. (1999). Dysphoria-related bias in maternal ratings of children. ''Journal of Consulting and Clinical Psychology, 67'', 905-916.

Youngstrom, E. A., Birmaher, B., &amp; Findling, R. L. (2008). Pediatric bipolar disorder: Validity, phenomenology, and recommendations for diagnosis ''Bipolar Disorders, 10''(Supplement 1), 194-214.

Youngstrom, E. A., Findling, R. L., Calabrese, J. R., Gracious, B. L., Demeter, C., DelPorto Bedoya, D., et al. (2004). Comparing the diagnostic accuracy of six potential screening instruments for bipolar disorder in youths aged 5 to 17 years. ''Journal of the American Academy of Child &amp; Adolescent Psychiatry, 43'', 847-858.

Youngstrom, E. A., Frazier, T. W., Demeter, C., Calabrese, J. R., &amp; Findling, R. L. (2008). Developing a 10-item mania scale from the Parent General Behavior Inventory for children and adolescents. ''Journal of Clinical Psychiatry, 69''(5), 831-839.

Youngstrom, E. A., Joseph, M. F., &amp; Greene, J. (2008). Comparing the psychometric properties of multiple teacher report instruments as predictors of bipolar disorder in children and adolescents. ''J Clin Psychol, 64''(4), 382-401.

Youngstrom, E. A., Joseph, M. F., &amp; Greene, J. (2008). Comparing the psychometric properties of multiple teacher report instruments as predictors of bipolar disorder in children and adolescents. ''Journal of Clinical Psychology, 64''(4), 382-401.

Youngstrom, E. A., Loeber, R., &amp; Stouthamer-Loeber, M. (2000). Patterns and correlates of agreement between parent, teacher, and male adolescent ratings of externalizing and internalizing problems. ''Journal of Consulting and Clinical Psychology, 68'', 1038-1050.

Youngstrom, E. A., Meyers, O. I., Demeter, C., Kogos Youngstrom, J., Morello, L., Piiparinen, R., et al. (2005). Comparing diagnostic checklists for pediatric bipolar disorder in academic and community mental health settings. ''Bipolar Disorders, 7''(Special Issue: Pediatric Bipolar Disorder), 507-517.

Youngstrom, E. A., Meyers, O. I., Youngstrom, J. K., Calabrese, J. R., &amp; Findling, R. L. (2006). Comparing the effects of sampling designs on the diagnostic accuracy of eight promising screening algorithms for pediatric bipolar disorder. ''Biological Psychiatry, 60'', 1013-1019.


''Table 1.'' Diagnostic efficiency of caregiver, youth, and teacher report of manic symptoms (Aim 1, Hypothesis 1)
{| class=&quot;wikitable&quot;
|
|
| colspan=&quot;3&quot; |'''Sensitivity = .90&lt;sup&gt;a&lt;/sup&gt;'''
| colspan=&quot;3&quot; |'''Specificity = .90&lt;sup&gt;b&lt;/sup&gt;'''
|
|-
|'''Measure'''
|'''AUROC'''
|'''Score'''
|'''Specificity'''
|'''Kappa'''
|'''Score'''
|'''Sensitivity'''
|'''Kappa'''
|'''Base Rate'''
|-
|P-GBI  Hypo/Biphasic Likert Total
|.77***
|15
|.477
|.206
|39
|.292
|.212
|.18
|-
|Brief P-GBI  Hypo/Biphasic Likert Total
|.79***
|6
|.563
|.256
|16
|.350
|.280
|.18
|-
|Parent about  KID - MDQ Total
|.82***
|4.5
|.553
|.265
|9
|.493
|.360
|.18
|-
|Parent YMRS  Total Score
|.67***
|4
|.217
|.057
|18
|.264
|.198
|.18
|-
|CMRS Total by  Parents
|.76***
|10.5
|.475
|.210
|27
|.313
|.235
|.18
|-
|CBCL Bipolar  Profile Average (3 scales)
|.67***
|62
|.340
|.116
|80
|.173
|.093
|.18
|-
|A-GBI  Hypo/Biphasic Likert Total
|.59**
|8.5
|.179
|.036
|45.5
|.176
|.092
|.20
|-
|Adolescent- MDQ Total
|.60***
|2
|.140
|.028
|9
|.132
|.070
|.20
|-
|Adolescent YMRS  Total Score
|.56
|3.5
|.115
|.002
|19.5
|.099
|.010
|.20
|-
|YSR Bipolar  Profile Average (3 scales)
|.60***
|51
|.158
|.027
|70
|.190
|.106
|.19
|-
|T-GBI  Hypo/Biphasic Likert Total
|.55
|28.5
|.085
|.000
|60
|.114
|.027
|.21
|-
|Teacher YMRS  Total Score
|.48
|1.5
|.160
|.008
|16.5
|.057
|&lt;nowiki&gt;-.035&lt;/nowiki&gt;
|.21
|-
|TRF Bipolar  Profile Average (3 scales)
|.56
|55
|.185
|.047
|73
|.108
|.008
|.22
|}
''&lt;sup&gt;a&lt;/sup&gt;'' Sensitivity = .90: the first column provides the score threshold that yields a 90% sensitivity (i.e., percentage of true BPSD cases meeting or exceeding that threshold), and the second column provides the corresponding specificity (i.e., the percentage of cases without BPSD scoring below the threshold).

''&lt;sup&gt;b&lt;/sup&gt;'' Specificity = .90: the first column provides the score threshold that yields a 90% specificity, and the second column provides the corresponding sensitivity for the same threshold.

''* p&lt;'' .05, ** ''p&lt;''.01, ***''p&lt;''.005 two-tailed.


Table 2.  ''Percentage of Maximum Possible (POMP) Scores on caregiver report of manic symptoms compared across diagnostic subgroups (N=790)(Aim 1, Hypothesis 1)''
{| class=&quot;wikitable&quot;
|Variable Scales
|'''Bipolar I'''

''n'' = 28 (3%)
|'''Cyclothymes, BP II, BP NOS'''

''n'' = 116 (15%)
|'''Unipolar Mood D/O'''

''n'' = 221 (28%)
|'''Disruptive Beh D/Os'''

''n'' = 353 (45%)
|'''Residual Diagnoses'''

''n'' = 72 (9%)
|'''''F''  Statistic'''
|-
|P-GBI Depression Likert Total 
|34.2 ± 18.4 &lt;sup&gt;c d&lt;/sup&gt;
|29.6 ± 16.5 &lt;sup&gt; c d&lt;/sup&gt;
|27.1 ± 16.6 
|12.2 ± 13.1
|12.2 ± 13.1
|66.29***
|-
|P-GBI Hypo/Biphasic Likert Total
|46.5 ± 21.9 &lt;sup&gt;a&lt;/sup&gt;
|36.9 ± 16.3 &lt;sup&gt;a&lt;/sup&gt;
|25.7 ± 16.6
|21.1 ± 15.4
|13.2 ± 12.8
|43.94***
|-
|Brief P-GBI Hypo/Biphasic Likert Total
|54.7 ± 26.4 &lt;sup&gt;a&lt;/sup&gt;
|43.4 ± 20.2 &lt;sup&gt;a&lt;/sup&gt;
|28.3 ± 21.2
|21.3 ± 19.1
|12.5 ± 14.5
|50.67***
|-
|Parent about KID - MDQ Total
|67.8 ± 20.5 &lt;sup&gt; a&lt;/sup&gt;
|60.7 ± 18.4 &lt;sup&gt; a&lt;/sup&gt;
|33.6 ± 23.1
|35.2 ± 24.5
|22.4 ± 21.3
|51.71***
|-
|Parent YMRS Total Score
|46.6 ± 30 &lt;sup&gt; a&lt;/sup&gt;
|36.8 ± 20.9 &lt;sup&gt; a&lt;/sup&gt;
|28.1 ± 19.1
|26.2 ± 18.7
|17.5 ± 13.9
|18.64***
|-
|CMRS Total by Parents (''M±SD)''
|44.4 ± 24.3 &lt;sup&gt;d&lt;/sup&gt;
|42.3 ± 18.9 &lt;sup&gt;a&lt;/sup&gt;
|26.2 ± 17.7 
|26.1 ± 17.4
|11.3 ± 11
|28.75***
|}


''Note :'' &lt;sup&gt;a&lt;/sup&gt; Bipolar groups significantly different than All remaining groups; &lt;sup&gt;b&lt;/sup&gt; Bipolar groups significantly different than Unipolar Mood; &lt;sup&gt;c&lt;/sup&gt; Bipolar groups significantly different than Disruptive Beh; &lt;sup&gt;d&lt;/sup&gt; Bipolar groups significantly different than Residual Diagnoses; &lt;sup&gt; &lt;/sup&gt; ''* p&lt;'' .05, ** ''p&lt;''.01, ***''p&lt;''.005 two-tailed.

Note that the CMRS was added after its publication several years after the start of the grant. Subgroup sizes for the CMRS were n=16, 89, 157, 235, and 42, respectively.

Table 3 ''CBCL T Scores compared across diagnostic subgroups (N=750) (Aim 1, Hypothesis 1)''
{| class=&quot;wikitable&quot;
|''T''-Scores ''(M±SD)''
|'''Bipolar I'''

''n'' = 27 (4%)
|'''Cyclothymes, BP II, BP NOS'''

''n'' = 106 (14%)
|'''Unipolar Mood D/O'''

''n'' = 210 (28%)
|'''Disruptive Beh D/Os'''

''n'' = 338 (45%)
|'''Residual Diagnoses'''

''n'' = 69 (9%)
|'''''F''  Statistic'''
|-
|Anxious/Depressed
|66 ± 10.4 &lt;sup&gt; d&lt;/sup&gt;
|65.6 ± 9.9 &lt;sup&gt; c d&lt;/sup&gt; 
|65.1 ± 10 &lt;sup&gt; &lt;/sup&gt;
|60 ± 8.8
|58.3 ± 8.6
|17.05***
|-
|Withdrawn
|67 ± 11 
|67.7 ± 10.7 &lt;sup&gt;c d&lt;/sup&gt;
|70.1 ± 11.7
|62.4 ± 9.2
|61.5 ± 8.9
|22.40***
|-
|Somatic
|65 ± 10.9 &lt;sup&gt;c d&lt;/sup&gt;
|62.9 ± 9.8 &lt;sup&gt;c d&lt;/sup&gt;
|61.7 ± 9.1
|57.9 ± 7.8
|57.9 ± 7.9
|13.00***
|-
|Social Problems
|68.3 ± 10.1 &lt;sup&gt; d&lt;/sup&gt;
|67.7 ± 9.7 &lt;sup&gt; c d&lt;/sup&gt;
|65.5 ± 10.9 &lt;sup&gt; &lt;/sup&gt;
|64.6 ± 9.20
|59.7 ± 8.1
|7.71***
|-
|Thought Problems
|69 ± 8.2 &lt;sup&gt;d&lt;/sup&gt;
|68.4 ± 9.6 &lt;sup&gt;c d&lt;/sup&gt;
|65.5 ± 9.7
|64.5 ± 9.7
|60.8 ± 9.2
|7.46***
|-
|Attention
|72.8 ± 9.7 &lt;sup&gt; d&lt;/sup&gt;
|72.9 ± 11.9 &lt;sup&gt; b d&lt;/sup&gt;
|68.3 ± 12.2
|69.9 ± 10.6
|61.2 ± 10.6
|12.77***
|-
|Rule Breaking
|71.2 ± 7.7 &lt;sup&gt;b d&lt;/sup&gt;
|69.4 ± 8.4 &lt;sup&gt;b d&lt;/sup&gt;
|66 ± 8.4
|67.9 ± 8
|60.7 ± 7.6
|15.19***
|-
|Aggressive 
|78.8 ± 11.3 &lt;sup&gt;b d&lt;/sup&gt;
|78 ± 10.7 &lt;sup&gt;a&lt;/sup&gt;
|70.5 ± 12.3 
|73.4 ± 11.5
|60.8 ± 10.2
|27.92***
|-
|Internalizing
|68.1 ± 9.2 &lt;sup&gt; c d&lt;/sup&gt;
|67.2 ± 9.3 &lt;sup&gt; c d&lt;/sup&gt;
|67.2 ± 9 &lt;sup&gt; &lt;/sup&gt;
|60.4 ± 10.1
|58.9 ± 10.3
|25.44***
|-
|Externalizing
|74.8 ± 7.5 &lt;sup&gt; b d&lt;/sup&gt;
|73.5 ± 7.5 &lt;sup&gt; a&lt;/sup&gt;
|68.2 ± 9.9
|70.9 ± 8.3
|59.1 ± 11.6
|33.54***
|-
|Total Problems
|73.8 ± 6.5 &lt;sup&gt; a&lt;/sup&gt;
|72.6 ± 6.5 &lt;sup&gt; a&lt;/sup&gt;
|68.9 ± 9.1
|68.6 ± 7.9
|60.4 ± 10.1
|25.46***
|-
|CBCL Bipolar Profile Average

(3 scales)
|72.5 ± 7.4 &lt;sup&gt; a&lt;/sup&gt;
|72.2 ± 8.4 &lt;sup&gt; a&lt;/sup&gt;
|67.9 ± 9.8
|67.8 ± 8.2
|60.1 ± 7.9
|22.36***
|}
''Note :'' &lt;sup&gt;a&lt;/sup&gt; Bipolar groups significantly different than All remaining groups; &lt;sup&gt;b&lt;/sup&gt; Bipolar groups significantly different than Unipolar Mood; &lt;sup&gt;c&lt;/sup&gt; Bipolar groups significantly different than Disruptive Beh; &lt;sup&gt;d&lt;/sup&gt; Bipolar groups significantly different than Residual Diagnoses; &lt;sup&gt; &lt;/sup&gt; ''* p&lt;'' .05, ** ''p&lt;''.01, ***''p&lt;''.005 two-tailed.

Table 4

''CBCL T DSM Oriented Scales compared across diagnostic subgroup (N=750) (Aim 1, Hypothesis 1)''
{| class=&quot;wikitable&quot;
|''T''-Scores ''(M±SD)''
|'''Bipolar I'''

''n'' = 27 (4%)
|'''Cyclothymes, BP II, BP NOS'''

''n'' = 106 (14%)
|'''Unipolar Mood D/O'''

''n'' = 210 (28%)
|'''Disruptive Beh D/Os'''

''n'' = 338 (45%)
|'''Residual Diagnoses'''

''n'' = 69 (9%)
|'''''F''  Statistic'''
|-
|Affective Disorder
|63 ± 7.9 &lt;sup&gt; &lt;/sup&gt;
|63.7 ± 7.8 &lt;sup&gt; c d&lt;/sup&gt; 
|62.5 ± 8.2 &lt;sup&gt; &lt;/sup&gt;
|59.9 ± 8.4
|58.1 ± 8
|8.78***
|-
|Anxiety Disorder
|63.5 ± 11.5 
|61.4 ± 10.3 &lt;sup&gt;c d&lt;/sup&gt;
|60.1 ± 9.4
|57.3 ± 8
|57.2 ± 8.3
|8.01***
|-
|Somatic Problems
|71.8 ± 5.8 &lt;sup&gt;a&lt;/sup&gt;
|69.7 ± 7.7 &lt;sup&gt;b d&lt;/sup&gt;
|64.6 ± 9.2
|68.3 ± 8.4
|59.1 ± 8.1
|24.72***
|-
|ADHD
|71.8 ± 7.3 &lt;sup&gt; b d&lt;/sup&gt;
|72 ± 6.7 &lt;sup&gt; a&lt;/sup&gt;
|67.1 ± 9.3 &lt;sup&gt; &lt;/sup&gt;
|69.7 ± 8.2
|59.1 ± 8.2
|30.55***
|-
|Oppositional Defiant Disorder
|74.8 ± 8.9 &lt;sup&gt; b d&lt;/sup&gt;
|73.9 ± 9.4 &lt;sup&gt; d b&lt;/sup&gt;
|68.6 ± 10
|71.5 ± 9.6
|61.7 ± 9
|21.78***
|}
''Note :'' &lt;sup&gt;a&lt;/sup&gt; Bipolar groups significantly different than All remaining groups; &lt;sup&gt;b&lt;/sup&gt; Bipolar groups significantly different than Unipolar Mood; &lt;sup&gt;c&lt;/sup&gt; Bipolar groups significantly different than Disruptive Beh; &lt;sup&gt;d&lt;/sup&gt; Bipolar groups significantly different than Residual Diagnoses; &lt;sup&gt; &lt;/sup&gt; ''* p&lt;'' .05, ** ''p&lt;''.01, ***''p&lt;''.005 two-tailed.  


Table 4 ''Percentage of Maximum Possible (POMP) Scores (N=455) (Aim 1, Hypothesis 1)''
{| class=&quot;wikitable&quot;
|Variable Scales
|'''Bipolar I'''

''n'' = 19 (4%)
|'''Cyclothymes, BP II, BP NOS'''

''n'' = 72 (16%)
|'''Unipolar Mood D/O'''

''n'' = 167 (37%)
|'''Disruptive Beh D/Os'''

''n'' = 159 (35%)
|'''Residual Diagnoses'''

''n'' = 38 (8%)
|'''''F''  Statistic'''
|-
|A-GBI Depression Likert Total 
|38.4 ± 20.3 
|30.6 ± 21.2 &lt;sup&gt; &lt;/sup&gt;
|33.6 ± 20.6 
|24.7 ± 18.8
|23.6 ± 20.1
|5.82***
|-
|A-GBI Hypo/Biphasic Likert Total
|41.2 ± 20.2 &lt;sup&gt;d&lt;/sup&gt;
|32.2 ± 18.1 
|30.1 ± 17.6
|27.7 ± 18.1
|24.9 ± 19.8
|3.39**
|-
|Adolescent- MDQ  Total 
|62.3 ± 15.5 &lt;sup&gt; a&lt;/sup&gt;
|43.2 ± 23.6 &lt;sup&gt; &lt;/sup&gt;
|39.3 ± 22.6
|39.2 ± 23.6
|38.1 ± 23.7
|4.82***
|-
|Adolescent YMRS Total Score
|43 ± 28.9 &lt;sup&gt; a&lt;/sup&gt;
|34.2 ± 17.2 &lt;sup&gt; a&lt;/sup&gt;
|31.2 ± 18.7
|33.9 ± 20.8
|30.2 ± 16
|1.96
|}


''Note :'' &lt;sup&gt;a&lt;/sup&gt; Bipolar groups significantly different than All remaining groups; &lt;sup&gt;b&lt;/sup&gt; Bipolar groups significantly different than Unipolar Mood; &lt;sup&gt;c&lt;/sup&gt; Bipolar groups significantly different than Disruptive Beh; &lt;sup&gt;d&lt;/sup&gt; Bipolar groups significantly different than Residual Diagnoses; &lt;sup&gt; &lt;/sup&gt; ''* p&lt;'' .05, ** ''p&lt;''.01, ***''p&lt;''.005 two-tailed.


Table 6 Achenbach Youth Self Report (Y''SR) T Scores (N=440, ages 11 to 18 years) (Aim 1, Hypothesis 1)''
{| class=&quot;wikitable&quot;
|''T''-Scores ''(M±SD)''
|'''Bipolar I'''

''n'' = 19 (4%)
|'''Cyclothymes, BP II, BP NOS'''

''n'' = 67 (15%)
|'''Unipolar Mood D/O'''

''n'' = 166 (38%)
|'''Disruptive Beh D/Os'''

''n'' = 151 (34%)
|'''Residual Diagnoses'''

''n'' = 37 (9%)
|'''''F''  Statistic'''
|-
|Anxious/Depressed
|60.1 ± 10.3 &lt;sup&gt; &lt;/sup&gt;
|57 ± 12.1 &lt;sup&gt; &lt;/sup&gt;
|59.4 ± 9.4 &lt;sup&gt; &lt;/sup&gt;
|56.2 ± 8.5
|54.7 ± 6.7
|3.66**
|-
|Withdrawn
|62.8 ± 9.8 
|61.1 ± 14.1 
|61.8 ± 9.6
|57 ± 7.5
|56.8 ± 6.7
|6.64***
|-
|Somatic
|62.4 ± 9.1 
|59 ± 12.2 
|60.2 ± 9.2
|57.8 ± 8.4
|56.9 ± 7.5
|2.45*
|-
|Social  Problems
|62.4 ± 9.2 &lt;sup&gt; &lt;/sup&gt;
|59.2 ± 11.7 &lt;sup&gt; &lt;/sup&gt;
|59.2 ± 8.5 &lt;sup&gt; &lt;/sup&gt;
|58.6 ± 8.7
|55.8 ± 7.4
|1.85
|-
|Thought  Problems
|64.5 ± 9.2 &lt;sup&gt;c d&lt;/sup&gt;
|59.7 ± 11.8 
|59.3 ± 9.1
|57.8 ± 8.6
|57 ± 7.8
|2.83*
|-
|Attention
|72.4 ± 12.6 &lt;sup&gt; a&lt;/sup&gt;
|60.3 ± 11.7 &lt;sup&gt; &lt;/sup&gt;
|60.9 ± 9.8
|59.9 ± 10.1
|56.1 ± 8.5
|8.20***
|-
|Rule  Breaking
|64.4 ± 10.4 &lt;sup&gt; d&lt;/sup&gt;
|57.9 ± 10.1 
|59.4 ± 7.7
|58.8 ± 7.9
|54.9 ± 5
|4.71***
|-
|Aggressive 
|70.3 ± 12.9 &lt;sup&gt;a&lt;/sup&gt;
|60.7 ± 11.4 
|60.5 ± 9.2 
|61.1 ± 10.4
|55.8 ± 6.6
|6.68***
|-
|Internalizing
|61.6 ± 10.5 &lt;sup&gt; d&lt;/sup&gt;
|56.9 ± 14.7 &lt;sup&gt; &lt;/sup&gt;
|59.5 ± 11.7 &lt;sup&gt; &lt;/sup&gt;
|54.1 ± 12
|52.4 ± 11.2
|5.75***
|-
|Externalizing
|67.8 ± 11.4 &lt;sup&gt; a&lt;/sup&gt;
|59.1 ± 11.4 &lt;sup&gt; d&lt;/sup&gt;
|59.1 ± 10.4
|51.9 ± 10.7
|58.7 ± 11.4
|6.66***
|-
|Total Problems
|67.3 ± 8.9 &lt;sup&gt; a&lt;/sup&gt;
|59.6 ± 13 &lt;sup&gt; d&lt;/sup&gt;
|59.9 ± 10.8
|56.9 ± 12.5
|52.1 ± 12.2
|6.72***
|-
|YSR Bipolar Profile Average (3 scales)
|67.6 ± 8.6 &lt;sup&gt; a&lt;/sup&gt;
|59.3 ± 10.4 &lt;sup&gt; &lt;/sup&gt;
|60.3 ± 7.5
|59.1 ± 8.1
|55.5 ± 6.4
|7.22***
|}


''Note :'' &lt;sup&gt;a&lt;/sup&gt; Bipolar groups significantly different than All remaining groups; &lt;sup&gt;b&lt;/sup&gt; Bipolar groups significantly different than Unipolar Mood; &lt;sup&gt;c&lt;/sup&gt; Bipolar groups significantly different than Disruptive Beh; &lt;sup&gt;d&lt;/sup&gt; Bipolar groups significantly different than Residual Diagnoses; &lt;sup&gt; &lt;/sup&gt; ''* p&lt;'' .05, ** ''p&lt;''.01, ***''p&lt;''.005 two-tailed.


Table 7

''YSR DSM Oriented Scale T-Scores (N=440) (Aim 1, Hypothesis 1)''
{| class=&quot;wikitable&quot;
|''T''-Scores ''(M±SD)''
|'''Bipolar I'''

''n'' = 19 (4%)
|'''Cyclothymes, BP II, BP NOS'''

''n'' = 67 (15%)
|'''Unipolar Mood D/O'''

''n'' = 166 (38%)
|'''Disruptive Beh D/Os'''

''n'' = 151 (34%)
|'''Residual Diagnoses'''

''n'' = 37 (9%)
|'''''F''  Statistic'''
|-
|Affective Disorder
|57 ± 6.48 &lt;sup&gt; &lt;/sup&gt;
|54.4 ± 9.8 &lt;sup&gt; &lt;/sup&gt;
|57 ± 7.4 &lt;sup&gt; &lt;/sup&gt;
|55.6 ± 7.1
|54 ± 6.1
|2.27
|-
|Anxiety Disorder
|62 ± 9.9 
|58.4 ± 11.5 
|59.8 ± 8.6
|58.6 ± 8.6
|57.4 ± 7.6
|1.27
|-
|Somatic Problems
|67.7 ± 7.1 &lt;sup&gt;a&lt;/sup&gt;
|59.2 ± 10.1 
|58.6 ± 7.5
|58.8 ± 8.5
|56.4 ± 7
|6.53***
|-
|ADHD
|66.6 ± 9.2 &lt;sup&gt; a&lt;/sup&gt;
|58.9 ± 11 &lt;sup&gt; &lt;/sup&gt;
|59 ± 7.9 &lt;sup&gt; &lt;/sup&gt;
|59.3 ± 8.4
|55.4 ± 6.5
|4.95***
|-
|Oppositional Defiant Disorder
|69.6 ± 12.3 &lt;sup&gt; d&lt;/sup&gt;
|61.1 ± 11.2 &lt;sup&gt; &lt;/sup&gt;
|61.1 ± 8.6
|62 ± 9.7
|56.2 ± 6.8
|6.54***
|}


''Note :'' &lt;sup&gt;a&lt;/sup&gt; Bipolar groups significantly different than All remaining groups; &lt;sup&gt;b&lt;/sup&gt; Bipolar groups significantly different than Unipolar Mood; &lt;sup&gt;c&lt;/sup&gt; Bipolar groups significantly different than Disruptive Beh; &lt;sup&gt;d&lt;/sup&gt; Bipolar groups significantly different than Residual Diagnoses; &lt;sup&gt; &lt;/sup&gt; ''* p&lt;'' .05, ** ''p&lt;''.01, ***''p&lt;''.005 two-tailed.


Table 8

''Teacher Report on Mania Scales -- Percentage of Maximum Possible (POMP) Scores (N=166) (Aim 1, Hypothesis 1)''

{| class=&quot;wikitable&quot;
|Variable Scales
|'''Bipolar I'''

''n'' = 7 (4%)
|'''Cyclothymes, BP II, BP NOS'''

''n'' = 28 (17%)
|'''Unipolar Mood D/O'''

''n'' = 48 (29%)
|'''Disruptive Beh D/Os'''

''n'' = 72 (42%)
|'''Residual Diagnoses'''

''n'' = 14 (8%)
|'''''F''  Statistic'''
|-
|T-GBI Depression Likert Total 
|65.6 ± 19.1 &lt;sup&gt;c d&lt;/sup&gt;
|50.6 ± 15.2 &lt;sup&gt; c d&lt;/sup&gt;
|47.1 ± 11.8 
|48.5 ± 13.5
|50.2 ± 13.2
|2.94*
|-
|T-GBI Hypo/Biphasic Likert Total
|80.3 ± 23.4 &lt;sup&gt;a&lt;/sup&gt;
|62 ± 18.7 &lt;sup&gt;a&lt;/sup&gt;
|57.7 ± 14.5
|59.4 ± 16.5
|61.5 ± 16.2
|2.94*
|-
|Teacher YMRS Total Score
|28.2 ± 20.3 &lt;sup&gt; a&lt;/sup&gt;
|25.8 ± 19.4 &lt;sup&gt; a&lt;/sup&gt;
|24 ± 19
|30.8 ± 22.4
|14.7 ± 11.2
|3.64**
|}
''Note :'' &lt;sup&gt;a&lt;/sup&gt; Bipolar groups significantly different than All remaining groups; &lt;sup&gt;b&lt;/sup&gt; Bipolar groups significantly different than Unipolar Mood; &lt;sup&gt;c&lt;/sup&gt; Bipolar groups significantly different than Disruptive Beh; &lt;sup&gt;d&lt;/sup&gt; Bipolar groups significantly different than Residual Diagnoses; &lt;sup&gt; &lt;/sup&gt; ''* p&lt;'' .05, ** ''p&lt;''.01, ***''p&lt;''.005 two-tailed.


Table 9 

''TRF T Scores (N=292) (Aim 1, Hypothesis 1)''
{| class=&quot;wikitable&quot;
|''T''-Scores ''(M±SD)''
|'''Bipolar I'''

''n'' = 14 (5%)
|'''Cyclothymes, BP II, BP NOS'''

''n'' = 51 (17%)
|'''Unipolar Mood D/O'''

''n'' = 78 (27%)
|'''Disruptive Beh D/Os'''

''n'' = 126 (43%)
|'''Residual Diagnoses'''

''n'' = 23 (8%)
|'''''F''  Statistic'''
|-
|Anxious/Depressed
|62 ± 7 &lt;sup&gt; &lt;/sup&gt;
|58.8 ± 8.8 &lt;sup&gt; &lt;/sup&gt;
|56.3 ± 7 &lt;sup&gt; &lt;/sup&gt;
|56.4 ± 7.4
|57.2 ± 7.4
|2.53*
|-
|Withdrawn
|64.5 ± 8.9 
|60.2 ± 8.4 
|59.9 ± 9.9
|59.4 ± 8.4
|60.3 ± 11.4
|1.02
|-
|Somatic
|59.5 ± 8.9 
|57.1 ± 9.2 
|55.3 ± 7.2
|55.3 ± 8
|56.2 ± 7.6
|1.26
|-
|Social  Problems
|65.7 ± 10.5 &lt;sup&gt; &lt;/sup&gt;
|60.9 ± 7.4 &lt;sup&gt; &lt;/sup&gt;
|60.2 ± 8.3 &lt;sup&gt; &lt;/sup&gt;
|61.3 ± 8.6
|57.2 ± 7.5
|2.49*
|-
|Thought  Problems
|63.6 ± 9.1 &lt;sup&gt;d&lt;/sup&gt;
|58.3 ± 9.2 
|57.1 ± 7.5
|58 ± 9.4
|54.7 ± 6.7
|2.44*
|-
|Attention
|66.4 ± 11.1 &lt;sup&gt; &lt;/sup&gt;
|63.3 ± 8 &lt;sup&gt; d &lt;/sup&gt; 
|61.6 ± 8.2
|65.4 ± 10.2
|56.7 ± 7.1
|5.62***
|-
|Rule  Breaking
|62.7 ± 8.3 &lt;sup&gt; &lt;/sup&gt;
|62.1 ± 7.5 
|62.3 ± 8.6
|64.5 ± 9.1
|56.9 ± 7.5
|4.16***
|-
|Aggressive 
|69.1 ± 14.6 
|64.4 ± 9.3 &lt;sup&gt; d&lt;/sup&gt;
|63.8 ± 11.4 
|67.3 ± 12.9
|58.6 ± 6.4
|3.61**
|-
|Internalizing
|64.7 ± 7.3 &lt;sup&gt; b  c &lt;/sup&gt; 
|59.5 ± 10.6 &lt;sup&gt; &lt;/sup&gt;
|57.1 ± 9.3 &lt;sup&gt; &lt;/sup&gt;
|56.7 ± 10.1
|57 ± 11.1
|2.53*
|-
|Externalizing
|65.9 ± 11.6 &lt;sup&gt; &lt;/sup&gt;
|63.5 ± 9.1 &lt;sup&gt; &lt;/sup&gt;
|62.8 ± 10.8
|66 ± 11
|57.5 ± 8.4
|3.68**
|-
|Total Problems
|68.2 ± 9.4 &lt;sup&gt; d&lt;/sup&gt;
|64.3 ± 7.7 &lt;sup&gt; d&lt;/sup&gt;
|62.2 ± 9.2
|65.2 ± 9.7
|57 ± 9.2
|4.97***
|-
|TRF Bipolar Profile Average 

(3 scales)
|65.8 ± 8.8 &lt;sup&gt; d&lt;/sup&gt;
|62.2 ± 6.6 &lt;sup&gt; d&lt;/sup&gt;
|60.6 ± 7.1
|63.1 ± 8.3
|57.5 ± 5.3
|4.21***
|} 

''Note :'' &lt;sup&gt;a&lt;/sup&gt; Bipolar groups significantly different than All remaining groups; &lt;sup&gt;b&lt;/sup&gt; Bipolar groups significantly different than Unipolar Mood; &lt;sup&gt;c&lt;/sup&gt; Bipolar groups significantly different than Disruptive Beh; &lt;sup&gt;d&lt;/sup&gt; Bipolar groups significantly different than Residual Diagnoses; &lt;sup&gt; &lt;/sup&gt; ''* p&lt;'' .05, ** ''p&lt;''.01, ***''p&lt;''.005 two-tailed.


Table 10

''TRF DSM Oriented Scale T-Scores (N=292) (Aim 1, Hypothesis 1)''
{| class=&quot;wikitable&quot;
|''T''-Scores ''(M±SD)''
|'''Bipolar I'''

''n'' = 14 (5%)
|'''Cyclothymes, BP II, BP NOS'''

''n'' = 51 (17%)
|'''Unipolar Mood D/O'''

''n'' = 78 (27%)
|'''Disruptive Beh D/Os'''

''n'' = 126 (43%)
|'''Residual Diagnoses'''

''n'' = 23 (8%)
|'''Statistic'''
|-
|Affective Disorder
|63 ± 7.7 &lt;sup&gt;  b c&lt;/sup&gt;
|58.9 ± 8.1 &lt;sup&gt; &lt;/sup&gt;
|56.1 ± 6.6 &lt;sup&gt; &lt;/sup&gt;
|56.1 ± 6.8
|57.3 ± 6.6
|4.28***
|-
|Anxiety Disorder
|59.1 ± 8.7 
|56.3 ± 9.5 
|54.5 ± 7.9
|54.2 ± 8.1
|55.7 ± 7.1
|1.58
|-
|Somatic Problems
|64.3 ± 10.1 
|63.4 ± 9.1 &lt;sup&gt; d&lt;/sup&gt;
|61.5 ± 10
|64.7 ± 9.5
|55.7 ± 6.3
|5.04***
|-
|ADHD
|65.7 ± 8.7 &lt;sup&gt; d&lt;/sup&gt;
|63.5 ± 8 &lt;sup&gt;  d&lt;/sup&gt;
|61.7 ± 9.5 &lt;sup&gt; &lt;/sup&gt;
|63.7 ± 8.3
|56.7 ± 6.8
|4.10***
|-
|Oppositional Defiant Disorder
|64.7 ± 11.5 &lt;sup&gt; &lt;/sup&gt;
|63.1 ± 9 &lt;sup&gt;  d&lt;/sup&gt;
|62.9 ± 9.4
|66.8 ± 12.7
|55.9 ± 6.2
|5.57***
|}


''Note :'' &lt;sup&gt;a&lt;/sup&gt; Bipolar groups significantly different than All remaining groups; &lt;sup&gt;b&lt;/sup&gt; Bipolar groups significantly different than Unipolar Mood; &lt;sup&gt;c&lt;/sup&gt; Bipolar groups significantly different than Disruptive Beh; &lt;sup&gt;d&lt;/sup&gt; Bipolar groups significantly different than Residual Diagnoses; &lt;sup&gt; &lt;/sup&gt; ''* p&lt;'' .05, ** ''p&lt;''.01, ***''p&lt;''.005 two-tailed.


Table 11.

''A Priori Taxometric Power Analysis (Aim 2, Hypothesis 3)''


{| class=&quot;wikitable&quot;
|'''Indicators'''
|'''Complement'''
|'''Taxon'''
|'''Total N'''
|'''R Sample'''
|'''r Nuisance'''
|'''Asymmetry'''
|'''(d) Validity'''
| 
|-
|hhh
|577
|207
|784
|.52
|.04
|.58
|2.26
| 
|-
|hbh
|577
|207
|784
|.45
|.04
|.80
|1.95
| 
|-
|hbb
|577
|207
|784
|.66
|.19
|.26
|2.66
| 
|-
|hdh
|577
|207
|784
|.32
|&lt;nowiki&gt;-.03&lt;/nowiki&gt;
|.50
|1.62
| 
|-
|ddb
|577
|207
|784
|.47
|&lt;nowiki&gt;-.004&lt;/nowiki&gt;
|.46
|2.14
| 
|}
''Note :'' h =  P-GBI hipomanic item content, b = P-GBI biphasic item content, and d = P-GBI depressive item content.


Figure 1

MAMBAC results for analysis of caregiver-reported mood symptoms on the Parent General Behavior Inventory (Aim 2, Hypothesis 3)

  
Figure XXX – MAXEIG Results 

Table 12A

''Interview-rated Mood Severity -- Percentage of Maximum Possible (POMP) Scores (N=716) (Aim 2, Hypothesis 4)''
{| class=&quot;wikitable&quot;
|Variable Scales
|'''Bipolar I'''

''n'' = 27 (4%)
|'''Cyclothymes, BP II, BP NOS'''

''n'' = 106 (15%)
|'''Unipolar Mood D/O'''

''n'' = 206 (29%)
|'''Disruptive Beh D/Os'''

''n'' = 316 (44%)
|'''Residual Diagnoses'''

''n'' = 61 (8%)
|'''''F''  Statistic'''
|-
|YMRS past 2 weeks
|44.3 ± 14.1 &lt;sup&gt;a&lt;/sup&gt;
|35.8 ± 13.8 &lt;sup&gt; a&lt;/sup&gt;
|7.5 ± 9.4 
|6.9 ± 8.2
|5.7 ± 9.1
|259.47***
|-
|CDRS past 2 weeks
|40.2 ± 12.6 &lt;sup&gt;c d&lt;/sup&gt;
|36.5 ± 10.5 &lt;sup&gt;c d&lt;/sup&gt;
|36.2 ± 10.4
|19.6 ± 4.8
|21.4 ± 6.8
|184.24***
|-
|KDRS past 2 weeks
|63.4 ± 20.1 &lt;sup&gt; c d&lt;/sup&gt;
|55.6 ± 15.9 &lt;sup&gt; c d&lt;/sup&gt;
|53.6 ± 14.4
|29.6 ± 7
|32.4 ± 11.1
|196.63***
|-
|KDRS worst lifetime episode
|41.9 ± 25.4 &lt;sup&gt; a&lt;/sup&gt;
|31.6 ± 24.8 &lt;sup&gt; c&lt;/sup&gt;
|25.7 ± 22
|16.8 ± 15
|23 ± 19.6
|20.11***
|-
|KMRS past 2 weeks
|71.7 ± 16.7 &lt;sup&gt; a&lt;/sup&gt;
|61.2 ± 14.6 &lt;sup&gt; &lt;/sup&gt;
|29.5 ± 7.9
|27.8 ± 7.1
|27.7 ± 8.6
|379.25***
|-
|KMRS worst lifetime episode
|50.5 ± 30.2 &lt;sup&gt; a&lt;/sup&gt;
|28.8 ± 26.1 &lt;sup&gt; &lt;/sup&gt;
|10.1 ± 10.6
|10.1 ± 10.2
|10.3 ± 10.3
|76.13***
|}


''Note :'' &lt;sup&gt;a&lt;/sup&gt; Bipolar groups significantly different than All remaining groups; &lt;sup&gt;b&lt;/sup&gt; Bipolar groups significantly different than Unipolar Mood; &lt;sup&gt;c&lt;/sup&gt; Bipolar groups significantly different than Disruptive Beh; &lt;sup&gt;d&lt;/sup&gt; Bipolar groups significantly different than Residual Diagnoses; &lt;sup&gt; &lt;/sup&gt; ''* p&lt;'' .05, ** ''p&lt;''.01, ***''p&lt;''.005 two-tailed.


Table 12B

''Global Functioning (Measured as CGAS  Score) compared across diagnostic subgroups (N=797)(Aim2, Hypothesis 4)''
{| class=&quot;wikitable&quot;
|''T''-Scores ''(M±SD)''
|'''Bipolar I'''

''n'' = 14 (5%)
|'''Cyclothymes, BP II, BP NOS'''

''n'' = 51 (17%)
|'''Unipolar Mood D/O'''

''n'' = 78 (27%)
|'''Disruptive Beh D/Os'''

''n'' = 126 (43%)
|'''Residual Diagnoses'''

''n'' = 23 (8%)
|'''''F''  Statistic'''
|-
|KSADS - Child's Axis 5 Dx: Current CGAS  Score
|46.7 ± 8 &lt;sup&gt;  c d&lt;/sup&gt;
|48.1 ± 6 &lt;sup&gt;  a&lt;/sup&gt;
|50.7 ± 6.9 &lt;sup&gt; &lt;/sup&gt;
|53.5 ± 7.1
|63.1 ± 11.8
|53.96***
|-
|CGAS: Past 2 Weeks
|45.8 ± 6.2 &lt;sup&gt; a&lt;/sup&gt;
|48.2 ± 5.9 &lt;sup&gt; a&lt;/sup&gt;
|51 ± 6.9
|53.5 ± 7.3
|62.9 ± 11.9
|52.53***
|-
|CGAS: Most Severe Past
|39.7 ± 6.9 &lt;sup&gt; a&lt;/sup&gt;
|44.6 ± 6.7 &lt;sup&gt; a&lt;/sup&gt;
|46.9 ± 7.9
|50.3 ± 7.5
|57.1 ± 13.5
|40.22***
|-
|CGAS: Highest Level of Functioning in Past  Year
|55.1 ± 10.3 &lt;sup&gt; a&lt;/sup&gt;
|58.3 ± 9.4 &lt;sup&gt;  a&lt;/sup&gt;
|61.9 ± 10.8 &lt;sup&gt; &lt;/sup&gt;
|61.1 ± 9.7
|70.7 ± 12.7
|19.75***
|}
''Note :'' &lt;sup&gt;a&lt;/sup&gt; Bipolar groups significantly different than All remaining groups; &lt;sup&gt;b&lt;/sup&gt; Bipolar groups significantly different than Unipolar Mood; &lt;sup&gt;c&lt;/sup&gt; Bipolar groups significantly different than Disruptive Beh; &lt;sup&gt;d&lt;/sup&gt; Bipolar groups significantly different than Residual Diagnoses; &lt;sup&gt; &lt;/sup&gt; ''* p&lt;'' .05, ** ''p&lt;''.01, ***''p&lt;''.005 two-tailed.


Table 13

''Impairment in ADHD compared to comorbid BPSD +ADHD (N=445) (Aim 2, Hypothesis 4)''
{| class=&quot;wikitable&quot;
|'''Number of settings where  impaired'''
|'''ADHD'''

''n'' = 351 (79%)
|'''BPSD plus ADHD''' 

''n'' = 94 (21%)
|'''Statistic'''
|-
|''Family''
|3%  (n=10)
|3% (n=3)
|''χ&lt;sup&gt;2&lt;/sup&gt;=''.891
|-
|''Family + one setting outside''
|40 % (n=142)
|35% (n=33)
|
|-
|''Family + two settings outside''
|57% (n=199)
|62% (n=58)
|
|}       

''* p&lt;'' .05, ** ''p&lt;''.01, ***''p&lt;''.005 two-tailed.  

Table 14

''Impairment in ODD compared to ODD with comorbid BPSD (N=290) (Aim 2, Hypothesis 4)''
{| class=&quot;wikitable&quot;
|'''Number of settings where  impaired'''
|'''ODD'''

''n'' = 233 (80%)
|'''BPSD plus ODD'''

''n'' = 57 (20%)
|'''Statistic'''
|-
|''Family''
|10% (n=24)
|9% (n=5)
|''χ&lt;sup&gt;2&lt;/sup&gt;=''2.506
|-
|''Family + one setting outside''
|29% (n=67)
|19% (n=11)
|
|-
|''Family + two settings outside''
|61% (n=142)
|72% (n=41)
|
|}
''* p&lt;'' .05, ** ''p&lt;''.01, ***''p&lt;''.005 two-tailed.


Table 15

''Mood symptoms as a function of age in bipolar sample -- POMP (N=144) (Aim 3, Hypothesis 5)''
{| class=&quot;wikitable&quot;
|Variable Scales
|'''Prepubertal'''

''n'' = 42 (29%)
|'''Peri-pubertal'''

''n'' = 45 (31%)
|'''Adolescent'''

''n'' = 57 (40%)
|'''''F''  Statistic'''
|'''Partial Eta Squared'''
|-
|P-GBI Depression Likert Total 
|23.9 ± 14.1 &lt;sup&gt;a&lt;/sup&gt;
|33.3 ± 17.2 &lt;sup&gt; &lt;/sup&gt;
|33.2 ± 17.6 
|4.67*
|.06
|-
|P-GBI Hypo/Biphasic Likert Total
|39.9 ± 17.9 
|41.4 ± 16.4 
|35.8 ± 18.7
|1.38
|.01
|-
|Parent about KID - MDQ Total
|61.1 ± 18.6 &lt;sup&gt; &lt;/sup&gt;
|66.4 ± 17.4 &lt;sup&gt; &lt;/sup&gt;
|59.3 ± 20.2
|1.85
|.02
|-
|Parent YMRS Total Score
|39.8 ± 20.7 &lt;sup&gt; &lt;/sup&gt;
|48.3 ± 24.1 &lt;sup&gt; &lt;/sup&gt;
|30.3 ± 21.2 &lt;sup&gt;b&lt;/sup&gt;
|8.52***
|.10
|-
|P-GBI Depression Irritability
|40.5 ± 20.6 
|51.3 ± 22.1 
|48.5 ± 22.5 
|''2.''83
|.03
|-
|P-GBI Hypomanic/Manic Irritability
|36.5 ± 24.9 
|40.7 ± 20.5 
|36.9 ± 24.8
|.439
|.00
|-
|P-GBI Total Irritability
|40.3 ± 20.7 &lt;sup&gt; &lt;/sup&gt;
|48.9 ± 19.8 &lt;sup&gt; &lt;/sup&gt;
|45.7 ± 22  &lt;sup&gt; &lt;/sup&gt;
|.157
|.02
|}


''Note :'' &lt;sup&gt;a&lt;/sup&gt; Prepubertal group  significantly different than All remaining groups; &lt;sup&gt;b&lt;/sup&gt; Adolescent groups significantly different than Peri-pubertal group 

''* p&lt;'' .05, ** ''p&lt;''.01, ***''p&lt;''.005 two-tailed.


Table 16

''Age in Bipolar Sample POMP values (N=133) (Aim 3, Hypothesis 5)''
{| class=&quot;wikitable&quot;
|Variable Scales
|'''Prepubertal'''

''n'' = 37 (28%)
|'''Peri-pubertal'''

''n'' = 42 (31%)
|'''Adolescent'''

''n'' = 54 (41%)
|'''''F''  Statistic'''
|'''Partial Eta Squared'''
| 
|-
|YMRS past 2 weeks
|41.5 ± 10.8 
|39.2 ± 15 &lt;sup&gt; &lt;/sup&gt;
|33.4 ± 14.8&lt;sup&gt;  c&lt;/sup&gt;
|4.12*
|.06
| 
|-
|CDRS past 2 weeks
|33.5 ± 9.8 
|39 ± 10.7 
|38.4 ± 11.7
|2.98
|.04
| 
|-
|KDRS past 2 weeks
|49.4 ± 14.6 &lt;sup&gt;a&lt;/sup&gt; &lt;sup&gt; &lt;/sup&gt;
|59.9 ± 16.3 &lt;sup&gt; &lt;/sup&gt;
|60.4 ± 17.7
|5.69***
|.08
| 
|-
|KDRS worst lifetime episode
|22.3 ± 21.6&lt;sup&gt;a &lt;/sup&gt; 
|37.1 ± 23.6 &lt;sup&gt; &lt;/sup&gt;
|38.9 ± 26.5 
|5.68***
|.08
| 
|-
|KMRS past 2 weeks
|66.9 ± 12.3 &lt;sup&gt; &lt;/sup&gt;
|65.7 ± 17.7 &lt;sup&gt; &lt;/sup&gt;
|59.1 ± 15&lt;sup&gt;  c&lt;/sup&gt;
|3.64*
|.05
| 
|-
|KMRS worst lifetime episode
|24.5 ± 25.8 &lt;sup&gt; &lt;/sup&gt;
|37.1 ± 30.7 &lt;sup&gt; &lt;/sup&gt;
|36.2 ± 27.1 
|2.51
|.03
| 
|}


''Note :'' &lt;sup&gt;a&lt;/sup&gt; Prepubertal group  significantly different than All remaining groups; &lt;sup&gt;b&lt;/sup&gt; Adolescent groups significantly different than Peri-pubertal group;

&lt;sup&gt;c&lt;/sup&gt; Adolescent groups significantly different than Prepubertal group 

''* p&lt;'' .05, ** ''p&lt;''.01, ***''p&lt;''.005 two-tailed


Table 17

''CBCL Raw Scores compared across age cohorts (N=132) (Aim 3, Hypothesis 5)''
{| class=&quot;wikitable&quot;
|''Raw''-Scores ''(M±SD)''
|'''Prepubertal'''

''n'' = 29 (22%)
|'''Peri-pubertal'''

''n'' = 44 (33%)
|'''Adolescent'''

''n'' = 59 (45%)
|'''Statistic'''
|'''Partial Eta Squared'''
|-
|Anxious/Depressed
|7.3 ± 5 &lt;sup&gt; &lt;/sup&gt;
|10.1 ± 4.9 &lt;sup&gt; &lt;/sup&gt;
|8.7 ± 4.7 &lt;sup&gt; &lt;/sup&gt;
|2.98
|.04
|-
|Withdrawn
|4.2 ± 3.2 
|6 ± 3.5 
|7 ± 3.6 &lt;sup&gt;c&lt;/sup&gt;
|6.17**
|.08
|-
|Somatic
|4.5 ± 4.5 
|4.9 ± 3.7 
|5.1 ± 4.1
|.197
|.00
|-
|Social Problems
|8.6 ± 4.4 &lt;sup&gt; &lt;/sup&gt;
|9.2 ± 4.3 &lt;sup&gt; &lt;/sup&gt;
|6.7 ± 4 &lt;sup&gt;b&lt;/sup&gt;  &lt;sup&gt; &lt;/sup&gt;
|5.00*
|.07
|-
|Thought Problems
|8.7 ± 6.6 
|8.5 ± 4.4 
|6.6 ± 4.7
|2.31
|.03
|-
|Attention
|12.3 ± 3.4 &lt;sup&gt; &lt;/sup&gt;
|12.9 ± 4.2 &lt;sup&gt; &lt;/sup&gt;
|11.4 ± 4.3
|1.72
|.02
|-
|Rule Breaking
|9.1 ± 5.2 
|10 ± 3.7
|10.7 ± 6.3
|.860
|.01
|-
|Aggressive
|23.4 ± 7.3 
|24.2 ± 5.9 
|19.6 ± 7.8 &lt;sup&gt;b&lt;/sup&gt;
|6.34***
|.09
|-
|Internalizing
|16.1 ± 10.9 &lt;sup&gt; &lt;/sup&gt;
|21.1 ± 10 &lt;sup&gt; &lt;/sup&gt;
|20.9 ± 10.4 &lt;sup&gt; &lt;/sup&gt;
|2.47
|.03
|-
|Externalizing
|32.5 ± 12.1 &lt;sup&gt; &lt;/sup&gt;
|34.5 ± 8.5 &lt;sup&gt; &lt;/sup&gt;
|30.3 ± 13.3
|1.62
|.02
|-
|Total Problems
|88.1 ± 35.2 &lt;sup&gt; &lt;/sup&gt;
|95.8 ± 25.7 &lt;sup&gt; &lt;/sup&gt;
|84.3 ± 30.2
|1.87
|.02
|-
|CBCL Bipolar Profile Average (3 scales)
|14.3 ± 4.3 &lt;sup&gt; &lt;/sup&gt;
|15.8 ± 3.8 &lt;sup&gt; &lt;/sup&gt;
|13.2 ± 4.3 &lt;sup&gt;b&lt;/sup&gt;
|4.82**
|.07
|}


''Note :'' &lt;sup&gt;a&lt;/sup&gt; Prepubertal group  significantly different than All remaining groups; &lt;sup&gt;b&lt;/sup&gt; Adolescent groups significantly different than Peri-pubertal group;

&lt;sup&gt;c&lt;/sup&gt; Adolescent groups significantly different than Prepubertal group 

''* p&lt;'' .05, ** ''p&lt;''.01, ***''p&lt;''.005 two-tailed.


Table 18

''CBCL DSM Proxy Raw Scores compared across age cohorts within bipolar spectrum (N=132)''
{| class=&quot;wikitable&quot;
|''Raw''-Scores ''(M±SD)''
|'''Prepubertal'''

''n'' = 29 (22%)
|'''Peri-pubertal'''

''n'' = 44 (33%)
|'''Adolescent'''

''n'' = 59 (45%)
|'''Statistic'''
|'''Partial Eta Squared'''
|-
|Affective Disorder
|3.9 ± 2.7 &lt;sup&gt; &lt;/sup&gt;
|4.9 ± 2.5 &lt;sup&gt; &lt;/sup&gt;
|4.3 ± 2.8 &lt;sup&gt; &lt;/sup&gt;
|1.24
|.01
|-
|Anxiety Disorder
|2.6 ± 3 
|3.2 ± 2.8 
|3.1 ± 2.9 
|.403
|.00
|-
|Somatic Problems
|10.7 ± 3 
|10.5 ± 2.7 
|9 ± 3 &lt;sup&gt;d&lt;/sup&gt;
|4.96**
|.07
|-
|ADHD
|7.7 ± 2.1 &lt;sup&gt; &lt;/sup&gt;
|8.4 ± 1.4 &lt;sup&gt; &lt;/sup&gt;
|7.4 ± 2.3 &lt;sup&gt;b&lt;/sup&gt;  &lt;sup&gt; &lt;/sup&gt;
|3.40*
|.05
|-
|Oppositional Defiant Disorder
|14.4 ± 7.1 
|14.7 ± 5.4 
|12.9 ± 7.3
|1.00
|.01
|}
''(Aim 3, Hypothesis 5)''


''Note :'' &lt;sup&gt;a&lt;/sup&gt; Prepubertal group  significantly different than All remaining groups; &lt;sup&gt;b&lt;/sup&gt; Adolescent groups significantly different than Peri-pubertal group;

&lt;sup&gt;c&lt;/sup&gt; Adolescent groups significantly different than Prepubertal group; &lt;sup&gt;d&lt;/sup&gt; Adolescent group  significantly different than All remaining groups 

''* p&lt;'' .05, ** ''p&lt;''.01, ***''p&lt;''.005 two-tailed.


Table 19

''Sheehan Scale Scores compared between diagnostic subgroups (N=537) (Aim 3, Hypothesis x)'' 

{| class=&quot;wikitable&quot;
|''Sheehan Scale (M±SD)''
|'''Bipolar I'''

''n'' = 17 (3%)
|'''Cyclothymes, BP II, BP NOS'''

''n'' = 88 (16%)
|'''Unipolar Mood D/O'''

''n'' = 156 (29%)
|'''Disruptive Beh D/Os'''

''n'' = 232 (43%)
|'''Residual Diagnoses'''

''n'' = 44 (9%)
|'''''F''  Statistic'''
|-
|Work/School Impairment
|6.8 ± 2 &lt;sup&gt;  d&lt;/sup&gt;
|6.6 ± 2 &lt;sup&gt;  d&lt;/sup&gt;
|6 ± 2.1 &lt;sup&gt; &lt;/sup&gt;
|6 ± 2
|3.7 ± 2.4
|14.80***
|-
|Social Life
|6.3 ± 2.3 &lt;sup&gt; c d&lt;/sup&gt;
|5.8 ± 2 &lt;sup&gt; c d&lt;/sup&gt;
|5.5 ± 2.2
|4.3 ± 2.1
|3.2 ± 2.1
|19.48***
|-
|Family Life/ Home Responsibilities  Impairment
|7.3 ± 1.5 &lt;sup&gt; c d&lt;/sup&gt;
|6.9 ± 1.6 &lt;sup&gt; c d&lt;/sup&gt;
|6.3 ± 1.8
|5.5 ± 1.8
|3.7 ± 2.1
|30.67***
|}
''Note :'' &lt;sup&gt;a&lt;/sup&gt; Bipolar groups significantly different than All remaining groups; &lt;sup&gt;b&lt;/sup&gt; Bipolar groups significantly different than Unipolar Mood; &lt;sup&gt;c&lt;/sup&gt; Bipolar groups significantly different than Disruptive Beh; &lt;sup&gt;d&lt;/sup&gt; Bipolar groups significantly different than Residual Diagnoses; &lt;sup&gt; &lt;/sup&gt; ''* p&lt;'' .05, ** ''p&lt;''.01, ***''p&lt;''.005 two-tailed.


Table 20

''KINDL Parent POMP Scores sample above 8 years (N=610)''
{| class=&quot;wikitable&quot;
|''KINDL Scale (M±SD)''
|'''Bipolar I'''

''n'' = 23 (4%)
|'''Cyclothymes, BP II, BP NOS'''

''n'' = 88 (14%)
|'''Unipolar Mood D/O'''

''n'' = 192 (31%)
|'''Disruptive Beh D/Os'''

''n'' = 247 (41%)
|'''Residual Diagnoses'''

''n'' = 60 (10%)
|'''''F''  Statistic'''
|-
|Physical
|59.3 ± 19.4 &lt;sup&gt;  c d&lt;/sup&gt;
|59.8 ± 19.3 &lt;sup&gt;   c d&lt;/sup&gt;
|59.6 ± 18 &lt;sup&gt; &lt;/sup&gt;
|75.9 ± 17
|72.3 ± 16.6
|29.98***
|-
|Emotional
|58.1 ± 21 &lt;sup&gt; c d&lt;/sup&gt;
|62.4 ± 16.2 &lt;sup&gt; c d&lt;/sup&gt;
|59.1 ± 18.6
|77.8 ± 16.3
|74.8 ± 14.7
|39.38***
|-
|Self Esteem
|47.8 ± 20 &lt;sup&gt; &lt;/sup&gt;
|44.7 ± 19.9 &lt;sup&gt; c d&lt;/sup&gt;
|41.5 ± 19.8
|53.8 ± 21.7
|61 ± 19.3
|15.79***
|-
|Family
|45.5 ± 19.7 &lt;sup&gt; c d&lt;/sup&gt;
|46.8 ± 17.5 &lt;sup&gt; c d&lt;/sup&gt;
|51.9 ± 20.9
|58.7 ± 20.6
|64.3 ± 19
|11.62***
|-
|Friends
|52.1 ± 18.2 &lt;sup&gt; c d&lt;/sup&gt;
|54.5 ± 19.1 &lt;sup&gt; c d&lt;/sup&gt;
|56.5 ± 19.6
|64.4 ± 19.2
|70 ± 19.3
|11.31***
|-
|School
|48.9 ± 13.8 &lt;sup&gt; c d&lt;/sup&gt;
|47.7 ± 17.1 &lt;sup&gt; c d&lt;/sup&gt;
|52.8 ± 18
|60.2 ± 16.4
|65 ± 17.6
|15.58***
|-
|Total
|51.8 ± 12.1 &lt;sup&gt; c d&lt;/sup&gt;
|52.6 ± 10.9 &lt;sup&gt; c d&lt;/sup&gt;
|53.6 ± 11.5
|65.2 ± 11.5
|67.9 ± 12.8
|44.97***
|}
''Note :'' &lt;sup&gt;a&lt;/sup&gt; Bipolar groups significantly different than All remaining groups; &lt;sup&gt;b&lt;/sup&gt; Bipolar groups significantly different than Unipolar Mood; &lt;sup&gt;c&lt;/sup&gt; Bipolar groups significantly different than Disruptive Beh; &lt;sup&gt;d&lt;/sup&gt; Bipolar groups significantly different than Residual Diagnoses; &lt;sup&gt; &lt;/sup&gt; ''* p&lt;'' .05, ** ''p&lt;''.01, ***''p&lt;''.005 two-tailed.


Table 21

''KINDL Parent POMP Scores sample below 8 years (N=159)                       '' 
{| class=&quot;wikitable&quot;
|''KINDL Scale (M±SD)''
|'''Bipolar I'''

''n'' = 4 (3%)
|'''Cyclothymes, BP II, BP NOS'''

''n'' = 24 (15%)
|'''Unipolar Mood D/O'''

''n'' = 23 (14%)
|'''Disruptive Beh D/Os'''

''n'' = 98 (62%)
|'''Residual Diagnoses'''

''n'' = 10 (6%)
|'''''F''  Statistic'''
|-
|Physical
|75 ± 28.4 &lt;sup&gt; &lt;/sup&gt; 
|67.7 ± 12.9 &lt;sup&gt;  c&lt;/sup&gt;
|70.9 ± 19.8 &lt;sup&gt; &lt;/sup&gt;
|82.1 ± 14.2
|73.7 ± 13.1
|5.91***
|-
|Emotional
|65.6 ± 19.4 &lt;sup&gt; &lt;/sup&gt;
|70.3 ± 12.6 &lt;sup&gt; c&lt;/sup&gt; 
|67.1 ± 22.2
|80.9 ± 14.1
|82.5 ± 14
|5.95***
|-
|Self Esteem
|48.4 ± 19.3 &lt;sup&gt; &lt;/sup&gt;
|55.7 ± 15.3 &lt;sup&gt; &lt;/sup&gt;
|48.4 ± 22.7
|55.9 ± 19.9
|65 ± 19.8
|1.45
|-
|Family
|40.6 ± 14.8 &lt;sup&gt; d&lt;/sup&gt;
|55.4 ± 16.9 &lt;sup&gt; &lt;/sup&gt;
|57.2 ± 24.4
|66.6 ± 19.2
|85 ± 11.1
|6.77***
|-
|Friends
|51.5 ± 9.3 &lt;sup&gt; &lt;/sup&gt;
|59.1 ± 17.7 &lt;sup&gt; &lt;/sup&gt;
|56.7 ± 18.1
|69.7 ± 20
|71.8 ± 17.2
|3.85**
|-
|School
|50 ± 17.6 &lt;sup&gt; &lt;/sup&gt;
|59.4 ± 22.5 &lt;sup&gt; c d&lt;/sup&gt;
|49.6 ± 27.7
|58.1 ± 21.1
|78.7 ± 19.5
|3.13*
|-
|Total
|55.2 ± 9 &lt;sup&gt; d&lt;/sup&gt;
|61.2 ± 9.8 &lt;sup&gt; c d&lt;/sup&gt;
|58.4 ± 16.6
|68.9 ± 12.2
|76.1 ± 8
|6.78***
|}


''Note :'' &lt;sup&gt;a&lt;/sup&gt; Bipolar groups significantly different than All remaining groups; &lt;sup&gt;b&lt;/sup&gt; Bipolar groups significantly different than Unipolar Mood; &lt;sup&gt;c&lt;/sup&gt; Bipolar groups significantly different than Disruptive Beh; &lt;sup&gt;d&lt;/sup&gt; Bipolar groups significantly different than Residual Diagnoses; &lt;sup&gt; &lt;/sup&gt; ''* p&lt;'' .05, ** ''p&lt;''.01, ***''p&lt;''.005 two-tailed.


Table 22

''Sheehan Scale Scores in BPSD stratified by age groups (N=105) (Aim 3, Hypothesis 6)''
{| class=&quot;wikitable&quot;
|''Sheehan Scale (M±SD)''
|'''Prepubertal'''

''n'' = 34 (32%)
|'''Peri-pubertal'''

''n'' = 33 (31%)
|'''Adolescent'''

''n'' = 38 (37%)
|'''''F''  Statistic'''
|'''Partial Eta Squared'''
|-
|Work/School Impairment
|6.2 ± 1.9 
|6.7 ± 1.8 
|6.8 ± 2.2 
|''.''758
|.01
|-
|Social Life
|6 ± 2.2 
|5.8 ± 2.2 
|5.9 ± 2
|.059
|.00
|-
|Family Life/ Home Responsibilities  Impairment
|6.9 ± 1.6 &lt;sup&gt; &lt;/sup&gt;
|7 ± 1.6 &lt;sup&gt; &lt;/sup&gt;
|6.9 ± 1.6  &lt;sup&gt; &lt;/sup&gt;
|.055
|.00
|}  


''Note :'' &lt;sup&gt;a&lt;/sup&gt; Prepubertal group  significantly different than All remaining groups; &lt;sup&gt;b&lt;/sup&gt; Adolescent groups significantly different than Peri-pubertal group;

&lt;sup&gt;c&lt;/sup&gt; Adolescent groups significantly different than Prepubertal group; &lt;sup&gt;d&lt;/sup&gt; Adolescent group  significantly different than All remaining groups 

''* p&lt;'' .05, ** ''p&lt;''.01, ***''p&lt;''.005 two-tailed.


Appendix I. Publications, Grants, and Training Activities

'''Peer Reviewed Publications (* indicates mentee)'''

Youngstrom, E.A., Arnold, L.E., &amp; Frazier, T.W. (in press). Bipolar and ADHD comorbidity: Both artifact and outgrowth of shared mechanisms. ''Clinical Psychology: Science and Practice.'' Special issue: Comorbidity (Editors: Phillip Kendall and Deborah Drabick).

Youngstrom, E.A. (2009). Definitional issues in bipolar disorder across the life cycle. ''Clinical Psychology: Science and Practice, 16,'' 140-160''.'' Special Issue: Bipolar Disorder (Edited by E. Youngstrom &amp; P. Kendall).

Youngstrom, E.A., *Freeman, A.J., &amp; *Jenkins, M.M. (2009). The assessment of bipolar disorder in children and adolescents. ''Child and Adolescent Psychiatric Clinics of North America, 18,'' 353-390''.'' 

&lt;nowiki&gt;*&lt;/nowiki&gt;Freeman, A. J., Youngstrom, E. A., Michalak, E., *Siegel, R., *Meyers, O. I., &amp; Findling, R. L. (2009). Quality of life in pediatric bipolar disorder. ''Pediatrics, 123'', 446-452.

Youngstrom, E.A., *Frazier, T.W., Demeter, C., Calabrese, J.R., &amp; Findling, R.L. (2008). Developing a ten-item mania scale from the Parent General Behavior Inventory for children and adolescents. ''Journal of Clinical Psychiatry, 69,'' 831-839.

Youngstrom, E.A., Birmaher, B., &amp; Findling, R.L. (2008). Pediatric bipolar disorder: Validity, phenomenology, and recommendations for diagnosis. ''Bipolar Disorders, 10,'' 194-214. Special Issue: International Society for Bipolar Disorders advisory papers for DSM-V Revisions.

Youngstrom, E.A., *Greene, J., &amp; *Joseph, M. (2008). Comparing the psychometric properties of multiple teacher report instruments as predictors of bipolar disorder in children and adolescents. ''Journal of Clinical Psychology, 64,'' 382-401. Special Issue: Bipolar Disorder (Guest Editors: Sheri Johnson and Mary Fristad).

&lt;nowiki&gt;*&lt;/nowiki&gt;Meyers, O.I., &amp; Youngstrom, E.A. (2008). A Parent General Behavior Inventory subscale to measure sleep disturbance in pediatric bipolar disorder. ''Journal of Clinical Psychiatry, 69,'' 840-843''.'' 

Youngstrom, E.A., *Meyers, O.I., Youngstrom, J.K., Calabrese, J.R., &amp; Findling, R.L. (2006). Comparing the effects of sampling designs on the diagnostic accuracy of eight promising screening algorithms for pediatric bipolar disorder. ''Biological Psychiatry, 60,'' 1013-1019''.''

Youngstrom, E.A., *Meyers, O.I., Kogos Youngstrom, J., Calabrese, J.R., &amp; Findling, R.L., (2006). Diagnostic and measurement issues in the assessment of pediatric bipolar disorder: Implications for understanding mood disorder across the life cycle. ''Development and Psychopathology, 18,'' 989-1021''.'' Special issue: Bipolar Disorder (Guest Editors: David Miklowitz &amp; Dante Cicchetti).

Youngstrom, E.A., Youngstrom, J.K., &amp; Calabrese, J.R. (2006). Screening for bipolarity: A brief review of available measures and recommendations for future research. ''Aspects of Affect, 2'', 1-6''.'' 

Youngstrom, E.A. (2006). Reasons to consider assessing for bipolar disorder in children and adolescents, and practical steps to take. ''Report on Emotional and Behavioral Disorders in Youth, 5,'' 13-17.

Youngstrom, E. A., *Meyers, O. I., Demeter, C., Kogos Youngstrom, J., Morello, L., Piiparinen, R., Feeny, N. C., Findling, R. L., &amp; Calabrese, J. R. (2005). Comparing diagnostic checklists for pediatric bipolar disorder in academic and community mental health settings. ''Bipolar Disorders, 7,'' 507-517. Special Issue: Pediatric Bipolar Disorder.

Youngstrom, E. A., Kogos Youngstrom, J., &amp; *Starr, M. (2005). Bipolar diagnoses in community mental health: Achenbach CBCL profiles and patterns of comorbidity. ''Biological Psychiatry, 58,'' 569-575.

Youngstrom, E. A., Findling, R. L., Youngstrom, J. K., &amp; Calabrese, J. R., (2005). Towards an evidence-based assessment of pediatric bipolar disorder. ''Journal of Clinical Child and Adolescent Psychology, 34,''433-448''.'' Special Issue: Evidence-Based Assessment.

Youngstrom, E. A., &amp; *Duax, J. (2005). Evidence Based Assessment of Pediatric Bipolar Disorder, Part 1: Base Rate and Family History. ''Journal of the American Academy of Child and Adolescent Psychiatry, 44(7),'' 712-717.

Youngstrom, E. A., &amp; Kogos Youngstrom, J. (2005). Evidence Based Assessment of Pediatric Bipolar Disorder, Part 2: Incorporating Information from Behavior Checklists. ''Journal of the American Academy of Child and Adolescent Psychiatry, 44(8)'', 823-828.

Youngstrom, E. A., Findling, R. L., Calabrese, J. R., Gracious, B. L., Demeter, C., DelPorto Bedoya, D., &amp; *Price, M.E. (2004). Comparing the diagnostic accuracy of six potential screening instruments for bipolar disorder in youths aged 5 to 17 years. ''Journal of the American Academy of Child &amp; Adolescent Psychiatry, 43,'' 847-858''.''

Youngstrom, E.A., Findling, R.L., &amp; Calabrese, J.R. (2004). Effects of adolescent manic symptoms on agreement between youth, parent, and teacher ratings of behavior problems. ''Journal of Affective Disorders, 82S,'' S5-S16''.'' 

'''Subsequent Grants'''

'''Evaluating the Impact of Evidence Based Assessment Strategies on the Accuracy and Outcome of Diagnoses of Pediatric Bipolar Disorder.''' 

Agency: UNC University Research Council

Mechanism: University grant

PI: Eric Youngstrom, Ph.D.

Funded. Start date: July 2008. 

Two years. Total costs: $5000.

'''Longitudinal Assessment of Manic Symptoms.''' 

Agency: NIMH

Mechanism: Collaborative R01; CWRU as coordinating site, MH073967

PI: Robert L. Findling, M.D.; Co-I and PI for UNC subcontract: Eric Youngstrom, Ph.D.

Renewed until 2015. Start date: August 2005.

Five years. Total costs: $5,411,274 for CWRU (coordinating) site during initial award; 

NOGA pending for renewal.

'''NIMH Developing Center for Study of Bipolar Disorder.''' 

Agency: NIMH

Mechanism: P20, MH066054

PI: Joseph Calabrese, M.D. Project #2 PI: Eric Youngstrom, Ph.D (40% effort); also Director of Research Methods Core and Director of Data Management and Statistical Analysis Unit. Switched to consultant status with move to UNC Chapel Hill in July 2006. 

Funded. Start date: July 2003.

Five years. Total costs $2,477,644.

'''Effectiveness of Manualized Cognitive Behavioral Therapy for Pediatric Bipolar Disorder in Community Mental Health''' 

Agency: Ohio Department of Mental Health

Mechanism: Investigator Initiated Proposal

PI: Jennifer Kogos Youngstrom, Ph.D. (8% effort). 

Co-I: Norah Feeny, Ph.D. (8% academic year) &amp; Eric Youngstrom, Ph.D.

Funded. Start date: July 2005. Total costs: $120,000.

'''Subjective Experience of Attention Deficit Hyperactivity Disorder (ADHD) and Bipolar Spectrum Disorders (BPSD) in Youth and Families'''

Agency: Ohio Department of Mental Health

Mechanism: Investigator Initiated Proposal

PI: Eric Youngstrom, Ph.D. (2% academic year).

Co-I: Janis Jenkins, Ph.D. (2% effort) &amp; Elizabeth Carpenter Song, M.A.

Funded. Start date: May 2005. 

Two years. Total costs: $59,458.

'''Research Supplements for Underrepresented Minorities:'''

'''Improving Assessment of Juvenile Bipolar Disorders.''' 

Agency: NIMH 

Mechanism: Research Supplements for Underrepresented Minorities to MH066647

PI: Eric Youngstrom, Ph.D., to support Kelly Constant, M.A.

Funded. Start date: August 2004.

Four years. Total costs: $158,565.

'''Experiential Learning Fellowship: Improving the Assessment of Mental Health Problems in Underserved Families.'''

Agency: Case Western  Reserve University

Mechanism: Undergraduate Experiential Learning Fellowship

RI: Eric Youngstrom, Ph.D., mentoring Maya Brown and Katherine Bobak

Funded. Fall 2006 to Spring 2007. Total costs: $4,600. 

'''Research Supplements for Underrepresented Minorities:'''

'''Improving Assessment of Juvenile Bipolar Disorders.''' 

Agency: NIMH 

Mechanism: Research Supplements for Underrepresented Minorities to MH066647

PI: Eric Youngstrom, Ph.D., to support Foluso Williams, M.A.

Funded. Start date: February 2005.

One year. Total costs: $10,632.


'''Student and Young Investigator Development and Training'''

Kirschstein NRSA F31 Fellowship awarded to Melissa Noya, M.A.

Research Assistantships for nine graduate students

NIH Underrepresented Minority Supplements for two fellows

Doctoral dissertations: Data for Elizabeth Carpenter Song, Ph.D., Guillermo Perez Algorta, Ph.D., Mary Ann McDonnell, Ph.D.

Masters theses: Data for Andrew Freeman, M.A., Anna Van Meter, M.A., Maria Martinez, M.A., Melissa Jenkins, M.A.; financial support for Kelly Bhatnagar, M.A.


'''Undergraduate Honors Theses:''' Julia Seay, Katy Hawks, Kristen White, Katherine Bobak, Maya Brown

'''Undergraduate Independent Studies:''' More than 40 at Case Western Reserve University and University of North Carolina at Chapel Hill


Establishment of Writer’s Workshop for Center for Excellence in Research and Treatment of Bipolar Disorder (CERT-BD) at the University of North Carolina  

'''Clinical Continuing Education'''

Data from project presented at more than 50 continuing education events internationally, including workshops and institutes sponsored by the American Psychological Association, the Canadian Psychological Association, the American Academy of Child and Adolescent Psychiatry, the Association for Behavioral and  Cognitive Therapy, the International Review of Bipolar Disorders, and the National Association of School Psychologists, as well as state (Ohio Psychological Association, North Carolina Psychological Association) and regional entities.


[[User:Eyoungstrom|Eyoungstrom]] ([[User talk:Eyoungstrom|discuss]] • [[Special:Contributions/Eyoungstrom|contribs]]) 20:29, 16 November 2022 (UTC)

==Helpful Links==
[https://docs.google.com/spreadsheets/d/1Z43uM1ahnCp0tl1d_8Ez334bLLwqLD58luaHaxRMX3c/edit?usp=sharing Here's a sheet] with the list of variables, labels, value labels, missing value codes, etc. (but not the actual data -- just the codebook!). 

[[User:Eyoungstrom|Eyoungstrom]] ([[User talk:Eyoungstrom|discuss]] • [[Special:Contributions/Eyoungstrom|contribs]]) 00:29, 9 December 2022 (UTC)</text>
      <sha1>nakba349iiv6xbr4ikdrayar2b2zrf9</sha1>
    </revision>
  </page>
  <page>
    <title>Why study math?</title>
    <ns>0</ns>
    <id>299980</id>
    <revision>
      <id>2809839</id>
      <parentid>2787795</parentid>
      <timestamp>2026-05-17T03:53:50Z</timestamp>
      <contributor>
        <username>HenriPittier</username>
        <id>3076895</id>
      </contributor>
      <origin>2809839</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="21332" sha1="gdzcd6asix6t0pqci7y6su4jxpp8vo3" xml:space="preserve">{{delete|vandalism}}
It is not unusual for young students, perhaps while struggling to memorize the multiplication tables, to ask “Why should I study math?  
[[File:Animated gif version of SVG of rearrangement proof of Pythagorean theorem.gif|thumb|The rearrangement proof of Pythagorean theorem]]
As students continue to learn, their curiosity may become stimulated, they may become fascinated by math, and they are drawn to solving math problems. Alternatively, students may decide they are not good at math, or they dislike math, or they will never need to know math. 

This attitude of liking or disliking math can develop and solidify at any age and in a variety of contexts. The reasons for studying math presented here are similarly diverse. One reason may be convincing when presented to one student, and may be discouraging, annoying, or even offensive when presented to another student.  

Scan this long list of reasons and select those that are most likely to  appeal to your student. 
{{TOC right | limit|limit=2}}
Here are some good reasons to study math:

== For Young Students ==
Studying math is like learning the superpower of problem-solving!&lt;ref&gt;This section was generated by [[w:ChatGPT|ChatGPT]] responding to the prompt: “What is the best answer I can give to a 5th grade student who asks ‘Why should I study math?’”&lt;/ref&gt; Math helps you understand the world around you and can be incredibly fun. Here are a few cool reasons why you should study math:

# '''Everyday Life:''' Math is everywhere! When you go shopping and want to make sure you have enough money, when you measure ingredients for baking cookies, or when you figure out how much time you have left to play before bedtime, you're using math without even realizing it.
# '''Career Opportunities:''' Many exciting jobs use math, like scientists, engineers, architects, doctors, and even video game designers. By studying math now, you're preparing yourself for some really cool careers in the future.
# '''Brain Exercise:''' Math exercises your brain and helps make it stronger. It's like a workout for your mind. The more you practice, the better you become at solving all sorts of puzzles and problems, not just in math but in many other subjects too.
# '''Understanding the World:''' Math helps you understand how things work in the world. You can use math to study patterns, solve mysteries, and even predict things. It's like having a special tool to unlock the secrets of the universe.
# '''Achieving Goals:''' Whether you dream of traveling, buying a cool gadget, or becoming a famous artist, math can help you achieve your goals. You'll need math to manage your money, plan trips, or even build amazing things.

So, studying math isn't just about numbers on a page; it's about gaining super skills that will help you in everyday life, open up exciting career possibilities, keep your brain sharp, make you a better problem solver, and help you understand and achieve your dreams. It's like learning the language of the universe!

Furthermore, it may be useful to tell the student:

Math is not taught so you can all become accountants or take up any job in which you simplify equations, math is taught to encourage logical thinking and to develop problem-solving skills. Both of which are practical life skills that all of you will go on to use.&lt;ref&gt;Found on [https://www.quora.com/What-should-be-the-best-answer-if-a-student-tells-us-that-he-she-is-not-good-in-Maths-in-class-a-teachers-perspective Quora].&lt;/ref&gt;

Math problems are like pushups for the brain. When will you use a pushup for its own value? Never! But, every time you do a pushup, you get just a tiny bit stronger. Similarly, every time you try to solve a math problem, you get just a tiny bit better at abstract thought, problem solving, and logical thinking. And those skills will be useful in a myriad of situations throughout your life.

Math is good for your brain. A study from Stanford University&lt;ref&gt;[https://www.bostonglobe.com/ideas/2015/09/17/this-your-brain-math/WMrjRMIyyBmtJCLhb5m2FM/story.html This is your brain on math]. September 12, 2015, Kevin Hartnett, Globe Correspondent.&lt;/ref&gt; indicates that children who are good at math use areas of the brain that also show strong cognitive tasks such as visual attention and decision-making. The study indicates that the same brain regions that help you do math are associated with decision-making and attentional processes.&lt;ref&gt;[https://www.mathnasium.com/steinerranch/news/5-reasons-math-important 5 Reasons math is important]. May 31, 2022, Steiner Ranch,  Mathnasium. &lt;/ref&gt;

Mathematics has evolved over many centuries to help solve problems. Math teaches us to think logically; to identify and state the problem clearly; to plan how to solve the problem; and then to apply the appropriate methods to evaluate and solve the problem.&lt;ref&gt;[https://apuedge.com/why-do-we-study-mathematics Why Do We Study Mathematics?] July 11, 2012, APU Edge Staff.&lt;/ref&gt;

We learn to evaluate and draw conclusions based on our knowledge. We are surrounded by a large number of statistical data and studies. To be a successful student and also an informed citizen, we should be able to evaluate these studies and the data they present quantitatively in order to decide what is true or reasonable. Mathematics help you recognize mistakes in thinking or analysis that we encounter in our lives. 

== Making Math Fun ==
Making learning arithmetic and math fun for young students is essential to foster a positive attitude toward these subjects and encourage their continued exploration.&lt;ref&gt;This section was generated by [[w:ChatGPT|ChatGPT]] responding to the prompt: &quot;Describe a variety of ways we can make learning arithmetic and math fun for young students.&quot;&lt;/ref&gt; Here are various creative and engaging ways to make math enjoyable for kids: 

# '''Hands-On Activities:''' Utilize tangible objects like blocks, counters, or even food items (like candies or fruits) to teach basic math concepts. Students can physically manipulate objects to understand addition, subtraction, multiplication, and division.
# '''Math Games:''' Incorporate games into the learning process. Games such as Bingo, Math Puzzles, and Math Bingo make learning arithmetic enjoyable. Board games like Monopoly or card games like Uno can also reinforce math skills.
# '''Math Apps and Educational Software:''' There is an abundance of interactive math apps and educational software available. Programs like [[w:Prodigy_Education|Prodigy]], [[w:Khan_Academy|Khan Academy]], and educational math games on tablets or computers can provide a fun, interactive learning experience.
# '''Storytelling:''' Integrate math into storytelling. Create math-related stories that young students can relate to. For instance, use characters, settings, and situations to illustrate mathematical problems.
# '''Math in Nature:''' Take students on nature walks or outdoor activities where they can explore patterns, shapes, and numbers in the environment. Identify geometric shapes in leaves or count the petals on a flower.
# '''Math Art:''' Combine math with art. Encourage students to create geometric patterns, [[w:Tessellation|tessellations]], or even math-inspired paintings. This allows for a creative outlet while practicing math skills.
# '''Cooking and Baking:''' Involve students in cooking or baking activities, where they need to measure ingredients and follow recipes. This practical application of math concepts can be both educational and delicious.
# '''Math Challenges and Competitions:''' Organize friendly math competitions or challenges within the classroom. Encourage students to solve math problems or puzzles, and offer rewards or recognition for their efforts.
# '''Math Storybooks:''' Incorporate math-themed storybooks into your curriculum. Books like &quot;The Greedy Triangle&quot; or &quot;One Grain of Rice&quot; can help children understand math concepts through storytelling.
# '''Math in Music:''' Explore the connection between math and music. Introduce rhythm, patterns, and counting in music. Let students play with musical instruments to grasp mathematical concepts.
# '''Math Manipulatives:''' Use math [[Why study math?/using manipulatives|manipulatives]] like fraction blocks, base-ten blocks, and algebra tiles to make abstract concepts more concrete. These tools help students visualize math problems.
# '''Math Challenges and Puzzles:''' Provide students with a variety of math puzzles and brain teasers. Encourage them to solve these challenges as a form of entertainment and mental exercise.
# '''Math Field Trips:''' Organize field trips to places that showcase the practical application of math, such as a construction site, a bank, or a science museum.
# '''Math Role-Play:''' Create scenarios where students play roles that require mathematical skills, such as running a pretend store, calculating change, or measuring ingredients for a &quot;restaurant.&quot;
# '''Peer Teaching:''' Encourage students to teach math concepts to each other. This not only reinforces their own understanding but also promotes teamwork and collaboration.

By using these creative and interactive methods, teachers can help young students develop a strong foundation in arithmetic and math while making the learning process enjoyable and memorable.

== For Teachers ==
Teachers may find the following techniques help students become more interested and better enjoy math:

Not every student enjoys the challenge of arithmetic. Keeping your students interested in what you're teaching in math is a process that takes on various forms for each individual student, so there's no one-size-fits-all answer. The following is a collection of strategies that have been shown to increase students' enthusiasm for arithmetic in any classroom:

'''Use real-world examples:''' Use real world examples to show students how math is relevant in their lives. If you're teaching about addition, for example, ask students what they would have to add together to get 100%. You could also ask them about the price of something and have them figure out what percentage of that price is tax.

'''Use visuals:''' Visuals are also a great way to make math concepts more concrete. You can use pictures, diagrams or graphs to show students how things work or why they should do something in particular.

'''Use manipulatives:''' Manipulatives are physical objects that students can touch, move, and interact with to better understand abstract mathematical ideas. Using manipulatives is a powerful and hands-on approach to teaching elementary math concepts. Here are several ideas for [[Why study math?/using manipulatives|using manipulatives.]]

'''Use interactive games:''' Using interactive games is an engaging and effective way to teach elementary math concepts. These games make learning fun and provide hands-on experiences that can enhance understanding. Here are several ideas for [[/using interactive games/]].

Students may also enjoy these [[Math Adventures|math adventures]].

== For Middle School Students ==
People enjoy studying math for various reasons, and it's different for everyone. Here are some common reasons why some people find math enjoyable:&lt;ref&gt;[[w:ChatGPT|ChatGPT]] generated this section responding to the prompt: &quot;Why do some people enjoy studying math?&quot;&lt;/ref&gt;

# '''Problem-Solving:''' Math is like solving puzzles and riddles. Many people find satisfaction in tackling challenging math problems and coming up with solutions. It's like a mental game or a fun challenge.
# '''Logical and Precise:''' Math is a subject where everything has to make sense and follow a logical pattern. Some people appreciate the precision and clarity that math offers.
# '''Universal Language:''' Math is often called the universal language because it's the same everywhere in the world. People who enjoy traveling or communicating with others from different cultures find math helpful as it transcends language barriers.
# '''Real-Life Applications:''' Many people like math because they can see how it applies to real-life situations. Whether it's calculating discounts when shopping or figuring out travel distances, math is practical and useful.
# '''Creativity:''' While math may seem rigid, there's also room for creativity in finding different approaches to solving problems. Some people enjoy the creativity involved in math.
# '''Sense of Achievement:''' When you solve a challenging math problem or understand a complex concept, it gives you a sense of accomplishment. That feeling of success can be very rewarding and enjoyable.
# '''Career Opportunities:''' Math skills are valuable in many professions, so some people enjoy studying math because it opens up a wide range of career opportunities, from engineering to finance to computer science.
# '''Curiosity:''' Some people are naturally curious and want to understand how things work. Math provides a framework for exploring and understanding the world around us, from the behavior of planets to the patterns in music.
# '''Continuous Learning:''' Math is a subject that offers endless learning opportunities. There's always something new to discover or a more challenging problem to solve, which can be intellectually stimulating.
# '''Sense of Control:''' Math can provide a sense of control over various situations. It allows you to make informed decisions, plan for the future, and have confidence in your abilities.

Ultimately, what makes math enjoyable for someone is highly personal. It could be one or a combination of these factors, or it might be something entirely unique to the individual. The key is to find what aspects of math you personally enjoy and focus on those to make your math learning experience more enjoyable.

== For Older Students ==
The allure of math is a fascinating and often deeply personal experience that captivates many individuals.&lt;ref&gt;[[w:ChatGPT|ChatGPT]] generated this section responding to the prompt: &quot;Describe the allure of math&quot;.&lt;/ref&gt; It's like a hidden treasure waiting to be discovered, and here are some aspects that contribute to its allure:

# '''Puzzle Solving:''' Math is like a never-ending puzzle. Each problem presents a challenge, and the satisfaction of solving it is immensely rewarding. It's like unlocking a secret code or finding the missing piece of a jigsaw puzzle.
# '''Order in Chaos:''' In a world full of complexity and chaos, math provides a sense of order and structure. It's a way to make sense of the universe and understand the underlying patterns that govern the natural world.
# '''Universality:''' Math is a universal language that transcends cultural and linguistic boundaries. It's the same whether you're in New York, Tokyo, or Cairo. This universality connects people worldwide and opens up opportunities for collaboration and communication.
# '''Elegance:''' There is a certain elegance in mathematical concepts and equations. Many mathematicians describe their work as beautiful, and it's easy to see why. The simplicity and symmetry of mathematical ideas can be truly captivating.
# '''Endless Exploration:''' Math is like an uncharted territory with no limits. There are always new problems to explore, new theorems to prove, and new concepts to understand. The sense of continuous discovery is alluring.
# '''Practicality:''' Math is incredibly practical. It's used in various aspects of everyday life, from budgeting and cooking to building bridges and sending rockets into space. Knowing math can make you feel more empowered and capable.
# '''Intellectual Challenge:''' For those who enjoy a mental challenge, math provides an intellectual playground. It encourages critical thinking, problem-solving, and creativity in finding innovative solutions.
# '''Historical Significance:''' Math has played a crucial role in shaping human history. From ancient civilizations to modern technology, math has been at the heart of many scientific and technological advancements.
# '''Career Opportunities:''' Math skills are in high demand across numerous professions, leading to exciting career opportunities. This allure often attracts individuals who see math as a gateway to fulfilling and well-paying careers.
# '''Sense of Achievement:''' Accomplishing mathematical milestones, whether it's mastering multiplication tables or proving a complex theorem, brings a profound sense of achievement and pride.
# '''Influence on Other Fields:''' Math isn't confined to its own realm but has a profound impact on other disciplines like physics, engineering, computer science, and even art and music. The allure of math extends to these interconnected fields.
# '''Community and Collaboration:''' Math enthusiasts often form a close-knit community. Sharing ideas, collaborating on research, and discussing mathematical concepts with like-minded individuals can be a source of great joy.

In essence, the allure of math lies in its ability to engage our minds, provide order in a chaotic world, offer endless exploration, and lead to both personal growth and contributions to society. It's a journey filled with wonder and fascination, drawing people into its enchanting world.

The beauty of math is a concept deeply appreciated by mathematicians, educators, and enthusiasts alike.&lt;ref&gt;[[w:ChatGPT|ChatGPT]] generated this section responding to the prompt: &quot;Describe the beauty of math&quot;.&lt;/ref&gt; It's a beauty that transcends aesthetics and taps into the elegance, symmetry, and profound simplicity underlying mathematical concepts. Here's how math is often described as beautiful:
[[File:Mandel_zoom_04_seehorse_tail.jpg|thumb|Mandel zoom 04 seehorse tail]]

# '''Elegance and Simplicity:''' Many mathematical equations and proofs are astonishingly elegant and simple. They distill complex ideas into concise and beautiful forms. Examples include [[w:Euler's_identity|Euler's identity]] (e&lt;sup&gt;πi&lt;/sup&gt; + 1 = 0), which combines five fundamental mathematical constants into a single equation, and the [[w:Pythagorean theorem|Pythagorean theorem]] (a&lt;sup&gt;2&lt;/sup&gt; + b&lt;sup&gt;2&lt;/sup&gt; = c&lt;sup&gt;2&lt;/sup&gt;), which relates the sides of a right triangle in a beautifully straightforward manner.
# '''Symmetry:''' Mathematics often involves the exploration of symmetry, both in geometric shapes and abstract concepts. Symmetrical patterns and equations are inherently pleasing to the eye, like the [[Math Adventures/Fibonacci and the Golden Ratio|Fibonacci sequence]] (0, 1, 1, 2, 3, 5, 8, 13, ...) found in many aspects of nature and art.
# '''Unifying Principles:''' Math has a unique ability to unify seemingly unrelated ideas. For instance, calculus elegantly connects the concepts of differentiation and integration, showing how they are two sides of the same coin. This unification is profoundly beautiful.
# '''Patterns and Fractals:''' Math helps us understand and appreciate the intricate patterns found in nature, from the branching of trees to the geometry of snowflakes. [[w:Fractal|Fractals]], such as the [[w:Mandelbrot_set|Mandelbrot set]], reveal stunning complexity emerging from simple equations.
# '''Hidden Order:''' Math often uncovers hidden order within apparent chaos. [[w:Chaos_theory|Chaos theory]], for example, shows that seemingly random systems can have underlying patterns and predictability. This revelation of order is intellectually captivating.
# '''Aesthetic Proofs:''' Mathematicians often seek not just to prove theorems but to find elegant and visually appealing proofs. These proofs are like works of art that convey complex ideas in a beautiful, understandable manner.
# '''Puzzle Solving:''' [[Math Adventures|Mathematical puzzles]] and challenges can be like brain teasers, engaging our minds in playful and creative ways. The beauty lies in the satisfaction of solving these puzzles.
# '''Universal Language:''' Math serves as a universal language that bridges cultures and languages. Its simplicity and universality are beautiful because they foster global communication and collaboration.
# '''Historical Significance:''' The [[w:History_of_mathematics|history of mathematics]] is rich with stories of brilliant minds who made groundbreaking discoveries. Understanding the historical context and the struggle to uncover mathematical truths adds to the beauty of the subject.
# '''Practicality and Utility:''' The beauty of math is not just abstract; it has practical applications in countless fields, from engineering and physics to computer science and economics. Seeing math in action, solving real-world problems, is inherently satisfying.

In summary, the beauty of math lies in its ability to distill complex ideas into elegant simplicity, reveal hidden order, and provide a universal language for understanding and describing the world. It's a beauty that engages our minds, sparks creativity, and invites us to explore the awe-inspiring intricacies of the mathematical universe.

== Further Reading ==
Students who are interested in cultivating interest in mathematics may wish to read these books:

* {{cite book|title=Mathematics, Queen and Servant of Science|last=Bell|first=E. T.|date=January 1, 1988|publisher=Tempus Books|isbn=978-1556151736|pages=462|author-link=w:Eric_Temple_Bell}}

{{subpagesif}}

== References ==
&lt;references/&gt;
{{CourseCat}}
[[Category:Education]]
[[Category:Mathematics]]</text>
      <sha1>gdzcd6asix6t0pqci7y6su4jxpp8vo3</sha1>
    </revision>
    <revision>
      <id>2809861</id>
      <parentid>2809839</parentid>
      <timestamp>2026-05-17T04:30:32Z</timestamp>
      <contributor>
        <username>NguoiDungKhongDinhDanh</username>
        <id>2922842</id>
      </contributor>
      <minor />
      <comment>Reverted edit by [[Special:Contributions/HenriPittier|HenriPittier]] ([[User_talk:HenriPittier|talk]]) to last version by [[User:Atcovi|Atcovi]] using [[Wikiversity:Rollback|rollback]]</comment>
      <origin>2787795</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="21328" sha1="7qgkzj5k6k67dx87jex3dg7cbcyobvh" xml:space="preserve">{{AI-generated}}
It is not unusual for young students, perhaps while struggling to memorize the multiplication tables, to ask “Why should I study math?  
[[File:Animated gif version of SVG of rearrangement proof of Pythagorean theorem.gif|thumb|The rearrangement proof of Pythagorean theorem]]
As students continue to learn, their curiosity may become stimulated, they may become fascinated by math, and they are drawn to solving math problems. Alternatively, students may decide they are not good at math, or they dislike math, or they will never need to know math. 

This attitude of liking or disliking math can develop and solidify at any age and in a variety of contexts. The reasons for studying math presented here are similarly diverse. One reason may be convincing when presented to one student, and may be discouraging, annoying, or even offensive when presented to another student.  

Scan this long list of reasons and select those that are most likely to  appeal to your student. 
{{TOC right | limit|limit=2}}
Here are some good reasons to study math:

== For Young Students ==
Studying math is like learning the superpower of problem-solving!&lt;ref&gt;This section was generated by [[w:ChatGPT|ChatGPT]] responding to the prompt: “What is the best answer I can give to a 5th grade student who asks ‘Why should I study math?’”&lt;/ref&gt; Math helps you understand the world around you and can be incredibly fun. Here are a few cool reasons why you should study math:

# '''Everyday Life:''' Math is everywhere! When you go shopping and want to make sure you have enough money, when you measure ingredients for baking cookies, or when you figure out how much time you have left to play before bedtime, you're using math without even realizing it.
# '''Career Opportunities:''' Many exciting jobs use math, like scientists, engineers, architects, doctors, and even video game designers. By studying math now, you're preparing yourself for some really cool careers in the future.
# '''Brain Exercise:''' Math exercises your brain and helps make it stronger. It's like a workout for your mind. The more you practice, the better you become at solving all sorts of puzzles and problems, not just in math but in many other subjects too.
# '''Understanding the World:''' Math helps you understand how things work in the world. You can use math to study patterns, solve mysteries, and even predict things. It's like having a special tool to unlock the secrets of the universe.
# '''Achieving Goals:''' Whether you dream of traveling, buying a cool gadget, or becoming a famous artist, math can help you achieve your goals. You'll need math to manage your money, plan trips, or even build amazing things.

So, studying math isn't just about numbers on a page; it's about gaining super skills that will help you in everyday life, open up exciting career possibilities, keep your brain sharp, make you a better problem solver, and help you understand and achieve your dreams. It's like learning the language of the universe!

Furthermore, it may be useful to tell the student:

Math is not taught so you can all become accountants or take up any job in which you simplify equations, math is taught to encourage logical thinking and to develop problem-solving skills. Both of which are practical life skills that all of you will go on to use.&lt;ref&gt;Found on [https://www.quora.com/What-should-be-the-best-answer-if-a-student-tells-us-that-he-she-is-not-good-in-Maths-in-class-a-teachers-perspective Quora].&lt;/ref&gt;

Math problems are like pushups for the brain. When will you use a pushup for its own value? Never! But, every time you do a pushup, you get just a tiny bit stronger. Similarly, every time you try to solve a math problem, you get just a tiny bit better at abstract thought, problem solving, and logical thinking. And those skills will be useful in a myriad of situations throughout your life.

Math is good for your brain. A study from Stanford University&lt;ref&gt;[https://www.bostonglobe.com/ideas/2015/09/17/this-your-brain-math/WMrjRMIyyBmtJCLhb5m2FM/story.html This is your brain on math]. September 12, 2015, Kevin Hartnett, Globe Correspondent.&lt;/ref&gt; indicates that children who are good at math use areas of the brain that also show strong cognitive tasks such as visual attention and decision-making. The study indicates that the same brain regions that help you do math are associated with decision-making and attentional processes.&lt;ref&gt;[https://www.mathnasium.com/steinerranch/news/5-reasons-math-important 5 Reasons math is important]. May 31, 2022, Steiner Ranch,  Mathnasium. &lt;/ref&gt;

Mathematics has evolved over many centuries to help solve problems. Math teaches us to think logically; to identify and state the problem clearly; to plan how to solve the problem; and then to apply the appropriate methods to evaluate and solve the problem.&lt;ref&gt;[https://apuedge.com/why-do-we-study-mathematics Why Do We Study Mathematics?] July 11, 2012, APU Edge Staff.&lt;/ref&gt;

We learn to evaluate and draw conclusions based on our knowledge. We are surrounded by a large number of statistical data and studies. To be a successful student and also an informed citizen, we should be able to evaluate these studies and the data they present quantitatively in order to decide what is true or reasonable. Mathematics help you recognize mistakes in thinking or analysis that we encounter in our lives. 

== Making Math Fun ==
Making learning arithmetic and math fun for young students is essential to foster a positive attitude toward these subjects and encourage their continued exploration.&lt;ref&gt;This section was generated by [[w:ChatGPT|ChatGPT]] responding to the prompt: &quot;Describe a variety of ways we can make learning arithmetic and math fun for young students.&quot;&lt;/ref&gt; Here are various creative and engaging ways to make math enjoyable for kids: 

# '''Hands-On Activities:''' Utilize tangible objects like blocks, counters, or even food items (like candies or fruits) to teach basic math concepts. Students can physically manipulate objects to understand addition, subtraction, multiplication, and division.
# '''Math Games:''' Incorporate games into the learning process. Games such as Bingo, Math Puzzles, and Math Bingo make learning arithmetic enjoyable. Board games like Monopoly or card games like Uno can also reinforce math skills.
# '''Math Apps and Educational Software:''' There is an abundance of interactive math apps and educational software available. Programs like [[w:Prodigy_Education|Prodigy]], [[w:Khan_Academy|Khan Academy]], and educational math games on tablets or computers can provide a fun, interactive learning experience.
# '''Storytelling:''' Integrate math into storytelling. Create math-related stories that young students can relate to. For instance, use characters, settings, and situations to illustrate mathematical problems.
# '''Math in Nature:''' Take students on nature walks or outdoor activities where they can explore patterns, shapes, and numbers in the environment. Identify geometric shapes in leaves or count the petals on a flower.
# '''Math Art:''' Combine math with art. Encourage students to create geometric patterns, [[w:Tessellation|tessellations]], or even math-inspired paintings. This allows for a creative outlet while practicing math skills.
# '''Cooking and Baking:''' Involve students in cooking or baking activities, where they need to measure ingredients and follow recipes. This practical application of math concepts can be both educational and delicious.
# '''Math Challenges and Competitions:''' Organize friendly math competitions or challenges within the classroom. Encourage students to solve math problems or puzzles, and offer rewards or recognition for their efforts.
# '''Math Storybooks:''' Incorporate math-themed storybooks into your curriculum. Books like &quot;The Greedy Triangle&quot; or &quot;One Grain of Rice&quot; can help children understand math concepts through storytelling.
# '''Math in Music:''' Explore the connection between math and music. Introduce rhythm, patterns, and counting in music. Let students play with musical instruments to grasp mathematical concepts.
# '''Math Manipulatives:''' Use math [[Why study math?/using manipulatives|manipulatives]] like fraction blocks, base-ten blocks, and algebra tiles to make abstract concepts more concrete. These tools help students visualize math problems.
# '''Math Challenges and Puzzles:''' Provide students with a variety of math puzzles and brain teasers. Encourage them to solve these challenges as a form of entertainment and mental exercise.
# '''Math Field Trips:''' Organize field trips to places that showcase the practical application of math, such as a construction site, a bank, or a science museum.
# '''Math Role-Play:''' Create scenarios where students play roles that require mathematical skills, such as running a pretend store, calculating change, or measuring ingredients for a &quot;restaurant.&quot;
# '''Peer Teaching:''' Encourage students to teach math concepts to each other. This not only reinforces their own understanding but also promotes teamwork and collaboration.

By using these creative and interactive methods, teachers can help young students develop a strong foundation in arithmetic and math while making the learning process enjoyable and memorable.

== For Teachers ==
Teachers may find the following techniques help students become more interested and better enjoy math:

Not every student enjoys the challenge of arithmetic. Keeping your students interested in what you're teaching in math is a process that takes on various forms for each individual student, so there's no one-size-fits-all answer. The following is a collection of strategies that have been shown to increase students' enthusiasm for arithmetic in any classroom:

'''Use real-world examples:''' Use real world examples to show students how math is relevant in their lives. If you're teaching about addition, for example, ask students what they would have to add together to get 100%. You could also ask them about the price of something and have them figure out what percentage of that price is tax.

'''Use visuals:''' Visuals are also a great way to make math concepts more concrete. You can use pictures, diagrams or graphs to show students how things work or why they should do something in particular.

'''Use manipulatives:''' Manipulatives are physical objects that students can touch, move, and interact with to better understand abstract mathematical ideas. Using manipulatives is a powerful and hands-on approach to teaching elementary math concepts. Here are several ideas for [[Why study math?/using manipulatives|using manipulatives.]]

'''Use interactive games:''' Using interactive games is an engaging and effective way to teach elementary math concepts. These games make learning fun and provide hands-on experiences that can enhance understanding. Here are several ideas for [[/using interactive games/]].

Students may also enjoy these [[Math Adventures|math adventures]].

== For Middle School Students ==
People enjoy studying math for various reasons, and it's different for everyone. Here are some common reasons why some people find math enjoyable:&lt;ref&gt;[[w:ChatGPT|ChatGPT]] generated this section responding to the prompt: &quot;Why do some people enjoy studying math?&quot;&lt;/ref&gt;

# '''Problem-Solving:''' Math is like solving puzzles and riddles. Many people find satisfaction in tackling challenging math problems and coming up with solutions. It's like a mental game or a fun challenge.
# '''Logical and Precise:''' Math is a subject where everything has to make sense and follow a logical pattern. Some people appreciate the precision and clarity that math offers.
# '''Universal Language:''' Math is often called the universal language because it's the same everywhere in the world. People who enjoy traveling or communicating with others from different cultures find math helpful as it transcends language barriers.
# '''Real-Life Applications:''' Many people like math because they can see how it applies to real-life situations. Whether it's calculating discounts when shopping or figuring out travel distances, math is practical and useful.
# '''Creativity:''' While math may seem rigid, there's also room for creativity in finding different approaches to solving problems. Some people enjoy the creativity involved in math.
# '''Sense of Achievement:''' When you solve a challenging math problem or understand a complex concept, it gives you a sense of accomplishment. That feeling of success can be very rewarding and enjoyable.
# '''Career Opportunities:''' Math skills are valuable in many professions, so some people enjoy studying math because it opens up a wide range of career opportunities, from engineering to finance to computer science.
# '''Curiosity:''' Some people are naturally curious and want to understand how things work. Math provides a framework for exploring and understanding the world around us, from the behavior of planets to the patterns in music.
# '''Continuous Learning:''' Math is a subject that offers endless learning opportunities. There's always something new to discover or a more challenging problem to solve, which can be intellectually stimulating.
# '''Sense of Control:''' Math can provide a sense of control over various situations. It allows you to make informed decisions, plan for the future, and have confidence in your abilities.

Ultimately, what makes math enjoyable for someone is highly personal. It could be one or a combination of these factors, or it might be something entirely unique to the individual. The key is to find what aspects of math you personally enjoy and focus on those to make your math learning experience more enjoyable.

== For Older Students ==
The allure of math is a fascinating and often deeply personal experience that captivates many individuals.&lt;ref&gt;[[w:ChatGPT|ChatGPT]] generated this section responding to the prompt: &quot;Describe the allure of math&quot;.&lt;/ref&gt; It's like a hidden treasure waiting to be discovered, and here are some aspects that contribute to its allure:

# '''Puzzle Solving:''' Math is like a never-ending puzzle. Each problem presents a challenge, and the satisfaction of solving it is immensely rewarding. It's like unlocking a secret code or finding the missing piece of a jigsaw puzzle.
# '''Order in Chaos:''' In a world full of complexity and chaos, math provides a sense of order and structure. It's a way to make sense of the universe and understand the underlying patterns that govern the natural world.
# '''Universality:''' Math is a universal language that transcends cultural and linguistic boundaries. It's the same whether you're in New York, Tokyo, or Cairo. This universality connects people worldwide and opens up opportunities for collaboration and communication.
# '''Elegance:''' There is a certain elegance in mathematical concepts and equations. Many mathematicians describe their work as beautiful, and it's easy to see why. The simplicity and symmetry of mathematical ideas can be truly captivating.
# '''Endless Exploration:''' Math is like an uncharted territory with no limits. There are always new problems to explore, new theorems to prove, and new concepts to understand. The sense of continuous discovery is alluring.
# '''Practicality:''' Math is incredibly practical. It's used in various aspects of everyday life, from budgeting and cooking to building bridges and sending rockets into space. Knowing math can make you feel more empowered and capable.
# '''Intellectual Challenge:''' For those who enjoy a mental challenge, math provides an intellectual playground. It encourages critical thinking, problem-solving, and creativity in finding innovative solutions.
# '''Historical Significance:''' Math has played a crucial role in shaping human history. From ancient civilizations to modern technology, math has been at the heart of many scientific and technological advancements.
# '''Career Opportunities:''' Math skills are in high demand across numerous professions, leading to exciting career opportunities. This allure often attracts individuals who see math as a gateway to fulfilling and well-paying careers.
# '''Sense of Achievement:''' Accomplishing mathematical milestones, whether it's mastering multiplication tables or proving a complex theorem, brings a profound sense of achievement and pride.
# '''Influence on Other Fields:''' Math isn't confined to its own realm but has a profound impact on other disciplines like physics, engineering, computer science, and even art and music. The allure of math extends to these interconnected fields.
# '''Community and Collaboration:''' Math enthusiasts often form a close-knit community. Sharing ideas, collaborating on research, and discussing mathematical concepts with like-minded individuals can be a source of great joy.

In essence, the allure of math lies in its ability to engage our minds, provide order in a chaotic world, offer endless exploration, and lead to both personal growth and contributions to society. It's a journey filled with wonder and fascination, drawing people into its enchanting world.

The beauty of math is a concept deeply appreciated by mathematicians, educators, and enthusiasts alike.&lt;ref&gt;[[w:ChatGPT|ChatGPT]] generated this section responding to the prompt: &quot;Describe the beauty of math&quot;.&lt;/ref&gt; It's a beauty that transcends aesthetics and taps into the elegance, symmetry, and profound simplicity underlying mathematical concepts. Here's how math is often described as beautiful:
[[File:Mandel_zoom_04_seehorse_tail.jpg|thumb|Mandel zoom 04 seehorse tail]]

# '''Elegance and Simplicity:''' Many mathematical equations and proofs are astonishingly elegant and simple. They distill complex ideas into concise and beautiful forms. Examples include [[w:Euler's_identity|Euler's identity]] (e&lt;sup&gt;πi&lt;/sup&gt; + 1 = 0), which combines five fundamental mathematical constants into a single equation, and the [[w:Pythagorean theorem|Pythagorean theorem]] (a&lt;sup&gt;2&lt;/sup&gt; + b&lt;sup&gt;2&lt;/sup&gt; = c&lt;sup&gt;2&lt;/sup&gt;), which relates the sides of a right triangle in a beautifully straightforward manner.
# '''Symmetry:''' Mathematics often involves the exploration of symmetry, both in geometric shapes and abstract concepts. Symmetrical patterns and equations are inherently pleasing to the eye, like the [[Math Adventures/Fibonacci and the Golden Ratio|Fibonacci sequence]] (0, 1, 1, 2, 3, 5, 8, 13, ...) found in many aspects of nature and art.
# '''Unifying Principles:''' Math has a unique ability to unify seemingly unrelated ideas. For instance, calculus elegantly connects the concepts of differentiation and integration, showing how they are two sides of the same coin. This unification is profoundly beautiful.
# '''Patterns and Fractals:''' Math helps us understand and appreciate the intricate patterns found in nature, from the branching of trees to the geometry of snowflakes. [[w:Fractal|Fractals]], such as the [[w:Mandelbrot_set|Mandelbrot set]], reveal stunning complexity emerging from simple equations.
# '''Hidden Order:''' Math often uncovers hidden order within apparent chaos. [[w:Chaos_theory|Chaos theory]], for example, shows that seemingly random systems can have underlying patterns and predictability. This revelation of order is intellectually captivating.
# '''Aesthetic Proofs:''' Mathematicians often seek not just to prove theorems but to find elegant and visually appealing proofs. These proofs are like works of art that convey complex ideas in a beautiful, understandable manner.
# '''Puzzle Solving:''' [[Math Adventures|Mathematical puzzles]] and challenges can be like brain teasers, engaging our minds in playful and creative ways. The beauty lies in the satisfaction of solving these puzzles.
# '''Universal Language:''' Math serves as a universal language that bridges cultures and languages. Its simplicity and universality are beautiful because they foster global communication and collaboration.
# '''Historical Significance:''' The [[w:History_of_mathematics|history of mathematics]] is rich with stories of brilliant minds who made groundbreaking discoveries. Understanding the historical context and the struggle to uncover mathematical truths adds to the beauty of the subject.
# '''Practicality and Utility:''' The beauty of math is not just abstract; it has practical applications in countless fields, from engineering and physics to computer science and economics. Seeing math in action, solving real-world problems, is inherently satisfying.

In summary, the beauty of math lies in its ability to distill complex ideas into elegant simplicity, reveal hidden order, and provide a universal language for understanding and describing the world. It's a beauty that engages our minds, sparks creativity, and invites us to explore the awe-inspiring intricacies of the mathematical universe.

== Further Reading ==
Students who are interested in cultivating interest in mathematics may wish to read these books:

* {{cite book|title=Mathematics, Queen and Servant of Science|last=Bell|first=E. T.|date=January 1, 1988|publisher=Tempus Books|isbn=978-1556151736|pages=462|author-link=w:Eric_Temple_Bell}}

{{subpagesif}}

== References ==
&lt;references/&gt;
{{CourseCat}}
[[Category:Education]]
[[Category:Mathematics]]</text>
      <sha1>7qgkzj5k6k67dx87jex3dg7cbcyobvh</sha1>
    </revision>
  </page>
  <page>
    <title>Korean/Words/Table</title>
    <ns>0</ns>
    <id>300260</id>
    <revision>
      <id>2809891</id>
      <parentid>2746141</parentid>
      <timestamp>2026-05-17T10:24:17Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <comment>- prod (this page is part of a broader set of files nominated for deletion)</comment>
      <origin>2809891</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="9919" sha1="289vfrh24utxt6re4y61hw3cowoy11g" xml:space="preserve">{| class=wikitable width=100% 
|-
! Korean 
! Roman  
! Meaning 
! European 
! Remarks 
|- valign=top
| 가!   
| ga   
| go!   
| Dutch ''ga!''   
|  
|- valign=top
| 까까
| qaqa
| cake
| Icelandic, Swedish ''kaka''
|  
|- valign=top
| 갈래   
| gallai   
| division, fork, a set of rows    
| English ''galley''
# old warship with rows of oars 
# kitchen of a vessel or aircraft with rows of cooks 
# oblong tray holding rows of types 
# proof sheet with rows of corrections 
| 
|- valign=top
| 겸(兼)
| gjem
| cum 
| Latin ''cum''
| 
|- valign=top
| 골개
| golgai
| stream in the gorge
| 
| cf. English ''gorge'' 
|- valign=top 
| 나귀 
| nagui 
| nag, pony, ass
| Middle English ''nagge''
| 
|- valign=top
| 난쟁이 
| nanzaing`i
| dwarf
| French ''nain'', Greek: νάνος (nános), Italian ''nano'', Latin ''nānus''
| 
|- valign=top
| 낮다
| nazda 
| nether, low 
| Dutch ''neder''
| 
|- valign=top
| 내   
| nai   
| rivlet   
| Czech ''naj'' of ''Dunaj'', Hungarian ''na'' of ''Duna'' &quot;Danube&quot; &lt;br&gt; French ''ne'' of ''Seine'', Spanish ''na'' of ''Sena''   
|   
|- valign=top
| 노래 &lt;ref&gt; from 로래(rorai) &lt;/ref&gt;   
| norai   
| song   
|     
| cf. German ''Lorelei'' or ''Lore Ley'' &lt;ref&gt; More likely meaning &quot;singing rock&quot; than traditional &quot;murmuring rock,&quot; since the siren of Germanic mythology sat on the '''rock''' on the Rhine riverbank and with her great beauty and delicious '''song''' seduced the navigators causing frequent ship-wrecks. &lt;/ref&gt;   
|- valign=top
| 노루  
| noru 
| roe deer 
| Danish, Norwegian ''rådyr'' 
| 
|- valign=top
| 누나   
| nuna   
| older sister of male   
| English ''nun'', Slovene ''nuna'', Swedish ''nunna''   
| 
|- valign=top
| 담 &lt;ref name=dam&gt; 깊은 해자 높은 담 싸고 [교학고어사전 p.1469] &lt;/ref&gt; &lt;ref&gt; cf. 댐 (loaned) &lt;/ref&gt; &lt;br&gt; See also: 둑 
| dam 
| dam, dyke   
| Dutch ''dam'', German ''Damm'', &lt;br&gt; Estonian ''Tamm'', Russian  да́мба (dámba)   
| cf. 댐(daim) 
&lt;!--
|- valign=top 
| 닿다 
| dahda
| to touch
| English ''touch'', French ''toucher'', Latin taxō''
| 
--&gt;  
|- valign=top
| 덕(德) &lt;ref&gt; 
* 덕(德)이란 곧 인간이 자연[天]으로부터 얻는 것[得] (고등학교 철학 p. 253)
* 노자에 의하면, 도는 만물을 생성시키는 근원으로서, 이 생성과정에서 각 사물은 근원적인 도에서 얻어 가지는 것[得也]이 있는데, 이것을 덕(德)이라 하였다. 덕이라 하면 인의(仁義)의 덕만 생각하기 쉬운데, 그것은 유가의 경우에 인간만 가지고 있는 덕이다. 그런데 노자에 있어서는 인의가 인위적인 것이라 하여 부정되었다... 그것은 만물이 도에서 부여받은 어떤 자연스런 능력, 힘을 뜻한다. 모든 만물 속에는 도와 덕이 있다. 만물이 도에의해서 생기고[生] 덕에 의해서 이루어지기[成] 때문이다. (고등학교 철학 p. 292)
&lt;/ref&gt; &lt;br&gt; cf. 득(得) 
| deg
| virtue &lt;ref&gt; From Latin ''virtus'' &quot;manliness, bravery,&quot; while German ''Tugend'' and the like likely have come from Taoism. &lt;/ref&gt; 
| German ''Tugend''
| cf. German ''taugen'', OEnglish ''dugan'' &quot;to be fit, of use&quot;
|- valign=top
| 두다
| duda
| to put, place 
| English ''do'', Danish ''du'', Dutch ''doen'', German ''tun''
| 
|- valign=top
| 둑 &lt;br&gt; See also: 담    
| dug   
| dyke   
| Dutch ''dijk'', German ''Deich'', &lt;br&gt; Estonian ''Tamm'', Russian  да́мба (dámba)    
|     
|- valign=top
| 둔   
| dun   
| dun, dune   
| English ''dun'' from Irish ''dún'' or Scottish Gaelic ''dùn'' &quot;fort&quot; &lt;br&gt; English ''dune'', Dutch ''duin'', German ''Düne''   
| 
|- valign=top
| 들 &lt;br&gt; See also: 벌 
| dyl
| dale
| Danish, Dutch ''dal'', German ''Tal''
| 
|- valign=top
| 뜻   
| Tys   
| meaning   
| Danish ''tyd'' of ''betydning'', German ''deut'' of ''Bedeutung''   
| 
   
|- valign=top
| 마니다* &lt;ref&gt; originally, ᄆᆞ니다 &lt;/ref&gt;   
| manida   
| to handle   
| OFrench ''manier''   
|     
|- valign=top
| 말[言]  
| mal   
| language   
| ONorse ''mál''   
| Both are long vowels, hence exactly match!   
|- valign=top 
| 말[馬]   
| mal   
| horse   
| ONorse ''marr''  
|  cf. English ''mare'', ''mule'', OEnglish ''mūl''   
|- valign=top
| 말-   
| mal    
| horse-   
| English ''horse-''(animal)   
| horse-ant, horse-bee* cf. Yiddish ''ferdbin'', &lt;br&gt; horse-fly, horse-leech, horse-mackerel   
|- valign=top
| 말개미   
| mal-gaimi   
| horse-ant   
| German ''Pferdeameise''   
|     
|- valign=top
| 말거머리   
| mal-gemeri   
| horse-leech   
| German ''Pferdeegel''   
|    
|- valign=top
|  말벌   
| mal-bel   
| wasp or hornet   
| English ''horse-bee''*, Hungarian ''lódarázs'' &lt;br&gt; Yiddish ''ferdbin'' likely from German ''Pferdebin''*    
|     
|- valign=top
| 말파리   
| mal-pari   
| horse-ant   
| German ''Pferdebremse''     
|   
|- valign=top
| 말뫼* &lt;ref&gt; ᄆᆞᆯ 뫼 &lt;/ref&gt;    
| malmoi   
| huge tumulus   
| Swedish ''Malmö'' &lt;ref&gt; Said to mean &quot;pile of gravels.&quot; cf. 돌무지-무덤: 시신을 넣은 석곽(石槨) 위에 바로 흙을 덮지 않고 돌을 쌓아 올린 무덤. &lt;/ref&gt;   
|     
|- valign=top
| 말[斗]   
| mal   
| the biggest volume &lt;br&gt; mesurement tool   
| ONorse ''mál''   
|     
|- valign=top
| 말(末)   
| mal   
| coarse   
| English ''horse-''(plant)   
| horse-bean, horse-chestnut, horse-mint, &lt;br&gt; horse-nettle, horse-raddish, horse-weed   
|- valign=top
| 말밤* &lt;ref&gt; cf. 말율(末栗) &quot;water chestnut&quot; or &quot;water caltrop&quot;  &lt;/ref&gt;   
| mal-bam   
| horse-chestnut   
| German ''Rosskastanie'', Norwegian ''hestekastanje''   
| cf. French ''marronnier''   
|- valign=top
| 맑다, 말갛다
| malgda, malgahda
| to be clear
| cf. English ''morning'', German ''Morgen''  
| cf. English ''Margaret'' from Latin ''margarita'' &quot;pearl&quot;
|- valign=top
| 모으다 from 뫃다 &lt;br&gt; See also: 모이다
| movda
| to gather, collect
| 
| cf. English ''moat'', also ''motte'' &lt;ref&gt;It sounds like a mystery that a body of water is etymologically related with a mound of earth. Yet both are commonly a collection! &lt;/ref&gt;
|- valign=top
| 모이다, 뫼다 &lt;br&gt; See also: 모으다
| mojida, moida  
| to meet
| Danish ''møde'', Norwegian ''møte'', Icelandic ''mæta'', Swedish ''möta'' 
|  
|- valign=top
| 못 &lt;br&gt; See also: 해자   
| mos   
| pond, moat   
| English ''moat'', Irish ''móta''   
| 
|- valign=top
| 밥
| bab
| meal, cooked rice
| 
| cf. English, Dutch ''pap'', German ''Pappe''
|- valign=top
| 벌 &lt;br&gt; See also: 들 
| bel
| vale, valley
| French ''val'', Italian ''valle'' 
| 
|- valign=top
| 불   
| bul   
| fire   
| Danish ''fyr'', Dutch ''vuur''   
|     
|- valign=top
| 삽
| sab
| shovel
| Dutch ''schop'', German ''Schüppe'', Norwegian ''skuffe''  
| 
|- valign=top
| 술 
| sul
| liqor
| OEnglish ''sūr'', ODutch ''sūr'', OHGerman ''sūr'' &quot;sour&quot;
| 
|- valign=top
| 어느
| eny
| any
| Dutch ''enig''
| 
|- valign=top
| 엮은 
| yeq'yn
| combined together
| Latin ''iugus'' &quot;combined together&quot;
| cf. English ''yoke'' 
|- valign=top
| 오르다   
| oryda    
| to rise   
| Latin ''orior'', AGreek ὄρνῡμῐ (órnūmi)   
| 
|- valign=top
|
* 오름 &lt;ref&gt; Jeju dialect &lt;/ref&gt;  
| orym   
| mount   
| Greek όρος (óros)   
| 
|- valign=top
| 
* 오른 vs 옳은 
| oryn vs olh'yn
| '''right''': &lt;br&gt; &quot;righthand vs &quot;complying with justice&quot; 
| 
| cf. 바른{baryn) &lt;br&gt; &quot;righthand&quot; vs &quot;complying with justice&quot; 
|- valign=top
| 올레 &lt;ref&gt; 길에서 집까지 연결된 아주 좁은 골목 비슷한 길. 제주 방언. &lt;/ref&gt;
| olle
| alley
| French ''allée'' Estonian ''allee''
|   
|- valign=top
| 올배미
| olbaimi
| owl
| Dutch ''uil'', German ''Eule'' 
| 
|- valign=top
| 왕게(王게)
| wanggei
| king crab 
| German ''Königskrabben'', Finnish ''kuningasrapu''
| 
|- valign=top
| 왜가리
| waigari
| heron
| OHGerman ''heigaro'', Icelandic ''hegri''
| 
|- valign=top
| 우리
| uri
| we, our, us 
| MEnglish ''ure'' &quot;our&quot;
| 
|- valign=top
| 이운 from ㅇㅣᄫㅡㄴ &lt;ref&gt; pp. of 이울다 from ㅇㅣᄫㅡㄹㄷㅏ &quot;to wane, wither, fade&quot; &lt;/ref&gt;
| iun, ivyn
| waned, faded
| cf. English ''evening''
| See also 맑다 &quot;to be clear&quot; &lt;br&gt; cf. English ''morning'', German ''Morgen'' 
|- valign=top
| 입
| ib
| mouth, lips
| cf. English ''lip'', Danish ''læbe'', Latin ''labium''
| 
|- valign=top
| 잎
| ip
| leaf
| cf. English ''leaf'', German ''Laube''
| cf. 입 English ''lip'', Danish ''læbe''
|- valign=top
| 잉걸
| inggel
| ablazing charcoal
| cf. English ''ingle'' &quot;open fireplace&quot;
| cf. Englsih ''inglenook'' &quot;chimney corner&quot; &lt;br&gt; or &quot;nook besides open fireplace&quot;  
|- valign=top
| 자벌레 &lt;ref&gt; Literally, &quot;measure worm&quot; &lt;/ref&gt;
| zabellei
| measurig worm
| Finnish ''mittarimato''
| 
|- valign=top
| 지렁이 &lt;ref&gt; Literally, &quot;earth worm&quot; &lt;/ref&gt;
| zireng`i
| earth worm, rain worm
| Dutch ''aardworm''
| 
|- valign=top
| 치우 &lt;ref&gt; Likely from 탸우*(tiu)&lt;/ref&gt;
| ciu
| Tiw
| OEnglish ''Tīw'', German god of war  
| cf. Tuesday, literally, Tiw's day 
|- valign=top
| 텽집(廳집) &lt;ref&gt;Obsolete Sino-Korean&lt;/ref&gt; &lt;ref&gt; Mars Thincsus means &quot;Mars of the Thing,&quot; literally, &quot;Tiw of the Thing&quot;. &lt;/ref&gt;
| tyengzib 
| Thingstead, literally, Thinghouse 
| Danish, Norwegian, Swedish ''tinghus'', Icelandic ''þinghús'' 
| cf. English, German ''Thing'', Dutch ''Ding'', Norwegian, Swedish ''Ting'' 

|- valign=top
| 풀무   
| pulmu   
| bellows &lt;ref&gt; (''archaic'') lung &lt;/ref&gt;   
| Latin ''pulmo'' &quot;lung&quot;    
| 
|- valign=top
| 품다 &lt;ref&gt;괴어 있는 물을 계속해서 많이 푸다.&lt;/ref&gt;
| pumda
| to dip, pump
| Dutch ''pompen'', German ''pumpen''
| 
|- valign=top
| 해자 &lt;br&gt; See also: 못     
| haiza   
| moat, boundary   
| Dutch ''haag'' &quot;fence, enclosed area&quot; &lt;br&gt; Dutch ''Den Haag'' &quot;The Hague&quot; or '' 's-Gravenhage'' &lt;ref&gt; literally, &quot;the Count's hedge or enclosed hunting grounds&quot; &lt;/ref&gt;  
| cf. English ''hedge''   
&lt;!--
|- valign=top
| 
| 
| 
| 
|  
--&gt;
|}</text>
      <sha1>289vfrh24utxt6re4y61hw3cowoy11g</sha1>
    </revision>
  </page>
  <page>
    <title>Pedophilia: Innate or Learned?</title>
    <ns>0</ns>
    <id>313569</id>
    <revision>
      <id>2809838</id>
      <parentid>2715415</parentid>
      <timestamp>2026-05-17T03:53:26Z</timestamp>
      <contributor>
        <username>HenriPittier</username>
        <id>3076895</id>
      </contributor>
      <origin>2809838</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="11942" sha1="539f5s9k8mvfa3uxp211gq3gm93tjmj" xml:space="preserve">{{Italic title}}
{{Tertiary education}}
{{psychology}}
{{complete}}
{{delete}}Pedophilia is the &quot;persistent sexual interest in children (prepubescent)&quot;.&lt;ref&gt;{{Cite journal|last=Seto|first=Michael C.|date=2009-04-01|title=Pedophilia|url=https://www.annualreviews.org/doi/10.1146/annurev.clinpsy.032408.153618|journal=Annual Review of Clinical Psychology|language=en|volume=5|issue=1|pages=391–407|doi=10.1146/annurev.clinpsy.032408.153618|issn=1548-5943}}&lt;/ref&gt; An official diagnosis of [[wikipedia:Pedophilia|pedophilia]], according to the [[wikipedia:ICD-11|International Classification of Diseases]], requires an individual has consistent sexual thoughts, urges, and illusions of children and to have either acted on these urges or be clearly distraught by these feelings. The diagnosee cannot be a child (pre-pubertal) and extreme caution is urged when assessing an adolescent for this disorder.&lt;ref name=&quot;ICD-112&quot;&gt;{{cite web|url=https://icd.who.int/browse11/l-m/en#/http%3a%2f%2fid.who.int%2ficd%2fentity%2f517058174|title=ICD-11 for Mortality and Morbidity Statistics|date=2024|publisher=[[World Health Organization]]/[[ICD-11]]|at=See section 6D32 Pedophilic disorder|access-date=November 6, 2024|quote=Pedophilic disorder is characterized by a sustained, focused, and intense pattern of sexual arousal—as manifested by persistent sexual thoughts, fantasies, urges, or behaviours—involving pre-pubertal children. In addition, in order for Pedophilic Disorder to be diagnosed, the individual must have acted on these thoughts, fantasies or urges or be markedly distressed by them. This diagnosis does not apply to sexual behaviours among pre- or post-pubertal children with peers who are close in age.}}&lt;/ref&gt; Pedophilia is problematic, dangerous, and is a contributing factor behind many sexual crimes committed against children.{{essay}}
Pedophilia is entwined with the [[wikipedia:Nature_versus_nurture|Nature vs. Nurture]] debate in [[criminology]]. The nature vs. nurture debate concerns the source or cause of criminality, especially as one ages into accountability for their behavior. The &quot;nature&quot; aspect puts fault on one's [[wikipedia:Genetic_predisposition|genetic predispositions]]&lt;ref&gt;{{Cite web|url=https://library.fiveable.me/key-terms/introduction-brain-behavior/genetic-predisposition|title=Genetic predisposition - (Intro to Brain and Behavior) - Vocab, Definition, Explanations {{!}} Fiveable|website=library.fiveable.me|access-date=2024-11-07}}&lt;/ref&gt;. On the other hand, the &quot;nurture&quot; aspect is concerned with one's upbringing, living conditions, and environment. Throughout history, several theories have been posed whether nature or nurture cause crime. In this review, two theories will be analyzed and applied regarding pedophilia.[[File:Cesare Lombroso-scan by Alejandro Linconao-2012.jpg|thumb|270x270px|Cesare Lombroso's atavistic theory is not widely accepted today, but laid important foundations for the development of criminology as a whole.]]

==== Nature versus Nurture ====
The first theory is atavism, as applied to the field of criminology (circa 1870) by [[wikipedia:Cesare_Lombroso|Cesare Lombroso]]. He argued criminals possess [[wikipedia:Atavism|atavistic]] anomalies (physical features such as sloping forehead, ears of unusual size, asymmetry of the face, [[wikipedia:Prognathism|prognathism]], excessive length of arms, asymmetry of the cranium) that are passed genetically.&lt;ref name=&quot;:0&quot;&gt;{{Cite journal|last=Ellwood|first=Charles|date=1912-01-01|title=Lombroso's Theory of Crime|url=https://scholarlycommons.law.northwestern.edu/jclc/vol2/iss5/6/|journal=Journal of Criminal Law and Criminology|volume=2|issue=5|pages=716}}&lt;/ref&gt;&lt;ref name=&quot;:1&quot;&gt;{{Cite book|url=https://www.worldcat.org/title/on1285696621|title=Criminology|last=Siegel|first=Larry J.|date=2023|publisher=Cengage|isbn=978-0-357-62474-6|edition=Eighth edition|location=Boston, MA|oclc=on1285696621}}&lt;/ref&gt;&lt;ref&gt;{{Cite journal|last=Mazzarello|first=Paolo|date=2011|title=Cesare Lombroso: an anthropologist between evolution and degeneration|url=https://pubmed.ncbi.nlm.nih.gov/21729591/|journal=Functional Neurology|volume=26|issue=2|pages=97–101|issn=0393-5264|pmc=3814446|pmid=21729591}}&lt;/ref&gt;. Lombroso's [[wikipedia:Eugenics|eugenic]] theories were disapproved throughout Europe (notably by [[wikipedia:Alexandre_Lacassagne|Alexandre Lacassagne]] and [[wikipedia:Charles_Buckman_Goring|Charles Goring]]) because they lacked rigorous statistical comparisons of criminals versus non-criminals. Nonetheless Lombroso laid an important road to studying criminals themselves rather than merely the crime&lt;ref name=&quot;:0&quot; /&gt;.      

On the other hand, the [[wikipedia:Social_learning_theory|social learning theory]] states that people are not inherently criminals but exhibit criminal-like behavior due to their upbringing or [[wikipedia:Social_environment|environment]]. For example, a son who watches his father abuse his mother might do the same later in life when dealing with his significant other.&lt;ref name=&quot;:1&quot; /&gt; Notable psychologists, such as [[w:Albert_Bandura|Albert Bandura]], advocated for this theory, where people perceive the rewards for a crime higher than its consequences. The social learning theory expanded upon the &quot;tremendous complexity of human responsiveness&quot; by adding an additional element to the learning process: learning via rewards and consequences&lt;ref&gt;{{Cite book|title=Social learning theory|last=Bandura|first=Albert|date=1977|publisher=Prentice-Hall|isbn=978-0-13-816751-6|series=Prentice-Hall series in social learning theory|location=Englewood Cliffs, New Jersey}}&lt;/ref&gt;.       

The nature vs. nurture debate in criminology has been a heated topic in the world of psychology and criminology for centuries. A common conclusion is that neither origin is solely responsible for criminal behavior. Criminal behavior is a combination of both nature and nurture done in a very &quot;complex and not yet fully understood [way]&quot;&lt;ref name=&quot;:4&quot; /&gt; which leads to offensive or law-breaking behavior. Some scientists believe that the debate is unhelpful or outdated, while others hesitate that leaning to one-side over the other may fuel [[wikipedia:Bias|bias]]. For example, many people were forced sterile by [[wikipedia:Scientific_racism|scientific racism]]. Alternatively, too much emphasis on social conditions could cease progress for those riddled in poverty or other environmental disadvantages&lt;ref name=&quot;:4&quot;&gt;{{Cite journal|last=Levitt|first=Mairi|date=2013-12-12|title=Perceptions of nature, nurture and behaviour|url=https://lsspjournal.biomedcentral.com/articles/10.1186/2195-7819-9-13|journal=Life Sciences, Society and Policy|volume=9|issue=1|pages=13|doi=10.1186/2195-7819-9-13|issn=2195-7819|pmc=PMC4513026}}&lt;/ref&gt;. 
[[File:Sexualisation model.pdf|left|thumb|300x300px|A model supposing pedophiles are a product of their upbringing. ]]

==== Studies ====
A 2009 study done on the etiology of pedophilia by researcher Juan Antonio Becerra García of the International University of La Rioja found several &quot;structural deteriorations&quot; within brain regions that were essential to sexual development, including a smaller right amygdala (less control over ability to inhibit certain behaviors),  a significant decline of gray matter in the hypothalamus (which leads to a score of neurological issues, including memory loss and other cognitive impairments), and a decline in the activity of the dorsolateral prefrontal cortex (which leads to poor executive functioning)&lt;ref name=&quot;:2&quot;&gt;{{Cite journal|last=Becerra García|first=Juan Antonio|date=2009-01-01|title=Etiology of pedophilia from a neurodevelopmental perspective: markers and brain alterations|url=https://linkinghub.elsevier.com/retrieve/pii/S2173505009700512|journal=Revista de Psiquiatría y Salud Mental (English Edition)|volume=2|issue=4|pages=190–196|doi=10.1016/S2173-5050(09)70051-2|issn=2173-5050}}&lt;/ref&gt;. Another review of the disorder published in 2015 affirmed that other studies conducted on pedophiles found similar findings, including a reduction of inhibition and executive functioning&lt;ref&gt;{{Cite journal|last=Tenbergen|first=Gilian|last2=Wittfoth|first2=Matthias|last3=Frieling|first3=Helge|last4=Ponseti|first4=Jorge|last5=Walter|first5=Martin|last6=Walter|first6=Henrik|last7=Beier|first7=Klaus M.|last8=Schiffer|first8=Boris|last9=Kruger|first9=Tillmann H. C.|date=2015-06-24|title=The Neurobiology and Psychology of Pedophilia: Recent Advances and Challenges|url=http://journal.frontiersin.org/Article/10.3389/fnhum.2015.00344/abstract|journal=Frontiers in Human Neuroscience|volume=9|doi=10.3389/fnhum.2015.00344|issn=1662-5161|pmc=PMC4478390|pmid=26157372}}&lt;/ref&gt;. However, García concluded that there really wasn't a &quot;determinant explanation&quot; for one to become a pedophile. García suggested that the brain abnormalities were brought about during neurodevelopment through &quot;adverse events” but emphasizes that these cognitive shifts in the brain do not render an individual free from such horrific sexual crimes, if one were to act on such impulses&lt;ref name=&quot;:2&quot; /&gt;. 

Another study published in 2018, completed by Dr. Kelly M Babchishin and a team of researchers in Sweden, also mentioned that previous studies have found that pedophiles generally have a lower cognitive ability than non-pedophilic offenders and physical abnormalities that relate to neurological deficiencies&lt;ref name=&quot;:3&quot;&gt;{{Cite journal|last=Babchishin|first=Kelly M.|last2=Seto|first2=Michael C.|last3=Fazel|first3=Seena|last4=Långström|first4=Niklas|date=2019-02-12|title=Are There Early Risk Markers for Pedophilia? A Nationwide Case-Control Study of Child Sexual Exploitation Material Offenders|url=https://www.tandfonline.com/doi/full/10.1080/00224499.2018.1492694|journal=The Journal of Sex Research|language=en|volume=56|issue=2|pages=203–212|doi=10.1080/00224499.2018.1492694|issn=0022-4499|pmc=PMC6225987|pmid=30064261}}&lt;/ref&gt;. However, Dr. Babchishin's study of 655 Swedish men convicted of child sex crimes yielded inconclusive and inconsistent results in pinpointing any &quot;risk markers&quot; for pedophilia, stating that there was no &quot;clear evidence for the specificity of early risk markers for pedophilia&quot;&lt;ref name=&quot;:3&quot; /&gt;. Although there are patterns of neurological deficiencies in pedophiles, no specific trait or gene propels an individual to sexual attraction of children.   

It is a myth that pedophiles arise from sexual abuse; this belief cannot be scientifically substantiated. Criminologist Richard Kelly affirms that a sizeable number of pedophiles &quot;were abused themselves as children&quot; but refuses to support the notion that pedophilia is brought on by past sexual abuses because it is &quot;very difficult&quot; to provide sufficient backing for such claims.&lt;ref&gt;{{Cite journal|last=Richards|first=Kelly|title=Misperceptions about child sex offenders|url=https://doi.org/10.52922/ti258908|journal=Trends &amp; issues in crime and criminal justice|publisher=Australian Institute of Criminology|publication-date=30-09-2011|volume=429|issn=1836-2206}}&lt;/ref&gt;  

==== Conclusion ====
We do not have sufficient evidence to define the cause of pedophilia. Although poor executive functioning may be evident, this does not automatically cause a person to have sexual desires for children. In fact, arguing so would be a [[wikipedia:Questionable_cause|causal fallacy]]. There is also little evidence to support pedophilic attractions are solely brought on by one's environment. Pedophilia seems to be a mix between nature (one's body) and nurture (one's experiences). It is clear that more research should be done in this field.  

== See also ==

* [[w:Pedophilia|Pedophilia]]
* [[w:Child_sexual_abuse|Child sexual abuse]]
* [[w:Age_disparity_in_sexual_relationships|Age disparity in sexual relationships]]
* [[wikipedia:Nature_versus_nurture|Nature versus Nurture]]
* [[Criminology]]

== References ==
{{Reflist}}
[[Category:Atcovi's Work]]</text>
      <sha1>539f5s9k8mvfa3uxp211gq3gm93tjmj</sha1>
    </revision>
    <revision>
      <id>2809862</id>
      <parentid>2809838</parentid>
      <timestamp>2026-05-17T04:30:33Z</timestamp>
      <contributor>
        <username>NguoiDungKhongDinhDanh</username>
        <id>2922842</id>
      </contributor>
      <minor />
      <comment>Reverted edit by [[Special:Contributions/HenriPittier|HenriPittier]] ([[User_talk:HenriPittier|talk]]) to last version by [[User:Atcovi|Atcovi]] using [[Wikiversity:Rollback|rollback]]</comment>
      <origin>2715415</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="11931" sha1="0qjeyfqxdlowxo92qctb8j06126816k" xml:space="preserve">{{Italic title}}
{{Tertiary education}}
{{psychology}}
{{complete}}Pedophilia is the &quot;persistent sexual interest in children (prepubescent)&quot;.&lt;ref&gt;{{Cite journal|last=Seto|first=Michael C.|date=2009-04-01|title=Pedophilia|url=https://www.annualreviews.org/doi/10.1146/annurev.clinpsy.032408.153618|journal=Annual Review of Clinical Psychology|language=en|volume=5|issue=1|pages=391–407|doi=10.1146/annurev.clinpsy.032408.153618|issn=1548-5943}}&lt;/ref&gt; An official diagnosis of [[wikipedia:Pedophilia|pedophilia]], according to the [[wikipedia:ICD-11|International Classification of Diseases]], requires an individual has consistent sexual thoughts, urges, and illusions of children and to have either acted on these urges or be clearly distraught by these feelings. The diagnosee cannot be a child (pre-pubertal) and extreme caution is urged when assessing an adolescent for this disorder.&lt;ref name=&quot;ICD-112&quot;&gt;{{cite web|url=https://icd.who.int/browse11/l-m/en#/http%3a%2f%2fid.who.int%2ficd%2fentity%2f517058174|title=ICD-11 for Mortality and Morbidity Statistics|date=2024|publisher=[[World Health Organization]]/[[ICD-11]]|at=See section 6D32 Pedophilic disorder|access-date=November 6, 2024|quote=Pedophilic disorder is characterized by a sustained, focused, and intense pattern of sexual arousal—as manifested by persistent sexual thoughts, fantasies, urges, or behaviours—involving pre-pubertal children. In addition, in order for Pedophilic Disorder to be diagnosed, the individual must have acted on these thoughts, fantasies or urges or be markedly distressed by them. This diagnosis does not apply to sexual behaviours among pre- or post-pubertal children with peers who are close in age.}}&lt;/ref&gt; Pedophilia is problematic, dangerous, and is a contributing factor behind many sexual crimes committed against children.{{essay}}
Pedophilia is entwined with the [[wikipedia:Nature_versus_nurture|Nature vs. Nurture]] debate in [[criminology]]. The nature vs. nurture debate concerns the source or cause of criminality, especially as one ages into accountability for their behavior. The &quot;nature&quot; aspect puts fault on one's [[wikipedia:Genetic_predisposition|genetic predispositions]]&lt;ref&gt;{{Cite web|url=https://library.fiveable.me/key-terms/introduction-brain-behavior/genetic-predisposition|title=Genetic predisposition - (Intro to Brain and Behavior) - Vocab, Definition, Explanations {{!}} Fiveable|website=library.fiveable.me|access-date=2024-11-07}}&lt;/ref&gt;. On the other hand, the &quot;nurture&quot; aspect is concerned with one's upbringing, living conditions, and environment. Throughout history, several theories have been posed whether nature or nurture cause crime. In this review, two theories will be analyzed and applied regarding pedophilia.[[File:Cesare Lombroso-scan by Alejandro Linconao-2012.jpg|thumb|270x270px|Cesare Lombroso's atavistic theory is not widely accepted today, but laid important foundations for the development of criminology as a whole.]]

==== Nature versus Nurture ====
The first theory is atavism, as applied to the field of criminology (circa 1870) by [[wikipedia:Cesare_Lombroso|Cesare Lombroso]]. He argued criminals possess [[wikipedia:Atavism|atavistic]] anomalies (physical features such as sloping forehead, ears of unusual size, asymmetry of the face, [[wikipedia:Prognathism|prognathism]], excessive length of arms, asymmetry of the cranium) that are passed genetically.&lt;ref name=&quot;:0&quot;&gt;{{Cite journal|last=Ellwood|first=Charles|date=1912-01-01|title=Lombroso's Theory of Crime|url=https://scholarlycommons.law.northwestern.edu/jclc/vol2/iss5/6/|journal=Journal of Criminal Law and Criminology|volume=2|issue=5|pages=716}}&lt;/ref&gt;&lt;ref name=&quot;:1&quot;&gt;{{Cite book|url=https://www.worldcat.org/title/on1285696621|title=Criminology|last=Siegel|first=Larry J.|date=2023|publisher=Cengage|isbn=978-0-357-62474-6|edition=Eighth edition|location=Boston, MA|oclc=on1285696621}}&lt;/ref&gt;&lt;ref&gt;{{Cite journal|last=Mazzarello|first=Paolo|date=2011|title=Cesare Lombroso: an anthropologist between evolution and degeneration|url=https://pubmed.ncbi.nlm.nih.gov/21729591/|journal=Functional Neurology|volume=26|issue=2|pages=97–101|issn=0393-5264|pmc=3814446|pmid=21729591}}&lt;/ref&gt;. Lombroso's [[wikipedia:Eugenics|eugenic]] theories were disapproved throughout Europe (notably by [[wikipedia:Alexandre_Lacassagne|Alexandre Lacassagne]] and [[wikipedia:Charles_Buckman_Goring|Charles Goring]]) because they lacked rigorous statistical comparisons of criminals versus non-criminals. Nonetheless Lombroso laid an important road to studying criminals themselves rather than merely the crime&lt;ref name=&quot;:0&quot; /&gt;.      

On the other hand, the [[wikipedia:Social_learning_theory|social learning theory]] states that people are not inherently criminals but exhibit criminal-like behavior due to their upbringing or [[wikipedia:Social_environment|environment]]. For example, a son who watches his father abuse his mother might do the same later in life when dealing with his significant other.&lt;ref name=&quot;:1&quot; /&gt; Notable psychologists, such as [[w:Albert_Bandura|Albert Bandura]], advocated for this theory, where people perceive the rewards for a crime higher than its consequences. The social learning theory expanded upon the &quot;tremendous complexity of human responsiveness&quot; by adding an additional element to the learning process: learning via rewards and consequences&lt;ref&gt;{{Cite book|title=Social learning theory|last=Bandura|first=Albert|date=1977|publisher=Prentice-Hall|isbn=978-0-13-816751-6|series=Prentice-Hall series in social learning theory|location=Englewood Cliffs, New Jersey}}&lt;/ref&gt;.       

The nature vs. nurture debate in criminology has been a heated topic in the world of psychology and criminology for centuries. A common conclusion is that neither origin is solely responsible for criminal behavior. Criminal behavior is a combination of both nature and nurture done in a very &quot;complex and not yet fully understood [way]&quot;&lt;ref name=&quot;:4&quot; /&gt; which leads to offensive or law-breaking behavior. Some scientists believe that the debate is unhelpful or outdated, while others hesitate that leaning to one-side over the other may fuel [[wikipedia:Bias|bias]]. For example, many people were forced sterile by [[wikipedia:Scientific_racism|scientific racism]]. Alternatively, too much emphasis on social conditions could cease progress for those riddled in poverty or other environmental disadvantages&lt;ref name=&quot;:4&quot;&gt;{{Cite journal|last=Levitt|first=Mairi|date=2013-12-12|title=Perceptions of nature, nurture and behaviour|url=https://lsspjournal.biomedcentral.com/articles/10.1186/2195-7819-9-13|journal=Life Sciences, Society and Policy|volume=9|issue=1|pages=13|doi=10.1186/2195-7819-9-13|issn=2195-7819|pmc=PMC4513026}}&lt;/ref&gt;. 
[[File:Sexualisation model.pdf|left|thumb|300x300px|A model supposing pedophiles are a product of their upbringing. ]]

==== Studies ====
A 2009 study done on the etiology of pedophilia by researcher Juan Antonio Becerra García of the International University of La Rioja found several &quot;structural deteriorations&quot; within brain regions that were essential to sexual development, including a smaller right amygdala (less control over ability to inhibit certain behaviors),  a significant decline of gray matter in the hypothalamus (which leads to a score of neurological issues, including memory loss and other cognitive impairments), and a decline in the activity of the dorsolateral prefrontal cortex (which leads to poor executive functioning)&lt;ref name=&quot;:2&quot;&gt;{{Cite journal|last=Becerra García|first=Juan Antonio|date=2009-01-01|title=Etiology of pedophilia from a neurodevelopmental perspective: markers and brain alterations|url=https://linkinghub.elsevier.com/retrieve/pii/S2173505009700512|journal=Revista de Psiquiatría y Salud Mental (English Edition)|volume=2|issue=4|pages=190–196|doi=10.1016/S2173-5050(09)70051-2|issn=2173-5050}}&lt;/ref&gt;. Another review of the disorder published in 2015 affirmed that other studies conducted on pedophiles found similar findings, including a reduction of inhibition and executive functioning&lt;ref&gt;{{Cite journal|last=Tenbergen|first=Gilian|last2=Wittfoth|first2=Matthias|last3=Frieling|first3=Helge|last4=Ponseti|first4=Jorge|last5=Walter|first5=Martin|last6=Walter|first6=Henrik|last7=Beier|first7=Klaus M.|last8=Schiffer|first8=Boris|last9=Kruger|first9=Tillmann H. C.|date=2015-06-24|title=The Neurobiology and Psychology of Pedophilia: Recent Advances and Challenges|url=http://journal.frontiersin.org/Article/10.3389/fnhum.2015.00344/abstract|journal=Frontiers in Human Neuroscience|volume=9|doi=10.3389/fnhum.2015.00344|issn=1662-5161|pmc=PMC4478390|pmid=26157372}}&lt;/ref&gt;. However, García concluded that there really wasn't a &quot;determinant explanation&quot; for one to become a pedophile. García suggested that the brain abnormalities were brought about during neurodevelopment through &quot;adverse events” but emphasizes that these cognitive shifts in the brain do not render an individual free from such horrific sexual crimes, if one were to act on such impulses&lt;ref name=&quot;:2&quot; /&gt;. 

Another study published in 2018, completed by Dr. Kelly M Babchishin and a team of researchers in Sweden, also mentioned that previous studies have found that pedophiles generally have a lower cognitive ability than non-pedophilic offenders and physical abnormalities that relate to neurological deficiencies&lt;ref name=&quot;:3&quot;&gt;{{Cite journal|last=Babchishin|first=Kelly M.|last2=Seto|first2=Michael C.|last3=Fazel|first3=Seena|last4=Långström|first4=Niklas|date=2019-02-12|title=Are There Early Risk Markers for Pedophilia? A Nationwide Case-Control Study of Child Sexual Exploitation Material Offenders|url=https://www.tandfonline.com/doi/full/10.1080/00224499.2018.1492694|journal=The Journal of Sex Research|language=en|volume=56|issue=2|pages=203–212|doi=10.1080/00224499.2018.1492694|issn=0022-4499|pmc=PMC6225987|pmid=30064261}}&lt;/ref&gt;. However, Dr. Babchishin's study of 655 Swedish men convicted of child sex crimes yielded inconclusive and inconsistent results in pinpointing any &quot;risk markers&quot; for pedophilia, stating that there was no &quot;clear evidence for the specificity of early risk markers for pedophilia&quot;&lt;ref name=&quot;:3&quot; /&gt;. Although there are patterns of neurological deficiencies in pedophiles, no specific trait or gene propels an individual to sexual attraction of children.   

It is a myth that pedophiles arise from sexual abuse; this belief cannot be scientifically substantiated. Criminologist Richard Kelly affirms that a sizeable number of pedophiles &quot;were abused themselves as children&quot; but refuses to support the notion that pedophilia is brought on by past sexual abuses because it is &quot;very difficult&quot; to provide sufficient backing for such claims.&lt;ref&gt;{{Cite journal|last=Richards|first=Kelly|title=Misperceptions about child sex offenders|url=https://doi.org/10.52922/ti258908|journal=Trends &amp; issues in crime and criminal justice|publisher=Australian Institute of Criminology|publication-date=30-09-2011|volume=429|issn=1836-2206}}&lt;/ref&gt;  

==== Conclusion ====
We do not have sufficient evidence to define the cause of pedophilia. Although poor executive functioning may be evident, this does not automatically cause a person to have sexual desires for children. In fact, arguing so would be a [[wikipedia:Questionable_cause|causal fallacy]]. There is also little evidence to support pedophilic attractions are solely brought on by one's environment. Pedophilia seems to be a mix between nature (one's body) and nurture (one's experiences). It is clear that more research should be done in this field.  

== See also ==

* [[w:Pedophilia|Pedophilia]]
* [[w:Child_sexual_abuse|Child sexual abuse]]
* [[w:Age_disparity_in_sexual_relationships|Age disparity in sexual relationships]]
* [[wikipedia:Nature_versus_nurture|Nature versus Nurture]]
* [[Criminology]]

== References ==
{{Reflist}}
[[Category:Atcovi's Work]]</text>
      <sha1>0qjeyfqxdlowxo92qctb8j06126816k</sha1>
    </revision>
  </page>
  <page>
    <title>International Communication Law</title>
    <ns>0</ns>
    <id>317777</id>
    <revision>
      <id>2809752</id>
      <parentid>2809634</parentid>
      <timestamp>2026-05-16T21:02:10Z</timestamp>
      <contributor>
        <username>Mendezre</username>
        <id>3076329</id>
      </contributor>
      <origin>2809752</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="2460" sha1="3ezae3qvxabxczh2ar9p5fbufmwocxh" xml:space="preserve">
{{law}}
{| style=&quot;width:100%; margin-bottom: .6em; -moz-border-radius: 4px; text-align:center; border: 1px solid #50A6C2; background-color:#F0F8FF; padding: .6em .6em .6em .6em;&quot;
|&lt;div style=&quot;font-size:200%;border:none;margin: 0;padding:.1em;color:#000&quot;&gt;'''International Communication Law Learning Project'''&lt;/div&gt;&lt;div style=&quot;top:+0.2em;font-size:150%&quot;&gt;part of the [[School:Law|'''School of Law''']]&lt;/div&gt;
|}
{{SearchWithPrefix}}'''[[Help:Resources by subject|Subject classification]]''': this is a [[Portal:Law|law learning projects]] resource.

'''Class''': International Communication Law

'''Professor''': Juan Carlos Riofrio
[[File:International Communication Law.png|thumb|300x300px]]Welcome to the '''International Communication Law''' Learning Project, part of the [[School:Law|School of Law]]. This learning project aspires to establish the highest standards in the field of international communication law by fostering a comparative analysis of legal systems across different countries. By examining and contrasting the regulations, principles, and practices governing communication in diverse jurisdictions, the project aims to identify best practices and promote a deeper understanding of global legal standards.

The ultimate goal of this project is to equip legal professionals with the knowledge necessary to navigate the complexities of cross-border communication, ensuring compliance with diverse legal systems while upholding fundamental principles of fairness and accuracy.

== 2025 ==

[[Armenian Legal System]]

[https://w.wiki/F6Yy France's Legal System]

[[Italian Legal System|Italian Legal System]]

[[Canadian Communications Law|Canadian Legal System]]

[[Saudi Arabian Legal System|Saudi Arabian Legal System]]

[[United Kingdom Legal System]]

[[Puerto Rico's Legal System]]

[[German Legal System]]

[[Russian Legal System]]

[[Jamaican Legal System]]

[[Brazilian Legal System]]

[[Communications Law in Austria]]

[[Republic of Ireland Legal System]]

[[Australia's Legal System]]

== 2026 ==
[[Communications Law in Malta]]

[https://w.wiki/Hc5V The Kingdom of Morocco]  

[[Communications Law in China]]

[[The Netherlands' Legal System|Communications Law in the Netherlands]]

[[Communications Law in India]]

[[Communications Law in Portugal]]

[[Media Law in the Czech Republic]]

[[Communications Law in Spain]]

Communication Law in Spain

[[Communications Law in Mexico]] 

 
[[Category:Law]]
[[Category:Communication]]</text>
      <sha1>3ezae3qvxabxczh2ar9p5fbufmwocxh</sha1>
    </revision>
  </page>
  <page>
    <title>User:Ruud Loeffen/Cosmic Influx Theory(3)</title>
    <ns>2</ns>
    <id>318978</id>
    <revision>
      <id>2809881</id>
      <parentid>2802383</parentid>
      <timestamp>2026-05-17T09:22:37Z</timestamp>
      <contributor>
        <username>Ruud Loeffen</username>
        <id>2998353</id>
      </contributor>
      <minor />
      <comment>/* Chapters */ repaired link to chapter 8</comment>
      <origin>2809881</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="30410" sha1="64lhwkeg54bb0eggvnvll4vzvtsdbmk" xml:space="preserve">{{original research}}

[[File:CITbanner via Paint.png|center|1000px]]

= Cosmic Influx Theory (CIT) =

== Introduction ==
The '''Cosmic Influx Theory (CIT)''' explores the continuous influx of mass-energy in celestial bodies, contributing to planetary growth, geophysical activity, and gravitational effects. Beyond the macroscopic scale, CIT proposes that mass-energy influx also influences '''microscopic phenomena''' such as Van der Waals forces, the Casimir effect... [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_8#8.2.10|[8.2.10]]], and even the trajectory of falling raindrops. These phenomena may provide subtle but crucial evidence of a pervasive cosmic influx shaping both the vast and the minuscule aspects of the universe.

By delving into the '''Gravitational Constant''', we unveil compelling evidence for an '''increase in mass and heat''' for all celestial objects within an isotropic and homogenous universe as a result of the '''Lorentz Transformation of Mass- Energy''' (LTME) [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_8#8.1.1|[8.1.1]]]. [[File:Influx formula with midocean ridge ml resize x4.png|thumb|Illustration of Cosmic Influx Theory (CIT), showing energy influx, planetary surface area, and geophysical processes such as mid-ocean ridge formation.]] Traditionally, LTME has been considered relevant primarily for '''subatomic particles''' at '''high''' velocities. However, this study posits that LTME is equally applicable to '''big celestial bodies''', even at relatively '''low velocities'''.

CIT introduces the concept of a '''universal energy influx''', hypothesized as a stream of &quot;whirlings&quot; or &quot;excitations&quot; interacting with the kinetic energy of atoms, driving incremental mass increases in alignment with the Lorentz Transformation of Mass-Energy (LTME) [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_8#8.7.2|[8.7.2]]]

This mechanism offers a unified explanation for geological phenomena such as '''volcanic activity, seafloor spreading, and planetary expansion''' [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_8#8.4.15|[8.4.15]]] [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_8#8.4.20|[8.4.20]]], while also addressing cosmological questions such as galactic rotation curves and cosmic acceleration. Key results include calculated mass-energy growth rates consistent with geological observations as described by many researchers on '''Earth Expansion''' and '''Expansion Tectonics''' 
[[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_8#8.4.20|[8.4.20]]] [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_8#8.4.21|[8.4.21]]], a redefinition of gravitational acceleration through the volumetric universal influx. By integrating CIT with established physics principles and observational data, this paper highlights its potential to bridge gaps in mainstream models of dark matter and dark energy [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_8#8.1.2|[8.1.2]]].

Importantly, '''CIT does not reject the occurrence of subduction zones'''. Rather, it integrates subduction as a natural consequence of localized surface adjustments during global expansion. While oceanic crust is created at mid-ocean ridges, older, '''denser crust may subduct along continental margins, often accompanied by mountain building'''. However, the net balance, according to CIT, is a continuous increase in the total mass and volume of celestial bodies. A more detailed discussion on how subduction and expansion coexist within CIT is presented in '''[[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.3_Geophysical_Evidence:_Plate_Tectonics_and_Planetary_Evolution|Chapter 5.3]]'''.

This pursuit contemplates the possibility of an infinitely energetic universe, where energy metamorphoses into mass through &lt;math&gt;M = \frac{E}{c^2}&lt;/math&gt;
This interpretation proposes the existence of a '''Process of Continuously Created Matter''', manifesting as an ongoing accretion, augmentation, and expansion, harmonizing with the universe's ever-expansive nature [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_8#8.4.7|[8.4.7]]].

CIT introduces the '''Preferred Distance (D&lt;sub&gt;pref&lt;/sub&gt;)''', derived from the '''Root Mean Square Velocity (VRMS)''' of planetary systems (see Chapter 2 for explanation)[[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_8#8.7.3|[8.7.3]]], as a key factor in structuring planetary orbits. This theory challenges conventional gravitational models by linking the '''gravitational constant (G)''' to the Lorentz transformation and vacuum energy properties [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_8#8.7.8|[8.7.8]]].

[[File:Iiif-service gmd gmd9 g9096 g9096c ct003148-full-pct 12.5-0-default.jpg|thumb|World Ocean Floor (1977). Originally used to support the theory of Plate Tectonics, this image also offers a compelling perspective on the potential increase of mass-energy over time, aligning with Cosmic Influx Theory (CIT).]]

The purpose of this Wikiversity page is to present CIT in a structured and accessible format, supported by mathematical derivations, observational data, and theoretical discussions.

== Introduction to the Cosmic Influx Theory (CIT) using NotebookLM and YouTube ==

We used NotebookLM to generate an interactive Q&amp;A format with two AI interviewers. These interviewers read the Cosmic Influx Theory (CIT) and provide analysis through questions and answers.

From this audio material, we created the video: [https://youtube.com/watch?v=cy9zhC3kcYU&amp;si=2NGLwz3aIE_6Gbba
 ''Two AI interviewers discuss Gravity and Influx''].

In this video, two AIs (Q and A) explore the Cosmic Influx Theory (CIT) — a bold idea that challenges Newton’s apple and Einstein’s spacetime. Instead of attraction, gravity may be the result of a continuous influx of cosmic energy, pressing down from all sides and driving the growth of matter, planets, and even the universe itself.

This video presents an easy-to-view short overview (13 minutes) of the Cosmic Influx Theory.

== Chapters ==
Below are the ten chapters explaining the Cosmic Influx Theory in detail:

* [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_1|Chapter 1: The Foundations of Cosmic Influx Theory]]
* [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_2|Chapter 2: The Role of VRMS in Planetary Structuring]]
* [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_3|Chapter 3: The Cosmic Influx and the Gravitational Constant (G)]]
* [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_4|Chapter 4: Implications for Planetary and Cosmic Expansion]]
* [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5|Chapter 5: Cosmic Expansion and the Growth of Celestial Bodies]]
* [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_6|Chapter 6: The Future of Cosmic Influx Theory]]
* [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_7|Chapter 7: Units, Dimensions, and Fundamental Constants in CIT]]
* [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_8|Chapter 8: Supporting Research, References, and Multimedia on Cosmic Influx Theory]]
* [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_9|Chapter 9: Genesis of the Cosmic Influx Theory]]
* [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_10|Chapter 10: Feeling the Influx — A New Point of Observation]]

== Detailed Chapter and Subsection Overview ==
[[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_1|Chapter 1: The Foundations of Cosmic Influx Theory]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_1#1.1|1.1 The Root Mean Square Velocity (VRMS)]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_1#1.2|1.2 The Limitations of Traditional Gravitational Models]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_1#1.3|1.3 The Concept of an Energy Influx]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_1#1.4|1.4 Lorentz Transformation and Planck-Based Influx Concepts]]
*** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_1#1.4.1|1.4.1 Lorentz Transformation and Mass-Energy Increase]]
*** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_1#1.4.2|1.4.2 The Plinflux: Deriving the Influx Quantum from Planck Geometry]]
*** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_1#1.4.3|1.4.3 From Field Equations to Surface Gravity: A Practical Role for 𝜅 and Influx]]
[[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_1|Chapter 1: The Foundations of Cosmic Influx Theory]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_1#1.1|1.1 The Root Mean Square Velocity (VRMS)]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_1#1.2|1.2 The Limitations of Traditional Gravitational Models]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_1#1.3|1.3 The Concept of an Energy Influx]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_1#1.4|1.4 Lorentz Transformation and Planck-Based Influx Concepts]]
*** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_1#1.4.1|1.4.1 Lorentz Transformation and Mass-Energy Increase]]
*** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_1#1.4.2|1.4.2 The Plinflux: Deriving the Influx Quantum from Planck Geometry]]
*** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_1#1.4.3|1.4.3 From Field Equations to Surface Gravity: A Practical Role for 𝜅 and Influx]]
 
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_1#1.5|1.5 Understanding VRMS and Its Significance]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_1#1.6|1.6  Relating Lorentz Mass-Energy to the Gravitational Constant]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_1#sec_1_7|1.7 From Einstein’s Original Kappa to Vacuum Structure]]
 
[[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_2|Chapter 2: The Role of VRMS in Planetary Structuring]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_2#2.1|2.1 How VRMS is Related to Cosmic Structuring]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_2#2.2|2.2 The Connection Between CIT and General Relativity]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_2#2.3|2.3 The Preferred Distance (Dpref) and its Calculation]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_2#2.4|2.4 Empirical Confirmation from Exoplanetary Systems]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_2#2.5|2.5 Implications for Planetary Formation Models]]
 
[[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_3|Chapter 3: The Cosmic Influx and the Gravitational Constant (G)]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_3#3.1|3.1 The Traditional Definition of G]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_3#3.2|3.2 Vacuum Energy and the Gravitational Constant]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_3#3.3|3.3 The Role of Vacuum Energy in Gravity]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_3#3.4|3.4 Mass, Vacuum, and the Historical Constants]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_3#3.5|3.5 A Relativistic Vacuum Model: Components A &amp; B]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_3#3.6|3.6 Observational Evidence and Implications (volcanoes etc.)]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_3#3.7|3.7 Summary]]
 
[[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_4|Chapter 4: Implications for Planetary and Cosmic Expansion]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_4#4.1|4.1 Recap of Delta Influx]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_4#4.2|4.2 Isostasy as Internal Pressure and Volume Stress Due to Influx]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_4#4.3|4.3 Radius Growth: A General Response to Cosmic Influx]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_4#4.4|4.4 Equality of Influx and Gravity]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_4#4.5|4.5 Implications for Planetary and Cosmic Expansion]]
*** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_4#4.5.1|4.5.1 Expansion of Earth's Radius]]
*** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_4#4.5.2|4.5.2 Mass Growth Across Geological Epochs]]
*** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_4#4.5.3_Time_Expansion_as_a_Consequence_of_Increasing_Mass:_A_CIT_Perspective|4.5.3 Time Expansion as a Consequence of Increasing Mass: A CIT Perspective]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_4#4.6|4.6 Conclusion: Influx as the Driver of Mass-Energy Growth]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_4#4.7|4.7 Looking Back in Time]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_4#4.8|4.8 Reversing Our Perspective: Looking Back from the Primordial Energy Field]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_4#4.9|4.9 The Expanding History of the Universe]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_4#4.10|4.10 A New Perspective on the Observable Universe]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_4#Summary|Summary]]
 
[[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5|Chapter 5: Cosmic Expansion and the Growth of Celestial Bodies]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.1|5.1 Planetary Growth Through Mass-Energy Influx Delta INFLUX]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.2|5.2 The Link Between Cosmic Expansion and CIT]]
*** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.2.1|5.2.1 Growing Galaxies and Cosmic Redshift]]
*** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.2.2|5.2.2 Growing Planets Born in Protoplanetary Disks]]
*** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.2.3A|5.2.3A Growing Moons Born in Circumplanetary Disks]]
*** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.2.3B|5.2.3B Secondary Rings Created by Geological and Cryovolcanic Activity]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.3|5.3 Geophysical Evidence: Plate Tectonics and Planetary Evolution]]
*** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.3.1|5.3.1 Seafloor Spreading – A Step Toward Understanding Multi-Directional Crustal Growth]]
**** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.3.1.1|5.3.1.1 Introduction]]
**** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.3.1.2|5.3.1.2 Traditional Model]]
**** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.3.1.3|5.3.1.3 Multi-Directional Seafloor Spreading]]
**** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.3.1.4|5.3.1.4 MDSS and Expansion Tectonics]]
**** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.3.1.5|5.3.1.5 Evidence on Continents]]
**** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.3.1.6|5.3.1.6 Are Some Mountain Ranges Fossil Mid-Ocean Ridges?]]
**** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.3.1.7|5.3.1.7 Fossil Spreading Ridges Preserved on Continental Crust]]
****[[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.3.1.8|5.3.1.8 Isostasy in a Multi-Directional Growth Picture (MDSS)]]
****
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.4|5.4 Earth's Day Length Through Geological Time]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.5|5.5 Stellar Growth and Galactic Evolution]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.6|5.6 Bondi-Hoyle Accretion as Empirical Support]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.7|5.7 Pioneers and Contributors to Earth Expansion and Expansion Tectonics]] 
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#References|References]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#Summary|Summary]]
 
[[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_6|Chapter 6: The Future of Cosmic Influx Theory]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_6#6.1|6.1 Experimental and Observational Tests for CIT]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_6#6.2|6.2 CIT and the Unification of Physics]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_6#6.3|6.3 The Role of AI-Human Collaboration in Science]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_6#6.4|6.4 Why Local Mass Measurements Cannot Detect the Influx]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_6#6.5|6.5 Observational Evidence for a Cosmic Influx: Accelerometer, Casimir Effect, Cloud Chamber, Van der Waals Forces, and the Human Body]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_6#6.6|6.6 The Human Sensor of Influx]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_6#Summary|Summary]]
 
[[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_7|Chapter 7: Units, Dimensions, and Fundamental Constants in CIT]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_7#7.1|7.1 Unit Conversions in CIT]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_7#7.2|7.2 The Five Dimensions in CIT]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_7#7.3|7.3 Derivation of Constants in CIT]]
*** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_7#7.3.1|7.3.1 Gravitational Constant (G)]]
*** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_7#7.3.2|7.3.2 κ_CIT – Planetary Structuring Constant]]
*** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_7#7.3.3|7.3.3 Einsteinian Coupling Constant κ]]
*** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_7#7.3.4|7.3.4  Alignment Between ACT Observations and CIT Predictions]]
*** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_7#7.3.5|7.3.5 Updated CIT Jeans Mass Concept]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_7#7.4|7.4 Conclusion]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_7#7.5|7.5 Overview of Important Constants]]
 
[[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_8|Chapter 8: Supporting Research, References, and Multimedia]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_8#8.1|8.1 Articles Explaining CIT]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_8#8.2|8.2 Comments and Contributions from ChatGPT]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_8#8.3|8.3 Excel Files Supporting CIT]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_8#8.4|8.4 Other Articles and Websites]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_8#8.5|8.5 Videos Supporting CIT]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_8#8.6|8.6 Videos Related to CIT]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_8#8.7|8.7 Selected Responses from ChatGPT]]
 
[[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_9|Chapter 9: Genesis of the Cosmic Influx Theory]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_9#9.1|9.1 Early Insights and Thought Experiments]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_9#9.2|9.2 Connecting with Existing Theories]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_9#9.3|9.3 Mathematical Exploration and Key Discoveries]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_9#9.4|9.4 Challenges and the Scientific Landscape]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_9#9.5|9.5 The Role of AI in Theory Development]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_9#9.6|9.6 Conclusion and Future Directions]]
 
* [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_10|Chapter 10: Feeling the Influx — A New Point of Observation]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_10#10.1|10.1 The Quiet Moment in Bed]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_10#10.2|10.2 The Accelerometer Confirms It]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_10#10.3|10.3 Falling Raindrops — The Influx Made Visible]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_10#10.4|10.4 From Concept to Realization]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_10#10.5|10.5 A Universal Gesture of Reception]]
 
----
'''Navigation:'''  
[{{fullurl:User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_1}} {{Button|Go to Chapter 1|green}}]
 
----
/Chapter_1#1.4.3|1.4.3 From Field Equations to Surface Gravity: A Practical Role for 𝜅 and Influx]]
 
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_1#1.5|1.5 Understanding VRMS and Its Significance]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_1#1.6|1.6 1.6 Relating Lorentz Mass-Energy to the Gravitational Constant]]
 
[[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_2|Chapter 2: The Role of VRMS in Planetary Structuring]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_2#2.1|2.1 How VRMS is Related to Cosmic Structuring]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_2#2.2|2.2 The Connection Between CIT and General Relativity]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_2#2.3|2.3 The Preferred Distance (Dpref) and its Calculation]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_2#2.4|2.4 Empirical Confirmation from Exoplanetary Systems]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_2#2.5|2.5 Implications for Planetary Formation Models]]
 
[[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_3|Chapter 3: The Cosmic Influx and the Gravitational Constant (G)]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_3#3.1|3.1 The Traditional Definition of G]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_3#3.2|3.2 Vacuum Energy and the Gravitational Constant]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_3#3.3|3.3 The Role of Vacuum Energy in Gravity]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_3#3.4|3.4 Mass, Vacuum, and the Historical Constants]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_3#3.5|3.5 A Relativistic Vacuum Model: Components A &amp; B]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_3#3.6|3.6 Observational Evidence and Implications (volcanoes etc.)]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_3#3.7|3.7 Summary]]
 
[[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_4|Chapter 4: Implications for Planetary and Cosmic Expansion]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_4#4.1|4.1 Recap of Delta Influx]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_4#4.2|4.2 Internal Pressure and Volume Stress Due to Influx]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_4#4.3|4.3 Radius Growth: A General Response to Cosmic Influx]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_4#4.4|4.4 Equality of Influx and Gravity]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_4#4.5|4.5 Implications for Planetary and Cosmic Expansion]]
*** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_4#4.5.1|4.5.1 Expansion of Earth's Radius]]
*** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_4#4.5.2|4.5.2 Mass Growth Across Geological Epochs]]
*** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_4#4.5.3_Time_Expansion_as_a_Consequence_of_Increasing_Mass:_A_CIT_Perspective|4.5.3 Time Expansion as a Consequence of Increasing Mass: A CIT Perspective]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_4#4.6|4.6 Conclusion: Influx as the Driver of Mass-Energy Growth]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_4#4.7|4.7 Looking Back in Time]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_4#4.8|4.8 Reversing Our Perspective: Looking Back from the Primordial Energy Field]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_4#4.9|4.9 The Expanding History of the Universe]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_4#4.10|4.10 A New Perspective on the Observable Universe]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_4#Summary|Summary]]
 
[[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5|Chapter 5: Cosmic Expansion and the Growth of Celestial Bodies]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.1|5.1 Planetary Growth Through Mass-Energy Influx Delta INFLUX]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.2|5.2 The Link Between Cosmic Expansion and CIT]]
*** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.2.1|5.2.1 Growing Galaxies and Cosmic Redshift]]
*** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.2.2|5.2.2 Growing Planets Born in Protoplanetary Disks]]
*** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.2.3A|5.2.3A Growing Moons Born in Circumplanetary Disks]]
*** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.2.3B|5.2.3B Secondary Rings Created by Geological and Cryovolcanic Activity]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.3|5.3 Geophysical Evidence: Plate Tectonics and Planetary Evolution]]
*** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.3.1|5.3.1 Seafloor Spreading – A Step Toward Understanding Multi-Directional Crustal Growth]]
**** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.3.1.1|5.3.1.1 Introduction]]
**** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.3.1.2|5.3.1.2 Traditional Model]]
**** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.3.1.3|5.3.1.3 Multi-Directional Seafloor Spreading]]
**** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.3.1.4|5.3.1.4 MDSS and Expansion Tectonics]]
**** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.3.1.5|5.3.1.5 Evidence on Continents]]
**** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.3.1.6|5.3.1.6 Are Some Mountain Ranges Fossil Mid-Ocean Ridges?]]
**** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.3.1.7|5.3.1.7 Fossil Spreading Ridges Preserved on Continental Crust]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.4|5.4 Earth's Day Length Through Geological Time]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.5|5.5 Stellar Growth and Galactic Evolution]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.6|5.6 Bondi-Hoyle Accretion as Empirical Support]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#5.7|5.7 Pioneers and Contributors to Earth Expansion and Expansion Tectonics]] 
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#References|References]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_5#Summary|Summary]]
 
[[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_6|Chapter 6: The Future of Cosmic Influx Theory]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_6#6.1|6.1 Experimental and Observational Tests for CIT]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_6#6.2|6.2 CIT and the Unification of Physics]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_6#6.3|6.3 The Role of AI-Human Collaboration in Science]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_6#6.4|6.4 Why Local Mass Measurements Cannot Detect the Influx]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_6#6.5|6.5 Observational Evidence for a Cosmic Influx: Accelerometer, Casimir Effect, Cloud Chamber, Van der Waals Forces, and the Human Body]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_6#6.6|6.6 The Human Sensor of Influx]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_6#Summary|Summary]]
 
[[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_7|Chapter 7: Units, Dimensions, and Fundamental Constants in CIT]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_7#7.1|7.1 Unit Conversions in CIT]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_7#7.2|7.2 The Five Dimensions in CIT]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_7#7.3|7.3 Derivation of Constants in CIT]]
*** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_7#7.3.1|7.3.1 Gravitational Constant (G)]]
*** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_7#7.3.2|7.3.2 κ_CIT – Planetary Structuring Constant]]
*** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_7#7.3.3|7.3.3 Einsteinian Coupling Constant κ]]
*** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_7#7.3.4|7.3.4  Alignment Between ACT Observations and CIT Predictions]]
*** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_7#7.3.5|7.3.5 Updated CIT Jeans Mass Concept]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_7#7.4|7.4 Conclusion]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_7#7.5|7.5 Overview of Important Constants]]
 
[[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_8|Chapter 8: Supporting Research, References, and Multimedia]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_8#8.1|8.1 Articles Explaining CIT]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_8#8.2|8.2 Comments and Contributions from ChatGPT]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_8#8.3|8.3 Excel Files Supporting CIT]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_8#8.4|8.4 Other Articles and Websites]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_8#8.5|8.5 Videos Supporting CIT]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_8#8.6|8.6 Videos Related to CIT]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_8#8.7|8.7 Selected Responses from ChatGPT]]
 
[[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_9|Chapter 9: Genesis of the Cosmic Influx Theory]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_9#9.1|9.1 Early Insights and Thought Experiments]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_9#9.2|9.2 Connecting with Existing Theories]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_9#9.3|9.3 Mathematical Exploration and Key Discoveries]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_9#9.4|9.4 Challenges and the Scientific Landscape]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_9#9.5|9.5 The Role of AI in Theory Development]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_9#9.6|9.6 Conclusion and Future Directions]]
 
* [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_10|Chapter 10: Feeling the Influx — A New Point of Observation]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_10#10.1|10.1 The Quiet Moment in Bed]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_10#10.2|10.2 The Accelerometer Confirms It]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_10#10.3|10.3 Falling Raindrops — The Influx Made Visible]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_10#10.4|10.4 From Concept to Realization]]
** [[User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_10#10.5|10.5 A Universal Gesture of Reception]]
 
----
'''Navigation:'''  
[{{fullurl:User:Ruud_Loeffen/Cosmic_Influx_Theory(3)/Chapter_1}} {{Button|Go to Chapter 1|green}}]
 
----

== Next Steps ==
* This page will be expanded with additional references, images, and links.
* Future updates will refine key sections based on new findings.

----</text>
      <sha1>64lhwkeg54bb0eggvnvll4vzvtsdbmk</sha1>
    </revision>
  </page>
  <page>
    <title>Plato's Dialogues</title>
    <ns>0</ns>
    <id>319538</id>
    <revision>
      <id>2809897</id>
      <parentid>2719782</parentid>
      <timestamp>2026-05-17T10:33:20Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <comment>- prod (there are useful subpages)</comment>
      <origin>2809897</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="1416" sha1="ppn3z3xlyldz997gpn285sddr3lhm3x" xml:space="preserve">[[File:Plato Silanion Musei Capitolini MC1377.jpg|thumb|A bust of Plato, the author of the ''Dialogues''|258x258px]]
Plato’s ''Dialogues'' are some of the most influential works in the history of philosophy. The following course is an introductory overview of the Dialogues. Students will learn some of the foundational ideas of Western philosophy and familiarize themselves with the Socratic way of thinking.

== Lectures ==

=== [[Plato's Dialogues/Introduction|Introduction]] ===

* Ancient Athens
* Socrates
* Plato
* The ''Dialogues''


The following is a list of the works of Plato as organized into &quot;tetralogies,&quot; or groups of four, by the ancient scholar Thrasyllus. Though some dialogues build on others, they can be viewed in any order.

=== Tetralogy I ===

* [[Plato's Dialogues/Euthyphro|Euthyphro]]
* Apology
* Crito
* Phaedo

=== Tetralogy II ===

* Cratylus
* Theatetus
* Sophist
* Statesman

=== Tetralogy III ===

* Parmenides
* Philebus
* Symposium
* Phaedrus

=== Tetralogy IV ===

* Alcibiades
* Second Alcibiades
* Hipparchus
* Lovers

=== Tetralogy V ===

* Theages
* Charmides
* Laches
* Lysis

=== Tetralogy VI ===

* Euthydemus
* Protagoras
* Gorgias
* Meno

=== Tetralogy VII ===

* Hippias Major
* Hippias Minor
* Ion
* Menexenus

=== Tetralogy VIII ===

* Clitophon
* Republic
* Timaeus
* Critias

=== Tetralogy IX ===

* Minos
* Laws
* Epinomis
* Letters

[[Category:Plato|Dialogues]]</text>
      <sha1>ppn3z3xlyldz997gpn285sddr3lhm3x</sha1>
    </revision>
  </page>
  <page>
    <title>Digital Media Concepts/Roblox Tower Defense Genre</title>
    <ns>0</ns>
    <id>320525</id>
    <revision>
      <id>2809772</id>
      <parentid>2709864</parentid>
      <timestamp>2026-05-16T23:01:47Z</timestamp>
      <contributor>
        <username>~2026-29541-24</username>
        <id>3076822</id>
      </contributor>
      <comment>Wiki</comment>
      <origin>2809772</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="12296" sha1="r44pi3zynxee7nrx4sh1d1hnyz27r6p" xml:space="preserve">{{DISPLAYTITLE:Roblox Tower Defense Genre}}

= Digital Media Concepts/Roblox Tower Defense Genre =

=== Introduction: What is Roblox? ===
Roblox is an online gaming platform and development system that lets people create and play games made by any people. It was created by David Baszucki and Erik Cassel in 2004 and was made available in 2006. &lt;ref&gt;{{Cite web|url=https://en.wikipedia.org/wiki/Roblox|title=Roblox|date=2019-02-15|website=Wikipedia|language=en}}&lt;/ref&gt; As of 2024, there are about 80 million daily active users on Roblox, mainly children and teenagers under 18. &lt;ref&gt;{{Cite web|url=https://backlinko.com/roblox-users|title=Roblox Usage and Growth Statistics You Need to Know|date=2024-01-17|website=Backlinko|language=en}}&lt;/ref&gt; 

== Tower Defense Game History ==
In Roblox, there are many genres of games, including tower defense. Tower Defense is a strategy game genre where players defend their territory or base by placing defensive structures, such as people or buildings, in strategic locations to prevent waves of enemies from reaching the end.
The tower defense era on Roblox started a year after the platform was made public. It was made known in 2007, and these games are somewhat popular today. There are numerous tower defense games on Roblox.

===Roblox Tower Defense Beta v1.0===
This game was the first-ever tower defense game on Roblox. It was created in 2007 by Naxic and had pretty awesome mechanics for an old game. There are a decent number of towers, and the game was straightforward and enjoyable. Not much information is known about this game, but it was the starting point of something bigger. &lt;ref&gt;{{Cite web|url=https://www.youtube.com/watch?v=fFSApG6rDvw|title=The ENTIRE History of Roblox Tower Defense|date=2024-12-14|website=YouTube|language=en}}&lt;/ref&gt; 

=== Tower Battles ===

Tower Battles was the first huge tower defense game on Roblox to be released. It was created by Planet3arth in 2011 but was officially released in 2017.
 
The creator expanded upon the tower defense genre by adding a competitive multiplayer game mode where players can send offensive enemies on the opponents' side to try and make them lose. Not only do you need to defend the normal wave of enemies, but you also need to hold off the enemies your opponents send you. This changes your strategy up as different players would defend differently, get further into the match, and send different, strong enemies in your way.

There are a huge number of towers to choose to defend the enemies with. Since there are only 5 towers to take with you in a match and each tower has its own mechanic, players have to strategize what to bring. Some towers can freeze enemies, deal splash damage, and more! To get these towers, you have to unlock them using coins you get from losing or winning a round. This gets players consistently playing the game to get coins to unlock more towers. Even though it's a long journey to get coins, it has replay value.

Even after 10 years and minimal updates, the game is still pretty popular and well-known. A lot of Roblox users would remember this game in the future (Tower Battles Wiki).

===MechaCubes===

MechaCubes was another notable tower defense game released in 2015 by a group named Tuning Studios. It's run by the Roblox users named toonicooooooos, the amazingkang, and Lenny. The game is inspired by Bloons Tower Defense, a well-known tower defense game on the internet.

It was very popular back then since it had a lobby with leaderboards that showed the players' rank, total cash, and wins. You can search for certain players to see their game stats.

A new and cool feature in this game is the perks that players can buy using the game currency. These perks work on specific towers and can boost their stats, and usually have a downside as well. For example, a perk can boost their damage but lower their fire rate. These perks can change players' strategies and give them a massive combination of towers and perks to choose from to defend the enemies. Players can also trade these perks with other players!

Just like Tower Battles, the gameplay is straightforward. The main difference is that you unlock towers by leveling up and getting experience from losing or winning rounds. There are many towers to use and defend with though. Another cool thing is that players can rejoin the same match if they disconnect or leave the round. Many tower defense games don't have this feature.

In the modern day, MechaCubes isn't receiving any updates anymore and isn't popular, but it's still a nostalgic tower defense game to come back to (MechaCubes Wiki).

=== Tower Defense Simulator ===

Tower Defense Simulator, also commonly known as TDS, was the most popular tower defense game on Roblox until the modern day. It was created in 2018 by the group Paradoxum Games, with the lead developer being BelowNatural. It was inspired by Tower Battles and marked a milestone for modern-day tower defense games. It redefined what tower defense games are on Roblox.

The popularity of the game was influenced by its astonishing game mechanics and design. It has a clean UI, numerous amount of towers, many abilities, game dialogue, unique enemies, four different game modes, original music, and a nice community. The game also receives consistent updates even in the modern day, giving players more of a reason to play the game. In 2020, the game reached its milestone of one billion visits, which is a huge achievement and goes down in Roblox history.

A huge aspect that brings a mass amount of players into the game is its seasonal events. Their first ever event was Sword Fight on The Heights (SFOTH), featuring a new map, totally different enemies, and a unique boss. It gave the players something new and exciting to experience other than the four main modes. These events usually reward a limited-time tower that is strong in certain scenarios. There are over 15 unique events, and continues to rise as the game continues to be popular.

Tower Defense Simulator has changed a lot since its first release. It has gotten numerous updates, gameplay, and design changes to make it appealing in the modern day. The game has won many Roblox awards and will continue to be well-known in the future (Tower Defense Simulator Wiki). 

=== All Star Tower Defense ===

All Star Tower Defense, or ASTD, immediately grew popular when it was released. It was created by the group Top Down Games and was released to the public in 2020.

This game has basic tower defense game mechanics, but what made it popular was the addition of anime. As many people watched anime, the creators threw the idea of adding famous anime characters into a Roblox game. Characters such as Naruto and Goku were included to attract people.

This game is unique from the recent tower defense games because it includes a gacha system. Gacha is derived from a Japanese word meaning a vending machine, meaning players spend their in-game currency for a chance to get a random tower. It's up to luck to decide whether players get a strong or weak tower, depending on the probability listed. This mechanic fueled people's drive to keep playing the game to get more currency and try their luck for a rare and strong tower. Even though it'll get some hate from some players, this mechanic is what allows replayability and the consistent visits.

The gacha system and anime theme work together to form the growing popularity of this game. This game inspired many future tower defense games to add a gacha system for getting towers as well (All Star Tower Defense Wiki).

=== World Tower Defense ===

World Tower Defense is a unique tower defense that slowly gained its popularity with its unique gameplay. The game was created in 2021 by the group named Select an Image from Your Computer Studios, with its main developer being Babygoo25. This game was inspired by The Battle Cats and expanded upon it.

This game is notable since it features maps with no designated paths for the enemies to follow. It also brings the mechanic that all towers can die from the enemies. This is the first tower defense game on Roblox to implement the idea that towers that are placed are directly targeted by enemies and can get killed by them. This mechanic is what makes the game extremely difficult and encourages trial and error to beat all the modes. Due to its difficulty, many players quit, but many are motivated to take on this arduous challenge.

The game started weak and unbalanced, but as time went on, it received consistent and frequent updates that added new towers, modes, enemies, and even some lore! The game is somewhat popular today, and the main developer is actively working on new content for players to enjoy. Overall, its uniqueness and high stakes are what make this game enjoyable. &lt;ref&gt;{{Cite web|url=https://www.roblox.com/games/5656754541/World-Tower-Defense|title=World Tower Defense|date=2025|website=Roblox|language=en}}&lt;/ref&gt;

=== Tower Galactica ===

Tower Galactica is another unique and once-popular tower defense game on Roblox. It was created by Eraptyy and was released in early 2022.

The theme of this game is space, and it features an engaging storyline that captures players' attention. There are different planets to visit, and you have to defend against waves of enemies on each one to progress. This pushes users to keep playing to discover new enemies and what happens next in the story.

What makes this game so unique is that it gives the enemies the ability to attack players instead of only the towers. The player will have a certain number of lives, and the game will end if all players lose all their lives to the enemies or their surroundings. As a result, all players will have to be careful of getting too close to the enemies and avoid getting damaged from anything that can hurt them. This turns this game intense, which draws the attention of many players to attempt to get to the end and conquer the enemies. This mechanic is rarely used since it doesn't fit the traditional tower defense ways, though.

This game gained popularity due to its amazing storyline and lives mechanic, but it soon died out when the developers lost the motivation to continue updating the game with more planets and lore. However, this game will be remembered as the most interactive and movement-intense tower defense game on Roblox (Tower Galactica Wiki).

== Impact on Roblox ==

Tower defense wasn't the most popular genre on Roblox in the past. However, as these breathtaking games started popping up, it became well-known, and the genre is now one of the biggest on Roblox. In the modern day, there are over 100 great tower defense games to choose and play from. As new ideas and mechanics are implemented into future games, this genre isn't losing its popularity soon. &lt;ref&gt;{{Cite web|url=https://www.youtube.com/watch?v=fFSApG6rDvw|title=The ENTIRE History of Roblox Tower Defense|date=2024-12-14|website=YouTube|language=en}}&lt;/ref&gt;

== List of Popular Tower Defense Games ==

As of March 2025, here are 10 popular tower defense games on Roblox.

1. Tower Defense Simulator

2. All Star Tower Defense

3. Tower Battles

4. Tower Blitz

5. Tower Heroes

6. World Tower Defense

7. Tower Defense X

8. Anime Vanguards

9. Toilet Tower Defense

10. Critical Tower Defense

== References ==
1: Wikipedia Contributors. (2019, February 15). Roblox. Wikipedia; Wikimedia Foundation. https://en.wikipedia.org/wiki/Roblox

2: Dean, B. (2024, January 17). Roblox Usage and Growth Statistics You Need to Know. Backlinko. https://backlinko.com/roblox-users

3:- Dilapidated. (2024, December 14). The ENTIRE History of Roblox Tower Defense. YouTube. https://www.youtube.com/watch?v=fFSApG6rDvw

4. Tower Battles Wiki. (2025). Fandom. (Link not allowed)

5. MechaCubes Wiki. (2025). Fandom. (Link not allowed)

‌6. Tower Defense Simulator Wiki. (2025). Fandom. (Link not allowed)

7. Roblox: All Star Tower Defense Wiki. (2025). Fandom. (Link not allowed)

‌8. Roblox Corporation. (2025). World Tower Defense. Roblox. https://www.roblox.com/games/5656754541/World-Tower-Defense

‌9. Tower Galactica Wiki. (2025). Fandom. (Link not allowed)

10. Roblox Corporation. (2025). Roblox. https://www.roblox.com/home

{{BookCat}}
&lt;references /&gt;
&lt;hiero&gt;
Roblox
&lt;/hiero&gt;</text>
      <sha1>r44pi3zynxee7nrx4sh1d1hnyz27r6p</sha1>
    </revision>
    <revision>
      <id>2809815</id>
      <parentid>2809772</parentid>
      <timestamp>2026-05-17T02:20:52Z</timestamp>
      <contributor>
        <username>MathXplore</username>
        <id>2888076</id>
      </contributor>
      <minor />
      <comment>Reverted edit by [[Special:Contributions/~2026-29541-24|~2026-29541-24]] ([[User_talk:~2026-29541-24|talk]]) to last version by [[User:MathXplore|MathXplore]] using [[Wikiversity:Rollback|rollback]]</comment>
      <origin>2709864</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="12257" sha1="e2h2zi7m1wkmpe2km4sdce65weso0iu" xml:space="preserve">{{DISPLAYTITLE:Roblox Tower Defense Genre}}

= Digital Media Concepts/Roblox Tower Defense Genre =

=== Introduction: What is Roblox? ===
Roblox is an online gaming platform and development system that lets people create and play games made by any people. It was created by David Baszucki and Erik Cassel in 2004 and was made available in 2006. &lt;ref&gt;{{Cite web|url=https://en.wikipedia.org/wiki/Roblox|title=Roblox|date=2019-02-15|website=Wikipedia|language=en}}&lt;/ref&gt; As of 2024, there are about 80 million daily active users on Roblox, mainly children and teenagers under 18. &lt;ref&gt;{{Cite web|url=https://backlinko.com/roblox-users|title=Roblox Usage and Growth Statistics You Need to Know|date=2024-01-17|website=Backlinko|language=en}}&lt;/ref&gt; 

== Tower Defense Game History ==
In Roblox, there are many genres of games, including tower defense. Tower Defense is a strategy game genre where players defend their territory or base by placing defensive structures, such as people or buildings, in strategic locations to prevent waves of enemies from reaching the end.
The tower defense era on Roblox started a year after the platform was made public. It was made known in 2007, and these games are somewhat popular today. There are numerous tower defense games on Roblox.

===Roblox Tower Defense Beta v1.0===
This game was the first-ever tower defense game on Roblox. It was created in 2007 by Naxic and had pretty awesome mechanics for an old game. There are a decent number of towers, and the game was straightforward and enjoyable. Not much information is known about this game, but it was the starting point of something bigger. &lt;ref&gt;{{Cite web|url=https://www.youtube.com/watch?v=fFSApG6rDvw|title=The ENTIRE History of Roblox Tower Defense|date=2024-12-14|website=YouTube|language=en}}&lt;/ref&gt; 

=== Tower Battles ===

Tower Battles was the first huge tower defense game on Roblox to be released. It was created by Planet3arth in 2011 but was officially released in 2017.
 
The creator expanded upon the tower defense genre by adding a competitive multiplayer game mode where players can send offensive enemies on the opponents' side to try and make them lose. Not only do you need to defend the normal wave of enemies, but you also need to hold off the enemies your opponents send you. This changes your strategy up as different players would defend differently, get further into the match, and send different, strong enemies in your way.

There are a huge number of towers to choose to defend the enemies with. Since there are only 5 towers to take with you in a match and each tower has its own mechanic, players have to strategize what to bring. Some towers can freeze enemies, deal splash damage, and more! To get these towers, you have to unlock them using coins you get from losing or winning a round. This gets players consistently playing the game to get coins to unlock more towers. Even though it's a long journey to get coins, it has replay value.

Even after 10 years and minimal updates, the game is still pretty popular and well-known. A lot of Roblox users would remember this game in the future (Tower Battles Wiki).

===MechaCubes===

MechaCubes was another notable tower defense game released in 2015 by a group named Tuning Studios. It's run by the Roblox users named toonicooooooos, the amazingkang, and Lenny. The game is inspired by Bloons Tower Defense, a well-known tower defense game on the internet.

It was very popular back then since it had a lobby with leaderboards that showed the players' rank, total cash, and wins. You can search for certain players to see their game stats.

A new and cool feature in this game is the perks that players can buy using the game currency. These perks work on specific towers and can boost their stats, and usually have a downside as well. For example, a perk can boost their damage but lower their fire rate. These perks can change players' strategies and give them a massive combination of towers and perks to choose from to defend the enemies. Players can also trade these perks with other players!

Just like Tower Battles, the gameplay is straightforward. The main difference is that you unlock towers by leveling up and getting experience from losing or winning rounds. There are many towers to use and defend with though. Another cool thing is that players can rejoin the same match if they disconnect or leave the round. Many tower defense games don't have this feature.

In the modern day, MechaCubes isn't receiving any updates anymore and isn't popular, but it's still a nostalgic tower defense game to come back to (MechaCubes Wiki).

=== Tower Defense Simulator ===

Tower Defense Simulator, also commonly known as TDS, was the most popular tower defense game on Roblox until the modern day. It was created in 2018 by the group Paradoxum Games, with the lead developer being BelowNatural. It was inspired by Tower Battles and marked a milestone for modern-day tower defense games. It redefined what tower defense games are on Roblox.

The popularity of the game was influenced by its astonishing game mechanics and design. It has a clean UI, numerous amount of towers, many abilities, game dialogue, unique enemies, four different game modes, original music, and a nice community. The game also receives consistent updates even in the modern day, giving players more of a reason to play the game. In 2020, the game reached its milestone of one billion visits, which is a huge achievement and goes down in Roblox history.

A huge aspect that brings a mass amount of players into the game is its seasonal events. Their first ever event was Sword Fight on The Heights (SFOTH), featuring a new map, totally different enemies, and a unique boss. It gave the players something new and exciting to experience other than the four main modes. These events usually reward a limited-time tower that is strong in certain scenarios. There are over 15 unique events, and continues to rise as the game continues to be popular.

Tower Defense Simulator has changed a lot since its first release. It has gotten numerous updates, gameplay, and design changes to make it appealing in the modern day. The game has won many Roblox awards and will continue to be well-known in the future (Tower Defense Simulator Wiki). 

=== All Star Tower Defense ===

All Star Tower Defense, or ASTD, immediately grew popular when it was released. It was created by the group Top Down Games and was released to the public in 2020.

This game has basic tower defense game mechanics, but what made it popular was the addition of anime. As many people watched anime, the creators threw the idea of adding famous anime characters into a Roblox game. Characters such as Naruto and Goku were included to attract people.

This game is unique from the recent tower defense games because it includes a gacha system. Gacha is derived from a Japanese word meaning a vending machine, meaning players spend their in-game currency for a chance to get a random tower. It's up to luck to decide whether players get a strong or weak tower, depending on the probability listed. This mechanic fueled people's drive to keep playing the game to get more currency and try their luck for a rare and strong tower. Even though it'll get some hate from some players, this mechanic is what allows replayability and the consistent visits.

The gacha system and anime theme work together to form the growing popularity of this game. This game inspired many future tower defense games to add a gacha system for getting towers as well (All Star Tower Defense Wiki).

=== World Tower Defense ===

World Tower Defense is a unique tower defense that slowly gained its popularity with its unique gameplay. The game was created in 2021 by the group named Select an Image from Your Computer Studios, with its main developer being Babygoo25. This game was inspired by The Battle Cats and expanded upon it.

This game is notable since it features maps with no designated paths for the enemies to follow. It also brings the mechanic that all towers can die from the enemies. This is the first tower defense game on Roblox to implement the idea that towers that are placed are directly targeted by enemies and can get killed by them. This mechanic is what makes the game extremely difficult and encourages trial and error to beat all the modes. Due to its difficulty, many players quit, but many are motivated to take on this arduous challenge.

The game started weak and unbalanced, but as time went on, it received consistent and frequent updates that added new towers, modes, enemies, and even some lore! The game is somewhat popular today, and the main developer is actively working on new content for players to enjoy. Overall, its uniqueness and high stakes are what make this game enjoyable. &lt;ref&gt;{{Cite web|url=https://www.roblox.com/games/5656754541/World-Tower-Defense|title=World Tower Defense|date=2025|website=Roblox|language=en}}&lt;/ref&gt;

=== Tower Galactica ===

Tower Galactica is another unique and once-popular tower defense game on Roblox. It was created by Eraptyy and was released in early 2022.

The theme of this game is space, and it features an engaging storyline that captures players' attention. There are different planets to visit, and you have to defend against waves of enemies on each one to progress. This pushes users to keep playing to discover new enemies and what happens next in the story.

What makes this game so unique is that it gives the enemies the ability to attack players instead of only the towers. The player will have a certain number of lives, and the game will end if all players lose all their lives to the enemies or their surroundings. As a result, all players will have to be careful of getting too close to the enemies and avoid getting damaged from anything that can hurt them. This turns this game intense, which draws the attention of many players to attempt to get to the end and conquer the enemies. This mechanic is rarely used since it doesn't fit the traditional tower defense ways, though.

This game gained popularity due to its amazing storyline and lives mechanic, but it soon died out when the developers lost the motivation to continue updating the game with more planets and lore. However, this game will be remembered as the most interactive and movement-intense tower defense game on Roblox (Tower Galactica Wiki).

== Impact on Roblox ==

Tower defense wasn't the most popular genre on Roblox in the past. However, as these breathtaking games started popping up, it became well-known, and the genre is now one of the biggest on Roblox. In the modern day, there are over 100 great tower defense games to choose and play from. As new ideas and mechanics are implemented into future games, this genre isn't losing its popularity soon. &lt;ref&gt;{{Cite web|url=https://www.youtube.com/watch?v=fFSApG6rDvw|title=The ENTIRE History of Roblox Tower Defense|date=2024-12-14|website=YouTube|language=en}}&lt;/ref&gt;

== List of Popular Tower Defense Games ==

As of March 2025, here are 10 popular tower defense games on Roblox.

1. Tower Defense Simulator

2. All Star Tower Defense

3. Tower Battles

4. Tower Blitz

5. Tower Heroes

6. World Tower Defense

7. Tower Defense X

8. Anime Vanguards

9. Toilet Tower Defense

10. Critical Tower Defense

== References ==
1: Wikipedia Contributors. (2019, February 15). Roblox. Wikipedia; Wikimedia Foundation. https://en.wikipedia.org/wiki/Roblox

2: Dean, B. (2024, January 17). Roblox Usage and Growth Statistics You Need to Know. Backlinko. https://backlinko.com/roblox-users

3:- Dilapidated. (2024, December 14). The ENTIRE History of Roblox Tower Defense. YouTube. https://www.youtube.com/watch?v=fFSApG6rDvw

4. Tower Battles Wiki. (2025). Fandom. (Link not allowed)

5. MechaCubes Wiki. (2025). Fandom. (Link not allowed)

‌6. Tower Defense Simulator Wiki. (2025). Fandom. (Link not allowed)

7. Roblox: All Star Tower Defense Wiki. (2025). Fandom. (Link not allowed)

‌8. Roblox Corporation. (2025). World Tower Defense. Roblox. https://www.roblox.com/games/5656754541/World-Tower-Defense

‌9. Tower Galactica Wiki. (2025). Fandom. (Link not allowed)

10. Roblox Corporation. (2025). Roblox. https://www.roblox.com/home

{{BookCat}}</text>
      <sha1>e2h2zi7m1wkmpe2km4sdce65weso0iu</sha1>
    </revision>
  </page>
  <page>
    <title>Tetrahedron/Symmetries/Examples in matrix representation/Exercise</title>
    <ns>0</ns>
    <id>321119</id>
    <revision>
      <id>2809840</id>
      <parentid>2711728</parentid>
      <timestamp>2026-05-17T03:58:05Z</timestamp>
      <contributor>
        <username>HenriPittier</username>
        <id>3076895</id>
      </contributor>
      <origin>2809840</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="333" sha1="dyw42zhlj9fbepqxd8155yp7qvzj2h8" xml:space="preserve">{{
Mathematical text/Exercise{{{opt|}}}
|Text=
{{
inputimage
|Symmetries of the tetrahedron|svg|400px {{!}} {{!}} 
|epsname=Symmetries of the tetrahedron
|User=Cronholm
|Domain=
|License=GFDL
}}

Describe for each symmetry of the tetrahedron depicted above a suitable matrix representation.
|Textform=Exercise 
|Category=
|Marks=5
}}</text>
      <sha1>dyw42zhlj9fbepqxd8155yp7qvzj2h8</sha1>
    </revision>
    <revision>
      <id>2809860</id>
      <parentid>2809840</parentid>
      <timestamp>2026-05-17T04:30:31Z</timestamp>
      <contributor>
        <username>NguoiDungKhongDinhDanh</username>
        <id>2922842</id>
      </contributor>
      <minor />
      <comment>Reverted edit by [[Special:Contributions/HenriPittier|HenriPittier]] ([[User_talk:HenriPittier|talk]]) to last version by [[User:Bocardodarapti|Bocardodarapti]] using [[Wikiversity:Rollback|rollback]]</comment>
      <origin>2711728</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="336" sha1="6puaais72cm05tcwuzy7glnxf24sz3d" xml:space="preserve">{{
Mathematical text/Exercise{{{opt|}}}
|Text=
{{
inputimage
|Symmetries of the tetrahedron|svg|400px {{!}} {{!}} 
|epsname=Symmetries of the tetrahedron
|User=Cronholm144
|Domain=
|License=GFDL
}}

Describe for each symmetry of the tetrahedron depicted above a suitable matrix representation.
|Textform=Exercise 
|Category=
|Marks=5
}}</text>
      <sha1>6puaais72cm05tcwuzy7glnxf24sz3d</sha1>
    </revision>
  </page>
  <page>
    <title>Motivation and emotion/Book/2026</title>
    <ns>0</ns>
    <id>323153</id>
    <revision>
      <id>2809777</id>
      <parentid>2776077</parentid>
      <timestamp>2026-05-16T23:36:28Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <comment>/* Motivation */ +  [[/Self-determination theory and military veteran reintegration/]] - How do autonomy, competence, and relatedness shape psychological adjustment after military service?</comment>
      <origin>2809777</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="8383" sha1="i11004nwi2wt4yq17u4c1rf5iad094k" xml:space="preserve">{{/Banner}}
==Motivation==
# [[/Basal ganglia and motivation/]] - What is the role of the basal ganglia in motivated behaviour? {{ME-By|User Name}}
# [[/Citizen science motivation/]] - What motivates participation in citizen science projects? {{ME-By|User Name}}
# [[/Competence and intrinsic motivation in SDT/]] - How does the need for competence influence intrinsic motivation according to self-determination theory? {{ME-By|User Name}}
# [[/Cost-benefit motivation and effort regulation/]] - How is effort dynamically adjusted I based on changing cost-benefit analysis during goal pursuit? {{ME-By|User Name}}
# [[/Deliberative vs implemental mindset/]] - What are the motivational and cognitive differences between these mindsets? {{ME-By|User Name}}
# [[/Dopamine and reward prediction/]] - How does dopamine affect the anticipation of rewards and subsequent emotional responses? {{ME-By|U3228742}}
# [[/End-of-history illusion and motivation/]] - How does the EOHI influence motivation and what strategies mitigate its impact? {{ME-By|User Name}}
# [[/ERG theory and motivation/]] - What is Alderfer's ERG theory and how does it explain human motivation? {{ME-By|User Name}}
# [[/Extended process model of emotion regulation/]] – What is the extended process model and how does it explain how people regulate emotions? {{ME-By|User Name}}
# [[/Fogg behaviour model/]] - How can the FBM be applied to understanding and changing behaviour? {{ME-By|User Name}}
# [[/Game of dice task and decision-making/]] - What does the game of dice task reveal about risk-based decision-making? {{ME-By|User Name}}
# [[/Goal striving dynamics/]] - What is the role of pushing and coasting in goal striving? {{ME-By|User Name}}
# [[/Hypothalamus and homeostatic motivation/]] - How do hypothalamic circuits regulate hunger, thirst, and other survival-related motivations? {{ME-By|User Name}}
# [[/Mental contrasting and motivation/]] - How does mental contrasting affect motivation? {{ME-By|User Name}}
# [[/Mesolimbic pathway development and adolescent risk-taking/]] - How does maturation of reward circuits influence teenage sensation-seeking and impulsive behaviours? {{ME-By|User Name}}
# [[/Non-residential energy conservation motivation/]] - How can non-residential building energy conservation be motivated and behaviour changed? {{ME-By|User Name}}
# [[/Occupational violence, emotion, and coping/]] - What are the emotional impacts of occupational violence and how can employees cope? {{ME-By|User Name}}
# [[/Perfectionism and procrastination/]] - What is the role of perfectionism in procrastination and what can be done about it? {{ME-By|User Name}}
# [[/Possible selves and goal pursuit/]] - How do possible selves influence motivation and goal-directed behaviour? {{ME-By|User Name}}
# [[/Power motivation and leadership/]] - How does power motivation influence leadership styles and effectiveness? {{ME-By|User Name}}
# [[/Prevention vs promotion mindset/]] - What are the motivational differences between focusing on safety versus growth? {{ME-By|User Name}}
# [[/Relatedness and intrinsic motivation in SDT/]] - How does the need for relatedness influence intrinsic motivation according to self-determination theory? {{ME-By|User Name}}
# [[/Self-determination theory and military veteran reintegration/]] - How do autonomy, competence, and relatedness shape psychological adjustment after military service? {{ME-By|User Name}}
# [[/Self-determination theory and social media use/]] - How do basic psychological needs explain patterns of social media engagement? {{ME-By|User Name}}
# [[/Social dominance and power motivation/]] - What is the relationship between social dominance and power motivation? {{ME-By|User Name}}
# [[/Subcortical structures and motivational drive/]] - How do subcortical brain regions generate basic motivational impulses and energy? {{ME-By|User Name}}
# [[/Surrender motivation/]] - What is the motivational state of surrender and what are its impacts? {{ME-By|User Name}}
# [[/Thermoregulation and motivation/]] - How does the drive to maintain body temperature influence behaviour? {{ME-By|User Name}}
# [[/Tonic-phasic model of dopamine regulation/]] - What is the tonic/phasic model of dopamine regulation and how does affect behaviour? {{ME-By|User Name}}
# [[/Value congruence and motivation/]] - How does alignment between personal and situational values influence motivation? {{ME-By|User Name}}
# [[/Windfall gain effect/]] - How do unexpected financial gains influence behaviour and decision-making? {{ME-By|User Name}}
# [[/Youth environmental activism motivation/]] - What motivates young people to engage in environmental activism? {{ME-By|User Name}}

==Emotion==
# [[/Affect heuristic/]] - What is the affect heuristic and how does it influence decision making? {{ME-By|User Name}}
# [[/Alcohol use for emotion regulation/]] - Why and how do people use alcohol to regulate their emotions? {{ME-By|User Name}}
# [[/Awe and the diminished self/]] - How does awe diminish the self and how can this be applied? {{ME-By|User Name}}
# [[/Awe and nature/]] - What is the relationship between awe and nature? {{ME-By|User Name}}
# [[/Biofeedback and emotion/]] - How does feedback about physiological states influence emotion? {{ME-By|User Name}}
# [[/Breathing exercises and relaxation/]] - How can breathing exercises promote relaxation? {{ME-By|User Name}}
# [[/Cognitive hardiness in the workplace/]] - How does cognitive hardiness protect against occupational stress and burnout? {{ME-By|User Name}}
# [[/Durability bias in affective forecasting/]] - What role does durability bias play in affective forecasting? {{ME-By|User Name}}
# [[/Emotion dysregulation/]] – What is emotion dysregulation, what are its consequences, and how can it be managed? {{ME-By|User Name}}
# [[/Emotion regulation ability versus strategy/]] – How do ability and strategy differ in shaping effective emotion regulation? {{ME-By|User Name}}
# [[/Emotional expressivity/]] – What is emotional expressivity, why does it matter, and how can it be developed? {{ME-By|User Name}}
# [[/Gloatrage/]] - What is gloatrage, what causes it, and what are its consequences? {{ME-By|User Name}}
# [[/Introjection and guilt-based motivation/]] - What role does shame and guilt play in introjected forms of behavioural regulation? {{ME-By|User Name}}
# [[/Laughing gas (nitrous oxide) and emotion/]] - How does nitrous oxide influence emotion? {{ME-By|User Name}}
# [[/Noise and emotion/]] - What are the typical emotional responses to different types of noise? {{ME-By|User Name}}
# [[/Opponent process theory and emotion/]] - What role do opposing affective states play in emotional experience? {{ME-By|User Name}}
# [[/Positive emotion dysregulation/]] – What is positive emotion dysregulation, what are its consequences, and what can be done about it? {{ME-By|User Name}}
# [[/Psychological preparation for natural disasters/]] - How can people psychologically prepare for natural disasters? {{ME-By|User Name}}
# [[/Reflected glory/]] - What is reflected glory and what are its pros and cons? {{ME-By|Username}}
# [[/Remote work and well-being/]] - How does remote work influence employee well-being? {{ME-By|Username}}
# [[/Responsiveness and trust/]] - How does responsiveness influence the development and maintenance of trust? {{ME-By|User Name}}
# [[/Secondary trauma in healthcare workers/]] - What are the emotional consequences of secondary trauma in healthcare settings? {{ME-By|User Name}}
# [[/Theory of positive disintegration and personal growth/]] - What is the TPD and how can it be applied to personal growth? {{ME-By|User Name}}
# [[/Wayfinding and emotion/]] - What are the affective aspects of wayfinding? {{ME-By|User Name}}

==Motivation and emotion==
# [[/Reinforcement sensitivity theory/]] – What is reinforcement sensitivity theory and how does it explain motivation and emotion? {{ME-By|User Name}}
# [[/Reward prediction error/]] - How do reward prediction errors influence learning, emotion, and motivation? {{ME-By|User Name}}
# [[/Warm-glow giving, motivation, and emotion/]] - What are the motivational and emotional aspects of warm-glow giving? {{ME-By|User Name}}
# [[/Wisdom, motivation, and emotion/]] - What are the motivational-emotional aspects of wisdom? {{ME-By|User Name}}

[[Category:Motivation and emotion/Book]]</text>
      <sha1>i11004nwi2wt4yq17u4c1rf5iad094k</sha1>
    </revision>
  </page>
  <page>
    <title>Similar Skin Diseases – Clinical Diagnosis and Differential</title>
    <ns>0</ns>
    <id>324006</id>
    <revision>
      <id>2809898</id>
      <parentid>2744416</parentid>
      <timestamp>2026-05-17T10:43:07Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <comment>- prod (no reason)</comment>
      <origin>2809898</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="9528" sha1="gaonxe07d2gqsqw87ebrxqfhxa4ofcc" xml:space="preserve">== Book Information ==

* '''Title:''' Similar Skin Diseases – Clinical Diagnosis and Differential
* '''Author:''' Dr. Khaled Abdullah Almekhlafi
* '''Language:''' English
* '''Subject:''' Dermatology
* '''Institution:''' Sky Derma Clinic, Yemen
* '''Year:''' 2025

= Similar Skin Diseases – Clinical Diagnosis and Differential =
''Dr. Khaled Abdullah Al-Mukhlafi''
'''Dermatologist – Sky Derma Clinic, Sana'a, Yemen'''

== Table of Contents ==
* [[#chapter_1_-_skin_diseases_and_why_they_look_alike|Chapter 1 – Skin Diseases and Why They Look Alike]]
* [[#chapter_2_-_eczema_vs_psoriasis|Chapter 2 – Eczema vs Psoriasis]]
* [[#chapter_3_-_fungal_skin_infections_vs_vitiligo|Chapter 3 – Fungal Skin Infections vs Vitiligo]]
* [[#chapter_4_-_scabies_vs_eczema|Chapter 4 – Scabies vs Eczema]]
* [[#chapter_5_-_acne_vs_perioral_dermatitis|Chapter 5 – Acne vs Perioral Dermatitis]]
* [[#chapter_6_-_systemic_lupus_erythematosus_vs_allergic_dermatitis|Chapter 6 – Systemic Lupus Erythematosus vs Allergic Dermatitis]]

== Introduction ==
The skin is the largest organ of the body and serves as a protective barrier against germs, injuries, and sunlight. Skin diseases often appear with similar symptoms: rash, itching, light or dark spots, or scaling, making diagnosis challenging for the general public and sometimes even for doctors.

'''Purpose of this book:'''
* Help general readers understand similar skin diseases.
* Provide comprehensive scientific explanations for students and doctors about each disease, its causes, and treatment.
* Offer quick comparison tables to facilitate differential diagnosis.
* Give practical advice for prevention and skin care.

== Chapter 1 – Skin Diseases and Why They Look Alike ==
=== For General Readers ===
* The skin is sensitive and responds quickly to damage, whether inflammation, infection, or immune attack.
* Diseases appear as: redness, itching, light or dark patches, scales.

''Practical examples:''
* Nighttime itching between fingers → Scabies
* Dry, cracked hands with itching → Eczema
* Light patches with scales → Fungal infection
* Clear white patches → Vitiligo

=== For Students and Doctors ===
* The skin consists of the epidermis, dermis, and subcutaneous tissue.
* Causes of similarity:
** Inflammation → Eczema, allergic rash
** Fungal infection → Tinea versicolor
** Autoimmune → Vitiligo, lupus
* Differential diagnosis depends on: appearance, distribution, medical history, and supportive tests.

{| class=&quot;wikitable&quot;
! Criteria !! Allergic Inflammation !! Fungal Infection !! Autoimmune
|-
| Cause || Allergy + genetic predisposition || Malassezia fungus || Body attacks skin cells
|-
| Signs || Itching, dryness, cracking || Light/dark patches, scales || Clear white patches, brush-like rash
|-
| Complications || Secondary infection || Spread across body || Systemic issues (lupus)
|-
| Prevention || Moisturize, avoid irritants || Hygiene, early antifungal treatment || Sun protection, medical follow-up
|}

== Chapter 2 – Eczema vs Psoriasis ==
=== For General Readers ===
* Eczema: Severe itching and dryness, usually in skin folds of hands and knees, with redness and cracking.
* Psoriasis: Thick red plaques covered with silvery scales, often on elbows, knees, and scalp.

''Examples:''
* Child scratching hands constantly → Eczema
* Red plaques on adult elbow → Psoriasis

=== For Students and Doctors ===
* Eczema (Atopic Dermatitis)
** Mechanism: Chronic inflammation with hypersensitivity
** Flexural distribution, erythematous plaques, lichenification
** Treatment: Emollients, topical corticosteroids, antihistamines
* Psoriasis
** Mechanism: Autoimmune inflammation, genetic
** Extensor surfaces, well-demarcated plaques with silvery scales
** Treatment: Topical steroids, phototherapy, systemic therapy, biologics

{| class=&quot;wikitable&quot;
! Criteria !! Eczema !! Psoriasis
|-
| Age || Usually children and young adults || Any age, mostly adults
|-
| Location || Skin folds || Elbows, knees, scalp
|-
| Itching severity || Severe || Relatively mild
|-
| Scaling || Minimal || Thick, silvery
|-
| Complications || Secondary infection || Arthritis, psychological impact
|-
| Treatment || Moisturizers, steroids || Steroids, phototherapy, immune drugs
|-
| Prevention || Avoid irritants, moisturize || Prevent dryness, medical follow-up
|}

== Chapter 3 – Fungal Skin Infections vs Vitiligo ==
=== For General Readers ===
* Fungal skin infections: Light or dark patches with fine scaling, usually on chest and back, mild itching
* Vitiligo: Clear white patches, usually on face and hands, not itchy

''Examples:''
* Light chest patch with scales → Fungal infection
* White patches on hands that do not fade → Vitiligo

=== For Students and Doctors ===
* Fungal Skin Infections (Tinea versicolor)
** Malassezia species, hypopigmented or hyperpigmented macules with fine scaling
** Trunk, upper arms, neck
** Treatment: Topical antifungals, selenium sulfide, oral antifungals if extensive
* Vitiligo
** Autoimmune destruction of melanocytes
** Well-demarcated depigmented macules, chronic course
** Treatment: Topical corticosteroids, calcineurin inhibitors, phototherapy, surgical options

{| class=&quot;wikitable&quot;
! Criteria !! Fungal Skin Infections !! Vitiligo
|-
| Color || Light/Dark || Clear white
|-
| Scaling || Fine || None
|-
| Itching || Mild || Usually none
|-
| Location || Chest, back, neck || Face, hands, feet
|-
| Complications || Secondary infection, spread || Sun sensitivity, psychological impact
|-
| Prevention || Skin hygiene, drying || Sun protection
|-
| Treatment || Antifungals || Steroids, UV therapy, surgery
|}

== Chapter 4 – Scabies vs Eczema ==
=== For General Readers ===
* Scabies: Intense itching at night, small papules between fingers and wrists, contagious
* Eczema: Dry, cracked skin, persistent itching, non-contagious

=== For Students and Doctors ===
* Scabies
** Infestation by Sarcoptes scabiei
** Small papules, burrows, nocturnal pruritus
** Treatment: Permethrin 5%, oral ivermectin, treat contacts
* Eczema (Atopic Dermatitis)
** Chronic inflammatory skin disease
** Lichenification, flexural distribution
** Treatment: Emollients, topical corticosteroids, immunomodulators

{| class=&quot;wikitable&quot;
! Criteria !! Scabies !! Eczema
|-
| Cause || Contagious mite || Atopic inflammation
|-
| Itching || Intense at night || Persistent
|-
| Location || Between fingers, wrists, abdomen || Skin folds of knees, elbows, face
|-
| Contagious || Yes || No
|-
| Complications || Secondary infection, spread || Chronic dermatitis, secondary infection
|-
| Treatment || Permethrin, Ivermectin || Moisturizers, steroids, immune modulators
|-
| Prevention || Wash clothes and bedding, treat family || Continuous moisturization, avoid irritants
|}

== Chapter 5 – Acne vs Perioral Dermatitis ==
=== For General Readers ===
* Acne: Blackheads, whiteheads, pustules, usually on face, chest, back
* Perioral Dermatitis: Small red rash around mouth and nose, often in women and young adults, no blackheads/whiteheads

''Examples:''
* Pustules on face after puberty → Acne
* Red rash around mouth after using steroid creams → Perioral Dermatitis

=== For Students and Doctors ===
* Acne (Acne vulgaris)
** Sebum overproduction, follicular plugging, P. acnes colonization
** Comedones, papules, pustules, cysts
** Treatment: Topical retinoids, benzoyl peroxide, antibiotics, isotretinoin
* Perioral Dermatitis
** Triggered by topical steroids, irritants, fluoride toothpaste
** Small erythematous papules around mouth, sparing vermilion border
** Treatment: Stop triggers, topical/oral antibiotics (metronidazole, tetracyclines)

{| class=&quot;wikitable&quot;
! Criteria !! Acne !! Perioral Dermatitis
|-
| Affected areas || Face, chest, back || Around mouth and nose
|-
| Rash type || Black/whiteheads, pustules || Small red rash, no comedones
|-
| Cause || Excess sebum, hormones, bacteria || Steroid creams, irritants
|-
| Itching || Usually mild || Sometimes mild
|-
| Complications || Scars, pigmentation || Chronic redness, persistent inflammation
|-
| Treatment || Topicals, oral medications || Stop steroids, antibiotics
|-
| Prevention || Clean skin, avoid picking || Avoid steroid creams and irritants
|}

== Chapter 6 – Systemic Lupus Erythematosus vs Allergic Dermatitis ==
=== For General Readers ===
* SLE: Butterfly-shaped rash on face, often with fatigue and systemic symptoms
* Allergic Dermatitis: Rash appears and disappears, itchy, localized redness, often after contact with irritants

=== For Students and Doctors ===
* Systemic Lupus Erythematosus (SLE)
** Autoimmune disease affecting skin and internal organs
** Butterfly rash on face, may be accompanied by fatigue, fever, joint problems
** Treatment: Anti-inflammatory drugs, immunosuppressants, regular follow-up

* Allergic Dermatitis
** External allergic reaction
** Localized rash, itching, redness, usually resolves after removing irritant
** Treatment: Antihistamines, soothing creams, avoiding triggers

{| class=&quot;wikitable&quot;
! Criteria !! SLE !! Allergic Dermatitis
|-
| Color || Red rash on face || Temporary red rash
|-
| Symptoms || Fatigue, systemic signs || Itching only, no systemic symptoms
|-
| Cause || Autoimmune disease || External irritants
|-
| Complications || Affects organs || Usually resolves without complications
|-
| Treatment || Anti-inflammatory, immunosuppressants || Antihistamines, soothing creams
|-
| Prevention || Regular medical follow-up, sun protection || Avoid triggers
|}</text>
      <sha1>gaonxe07d2gqsqw87ebrxqfhxa4ofcc</sha1>
    </revision>
    <revision>
      <id>2809899</id>
      <parentid>2809898</parentid>
      <timestamp>2026-05-17T10:43:40Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <minor />
      <comment>Jtneill moved page [[Similar Skin Diseases – Clinical Diagnosis and Differential – Dr. Khaled Abdullah Almekhlafi]] to [[Similar Skin Diseases – Clinical Diagnosis and Differential]] without leaving a redirect: Remove author name from page title</comment>
      <origin>2809898</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="9528" sha1="gaonxe07d2gqsqw87ebrxqfhxa4ofcc" xml:space="preserve">== Book Information ==

* '''Title:''' Similar Skin Diseases – Clinical Diagnosis and Differential
* '''Author:''' Dr. Khaled Abdullah Almekhlafi
* '''Language:''' English
* '''Subject:''' Dermatology
* '''Institution:''' Sky Derma Clinic, Yemen
* '''Year:''' 2025

= Similar Skin Diseases – Clinical Diagnosis and Differential =
''Dr. Khaled Abdullah Al-Mukhlafi''
'''Dermatologist – Sky Derma Clinic, Sana'a, Yemen'''

== Table of Contents ==
* [[#chapter_1_-_skin_diseases_and_why_they_look_alike|Chapter 1 – Skin Diseases and Why They Look Alike]]
* [[#chapter_2_-_eczema_vs_psoriasis|Chapter 2 – Eczema vs Psoriasis]]
* [[#chapter_3_-_fungal_skin_infections_vs_vitiligo|Chapter 3 – Fungal Skin Infections vs Vitiligo]]
* [[#chapter_4_-_scabies_vs_eczema|Chapter 4 – Scabies vs Eczema]]
* [[#chapter_5_-_acne_vs_perioral_dermatitis|Chapter 5 – Acne vs Perioral Dermatitis]]
* [[#chapter_6_-_systemic_lupus_erythematosus_vs_allergic_dermatitis|Chapter 6 – Systemic Lupus Erythematosus vs Allergic Dermatitis]]

== Introduction ==
The skin is the largest organ of the body and serves as a protective barrier against germs, injuries, and sunlight. Skin diseases often appear with similar symptoms: rash, itching, light or dark spots, or scaling, making diagnosis challenging for the general public and sometimes even for doctors.

'''Purpose of this book:'''
* Help general readers understand similar skin diseases.
* Provide comprehensive scientific explanations for students and doctors about each disease, its causes, and treatment.
* Offer quick comparison tables to facilitate differential diagnosis.
* Give practical advice for prevention and skin care.

== Chapter 1 – Skin Diseases and Why They Look Alike ==
=== For General Readers ===
* The skin is sensitive and responds quickly to damage, whether inflammation, infection, or immune attack.
* Diseases appear as: redness, itching, light or dark patches, scales.

''Practical examples:''
* Nighttime itching between fingers → Scabies
* Dry, cracked hands with itching → Eczema
* Light patches with scales → Fungal infection
* Clear white patches → Vitiligo

=== For Students and Doctors ===
* The skin consists of the epidermis, dermis, and subcutaneous tissue.
* Causes of similarity:
** Inflammation → Eczema, allergic rash
** Fungal infection → Tinea versicolor
** Autoimmune → Vitiligo, lupus
* Differential diagnosis depends on: appearance, distribution, medical history, and supportive tests.

{| class=&quot;wikitable&quot;
! Criteria !! Allergic Inflammation !! Fungal Infection !! Autoimmune
|-
| Cause || Allergy + genetic predisposition || Malassezia fungus || Body attacks skin cells
|-
| Signs || Itching, dryness, cracking || Light/dark patches, scales || Clear white patches, brush-like rash
|-
| Complications || Secondary infection || Spread across body || Systemic issues (lupus)
|-
| Prevention || Moisturize, avoid irritants || Hygiene, early antifungal treatment || Sun protection, medical follow-up
|}

== Chapter 2 – Eczema vs Psoriasis ==
=== For General Readers ===
* Eczema: Severe itching and dryness, usually in skin folds of hands and knees, with redness and cracking.
* Psoriasis: Thick red plaques covered with silvery scales, often on elbows, knees, and scalp.

''Examples:''
* Child scratching hands constantly → Eczema
* Red plaques on adult elbow → Psoriasis

=== For Students and Doctors ===
* Eczema (Atopic Dermatitis)
** Mechanism: Chronic inflammation with hypersensitivity
** Flexural distribution, erythematous plaques, lichenification
** Treatment: Emollients, topical corticosteroids, antihistamines
* Psoriasis
** Mechanism: Autoimmune inflammation, genetic
** Extensor surfaces, well-demarcated plaques with silvery scales
** Treatment: Topical steroids, phototherapy, systemic therapy, biologics

{| class=&quot;wikitable&quot;
! Criteria !! Eczema !! Psoriasis
|-
| Age || Usually children and young adults || Any age, mostly adults
|-
| Location || Skin folds || Elbows, knees, scalp
|-
| Itching severity || Severe || Relatively mild
|-
| Scaling || Minimal || Thick, silvery
|-
| Complications || Secondary infection || Arthritis, psychological impact
|-
| Treatment || Moisturizers, steroids || Steroids, phototherapy, immune drugs
|-
| Prevention || Avoid irritants, moisturize || Prevent dryness, medical follow-up
|}

== Chapter 3 – Fungal Skin Infections vs Vitiligo ==
=== For General Readers ===
* Fungal skin infections: Light or dark patches with fine scaling, usually on chest and back, mild itching
* Vitiligo: Clear white patches, usually on face and hands, not itchy

''Examples:''
* Light chest patch with scales → Fungal infection
* White patches on hands that do not fade → Vitiligo

=== For Students and Doctors ===
* Fungal Skin Infections (Tinea versicolor)
** Malassezia species, hypopigmented or hyperpigmented macules with fine scaling
** Trunk, upper arms, neck
** Treatment: Topical antifungals, selenium sulfide, oral antifungals if extensive
* Vitiligo
** Autoimmune destruction of melanocytes
** Well-demarcated depigmented macules, chronic course
** Treatment: Topical corticosteroids, calcineurin inhibitors, phototherapy, surgical options

{| class=&quot;wikitable&quot;
! Criteria !! Fungal Skin Infections !! Vitiligo
|-
| Color || Light/Dark || Clear white
|-
| Scaling || Fine || None
|-
| Itching || Mild || Usually none
|-
| Location || Chest, back, neck || Face, hands, feet
|-
| Complications || Secondary infection, spread || Sun sensitivity, psychological impact
|-
| Prevention || Skin hygiene, drying || Sun protection
|-
| Treatment || Antifungals || Steroids, UV therapy, surgery
|}

== Chapter 4 – Scabies vs Eczema ==
=== For General Readers ===
* Scabies: Intense itching at night, small papules between fingers and wrists, contagious
* Eczema: Dry, cracked skin, persistent itching, non-contagious

=== For Students and Doctors ===
* Scabies
** Infestation by Sarcoptes scabiei
** Small papules, burrows, nocturnal pruritus
** Treatment: Permethrin 5%, oral ivermectin, treat contacts
* Eczema (Atopic Dermatitis)
** Chronic inflammatory skin disease
** Lichenification, flexural distribution
** Treatment: Emollients, topical corticosteroids, immunomodulators

{| class=&quot;wikitable&quot;
! Criteria !! Scabies !! Eczema
|-
| Cause || Contagious mite || Atopic inflammation
|-
| Itching || Intense at night || Persistent
|-
| Location || Between fingers, wrists, abdomen || Skin folds of knees, elbows, face
|-
| Contagious || Yes || No
|-
| Complications || Secondary infection, spread || Chronic dermatitis, secondary infection
|-
| Treatment || Permethrin, Ivermectin || Moisturizers, steroids, immune modulators
|-
| Prevention || Wash clothes and bedding, treat family || Continuous moisturization, avoid irritants
|}

== Chapter 5 – Acne vs Perioral Dermatitis ==
=== For General Readers ===
* Acne: Blackheads, whiteheads, pustules, usually on face, chest, back
* Perioral Dermatitis: Small red rash around mouth and nose, often in women and young adults, no blackheads/whiteheads

''Examples:''
* Pustules on face after puberty → Acne
* Red rash around mouth after using steroid creams → Perioral Dermatitis

=== For Students and Doctors ===
* Acne (Acne vulgaris)
** Sebum overproduction, follicular plugging, P. acnes colonization
** Comedones, papules, pustules, cysts
** Treatment: Topical retinoids, benzoyl peroxide, antibiotics, isotretinoin
* Perioral Dermatitis
** Triggered by topical steroids, irritants, fluoride toothpaste
** Small erythematous papules around mouth, sparing vermilion border
** Treatment: Stop triggers, topical/oral antibiotics (metronidazole, tetracyclines)

{| class=&quot;wikitable&quot;
! Criteria !! Acne !! Perioral Dermatitis
|-
| Affected areas || Face, chest, back || Around mouth and nose
|-
| Rash type || Black/whiteheads, pustules || Small red rash, no comedones
|-
| Cause || Excess sebum, hormones, bacteria || Steroid creams, irritants
|-
| Itching || Usually mild || Sometimes mild
|-
| Complications || Scars, pigmentation || Chronic redness, persistent inflammation
|-
| Treatment || Topicals, oral medications || Stop steroids, antibiotics
|-
| Prevention || Clean skin, avoid picking || Avoid steroid creams and irritants
|}

== Chapter 6 – Systemic Lupus Erythematosus vs Allergic Dermatitis ==
=== For General Readers ===
* SLE: Butterfly-shaped rash on face, often with fatigue and systemic symptoms
* Allergic Dermatitis: Rash appears and disappears, itchy, localized redness, often after contact with irritants

=== For Students and Doctors ===
* Systemic Lupus Erythematosus (SLE)
** Autoimmune disease affecting skin and internal organs
** Butterfly rash on face, may be accompanied by fatigue, fever, joint problems
** Treatment: Anti-inflammatory drugs, immunosuppressants, regular follow-up

* Allergic Dermatitis
** External allergic reaction
** Localized rash, itching, redness, usually resolves after removing irritant
** Treatment: Antihistamines, soothing creams, avoiding triggers

{| class=&quot;wikitable&quot;
! Criteria !! SLE !! Allergic Dermatitis
|-
| Color || Red rash on face || Temporary red rash
|-
| Symptoms || Fatigue, systemic signs || Itching only, no systemic symptoms
|-
| Cause || Autoimmune disease || External irritants
|-
| Complications || Affects organs || Usually resolves without complications
|-
| Treatment || Anti-inflammatory, immunosuppressants || Antihistamines, soothing creams
|-
| Prevention || Regular medical follow-up, sun protection || Avoid triggers
|}</text>
      <sha1>gaonxe07d2gqsqw87ebrxqfhxa4ofcc</sha1>
    </revision>
    <revision>
      <id>2809900</id>
      <parentid>2809899</parentid>
      <timestamp>2026-05-17T10:45:21Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <comment>+ [[Category:Medicine]]</comment>
      <origin>2809900</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="9551" sha1="i7jtv7qkx1bgzb7mnn3kav4nxktq7qs" xml:space="preserve">== Book Information ==

* '''Title:''' Similar Skin Diseases – Clinical Diagnosis and Differential
* '''Author:''' Dr. Khaled Abdullah Almekhlafi
* '''Language:''' English
* '''Subject:''' Dermatology
* '''Institution:''' Sky Derma Clinic, Yemen
* '''Year:''' 2025

= Similar Skin Diseases – Clinical Diagnosis and Differential =
''Dr. Khaled Abdullah Al-Mukhlafi''
'''Dermatologist – Sky Derma Clinic, Sana'a, Yemen'''

== Table of Contents ==
* [[#chapter_1_-_skin_diseases_and_why_they_look_alike|Chapter 1 – Skin Diseases and Why They Look Alike]]
* [[#chapter_2_-_eczema_vs_psoriasis|Chapter 2 – Eczema vs Psoriasis]]
* [[#chapter_3_-_fungal_skin_infections_vs_vitiligo|Chapter 3 – Fungal Skin Infections vs Vitiligo]]
* [[#chapter_4_-_scabies_vs_eczema|Chapter 4 – Scabies vs Eczema]]
* [[#chapter_5_-_acne_vs_perioral_dermatitis|Chapter 5 – Acne vs Perioral Dermatitis]]
* [[#chapter_6_-_systemic_lupus_erythematosus_vs_allergic_dermatitis|Chapter 6 – Systemic Lupus Erythematosus vs Allergic Dermatitis]]

== Introduction ==
The skin is the largest organ of the body and serves as a protective barrier against germs, injuries, and sunlight. Skin diseases often appear with similar symptoms: rash, itching, light or dark spots, or scaling, making diagnosis challenging for the general public and sometimes even for doctors.

'''Purpose of this book:'''
* Help general readers understand similar skin diseases.
* Provide comprehensive scientific explanations for students and doctors about each disease, its causes, and treatment.
* Offer quick comparison tables to facilitate differential diagnosis.
* Give practical advice for prevention and skin care.

== Chapter 1 – Skin Diseases and Why They Look Alike ==
=== For General Readers ===
* The skin is sensitive and responds quickly to damage, whether inflammation, infection, or immune attack.
* Diseases appear as: redness, itching, light or dark patches, scales.

''Practical examples:''
* Nighttime itching between fingers → Scabies
* Dry, cracked hands with itching → Eczema
* Light patches with scales → Fungal infection
* Clear white patches → Vitiligo

=== For Students and Doctors ===
* The skin consists of the epidermis, dermis, and subcutaneous tissue.
* Causes of similarity:
** Inflammation → Eczema, allergic rash
** Fungal infection → Tinea versicolor
** Autoimmune → Vitiligo, lupus
* Differential diagnosis depends on: appearance, distribution, medical history, and supportive tests.

{| class=&quot;wikitable&quot;
! Criteria !! Allergic Inflammation !! Fungal Infection !! Autoimmune
|-
| Cause || Allergy + genetic predisposition || Malassezia fungus || Body attacks skin cells
|-
| Signs || Itching, dryness, cracking || Light/dark patches, scales || Clear white patches, brush-like rash
|-
| Complications || Secondary infection || Spread across body || Systemic issues (lupus)
|-
| Prevention || Moisturize, avoid irritants || Hygiene, early antifungal treatment || Sun protection, medical follow-up
|}

== Chapter 2 – Eczema vs Psoriasis ==
=== For General Readers ===
* Eczema: Severe itching and dryness, usually in skin folds of hands and knees, with redness and cracking.
* Psoriasis: Thick red plaques covered with silvery scales, often on elbows, knees, and scalp.

''Examples:''
* Child scratching hands constantly → Eczema
* Red plaques on adult elbow → Psoriasis

=== For Students and Doctors ===
* Eczema (Atopic Dermatitis)
** Mechanism: Chronic inflammation with hypersensitivity
** Flexural distribution, erythematous plaques, lichenification
** Treatment: Emollients, topical corticosteroids, antihistamines
* Psoriasis
** Mechanism: Autoimmune inflammation, genetic
** Extensor surfaces, well-demarcated plaques with silvery scales
** Treatment: Topical steroids, phototherapy, systemic therapy, biologics

{| class=&quot;wikitable&quot;
! Criteria !! Eczema !! Psoriasis
|-
| Age || Usually children and young adults || Any age, mostly adults
|-
| Location || Skin folds || Elbows, knees, scalp
|-
| Itching severity || Severe || Relatively mild
|-
| Scaling || Minimal || Thick, silvery
|-
| Complications || Secondary infection || Arthritis, psychological impact
|-
| Treatment || Moisturizers, steroids || Steroids, phototherapy, immune drugs
|-
| Prevention || Avoid irritants, moisturize || Prevent dryness, medical follow-up
|}

== Chapter 3 – Fungal Skin Infections vs Vitiligo ==
=== For General Readers ===
* Fungal skin infections: Light or dark patches with fine scaling, usually on chest and back, mild itching
* Vitiligo: Clear white patches, usually on face and hands, not itchy

''Examples:''
* Light chest patch with scales → Fungal infection
* White patches on hands that do not fade → Vitiligo

=== For Students and Doctors ===
* Fungal Skin Infections (Tinea versicolor)
** Malassezia species, hypopigmented or hyperpigmented macules with fine scaling
** Trunk, upper arms, neck
** Treatment: Topical antifungals, selenium sulfide, oral antifungals if extensive
* Vitiligo
** Autoimmune destruction of melanocytes
** Well-demarcated depigmented macules, chronic course
** Treatment: Topical corticosteroids, calcineurin inhibitors, phototherapy, surgical options

{| class=&quot;wikitable&quot;
! Criteria !! Fungal Skin Infections !! Vitiligo
|-
| Color || Light/Dark || Clear white
|-
| Scaling || Fine || None
|-
| Itching || Mild || Usually none
|-
| Location || Chest, back, neck || Face, hands, feet
|-
| Complications || Secondary infection, spread || Sun sensitivity, psychological impact
|-
| Prevention || Skin hygiene, drying || Sun protection
|-
| Treatment || Antifungals || Steroids, UV therapy, surgery
|}

== Chapter 4 – Scabies vs Eczema ==
=== For General Readers ===
* Scabies: Intense itching at night, small papules between fingers and wrists, contagious
* Eczema: Dry, cracked skin, persistent itching, non-contagious

=== For Students and Doctors ===
* Scabies
** Infestation by Sarcoptes scabiei
** Small papules, burrows, nocturnal pruritus
** Treatment: Permethrin 5%, oral ivermectin, treat contacts
* Eczema (Atopic Dermatitis)
** Chronic inflammatory skin disease
** Lichenification, flexural distribution
** Treatment: Emollients, topical corticosteroids, immunomodulators

{| class=&quot;wikitable&quot;
! Criteria !! Scabies !! Eczema
|-
| Cause || Contagious mite || Atopic inflammation
|-
| Itching || Intense at night || Persistent
|-
| Location || Between fingers, wrists, abdomen || Skin folds of knees, elbows, face
|-
| Contagious || Yes || No
|-
| Complications || Secondary infection, spread || Chronic dermatitis, secondary infection
|-
| Treatment || Permethrin, Ivermectin || Moisturizers, steroids, immune modulators
|-
| Prevention || Wash clothes and bedding, treat family || Continuous moisturization, avoid irritants
|}

== Chapter 5 – Acne vs Perioral Dermatitis ==
=== For General Readers ===
* Acne: Blackheads, whiteheads, pustules, usually on face, chest, back
* Perioral Dermatitis: Small red rash around mouth and nose, often in women and young adults, no blackheads/whiteheads

''Examples:''
* Pustules on face after puberty → Acne
* Red rash around mouth after using steroid creams → Perioral Dermatitis

=== For Students and Doctors ===
* Acne (Acne vulgaris)
** Sebum overproduction, follicular plugging, P. acnes colonization
** Comedones, papules, pustules, cysts
** Treatment: Topical retinoids, benzoyl peroxide, antibiotics, isotretinoin
* Perioral Dermatitis
** Triggered by topical steroids, irritants, fluoride toothpaste
** Small erythematous papules around mouth, sparing vermilion border
** Treatment: Stop triggers, topical/oral antibiotics (metronidazole, tetracyclines)

{| class=&quot;wikitable&quot;
! Criteria !! Acne !! Perioral Dermatitis
|-
| Affected areas || Face, chest, back || Around mouth and nose
|-
| Rash type || Black/whiteheads, pustules || Small red rash, no comedones
|-
| Cause || Excess sebum, hormones, bacteria || Steroid creams, irritants
|-
| Itching || Usually mild || Sometimes mild
|-
| Complications || Scars, pigmentation || Chronic redness, persistent inflammation
|-
| Treatment || Topicals, oral medications || Stop steroids, antibiotics
|-
| Prevention || Clean skin, avoid picking || Avoid steroid creams and irritants
|}

== Chapter 6 – Systemic Lupus Erythematosus vs Allergic Dermatitis ==
=== For General Readers ===
* SLE: Butterfly-shaped rash on face, often with fatigue and systemic symptoms
* Allergic Dermatitis: Rash appears and disappears, itchy, localized redness, often after contact with irritants

=== For Students and Doctors ===
* Systemic Lupus Erythematosus (SLE)
** Autoimmune disease affecting skin and internal organs
** Butterfly rash on face, may be accompanied by fatigue, fever, joint problems
** Treatment: Anti-inflammatory drugs, immunosuppressants, regular follow-up

* Allergic Dermatitis
** External allergic reaction
** Localized rash, itching, redness, usually resolves after removing irritant
** Treatment: Antihistamines, soothing creams, avoiding triggers

{| class=&quot;wikitable&quot;
! Criteria !! SLE !! Allergic Dermatitis
|-
| Color || Red rash on face || Temporary red rash
|-
| Symptoms || Fatigue, systemic signs || Itching only, no systemic symptoms
|-
| Cause || Autoimmune disease || External irritants
|-
| Complications || Affects organs || Usually resolves without complications
|-
| Treatment || Anti-inflammatory, immunosuppressants || Antihistamines, soothing creams
|-
| Prevention || Regular medical follow-up, sun protection || Avoid triggers
|}

[[Category:Medicine]]</text>
      <sha1>i7jtv7qkx1bgzb7mnn3kav4nxktq7qs</sha1>
    </revision>
  </page>
  <page>
    <title>Talk:Introduction to thermodynamics/Extensive and intensive properties</title>
    <ns>1</ns>
    <id>324863</id>
    <revision>
      <id>2809885</id>
      <parentid>2769163</parentid>
      <timestamp>2026-05-17T10:09:54Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <comment>/* Attribution */ Reply</comment>
      <origin>2809885</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="908" sha1="1uw8fc4vsmruxlemikw4x8xfm9w9a8g" xml:space="preserve">== Attribution ==

This chapter incorporates material from:
[https://pressbooks.bccampus.ca/thermo1/chapter/extensive-and-intensive-properties/ &quot;Extensive and intensive properties&quot;] in ''INTRODUCTION TO ENGINEERING THERMODYNAMICS'' by Claire Yu Yan, published by Pressbooks.  
Licensed under the [https://creativecommons.org/licenses/by-nc-sa/4.0/ Attribution-NonCommercial-ShareAlike 4.0 International]. [[User:IanVG|IanVG]] ([[User talk:IanVG|discuss]] • [[Special:Contributions/IanVG|contribs]]) 15:09, 20 October 2025 (UTC)

:Just sent a request to Dr. Claire Yu Yan for permission for use of the learning resources. [[User:IanVG|IanVG]] ([[User talk:IanVG|discuss]] • [[Special:Contributions/IanVG|contribs]]) 21:49, 12 November 2025 (UTC)
::What was the response? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:09, 17 May 2026 (UTC)</text>
      <sha1>1uw8fc4vsmruxlemikw4x8xfm9w9a8g</sha1>
    </revision>
  </page>
  <page>
    <title>Wikiversity:Request custodian action/Archive/29</title>
    <ns>4</ns>
    <id>325936</id>
    <revision>
      <id>2809681</id>
      <parentid>2791650</parentid>
      <timestamp>2026-05-16T19:14:41Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Dan Polansky */ archive from [[Wikiversity:Request custodian action]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809681</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="135977" sha1="nhpp5k3we191ehiuqm0v7z213mtxj1u" xml:space="preserve">{{archive top|{{done}} -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:28, 27 November 2025 (UTC)}}
== [[User talk:Marciohendrik]] ==

Please review this request for an unblock,  ({{ping|Jtneill}} for mentor feedback). Please also note:

* Previous history of userpage issues ([[:w:User:Marciohendrik]], [[User:Marciohendrik]])
* No non-personal Wikimedia usage ([[Special:CentralAuth/Marciohendrik]])
* [[User:Marciohendrik]] has not mentioned anything relevant to Wikiversity/Wikimedia
* Too fast for [[:w:Wikipedia:Standard offer]]
* [[Wikiversity:Privacy policy]] issues in this request

I look forward to hearing from other custodians. [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 22:52, 21 July 2025 (UTC)

:Perhaps try unblock and encourage user to contribute to learning by editing related pages e.g., about music? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 00:42, 22 July 2025 (UTC)
::Hello Jtneill,
::Sounds a good idea.  [[User:Marciohendrik|Marcio Hendrik]] ([[User talk:Marciohendrik|discuss]] • [[Special:Contributions/Marciohendrik|contribs]]) 09:14, 23 July 2025 (UTC)
:Seems safe enough to unblock and encourage, as JTN suggested. The fact that he wrote an email is something. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 00:58, 22 July 2025 (UTC)
:: I have given unblock per above. [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:41, 22 July 2025 (UTC)
:::Thanks for all you do. Feel free to ask for second opinions, but also know that you have great judgement and I personally trust you entirely. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 19:17, 22 July 2025 (UTC)
:::Just to weigh in because I recieved an email from Marcio regarding this block, but I think the unblock is fine. The email shows that the user is responsive and willing to improve, so a warning and a detailed welcome template should suffice. —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 19:37, 22 July 2025 (UTC)
::::Hello Atcovi,
::::Thanks for the understanding. I am responsive and willing to improve, you are correct. 
::::Marcio [[User:Marciohendrik|Marcio Hendrik]] ([[User talk:Marciohendrik|discuss]] • [[Special:Contributions/Marciohendrik|contribs]]) 09:21, 23 July 2025 (UTC)
::Thank you! [[User:Marciohendrik|Marcio Hendrik]] ([[User talk:Marciohendrik|discuss]] • [[Special:Contributions/Marciohendrik|contribs]]) 09:15, 23 July 2025 (UTC)
:Hello MathXplore,
:I now understand the rigour implied over Wiki and articles. 
:I wish to join not only to participate and contribute, but also to improve my writing skills and recycle my knowledge, as I know that by explaining something you also revisit and learn more. 
:Compared to all the contributors I got in touch, your background and experience are on another level. 
:I welcome all suggestions coming from you guys; please do not hesitate to contact me when you feel like.
:Sincerely,
:Marcio Hendrik [[User:Marciohendrik|Marcio Hendrik]] ([[User talk:Marciohendrik|discuss]] • [[Special:Contributions/Marciohendrik|contribs]]) 09:20, 23 July 2025 (UTC)
:: My proposal would be this: 1) keep the user account unblocked, but 2) delete [[User:Marciohendrik]] as self-promotional until the time the user delivers at least some non-self-promotional content.
:: The reasoning is this. If we keep the user page content as is, then we by implication affirm the following rule/principle: in the English Wikiversity, users are allowed to create self-promotional/self-presentation user pages even if they contribute no content. I am not convinced the rule/principle is desirable. On the other hand, one could argue that this moderate self-promotion creates almost no harm. In https://foundation.wikimedia.org/wiki/Policy:Terms_of_Use, I did not quickly find anything supporting a particular corrective action.
:: As for the internet presence/identity of the user, he is possibly this person: https://www.linkedin.com/in/marcio-hendrik.
:: Incidentally, my own user page in the English Wikiversity and Meta can be easily seen as self-promotional; in defense of this, I would respond that I spent years (actually over a decade) delivering content before I expanded my user pages in this way. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 08:54, 27 July 2025 (UTC)
:::Hello Mr. Polansky,
:::Yes ''that'' user is me. I'm not concerned about my user page for the moment; I am currently working on the edits on existing pages as suggested by the contributors above.
:::Regards,
:::Marcio 
:::[[User:Marciohendrik|Marcio Hendrik]] ([[User talk:Marciohendrik|discuss]] • [[Special:Contributions/Marciohendrik|contribs]]) 11:10, 27 July 2025 (UTC)
{{archive bottom}}

{{archive top|{{done}} -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:29, 27 November 2025 (UTC)}}
==Request to Approve Page Edit with External Links==
Dear Admin,  
I’m a new contributor to Wikiversity. I’m in the process of documenting original modern Chinese proverbs that I personally coined, with proper authorship declaration under my full name “Ho Siew Khui 何小驹 (Hé Xiǎojū)”.

My edit was blocked due to the “New User Exceeded New Page Limit” and “New User Created Page with External Link” rules. I understand these protections, but I assure you the content is constructive, original, and non-promotional. The external links are to my published articles on Medium that fully explain each proverb in detail.

Kindly assist to approve or whitelist this contribution. Thank you very much for your support.

Best regards,  
Ho Siew Khui 何小驹 (Hé Xiǎojū)
: I propose to move [[Modern Chinese Proverbs and Sayings by Hé Xiǎojū / Kenny Ho]] to user space. My initial articulation of rationale is a cheap/quick one: not good enough as Wikiversity material; very little to learn from; serves mainly to promote articles by the wiki page author located outside of Wikiversity. Anyone has a better rationale articulation?
: (The post I am responding to is by {{User|KennyHoProverbs}}.) --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 09:29, 27 July 2025 (UTC)

:Thank you for your response, Dan, and for giving me the chance to clarify my intentions.
:This project documents original '''modern Chinese proverbs''' that I personally coined and published with full authorship declaration. Each proverb reflects contemporary human behaviour while drawing inspiration from traditional Chinese idioms, forming a new and educational category of linguistic expression.
:Far from being promotional, the page serves as a '''language and cultural learning resource''', offering:
:– Bilingual explanations (Chinese + English)
:– Detailed semantic breakdowns with Hanyu Pinyin
:– Real-world application and interpretation
:– Authorship transparency for academic and public referencing
:The external links included point to full essays that explain each phrase in greater detail, but the core explanatory content is fully present on Wikiversity — ensuring the page stands independently as an educational entry.
:I believe this aligns with Wikiversity’s purpose of supporting learning materials, especially for:
:– Chinese language and cultural studies
:– Modern idiom and proverb creation
:– Creative linguistic expression in contemporary society
:If needed, I’m open to reformatting or restructuring the page to better meet mainspace standards. I respectfully ask for your consideration in allowing it to remain within mainspace to support broader accessibility, educational referencing, and authorship traceability.
:Warm regards,
:'''Ho Siew Khui 何小驹 (Hé Xiǎojū)''' [[User:KennyHoProverbs|KennyHoProverbs]] ([[User talk:KennyHoProverbs|discuss]] • [[Special:Contributions/KennyHoProverbs|contribs]]) 14:10, 27 July 2025 (UTC)
{{archive bottom}}

{{archive top|{{done}} -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:31, 27 November 2025 (UTC)}}
== User Nguyễn Khánh Tùng and his pages ==
FYI, I moved some pages to user space, to [[User:Nguyennhuhuyen/The NKTg Law on Varying Inertia]] and [[User:NKTLaw/The NKT Law on Position and Varying Inertia Interaction]]. Rationale: it is very likely pseudophysics, and I intend to do similarly with similar pages from the same source. It is also self-promotional, but in user space it will probably do little to no harm; NKT seems to stand for Nguyễn Khánh Tùng.

{{User|Nguyennhuhuyen}} was blocked for block evasion; other user accounts likely of the same person seem to include {{User|Khotramhuong}}, {{User|NKTLaw_Nguyen_Khanh_Tung}}, {{User|NKTLaw}}, etc.

An aside, we cannot be perfectly certain the editor is really called &quot;Nguyễn Khánh Tùng&quot; or whether it is an impersonator, I think.

Admittedly, this is not really a request for custodian action but a single record to coordinate blocking and quasi-deletion relating to this person. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 09:11, 27 July 2025 (UTC)
{{archive bottom}}

{{archive top|{{done}} -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:32, 27 November 2025 (UTC)}}
{{archive top|{{not done}} Not appropriate and lacks coherence. See [[WV:Scope]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:43, 27 November 2025 (UTC)}}
==Request to add page; Circumstantial evidence of God==

Here is the response I got when trying to create the page &quot;Circumstantial evidence of God&quot;

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please inform an administrator of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Exceeded New Page Limit

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please inform an administrator of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link

I think this is an appropriate research project to add to wikiversity. Please add this page.

https://en.wikiversity.org/wiki/Circumstantial_evidence_of_God

{{Research project}}

This is a research project to investigate the theory of circumstantial evidence proving the existence of the God of the Bible. Individually, one item of circumstantial evidence doesn't amount to much, but as a tier grouped together they allow one to indirectly conclude the existence of a fact.

Please feel free to add to the discussion and review of these ideas.

{{Collapsible START|sections &quot;What about plate tectonics?&quot; to &quot;Serpent hind legs&quot;|collapsed strong wide}}
===discussion and review===

====What about plate tectonics?====

There may be some subduction. But the core samples of the oceanic crust show that the Earth has expanded.

====What about the uniqueness of the animals in Australia?====

It's just like Galapagos island. Adaptation and environmental favorability for particular species would produce vast differences at least in some places of the Earth over 4,388 years after the flood.

===theory under review===

====Deluge Geology, Radio Dating Inaccuracy, and Creative Days====

Facts;


(1) the radioactive decay rate is NOT a constant; neutrino intensity definitely effects the radioactive decay rate; https://web.archive.org/web/20150528020329/http://news.stanford.edu/news/2010/august/sun-082310.html

The higher the neutrino intensity the lower the radioactive decay rate.


(2) atmospheric electrons backscatter neutrinos increasing the intensity of neutrino radiation towards the earth (the atmosphere is a converging lens to neutrinos)

An Earth with a larger atmosphere (such as one that had all the oceanic water as a gas or plasma in a gigantic ionosphere) would increase the intensity of neutrino radiation towards the earth and given fact 1, lower the radioactive decay rate of radioisotopes.


(3) the continental plates fit together completely on a smaller Earth; https://www.youtube.com/watch?v=cnEkFofRFx0


(4) land fossils prove most of the Earth continental plates have been dry land


(5) on a smaller Earth (with all the continental plates put back together) the oceanic water would cover the entire Earth


(6) given fact 4, and 5, it follows that the oceanic water in the past was not on land (rather it must have been in the atmosphere so that it could fall to Earth).


(7) given fact 3, and 6, it follows that the Earth was smaller with a gigantic gaseous or plasma water canopy


(8) given fact 5, and 7, it follows that there was a global flood!!!


(9) but given 2, and 7, it follows that the radioactive decay rate was significantly lower before the flood


(10) given 9, the radio dating methods that assume constants in the radioactive decay rates are absolutely inaccurate (though still having good precision)


(11) the flood must be the last mass extinction event 


(12) the K-T iridium aerosols [presumably from meteoroids] and any possible volcanic ash would have acted like cloud condensation nuclei, cloud seeding the deluge


(13) if God saved all the original animals in the Ark then the genera after the flood (notice blue line) matches the genera at Adam's creation (notice yellow line) proving God saved all the original animals; https://commons.wikimedia.org/wiki/File:Phanerozoic_Biodiversity-2.png


(14) If we assume that Adam was 44a when Eve was born and that the creative days are 221Ma (according to the dating inaccuracy) then a creative day is 9,500 years 

Eve became the Mother of Seth at 86a. Genesis 5:3 Seth became the father of Enosh at 105. Genesis 5:6 Enosh became the father of Kenan at 90. Genesis 5:9 Cainan became the father of Mahalalel at 70. Genesis 5:12 Mahalalel became the father of Jared at 65. Genesis 5:15 Jared became the father of Enoch at 162. Genesis 5:18 Enoch became the father of Methuselah at 65. Genesis 5:21 Methuselah became the father of Lamech at 187. Genesis 5:25 Lamech became the father of Noah at 182. Genesis 5:28 The Flood started when Noah was 600. Genesis 7:6

(86+105+90+70+65+162+65+187+182+600)=1612a of creative day seven [Eve's creation to the flood]

1612a*221/37.5=9500 [this is a creative day]


Fifth day

510 Ma the first fish, the jawless ostracoderms.

410 Ma the first fish with jaws, the acanthodians.

365 Ma the tetrapods.

350 Ma the dragonfly (the first flying creatures were insects).

340 Ma the amniotes.

And God went on to say: Let the waters swarm forth a swarm of living souls and let flying creatures fly over the earth upon the face of the expanse of the heavens. And God proceeded to create the great monsters and every living soul that moves about, which the waters swarmed forth according to their kinds, and every winged flying creature according to its kind. And God got to see that [it was] good. ... And there came to be evening and there came to be morning, a fifth day. (Genesis 1:20-23)

Surprisingly enough, the flying creatures in this verse is not birds (as many may have thought), rather, '''it is insects'''!


Sixth day

285 Ma the therapsids.

230 Ma the dinosaurs.

225 Ma the first true mammals, Gondwanadon tapani or Morganucodon watsoni.

150 Ma the first bird, Archaeopteryx.

And God went on to say: Let the earth put forth living souls according to their kinds, domestic animal and moving animal and wild beast of the earth according to its kind. And it came to be so. And God proceeded to make the wild beast of the earth according to its kind and the domestic animal according to its kind and every moving animal of the ground according to its kind. And God got to see that [it was] good. (Genesis 1:24, 25)

As you can see this work clarified our understanding of the bible (first flying creatures are insects) and the creation of the other animals matches the day of their biblical creation


(15) since the creation of Eve to the present it's been about 6000a


(16) Tyranusourus Rex fossils are dated between the creation of Eve and the date of the Flood; somewhere around 800a of creative day seven or ~5,200 years ago (inaccurately dated to 80Ma)

https://s.hdnux.com/photos/10/17/62/2161798/6/1200x0.jpg

https://www.science.org/cms/10.1126/science.1108397/asset/f350e639-3ffd-48d9-a488-2dfa943596dd/assets/graphic/307_1952_f2.jpeg

How old is this T. Rex blood and soft tissue? 5,200 years old or 80 MILLION years old?


I predict that the soft tissue found in T. Rex bone will Carbon 14 date to around 5,200 years old!

This will verify my theory about the Deluge Geology, Radio Dating Inaccuracy, and Creative Days.


That said, how could man, birds, and land animals have survived the deluge?

According to the bible (and over a hundred of other ancient sources), there was a great flood that destroyed the ancient world, for which, the gods spared some men and animals.

Jehovah claimed to cause the flood. In any cause we must grant at least the existence of advanced extraterrestrials (or gods exist or even that God exists) such that they could have spared some men, otherwise, mankind and all the animals on land could not have possibly survived such an event.


Ron Wyatt found at geological formation in the mountains of Ararat of petrified wood in the shape of a boat having the same length as described of the Ark in the Bible; https://i.pinimg.com/originals/55/8a/cb/558acb1d59f1dab953c3fcaa16cc2670.jpg

=====neutrinos warp spacetime inducing gravity=====


(1) I have a hunch that for sure electrons (but possibly all matter) gradients backscatter neutrinos into gradients which (increase the vacuum refractive index and) warping spacetime


(2) the atmosphere and the lithosphere are converging lenses to radiation including neutrinos


I predict that neutrinos induce something similar to the AC Kerr effect [the higher the intensity, the higher vacuum refractive index induced].


f this is true, then the vacuum refractive index is a transcendent function of neutrino radiation intensity.

In other words, the vacuum refractive index necessarily changes according to altitude.

Light travels slower in higher refractive index i.e. TIME DILATION according to altitude!


FYI, if material bodies (and their radiations and atmospheres) are a converging radiation Luneberg lens, the vacuum refractive index becomes itself stratified as a converging Luneberg lens!; i.e. curvature of light in outer space around objects such as the Sun, solar system, galaxy, galaxy clusters etc.


We will need to express the structure of matter; and to expand on Randel's orbitosphere in terms of electromagnetism, I claim the orbitosphere is a Kerr-induced self-focusing refraction curvature. One of the results being that as the vacuum refractive index increases, the Bohr radius shrinks [metaphor; imagine an electron orbiting an atom at a particular velocity and orbital frequency, if you slow the velocity (by increasing the refractive index) the orbit length would have to shrink to maintain the same orbital frequency] i.e. LENGTH CONTRACTION according to altitude (i.e. according to N radiation intensity).

https://brilliantlightpower.com/book-download-and-streaming/


as mass travels into higher vacuum refractive index, the mass of matter shrinks, but energy is conserved so the mass energy transforms into kinetic energy; in other words, there is gravity


http://www.newtonphysics.on.ca/gravity/index.html

=====thrust; artificial gravity; tractor beam; warp drive; photon torpedoes; through longitudinal radiation=====

I predict that longitudinal radiation can be used to create thrust, artificial gravity, tractor beams, a warp drive, and photon torpedoes.

====Sodom Brimstone====

With respects to the Divine, the spirits/angels/gods are the person of the Divine. That is simply how a monism/pantheism works. Even we are part of the Divine. So in a sense, we also are gods.

Anyway, the bible says; &quot;and the gods said, let us make man in our image&quot;

The Divine has no image. So, we cannot be made in the image of the Divine. But we can be made in the image of the gods. Another thing to point out is; functionally speaking, there is no difference between the gods and advanced extraterrestrials.

(Ron Wyatt is the original discoverer) 

https://commons.wikimedia.org/wiki/File:Sodom.jpg

Locations identified on the satellite map on the west coast of the Dead Sea have millions of high purity (98% pure) sulfur balls with burn rings embedded in what looks like the ashen remains of cities. The picture on the bottom right is in the location identified on the map as Gomorrah.

Spectra Chem Analytical of New Zealand, and Galbrath Lab of Texas; Two independent laboratories have tested the sulfur balls and sulfur ash determining their composition.

At least three different groups have surveyed the sites taking samples, and two of those groups have created videos. Here is a video from one of them;

http://www.youtube.com/watch?v=FwTVFk1HK3Y

It should be noted;

(1) volcanic activity turns sulfur into a gas,

(2) meteoroids contain only small amounts of sulfur,

(3) geothermal activity creates sulfur of no more than 40% purity,

(4) a natural gas explosion wouldn't explain the purity of the sulfur balls, and

(5) bacteria wouldn't explain the burn rings on the sulfur balls nor the ashen remains.

An alternative possibility is that the pure sulfur fire balls were created and used as military munitions in warfare. However, there is no record of using such munitions in warfare. It should be noted that the cities are completely destroyed with even the structural material and stones having been turned into ash. It would take far less sulfur to simply kill the people; turning all of the structural material and stones into ash is militarily unfeasible.

Given that the pure sulfur fire balls and ashen remains are not known to be created by any volcanic, meteoric, geothermal, natural gas, or bacterial activity, and given that it is historically unprecedented to use pure sulfur fire balls as munitions and militarily unfeasible to turn all the structural material and stones of the cities into ash, and given that there are records claiming the destruction of Sodom and Gomorrah was by the hand of the person of the Divine, it therefore suggests the existence of the fact that this is the remains of Sodom and Gomorrah, the destruction of which was a teleological interaction of the spirits/angels/gods or person of the Divine with man.

====Neanderthal violence====
Correlation of evidence of Neanderthal violence with Scriptural History


http://www.donsmaps.com/images4/neanderthalsapiens.jpg

The first reconstruction of a complete Neanderthal skeleton in 2005 has revealed more accurately the similarities and differences between us (far right) and them.

The reconstruction makes clear their larger, bell-like chest cavity and wider pelvis. They are physically larger (both taller and bigger than humans), with stronger muscles, larger nose hole and eye sockets, as well as a larger brain cavity. [6] Neanderthal dental enamel hypoplasia found in 75% of individuals and all those particularly aged, suggests they suffered from nutritional deficiencies.

Neanderthal practiced cannibalism or ritual defleshing. Neanderthals seemed to suffer a high frequency of fractures, especially common on the ribs, the femur, fibulae, spine, and skull; as well as from trauma such as stab wounds and blows to the head; suggesting a high level of physical violence.

&quot;Consequently Jehovah saw that the badness of man was abundant in the earth and every inclination of the thoughts of his heart was only bad all the time. And Jehovah felt regrets that he had made men in the earth, and he felt hurt at his heart. So Jehovah said: вЂњI am going to wipe men whom I have created off the surface of the ground, from man to domestic animal, to moving animal and to flying creature of the heavens, because I do regret that I have made them.&quot; (Genesis 6:1-2, 4-7)

&quot;In the six hundredth year of NoahвЂ™s life, in the second month, on the seventeenth day of the month, on this day all the springs of the vast watery deep were broken open and the floodgates of the heavens were opened. And the downpour upon the earth went on for forty days and forty nights.&quot; (Genesis 7:11-12) вЂњSecond month.вЂќ Following the Exodus from Egypt, when Jehovah gave the Israelites the sacred calendar, this became the eighth month, known as Bul, corresponding to the latter half of October and first half of November. - New World Translation Footnote Genesis 7:11 The global flood which killed all but eight humanoids is said to have occurred on the same dating associated with the Festival of the Dead, for which the European calendar marks the celebrations of All Hollows Eve, and All Souls' Day

====Confusion after the Flood====

Correlation of linguistics and Scriptural History.


After the flood a Cushite named Nimrod rebelled against Jehovah; creating cities (Jehovah commanded everyone to spread out).

He is called a &quot;king&quot;. A king is ruler of a kin (Cushites) which has a kingdom (in this case Summeria; was the first after the flood). Akkadians called Cushites &quot;Summerians&quot; which translates as &quot;black headed people&quot;.

As a punishment Jehovah confused their languages!

Africa has '''more than''' 2000 languages. Where as Europe and Asia only have less then 200 each.

Brown people (Cushites) have a hard time speaking simple English, instead they speak Ebonics.

It seems that Jehovah confused their languages.

Like the Tao Te Ching suggests; 'it seems that rural living is best for mankind'.

====Exodus====

https://www.youtube.com/watch?v=DqLsYonjvRY

https://www.youtube.com/watch?v=rsn_HqSxkDg

====Coconut is the tree of life====

The mitochondria oxidizes for energy production whereas the cell body ferments for energy production; the oxidization is 20 times more efficient than fermentation.

The mitochondria also control many crucial aspects of cell regulation, including cell death.

When the mitochondria are down regulated, or most of the energy of the cell is produced from cell body fermentation, then not only is their reduced energy, the mitochondria no longer have the ability to kill the cell.

Cancer is run away cell body fermentation where the mitochondria can't kill the cell.

Coconut has medium chain triglycerides such as lauric acid which are antibacterial, antifungal, and pro-mitochondrial.

In other words, there is considerable evidence that extended life is impossible without coconut.

====Serpent hind legs====

Moses claimed that the serpent was cursed to go about on it's belly... presumably instead of walking on legs.

ancient fossils prove that serpents had hind legs.

If I am not mistaken the theory of evolution claimed in the past that the serpent was first and then developed legs on land creating the lizards. But the serpent only had hind legs! (so how did Moses 'know' this???).
{{Collapsible END}}

:The above request [https://en.wikiversity.org/w/index.php?title=Wikiversity:Request_custodian_action&amp;diff=next&amp;oldid=2723526 was added in August]. I have no idea, why it is still here. Most of this content seems to be at [[User:205.154.222.227/Theory of monism panpsychism]].
:The heading levels have messed up the rest of the page, so I have [https://en.wikiversity.org/w/index.php?title=Wikiversity:Request_custodian_action&amp;diff=prev&amp;oldid=2757829 corrected them]. I also take the liberty to put most of it in a collapsed box. Now someone should archive this chapter. --[[User:Watchduck|Watchduck]] &lt;small&gt;([[User talk:Watchduck|quack]])&lt;/small&gt; 20:07, 4 October 2025 (UTC)
{{archive bottom}}

== Subject: Request to Rename Page Title for Accurate Authorship Attribution ==

'''Dear Custodian,'''

I would like to kindly request a rename of the following page:

🔗 [[Modern Chinese Proverbs and Sayings by Hé Xiǎojū / Kenny Ho]]

'''New proposed title:'''

&lt;code&gt;Modern Chinese Proverbs and Sayings by Ho Siew Khui 何小驹 (Hé Xiǎojū)&lt;/code&gt;

'''Reason''':

I am standardising the authorship name to '''Ho Siew Khui 何小驹 (Hé Xiǎojū)''' across all platforms to ensure proper attribution and avoid confusion with similarly named public figures.

This format reflects the full name in English, Hanzi, and Pinyin — and matches what I use on Medium, Xiaohongshu, and all academic references. The mention of “Kenny Ho” is deprecated.

I appreciate your help in moving this page with full history preserved. Kindly advise if any adjustment is needed.

Thank you!

— Ho Siew Khui 何小驹 (Hé Xiǎojū) [[User:KennyHoProverbs|KennyHoProverbs]] ([[User talk:KennyHoProverbs|discuss]] • [[Special:Contributions/KennyHoProverbs|contribs]]) 05:40, 28 July 2025 (UTC)
: I edited the above to point directly to the old page name instead of showing an URL. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 07:19, 25 September 2025 (UTC)
{{archive bottom}}

{{archive top|{{done}} -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:33, 27 November 2025 (UTC)}}
== Block of AssumingNOTHING ==
I request an indenfinite block of {{User|AssumingNOTHING}} for block evasion of {{User|MarsSterlingTurner}}, as per [[Special:Diff/2741480]]. See also the request [[#Block of MarsSterlingTurner]] from April 2025. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:51, 30 August 2025 (UTC)
: {{done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 12:38, 30 August 2025 (UTC)
{{archive bottom}}

{{archive top|{{done}} -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:35, 27 November 2025 (UTC)}}
== Creation of new page ==

I am new to wikiversity. I am an assistant professor at MVJ college of engineering.

I created first page with wrong name - &quot;MVJ-as72-cfd&quot; without publishing - later corrected by making them all letters capital. 

since i am new, I added unnecessary links. I have rectified the mistake now [[User:Shantanu-sg-01|Shantanu-sg-01]] ([[User talk:Shantanu-sg-01|discuss]] • [[Special:Contributions/Shantanu-sg-01|contribs]]) 12:47, 30 August 2025 (UTC)
: {{done}} You created e.g. [[2025 AS72 CFD]]. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 07:18, 25 September 2025 (UTC)
{{archive bottom}}

{{archive top|{{done}} -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:36, 27 November 2025 (UTC)}}
== [[Special:Contribs/~2025-62820-3]] ==

Seems to be block evasion by [[Special:CentralAuth/Quachthanh|Quachthanh]], who was blocked 7 years ago [[Special:Permalink/2197869#Quachthanh|for cross-wiki copyright violation]]. Please delete pages that are not written in English, and review the rest. Thanks. [[User:NguoiDungKhongDinhDanh|NguoiDungKhongDinhDanh]] ([[User talk:NguoiDungKhongDinhDanh|discuss]] • [[Special:Contributions/NguoiDungKhongDinhDanh|contribs]]) 22:32, 16 September 2025 (UTC)
: {{done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 22:47, 16 September 2025 (UTC)
:: Thanks. In the future, please look out for temporary accounts that make a lot of small edits at physics-related pages. [[User:NguoiDungKhongDinhDanh|NguoiDungKhongDinhDanh]] ([[User talk:NguoiDungKhongDinhDanh|discuss]] • [[Special:Contributions/NguoiDungKhongDinhDanh|contribs]]) 23:47, 16 September 2025 (UTC)
{{archive bottom}}

{{archive top|{{done}} -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:37, 27 November 2025 (UTC)}}
== Creation of a page ==

Hello, I’m trying to create an educational page about Dr. J. Fernando Márquez-Farías, a Mexican marine scientist, but I received the following error: &quot;New User Exceeded New Page Limit&quot;. This is a constructive and verifiable academic biography. Could you please lift the restriction or help me publish the page? Thanks in advance. [[User:Manzanillocelaya|Manzanillocelaya]] ([[User talk:Manzanillocelaya|discuss]] • [[Special:Contributions/Manzanillocelaya|contribs]]) 02:35, 18 September 2025 (UTC)
: {{done}} You created a page, one that I now moved to [[J. Fernando Márquez-Farías]], so this request has been handled. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 07:11, 25 September 2025 (UTC)
{{archive bottom}}

== Concern regarding curator conduct User:Dan Polansky ==

There is [[Wikiversity:Colloquium#Concern regarding curator conduct User:Dan Polansky|a request to custodians in Colloquium]]. I would move it here, but since the curator, responded there, I am not sure weather it can be moved here. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:26, 6 October 2025 (UTC)


{{archive top|{{done}} -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:38, 27 November 2025 (UTC)}}

== Dan Polansky ==

I would like to ask you to assess the behavior of Dan Polansky, who in my opinion continues to violate [[Wikiversity:Etiquette|Etiquette]], calls users who disagree with him trolls, [https://en.wikiversity.org/w/index.php?title=User_talk:Harold_Foppele&amp;oldid=2760143#Your_qualification questions their expertise], tests them, etc. This is most evident in [[Wikiversity:Community Review/Dan Polansky]], where he has already indicated that two discussion opponents are trolls. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:05, 18 November 2025 (UTC)
: The coddling of overt disruptor Harold Foppele (substantiation is in RCA above) and proven provocateur and disruptor Juandev (substantiation in CR above) must stop. The English Wikiversity must start to properly curate its content and discipline disruptive editors. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 08:10, 18 November 2025 (UTC)
:[[Wikiversity:Community Review/Dan Polansky]] is underway; outcome pending. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 12:03, 27 November 2025 (UTC)
::It has been closed with consensus to ban him indefinitely from this project, I believe there is nothing else to do here. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 22:06, 11 March 2026 (UTC)

== Adapt show/hide buttons of collapsible tables using new class mw-collapsible ==
{{archive top|{{done}} -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:16, 3 December 2025 (UTC)}}
Please change the content of [[MediaWiki:Collapsible-expand]] and [[MediaWiki:Collapsible-collapse]] from Expand/Collapse to show/hide, so the new collapsible tables harmonize whith those still in use.&lt;br&gt;
This should be uncontroversial, because it is what users are already used to. These are also the words used in Wikipedia ([[w:MediaWiki:Collapsible-expand|show]]/[[w:MediaWiki:Collapsible-collapse|hide]]).&lt;br&gt;
See table examples: [[Wikiversity:Colloquium#Collapsible_tables_should_look_and_work_like_on_Wikipedia]]&lt;br&gt; [[User:Watchduck|Watchduck]] &lt;small&gt;([[User talk:Watchduck|quack]])&lt;/small&gt; 12:05, 1 October 2025 (UTC)

:@[[User:Watchduck|Watchduck]] {{done}} Thankyou for this suggestion. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:10, 3 December 2025 (UTC)
{{archive bottom}}

== Report concerning ~2025-27348-27 ==

{{User|~2025-27348-27}} vandalism [[User:Saroj|Saroj]] ([[User talk:Saroj|discuss]] • [[Special:Contributions/Saroj|contribs]]) 16:12, 1 October 2025 (UTC)
: {{done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 23:07, 1 October 2025 (UTC)
{{archive bottom}}

{{archive top|{{done}} -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:39, 27 November 2025 (UTC)}}
== Kindly allow me to remake my userpage ==

I have a userpage at wikipedia and I would like to rebuild it here as well. but the system isn't allowing me to do. 

Reason: New User creating a page with external links. 

The links are completely safe and is relevant to my profile. Check here
https://en.wikipedia.org/wiki/User:Tomlovesfar [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 02:49, 3 October 2025 (UTC)

:I made a blank page. This usually fixes the problem. If you need anything else, please let me know. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 02:56, 3 October 2025 (UTC)
::&lt;big&gt;'''Warning'''&lt;/big&gt;: This action has been automatically identified as potentially harmful.
::Unconstructive actions will be quickly reverted, and egregious or repeated unconstructive editing will result in your account or IP address being blocked. If you believe this action to be constructive, you may submit it again to confirm it.
::A brief description of the abuse rule which your action matched is: New User Created Page with External Link
::I keep receiving these errors  [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 02:58, 3 October 2025 (UTC)
:::Jinkies. Do you want me to copy your user page from en.wp to here? —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 02:59, 3 October 2025 (UTC)
::::Yes please, Thank you very much &lt;3 [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 03:07, 3 October 2025 (UTC)
::::Kindly paste this link too 
::::[[wikipedia:User:Tomlovesfar/common.css|https://en.wikipedia.org/wiki/]] [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 03:11, 3 October 2025 (UTC)
:::::{{done}} except that I cannot import your CSS settings. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 03:16, 3 October 2025 (UTC)
::::::it's right here, 
::::::https://en.wikipedia.org/wiki/User:Tomlovesfar/common.css [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 03:18, 3 October 2025 (UTC)
:::::::I know, but I cannot import &lt;em&gt;your&lt;/em&gt; CSS settings. &lt;em&gt;You&lt;/em&gt; have to edit it yourself. Otherwise, I could do all kinds of crazy things that would ruin your user experience. Your CSS is for you to edit. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 03:19, 3 October 2025 (UTC)
::::::::Oh okay, thank you very much.  [[User:Tomlovesfar|Tomlovesfar]] ([[User talk:Tomlovesfar|discuss]] • [[Special:Contributions/Tomlovesfar|contribs]]) 03:25, 3 October 2025 (UTC)
{{archive bottom}}

{{archive top|{{not done}} -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:40, 27 November 2025 (UTC)}}
== Not able to publish page ==

I have create autheticated content and all relevant links are added, yet I am unable to publish the page. please look into it.  [[Special:Contributions/&amp;#126;2025-27226-84|&amp;#126;2025-27226-84]] ([[User talk:&amp;#126;2025-27226-84|talk]]) 13:43, 3 October 2025 (UTC)

:There are filter set up to automatically block a variety of content that is likely to be harmful or otherwise inappropriate. One of those filters stops users without accounts from adding links to certain domains. I apologize that I don't have all the filters memorized off-hand and I don't know what exactly you were trying to add, so I have to speak in generalities. If you can clarify what exactly you were trying to add to which pages, I can see if we can get around that. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:01, 3 October 2025 (UTC)
{{archive bottom}}

{{archive top|{{not done}} -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:42, 27 November 2025 (UTC)}}
== New User Exceeded New Page Limit ==

I am a new contributor and attempted to create a page titled ''Causal Automorphic Propagation Theory (CAPT)''. This is my original research work in theoretical physics that proposes a unification of relativity and quantum mechanics using a discrete time-saturation framework.

My edit was blocked by the abuse filter with the message: '''“New User Exceeded New Page Limit”''' (and also sometimes flagged for including a DOI/external reference).

'''Purpose of Page:'''

The page is intended as a constructive contribution to Wikiversity’s physics content. It contains:

* A short introduction to CAPT
* Scope of what the theory explains (cosmology, relativity, quantum mechanics)
* A compact table of mathematical formalism mapping CAPT formulas to standard GR and QM results
* References (Einstein, Planck, Bohr, and my own preprint archived on Zenodo with a DOI)

'''Request:'''

I kindly request custodian review and approval so that I may publish this page. I am happy to start with a shorter “stub” version (intro + scope bullets only) and expand it gradually to avoid filter triggers.

Thank you for your assistance. [[User:CAPT THEORY|CAPT THEORY]] ([[User talk:CAPT THEORY|discuss]] • [[Special:Contributions/CAPT THEORY|contribs]]) 17:48, 3 October 2025 (UTC)

:This is something that resolves itself after you make &lt;var&gt;X&lt;/var&gt; edits over &lt;var&gt;Y&lt;/var&gt; days (apologies that I don't recall the exact numbers). These limits are pretty small, so you will naturally overcome them if you stick around for a bit. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:00, 3 October 2025 (UTC)

: Quite frankly, I suspect that we do not need another page that looks like potential pseudo-physics, with no physicist around to declare it so (Guy vandegrift is inactive as of late). Unification of relativity and quantum mechanics is probably quite a challenge and it would be surprising if a breakthrough in that direction would be published first in Wikiversity. That the requestor above is making a post whose some features look like GenAI slop is also a little bit of a red flag. The user handle &quot;CAPT THEORY&quot; is also something of a red flag; it is promotional. A beige/neutral/inconspicuous pseudonymous user name or one pointing to the chief author would be much less suspect (to me anyway). --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 18:33, 3 October 2025 (UTC)
::Thank you Dan for your honesty. Here is the link to the manuscript: [https://zenodo.org/records/17247910 Causal Automorphic Propagation Theory (CAPT)]. [[User:CAPT THEORY|CAPT THEORY]] ([[User talk:CAPT THEORY|discuss]] • [[Special:Contributions/CAPT THEORY|contribs]]) 18:43, 3 October 2025 (UTC)
::: I went to https://zenodo.org/records/17247910. The complete document seems to be available there. I do not see why it is a good idea to have it replicated in Wikiversity. I raised a similar question here: [[Wikiversity:Colloquium#Publishing text from ResearchGate in Wikiversity as a copy]]. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 18:47, 3 October 2025 (UTC)
::::CAPT is just an incomplete but promising theory, in order to be developed it needs input from a wide variety of scientists. More importantly it discusses a plethora of new ideas, that so important in current world physics. [[User:CAPT THEORY|CAPT THEORY]] ([[User talk:CAPT THEORY|discuss]] • [[Special:Contributions/CAPT THEORY|contribs]]) 18:55, 3 October 2025 (UTC)ffon
::::: If the point would be to request input/comments from Wikiversity editors/users, there would be no need to copy the text into Wikiversity; a reference and a link to the article would suffice. Moreover, I am not aware of any active physicists in the English Wikiversity (perhaps Fedosin, but is he a real physicist?) so it is very unlikely there will be productive input any time soon. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 19:00, 3 October 2025 (UTC)
::::I see what you mean about making a copy of the published manuscript. I completely agree, there is no need of a copy. CAPT original manuscript is 200 pages long. Wikiversity version will be a one-page summary, to let the reader know that there are answers (Even though speculative) to some of the questions, for example solution to quantum tunneling, solution to the double slit experiment...) Currently there are a lot of articles about these and many more paradoxes, but there are no real solutions. What do you think? [[User:CAPT THEORY|CAPT THEORY]] ([[User talk:CAPT THEORY|discuss]] • [[Special:Contributions/CAPT THEORY|contribs]]) 19:07, 3 October 2025 (UTC)
:::::: I think that a user name &quot;CAPT THEORY&quot; created to promote an article on CAPT theory should be blocked as promotional. Even now, we are engaging in inadvertent promotion of that theory, with every sentence that mentions the theory. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 04:31, 5 October 2025 (UTC)
:::::::I can see this line of reasoning, but should someone whose user name is &quot;Deontological ethics&quot; or &quot;I like Buddhism&quot; or something be blocked? —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:00, 5 October 2025 (UTC)
:::::::: In my view, which is not universally shared (or perhaps hardly ever shared?), anyone whose user name is an English sentence should be ask for a rename, and indef blocked upon refusal. In my view, user names should exhibit some characteristic of ''user-name-hood'', that is, just from quoting it out of context, one should be able to guess it could be a user name. To wit, &quot;Koavf&quot; is capitalized, suggestive of being a proper name; &quot;koavf&quot; is not anything, so being a user name is plausible. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:45, 5 October 2025 (UTC)
:::::::: Moreover, a contrast can be made between promoting a general topic (deontology, Buddhism, Hegelianism) vs. a specific new theory one is trying to sell, the former being perhaps more tolerable. Like, if I create a user name with a brand of a company I am trying to promote, that is not good. Sure enough, I am promoting the brand of &quot;Dan Polansky&quot;, but that can only be avoided by going pseudonymous, which I do not think is necessarily a good requirement. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:48, 5 October 2025 (UTC)
{{archive bottom}}

{{archive top|{{done}} -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:43, 27 November 2025 (UTC)}}
== Ontorealis ==

I tried to add my paper at Ontorealis, but was blocked because the sources contained links to the original and preprint (https://doi.org/10.5281/zenodo.17096369). I tried to submit it without the links, but then got this warning:

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]]&lt;nowiki/&gt;of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Exceeded New Page Limit

Please unblock this so I can try again.

--[[Special:Contributions/&amp;#126;2025-27492-02|&amp;#126;2025-27492-02]] ([[User talk:&amp;#126;2025-27492-02|talk]]) 22:44, 3 October 2025 (UTC)
: I moved an article put at [[Ontorealis]] to user space and protected the mainspace page from recreation. I explained the problems on the talk page of the &quot;article&quot;. In short, looks very much like GenAI slop with no real value. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 04:30, 5 October 2025 (UTC)
{{archive bottom}}

{{archive top|{{done}} -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:45, 27 November 2025 (UTC)}}
== Trouble with Captcha ==

I am trying to add a page for my college assignment on wikiversity and I answered 10+ Captcha and it didn’t let me add my page. I’m trying to add to the Jessica Peterson page on this assignment. [[Digital Media Concepts]]  [[User:SrushDigitalMedia|SrushDigitalMedia]] ([[User talk:SrushDigitalMedia|discuss]] • [[Special:Contributions/SrushDigitalMedia|contribs]]) 17:54, 8 October 2025 (UTC)

:Nevermind I was able to publish after I changed from visual editing to source editing for some reason [[User:SrushDigitalMedia|SrushDigitalMedia]] ([[User talk:SrushDigitalMedia|discuss]] • [[Special:Contributions/SrushDigitalMedia|contribs]]) 18:04, 8 October 2025 (UTC)
{{archive bottom}}

{{archive top|{{done}} -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:46, 27 November 2025 (UTC)}}

== New User Exceeded New Page Limit ==

I am trying to publish a page on the UK's Communications' Law.  

https://en.wikiversity.org/w/index.php?title=United_Kingdom_Legal_System&amp;veaction=edit

I was blocked by the following error: New User Exceeded New Page Limit [[Special:Contributions/&amp;#126;2025-27550-86|&amp;#126;2025-27550-86]] ([[User talk:&amp;#126;2025-27550-86|talk]]) 15:46, 5 October 2025 (UTC)
{{archive bottom}}

== Block of User:KayYayPark or prohibition of new pages ==
A look at recently created pages by {{User|KayYayPark}} shows more low-quality/dubious-quality pages, some of which obviously unduly promotional. The statements to the effect that ChatGPT responded that KayYayPark is a key contributor to some fields seem likely to be fraudulent, unless he previously conditioned ChatGPT to say these things in some way.

To my mind, this is problematic and unethical conduct. Block would be in order, but as a curator, I do not have the blocking tools. I can start deleting his pages (no need to move to user space; I left even some of his promotional material in mainspace, and he can edit there). I welcome not only block but other inputs from custodians/curators. Is my thinking wrong? Why is his behavior ok? --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 04:07, 10 October 2025 (UTC)

:I just wonders since when is low-quality unwelcomed in Wikiversity? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 06:39, 26 October 2025 (UTC)
:: Surely there needs to be some minimum quality requirement, or else Wikiversity becomes an unmitigated junkyard. This should especially be the case for mainspace pages written in wiki-voice (no indication it is one author speaking), as is the case e.g. in [[Context Indexing Executive Summary]]. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:33, 4 November 2025 (UTC)
:@[[User:KayYayPark|KayYayPark]]'s main space page creations have been moved to user space and the user has been indefinitely blocked from main space editing. The repeated creation of low-quality main space content has proven too administratively burdensome. KayYayPark is welcome to developed content in the user space and then request it to be moved to main space and to discuss unblocking at that point. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:45, 4 December 2025 (UTC)

''Later:'' The user keeps on adding new, redundant content, e.g. [[Context Indexing Summary]]. I cannot determine the intent of the user; it could be some kind of wild/crazy self-promotion but it could be something else altogether. I cannot block him (I am not a custodian), nor can I prevent him from creating new pages. I can start deleting the pages and protecting them, but that is likely to lead to a chase, where he is likely to invent new headwords under which to post content. Can a custodian help, or explain why no help is coming? --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:35, 11 October 2025 (UTC)

He now created [[Executive Summary]], yes, under this title. This is absurd. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 14:52, 14 October 2025 (UTC)

{{archive top|{{done}} -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:48, 27 November 2025 (UTC)}}
== Contest removal of article ==

L.S. I want to contest the removal of the article &quot;Quantum A Matter Of Size&quot; including the template i worked very hard on to get it to work on Wikiversity. I tried to discuss this with the curator who acted, but there is no response. Same for  User:Harold Foppele/Quantum: A Walk Through the Universe, which was moved. Any help welcome. Cheers [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 14:31, 10 October 2025 (UTC)

:To clarify, we're discussing:
:* [[Quantum A Matter Of Size]]
:* [[User:Harold Foppele/Quantum: A Walk Through the Universe]]
:Since [[User:Harold Foppele|Harold Foppele]] is a new Wikiversity editor who is engaging in good faith, I think it would be OK to allow drafting in the user space until concerns are addressed and then potentially for the work to be moved to main space?
:What do others think? cc: [[User:Juandev|Juandev]], [[User:Guy vandegrift|Guy vandegrift]], [[User:Dan Polansky|Dan Polansky]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 22:29, 11 October 2025 (UTC)
::Thanks for your kind words. The problem is, that the article &quot;Quantum A Matter Of Size&quot; is deleted together with its template and i have no backup of it. It was simply deleted.The article has still flaws in it, but I was still working on it. If you want, look at my user talk page, that will tell the whole story. What bothers me most is that, why i was at the Vet with my cat, i had to do some sort of trivia to test my knowledge. Well, read it and judge for yourself. But can I have my article and template back please? Cheers [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 23:58, 11 October 2025 (UTC)
:::I've emailed the deleted page to [[User:Harold Foppele|Harold Foppele]] and suggested recreating it as a user sub-page with appropriate acknowledgement of the source(s) of the material. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 01:03, 12 October 2025 (UTC)
:::: @[[User:Jtneill]] I only deleted articles when they contained ''copyright violation''. The relevant discussion is at [[User talk:Harold Foppele#Headwords, etc.]]. Moreover, the discussion I just linked indicates the user probably does not understand quantum mechanics at all; his response to my question about the double slit experiment is very bad (&quot;Light like laserbeam actually electrons. The result is acceptance of waves not particles. My simpelest explanation&quot;). What is likely to happen is that he is going to use some technique, perhaps GenAI, to create very dubious quality content that he does not understand. What I moved to user space is [[User:Harold Foppele/Quantum: A Walk Through the Universe]] since I could not immediately show copyright violation (maybe I was not paying enough attention), but the content appears very dubious. I documented red flags at [[User talk:Harold Foppele/Quantum: A Walk Through the Universe]].
:::: The user appears to contradict himself; in the linked discussion, he said &quot;As I said im ok with what you do&quot;, but now he is complaining.
:::: My qualification: we covered quantum mechanics at the 4th year of my grammar school/high school/''gymnázium'' in Czechia, I think. Quantum mechanics is notoriously hard to understand, I think. But I understand the double slit experiment well enough to immediately recognize the answer as wrong, with elements of a correct answer mixed up together in a dubious way. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:15, 12 October 2025 (UTC)
:::: User Harold F. recreated [[User:Harold Foppele/Quantum A Matter Of Size]]. The edit summary indicated in no way that he is not the author of many of the sentences, and he isn't. I see no other indication on the page about the origin of the sentences. I propose to delete the page. I would also be inclined to propose a block: elementary understanding of principles of copyright seems lacking, even after I have pointed out to the user that he cannot take sentences from a CC-BY-SA source without attribution. And even if all was fair as far as copyright, his method of composition by something like collage, with almost no understanding of quantum mechanics, can hardly lead to half-decent material.. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 08:56, 12 October 2025 (UTC)
:::::@[[User:Dan Polansky|Dan Polansky]],@[[User:Jtneill|Jtneill]], Going by AGF I feel offended by the attack(s) of Dan P. If i had more time i woud have explained the experiment in extenso. Your question was &quot;What physical entity is being sent through the slits?&quot;.  So this article: https://natuurkundeuitgelegd.nl/uitwerkingen.php?opgave=dubbelspleetelektronen explains exactly what i ment when i wrote &quot;Light&quot; (coherent) like a &quot;laserbeam&quot; sending &quot;electrons&quot; https://en.wikipedia.org/wiki/Double-slit_experiment leading to the acceptance of light beeing waves not particles. So in the very little time I had, i gave you the simplest explanation. So, what was wrong with that? If you where less focused on the copyright issue, and less focused on deleting an article .....
:::::I like to refer to: https://en.wikipedia.org/wiki/Wikipedia:Copyrights and https://en.wikipedia.org/wiki/Wikipedia:Copyright_violations. @[[User:Jtneill|Jtneill]] could you be so kind to comment this? Thanks [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 10:21, 12 October 2025 (UTC)
::::::*Copyright: A simple action to address potential copyright concerns could be to insert quotation marks around any content which is copied from elsewhere and provide a link and/or citation to the source(s) and page numbers (if relevant) (i.e., transparently acknowledge any sources).
::::::*Accuracy: Not my field, but perhaps suggestions can be offered for improvement, rather than deletion?
::::::-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 22:07, 12 October 2025 (UTC)
:::::::As stated at your talk page @[[User:Jtneill|Jtneill]] i tried to communicate in a civil/polite way with Dan P. unfortualy it leads nowhere. Cheers [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 12:12, 13 October 2025 (UTC)
::::::::@[[User:Jtneill|Jtneill]] Thank you for all the help. Very nice that you took the time to guide me in the right direction towards contributing to the Wikiversity community. Cheers [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 10:00, 16 October 2025 (UTC)
::BTW, I am not the custodian. I dont know, if there was any discussion on drafts on en.wv. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:30, 16 October 2025 (UTC)
:::@[[User:Juandev|Juandev]] should I move both articles to draft? [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 13:00, 16 October 2025 (UTC)
::::What is the purpose of those articles? Why you are creating them on Wikiversity? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 13:15, 16 October 2025 (UTC)
:::::Ummmmm I dont understand the question. Why does one create an article on Wv?? [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 13:20, 16 October 2025 (UTC)
::::::I ask this because you use the term &quot;article&quot;. That is the typical term for a piece of information resource on Wikipedia. Whereas on Wikiversity we can have many different types of pages, it's always just a matter of whether they have the right purpose. So why does one create an article on Wv?? The motivations might be different. Education, research, to inform, to advertise, etc. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 14:47, 16 October 2025 (UTC)
:::::::Ahh I see. Quantum: A Walk Through the Universe is more educational. Includes “quantum cheat sheet” 😀 [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 15:41, 16 October 2025 (UTC)
::::::::Well I havent been here for a while, so there might be some additionally policies, why you should cultivate it in your user namespace. Practically, if you need to improve your resource without other users editing complete it in your user space and then move it to main namespace. If you dont mind other users to edit it - you could probably improve it in the main space from the begginging. It would be just nice to use some [[Help:Project boxes|Project boxes]], that other users know, how to interact with it. But this would be valid few years ago. So maybe today there are different policies on this on en.wv. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 16:56, 16 October 2025 (UTC)
:::::::::Thanks for the info! They are nicely cultivated in my user space and ready to move to the mainspace. Can I do that all by myself, or do I need some kind of approval? [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 17:06, 16 October 2025 (UTC)
::::::::::The question is, which page you are talking about, as [https://en.wikiversity.org/wiki/Special:AllPages?from=Harold+Foppele%2F&amp;to=Harold+Foppele%2Fsandbox-1&amp;namespace=2 there are actually 4 pages] in your userspace. But since Dan Polansky found some possible copyright violations in your texts, administrators will first have to carry out a procedure to determine whether there has been any copyright infringement and, if necessary, delete versions that violate the licenses. So I would wait until this is resolved. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:18, 16 October 2025 (UTC)
:::::::::::These problems where solved with help of @[[User:Jtneill|Jtneill]]. [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 18:26, 16 October 2025 (UTC)
::::::::::::P.S. He lifted the copyright tag [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 18:27, 16 October 2025 (UTC)
:::::::::::https://en.wikiversity.org/wiki/User:Harold_Foppele/Quantum_A_Matter_Of_Size this is the cleared one [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 18:39, 16 October 2025 (UTC)
::::::::::::Yes, you are right. This is up to custodians to deal with copyright violations. And I am not the custodian. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:51, 16 October 2025 (UTC)
:::::::::::::Look at the page in wiki. You may like it. [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 19:56, 16 October 2025 (UTC)
{{archive bottom}}

{{archive top|{{done}} -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:50, 27 November 2025 (UTC)}}

== Planned deletion of a page as unduly promotional ==
{{archive top|{{not done}} -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:41, 3 December 2025 (UTC)}}
I plan to delete the following page as unduly promotional: [[User:Dr rajatsubhra/Sobon]]. The promotional character is given by a prominent link to a .com website offering some related services, apparently. While user space is not searched by Google, reducing the harm, this sort of audacity should IMHO not be tolerated; the user should ideally be indefed. I don't think we should be trying to explain these kinds of matter to unethical actors; they should know very well that this kind of overt, direct-link-based promotion is unethical.

I think I could have gone ahead and deleted the page, but I am giving custodians a chance to object. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:32, 12 October 2025 (UTC)

:I took a quick look. Appears to be notes. Couldn't see promotion? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 21:01, 13 October 2025 (UTC)
:: The author of the page removed the promotional link in [[Special:Diff/2760192|this edit]] from 12 Oct 2025 (yesterday); [https://en.wikiversity.org/w/index.php?title=User:Dr_rajatsubhra/Sobon&amp;oldid=2760186 this revision] shows the promotional link. As of now, the page seems tolerable for userspace, especially since user space is not indexed by Google. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 21:25, 13 October 2025 (UTC)
:What is the difference between promotional pages of en.wv custodians and this one? From my perspective its better to guess on intention or better ask the original user what was the intetion. If the intetion is advertisement, then it could be deleted. Yet I am happy to know who are the users of en.wv, namelly what they did in education and science. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:00, 16 October 2025 (UTC)
{{archive bottom}}

== Changes to Common.css, and interface messages using fmbox ==

I am suggesting some changes:
* For [[MediaWiki:Common.css]], I would suggest importing the following code from English Wikibooks:
&lt;syntaxhighlight lang=&quot;css&quot;&gt;
/* System messages styled similarly to fmbox */
/* for .mw-warning-with-logexcerpt, behavior of this line differs between
 * the edit-protected notice and the special:Contribs for blocked users
 * The latter has specificity of 3 classes so we have to triple up here.
 */
.mw-warning-with-logexcerpt.mw-warning-with-logexcerpt.mw-warning-with-logexcerpt,
div.mw-lag-warn-high,
div.mw-cascadeprotectedwarning,
div#mw-protect-cascadeon {
	clear: both;
	margin: 0.2em 0;
	border: 1px solid #bb7070;
	background-color: var(--background-color-error-subtle, #ffdbdb);
	padding: 0.25em 0.9em;
	box-sizing: border-box;
}

/* default colors for partial block message */
/* gotta get over the hump introduced by the triple class above */
.mw-contributions-blocked-notice-partial .mw-warning-with-logexcerpt.mw-warning-with-logexcerpt {
	border-color: #ab7f2a;
	background-color: var(--background-color-warning-subtle, #fef6e7);
}
&lt;/syntaxhighlight&gt;
* For all MediaWiki interface messages using &lt;code&gt;{{Fmbox&lt;/code&gt;, I would suggest wrapping it in &lt;code&gt;&lt;nowiki&gt;&lt;div style=&quot;mw-parser-output&quot;&gt;&lt;/nowiki&gt;&lt;/code&gt;.
One question, given that some of these templates are fully protected (which should be changed to support dark mode), should I apply for the curator permission so that I can do maintenance on Wikiversity? I have done so on the English Wikibooks (where I am an administrator). [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 16:24, 20 October 2025 (UTC)

:{{support}} This has been done on Commons as well. [[User:Matrix|Matrix]] ([[User talk:Matrix|discuss]] • [[Special:Contributions/Matrix|contribs]]) 15:53, 28 October 2025 (UTC)
:{{ping|Guy vandegrift}} as the only active bureaucrat please could you look into this request or grant Codename Noreste IA? [[User:Matrix|Matrix]] ([[User talk:Matrix|discuss]] • [[Special:Contributions/Matrix|contribs]]) 11:56, 29 October 2025 (UTC)
:: Some CSS pages for templates are fully protected, in which IA doesn't have. As for the latter, I have 2FA enabled. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 23:54, 31 October 2025 (UTC)
:::I am a curator/custodian and have been a temporary admin interface user (the rights are exclusively short-term here, they are not given indefinitely). If someone wants to promote me, I will make the change. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 00:14, 1 November 2025 (UTC)
:::: In that case, should I still ask for curator permissions per my stated reasoning above? [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 01:46, 1 November 2025 (UTC)
:::::We may not be communicating. I am a curator and I cannot edit this page. Were you a curator, you also could not edit this page. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 20:39, 1 November 2025 (UTC)
::::::{{ping|Koavf}} I just got global IA, can I use the permissions to make the above edit? [[User:Matrix|Matrix]] ([[User talk:Matrix|discuss]] • [[Special:Contributions/Matrix|contribs]]) 17:43, 5 November 2025 (UTC)
:::::::I have no objection to that and I don't know of a policy prohibiting it. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:03, 5 November 2025 (UTC)
::::::::{{Done}} [[User:Matrix|Matrix]] ([[User talk:Matrix|discuss]] • [[Special:Contributions/Matrix|contribs]]) 21:27, 5 November 2025 (UTC)
{{archive bottom}}

{{archive top|{{done}} -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:51, 27 November 2025 (UTC)}}
== Edit request at [[Template_talk:Tmbox#Edit_request]] ==

Hi, I'm requesting for a custodian to replace the code of [[Template:Tmbox]] with what is in [[Template:Tmbox/sandbox]]. This will add dark mode compatibility. Afterwards you can delete [[Template:Tmbox/core]] since it will no longer be necessary. [[User:Matrix|Matrix]] ([[User talk:Matrix|discuss]] • [[Special:Contributions/Matrix|contribs]]) 16:14, 28 October 2025 (UTC)

:{{ping|Koavf}} as an active custodian. [[User:Matrix|Matrix]] ([[User talk:Matrix|discuss]] • [[Special:Contributions/Matrix|contribs]]) 11:50, 29 October 2025 (UTC)
::{{done}} Thanks. /core not deleted, as it still has transclusions (for now). —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 13:26, 29 October 2025 (UTC)
:::{{ping|Koavf}} [https://en.wikiversity.org/wiki/Special:WhatLinksHere/Template:Tmbox/core I don't see transclusions], also please could you look at my (similar) request at [[Module talk:Message box/fmbox.css]]? [[User:Matrix|Matrix]] ([[User talk:Matrix|discuss]] • [[Special:Contributions/Matrix|contribs]]) 16:08, 30 October 2025 (UTC)
::::It was probably just lag. I've deleted. Thanks. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 16:45, 30 October 2025 (UTC)
{{archive bottom}}

{{archive top|{{done}} -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:52, 27 November 2025 (UTC)}}
== Constructive error when trying to publish new page ==

I am getting a constructive error when trying to publish new information on my page. [[User:Eleanor Tidman|Eleanor Tidman]] ([[User talk:Eleanor Tidman|discuss]] • [[Special:Contributions/Eleanor Tidman|contribs]]) 13:39, 30 October 2025 (UTC)

:I assume that you mean your user page. There are some restrictions on new users which can sometimes be frustrating, but they are here to stop spam. I've created a blank user page for you, which you should be able to edit. Let me know if you need more help. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 15:24, 30 October 2025 (UTC)
{{archive bottom}}

{{archive top|{{done}} -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:52, 27 November 2025 (UTC)}}
== Template Maintenance. ==

After a lot of effort -
[[:Template:Article info/sandbox]]
[[:Template:Article info main/sandbox]]

I understand I've managed to balance the tags up again. 

This resolves a sizeable chunk of remaining lint-errors!. 

Can someone one test, evaluate and swap in the repaired versions? Thanks. [[User:ShakespeareFan00|ShakespeareFan00]] ([[User talk:ShakespeareFan00|discuss]] • [[Special:Contributions/ShakespeareFan00|contribs]]) 14:15, 31 October 2025 (UTC)

:{{done}}. Thank you for your service. o7. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 20:30, 31 October 2025 (UTC)
{{archive bottom}}

{{archive top|{{done}} -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:59, 27 November 2025 (UTC)}}

== cannot create a page for my course ==
{{archive top|{{not done}} -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:41, 3 December 2025 (UTC)}}
First up,I had to set up a new account since the confirmation emails were never appearing in my inbox when I tried logging in with my other accounts [[User:Botheredbybees]] and [[User:botheredbybees]]

Then when I went to create the course outline page I got blocked because:

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Exceeded New Page Limit

Obviously things have changed a lot since I first started working on wikipedia pages nearly 25 years ago (I created the page on the Cello back in 2001), but to say this is discouraging is an understatement. [[User:PeterArthurShanks|PeterArthurShanks]] ([[User talk:PeterArthurShanks|discuss]] • [[Special:Contributions/PeterArthurShanks|contribs]]) 19:58, 3 November 2025 (UTC)

:I know this is frustrating, but we have a filter set up so that you must have some combination (apologies, but I don't recall the exact numbers) of &lt;var&gt;x&lt;/var&gt; days of account age and &lt;var&gt;y&lt;/var&gt; edits to do some actions, such as making a new page. Those numbers are very short, so it will happen automatically if you stick around, which I hope that you will. A workaround is to create it in your user space and I can move it to the main namespace. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 22:51, 3 November 2025 (UTC)
{{archive bottom}}

== cannot create a page for my course ==

First up,I had to set up a new account since the confirmation emails were never appearing in my inbox when I tried logging in with my other accounts [[User:Botheredbybees]] and [[User:botheredbybees]]

Then when I went to create the course outline page I got blocked because:

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Exceeded New Page Limit

Obviously things have changed a lot since I first started working on wikipedia pages nearly 25 years ago (I created the page on the Cello back in 2001), but to say this is discouraging is an understatement. [[User:PeterArthurShanks|PeterArthurShanks]] ([[User talk:PeterArthurShanks|discuss]] • [[Special:Contributions/PeterArthurShanks|contribs]]) 19:58, 3 November 2025 (UTC)

:I know this is frustrating, but we have a filter set up so that you must have some combination (apologies, but I don't recall the exact numbers) of &lt;var&gt;x&lt;/var&gt; days of account age and &lt;var&gt;y&lt;/var&gt; edits to do some actions, such as making a new page. Those numbers are very short, so it will happen automatically if you stick around, which I hope that you will. A workaround is to create it in your user space and I can move it to the main namespace. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 22:51, 3 November 2025 (UTC)
{{archive bottom}}

{{archive top|{{not done}} -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:59, 27 November 2025 (UTC)}}

== Page move ==

Hi, I’d like to move &lt;code&gt;User:Tmill77/Sterlin Bolen&lt;/code&gt; to &lt;code&gt;Sterlin Bolen&lt;/code&gt; in the main namespace. This page is part of a faith-based learning archive. I’m open to revising the content to better reflect Wikiversity’s standards. Thank you! [[User:Tmill77|Tmill77]] ([[User talk:Tmill77|discuss]] • [[Special:Contributions/Tmill77|contribs]]) 09:30, 8 November 2025 (UTC)

:@[[User:Koavf|Koavf]] Are you able to help me? Thanks [[User:Tmill77|Tmill77]] ([[User talk:Tmill77|discuss]] • [[Special:Contributions/Tmill77|contribs]]) 09:39, 8 November 2025 (UTC)
:: The above should be better posted to [[WV:Requests for deletion]], as a request for undeletion. In any case, I oppose moving this back to mainspace. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 09:42, 8 November 2025 (UTC)
:@[[User:Koavf|Koavf]], I am a new user just a few days ago. I was looking for place to publish legacy material about people I know.  I will be honest I don't know a lot about Wikiversity.  And it is possible that this is not the place for me but @[[User:Dan Polansky|Dan Polansky]] has not been helpful to me at all. He is very opinionated which is fine but he needs to learn how to draw a distinction between that and Wikiversity policy. I am happy to move on and look for another solution but as a new user my experience has not been great.  [[User:Tmill77|Tmill77]] ([[User talk:Tmill77|discuss]] • [[Special:Contributions/Tmill77|contribs]]) 09:51, 8 November 2025 (UTC)
:: There is no need to talk about Dan Polansky (me) at all. If my move was wrong (possible, although not particularly likely?), it will be undone by other curators or custodians. I did not bring the matter on the ''personal level'': I never said anything about Tmill77, only about the page he created and whether it fits the English Wikiversity educational mission. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 09:55, 8 November 2025 (UTC)
::Personality-based things aside, what is allowed and not allowed at Wikiversity is very flexible compared to our sister projects. Wikiversity can allow for many kinds of learning materials that include original research, so it is quite possible that what you want to publish could be hosted here. Could you tell me more about what the goal or scope are? {{Ping|Tmill77}}. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 10:37, 8 November 2025 (UTC)
:::There are non-notable persons that I know or know of that I would like to preserve their legacy in a digital format and space. This is much like what is done with notable persons. I have other reference material I hope to link to externally to allow generations to come and learn about them and there impact on people and possible generations and to maybe be able to find links to other digital information audio and possible video to broaden their sense of who they were and what they had to share.   [[User:Tmill77|Tmill77]] ([[User talk:Tmill77|discuss]] • [[Special:Contributions/Tmill77|contribs]]) 10:52, 8 November 2025 (UTC)
::::Gotcha, so this is something like miniature memoirs or personal archives of stories and photos? —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 10:53, 8 November 2025 (UTC)
:::::Exactly [[User:Tmill77|Tmill77]] ([[User talk:Tmill77|discuss]] • [[Special:Contributions/Tmill77|contribs]]) 11:01, 8 November 2025 (UTC)
::::::I think if you frame this in terms of how to do oral history and biography and make it instructional, that could be appropriate. If you just want to post material that is about your friends and give them bios online, that probably wouldn't be. Another option is that the [[:m:Wikispore|incubating project Wikispore]] has what is known as &quot;[https://wikispore.wmflabs.org/wiki/Bio_Spore Bio Spores]&quot; that allow you to publish smaller biographies and for obscure figures that wouldn't be appropriate for Wikipedia. Let me know if there's anything I can do to help you here. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 22:35, 8 November 2025 (UTC)
::::::: In my closest family, it would be perhaps my aunt (or the other aunt?) that would be most notable, perhaps not encyclopedically notable; she published some mathematical articles, I think. She is notable enough for Wikidata, where she has an item, tracing to NL CR AUT entry. Should I feel free to create a mainspace page for her in the English Wikiversity, describe her biography in calm factual terms (no lavish praise, etc.) based on information that I can collect from family records or ask her directly as a witness, and thereby &quot;do oral history and biography&quot;? Are there no notability criteria at all, not even relaxed notability criteria? --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 08:26, 9 November 2025 (UTC)
::::::::Thank Dan for the reply. God Bless [[User:Tmill77|Tmill77]] ([[User talk:Tmill77|discuss]] • [[Special:Contributions/Tmill77|contribs]]) 03:15, 11 November 2025 (UTC)
:::::::Thanks Justin for the information.  You can go ahead and remove my page.  I will look your suggestion.  God Bless. [[User:Tmill77|Tmill77]] ([[User talk:Tmill77|discuss]] • [[Special:Contributions/Tmill77|contribs]]) 03:17, 11 November 2025 (UTC)
{{archive bottom}}

{{archive top|{{done}} -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 12:00, 27 November 2025 (UTC)}}
== Restore deleted Marshallsumter page ==
Can you please undelete [[Draft:Original research/Fringe sciences]]? I will then move it to user space. And it will then match the talk page of the page. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 14:24, 13 November 2025 (UTC)

:{{done}} —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 20:37, 13 November 2025 (UTC)
{{archive bottom}}

{{archive top|{{done}} -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 12:04, 27 November 2025 (UTC)}}
== [[Special:Contributions/Territory_ofcourseifying]] ==

Vandalism of pages, adding inappropriate content. —[[User:CuriousWhistler|CuriousWhistler]] ([[User talk:CuriousWhistler|talk]] • [[Special:Contributions/CuriousWhistler|contribs]]) 07:34, 26 November 2025 (UTC)

:{{done}} globally. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 08:44, 26 November 2025 (UTC)
{{archive bottom}}

== Block of [[User:KayYayPark]] ==
By my assessment, {{User|KayYayPark}} repeatedly engaged in an inappropriate promotion of his previous unpublished or poorly published thesis, last time on a page I moved here: [[User:KayYayPark/System- vs. User-Oriented Information Retrieval]]. His thesis is currently available at [[A Direct Approach to Information Retrieval]]. When I saw such a promotion, I moved it to user space instead of outright deleting it. And then he did it again. He has been wasting my time for too long a time now. A most recent interaction is at [[User_talk:Dan_Polansky#System-_vs._User-Orientation]]. Even Gemini does not agree with his claim that his thesis presents an important contribution.

I propose a 3-day block: repeated inappropriate self-promotion. Alternatively, one could prevent him from ''creating new pages for one week''; he would then have the time to fill in references in [[A Direct Approach to Information Retrieval]] and create the missing charts/diagrams.

I am willing to respond to inquiries and provide more substantiation. I have kept it relatively brief for now. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:59, 25 September 2025 (UTC)

(By the way, Wikiversity presents ample opportunity at ''appropriate'' self-promotion. Delivering solid content under one's official name is a form of self-promotion, an appropriate one as long as using one's real name is not prohibited, which it isn't. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 07:22, 25 September 2025 (UTC)

:@[[User:KayYayPark|KayYayPark]]'s main space page creations have been moved to user space and the user has been indefinitely blocked from main space editing. The repeated creation of low-quality main space content has proven too administratively burdensome. KayYayPark is welcome to developed content in the user space and then request it to be moved to main space and to discuss unblocking at that point. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 02:45, 4 December 2025 (UTC)
== Removal of pages ==
{{archive top|{{done}} -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 22:10, 5 December 2025 (UTC)}}
Goodevening, could someone please remove all my userspace pages? I already marked them for deletion. Thanks [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 21:05, 20 October 2025 (UTC)

:Could you please provide a list of the pages to be deleted? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 19:57, 22 October 2025 (UTC)

@[[User:Harold Foppele|Harold Foppele]], could you confirm that you want these sub-pages (which are redirects) deleted?
{{Special:PrefixIndex/User:Harold Foppele}}
-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt;
:: Thank ypu, but that has been taken care of already. Thanks !  [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 21:20, 5 December 2025 (UTC)
{{archive bottom}}

== Indefinite block for Harold Foppele ==
I request an indefinite block of {{user|Harold Foppele}}. The behavior that emerged in the English Wikiversity and previously the English Wikipedia shows pretty conclusively, to my mind, that this is an intentionally disruptive account. I can provide more detail upon request, but this will be only meaningful if someone starts looking into the matter.

If this matter is not handled, my best option is to disengage from this user account, which is what I have largely done, except in my user space page tracking problems, but the user account is still not satisfied. The only place where I engaged recently is by adding a tracking item to [[User:Dan Polansky/Problem reports (about Wikiversity problems)]], a page not indexed by Google. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 18:18, 6 November 2025 (UTC)
:For what it's worth, I don't see a lot of context for issues as such, but this is a previous thread that I think is relevant: [[Wikiversity:Colloquium#Concern_regarding_curator_conduct_User:Dan_Polansky]]. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:19, 6 November 2025 (UTC)
:For what it's worth, I '''Strongly Support''' this block and I do not suspect this user has been hacked. He has been banned from page creation on English WP where several editors are working to undue the damage caused to the encyclopedia. I nominated a page I discovered earlier for speedy deletion because it is nonsense gibberish that I strongly believe to be generated by a LLM. Unfortunately, many people such as Harold Foppele who have little to no academic qualifications, but are relatively competent as compared to lay people in a number of academic subjects are easily led into a phenomenon in which they spiral into the belief that they are subject matter experts, or worse, that they've made a scientific or mathematical discovery.[https://futurism.com/chatgpt-chabot-severe-delusions] [[User:Revolving Doormat|Revolving Doormat]] ([[User talk:Revolving Doormat|discuss]] • [[Special:Contributions/Revolving Doormat|contribs]]) 15:59, 6 December 2025 (UTC)
::[[Chaos Theory Extended]] - for posterity, since it's not in the list of articles below. [[User:Revolving Doormat|Revolving Doormat]] ([[User talk:Revolving Doormat|discuss]] • [[Special:Contributions/Revolving Doormat|contribs]]) 16:02, 6 December 2025 (UTC)
:::@[[User:Koavf|Justin]] courtesy ping - but you may want to bring Harold there as well. I don't know how different the expectations for user conduct are from WP to here, but this user is littering both WP and WV with disinformation that I suspect was generated by a LLM (per above). That said, the user is now being very combative with myself and another user I alerted on WP about the same behavior he was page-creation banned for on WP. This sort of conduct toward other users is unacceptable on WP and I cannot imagine how it can be productive for WV either, if the goal is to have educational content for the internet. Example of behavior towards me on WV: https://en.wikiversity.org/w/index.php?title=User_talk:Jtneill&amp;oldid=2778451 [[User:Revolving Doormat|Revolving Doormat]] ([[User talk:Revolving Doormat|discuss]] • [[Special:Contributions/Revolving Doormat|contribs]]) 17:29, 6 December 2025 (UTC)
::::Is the combativeness just the post that &quot;user &lt;var&gt;x&lt;/var&gt; is pointing to...&quot;? That doesn't seem so outrageous that it warrants some action. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:05, 6 December 2025 (UTC)
:::::Like I said, the behavior this user is displaying here is unacceptable on WP, but I'm not familiar with WV policy. Making up a lie to support that users are sockpuppeting is an example of a laundry list of combative behavior toward users who are trying to do something about the fact that this user is creating massive amounts of disinformation, likely using a LLM to do so, without any expertise to examine the generated material before adding it to WV.
:::::If WV is meant to provide non-fictional education, this needs to be addressed. The behavior in response to attempts to clean it up from this user should warrant some sort of action to stop the disruptive behavior. [[User:Revolving Doormat|Revolving Doormat]] ([[User talk:Revolving Doormat|discuss]] • [[Special:Contributions/Revolving Doormat|contribs]]) 18:15, 6 December 2025 (UTC)
::::::As I can prove by : [[User:Harold Foppele/Quantum entanglement of photons and their statistics]] (I'm not sure of the title yet) that was created '''before''' Revolving Doormat stepped in, by simply looking at the &quot;view history&quot; this is the way I build pages. First find a source + refs then create the article step by step. {{ping|Koavf}} please check the creation times if you like. It should proof the way I write a new page. Sometimes the writing and re-writing takes a long time, as does the finding compatible word claryfications. Thanks [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 18:50, 6 December 2025 (UTC)
:::::::You’re saying you first read seven references, just to reach a 3 word conclusion about quantum entanglement, namely:
::::::::{{tq| Applications: cryptography, teleportation.}}
:::::::Given that you citebombed the entire article, and given your WP history, the suggestion that you’re looking for sources first before you create an article is absolutely absurd [[Special:Contributions/&amp;#126;2025-38978-95|&amp;#126;2025-38978-95]] ([[User talk:&amp;#126;2025-38978-95|talk]]) 19:08, 6 December 2025 (UTC)
::::::::WOW is that what it is not all about?  The source, the source and nothing but the source?
::::::::I assume we are still talking about the above mentioned page. You obviously did not read any further. If you should look better at the page you will see that its just a set up. It must yet be worked out. But you never came to the section '''==Start==''' where a link is to the complete article. To take in all that information and write the page is a hell of a lot of work. At least I have reliable cites. So i suggest you go citebomb yourself. &lt;sorry&gt; You and Revolving Doormat work as a team? Thanks [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 19:23, 6 December 2025 (UTC)
:::::::::There are only two options here:
::::::::::* you’ve seen applications of quantum entanglement mentionned somewhere and you decided to look for references in support of your claim
::::::::::* you’ ve actually read and fully comprehended the seven articles you referenced, but were unable to summarize them beyond 3 words.
:::::::::Both cases are big red flags [[Special:Contributions/&amp;#126;2025-38978-95|&amp;#126;2025-38978-95]] ([[User talk:&amp;#126;2025-38978-95|talk]]) 19:34, 6 December 2025 (UTC)
::::::::::Do you actually read what I write? [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 19:37, 6 December 2025 (UTC)
:::::::::::Yes, and given that they were only 3 words in the subsection “quantum entaglement”, it didn’t take that long.
:::::::::::And no, the rest of the “article” didn’t put those 3 words, nor my criticism, into context [[Special:Contributions/&amp;#126;2025-38978-95|&amp;#126;2025-38978-95]] ([[User talk:&amp;#126;2025-38978-95|talk]]) 19:41, 6 December 2025 (UTC)
::::::::::::So again you did not read it till the end. I suggest you to read below. [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 19:47, 6 December 2025 (UTC)
:::::::::::::With “the end”, do you mean
::::::::::::::{{tq|Waveguide BS key for integrated photonics.}}
:::::::::::::because i don’t see how that supports your case. 
:::::::::::::My criticism is that you claim that you first thoroughly read references before you create an article. My criticism is that I find that very hard to believe, based on you citebombing the entire article, using the “3 words” mentionned earlier as an example. [[Special:Contributions/&amp;#126;2025-38978-95|&amp;#126;2025-38978-95]] ([[User talk:&amp;#126;2025-38978-95|talk]]) 19:52, 6 December 2025 (UTC)
::::::::::::::NO : [[User:Harold_Foppele/Quantum_entanglement_of_photons_and_their_statistics#Test]] So you just proved my point that you don't read. [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 19:59, 6 December 2025 (UTC)
:::::::::::::::You mean the reference list? What does that have to do with the content you provided or with my criticism? Absolutely nothing.
:::::::::::::::But ok, let me give another random other example then:
::::::::::::::::{{tq| 2001: KLM protocol for quantum computing with linear optics.}}
:::::::::::::::the reference you provide doesn’t mention the “KLM protocol” (whatever that might be) once. Ergo, you didn’t base that claim on the cited reference. 
:::::::::::::::The reason it’s so easy to give random examples is because it’s the case for pretty much every inline citation you provide. So please don’t make the claim that you read all the references first and then write an article based on them [[Special:Contributions/&amp;#126;2025-38978-95|&amp;#126;2025-38978-95]] ([[User talk:&amp;#126;2025-38978-95|talk]]) 20:07, 6 December 2025 (UTC)
::::::::::::::::I assume you found the section &lt;code&gt;==Test==&lt;/code&gt;. If so, then again there is a list of refs. I am just sorting it out — my goodness, it's a DRAFT and I don't make any claim. They're just reminders to use the cites. Instead of &lt;code&gt;2001:KLM&lt;/code&gt;, read &lt;code&gt;2001:Poop&lt;/code&gt; (excuse me). It's less than a framework and you were:
::::::::::::::::* not reading it,
::::::::::::::::* just criticizing it,
::::::::::::::::* and refusing to admit that you missed the text after the first &lt;code&gt;&lt;Reference&gt;&lt;/code&gt; while it is less than 0.05% finished. [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 20:20, 6 December 2025 (UTC)
:::::::::::::::::Got it, from now on I’ll just read the cites and interpret your contributions as “poop”. 
:::::::::::::::::I think this sums all your contributions up perfectly. I '''strongly support''' the block. [[Special:Contributions/&amp;#126;2025-38978-95|&amp;#126;2025-38978-95]] ([[User talk:&amp;#126;2025-38978-95|talk]]) 20:31, 6 December 2025 (UTC)
:::::::::::::::::P.S. Knill, E.; Laflamme, R.; Milburn, G. KLM  Ref#8 and NO I didn'í check it yet and neither did you.  [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 20:33, 6 December 2025 (UTC)
::::::::::::::::::Ergo, when you said:
:::::::::::::::::::{{tq|”this is the way I build pages. First find a source + refs then create the article step by step.”}}
::::::::::::::::::you were disingenuous. Thank you for confirming. Oh and contrary to you, I did look up the paper and ctrl+f’ed “KLM”. Because I actually read references… [[Special:Contributions/&amp;#126;2025-38978-95|&amp;#126;2025-38978-95]] ([[User talk:&amp;#126;2025-38978-95|talk]]) 20:38, 6 December 2025 (UTC)
:::::::::::::::::::Don't make a fool of yourself. The refs all belong to and are in the article and ofcourse you didn't read that either. As I mentioned before this is not a very fruitfull disscussion  [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 20:42, 6 December 2025 (UTC)
::::::::::::::::::::I actually did, because it’s easy for me to access the reference based on the DOI. [[Special:Contributions/&amp;#126;2025-38978-95|&amp;#126;2025-38978-95]] ([[User talk:&amp;#126;2025-38978-95|talk]]) 20:47, 6 December 2025 (UTC)
::::::::::::::::::You cannot blame this behavior on account of it being a draft. Though drafts are not sandboxes, that is what the sandbox is for. Regardless, this same issue exists in your mainspace pages, as demonstrated below. [[User:Revolving Doormat|Revolving Doormat]] ([[User talk:Revolving Doormat|discuss]] • [[Special:Contributions/Revolving Doormat|contribs]]) 22:07, 6 December 2025 (UTC)
:::::::::::::::::::You should know, but since you are a &quot;novice editor&quot; according to Ldm1954, that Wikiversity has sandboxes and userspaces. They both work simmilar the difference is that you can easier title them. They are free to the user. Wikiversity has a draft space but not alike Wikipedia. The same goes for WP:OR which is a capital sin at Wikipedia but encouraged at Wikiversity. [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 22:16, 6 December 2025 (UTC)
::::::::::::::::::::Cool. I didn't say anything about OR as I already read that is encouraged here, however, that doesn't mean you can create disinformation that is unsupported by citations you provide and violate copyright laws. 
::::::::::::::::::::Regardless, what's in your userspace shows the same behavior. You are creating content before you find a reference for it, which indicates no research at all. [[User:Revolving Doormat|Revolving Doormat]] ([[User talk:Revolving Doormat|discuss]] • [[Special:Contributions/Revolving Doormat|contribs]]) 22:28, 6 December 2025 (UTC)
:::::::::::::::::::::Actually you are repeating 2025.... Look at the page, it has some 68  references and I expect it to be some 80 for a 29 page paper. The page (is not an article as in Wikipedia) has very little text and A LOT of refs and a LONG paper to incorporate. How about you help me to create and expand it? The motto of Wikiversity contrary to Wikipedia is: &quot;Be Bold&quot;. So go for it.[[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 22:36, 6 December 2025 (UTC)&lt;br&gt;
::::::::: '''Outdent''' @[[W:user:Revolving Doormat]] I challenge both of you to jointly create the page. Meaning I do all the work and you do some controlling. Or work actual together if you like. Up to you two. Deal? [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 22:48, 6 December 2025 (UTC)

:::::::The crux of the issue is that the pages you are creating have little no basis in physical reality and are not supported by the citations you provide. You seem to self-admit that you have no expertise in these topics, so how can you possibly examine an entire article on the subject matter for coherence and accuracy, let alone author it for the public to learn from?
:::::::The point is that it's nonsense that isn't supported by the citations you provide. This is the exact same problem your pages had on WP, and it was noted that someone else deleted one of your pages because the citations were also hallucinated. This is why you cannot create pages there any longer. I do not understand why you are creating education and encyclopedia content for the public on subject matter you are not qualified to teach. [[User:Revolving Doormat|Revolving Doormat]] ([[User talk:Revolving Doormat|discuss]] • [[Special:Contributions/Revolving Doormat|contribs]]) 19:25, 6 December 2025 (UTC)
::::::::So you two work as a team obviously. Is it so hard to respond to what i wrote above? Only read the first part and they say this is rubish? Ofcourse it is! Its just a basic start with 64 refs and 29 pages of the article to incorporate in this page. Cheers [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 19:34, 6 December 2025 (UTC)
:::::::::All of your arguments are logical fallacies that avoid the reasonable criticism that the content you are creating is dis-informational gibberish that does not in anyway summarize or represent the references you are using as citations. There are so many numerous instances of this in all of your articles.
:::::::::Content that is supported appears to all have been taken from Wikipedia. Ie, https://en.wikipedia.org/wiki/Chaos_theory [[User:Revolving Doormat|Revolving Doormat]] ([[User talk:Revolving Doormat|discuss]] • [[Special:Contributions/Revolving Doormat|contribs]]) 19:40, 6 December 2025 (UTC)
::::::::::You dont want to go into what I wrote above and just repeat yourself. If you dont want to respond than this is not a fruitfull discussion.  [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 19:44, 6 December 2025 (UTC)
:::::::::::Lobbing spurious claims and ad hominem is not worth responding to. The only thing that matters is something you will not address. Your citations either don't support the content, which doesn't make physical sense; or it does, and that content and its citation has been unlawfully copy-and-pasted from Wikipedia. [[User:Revolving Doormat|Revolving Doormat]] ([[User talk:Revolving Doormat|discuss]] • [[Special:Contributions/Revolving Doormat|contribs]]) 20:45, 6 December 2025 (UTC)
::::::::::::I challenge you to prove that! [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 21:06, 6 December 2025 (UTC)
:::::::::::::Sure. From [[Chaos Theory Extended]]
:::::::::::::{{tq|Some definitions of chaos do not rely on sensitivity to initial conditions. One example is combinatorial chaos, which arises when a discrete combinatorial rule is applied repeatedly.}} 
:::::::::::::The citation you give is [https://www.newscientist.com/article/mg12617232-800-science-mathematician-discovers-a-more-complex-form-of-chaos/], which does not mention &quot;combinatorial chaos,&quot; a made-up term. It also is not an example I would use to support the first sentence, as the paper is not describing a lack of reliance to initial condition sensitivity. It is describing the undecidable nature of certain dynamical systems and showing it is algorithmically equivalent to Alan Turing's halting problem, even when you know precisely the initial conditions. The process described is applying a continuous transformation, not a discrete one repeatedly. That tells me that you did not read this source to create the content, and likely do not understand what you wrote to choose a proper source to support it. 
:::::::::::::For copyvio: compare [[Chaos Theory Extended#Sensitivity to initial conditions]] to [https://en.wikipedia.org/wiki/Chaos_theory#Sensitivity_to_initial_conditions https://en.wikipedia.org/wiki/Chaos_theory#Sensitivity_to_initial_conditions] Straight to the book and page number! Did you even read this book? [[User:Revolving Doormat|Revolving Doormat]] ([[User talk:Revolving Doormat|discuss]] • [[Special:Contributions/Revolving Doormat|contribs]]) 21:36, 6 December 2025 (UTC)
::::::::::::::So you actually say: You find a reference at Wikipedia and NO you may not use that? [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 21:48, 6 December 2025 (UTC)
:::::::::::::::No he does not. Would you like to have another guess? Hint: it’s the same criticism you’ve been getting for half a year now. [[Special:Contributions/&amp;#126;2025-38781-32|&amp;#126;2025-38781-32]] ([[User talk:&amp;#126;2025-38781-32|talk]]) 21:52, 6 December 2025 (UTC)
::::::::::::::::And you two are not working as a team ? [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 21:54, 6 December 2025 (UTC)
:::::::::::::::::No. Now can you please for once actually listen to the criticism? [[Special:Contributions/&amp;#126;2025-38781-32|&amp;#126;2025-38781-32]] ([[User talk:&amp;#126;2025-38781-32|talk]]) 21:58, 6 December 2025 (UTC)
:::::::::::::::No, I quite clearly said that you do not appear to be reading your sources, and you 1) violate copyright laws by copying and pasting from WP and 2) make up nonsense on topics that you don't understand.
:::::::::::::::I still believe point 2 to be LLM generation based on several common patterns, particularly under the heading &quot;Bottom Line.&quot; [[User:Revolving Doormat|Revolving Doormat]] ([[User talk:Revolving Doormat|discuss]] • [[Special:Contributions/Revolving Doormat|contribs]]) 22:02, 6 December 2025 (UTC)

A recent piece of evidence is this: [[User talk:Jtneill#Publishing transcripts]]. Here, the user pretends not to understand that copying copyrighted material into Wikiversity, which requires CC-BY-SA, is disallowed; I find this not credible, especially after we explained copyright matters to him before. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 18:36, 6 November 2025 (UTC)

:Just to get context: look at '''Contest removal of article''' above and : [[Wikiversity:Colloquium#Concern_regarding_curator_conduct_User:Dan_Polansky]], I think this speaks for itself. Please let some bureaucrat put a stop to this. Also look at the &quot;view history&quot; of this paragraph. It might be meaningfull. Kind regards,[[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 18:41, 6 November 2025 (UTC)

:: For specifics: the user copied into [[User:Harold Foppele/sandbox-2]] the text or parts of text of ''There's Plenty of Room at the Bottom'' by Richard Feynman, found e.g. at https://www.zyvex.com/nanotech/feynman.html. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 18:42, 6 November 2025 (UTC)
:::You forgot: [[W:There's Plenty of Room at the Bottom|There's Plenty of Room at the Bottom]] [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 18:49, 6 November 2025 (UTC)
:::: The above link [[W:There's Plenty of Room at the Bottom]] is irrelevant: it points to Wikipedia, which is about Feynman's article and does not replicate the text of the article. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 18:53, 6 November 2025 (UTC)
:::::No kidding let me rephrase that: Please be serious[[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 19:17, 6 November 2025 (UTC)

:I'd like to refactor this conversation because it's not going in a helpful direction. Dan, if you want to propose an indefinite block, I think you need more than just &quot;this is disruptive, look it up&quot;. Please give me some indication of what this user has done that is disruptive, and particularly, provide a relevant diff(s). I did a preliminary search (as noted in my first comment), but I don't see something so egregious as to require an indef block or any attempts to correct behavior. I've never interacted with this user prior to this thread and since it's been posted, he seems reasonable enough, so I'm disinclined to think that he's here for purely disruptive purposes or just refuses to abide by basic norms. Additionally, while issues at other wikis can be a minor factor in assessing if someone should be blocked here, it's pretty weak evidence and either way, he's not blocked on any WMF wikis, so I'm not seeing a persistent pattern of cross-wiki disruption. I just need something more to go on here to even understand why this was posted at all.
:It's unfortunate, but sometimes it happens that two editors for whatever reason clash and neither is necessarily in the wrong or so in the wrong that it requires that one of them be forced to not participate. My suspicion is that's what's happening here and maybe just generally trying to avoid conflict is the best solution. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 09:20, 7 November 2025 (UTC)
:: Can you please explain how his above &quot;No kidding let me rephrase that: Please be serious&quot; is a remotely acceptable/productive response? Why is there no space and no period before &quot;Harold Foppele&quot; in 'No kidding let me rephrase that: Please be serious[[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 19:17, 6 November 2025 (UTC)'? Why is there no punctuation after &quot;No kidding&quot;? --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 09:56, 7 November 2025 (UTC)
:: Do you find the interaction the user showed in https://en.wikiversity.org/w/index.php?title=User_talk:Harold_Foppele&amp;oldid=2760143 reasonable? --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 10:02, 7 November 2025 (UTC)
:: Is [[Special:Diff/2761229|this edit]] that removes a communication from mainspace talk page reasonable? --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 10:04, 7 November 2025 (UTC)
:::Stop acting like a baby please. From [[user:Dan Polansky]] &lt;blockquote&gt; Dan Polansky is described in more detail at [[metawiki:User:Dan_Polansky|Meta:User:Dan Polansky]]. He is trained in computer science (master's degree from a Czech university), earned money as a programmer and software engineer, and loves real philosophy and stubborn independent attempt to think clearly.&lt;/blockquote&gt;
:::Do you always write in the third person about yourself? [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 10:08, 7 November 2025 (UTC)
:::: How is the imperative &quot;Stop acting like a baby please&quot; remotely acceptable? The above could as well be removed as off-topic, since the subject of this thread is Harold Foppele, not Dan Polansky (myself). The tactic employed is one of diversion. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 10:28, 7 November 2025 (UTC)
::::As I &lt;em&gt;just&lt;/em&gt; wrote above, I don't think this conversation is progressing in a productive way and I also just suggested that the two of you please avoid direct confrontation. Next thing I see, there are posts by DP which do not answer my questions and then HF showing up just to write some juvenile, off-topic nonsense. Guys, stop. Dan, if you have specific diffs that could justify an indefinite block, please provide them. Otherwise, instead of tacitly saying that you two should stop interacting to explicitly requesting that the two of you please avoid interacting in the immediate. Harold, if Dan provides some kind of actual rationale for a block, you would not be unilaterally blocked without some clear justification, so you don't need to jump in to defend yourself at this juncture. This entire thing &lt;em&gt;could&lt;/em&gt; be resolved by the two of you just chilling out and not hounding one another. Again, please stop. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 10:29, 7 November 2025 (UTC)
::::: The indefinite block would only be justified by a series/collection of items, not the individual items per se (on their own). Above, I pointed out multiple problematic items: 1) sustained copyright violation despite explanations; 2) flippant/incivil responses above, e.g. &quot;Stop acting like a baby please&quot;; 3) problematic communication thread showing multiple red flags (by means of a link). One could provide extensive evidence, but first you would need to agree that you see at least some problematic items. If all items that I raise you classify as non-issues, then I really have no case to build. The most compelling evidence is probably in Wikipedia, including his pretend naivety in asking whether his Dutch draft is good for English Wikipedia, and multiple emptying of AfD page, but you seem to think they are less relevant for the English Wikiversity. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 10:36, 7 November 2025 (UTC)
::::::Thanks, Dan.
::::::#Persistent copyvios is a serious concern. Per the conversation that I had on my talk page and the fact that I deleted what is likely a copyvio in HF's userspace, he responded positively and seems to understand in principle that he cannot upload copyright violations here. Uploading even one more copyvio here would definitely be grounds for a block in my view, since that is a serious issue and he's been made aware of it. Not sure about indef block, but certainly a block. {{Ping|Harold Foppele}}, please ensure that you do not upload copyrighted material here that does not have a compatible license. If you are unsure, err on the side of not uploading.
::::::#Generally hostile, puerile, or altogether unhelpful language is also a grounds for blocking, but it is not as big of a concern. Persistent unhelpful comments are inappropriate and I would like to request that everyone refrain from those and please be civil. I am speaking from experience here, as I have (rightfully) been blocked for having hostile communications. Please do not respond if you cannot respond in a civil and helpful manner.
::::::#Off-wiki activity (including activity at other wikis) is weak but if it's particularly egregious, then it can result in a block I suppose. I don't see anything like that here, so that's just a distraction.
::::::In short, please do not upload copyvios (that justifies a block), do not badger one another (that applies to everyone and can justify a block over time), and please just take some time to cool off. I don't see a need for a block at this time, but will respect any sysop who does. I propose that we just move onwards and upwards and both of you please think twice about your communications and how constructive they are. In particular, don't hound one another and don't post juvenile slights and insults, which are not individually that much of a problem, but in total are poison for a wiki.
::::::Anyone else, feel free to correct me if I'm wrong here. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 10:47, 7 November 2025 (UTC)
:::::Thanks Justin The talk about dots and commma's is ofcource not important. This is my last response to the rantings.(my opinion}. [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 10:37, 7 November 2025 (UTC)
:::::: Justin, do you really think that the above overt disregard for English spelling, spacing, punctuation, etc. is just an unintentional accident rather than trolling? I struggle to believe that. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 10:43, 7 November 2025 (UTC)
:::::::I honestly don't know or particularly care: poorly-formatted messages are an annoyance and sometimes they can be so unintelligible as to cause a real problem, but I can't imagine the scenario where punctuation is grounds for an indef block. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 10:48, 7 November 2025 (UTC)
:::::::: No, individual bad item like this is not grounds for indef; it is only one item that together with other items create a larger picture. It solidifies the picture of an annoying troll, together with other elements/pixels/whatever-that-is. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 10:56, 7 November 2025 (UTC)
:::::::::I agree that a persistent pattern of lo-/no-value comments adds up to trolling that is worth blocking. As I mentioned above when I warned against generally unhelpful language, dumb comments that are not helpful should be avoided. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 10:59, 7 November 2025 (UTC)

As an attempt to start collecting more evidence, I will link pages from Wikipedia that, to my mind, show a very problematic editor pretty clearly:
* https://en.wikipedia.org/w/index.php?title=User_talk:Harold_Foppele&amp;oldid=1306946342, 20 August 2025
* https://en.wikipedia.org/w/index.php?title=User_talk:Harold_Foppele&amp;oldid=1310762342, 11 September 2025
I may single out problematic items on these pages later. For a start, &quot;I'm not playing a card, i just stated a fact, i am 80 and you hold that againsty me.&quot; is a big red flag. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 09:38, 8 November 2025 (UTC)

[[:Template:Quantum mechanics topics]] created by Harold Foppele account is reminiscent of similar Wikiversity-irrelevant items created by Marshallsumter. One hypothesis to be investigated is whether this could be the operator of Marshallsumter account. Of note is that the operator of Marshallsumter account is quite possibly an impersonator of someone called Hoff, but we do not know that positively. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 08:38, 10 November 2025 (UTC)

[[Special:Diff/2768157|This edit]] by the user is inappropriate. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 11:17, 10 November 2025 (UTC)

And I overlooked this: [[:Template:Quantum mechanics topics]] is another copyvio, this time from [[:W:Template:Quantum mechanics topics]], created on 4 Nov 2025 with no edit summary indicating the origin. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 12:26, 10 November 2025 (UTC)

Page [[User:Harold Foppele/sandbox-3]] was created by the user on 11 November 2025 without an edit summary as a copyvio at least of [[W:Quantum entanglement]]; example copied sentence: &quot;The following subsections use the formalism and theoretical framework developed in the articles bra–ket notation and mathematical formulation of quantum mechanics&quot;. The two pages are not the same and show significant differences (probably resulting from modifications including changes in formulations) but also show substantive similarity. One is not allowed to take a copyrighted artifact as a base for a derived artifact without attribution in this way. (Why a fork of a Wikipedia article would be good to have in Wikiversity, in wiki-voice, is unclear either.) --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 05:42, 11 November 2025 (UTC)

Let me also make it on record that I suspect that the Harold Foppele account has been hacked and that the 2025 edits are not by the original person who made the edits about ten years ago, but that seems hard to prove conclusively using the methods of positivist epistemology (I am a Popperian anyway). Perhaps someone knows more about how to investigate these kinds of matter. This note is important at least in part to make it clear to any reader that we do not claim that a real Dutch man named Harold Foppele with photo such-and-such, an old man, was actually disrupting the English Wikiversity. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:48, 11 November 2025 (UTC)

For ease of tracing, the user now moved [[User:Harold Foppele/sandbox-3]] to [[Quantum a spooky action at a distance]], an ungrammatical headword. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 11:49, 13 November 2025 (UTC)

:[[Chess]]
:[[Chess/Play with other Wikiversitans]]
:[[Chess/Board Configurations]]
:[[Matter Elements and Particles]]
:[[W:Open quantum system|Open quantum system]]
:[[W:Polonium dichloride dibromide|Polonium dichloride dibromide]]
:[[Quantum]]
:[[Quantum A Matter Of Size]]
:[[Quantum a spooky action at a distance]]
:[[Quantum: A Walk Through the Universe]]
:[[Quantum Formulas Collection]]
:[[Quantum mechanics measurements]]
:[[Template:Infobox quantum computing]]
:[[Template:Periodic table (navbox)]]
:[[Template:Quantum mechanics topics]]
:~[[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 12:48, 17 November 2025 (UTC)
::If you want to copy material from another WMF wiki, please request that it be imported. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 20:33, 13 November 2025 (UTC)
:::Thx, will do [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 20:50, 13 November 2025 (UTC)
: I do not understand how someone with apparent no understanding of quantum mechanics should be allowed to create mainspace articles on this advanced subject that is notoriously hard to understand, using some collage method augmented with GenAI, under ungrammatical titles to boot (e.g. &quot;Quantum A Matter Of Size&quot;). This is absurd. With the Marshallsumter fiasco in fresh memory, the English Wikiversity must do better. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 06:04, 15 November 2025 (UTC)
::The discussion going on regarding Dan's behaviour at [[Wikiversity:Community Review/Dan Polansky]] resulted in &quot;temporarily removing the Curator flag&quot; by User:Mu301. [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 11:57, 16 November 2025 (UTC)
::I'm open to any policy-based argument for deleting any material on Wikiversity. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 17:02, 17 November 2025 (UTC)
:::Maybe archiving this mess for starters? The import of [[Template:Periodic table (navbox)]] works flawless. Thanks again ! [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 17:18, 17 November 2025 (UTC)

::: @Justin: When I was doing the administrative/curatorial work of moving pages out of mainspace before I was emergency desysopped in the absence of an actual emergency, including moving those by the mega-prankster Marshallsumter, I was using the language from [[WV:Deletions]], &quot;learning outcomes are scarce&quot;. That language is extremely vague and requires heavy interpretation, filling in of detail. I did fill in the detail. The page does not have the status of a policy, only of a guideline. But then, being a guideline (overridable quasi-policy), it allows leeway, something of an administrative discretion. So if you are asking for a formally approved ''policy'', tough luck, and tough luck doing any curatorial work in the English Wikiversity. If you are content with a ''guideline'' and with interpreting the language &quot;learning outcomes are scarce&quot; in the sense of &quot;learning outcomes for people other than the page creator are scarce&quot; and adding further detail, then I think there is a good rationale for moving the very likely inaccurate, possibly incoherent pages created by an editor with not even a superficial demonstrated understanding of quantum mechanics out of mainspace. Sure enough, learning outcomes from Marshallsumter's incoherent prank-pages is not necessarily &quot;scarce&quot; either since one can learn something from his incoherent collections of quotations, so there is another layer of non-literal interpretation required, in the direction of &quot;things have to make sense&quot;, perhaps &quot;pages have to show minimum coherence&quot;. But even if you move these pages out of mainspace, the obvious troll Harold Foppele is going to continue the disruption. Indef is the right intervention. Alright. Let's wait for the I-told-you-so moment, perhaps much later, after the English Wikiversity project comes to its senses and starts to actually curate the content and block disruptors. --[[User:Dan Polansky|Dan Polansky]] ([[User talk:Dan Polansky|discuss]] • [[Special:Contributions/Dan Polansky|contribs]]) 07:16, 18 November 2025 (UTC)
::::If pages include clear misinformation, then yes, let's delete them. I haven't read these pages. Are they full of misinformation? —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 13:17, 19 November 2025 (UTC)
:::::'''Support Block.''' I would like to bring to this discussion the information that he has just been indef blocked from page creation on the english wikipedia, see https://en.wikipedia.org/wiki/Wikipedia:Administrators%27_noticeboard/Incidents#Requesting_page_creation_block_of_User:Harold_Foppele. Another editor just brought his pages here to my attention [[wikipedia:User_talk:Ldm1954#Thank_you|https://en.wikipedia.org/wiki/User_talk:Ldm1954#Thank you]], from which I found this discussion. I have not checked all the pages here, but from what I can see they fail for the same reasons. N.B., apologies but I don't really want to create an account here unless I have to, so please use my talk page above. I will do a ping on my web page of others on the english wikipedia who voiced opinions on the block and previous behavior. N.B., I do not see any activity on other wikis from his global log. [[Special:Contributions/&amp;#126;2025-38873-79|&amp;#126;2025-38873-79]] ([[User talk:&amp;#126;2025-38873-79|talk]]) 13:53, 6 December 2025 (UTC)
::::::The account . [[Special:Contributions/~2025-38873-79|~2025-38873-79]] pointing to this :
::::::https://en.wikiversity.org/wiki/Wikiversity:Request_custodian_action#c-Revolving_Doormat-20251206155900-Dan_Polansky-20251106181800 accidentially pointing at [[user:Dan Polansky]]
::::::and the non existing accout [[User:Revolving Doormat]] are acting as one unit.
::::::{{ping|Mu301}} Could you please take this in considderation at [[Wikiversity:Community_Review/Dan_Polansky]]  
::::::Thanks [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 17:13, 6 December 2025 (UTC)</text>
      <sha1>nhpp5k3we191ehiuqm0v7z213mtxj1u</sha1>
    </revision>
  </page>
  <page>
    <title>User:Dc.samizdat/Golden chords of the 120-cell</title>
    <ns>2</ns>
    <id>326765</id>
    <revision>
      <id>2809748</id>
      <parentid>2809605</parentid>
      <timestamp>2026-05-16T20:43:25Z</timestamp>
      <contributor>
        <username>Dc.samizdat</username>
        <id>2856930</id>
      </contributor>
      <comment>/* The 8-point regular polytopes */</comment>
      <origin>2809748</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="45777" sha1="nzburl1xv17d1tn263vou1vmrky0gkv" xml:space="preserve">{{align|center|David Brooks Christie}}
{{align|center|dc@samizdat.org}}
{{align|center|Draft in progress}}
{{align|center|January 2026 - April 2026}}

&lt;blockquote&gt;Steinbach discovered the formula for the ratios of diagonal to side in the regular polygons. Fontaine and Hurley extended this result, discovering a formula for the reciprocal of a regular polygon chord derived geometrically from the chord's star polygon. We observe that these findings in plane geometry apply more generally, to polytopes of any dimensionality. Fontaine and Hurley's geometric procedure for finding the reciprocals of the chords of a regular polygon from their star polygons also finds the rotational geodesics of any polytope of any dimensionality.&lt;/blockquote&gt;
== Introduction ==
Steinbach discovered the Diagonal Product Formula and the Golden Fields family of ratios of diagonal to side in the regular polygons. He showed how this family extends beyond the pentagon {5} with its well-known golden bisection proportional to 𝜙, finding that the heptagon {7} has an analogous trisection, the nonagon {9} has an analogous quadrasection, and the hendecagon {11} has an analogous pentasection, an extended family of golden proportions with quasiperiodic properties. 

Kappraff and Adamson extended these findings in plane geometry to a theory of Generalized Fibonacci Sequences, showing that the Golden Fields not only do not end with the hendecagon, they form an infinite number of periodic trajectories when operated on by the Mandelbrot operator. They found a relation between the edges of star polygons and dynamical systems in the state of chaos, revealing a connection between chaos theory, number, and rotations in Coxeter Euclidean geometry. 

Fontaine and Hurley examined Steinbach's finding that the length of each chord of a regular polygon is both the product of two chords and the sum of a set of smaller chords, so that in rotations to add is to multiply. They illustrated Steinbach's sets of additive chords lying parallel to each other in the plane (pointing in the same direction), and by applying Steinbach's formula more generally they found another summation relation of signed parallel chords (pointing in opposite directions) which relates each chord length to its reciprocal, and relates the summation to a distinct star polygon rotation. 

We examine these remarkable findings (which stem from study of the chords of humble regular polygons) in higher-dimensional spaces, specifically in the chords, polygons and rotations of the [[120-cell]], the largest four-dimensional regular convex polytope.

== Visualizing the 120-cell ==
{| class=&quot;wikitable floatright&quot; width=&quot;400&quot;
|style=&quot;vertical-align:top&quot;|[[File:120-cell.gif|200px]]&lt;br&gt;Orthographic projection of the 600-point 120-cell &lt;small&gt;&lt;math&gt;\{5,3,3\}&lt;/math&gt;&lt;/small&gt; performing a [[W:SO(4)#Geometry of 4D rotations|simple rotation]].{{Sfn|Hise|2011|loc=File:120-cell.gif|ps=; &quot;Created by Jason Hise with Maya and Macromedia Fireworks. A 3D projection of a 120-cell performing a [[W:SO(4)#Geometry of 4D rotations|simple rotation]].&quot;}} In this simplified rendering only the 120-cell's own edges are shown; its 29 interior chords are not rendered. Therefore even though it is translucent, only its outer surface is visible. The complex interior parts of the 120-cell, all its inscribed 5-cells, 16-cells, 8-cells, 24-cells, 600-cells and its much larger inventory of polyhedra, are completely invisible in this view, as none of their edges are rendered at all.
|style=&quot;vertical-align:top&quot;|[[File:Ortho solid 016-uniform polychoron p33-t0.png|200px]]&lt;br&gt;Orthographic projection of the 600-point [[W:Great grand stellated 120-cell|great grand stellated 120-cell]] &lt;small&gt;&lt;math&gt;\{\tfrac{5}{2},3,3\}&lt;/math&gt;&lt;/small&gt;.{{Sfn|Ruen: Great grand stellated 120-cell|2007}} The 120-cell is its convex hull. The projection to the left renders only the 120-cell's shortest chord, its 1200 edges. The projection above also renders only one of the 120-cell's 30 chords, the edges of its 120 inscribed regular 5-cells. The 120-cell itself (the convex hull) is invisible in this view, as its edges are not rendered.
|}

[[120-cell#Geometry|The 120-cell is the maximally complex regular 4-polytope]], containing inscribed instances of every regular 1-, 2-, 3-, and 4-polytope, except the regular polygons of more than {15} sides. 

The 120-cell is the convex hull of a regular [[120-cell#Relationships among interior polytopes|compound of each of the 6 regular convex 4-polytopes]]. They are the [[5-cell|5-point (5-cell) 4-simplex]], the [[16-cell|8-point (16-cell) 4-orthoplex]], the [[W:Tesseract|16-point (8-cell) tesseract]], the [[24-cell|24-point (24-cell)]], the [[600-cell|120-point (600-cell)]], and the [[120-cell|600-point (120-cell)]]. The 120-cell is the convex hull of a compound of 120 disjoint regular 5-cells, of 75 disjoint 16-cells, of 25 disjoint 24-cells, and of 5 disjoint 600-cells.

The 120-cell contains an even larger inventory of irregular polytopes, created by the intersection of multiple instances of these component regular 4-polytopes. Many are quite unexpected, because they do not occur as components of any regular polytope smaller than the 120-cell. As just one example among the [[120-cell#Concentric hulls|sections of the 120-cell]], there is an irregular 24-point polyhedron with 16 triangle faces and 4 nonagon {9} faces.{{Sfn|Moxness|}}

Most renderings of the 120-cell, like the rotating projection here, only illustrate its outer surface, which is a honeycomb of face-bonded dodecahedral cells. Only the objects in its 3-dimensional surface are rendered, namely the 120 dodecahedra, their pentagon faces, and their edges. Although the 120-cell has chords of 30 distinct lengths, in this kind of simplified rendering only the 120-cell's own edges (its shortest chord) are shown. Its 29 interior chords, the edges of objects in the interior of the 120-cell, are not rendered, so interior objects are not visible at all.

Visualizing the complete interior of the 600-vertex 120-cell in a single image is impractical because of its complexity. Only four 120-cell edges are incident at each vertex, but [[120-cell#Chords|600 chords (of all 30 lengths)]] are incident at ''each'' vertex.

== Compounds in the 120-cell ==
The 8-point (16-cell), not the 5-point (5-cell), is the smallest building block; it compounds to every larger regular 4-polytope. The 5-point (5-cell) does compound to the 600-point (120-cell), but it does not fit into any smaller regular 4-polytope. 

The 8-point (16-cell) compounds by 2 in the 16-point (8-cell), and by 3 in the 24-point (24-cell). The 16-point (8-cell) compounds in the 24-point (24-cell) by 3 non-disjoint instances of itself, with each of the 24 vertices shared by two 16-point (8-cells). The 24-point (24-cell) compounds by 5 disjoint instances of itself in the 120-point (600-cell), and the 120-point (600-cell) compounds by 5 disjoint instances of itself in the 600-point (120-cell).

The 24-point (24-cell) also compounds by &lt;math&gt;5^2&lt;/math&gt; non-disjoint instances of itself in the 120-point (600-cell); it compounds in 5 disjoint instances of itself, 10 (not 5) different ways. Whichever set of 5 disjoint 24-point (24-cells) are assembled, the resulting 120-point (600-cell) contains 25 distinct 24-point (24-cells), not just 5 (or 10). This implies that 15 disjoint 8-point (16-cells) will construct a 120-point (600-cell), which will contain 75 distinct 8-point (16-cells). 

The 600-point (120-cell) is 5 disjoint 120-point (600-cells), just 2 different ways (not 5 or 10 ways), so it is 10 distinct 120-point (600-cells). This implies that the 8-point (16-cell) compounds by 3 times &lt;math&gt;5^2&lt;/math&gt; (75) disjoint instances of itself in the 600-point (120-cell), which contains &lt;math&gt;3^2&lt;/math&gt; times  &lt;math&gt;5^2&lt;/math&gt; (225) distinct instances of the 24-point (24-cell), and  &lt;math&gt;3^3&lt;/math&gt; times &lt;math&gt;5^2&lt;/math&gt; (675) distinct instances of the 8-point (16-cell). 

These facts were discovered painstakingly by various researchers, and no one has found a general rule governing subsumption relations among regular polytopes. The reasons for some of their numeric incidence relations are far from obvious. [[W:Pieter Hendrik Schoute|Schoute]] was the first to see that the 120-point (600-cell) is a compound of 5 24-point (24-cells) ''10 different ways'', and after he saw it a hundred years lapsed until Denney, Hooker, Johnson, Robinson, Butler &amp; Claiborne proved his result, and showed why.{{Sfn|Denney, Hooker, Johnson, Robinson, Butler &amp; Claiborne|2020|loc=''The geometry of H4 polytopes''}}

So much for the compounds of 16-cells. The 120-cell is also the convex hull of the compound of 120 disjoint regular 5-cells. That stellated compound (without its convex hull of 120-cell edges) is the [[w:Great_grand_stellated_120-cell|great grand stellated 120-cell]] illustrated above, the final regular [[W:Stellation|stellation]] of the 120-cell, and the only [[W:Schläfli-Hess polychoron|regular star 4-polytope]] to have the 120-cell for its convex hull. The edges of the great grand stellated 120-cell are &lt;math&gt;\phi^6&lt;/math&gt; as long as those of its 120-cell [[W:List of polyhedral stellations#Stellation process|stellation core]] deep inside.

The compound of 120 disjoint 5-point (5-cells) can be seen to be equivalent to the compound of 5 disjoint 120-point (600-cells), as follows. Beginning with a single 120-point (600-cell), expand each vertex into a regular 5-cell, by adding 4 new equidistant vertices, such that the 5 vertices form a regular 5-cell inscribed in the 3-sphere. The 120 5-cells are disjoint, and the 600 vertices form 5 disjoint 120-point (600-cells): a 120-cell.

== Thirty distinguished distances ==
The 30 numbers listed in the table are all-important in Euclidean geometry. A case can be made on symmetry grounds that their squares are the 30 most important numbers between 0 and 4. The 30 rows of the table are the 30 distinct [[120-cell#Geodesic rectangles|chord lengths of the unit-radius 120-cell]], the largest regular convex 4-polytope. Since the 120-cell subsumes all smaller regular polytopes, its 30 chords are the complete chord set of all the regular polytopes that can be constructed in the first four dimensions of Euclidean space, except for regular polygons of more than 15 sides.

{| class=&quot;wikitable&quot; style=&quot;white-space:nowrap;text-align:center&quot;
!rowspan=2|&lt;math&gt;c_t&lt;/math&gt;
!rowspan=2|arc
!rowspan=2|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{n}\right\}&lt;/math&gt;&lt;/small&gt;
!rowspan=2|&lt;math&gt;\left\{p\right\}&lt;/math&gt;
!rowspan=2|&lt;small&gt;&lt;math&gt;m\left\{\frac{k}{d}\right\}&lt;/math&gt;&lt;/small&gt;
!rowspan=2|Steinbach roots
!colspan=7|Chord lengths of the unit 120-cell
|-
!colspan=5|unit-radius length &lt;math&gt;c_t&lt;/math&gt;
!colspan=2|unit-edge length &lt;math&gt;c_t/c_1&lt;/math&gt;&lt;br&gt;in 120-cell of radius &lt;math&gt;c_8=\sqrt{2}\phi^2&lt;/math&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{1,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;15.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{30\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{30\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;c_{4,1}-c_{2,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7-3 \sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.270091&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2} \phi ^2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2 \phi ^4}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.072949}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{2,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;25.2{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{2}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \left\{15\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(c_{18,1}-c_{4,1}\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{3-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.437016&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2} \phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2 \phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.190983}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.61803&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{3,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;36{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{10\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3 \left\{\frac{10}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(\sqrt{5}-1\right) c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(\sqrt{5}-1\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.618034&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{\phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.381966}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.28825&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{4,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;41.4{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{c_{8,1}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.707107&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.61803&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{5,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;44.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{4}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \left\{\frac{15}{2}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} c_{2,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{9-3 \sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.756934&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{\frac{3}{2}}}{\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2 \phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.572949}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} \phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.80252&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{6,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;49.1{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{17}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{5-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{5-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.831254&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt[4]{5} \sqrt{\frac{1}{\phi }}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\sqrt{5}}{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.690983}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\phi ^3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.07768&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{7,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;56.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{20}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{1}{\phi }} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{2}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.93913&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{\frac{\psi }{\phi }}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\psi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.881966}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\psi  \phi ^3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.47709&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;60{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{5}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{6\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{6\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.70246&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{9,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;66.1{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{40}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{1}{2 \phi }} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.09132&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{\frac{\chi }{\phi }}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\chi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.19098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\chi  \phi ^3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.04057&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{10,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;69.8{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{11}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi  c_{4,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1+\sqrt{5}}{2 \sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.14412&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\phi }{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\phi ^2}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.30902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^3&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.23607&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{11,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;72{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{6}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{5\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{5\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\frac{1}{\phi }} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\frac{2}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.17557&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3-\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3-\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.38197}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \sqrt{3-\phi } \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.3525&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{12,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;75.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{24}{5}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.22474&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.53457&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{13,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;81.1{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{13}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{9-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{9-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.30038&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{9-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(9-\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.69098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(9-\sqrt{5}\right)} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.8146&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{14,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;84.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{40}{9}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt[4]{5} \sqrt{\phi } c_{8,1}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt[4]{5} \sqrt{1+\sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.345&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt[4]{5} \sqrt{\phi }}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\sqrt{5} \phi }{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.80902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\phi ^5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.9798&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{15,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;90.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{4\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{4\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 c_{4,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.41421&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.23607&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{16,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;95.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{29}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{11-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.4802&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(11-\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.19098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(11-\sqrt{5}\right)} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.48037&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{17,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;98.9{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{31}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7+\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{7+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.51954&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{7+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(7+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.30902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\psi  \phi ^5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.62605&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{18,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;104.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{8}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{15}{4}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.58114&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{5} \sqrt{\phi ^4}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.8541&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{19,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;108.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{9}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{10}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;c_{3,1}+c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(1+\sqrt{5}\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.61803&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1+\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.61803}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \phi ^3&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.9907&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{20,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;110.2{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{13-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.64042&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(13-\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.69098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\phi ^2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.07359&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{21,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;113.9{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{19}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.67601&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.80902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\frac{\chi }{\phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.20537&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{22,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;120{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{10}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{3\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{3\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.73205&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{6} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.41285&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{23,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;124.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{41}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{\phi }+\frac{5}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{2}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.7658&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4-\frac{\psi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4-\frac{\psi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.11803}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\chi  \phi ^5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.53779&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{24,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;130.9{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{20}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{11+\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.81907&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(11+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.30902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\frac{\sqrt{5}}{\phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.73503&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{25,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;135.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{11}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{11}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7+3 \sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7+3 \sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.85123&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\phi ^2}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\phi ^4}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.42705}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^4&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.8541&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{26,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;138.6{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{12}{5}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.87083&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{7} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.92667&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{27,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;144{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{12}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{5}{2}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(5+\sqrt{5}\right)} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(5+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.90211&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\phi +2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2+\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.61803}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{2 \phi +4}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.0425&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{28,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;154.8{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{13}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{13}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{13+\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.95167&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(13+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.80902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\frac{1}{\phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.22598&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{29,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;164.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{14}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{15}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi  c_{12,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{\frac{3}{2}} \left(1+\sqrt{5}\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.98168&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}} \phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3 \phi ^2}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.92705}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} \phi ^3&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.33708&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{30,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;180{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{15}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{2\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{2\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \sqrt{2} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.40492&lt;/math&gt;&lt;/small&gt;
|-
|rowspan=4 colspan=6|
|rowspan=4 colspan=4|
&lt;small&gt;&lt;math&gt;\phi&lt;/math&gt;&lt;/small&gt; is the golden ratio:&lt;br&gt;
&lt;small&gt;&lt;math&gt;\phi ^2-\phi -1=0&lt;/math&gt;&lt;/small&gt;&lt;br&gt;
&lt;small&gt;&lt;math&gt;\frac{1}{\phi }+1=\phi&lt;/math&gt;&lt;/small&gt;, and: &lt;small&gt;&lt;math&gt;\phi+1=\phi^2&lt;/math&gt;&lt;/small&gt;&lt;br&gt;
&lt;small&gt;&lt;math&gt;\frac{1}{\phi }::1::\phi ::\phi ^2&lt;/math&gt;&lt;/small&gt;&lt;br&gt;
&lt;small&gt;&lt;math&gt;1/\phi&lt;/math&gt;&lt;/small&gt; and &lt;small&gt;&lt;math&gt;\phi&lt;/math&gt;&lt;/small&gt; are the golden sections of &lt;small&gt;&lt;math&gt;\sqrt{5}&lt;/math&gt;&lt;/small&gt;:&lt;br&gt;
&lt;small&gt;&lt;math&gt;\phi +\frac{1}{\phi }=\sqrt{5}&lt;/math&gt;&lt;/small&gt;
|colspan=2|&lt;small&gt;&lt;math&gt;\phi = (\sqrt{5} + 1)/2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.618034&lt;/math&gt;&lt;/small&gt;
|-
|colspan=2|&lt;small&gt;&lt;math&gt;\chi = (3\sqrt{5} + 1)/2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.854102&lt;/math&gt;&lt;/small&gt;
|-
|colspan=2|&lt;small&gt;&lt;math&gt;\psi = (3\sqrt{5} - 1)/2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.854102&lt;/math&gt;&lt;/small&gt;
|-
|colspan=2|&lt;small&gt;&lt;math&gt;\psi = 11/\chi = 22/(3\sqrt{5} + 1)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.854102&lt;/math&gt;&lt;/small&gt;
|}

...

== The 8-point regular polytopes ==
In 2-space we have the regular 8-point octagon, in 3-space the regular 8-point cube, and in 4-space the regular 8-point [[16-cell]].

A planar octagon with rigid edges of unit length has chords of length:

:&lt;math&gt;r_1=1,r_2=\sqrt{2+\sqrt{2}} \approx 1.84776,r_3=1+\sqrt{2} \approx 2.41421,r_4=\sqrt{4 + \sqrt{8}} \approx 2.61313&lt;/math&gt;

The chord ratio &lt;math&gt;r_3=1+\sqrt{2}&lt;/math&gt; is a geometrical proportion, the [[W:Silver ratio|silver ratio]]. Fontaine and Hurley's procedure for obtaining the reciprocal of a chord tells us that:

:&lt;math&gt;r_3-r_1-r_1=1/r_3 \approx 0.41421&lt;/math&gt;

Note that &lt;math&gt;1/r_3=\sqrt{2}-1=r_3-2&lt;/math&gt;.

If we embed this planar octagon in 3-space, we can make it skew, repositioning its vertices so that each is one unit-edge length distant from three others instead of two others, at the vertices of a unit-edge cube with chords of length:

:&lt;math&gt;r_1=1, r_2=\sqrt{2}, r_3=\sqrt{3}, r_4=\sqrt{2}&lt;/math&gt;

If we embed this cube in 4-space, we can skew it some more, repositioning its vertices so that each is one unit-edge length distant from six others instead of three others, at the vertices of a unit-edge 4-polytope with chords of length:

:&lt;math&gt;r_1=1,r_2=1,r_3=1,r_4=\sqrt{2}&lt;/math&gt;

All of its chords except its long diameters are the same unit length as its edge. In fact they are its 24 edges, and it is a 16-cell of radius &lt;small&gt;&lt;math&gt;1/\sqrt{2}&lt;/math&gt;&lt;/small&gt;.

[[File:octagon16cell.png|thumb|Orthogonal projection of a regular 16-cell to the [[16-cell#Projections|B&lt;sub&gt;4&lt;/sub&gt; Coxeter plane]]. Only its edges are shown; its long diameter chords are not drawn. All 24 edges are the same length. Only the edges of the two disjoint squares lie parallel to the projection plane, in completely orthogonal central planes.]]

The [[16-cell]] is the [[W:Regular convex 4-polytope|regular convex 4-polytope]] with [[W:Schläfli symbol|Schläfli symbol]] {3,3,4}. It has 8 vertices, 24 edges, 32 equilateral triangle faces, and 16 regular tetrahedron cells. It is the [[16-cell#Octahedral dipyramid|four-dimensional analogue of the octahedron]], and each of its four orthogonal central hyperplanes is an octahedron.

The only planar regular polygons found in the 16-cell are face triangles and central plane squares, but the 16-cell also contains a regular skew octagon, its [[W:Petrie polygon|Petrie polygon]]. The chords of this regular octagon, which lies skew in 4-space, are those given above for the 16-cell, as opposed to those for the cube or the regular octagon in the plane. The 16-cell is a construct of 3 Petrie octagons which share the same 8 vertices but have disjoint sets of 8 edges each.

The regular octad has higher symmetry in 4-space than it does in 2-space. The 16-cell is the 4-orthoplex, the simplest regular 4-polytope after the [[5-cell|4-simplex]]. All the larger regular 4-polytopes, including the 120-cell, are compounds of the 16-cell. The regular octagon exhibits this high symmetry only when embedded in 4-space at the vertices of the 16-cell.

The 16-cell constitutes an [[W:Orthonormal basis|orthonormal basis]] for the choice of a 4-dimensional Cartesian reference frame, because its vertices define four orthogonal axes. The eight vertices of a unit-radius 16-cell are (±1, 0, 0, 0), (0, ±1, 0, 0), (0, 0, ±1, 0), (0, 0, 0, ±1). All vertices are connected by &lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt; edges except opposite pairs. 

The vertex coordinates of the 16-cell form 6 central squares lying in 6 pairwise [[W:Orthogonal|orthogonal]] coordinate planes. Great squares in ''opposite'' planes that do not share an axis (e.g. in the ''xy'' and ''wz'' planes) are completely disjoint (they do not intersect at any vertices). These planes are [[W:Completely orthogonal|completely orthogonal]].{{Efn|name=Six orthogonal planes of the Cartesian basis}}

Since this unit-radius coordinate system is convenient, let us derive the unit-radius 16-cell by skewing a unit-radius planar octagon, which has chords of length:

:&lt;math&gt;r_1=\sqrt{2-\sqrt{2}} \approx 0.76537,r_2=\sqrt{2},r_3=\sqrt{2+\sqrt{2}} \approx 1.84776,r_4=2&lt;/math&gt;

We will need a planar octagon with rigid &lt;math&gt;r_2&lt;/math&gt; chords, rather than one with rigid &lt;math&gt;r_1&lt;/math&gt; edges. The octagon's &lt;math&gt;r_2&lt;/math&gt; chords form two disjoint squares, which we can reposition in 3-space to form a cube by making them parallel, and in 4-space to form a 16-cell by making them completely orthogonal.

[[W:Rotations in 4-dimensional Euclidean space|Rotations in 4-dimensional Euclidean space]] can be seen as the composition of two 2-dimensional rotations in completely orthogonal planes. The general rotation in 4-space is a double rotation in pairs of completely orthogonal planes. Two completely orthogonal planes are called invariant planes of the rotation when all points in the plane rotate on circles that remain in the plane, even as the whole plane tilts sideways (like a coin flipping) into another plane. The two completely orthogonal rotations of each plane (like a wheel, and like a coin flipping) are simultaneous but independent, in that they are not geometrically constrained to turn at the same rate. However, the most circular kind of rotation (as opposed to an elliptical double rotation of a rigid spherical object) occurs when the invariant planes do rotate through the same angle in the same time interval. Such equi-angled double rotations are called [[w:SO(4)#Isoclinic_rotations|isoclinic]], also [[w:William_Kingdon_Clifford|Clifford]] displacements.

The 16-cell is the simplest possible frame in which to [[16-cell#Rotations|observe 4-dimensional rotations]] because its characteristic isoclinic rotations feature a single pair of invariant rotation planes. In the 16-cell an isoclinic rotation by 90° in any pair of invariant completely orthogonal square central planes takes every square central plane to its completely orthogonal square central plane in a twisting displacment, as they tilt sideways 90° into each other's plane while rotating 90° internally. All the vertices move at once on separate circular [[w:Geodesic|geodesics]], displaced 90° in 8 orthogonal directions, and the rigid 16-cell assumes a new orientation in 4-space. When the 90° isoclinic rotation is continued in the same rotational direction through an additional 90°, each vertex is again displaced 90°, but from the new orientation in a direction orthogonal to its first 90° displacement. After 360° of rotation each vertex reaches its antipodal position.

The trajectory of each vertex over each 90° isoclinic rotational displacement is a one-eighth segment of its geodesic orbit. Its entire orbit traces a circular helix in 4-space, and also traces a great circle twice in one of the two moving invariant rotation planes. In the course of a 720° isoclinic rotation each vertex departs from all 8 vertex positions just once and returns to its original position, and the 16-cell returns to its original orientation.

== Hypercubes ==
The long diameter of the unit-edge [[W:Hypercube|hypercube]] of dimension &lt;small&gt;&lt;math&gt;n&lt;/math&gt;&lt;/small&gt; is &lt;small&gt;&lt;math&gt;\sqrt{n}&lt;/math&gt;&lt;/small&gt;, so the unit-edge [[w:Tesseract|4-hypercube, the 16-point (8-cell) tesseract,]] has chords:
:&lt;math&gt;r_1=\sqrt{1},r_2=\sqrt{2},r_3=\sqrt{3},r_4=\sqrt{4}&lt;/math&gt;
Uniquely in its 4-dimensional case, the hypercube's edge length equals its radius, like the hexagon. We call such polytopes ''radially equilateral'', because they can be constructed from equilateral triangles which meet at their center, each contributing two radii and an edge. The cuboctahedron and the 24-cell are also radially equilateral.

The [[W:Tesseract|tesseract]] is the [[W:Regular convex 4-polytope|regular convex 4-polytope]] with [[W:Schläfli symbol|Schläfli symbol]] {4,3,3}. It has 16 vertices, 32 edges, 24 square faces, and 8 cube cells. It is the four-dimensional analogue of the cube.

The tesseract is the [[W:Dual polytope|dual polytope]] of the 16-cell. They have the same Petrie polygon, the regular octagon, but the tesseract contains 2 disjoint instances and 4 distinct instances of the skew octagon. We can construct the tesseract by skewing two planar octagons. Because the tesseract is radially equilateral (unlike the 16-cell), we start with our original octagon of unit-edge length, rather than the octagon of edge length &lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt; that we needed to build the unit-radius 16-cell.

For our tesseract construction we skew each planar octagon into a cube, so we have a compound of two completely orthogonal cubes. Provided the planes were completely orthogonal in 4-space and we skewed them both the same way, the 16 vertices will be the vertices of a tesseract with half of its 32 edges missing.

The 16-point tesseract is the convex hull of a compound of two 8-point 16-cells, in exact dimensional analogy to the way the 8-point cube is the convex hull of a [[W:Stellated octahedron|compound of two regular 4-point tetrahedra]]. The [[W:Demihypercube|demihypercubes]] occupy alternate vertices of the hypercubes. The diagonals of the square faces of the unit-radius tesseract are the &lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt; edges of two unit-radius 16-cells, which are also the edges of the square central planes.

Because the tesseract contains two 16-cells in alternate positions it has two sets of 6 orthogonal square central planes. Two angles are required to specify the relationship between two planes in 4-space. Pairs of planes within each 16-cell are 90° apart in one angle, and either 0° or 90° apart in the other angle. They are 90° apart in both angles if and only if they are completely orthogonal planes, 90° apart by isoclinic rotation, with no vertices in common and their corresponding vertices 180° apart. Otherwise they are 0° apart in one of the angles, 90° apart by simple rotation with their corresponding vertices 90° apart, and they intersect in one axis and lie in a common 3-dimensional hyperplane.{{Efn|A double rotation in which one of the two angles of rotation is 0°, so that one of the completely orthogonal invariant planes does not rotate, is called a simple rotation. Ordinary rotations observed in a 3-dimensional space are simple rotations.}}

A pair of square central planes from alternate 16-cells are 60° apart by isoclinic rotation, with their corresponding vertices 120° apart. The planes are not orthogonal or parallel, so they intersect in a line somewhere, but they have no vertices in common, they have no 3-dimensional hyperplane in common, and they cannot reach each other by simple rotation. Such pairs of objects are called [[W:Clifford parallel|Clifford parallel]] because all their corresponding pairs of vertices are the same distance apart, although they are not parallel in the usual sense, because they have a common center. Not only the alternate 16-cells' corresponding square central planes, but also the 16-cells themselves, are Clifford parallel objects.

We can rotate the tesseract isoclinically the way we rotated the 16-cell, by 90° in two completely orthogonal invariant square central planes, with the same effect on both alternate 16-cells. In the course of a 720° isoclinic rotation in invariant square central planes each vertex departs from all 8 vertex positions of its 16-cell just once and returns to its original position, but it does not visit the vertex positions of the other 16-cell. The skew octagon geodesic orbits of the 16 vertices are disjoint circular helixes, and those 16 circular helixes are Clifford parallel objects.

== The 24-cell ==
In 2-space we have the radially equilateral 6-point hexagon. In 3-space we have the radially equilateral 12-point cuboctahedron, with 4 hexagonal central planes. In 4-space we have the radially equilateral 24-point 24-cell, with 4 cuboctahedral central hyperplanes and 16 hexagonal central planes.

Great hexagons are a rounder choice than great squares for the invariant rotation planes in which to rotate a 4-polytope isoclinically. The complete hexagonal isoclinic revolution requires 720° like the square isoclinic revolution, but it is completed in 6 chordal steps of 120° each rather than 8 chordal steps of 90° each.

...

== The 600-cell ==

...

== Finally the 120-cell ==

...

== Conclusions ==

Fontaine and Hurley's discovery is more than a formula for the reciprocal of a regular ''n''-polygon diagonal. It also yields the discrete sequence of isocline chords of the distinct isoclinic rotation characteristic of a ''d''-dimensional regular polytope. The characteristic rotational chord sequence of the ''d''-polytope can be represented geometrically in two dimensions on a distinct star polygon, but it lies on a geodesic circle through ''d''-dimensional space. Fontaine and Hurley discovered the geodesic topology of polytopes generally. Their procedure will reveal the geodesics of arbitrary non-uniform polytopes, since it can be applied to a polytope of any dimensionality and irregularity, by first fitting the polytope to the smallest regular polygon whose chords include its chords.

Fontaine and Hurley's discovery of a chordal formula for isoclinic rotations closes the circuit on Kappraff and Adamson's discovery of a rotational connection between dynamical systems, Steinbach's golden fields, and Coxeter's Euclidean geometry of ''n'' dimensions. Application of the Fontaine and Hurley procedure in higher-dimensional spaces demonstrates why the connection exists: because polytope sequences generally, from Steinbach's golden polygon chord sequences, to chord sequences in isoclinic rotation helixes, to subsumption relations in the sequence of regular 4-polytopes, arise as expressions of the reflections and rotations of distinct Coxeter symmetry groups, when those various groups interact.

== Appendix: Sequence of regular 4-polytopes ==
{{Regular convex 4-polytopes|wiki=W:|columns=7}}

== Notes ==
{{Notelist}}

== Citations ==
{{Reflist}}

== References ==
{{Refbegin}}
* {{Cite journal | last=Steinbach | first=Peter | year=1997 | title=Golden fields: A case for the Heptagon | journal=Mathematics Magazine | volume=70 | issue=Feb 1997 | pages=22–31 | doi=10.1080/0025570X.1997.11996494 | jstor=2691048 | ref={{SfnRef|Steinbach|1997}} }}
* {{Cite journal | last=Steinbach | first=Peter | year=2000 | title=Sections Beyond Golden| journal=Bridges: Mathematical Connections in Art, Music and Science | issue=2000 | pages=35-44 | url=https://archive.bridgesmathart.org/2000/bridges2000-35.pdf | ref={{SfnRef|Steinbach|2000}}}}
* {{Cite journal | last1=Kappraff | first1=Jay | last2=Jablan | first2=Slavik | last3=Adamson | first3=Gary | last4=Sazdanovich | first4=Radmila | year=2004 | title=Golden Fields, Generalized Fibonacci Sequences, and Chaotic Matrices | journal=Forma | volume=19 | pages=367-387 | url=https://archive.bridgesmathart.org/2005/bridges2005-369.pdf | ref={{SfnRef|Kappraff, Jablan, Adamson &amp; Sazdanovich|2004}} }}
* {{Cite journal | last1=Kappraff | first1=Jay | last2=Adamson | first2=Gary | year=2004 | title=Polygons and Chaos | journal=Dynamical Systems and Geometric Theories | url=https://archive.bridgesmathart.org/2001/bridges2001-67.pdf | ref={{SfnRef|Kappraff &amp; Adamson|2004}} }}
* {{Cite journal | last1=Fontaine | first1=Anne | last2=Hurley | first2=Susan | year=2006 | title=Proof by Picture: Products and Reciprocals of Diagonal Length Ratios in the Regular Polygon | journal=Forum Geometricorum | volume=6 | pages=97-101 | url=https://scispace.com/pdf/proof-by-picture-products-and-reciprocals-of-diagonal-length-1aian8mgp9.pdf }}
{{Refend}}</text>
      <sha1>nzburl1xv17d1tn263vou1vmrky0gkv</sha1>
    </revision>
    <revision>
      <id>2809751</id>
      <parentid>2809748</parentid>
      <timestamp>2026-05-16T20:53:02Z</timestamp>
      <contributor>
        <username>Dc.samizdat</username>
        <id>2856930</id>
      </contributor>
      <comment>/* The 8-point regular polytopes */</comment>
      <origin>2809751</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="45777" sha1="0k093v3ijo1zdiwl9np4hpljkyi5uza" xml:space="preserve">{{align|center|David Brooks Christie}}
{{align|center|dc@samizdat.org}}
{{align|center|Draft in progress}}
{{align|center|January 2026 - April 2026}}

&lt;blockquote&gt;Steinbach discovered the formula for the ratios of diagonal to side in the regular polygons. Fontaine and Hurley extended this result, discovering a formula for the reciprocal of a regular polygon chord derived geometrically from the chord's star polygon. We observe that these findings in plane geometry apply more generally, to polytopes of any dimensionality. Fontaine and Hurley's geometric procedure for finding the reciprocals of the chords of a regular polygon from their star polygons also finds the rotational geodesics of any polytope of any dimensionality.&lt;/blockquote&gt;
== Introduction ==
Steinbach discovered the Diagonal Product Formula and the Golden Fields family of ratios of diagonal to side in the regular polygons. He showed how this family extends beyond the pentagon {5} with its well-known golden bisection proportional to 𝜙, finding that the heptagon {7} has an analogous trisection, the nonagon {9} has an analogous quadrasection, and the hendecagon {11} has an analogous pentasection, an extended family of golden proportions with quasiperiodic properties. 

Kappraff and Adamson extended these findings in plane geometry to a theory of Generalized Fibonacci Sequences, showing that the Golden Fields not only do not end with the hendecagon, they form an infinite number of periodic trajectories when operated on by the Mandelbrot operator. They found a relation between the edges of star polygons and dynamical systems in the state of chaos, revealing a connection between chaos theory, number, and rotations in Coxeter Euclidean geometry. 

Fontaine and Hurley examined Steinbach's finding that the length of each chord of a regular polygon is both the product of two chords and the sum of a set of smaller chords, so that in rotations to add is to multiply. They illustrated Steinbach's sets of additive chords lying parallel to each other in the plane (pointing in the same direction), and by applying Steinbach's formula more generally they found another summation relation of signed parallel chords (pointing in opposite directions) which relates each chord length to its reciprocal, and relates the summation to a distinct star polygon rotation. 

We examine these remarkable findings (which stem from study of the chords of humble regular polygons) in higher-dimensional spaces, specifically in the chords, polygons and rotations of the [[120-cell]], the largest four-dimensional regular convex polytope.

== Visualizing the 120-cell ==
{| class=&quot;wikitable floatright&quot; width=&quot;400&quot;
|style=&quot;vertical-align:top&quot;|[[File:120-cell.gif|200px]]&lt;br&gt;Orthographic projection of the 600-point 120-cell &lt;small&gt;&lt;math&gt;\{5,3,3\}&lt;/math&gt;&lt;/small&gt; performing a [[W:SO(4)#Geometry of 4D rotations|simple rotation]].{{Sfn|Hise|2011|loc=File:120-cell.gif|ps=; &quot;Created by Jason Hise with Maya and Macromedia Fireworks. A 3D projection of a 120-cell performing a [[W:SO(4)#Geometry of 4D rotations|simple rotation]].&quot;}} In this simplified rendering only the 120-cell's own edges are shown; its 29 interior chords are not rendered. Therefore even though it is translucent, only its outer surface is visible. The complex interior parts of the 120-cell, all its inscribed 5-cells, 16-cells, 8-cells, 24-cells, 600-cells and its much larger inventory of polyhedra, are completely invisible in this view, as none of their edges are rendered at all.
|style=&quot;vertical-align:top&quot;|[[File:Ortho solid 016-uniform polychoron p33-t0.png|200px]]&lt;br&gt;Orthographic projection of the 600-point [[W:Great grand stellated 120-cell|great grand stellated 120-cell]] &lt;small&gt;&lt;math&gt;\{\tfrac{5}{2},3,3\}&lt;/math&gt;&lt;/small&gt;.{{Sfn|Ruen: Great grand stellated 120-cell|2007}} The 120-cell is its convex hull. The projection to the left renders only the 120-cell's shortest chord, its 1200 edges. The projection above also renders only one of the 120-cell's 30 chords, the edges of its 120 inscribed regular 5-cells. The 120-cell itself (the convex hull) is invisible in this view, as its edges are not rendered.
|}

[[120-cell#Geometry|The 120-cell is the maximally complex regular 4-polytope]], containing inscribed instances of every regular 1-, 2-, 3-, and 4-polytope, except the regular polygons of more than {15} sides. 

The 120-cell is the convex hull of a regular [[120-cell#Relationships among interior polytopes|compound of each of the 6 regular convex 4-polytopes]]. They are the [[5-cell|5-point (5-cell) 4-simplex]], the [[16-cell|8-point (16-cell) 4-orthoplex]], the [[W:Tesseract|16-point (8-cell) tesseract]], the [[24-cell|24-point (24-cell)]], the [[600-cell|120-point (600-cell)]], and the [[120-cell|600-point (120-cell)]]. The 120-cell is the convex hull of a compound of 120 disjoint regular 5-cells, of 75 disjoint 16-cells, of 25 disjoint 24-cells, and of 5 disjoint 600-cells.

The 120-cell contains an even larger inventory of irregular polytopes, created by the intersection of multiple instances of these component regular 4-polytopes. Many are quite unexpected, because they do not occur as components of any regular polytope smaller than the 120-cell. As just one example among the [[120-cell#Concentric hulls|sections of the 120-cell]], there is an irregular 24-point polyhedron with 16 triangle faces and 4 nonagon {9} faces.{{Sfn|Moxness|}}

Most renderings of the 120-cell, like the rotating projection here, only illustrate its outer surface, which is a honeycomb of face-bonded dodecahedral cells. Only the objects in its 3-dimensional surface are rendered, namely the 120 dodecahedra, their pentagon faces, and their edges. Although the 120-cell has chords of 30 distinct lengths, in this kind of simplified rendering only the 120-cell's own edges (its shortest chord) are shown. Its 29 interior chords, the edges of objects in the interior of the 120-cell, are not rendered, so interior objects are not visible at all.

Visualizing the complete interior of the 600-vertex 120-cell in a single image is impractical because of its complexity. Only four 120-cell edges are incident at each vertex, but [[120-cell#Chords|600 chords (of all 30 lengths)]] are incident at ''each'' vertex.

== Compounds in the 120-cell ==
The 8-point (16-cell), not the 5-point (5-cell), is the smallest building block; it compounds to every larger regular 4-polytope. The 5-point (5-cell) does compound to the 600-point (120-cell), but it does not fit into any smaller regular 4-polytope. 

The 8-point (16-cell) compounds by 2 in the 16-point (8-cell), and by 3 in the 24-point (24-cell). The 16-point (8-cell) compounds in the 24-point (24-cell) by 3 non-disjoint instances of itself, with each of the 24 vertices shared by two 16-point (8-cells). The 24-point (24-cell) compounds by 5 disjoint instances of itself in the 120-point (600-cell), and the 120-point (600-cell) compounds by 5 disjoint instances of itself in the 600-point (120-cell).

The 24-point (24-cell) also compounds by &lt;math&gt;5^2&lt;/math&gt; non-disjoint instances of itself in the 120-point (600-cell); it compounds in 5 disjoint instances of itself, 10 (not 5) different ways. Whichever set of 5 disjoint 24-point (24-cells) are assembled, the resulting 120-point (600-cell) contains 25 distinct 24-point (24-cells), not just 5 (or 10). This implies that 15 disjoint 8-point (16-cells) will construct a 120-point (600-cell), which will contain 75 distinct 8-point (16-cells). 

The 600-point (120-cell) is 5 disjoint 120-point (600-cells), just 2 different ways (not 5 or 10 ways), so it is 10 distinct 120-point (600-cells). This implies that the 8-point (16-cell) compounds by 3 times &lt;math&gt;5^2&lt;/math&gt; (75) disjoint instances of itself in the 600-point (120-cell), which contains &lt;math&gt;3^2&lt;/math&gt; times  &lt;math&gt;5^2&lt;/math&gt; (225) distinct instances of the 24-point (24-cell), and  &lt;math&gt;3^3&lt;/math&gt; times &lt;math&gt;5^2&lt;/math&gt; (675) distinct instances of the 8-point (16-cell). 

These facts were discovered painstakingly by various researchers, and no one has found a general rule governing subsumption relations among regular polytopes. The reasons for some of their numeric incidence relations are far from obvious. [[W:Pieter Hendrik Schoute|Schoute]] was the first to see that the 120-point (600-cell) is a compound of 5 24-point (24-cells) ''10 different ways'', and after he saw it a hundred years lapsed until Denney, Hooker, Johnson, Robinson, Butler &amp; Claiborne proved his result, and showed why.{{Sfn|Denney, Hooker, Johnson, Robinson, Butler &amp; Claiborne|2020|loc=''The geometry of H4 polytopes''}}

So much for the compounds of 16-cells. The 120-cell is also the convex hull of the compound of 120 disjoint regular 5-cells. That stellated compound (without its convex hull of 120-cell edges) is the [[w:Great_grand_stellated_120-cell|great grand stellated 120-cell]] illustrated above, the final regular [[W:Stellation|stellation]] of the 120-cell, and the only [[W:Schläfli-Hess polychoron|regular star 4-polytope]] to have the 120-cell for its convex hull. The edges of the great grand stellated 120-cell are &lt;math&gt;\phi^6&lt;/math&gt; as long as those of its 120-cell [[W:List of polyhedral stellations#Stellation process|stellation core]] deep inside.

The compound of 120 disjoint 5-point (5-cells) can be seen to be equivalent to the compound of 5 disjoint 120-point (600-cells), as follows. Beginning with a single 120-point (600-cell), expand each vertex into a regular 5-cell, by adding 4 new equidistant vertices, such that the 5 vertices form a regular 5-cell inscribed in the 3-sphere. The 120 5-cells are disjoint, and the 600 vertices form 5 disjoint 120-point (600-cells): a 120-cell.

== Thirty distinguished distances ==
The 30 numbers listed in the table are all-important in Euclidean geometry. A case can be made on symmetry grounds that their squares are the 30 most important numbers between 0 and 4. The 30 rows of the table are the 30 distinct [[120-cell#Geodesic rectangles|chord lengths of the unit-radius 120-cell]], the largest regular convex 4-polytope. Since the 120-cell subsumes all smaller regular polytopes, its 30 chords are the complete chord set of all the regular polytopes that can be constructed in the first four dimensions of Euclidean space, except for regular polygons of more than 15 sides.

{| class=&quot;wikitable&quot; style=&quot;white-space:nowrap;text-align:center&quot;
!rowspan=2|&lt;math&gt;c_t&lt;/math&gt;
!rowspan=2|arc
!rowspan=2|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{n}\right\}&lt;/math&gt;&lt;/small&gt;
!rowspan=2|&lt;math&gt;\left\{p\right\}&lt;/math&gt;
!rowspan=2|&lt;small&gt;&lt;math&gt;m\left\{\frac{k}{d}\right\}&lt;/math&gt;&lt;/small&gt;
!rowspan=2|Steinbach roots
!colspan=7|Chord lengths of the unit 120-cell
|-
!colspan=5|unit-radius length &lt;math&gt;c_t&lt;/math&gt;
!colspan=2|unit-edge length &lt;math&gt;c_t/c_1&lt;/math&gt;&lt;br&gt;in 120-cell of radius &lt;math&gt;c_8=\sqrt{2}\phi^2&lt;/math&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{1,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;15.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{30\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{30\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;c_{4,1}-c_{2,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7-3 \sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.270091&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2} \phi ^2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2 \phi ^4}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.072949}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{2,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;25.2{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{2}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \left\{15\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(c_{18,1}-c_{4,1}\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{3-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.437016&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2} \phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2 \phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.190983}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.61803&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{3,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;36{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{10\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3 \left\{\frac{10}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(\sqrt{5}-1\right) c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(\sqrt{5}-1\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.618034&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{\phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.381966}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.28825&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{4,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;41.4{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{c_{8,1}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.707107&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.61803&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{5,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;44.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{4}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \left\{\frac{15}{2}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} c_{2,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{9-3 \sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.756934&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{\frac{3}{2}}}{\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2 \phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.572949}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} \phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.80252&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{6,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;49.1{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{17}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{5-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{5-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.831254&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt[4]{5} \sqrt{\frac{1}{\phi }}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\sqrt{5}}{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.690983}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\phi ^3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.07768&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{7,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;56.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{20}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{1}{\phi }} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{2}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.93913&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{\frac{\psi }{\phi }}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\psi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.881966}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\psi  \phi ^3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.47709&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;60{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{5}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{6\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{6\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.70246&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{9,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;66.1{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{40}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{1}{2 \phi }} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.09132&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{\frac{\chi }{\phi }}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\chi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.19098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\chi  \phi ^3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.04057&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{10,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;69.8{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{11}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi  c_{4,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1+\sqrt{5}}{2 \sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.14412&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\phi }{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\phi ^2}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.30902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^3&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.23607&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{11,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;72{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{6}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{5\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{5\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\frac{1}{\phi }} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\frac{2}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.17557&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3-\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3-\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.38197}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \sqrt{3-\phi } \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.3525&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{12,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;75.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{24}{5}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.22474&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.53457&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{13,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;81.1{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{13}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{9-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{9-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.30038&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{9-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(9-\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.69098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(9-\sqrt{5}\right)} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.8146&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{14,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;84.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{40}{9}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt[4]{5} \sqrt{\phi } c_{8,1}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt[4]{5} \sqrt{1+\sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.345&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt[4]{5} \sqrt{\phi }}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\sqrt{5} \phi }{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.80902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\phi ^5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.9798&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{15,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;90.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{4\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{4\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 c_{4,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.41421&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.23607&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{16,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;95.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{29}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{11-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.4802&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(11-\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.19098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(11-\sqrt{5}\right)} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.48037&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{17,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;98.9{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{31}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7+\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{7+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.51954&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{7+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(7+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.30902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\psi  \phi ^5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.62605&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{18,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;104.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{8}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{15}{4}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.58114&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{5} \sqrt{\phi ^4}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.8541&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{19,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;108.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{9}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{10}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;c_{3,1}+c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(1+\sqrt{5}\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.61803&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1+\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.61803}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \phi ^3&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.9907&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{20,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;110.2{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{13-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.64042&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(13-\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.69098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\phi ^2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.07359&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{21,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;113.9{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{19}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.67601&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.80902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\frac{\chi }{\phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.20537&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{22,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;120{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{10}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{3\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{3\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.73205&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{6} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.41285&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{23,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;124.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{41}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{\phi }+\frac{5}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{2}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.7658&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4-\frac{\psi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4-\frac{\psi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.11803}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\chi  \phi ^5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.53779&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{24,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;130.9{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{20}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{11+\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.81907&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(11+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.30902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\frac{\sqrt{5}}{\phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.73503&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{25,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;135.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{11}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{11}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7+3 \sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7+3 \sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.85123&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\phi ^2}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\phi ^4}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.42705}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^4&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.8541&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{26,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;138.6{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{12}{5}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.87083&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{7} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.92667&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{27,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;144{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{12}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{5}{2}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(5+\sqrt{5}\right)} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(5+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.90211&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\phi +2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2+\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.61803}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{2 \phi +4}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.0425&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{28,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;154.8{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{13}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{13}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{13+\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.95167&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(13+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.80902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\frac{1}{\phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.22598&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{29,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;164.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{14}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{15}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi  c_{12,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{\frac{3}{2}} \left(1+\sqrt{5}\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.98168&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}} \phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3 \phi ^2}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.92705}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} \phi ^3&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.33708&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{30,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;180{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{15}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{2\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{2\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \sqrt{2} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.40492&lt;/math&gt;&lt;/small&gt;
|-
|rowspan=4 colspan=6|
|rowspan=4 colspan=4|
&lt;small&gt;&lt;math&gt;\phi&lt;/math&gt;&lt;/small&gt; is the golden ratio:&lt;br&gt;
&lt;small&gt;&lt;math&gt;\phi ^2-\phi -1=0&lt;/math&gt;&lt;/small&gt;&lt;br&gt;
&lt;small&gt;&lt;math&gt;\frac{1}{\phi }+1=\phi&lt;/math&gt;&lt;/small&gt;, and: &lt;small&gt;&lt;math&gt;\phi+1=\phi^2&lt;/math&gt;&lt;/small&gt;&lt;br&gt;
&lt;small&gt;&lt;math&gt;\frac{1}{\phi }::1::\phi ::\phi ^2&lt;/math&gt;&lt;/small&gt;&lt;br&gt;
&lt;small&gt;&lt;math&gt;1/\phi&lt;/math&gt;&lt;/small&gt; and &lt;small&gt;&lt;math&gt;\phi&lt;/math&gt;&lt;/small&gt; are the golden sections of &lt;small&gt;&lt;math&gt;\sqrt{5}&lt;/math&gt;&lt;/small&gt;:&lt;br&gt;
&lt;small&gt;&lt;math&gt;\phi +\frac{1}{\phi }=\sqrt{5}&lt;/math&gt;&lt;/small&gt;
|colspan=2|&lt;small&gt;&lt;math&gt;\phi = (\sqrt{5} + 1)/2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.618034&lt;/math&gt;&lt;/small&gt;
|-
|colspan=2|&lt;small&gt;&lt;math&gt;\chi = (3\sqrt{5} + 1)/2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.854102&lt;/math&gt;&lt;/small&gt;
|-
|colspan=2|&lt;small&gt;&lt;math&gt;\psi = (3\sqrt{5} - 1)/2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.854102&lt;/math&gt;&lt;/small&gt;
|-
|colspan=2|&lt;small&gt;&lt;math&gt;\psi = 11/\chi = 22/(3\sqrt{5} + 1)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.854102&lt;/math&gt;&lt;/small&gt;
|}

...

== The 8-point regular polytopes ==
In 2-space we have the regular 8-point octagon, in 3-space the regular 8-point cube, and in 4-space the regular 8-point [[16-cell]].

A planar octagon with rigid edges of unit length has chords of length:

:&lt;math&gt;r_1=1,r_2=\sqrt{2+\sqrt{2}} \approx 1.84776,r_3=1+\sqrt{2} \approx 2.41421,r_4=\sqrt{4 + \sqrt{8}} \approx 2.61313&lt;/math&gt;

The chord ratio &lt;math&gt;r_3=1+\sqrt{2}&lt;/math&gt; is a geometrical proportion, the [[W:Silver ratio|silver ratio]]. Fontaine and Hurley's procedure for obtaining the reciprocal of a chord tells us that:

:&lt;math&gt;r_3-r_1-r_1=1/r_3 \approx 0.41421&lt;/math&gt;

Note that &lt;math&gt;1/r_3=\sqrt{2}-1=r_3-2&lt;/math&gt;.

If we embed this planar octagon in 3-space, we can make it skew, repositioning its vertices so that each is one unit-edge length distant from three others instead of two others, at the vertices of a unit-edge cube with chords of length:

:&lt;math&gt;r_1=1, r_2=\sqrt{2}, r_3=\sqrt{3}, r_4=\sqrt{2}&lt;/math&gt;

If we embed this cube in 4-space, we can skew it some more, repositioning its vertices so that each is one unit-edge length distant from six others instead of three others, at the vertices of a unit-edge 4-polytope with chords of length:

:&lt;math&gt;r_1=1,r_2=1,r_3=1,r_4=\sqrt{2}&lt;/math&gt;

All of its chords except its long diameters are the same unit length as its edge. In fact they are its 24 edges, and it is a 16-cell of radius &lt;small&gt;&lt;math&gt;1/\sqrt{2}&lt;/math&gt;&lt;/small&gt;.

[[File:octagon16cell.png|thumb|Orthogonal projection of a regular 16-cell to the [[16-cell#Projections|B&lt;sub&gt;4&lt;/sub&gt; Coxeter plane]]. Only its edges are shown; its long diameter chords are not drawn. All 24 edges are the same length. Only the edges of the two disjoint squares lie parallel to the projection plane, in completely orthogonal central planes.]]

The [[16-cell]] is the [[W:Regular convex 4-polytope|regular convex 4-polytope]] with [[W:Schläfli symbol|Schläfli symbol]] {3,3,4}. It has 8 vertices, 24 edges, 32 equilateral triangle faces, and 16 regular tetrahedron cells. It is the [[16-cell#Octahedral dipyramid|four-dimensional analogue of the octahedron]], and each of its four orthogonal central hyperplanes is an octahedron.

The only planar regular polygons found in the 16-cell are face triangles and central plane squares, but the 16-cell also contains a skew regular octagon, its [[W:Petrie polygon|Petrie polygon]]. The chords of this regular octagon, which lies skew in 4-space, are those given above for the 16-cell, as opposed to those for the cube or the regular octagon in the plane. The 16-cell is a construct of 3 Petrie octagons which share the same 8 vertices but have disjoint sets of 8 edges each.

The regular octad has higher symmetry in 4-space than it does in 2-space. The 16-cell is the 4-orthoplex, the simplest regular 4-polytope after the [[5-cell|4-simplex]]. All the larger regular 4-polytopes, including the 120-cell, are compounds of the 16-cell. The regular octagon exhibits this high symmetry only when embedded in 4-space at the vertices of the 16-cell.

The 16-cell constitutes an [[W:Orthonormal basis|orthonormal basis]] for the choice of a 4-dimensional Cartesian reference frame, because its vertices define four orthogonal axes. The eight vertices of a unit-radius 16-cell are (±1, 0, 0, 0), (0, ±1, 0, 0), (0, 0, ±1, 0), (0, 0, 0, ±1). All vertices are connected by &lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt; edges except opposite pairs. 

The vertex coordinates of the 16-cell form 6 central squares lying in 6 pairwise [[W:Orthogonal|orthogonal]] coordinate planes. Great squares in ''opposite'' planes that do not share an axis (e.g. in the ''xy'' and ''wz'' planes) are completely disjoint (they do not intersect at any vertices). These planes are [[W:Completely orthogonal|completely orthogonal]].{{Efn|name=Six orthogonal planes of the Cartesian basis}}

Since this unit-radius coordinate system is convenient, let us derive the unit-radius 16-cell by skewing a unit-radius planar octagon, which has chords of length:

:&lt;math&gt;r_1=\sqrt{2-\sqrt{2}} \approx 0.76537,r_2=\sqrt{2},r_3=\sqrt{2+\sqrt{2}} \approx 1.84776,r_4=2&lt;/math&gt;

We will need a planar octagon with rigid &lt;math&gt;r_2&lt;/math&gt; chords, rather than one with rigid &lt;math&gt;r_1&lt;/math&gt; edges. The octagon's &lt;math&gt;r_2&lt;/math&gt; chords form two disjoint squares, which we can reposition in 3-space to form a cube by making them parallel, and in 4-space to form a 16-cell by making them completely orthogonal.

[[W:Rotations in 4-dimensional Euclidean space|Rotations in 4-dimensional Euclidean space]] can be seen as the composition of two 2-dimensional rotations in completely orthogonal planes. The general rotation in 4-space is a double rotation in pairs of completely orthogonal planes. Two completely orthogonal planes are called invariant planes of the rotation when all points in the plane rotate on circles that remain in the plane, even as the whole plane tilts sideways (like a coin flipping) into another plane. The two completely orthogonal rotations of each plane (like a wheel, and like a coin flipping) are simultaneous but independent, in that they are not geometrically constrained to turn at the same rate. However, the most circular kind of rotation (as opposed to an elliptical double rotation of a rigid spherical object) occurs when the invariant planes do rotate through the same angle in the same time interval. Such equi-angled double rotations are called [[w:SO(4)#Isoclinic_rotations|isoclinic]], also [[w:William_Kingdon_Clifford|Clifford]] displacements.

The 16-cell is the simplest possible frame in which to [[16-cell#Rotations|observe 4-dimensional rotations]] because its characteristic isoclinic rotations feature a single pair of invariant rotation planes. In the 16-cell an isoclinic rotation by 90° in any pair of invariant completely orthogonal square central planes takes every square central plane to its completely orthogonal square central plane in a twisting displacment, as they tilt sideways 90° into each other's plane while rotating 90° internally. All the vertices move at once on separate circular [[w:Geodesic|geodesics]], displaced 90° in 8 orthogonal directions, and the rigid 16-cell assumes a new orientation in 4-space. When the 90° isoclinic rotation is continued in the same rotational direction through an additional 90°, each vertex is again displaced 90°, but from the new orientation in a direction orthogonal to its first 90° displacement. After 360° of rotation each vertex reaches its antipodal position.

The trajectory of each vertex over each 90° isoclinic rotational displacement is a one-eighth segment of its geodesic orbit. Its entire orbit traces a circular helix in 4-space, and also traces a great circle twice in one of the two moving invariant rotation planes. In the course of a 720° isoclinic rotation each vertex departs from all 8 vertex positions just once and returns to its original position, and the 16-cell returns to its original orientation.

== Hypercubes ==
The long diameter of the unit-edge [[W:Hypercube|hypercube]] of dimension &lt;small&gt;&lt;math&gt;n&lt;/math&gt;&lt;/small&gt; is &lt;small&gt;&lt;math&gt;\sqrt{n}&lt;/math&gt;&lt;/small&gt;, so the unit-edge [[w:Tesseract|4-hypercube, the 16-point (8-cell) tesseract,]] has chords:
:&lt;math&gt;r_1=\sqrt{1},r_2=\sqrt{2},r_3=\sqrt{3},r_4=\sqrt{4}&lt;/math&gt;
Uniquely in its 4-dimensional case, the hypercube's edge length equals its radius, like the hexagon. We call such polytopes ''radially equilateral'', because they can be constructed from equilateral triangles which meet at their center, each contributing two radii and an edge. The cuboctahedron and the 24-cell are also radially equilateral.

The [[W:Tesseract|tesseract]] is the [[W:Regular convex 4-polytope|regular convex 4-polytope]] with [[W:Schläfli symbol|Schläfli symbol]] {4,3,3}. It has 16 vertices, 32 edges, 24 square faces, and 8 cube cells. It is the four-dimensional analogue of the cube.

The tesseract is the [[W:Dual polytope|dual polytope]] of the 16-cell. They have the same Petrie polygon, the regular octagon, but the tesseract contains 2 disjoint instances and 4 distinct instances of the skew octagon. We can construct the tesseract by skewing two planar octagons. Because the tesseract is radially equilateral (unlike the 16-cell), we start with our original octagon of unit-edge length, rather than the octagon of edge length &lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt; that we needed to build the unit-radius 16-cell.

For our tesseract construction we skew each planar octagon into a cube, so we have a compound of two completely orthogonal cubes. Provided the planes were completely orthogonal in 4-space and we skewed them both the same way, the 16 vertices will be the vertices of a tesseract with half of its 32 edges missing.

The 16-point tesseract is the convex hull of a compound of two 8-point 16-cells, in exact dimensional analogy to the way the 8-point cube is the convex hull of a [[W:Stellated octahedron|compound of two regular 4-point tetrahedra]]. The [[W:Demihypercube|demihypercubes]] occupy alternate vertices of the hypercubes. The diagonals of the square faces of the unit-radius tesseract are the &lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt; edges of two unit-radius 16-cells, which are also the edges of the square central planes.

Because the tesseract contains two 16-cells in alternate positions it has two sets of 6 orthogonal square central planes. Two angles are required to specify the relationship between two planes in 4-space. Pairs of planes within each 16-cell are 90° apart in one angle, and either 0° or 90° apart in the other angle. They are 90° apart in both angles if and only if they are completely orthogonal planes, 90° apart by isoclinic rotation, with no vertices in common and their corresponding vertices 180° apart. Otherwise they are 0° apart in one of the angles, 90° apart by simple rotation with their corresponding vertices 90° apart, and they intersect in one axis and lie in a common 3-dimensional hyperplane.{{Efn|A double rotation in which one of the two angles of rotation is 0°, so that one of the completely orthogonal invariant planes does not rotate, is called a simple rotation. Ordinary rotations observed in a 3-dimensional space are simple rotations.}}

A pair of square central planes from alternate 16-cells are 60° apart by isoclinic rotation, with their corresponding vertices 120° apart. The planes are not orthogonal or parallel, so they intersect in a line somewhere, but they have no vertices in common, they have no 3-dimensional hyperplane in common, and they cannot reach each other by simple rotation. Such pairs of objects are called [[W:Clifford parallel|Clifford parallel]] because all their corresponding pairs of vertices are the same distance apart, although they are not parallel in the usual sense, because they have a common center. Not only the alternate 16-cells' corresponding square central planes, but also the 16-cells themselves, are Clifford parallel objects.

We can rotate the tesseract isoclinically the way we rotated the 16-cell, by 90° in two completely orthogonal invariant square central planes, with the same effect on both alternate 16-cells. In the course of a 720° isoclinic rotation in invariant square central planes each vertex departs from all 8 vertex positions of its 16-cell just once and returns to its original position, but it does not visit the vertex positions of the other 16-cell. The skew octagon geodesic orbits of the 16 vertices are disjoint circular helixes, and those 16 circular helixes are Clifford parallel objects.

== The 24-cell ==
In 2-space we have the radially equilateral 6-point hexagon. In 3-space we have the radially equilateral 12-point cuboctahedron, with 4 hexagonal central planes. In 4-space we have the radially equilateral 24-point 24-cell, with 4 cuboctahedral central hyperplanes and 16 hexagonal central planes.

Great hexagons are a rounder choice than great squares for the invariant rotation planes in which to rotate a 4-polytope isoclinically. The complete hexagonal isoclinic revolution requires 720° like the square isoclinic revolution, but it is completed in 6 chordal steps of 120° each rather than 8 chordal steps of 90° each.

...

== The 600-cell ==

...

== Finally the 120-cell ==

...

== Conclusions ==

Fontaine and Hurley's discovery is more than a formula for the reciprocal of a regular ''n''-polygon diagonal. It also yields the discrete sequence of isocline chords of the distinct isoclinic rotation characteristic of a ''d''-dimensional regular polytope. The characteristic rotational chord sequence of the ''d''-polytope can be represented geometrically in two dimensions on a distinct star polygon, but it lies on a geodesic circle through ''d''-dimensional space. Fontaine and Hurley discovered the geodesic topology of polytopes generally. Their procedure will reveal the geodesics of arbitrary non-uniform polytopes, since it can be applied to a polytope of any dimensionality and irregularity, by first fitting the polytope to the smallest regular polygon whose chords include its chords.

Fontaine and Hurley's discovery of a chordal formula for isoclinic rotations closes the circuit on Kappraff and Adamson's discovery of a rotational connection between dynamical systems, Steinbach's golden fields, and Coxeter's Euclidean geometry of ''n'' dimensions. Application of the Fontaine and Hurley procedure in higher-dimensional spaces demonstrates why the connection exists: because polytope sequences generally, from Steinbach's golden polygon chord sequences, to chord sequences in isoclinic rotation helixes, to subsumption relations in the sequence of regular 4-polytopes, arise as expressions of the reflections and rotations of distinct Coxeter symmetry groups, when those various groups interact.

== Appendix: Sequence of regular 4-polytopes ==
{{Regular convex 4-polytopes|wiki=W:|columns=7}}

== Notes ==
{{Notelist}}

== Citations ==
{{Reflist}}

== References ==
{{Refbegin}}
* {{Cite journal | last=Steinbach | first=Peter | year=1997 | title=Golden fields: A case for the Heptagon | journal=Mathematics Magazine | volume=70 | issue=Feb 1997 | pages=22–31 | doi=10.1080/0025570X.1997.11996494 | jstor=2691048 | ref={{SfnRef|Steinbach|1997}} }}
* {{Cite journal | last=Steinbach | first=Peter | year=2000 | title=Sections Beyond Golden| journal=Bridges: Mathematical Connections in Art, Music and Science | issue=2000 | pages=35-44 | url=https://archive.bridgesmathart.org/2000/bridges2000-35.pdf | ref={{SfnRef|Steinbach|2000}}}}
* {{Cite journal | last1=Kappraff | first1=Jay | last2=Jablan | first2=Slavik | last3=Adamson | first3=Gary | last4=Sazdanovich | first4=Radmila | year=2004 | title=Golden Fields, Generalized Fibonacci Sequences, and Chaotic Matrices | journal=Forma | volume=19 | pages=367-387 | url=https://archive.bridgesmathart.org/2005/bridges2005-369.pdf | ref={{SfnRef|Kappraff, Jablan, Adamson &amp; Sazdanovich|2004}} }}
* {{Cite journal | last1=Kappraff | first1=Jay | last2=Adamson | first2=Gary | year=2004 | title=Polygons and Chaos | journal=Dynamical Systems and Geometric Theories | url=https://archive.bridgesmathart.org/2001/bridges2001-67.pdf | ref={{SfnRef|Kappraff &amp; Adamson|2004}} }}
* {{Cite journal | last1=Fontaine | first1=Anne | last2=Hurley | first2=Susan | year=2006 | title=Proof by Picture: Products and Reciprocals of Diagonal Length Ratios in the Regular Polygon | journal=Forum Geometricorum | volume=6 | pages=97-101 | url=https://scispace.com/pdf/proof-by-picture-products-and-reciprocals-of-diagonal-length-1aian8mgp9.pdf }}
{{Refend}}</text>
      <sha1>0k093v3ijo1zdiwl9np4hpljkyi5uza</sha1>
    </revision>
    <revision>
      <id>2809763</id>
      <parentid>2809751</parentid>
      <timestamp>2026-05-16T22:10:34Z</timestamp>
      <contributor>
        <username>Dc.samizdat</username>
        <id>2856930</id>
      </contributor>
      <comment>/* The 8-point regular polytopes */</comment>
      <origin>2809763</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="46656" sha1="nxvhffpkwt0cu8xvnsfo6dv7pmxagkq" xml:space="preserve">{{align|center|David Brooks Christie}}
{{align|center|dc@samizdat.org}}
{{align|center|Draft in progress}}
{{align|center|January 2026 - April 2026}}

&lt;blockquote&gt;Steinbach discovered the formula for the ratios of diagonal to side in the regular polygons. Fontaine and Hurley extended this result, discovering a formula for the reciprocal of a regular polygon chord derived geometrically from the chord's star polygon. We observe that these findings in plane geometry apply more generally, to polytopes of any dimensionality. Fontaine and Hurley's geometric procedure for finding the reciprocals of the chords of a regular polygon from their star polygons also finds the rotational geodesics of any polytope of any dimensionality.&lt;/blockquote&gt;
== Introduction ==
Steinbach discovered the Diagonal Product Formula and the Golden Fields family of ratios of diagonal to side in the regular polygons. He showed how this family extends beyond the pentagon {5} with its well-known golden bisection proportional to 𝜙, finding that the heptagon {7} has an analogous trisection, the nonagon {9} has an analogous quadrasection, and the hendecagon {11} has an analogous pentasection, an extended family of golden proportions with quasiperiodic properties. 

Kappraff and Adamson extended these findings in plane geometry to a theory of Generalized Fibonacci Sequences, showing that the Golden Fields not only do not end with the hendecagon, they form an infinite number of periodic trajectories when operated on by the Mandelbrot operator. They found a relation between the edges of star polygons and dynamical systems in the state of chaos, revealing a connection between chaos theory, number, and rotations in Coxeter Euclidean geometry. 

Fontaine and Hurley examined Steinbach's finding that the length of each chord of a regular polygon is both the product of two chords and the sum of a set of smaller chords, so that in rotations to add is to multiply. They illustrated Steinbach's sets of additive chords lying parallel to each other in the plane (pointing in the same direction), and by applying Steinbach's formula more generally they found another summation relation of signed parallel chords (pointing in opposite directions) which relates each chord length to its reciprocal, and relates the summation to a distinct star polygon rotation. 

We examine these remarkable findings (which stem from study of the chords of humble regular polygons) in higher-dimensional spaces, specifically in the chords, polygons and rotations of the [[120-cell]], the largest four-dimensional regular convex polytope.

== Visualizing the 120-cell ==
{| class=&quot;wikitable floatright&quot; width=&quot;400&quot;
|style=&quot;vertical-align:top&quot;|[[File:120-cell.gif|200px]]&lt;br&gt;Orthographic projection of the 600-point 120-cell &lt;small&gt;&lt;math&gt;\{5,3,3\}&lt;/math&gt;&lt;/small&gt; performing a [[W:SO(4)#Geometry of 4D rotations|simple rotation]].{{Sfn|Hise|2011|loc=File:120-cell.gif|ps=; &quot;Created by Jason Hise with Maya and Macromedia Fireworks. A 3D projection of a 120-cell performing a [[W:SO(4)#Geometry of 4D rotations|simple rotation]].&quot;}} In this simplified rendering only the 120-cell's own edges are shown; its 29 interior chords are not rendered. Therefore even though it is translucent, only its outer surface is visible. The complex interior parts of the 120-cell, all its inscribed 5-cells, 16-cells, 8-cells, 24-cells, 600-cells and its much larger inventory of polyhedra, are completely invisible in this view, as none of their edges are rendered at all.
|style=&quot;vertical-align:top&quot;|[[File:Ortho solid 016-uniform polychoron p33-t0.png|200px]]&lt;br&gt;Orthographic projection of the 600-point [[W:Great grand stellated 120-cell|great grand stellated 120-cell]] &lt;small&gt;&lt;math&gt;\{\tfrac{5}{2},3,3\}&lt;/math&gt;&lt;/small&gt;.{{Sfn|Ruen: Great grand stellated 120-cell|2007}} The 120-cell is its convex hull. The projection to the left renders only the 120-cell's shortest chord, its 1200 edges. The projection above also renders only one of the 120-cell's 30 chords, the edges of its 120 inscribed regular 5-cells. The 120-cell itself (the convex hull) is invisible in this view, as its edges are not rendered.
|}

[[120-cell#Geometry|The 120-cell is the maximally complex regular 4-polytope]], containing inscribed instances of every regular 1-, 2-, 3-, and 4-polytope, except the regular polygons of more than {15} sides. 

The 120-cell is the convex hull of a regular [[120-cell#Relationships among interior polytopes|compound of each of the 6 regular convex 4-polytopes]]. They are the [[5-cell|5-point (5-cell) 4-simplex]], the [[16-cell|8-point (16-cell) 4-orthoplex]], the [[W:Tesseract|16-point (8-cell) tesseract]], the [[24-cell|24-point (24-cell)]], the [[600-cell|120-point (600-cell)]], and the [[120-cell|600-point (120-cell)]]. The 120-cell is the convex hull of a compound of 120 disjoint regular 5-cells, of 75 disjoint 16-cells, of 25 disjoint 24-cells, and of 5 disjoint 600-cells.

The 120-cell contains an even larger inventory of irregular polytopes, created by the intersection of multiple instances of these component regular 4-polytopes. Many are quite unexpected, because they do not occur as components of any regular polytope smaller than the 120-cell. As just one example among the [[120-cell#Concentric hulls|sections of the 120-cell]], there is an irregular 24-point polyhedron with 16 triangle faces and 4 nonagon {9} faces.{{Sfn|Moxness|}}

Most renderings of the 120-cell, like the rotating projection here, only illustrate its outer surface, which is a honeycomb of face-bonded dodecahedral cells. Only the objects in its 3-dimensional surface are rendered, namely the 120 dodecahedra, their pentagon faces, and their edges. Although the 120-cell has chords of 30 distinct lengths, in this kind of simplified rendering only the 120-cell's own edges (its shortest chord) are shown. Its 29 interior chords, the edges of objects in the interior of the 120-cell, are not rendered, so interior objects are not visible at all.

Visualizing the complete interior of the 600-vertex 120-cell in a single image is impractical because of its complexity. Only four 120-cell edges are incident at each vertex, but [[120-cell#Chords|600 chords (of all 30 lengths)]] are incident at ''each'' vertex.

== Compounds in the 120-cell ==
The 8-point (16-cell), not the 5-point (5-cell), is the smallest building block; it compounds to every larger regular 4-polytope. The 5-point (5-cell) does compound to the 600-point (120-cell), but it does not fit into any smaller regular 4-polytope. 

The 8-point (16-cell) compounds by 2 in the 16-point (8-cell), and by 3 in the 24-point (24-cell). The 16-point (8-cell) compounds in the 24-point (24-cell) by 3 non-disjoint instances of itself, with each of the 24 vertices shared by two 16-point (8-cells). The 24-point (24-cell) compounds by 5 disjoint instances of itself in the 120-point (600-cell), and the 120-point (600-cell) compounds by 5 disjoint instances of itself in the 600-point (120-cell).

The 24-point (24-cell) also compounds by &lt;math&gt;5^2&lt;/math&gt; non-disjoint instances of itself in the 120-point (600-cell); it compounds in 5 disjoint instances of itself, 10 (not 5) different ways. Whichever set of 5 disjoint 24-point (24-cells) are assembled, the resulting 120-point (600-cell) contains 25 distinct 24-point (24-cells), not just 5 (or 10). This implies that 15 disjoint 8-point (16-cells) will construct a 120-point (600-cell), which will contain 75 distinct 8-point (16-cells). 

The 600-point (120-cell) is 5 disjoint 120-point (600-cells), just 2 different ways (not 5 or 10 ways), so it is 10 distinct 120-point (600-cells). This implies that the 8-point (16-cell) compounds by 3 times &lt;math&gt;5^2&lt;/math&gt; (75) disjoint instances of itself in the 600-point (120-cell), which contains &lt;math&gt;3^2&lt;/math&gt; times  &lt;math&gt;5^2&lt;/math&gt; (225) distinct instances of the 24-point (24-cell), and  &lt;math&gt;3^3&lt;/math&gt; times &lt;math&gt;5^2&lt;/math&gt; (675) distinct instances of the 8-point (16-cell). 

These facts were discovered painstakingly by various researchers, and no one has found a general rule governing subsumption relations among regular polytopes. The reasons for some of their numeric incidence relations are far from obvious. [[W:Pieter Hendrik Schoute|Schoute]] was the first to see that the 120-point (600-cell) is a compound of 5 24-point (24-cells) ''10 different ways'', and after he saw it a hundred years lapsed until Denney, Hooker, Johnson, Robinson, Butler &amp; Claiborne proved his result, and showed why.{{Sfn|Denney, Hooker, Johnson, Robinson, Butler &amp; Claiborne|2020|loc=''The geometry of H4 polytopes''}}

So much for the compounds of 16-cells. The 120-cell is also the convex hull of the compound of 120 disjoint regular 5-cells. That stellated compound (without its convex hull of 120-cell edges) is the [[w:Great_grand_stellated_120-cell|great grand stellated 120-cell]] illustrated above, the final regular [[W:Stellation|stellation]] of the 120-cell, and the only [[W:Schläfli-Hess polychoron|regular star 4-polytope]] to have the 120-cell for its convex hull. The edges of the great grand stellated 120-cell are &lt;math&gt;\phi^6&lt;/math&gt; as long as those of its 120-cell [[W:List of polyhedral stellations#Stellation process|stellation core]] deep inside.

The compound of 120 disjoint 5-point (5-cells) can be seen to be equivalent to the compound of 5 disjoint 120-point (600-cells), as follows. Beginning with a single 120-point (600-cell), expand each vertex into a regular 5-cell, by adding 4 new equidistant vertices, such that the 5 vertices form a regular 5-cell inscribed in the 3-sphere. The 120 5-cells are disjoint, and the 600 vertices form 5 disjoint 120-point (600-cells): a 120-cell.

== Thirty distinguished distances ==
The 30 numbers listed in the table are all-important in Euclidean geometry. A case can be made on symmetry grounds that their squares are the 30 most important numbers between 0 and 4. The 30 rows of the table are the 30 distinct [[120-cell#Geodesic rectangles|chord lengths of the unit-radius 120-cell]], the largest regular convex 4-polytope. Since the 120-cell subsumes all smaller regular polytopes, its 30 chords are the complete chord set of all the regular polytopes that can be constructed in the first four dimensions of Euclidean space, except for regular polygons of more than 15 sides.

{| class=&quot;wikitable&quot; style=&quot;white-space:nowrap;text-align:center&quot;
!rowspan=2|&lt;math&gt;c_t&lt;/math&gt;
!rowspan=2|arc
!rowspan=2|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{n}\right\}&lt;/math&gt;&lt;/small&gt;
!rowspan=2|&lt;math&gt;\left\{p\right\}&lt;/math&gt;
!rowspan=2|&lt;small&gt;&lt;math&gt;m\left\{\frac{k}{d}\right\}&lt;/math&gt;&lt;/small&gt;
!rowspan=2|Steinbach roots
!colspan=7|Chord lengths of the unit 120-cell
|-
!colspan=5|unit-radius length &lt;math&gt;c_t&lt;/math&gt;
!colspan=2|unit-edge length &lt;math&gt;c_t/c_1&lt;/math&gt;&lt;br&gt;in 120-cell of radius &lt;math&gt;c_8=\sqrt{2}\phi^2&lt;/math&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{1,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;15.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{30\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{30\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;c_{4,1}-c_{2,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7-3 \sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.270091&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2} \phi ^2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2 \phi ^4}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.072949}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{2,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;25.2{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{2}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \left\{15\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(c_{18,1}-c_{4,1}\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{3-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.437016&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2} \phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2 \phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.190983}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.61803&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{3,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;36{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{10\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3 \left\{\frac{10}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(\sqrt{5}-1\right) c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(\sqrt{5}-1\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.618034&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{\phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.381966}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.28825&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{4,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;41.4{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{c_{8,1}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.707107&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.61803&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{5,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;44.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{4}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \left\{\frac{15}{2}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} c_{2,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{9-3 \sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.756934&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{\frac{3}{2}}}{\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2 \phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.572949}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} \phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.80252&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{6,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;49.1{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{17}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{5-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{5-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.831254&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt[4]{5} \sqrt{\frac{1}{\phi }}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\sqrt{5}}{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.690983}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\phi ^3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.07768&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{7,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;56.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{20}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{1}{\phi }} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{2}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.93913&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{\frac{\psi }{\phi }}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\psi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.881966}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\psi  \phi ^3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.47709&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;60{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{5}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{6\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{6\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.70246&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{9,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;66.1{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{40}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{1}{2 \phi }} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.09132&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{\frac{\chi }{\phi }}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\chi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.19098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\chi  \phi ^3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.04057&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{10,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;69.8{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{11}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi  c_{4,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1+\sqrt{5}}{2 \sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.14412&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\phi }{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\phi ^2}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.30902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^3&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.23607&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{11,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;72{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{6}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{5\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{5\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\frac{1}{\phi }} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\frac{2}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.17557&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3-\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3-\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.38197}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \sqrt{3-\phi } \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.3525&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{12,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;75.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{24}{5}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.22474&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.53457&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{13,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;81.1{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{13}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{9-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{9-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.30038&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{9-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(9-\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.69098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(9-\sqrt{5}\right)} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.8146&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{14,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;84.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{40}{9}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt[4]{5} \sqrt{\phi } c_{8,1}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt[4]{5} \sqrt{1+\sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.345&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt[4]{5} \sqrt{\phi }}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\sqrt{5} \phi }{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.80902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\phi ^5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.9798&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{15,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;90.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{4\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{4\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 c_{4,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.41421&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.23607&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{16,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;95.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{29}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{11-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.4802&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(11-\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.19098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(11-\sqrt{5}\right)} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.48037&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{17,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;98.9{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{31}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7+\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{7+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.51954&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{7+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(7+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.30902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\psi  \phi ^5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.62605&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{18,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;104.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{8}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{15}{4}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.58114&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{5} \sqrt{\phi ^4}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.8541&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{19,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;108.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{9}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{10}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;c_{3,1}+c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(1+\sqrt{5}\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.61803&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1+\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.61803}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \phi ^3&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.9907&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{20,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;110.2{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{13-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.64042&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(13-\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.69098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\phi ^2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.07359&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{21,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;113.9{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{19}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.67601&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.80902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\frac{\chi }{\phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.20537&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{22,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;120{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{10}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{3\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{3\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.73205&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{6} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.41285&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{23,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;124.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{41}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{\phi }+\frac{5}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{2}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.7658&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4-\frac{\psi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4-\frac{\psi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.11803}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\chi  \phi ^5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.53779&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{24,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;130.9{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{20}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{11+\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.81907&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(11+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.30902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\frac{\sqrt{5}}{\phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.73503&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{25,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;135.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{11}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{11}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7+3 \sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7+3 \sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.85123&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\phi ^2}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\phi ^4}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.42705}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^4&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.8541&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{26,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;138.6{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{12}{5}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.87083&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{7} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.92667&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{27,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;144{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{12}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{5}{2}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(5+\sqrt{5}\right)} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(5+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.90211&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\phi +2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2+\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.61803}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{2 \phi +4}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.0425&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{28,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;154.8{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{13}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{13}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{13+\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.95167&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(13+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.80902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\frac{1}{\phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.22598&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{29,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;164.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{14}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{15}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi  c_{12,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{\frac{3}{2}} \left(1+\sqrt{5}\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.98168&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}} \phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3 \phi ^2}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.92705}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} \phi ^3&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.33708&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{30,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;180{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{15}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{2\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{2\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \sqrt{2} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.40492&lt;/math&gt;&lt;/small&gt;
|-
|rowspan=4 colspan=6|
|rowspan=4 colspan=4|
&lt;small&gt;&lt;math&gt;\phi&lt;/math&gt;&lt;/small&gt; is the golden ratio:&lt;br&gt;
&lt;small&gt;&lt;math&gt;\phi ^2-\phi -1=0&lt;/math&gt;&lt;/small&gt;&lt;br&gt;
&lt;small&gt;&lt;math&gt;\frac{1}{\phi }+1=\phi&lt;/math&gt;&lt;/small&gt;, and: &lt;small&gt;&lt;math&gt;\phi+1=\phi^2&lt;/math&gt;&lt;/small&gt;&lt;br&gt;
&lt;small&gt;&lt;math&gt;\frac{1}{\phi }::1::\phi ::\phi ^2&lt;/math&gt;&lt;/small&gt;&lt;br&gt;
&lt;small&gt;&lt;math&gt;1/\phi&lt;/math&gt;&lt;/small&gt; and &lt;small&gt;&lt;math&gt;\phi&lt;/math&gt;&lt;/small&gt; are the golden sections of &lt;small&gt;&lt;math&gt;\sqrt{5}&lt;/math&gt;&lt;/small&gt;:&lt;br&gt;
&lt;small&gt;&lt;math&gt;\phi +\frac{1}{\phi }=\sqrt{5}&lt;/math&gt;&lt;/small&gt;
|colspan=2|&lt;small&gt;&lt;math&gt;\phi = (\sqrt{5} + 1)/2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.618034&lt;/math&gt;&lt;/small&gt;
|-
|colspan=2|&lt;small&gt;&lt;math&gt;\chi = (3\sqrt{5} + 1)/2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.854102&lt;/math&gt;&lt;/small&gt;
|-
|colspan=2|&lt;small&gt;&lt;math&gt;\psi = (3\sqrt{5} - 1)/2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.854102&lt;/math&gt;&lt;/small&gt;
|-
|colspan=2|&lt;small&gt;&lt;math&gt;\psi = 11/\chi = 22/(3\sqrt{5} + 1)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.854102&lt;/math&gt;&lt;/small&gt;
|}

...

== The 8-point regular polytopes ==
In 2-space we have the regular 8-point octagon, in 3-space the regular 8-point cube, and in 4-space the regular 8-point [[16-cell]].

A planar octagon with rigid edges of unit length has chords of length:

:&lt;math&gt;r_1=1,r_2=\sqrt{2+\sqrt{2}} \approx 1.84776,r_3=1+\sqrt{2} \approx 2.41421,r_4=\sqrt{4 + \sqrt{8}} \approx 2.61313&lt;/math&gt;

The chord ratio &lt;math&gt;r_3=1+\sqrt{2}&lt;/math&gt; is a geometrical proportion, the [[W:Silver ratio|silver ratio]]. Fontaine and Hurley's procedure for obtaining the reciprocal of a chord tells us that:

:&lt;math&gt;r_3-r_1-r_1=1/r_3 \approx 0.41421&lt;/math&gt;

Note that &lt;math&gt;1/r_3=\sqrt{2}-1=r_3-2&lt;/math&gt;.

If we embed this planar octagon in 3-space, we can make it skew, repositioning its vertices so that each is one unit-edge length distant from three others instead of two others, at the vertices of a unit-edge cube with chords of length:

:&lt;math&gt;r_1=1, r_2=\sqrt{2}, r_3=\sqrt{3}, r_4=\sqrt{2}&lt;/math&gt;

If we embed this cube in 4-space, we can skew it some more, repositioning its vertices so that each is one unit-edge length distant from six others instead of three others, at the vertices of a unit-edge 4-polytope with chords of length:

:&lt;math&gt;r_1=1,r_2=1,r_3=1,r_4=\sqrt{2}&lt;/math&gt;

All of its chords except its long diameters are the same unit length as its edge. In fact they are its 24 edges, and it is a 16-cell of radius &lt;small&gt;&lt;math&gt;1/\sqrt{2}&lt;/math&gt;&lt;/small&gt;.

[[File:octagon16cell.png|thumb|Orthogonal projection of a regular 16-cell to the [[16-cell#Projections|B&lt;sub&gt;4&lt;/sub&gt; Coxeter plane]]. Only its edges are shown; its long diameter chords are not drawn. All 24 edges are the same length. Only the edges of the two disjoint squares lie parallel to the projection plane, in completely orthogonal central planes.]]

The [[16-cell]] is the [[W:Regular convex 4-polytope|regular convex 4-polytope]] with [[W:Schläfli symbol|Schläfli symbol]] {3,3,4}. It has 8 vertices, 24 edges, 32 equilateral triangle faces, and 16 regular tetrahedron cells. It is the [[16-cell#Octahedral dipyramid|four-dimensional analogue of the octahedron]], and each of its four orthogonal central hyperplanes is an octahedron.

The only planar regular polygons found in the 16-cell are face triangles and central plane squares, but the 16-cell also contains a skew regular octagon, its [[W:Petrie polygon|Petrie polygon]]. The chords of this regular octagon, which lies skew in 4-space, are those given above for the 16-cell, as opposed to those for the cube or the regular octagon in the plane. The 16-cell is a construct of 3 Petrie octagons which share the same 8 vertices but have disjoint sets of 8 edges each.

The regular octad has higher symmetry in 4-space than it does in 2-space. The 16-cell is the 4-orthoplex, the simplest regular 4-polytope after the [[5-cell|4-simplex]]. All the larger regular 4-polytopes, including the 120-cell, are compounds of the 16-cell. The regular octagon exhibits this high symmetry only when embedded in 4-space at the vertices of the 16-cell.

The 16-cell constitutes an [[W:Orthonormal basis|orthonormal basis]] for the choice of a 4-dimensional Cartesian reference frame, because its vertices define four orthogonal axes. The eight vertices of a unit-radius 16-cell are (±1, 0, 0, 0), (0, ±1, 0, 0), (0, 0, ±1, 0), (0, 0, 0, ±1). All vertices are connected by &lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt; edges except opposite pairs. 

The vertex coordinates of the 16-cell form 6 central squares lying in 6 pairwise [[W:Orthogonal|orthogonal]] coordinate planes. Great squares in ''opposite'' planes that do not share an axis (e.g. in the ''xy'' and ''wz'' planes) are completely disjoint (they do not intersect at any vertices). These planes are [[W:Completely orthogonal|completely orthogonal]].{{Efn|name=Six orthogonal planes of the Cartesian basis}}

Since this unit-radius coordinate system is convenient, let us derive the unit-radius 16-cell by skewing a unit-radius planar octagon, which has chords of length:

:&lt;math&gt;r_1=\sqrt{2-\sqrt{2}} \approx 0.76537,r_2=\sqrt{2},r_3=\sqrt{2+\sqrt{2}} \approx 1.84776,r_4=2&lt;/math&gt;

We will need a planar octagon with rigid &lt;math&gt;r_2&lt;/math&gt; chords, rather than one with rigid &lt;math&gt;r_1&lt;/math&gt; edges. The octagon's &lt;math&gt;r_2&lt;/math&gt; chords form two disjoint squares, which we can reposition in 3-space to form a cube by making them parallel, and in 4-space to form a 16-cell by making them completely orthogonal.

The &lt;math&gt;r_2&lt;/math&gt; chords form two disjoint great squares, visible in the orthogonal projection. These central squares are completely orthogonal: both parallel and perpendicular to each other. A ''simple'' rotation of the 16-cell in ''one'' of these two central planes rotates that square like a wheel, while the other square does not move. The four vertices of the rotating square orbit on a great circle.

The &lt;math&gt;r_1&lt;/math&gt; chords form a Petrie polygon which zig-zags back and forth between the two completely orthogonal &lt;math&gt;r_2&lt;/math&gt; squares.

The &lt;math&gt;r_3&lt;/math&gt; chords form a circular helix, visible as a skew {8/3} polygram in the orthogonal projection. A ''double'' rotation of the 16-cell, in ''both'' of the two completely orthogonal &lt;math&gt;r_2&lt;/math&gt; central square planes at once, moves the vertices along the circular helix over the &lt;math&gt;r_3&lt;/math&gt; chords.

[[W:Rotations in 4-dimensional Euclidean space|Rotations in 4-dimensional Euclidean space]] can be seen as the composition of two 2-dimensional rotations in completely orthogonal planes. The general rotation in 4-space is a double rotation in pairs of completely orthogonal planes. Two completely orthogonal planes are called invariant planes of the rotation when all points in the plane rotate on circles that remain in the plane, even as the whole plane tilts sideways (like a coin flipping) into another plane. The two completely orthogonal rotations of each plane (like a wheel, and like a coin flipping) are simultaneous but independent, in that they are not geometrically constrained to turn at the same rate. However, the most circular kind of rotation (as opposed to an elliptical double rotation of a rigid spherical object) occurs when the invariant planes do rotate through the same angle in the same time interval. Such equi-angled double rotations are called [[w:SO(4)#Isoclinic_rotations|isoclinic]], also [[w:William_Kingdon_Clifford|Clifford]] displacements.

The 16-cell is the simplest possible frame in which to [[16-cell#Rotations|observe 4-dimensional rotations]] because its characteristic isoclinic rotations feature a single pair of invariant rotation planes. In the 16-cell an isoclinic rotation by 90° in any pair of invariant completely orthogonal square central planes takes every square central plane to its completely orthogonal square central plane in a twisting displacment, as they tilt sideways 90° into each other's plane while rotating 90° internally. All the vertices move at once on separate circular [[w:Geodesic|geodesics]], displaced 90° in 8 orthogonal directions, and the rigid 16-cell assumes a new orientation in 4-space. When the 90° isoclinic rotation is continued in the same rotational direction through an additional 90°, each vertex is again displaced 90°, but from the new orientation in a direction orthogonal to its first 90° displacement. After 360° of rotation each vertex reaches its antipodal position.

The trajectory of each vertex over each 90° isoclinic rotational displacement is a one-eighth segment of its geodesic orbit. Its entire orbit traces a circular helix in 4-space, and also traces a great circle twice in one of the two moving invariant rotation planes. In the course of a 720° isoclinic rotation each vertex departs from all 8 vertex positions just once and returns to its original position, and the 16-cell returns to its original orientation.

== Hypercubes ==
The long diameter of the unit-edge [[W:Hypercube|hypercube]] of dimension &lt;small&gt;&lt;math&gt;n&lt;/math&gt;&lt;/small&gt; is &lt;small&gt;&lt;math&gt;\sqrt{n}&lt;/math&gt;&lt;/small&gt;, so the unit-edge [[w:Tesseract|4-hypercube, the 16-point (8-cell) tesseract,]] has chords:
:&lt;math&gt;r_1=\sqrt{1},r_2=\sqrt{2},r_3=\sqrt{3},r_4=\sqrt{4}&lt;/math&gt;
Uniquely in its 4-dimensional case, the hypercube's edge length equals its radius, like the hexagon. We call such polytopes ''radially equilateral'', because they can be constructed from equilateral triangles which meet at their center, each contributing two radii and an edge. The cuboctahedron and the 24-cell are also radially equilateral.

The [[W:Tesseract|tesseract]] is the [[W:Regular convex 4-polytope|regular convex 4-polytope]] with [[W:Schläfli symbol|Schläfli symbol]] {4,3,3}. It has 16 vertices, 32 edges, 24 square faces, and 8 cube cells. It is the four-dimensional analogue of the cube.

The tesseract is the [[W:Dual polytope|dual polytope]] of the 16-cell. They have the same Petrie polygon, the regular octagon, but the tesseract contains 2 disjoint instances and 4 distinct instances of the skew octagon. We can construct the tesseract by skewing two planar octagons. Because the tesseract is radially equilateral (unlike the 16-cell), we start with our original octagon of unit-edge length, rather than the octagon of edge length &lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt; that we needed to build the unit-radius 16-cell.

For our tesseract construction we skew each planar octagon into a cube, so we have a compound of two completely orthogonal cubes. Provided the planes were completely orthogonal in 4-space and we skewed them both the same way, the 16 vertices will be the vertices of a tesseract with half of its 32 edges missing.

The 16-point tesseract is the convex hull of a compound of two 8-point 16-cells, in exact dimensional analogy to the way the 8-point cube is the convex hull of a [[W:Stellated octahedron|compound of two regular 4-point tetrahedra]]. The [[W:Demihypercube|demihypercubes]] occupy alternate vertices of the hypercubes. The diagonals of the square faces of the unit-radius tesseract are the &lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt; edges of two unit-radius 16-cells, which are also the edges of the square central planes.

Because the tesseract contains two 16-cells in alternate positions it has two sets of 6 orthogonal square central planes. Two angles are required to specify the relationship between two planes in 4-space. Pairs of planes within each 16-cell are 90° apart in one angle, and either 0° or 90° apart in the other angle. They are 90° apart in both angles if and only if they are completely orthogonal planes, 90° apart by isoclinic rotation, with no vertices in common and their corresponding vertices 180° apart. Otherwise they are 0° apart in one of the angles, 90° apart by simple rotation with their corresponding vertices 90° apart, and they intersect in one axis and lie in a common 3-dimensional hyperplane.{{Efn|A double rotation in which one of the two angles of rotation is 0°, so that one of the completely orthogonal invariant planes does not rotate, is called a simple rotation. Ordinary rotations observed in a 3-dimensional space are simple rotations.}}

A pair of square central planes from alternate 16-cells are 60° apart by isoclinic rotation, with their corresponding vertices 120° apart. The planes are not orthogonal or parallel, so they intersect in a line somewhere, but they have no vertices in common, they have no 3-dimensional hyperplane in common, and they cannot reach each other by simple rotation. Such pairs of objects are called [[W:Clifford parallel|Clifford parallel]] because all their corresponding pairs of vertices are the same distance apart, although they are not parallel in the usual sense, because they have a common center. Not only the alternate 16-cells' corresponding square central planes, but also the 16-cells themselves, are Clifford parallel objects.

We can rotate the tesseract isoclinically the way we rotated the 16-cell, by 90° in two completely orthogonal invariant square central planes, with the same effect on both alternate 16-cells. In the course of a 720° isoclinic rotation in invariant square central planes each vertex departs from all 8 vertex positions of its 16-cell just once and returns to its original position, but it does not visit the vertex positions of the other 16-cell. The skew octagon geodesic orbits of the 16 vertices are disjoint circular helixes, and those 16 circular helixes are Clifford parallel objects.

== The 24-cell ==
In 2-space we have the radially equilateral 6-point hexagon. In 3-space we have the radially equilateral 12-point cuboctahedron, with 4 hexagonal central planes. In 4-space we have the radially equilateral 24-point 24-cell, with 4 cuboctahedral central hyperplanes and 16 hexagonal central planes.

Great hexagons are a rounder choice than great squares for the invariant rotation planes in which to rotate a 4-polytope isoclinically. The complete hexagonal isoclinic revolution requires 720° like the square isoclinic revolution, but it is completed in 6 chordal steps of 120° each rather than 8 chordal steps of 90° each.

...

== The 600-cell ==

...

== Finally the 120-cell ==

...

== Conclusions ==

Fontaine and Hurley's discovery is more than a formula for the reciprocal of a regular ''n''-polygon diagonal. It also yields the discrete sequence of isocline chords of the distinct isoclinic rotation characteristic of a ''d''-dimensional regular polytope. The characteristic rotational chord sequence of the ''d''-polytope can be represented geometrically in two dimensions on a distinct star polygon, but it lies on a geodesic circle through ''d''-dimensional space. Fontaine and Hurley discovered the geodesic topology of polytopes generally. Their procedure will reveal the geodesics of arbitrary non-uniform polytopes, since it can be applied to a polytope of any dimensionality and irregularity, by first fitting the polytope to the smallest regular polygon whose chords include its chords.

Fontaine and Hurley's discovery of a chordal formula for isoclinic rotations closes the circuit on Kappraff and Adamson's discovery of a rotational connection between dynamical systems, Steinbach's golden fields, and Coxeter's Euclidean geometry of ''n'' dimensions. Application of the Fontaine and Hurley procedure in higher-dimensional spaces demonstrates why the connection exists: because polytope sequences generally, from Steinbach's golden polygon chord sequences, to chord sequences in isoclinic rotation helixes, to subsumption relations in the sequence of regular 4-polytopes, arise as expressions of the reflections and rotations of distinct Coxeter symmetry groups, when those various groups interact.

== Appendix: Sequence of regular 4-polytopes ==
{{Regular convex 4-polytopes|wiki=W:|columns=7}}

== Notes ==
{{Notelist}}

== Citations ==
{{Reflist}}

== References ==
{{Refbegin}}
* {{Cite journal | last=Steinbach | first=Peter | year=1997 | title=Golden fields: A case for the Heptagon | journal=Mathematics Magazine | volume=70 | issue=Feb 1997 | pages=22–31 | doi=10.1080/0025570X.1997.11996494 | jstor=2691048 | ref={{SfnRef|Steinbach|1997}} }}
* {{Cite journal | last=Steinbach | first=Peter | year=2000 | title=Sections Beyond Golden| journal=Bridges: Mathematical Connections in Art, Music and Science | issue=2000 | pages=35-44 | url=https://archive.bridgesmathart.org/2000/bridges2000-35.pdf | ref={{SfnRef|Steinbach|2000}}}}
* {{Cite journal | last1=Kappraff | first1=Jay | last2=Jablan | first2=Slavik | last3=Adamson | first3=Gary | last4=Sazdanovich | first4=Radmila | year=2004 | title=Golden Fields, Generalized Fibonacci Sequences, and Chaotic Matrices | journal=Forma | volume=19 | pages=367-387 | url=https://archive.bridgesmathart.org/2005/bridges2005-369.pdf | ref={{SfnRef|Kappraff, Jablan, Adamson &amp; Sazdanovich|2004}} }}
* {{Cite journal | last1=Kappraff | first1=Jay | last2=Adamson | first2=Gary | year=2004 | title=Polygons and Chaos | journal=Dynamical Systems and Geometric Theories | url=https://archive.bridgesmathart.org/2001/bridges2001-67.pdf | ref={{SfnRef|Kappraff &amp; Adamson|2004}} }}
* {{Cite journal | last1=Fontaine | first1=Anne | last2=Hurley | first2=Susan | year=2006 | title=Proof by Picture: Products and Reciprocals of Diagonal Length Ratios in the Regular Polygon | journal=Forum Geometricorum | volume=6 | pages=97-101 | url=https://scispace.com/pdf/proof-by-picture-products-and-reciprocals-of-diagonal-length-1aian8mgp9.pdf }}
{{Refend}}</text>
      <sha1>nxvhffpkwt0cu8xvnsfo6dv7pmxagkq</sha1>
    </revision>
    <revision>
      <id>2809767</id>
      <parentid>2809763</parentid>
      <timestamp>2026-05-16T22:16:29Z</timestamp>
      <contributor>
        <username>Dc.samizdat</username>
        <id>2856930</id>
      </contributor>
      <comment>/* The 8-point regular polytopes */</comment>
      <origin>2809767</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="46725" sha1="h4od4l6j2xumnlrcey5cmu4gm8hghbe" xml:space="preserve">{{align|center|David Brooks Christie}}
{{align|center|dc@samizdat.org}}
{{align|center|Draft in progress}}
{{align|center|January 2026 - April 2026}}

&lt;blockquote&gt;Steinbach discovered the formula for the ratios of diagonal to side in the regular polygons. Fontaine and Hurley extended this result, discovering a formula for the reciprocal of a regular polygon chord derived geometrically from the chord's star polygon. We observe that these findings in plane geometry apply more generally, to polytopes of any dimensionality. Fontaine and Hurley's geometric procedure for finding the reciprocals of the chords of a regular polygon from their star polygons also finds the rotational geodesics of any polytope of any dimensionality.&lt;/blockquote&gt;
== Introduction ==
Steinbach discovered the Diagonal Product Formula and the Golden Fields family of ratios of diagonal to side in the regular polygons. He showed how this family extends beyond the pentagon {5} with its well-known golden bisection proportional to 𝜙, finding that the heptagon {7} has an analogous trisection, the nonagon {9} has an analogous quadrasection, and the hendecagon {11} has an analogous pentasection, an extended family of golden proportions with quasiperiodic properties. 

Kappraff and Adamson extended these findings in plane geometry to a theory of Generalized Fibonacci Sequences, showing that the Golden Fields not only do not end with the hendecagon, they form an infinite number of periodic trajectories when operated on by the Mandelbrot operator. They found a relation between the edges of star polygons and dynamical systems in the state of chaos, revealing a connection between chaos theory, number, and rotations in Coxeter Euclidean geometry. 

Fontaine and Hurley examined Steinbach's finding that the length of each chord of a regular polygon is both the product of two chords and the sum of a set of smaller chords, so that in rotations to add is to multiply. They illustrated Steinbach's sets of additive chords lying parallel to each other in the plane (pointing in the same direction), and by applying Steinbach's formula more generally they found another summation relation of signed parallel chords (pointing in opposite directions) which relates each chord length to its reciprocal, and relates the summation to a distinct star polygon rotation. 

We examine these remarkable findings (which stem from study of the chords of humble regular polygons) in higher-dimensional spaces, specifically in the chords, polygons and rotations of the [[120-cell]], the largest four-dimensional regular convex polytope.

== Visualizing the 120-cell ==
{| class=&quot;wikitable floatright&quot; width=&quot;400&quot;
|style=&quot;vertical-align:top&quot;|[[File:120-cell.gif|200px]]&lt;br&gt;Orthographic projection of the 600-point 120-cell &lt;small&gt;&lt;math&gt;\{5,3,3\}&lt;/math&gt;&lt;/small&gt; performing a [[W:SO(4)#Geometry of 4D rotations|simple rotation]].{{Sfn|Hise|2011|loc=File:120-cell.gif|ps=; &quot;Created by Jason Hise with Maya and Macromedia Fireworks. A 3D projection of a 120-cell performing a [[W:SO(4)#Geometry of 4D rotations|simple rotation]].&quot;}} In this simplified rendering only the 120-cell's own edges are shown; its 29 interior chords are not rendered. Therefore even though it is translucent, only its outer surface is visible. The complex interior parts of the 120-cell, all its inscribed 5-cells, 16-cells, 8-cells, 24-cells, 600-cells and its much larger inventory of polyhedra, are completely invisible in this view, as none of their edges are rendered at all.
|style=&quot;vertical-align:top&quot;|[[File:Ortho solid 016-uniform polychoron p33-t0.png|200px]]&lt;br&gt;Orthographic projection of the 600-point [[W:Great grand stellated 120-cell|great grand stellated 120-cell]] &lt;small&gt;&lt;math&gt;\{\tfrac{5}{2},3,3\}&lt;/math&gt;&lt;/small&gt;.{{Sfn|Ruen: Great grand stellated 120-cell|2007}} The 120-cell is its convex hull. The projection to the left renders only the 120-cell's shortest chord, its 1200 edges. The projection above also renders only one of the 120-cell's 30 chords, the edges of its 120 inscribed regular 5-cells. The 120-cell itself (the convex hull) is invisible in this view, as its edges are not rendered.
|}

[[120-cell#Geometry|The 120-cell is the maximally complex regular 4-polytope]], containing inscribed instances of every regular 1-, 2-, 3-, and 4-polytope, except the regular polygons of more than {15} sides. 

The 120-cell is the convex hull of a regular [[120-cell#Relationships among interior polytopes|compound of each of the 6 regular convex 4-polytopes]]. They are the [[5-cell|5-point (5-cell) 4-simplex]], the [[16-cell|8-point (16-cell) 4-orthoplex]], the [[W:Tesseract|16-point (8-cell) tesseract]], the [[24-cell|24-point (24-cell)]], the [[600-cell|120-point (600-cell)]], and the [[120-cell|600-point (120-cell)]]. The 120-cell is the convex hull of a compound of 120 disjoint regular 5-cells, of 75 disjoint 16-cells, of 25 disjoint 24-cells, and of 5 disjoint 600-cells.

The 120-cell contains an even larger inventory of irregular polytopes, created by the intersection of multiple instances of these component regular 4-polytopes. Many are quite unexpected, because they do not occur as components of any regular polytope smaller than the 120-cell. As just one example among the [[120-cell#Concentric hulls|sections of the 120-cell]], there is an irregular 24-point polyhedron with 16 triangle faces and 4 nonagon {9} faces.{{Sfn|Moxness|}}

Most renderings of the 120-cell, like the rotating projection here, only illustrate its outer surface, which is a honeycomb of face-bonded dodecahedral cells. Only the objects in its 3-dimensional surface are rendered, namely the 120 dodecahedra, their pentagon faces, and their edges. Although the 120-cell has chords of 30 distinct lengths, in this kind of simplified rendering only the 120-cell's own edges (its shortest chord) are shown. Its 29 interior chords, the edges of objects in the interior of the 120-cell, are not rendered, so interior objects are not visible at all.

Visualizing the complete interior of the 600-vertex 120-cell in a single image is impractical because of its complexity. Only four 120-cell edges are incident at each vertex, but [[120-cell#Chords|600 chords (of all 30 lengths)]] are incident at ''each'' vertex.

== Compounds in the 120-cell ==
The 8-point (16-cell), not the 5-point (5-cell), is the smallest building block; it compounds to every larger regular 4-polytope. The 5-point (5-cell) does compound to the 600-point (120-cell), but it does not fit into any smaller regular 4-polytope. 

The 8-point (16-cell) compounds by 2 in the 16-point (8-cell), and by 3 in the 24-point (24-cell). The 16-point (8-cell) compounds in the 24-point (24-cell) by 3 non-disjoint instances of itself, with each of the 24 vertices shared by two 16-point (8-cells). The 24-point (24-cell) compounds by 5 disjoint instances of itself in the 120-point (600-cell), and the 120-point (600-cell) compounds by 5 disjoint instances of itself in the 600-point (120-cell).

The 24-point (24-cell) also compounds by &lt;math&gt;5^2&lt;/math&gt; non-disjoint instances of itself in the 120-point (600-cell); it compounds in 5 disjoint instances of itself, 10 (not 5) different ways. Whichever set of 5 disjoint 24-point (24-cells) are assembled, the resulting 120-point (600-cell) contains 25 distinct 24-point (24-cells), not just 5 (or 10). This implies that 15 disjoint 8-point (16-cells) will construct a 120-point (600-cell), which will contain 75 distinct 8-point (16-cells). 

The 600-point (120-cell) is 5 disjoint 120-point (600-cells), just 2 different ways (not 5 or 10 ways), so it is 10 distinct 120-point (600-cells). This implies that the 8-point (16-cell) compounds by 3 times &lt;math&gt;5^2&lt;/math&gt; (75) disjoint instances of itself in the 600-point (120-cell), which contains &lt;math&gt;3^2&lt;/math&gt; times  &lt;math&gt;5^2&lt;/math&gt; (225) distinct instances of the 24-point (24-cell), and  &lt;math&gt;3^3&lt;/math&gt; times &lt;math&gt;5^2&lt;/math&gt; (675) distinct instances of the 8-point (16-cell). 

These facts were discovered painstakingly by various researchers, and no one has found a general rule governing subsumption relations among regular polytopes. The reasons for some of their numeric incidence relations are far from obvious. [[W:Pieter Hendrik Schoute|Schoute]] was the first to see that the 120-point (600-cell) is a compound of 5 24-point (24-cells) ''10 different ways'', and after he saw it a hundred years lapsed until Denney, Hooker, Johnson, Robinson, Butler &amp; Claiborne proved his result, and showed why.{{Sfn|Denney, Hooker, Johnson, Robinson, Butler &amp; Claiborne|2020|loc=''The geometry of H4 polytopes''}}

So much for the compounds of 16-cells. The 120-cell is also the convex hull of the compound of 120 disjoint regular 5-cells. That stellated compound (without its convex hull of 120-cell edges) is the [[w:Great_grand_stellated_120-cell|great grand stellated 120-cell]] illustrated above, the final regular [[W:Stellation|stellation]] of the 120-cell, and the only [[W:Schläfli-Hess polychoron|regular star 4-polytope]] to have the 120-cell for its convex hull. The edges of the great grand stellated 120-cell are &lt;math&gt;\phi^6&lt;/math&gt; as long as those of its 120-cell [[W:List of polyhedral stellations#Stellation process|stellation core]] deep inside.

The compound of 120 disjoint 5-point (5-cells) can be seen to be equivalent to the compound of 5 disjoint 120-point (600-cells), as follows. Beginning with a single 120-point (600-cell), expand each vertex into a regular 5-cell, by adding 4 new equidistant vertices, such that the 5 vertices form a regular 5-cell inscribed in the 3-sphere. The 120 5-cells are disjoint, and the 600 vertices form 5 disjoint 120-point (600-cells): a 120-cell.

== Thirty distinguished distances ==
The 30 numbers listed in the table are all-important in Euclidean geometry. A case can be made on symmetry grounds that their squares are the 30 most important numbers between 0 and 4. The 30 rows of the table are the 30 distinct [[120-cell#Geodesic rectangles|chord lengths of the unit-radius 120-cell]], the largest regular convex 4-polytope. Since the 120-cell subsumes all smaller regular polytopes, its 30 chords are the complete chord set of all the regular polytopes that can be constructed in the first four dimensions of Euclidean space, except for regular polygons of more than 15 sides.

{| class=&quot;wikitable&quot; style=&quot;white-space:nowrap;text-align:center&quot;
!rowspan=2|&lt;math&gt;c_t&lt;/math&gt;
!rowspan=2|arc
!rowspan=2|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{n}\right\}&lt;/math&gt;&lt;/small&gt;
!rowspan=2|&lt;math&gt;\left\{p\right\}&lt;/math&gt;
!rowspan=2|&lt;small&gt;&lt;math&gt;m\left\{\frac{k}{d}\right\}&lt;/math&gt;&lt;/small&gt;
!rowspan=2|Steinbach roots
!colspan=7|Chord lengths of the unit 120-cell
|-
!colspan=5|unit-radius length &lt;math&gt;c_t&lt;/math&gt;
!colspan=2|unit-edge length &lt;math&gt;c_t/c_1&lt;/math&gt;&lt;br&gt;in 120-cell of radius &lt;math&gt;c_8=\sqrt{2}\phi^2&lt;/math&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{1,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;15.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{30\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{30\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;c_{4,1}-c_{2,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7-3 \sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.270091&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2} \phi ^2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2 \phi ^4}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.072949}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{2,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;25.2{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{2}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \left\{15\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(c_{18,1}-c_{4,1}\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{3-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.437016&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2} \phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2 \phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.190983}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.61803&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{3,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;36{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{10\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3 \left\{\frac{10}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(\sqrt{5}-1\right) c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(\sqrt{5}-1\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.618034&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{\phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.381966}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.28825&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{4,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;41.4{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{c_{8,1}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.707107&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.61803&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{5,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;44.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{4}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \left\{\frac{15}{2}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} c_{2,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{9-3 \sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.756934&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{\frac{3}{2}}}{\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2 \phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.572949}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} \phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.80252&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{6,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;49.1{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{17}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{5-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{5-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.831254&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt[4]{5} \sqrt{\frac{1}{\phi }}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\sqrt{5}}{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.690983}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\phi ^3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.07768&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{7,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;56.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{20}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{1}{\phi }} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{2}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.93913&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{\frac{\psi }{\phi }}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\psi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.881966}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\psi  \phi ^3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.47709&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;60{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{5}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{6\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{6\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.70246&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{9,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;66.1{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{40}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{1}{2 \phi }} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.09132&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{\frac{\chi }{\phi }}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\chi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.19098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\chi  \phi ^3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.04057&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{10,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;69.8{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{11}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi  c_{4,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1+\sqrt{5}}{2 \sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.14412&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\phi }{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\phi ^2}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.30902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^3&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.23607&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{11,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;72{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{6}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{5\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{5\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\frac{1}{\phi }} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\frac{2}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.17557&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3-\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3-\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.38197}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \sqrt{3-\phi } \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.3525&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{12,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;75.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{24}{5}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.22474&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.53457&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{13,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;81.1{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{13}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{9-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{9-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.30038&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{9-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(9-\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.69098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(9-\sqrt{5}\right)} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.8146&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{14,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;84.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{40}{9}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt[4]{5} \sqrt{\phi } c_{8,1}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt[4]{5} \sqrt{1+\sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.345&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt[4]{5} \sqrt{\phi }}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\sqrt{5} \phi }{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.80902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\phi ^5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.9798&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{15,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;90.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{4\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{4\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 c_{4,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.41421&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.23607&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{16,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;95.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{29}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{11-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.4802&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(11-\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.19098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(11-\sqrt{5}\right)} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.48037&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{17,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;98.9{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{31}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7+\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{7+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.51954&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{7+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(7+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.30902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\psi  \phi ^5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.62605&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{18,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;104.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{8}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{15}{4}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.58114&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{5} \sqrt{\phi ^4}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.8541&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{19,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;108.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{9}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{10}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;c_{3,1}+c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(1+\sqrt{5}\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.61803&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1+\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.61803}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \phi ^3&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.9907&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{20,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;110.2{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{13-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.64042&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(13-\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.69098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\phi ^2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.07359&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{21,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;113.9{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{19}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.67601&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.80902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\frac{\chi }{\phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.20537&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{22,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;120{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{10}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{3\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{3\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.73205&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{6} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.41285&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{23,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;124.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{41}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{\phi }+\frac{5}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{2}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.7658&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4-\frac{\psi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4-\frac{\psi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.11803}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\chi  \phi ^5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.53779&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{24,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;130.9{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{20}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{11+\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.81907&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(11+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.30902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\frac{\sqrt{5}}{\phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.73503&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{25,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;135.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{11}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{11}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7+3 \sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7+3 \sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.85123&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\phi ^2}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\phi ^4}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.42705}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^4&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.8541&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{26,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;138.6{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{12}{5}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.87083&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{7} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.92667&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{27,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;144{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{12}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{5}{2}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(5+\sqrt{5}\right)} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(5+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.90211&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\phi +2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2+\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.61803}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{2 \phi +4}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.0425&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{28,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;154.8{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{13}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{13}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{13+\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.95167&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(13+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.80902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\frac{1}{\phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.22598&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{29,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;164.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{14}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{15}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi  c_{12,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{\frac{3}{2}} \left(1+\sqrt{5}\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.98168&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}} \phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3 \phi ^2}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.92705}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} \phi ^3&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.33708&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{30,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;180{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{15}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{2\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{2\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \sqrt{2} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.40492&lt;/math&gt;&lt;/small&gt;
|-
|rowspan=4 colspan=6|
|rowspan=4 colspan=4|
&lt;small&gt;&lt;math&gt;\phi&lt;/math&gt;&lt;/small&gt; is the golden ratio:&lt;br&gt;
&lt;small&gt;&lt;math&gt;\phi ^2-\phi -1=0&lt;/math&gt;&lt;/small&gt;&lt;br&gt;
&lt;small&gt;&lt;math&gt;\frac{1}{\phi }+1=\phi&lt;/math&gt;&lt;/small&gt;, and: &lt;small&gt;&lt;math&gt;\phi+1=\phi^2&lt;/math&gt;&lt;/small&gt;&lt;br&gt;
&lt;small&gt;&lt;math&gt;\frac{1}{\phi }::1::\phi ::\phi ^2&lt;/math&gt;&lt;/small&gt;&lt;br&gt;
&lt;small&gt;&lt;math&gt;1/\phi&lt;/math&gt;&lt;/small&gt; and &lt;small&gt;&lt;math&gt;\phi&lt;/math&gt;&lt;/small&gt; are the golden sections of &lt;small&gt;&lt;math&gt;\sqrt{5}&lt;/math&gt;&lt;/small&gt;:&lt;br&gt;
&lt;small&gt;&lt;math&gt;\phi +\frac{1}{\phi }=\sqrt{5}&lt;/math&gt;&lt;/small&gt;
|colspan=2|&lt;small&gt;&lt;math&gt;\phi = (\sqrt{5} + 1)/2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.618034&lt;/math&gt;&lt;/small&gt;
|-
|colspan=2|&lt;small&gt;&lt;math&gt;\chi = (3\sqrt{5} + 1)/2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.854102&lt;/math&gt;&lt;/small&gt;
|-
|colspan=2|&lt;small&gt;&lt;math&gt;\psi = (3\sqrt{5} - 1)/2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.854102&lt;/math&gt;&lt;/small&gt;
|-
|colspan=2|&lt;small&gt;&lt;math&gt;\psi = 11/\chi = 22/(3\sqrt{5} + 1)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.854102&lt;/math&gt;&lt;/small&gt;
|}

...

== The 8-point regular polytopes ==
In 2-space we have the regular 8-point octagon, in 3-space the regular 8-point cube, and in 4-space the regular 8-point [[16-cell]].

A planar octagon with rigid edges of unit length has chords of length:

:&lt;math&gt;r_1=1,r_2=\sqrt{2+\sqrt{2}} \approx 1.84776,r_3=1+\sqrt{2} \approx 2.41421,r_4=\sqrt{4 + \sqrt{8}} \approx 2.61313&lt;/math&gt;

The chord ratio &lt;math&gt;r_3=1+\sqrt{2}&lt;/math&gt; is a geometrical proportion, the [[W:Silver ratio|silver ratio]]. Fontaine and Hurley's procedure for obtaining the reciprocal of a chord tells us that:

:&lt;math&gt;r_3-r_1-r_1=1/r_3 \approx 0.41421&lt;/math&gt;

Note that &lt;math&gt;1/r_3=\sqrt{2}-1=r_3-2&lt;/math&gt;.

If we embed this planar octagon in 3-space, we can make it skew, repositioning its vertices so that each is one unit-edge length distant from three others instead of two others, at the vertices of a unit-edge cube with chords of length:

:&lt;math&gt;r_1=1, r_2=\sqrt{2}, r_3=\sqrt{3}, r_4=\sqrt{2}&lt;/math&gt;

If we embed this cube in 4-space, we can skew it some more, repositioning its vertices so that each is one unit-edge length distant from six others instead of three others, at the vertices of a unit-edge 4-polytope with chords of length:

:&lt;math&gt;r_1=1,r_2=1,r_3=1,r_4=\sqrt{2}&lt;/math&gt;

All of its chords except its long diameters are the same unit length as its edge. In fact they are its 24 edges, and it is a 16-cell of radius &lt;small&gt;&lt;math&gt;1/\sqrt{2}&lt;/math&gt;&lt;/small&gt;.

[[File:octagon16cell.png|thumb|Orthogonal projection of a regular 16-cell to the [[16-cell#Projections|B&lt;sub&gt;4&lt;/sub&gt; Coxeter plane]]. Only its edges are shown; its long diameter chords are not drawn. All 24 edges are the same length. Only the edges of the two disjoint squares lie parallel to the projection plane, in completely orthogonal central planes.]]

The [[16-cell]] is the [[W:Regular convex 4-polytope|regular convex 4-polytope]] with [[W:Schläfli symbol|Schläfli symbol]] {3,3,4}. It has 8 vertices, 24 edges, 32 equilateral triangle faces, and 16 regular tetrahedron cells. It is the [[16-cell#Octahedral dipyramid|four-dimensional analogue of the octahedron]], and each of its four orthogonal central hyperplanes is an octahedron.

The only planar regular polygons found in the 16-cell are face triangles and central plane squares, but the 16-cell also contains a skew regular octagon, its [[W:Petrie polygon|Petrie polygon]]. The chords of this regular octagon, which lies skew in 4-space, are those given above for the 16-cell, as opposed to those for the cube or the regular octagon in the plane. The 16-cell is a construct of 3 Petrie octagons which share the same 8 vertices but have disjoint sets of 8 edges each.

The regular octad has higher symmetry in 4-space than it does in 2-space. The 16-cell is the 4-orthoplex, the simplest regular 4-polytope after the [[5-cell|4-simplex]]. All the larger regular 4-polytopes, including the 120-cell, are compounds of the 16-cell. The regular octagon exhibits this high symmetry only when embedded in 4-space at the vertices of the 16-cell.

The 16-cell constitutes an [[W:Orthonormal basis|orthonormal basis]] for the choice of a 4-dimensional Cartesian reference frame, because its vertices define four orthogonal axes. The eight vertices of a unit-radius 16-cell are (±1, 0, 0, 0), (0, ±1, 0, 0), (0, 0, ±1, 0), (0, 0, 0, ±1). All vertices are connected by &lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt; edges except opposite pairs. 

The vertex coordinates of the 16-cell form 6 central squares lying in 6 pairwise [[W:Orthogonal|orthogonal]] coordinate planes. Great squares in ''opposite'' planes that do not share an axis (e.g. in the ''xy'' and ''wz'' planes) are completely disjoint (they do not intersect at any vertices). These planes are [[W:Completely orthogonal|completely orthogonal]].{{Efn|name=Six orthogonal planes of the Cartesian basis}}

Since this unit-radius coordinate system is convenient, let us derive the unit-radius 16-cell by skewing a unit-radius planar octagon, which has chords of length:

:&lt;math&gt;r_1=\sqrt{2-\sqrt{2}} \approx 0.76537,r_2=\sqrt{2},r_3=\sqrt{2+\sqrt{2}} \approx 1.84776,r_4=2&lt;/math&gt;

We will need a planar octagon with rigid &lt;math&gt;r_2&lt;/math&gt; chords, rather than one with rigid &lt;math&gt;r_1&lt;/math&gt; edges. The octagon's &lt;math&gt;r_2&lt;/math&gt; chords form two disjoint squares, which we can reposition in 3-space to form a cube by making them parallel, and in 4-space to form a 16-cell by making them completely orthogonal.

The &lt;math&gt;r_2&lt;/math&gt; chords form two disjoint great squares, visible in the orthogonal projection. These central squares are completely orthogonal: both parallel and perpendicular to each other. A ''simple'' rotation of the 16-cell in ''one'' of these two central planes rotates that square like a wheel, while the other square does not move. The four vertices of the rotating square orbit on a great circle.

The &lt;math&gt;r_1&lt;/math&gt; chords form a Petrie polygon which zig-zags back and forth between the two completely orthogonal &lt;math&gt;r_2&lt;/math&gt; squares.

The &lt;math&gt;r_3&lt;/math&gt; chords form a circular helix, visible as a skew {8/3} polygram in the orthogonal projection. A ''double'' rotation of the 16-cell, in ''both'' of the two completely orthogonal &lt;math&gt;r_2&lt;/math&gt; central square planes at once, moves the vertices along the circular helix over the &lt;math&gt;r_3&lt;/math&gt; chords.

[[W:Rotations in 4-dimensional Euclidean space|Rotations in 4-dimensional Euclidean space]] can be seen as the composition of two 2-dimensional rotations in completely orthogonal planes. The general rotation in 4-space is a double rotation in pairs of completely orthogonal planes. Two completely orthogonal planes are called invariant planes of the rotation when all points in the plane rotate on circles that remain in the plane, even as the whole plane tilts sideways (like a coin flipping) into another plane. The two completely orthogonal rotations of each plane (like a wheel, and like a coin flipping) are simultaneous but independent, in that they are not geometrically constrained to turn at the same rate. However, the most circular kind of rotation (as opposed to an elliptical double rotation of a rigid spherical object) occurs when the invariant planes do rotate through the same angle in the same time interval. Such equi-angled double rotations are called [[w:SO(4)#Isoclinic_rotations|isoclinic]], also [[w:William_Kingdon_Clifford|Clifford]] displacements.

The 16-cell is the simplest possible frame in which to [[16-cell#Rotations|observe 4-dimensional rotations]] because its characteristic isoclinic rotations feature a single pair of invariant rotation planes. In the 16-cell an isoclinic rotation by 90° in any pair of invariant completely orthogonal square central planes takes every square central plane to its completely orthogonal square central plane in a twisting displacment, as they tilt sideways 90° into each other's plane while rotating 90° internally. All the vertices move at once on separate circular [[w:Geodesic|geodesics]], displaced 90° in 8 orthogonal directions, and the rigid 16-cell assumes a new orientation in 4-space. When the 90° isoclinic rotation is continued in the same rotational direction through an additional 90°, each vertex is again displaced 90°, but from the new orientation in a direction orthogonal to its first 90° displacement. After 360° of rotation each vertex reaches its antipodal position.

The trajectory of each vertex over each 90° isoclinic rotational displacement is a one-eighth segment of its geodesic orbit. Its entire orbit traces a circular helix in 4-space over eight &lt;math&gt;r_3&lt;/math&gt; chords, and also traces a great circle twice over four &lt;math&gt;r_2&lt;/math&gt; chords in one of the two moving invariant rotation planes. In the course of a 720° isoclinic rotation each vertex departs from all 8 vertex positions just once and returns to its original position, and the 16-cell returns to its original orientation.

== Hypercubes ==
The long diameter of the unit-edge [[W:Hypercube|hypercube]] of dimension &lt;small&gt;&lt;math&gt;n&lt;/math&gt;&lt;/small&gt; is &lt;small&gt;&lt;math&gt;\sqrt{n}&lt;/math&gt;&lt;/small&gt;, so the unit-edge [[w:Tesseract|4-hypercube, the 16-point (8-cell) tesseract,]] has chords:
:&lt;math&gt;r_1=\sqrt{1},r_2=\sqrt{2},r_3=\sqrt{3},r_4=\sqrt{4}&lt;/math&gt;
Uniquely in its 4-dimensional case, the hypercube's edge length equals its radius, like the hexagon. We call such polytopes ''radially equilateral'', because they can be constructed from equilateral triangles which meet at their center, each contributing two radii and an edge. The cuboctahedron and the 24-cell are also radially equilateral.

The [[W:Tesseract|tesseract]] is the [[W:Regular convex 4-polytope|regular convex 4-polytope]] with [[W:Schläfli symbol|Schläfli symbol]] {4,3,3}. It has 16 vertices, 32 edges, 24 square faces, and 8 cube cells. It is the four-dimensional analogue of the cube.

The tesseract is the [[W:Dual polytope|dual polytope]] of the 16-cell. They have the same Petrie polygon, the regular octagon, but the tesseract contains 2 disjoint instances and 4 distinct instances of the skew octagon. We can construct the tesseract by skewing two planar octagons. Because the tesseract is radially equilateral (unlike the 16-cell), we start with our original octagon of unit-edge length, rather than the octagon of edge length &lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt; that we needed to build the unit-radius 16-cell.

For our tesseract construction we skew each planar octagon into a cube, so we have a compound of two completely orthogonal cubes. Provided the planes were completely orthogonal in 4-space and we skewed them both the same way, the 16 vertices will be the vertices of a tesseract with half of its 32 edges missing.

The 16-point tesseract is the convex hull of a compound of two 8-point 16-cells, in exact dimensional analogy to the way the 8-point cube is the convex hull of a [[W:Stellated octahedron|compound of two regular 4-point tetrahedra]]. The [[W:Demihypercube|demihypercubes]] occupy alternate vertices of the hypercubes. The diagonals of the square faces of the unit-radius tesseract are the &lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt; edges of two unit-radius 16-cells, which are also the edges of the square central planes.

Because the tesseract contains two 16-cells in alternate positions it has two sets of 6 orthogonal square central planes. Two angles are required to specify the relationship between two planes in 4-space. Pairs of planes within each 16-cell are 90° apart in one angle, and either 0° or 90° apart in the other angle. They are 90° apart in both angles if and only if they are completely orthogonal planes, 90° apart by isoclinic rotation, with no vertices in common and their corresponding vertices 180° apart. Otherwise they are 0° apart in one of the angles, 90° apart by simple rotation with their corresponding vertices 90° apart, and they intersect in one axis and lie in a common 3-dimensional hyperplane.{{Efn|A double rotation in which one of the two angles of rotation is 0°, so that one of the completely orthogonal invariant planes does not rotate, is called a simple rotation. Ordinary rotations observed in a 3-dimensional space are simple rotations.}}

A pair of square central planes from alternate 16-cells are 60° apart by isoclinic rotation, with their corresponding vertices 120° apart. The planes are not orthogonal or parallel, so they intersect in a line somewhere, but they have no vertices in common, they have no 3-dimensional hyperplane in common, and they cannot reach each other by simple rotation. Such pairs of objects are called [[W:Clifford parallel|Clifford parallel]] because all their corresponding pairs of vertices are the same distance apart, although they are not parallel in the usual sense, because they have a common center. Not only the alternate 16-cells' corresponding square central planes, but also the 16-cells themselves, are Clifford parallel objects.

We can rotate the tesseract isoclinically the way we rotated the 16-cell, by 90° in two completely orthogonal invariant square central planes, with the same effect on both alternate 16-cells. In the course of a 720° isoclinic rotation in invariant square central planes each vertex departs from all 8 vertex positions of its 16-cell just once and returns to its original position, but it does not visit the vertex positions of the other 16-cell. The skew octagon geodesic orbits of the 16 vertices are disjoint circular helixes, and those 16 circular helixes are Clifford parallel objects.

== The 24-cell ==
In 2-space we have the radially equilateral 6-point hexagon. In 3-space we have the radially equilateral 12-point cuboctahedron, with 4 hexagonal central planes. In 4-space we have the radially equilateral 24-point 24-cell, with 4 cuboctahedral central hyperplanes and 16 hexagonal central planes.

Great hexagons are a rounder choice than great squares for the invariant rotation planes in which to rotate a 4-polytope isoclinically. The complete hexagonal isoclinic revolution requires 720° like the square isoclinic revolution, but it is completed in 6 chordal steps of 120° each rather than 8 chordal steps of 90° each.

...

== The 600-cell ==

...

== Finally the 120-cell ==

...

== Conclusions ==

Fontaine and Hurley's discovery is more than a formula for the reciprocal of a regular ''n''-polygon diagonal. It also yields the discrete sequence of isocline chords of the distinct isoclinic rotation characteristic of a ''d''-dimensional regular polytope. The characteristic rotational chord sequence of the ''d''-polytope can be represented geometrically in two dimensions on a distinct star polygon, but it lies on a geodesic circle through ''d''-dimensional space. Fontaine and Hurley discovered the geodesic topology of polytopes generally. Their procedure will reveal the geodesics of arbitrary non-uniform polytopes, since it can be applied to a polytope of any dimensionality and irregularity, by first fitting the polytope to the smallest regular polygon whose chords include its chords.

Fontaine and Hurley's discovery of a chordal formula for isoclinic rotations closes the circuit on Kappraff and Adamson's discovery of a rotational connection between dynamical systems, Steinbach's golden fields, and Coxeter's Euclidean geometry of ''n'' dimensions. Application of the Fontaine and Hurley procedure in higher-dimensional spaces demonstrates why the connection exists: because polytope sequences generally, from Steinbach's golden polygon chord sequences, to chord sequences in isoclinic rotation helixes, to subsumption relations in the sequence of regular 4-polytopes, arise as expressions of the reflections and rotations of distinct Coxeter symmetry groups, when those various groups interact.

== Appendix: Sequence of regular 4-polytopes ==
{{Regular convex 4-polytopes|wiki=W:|columns=7}}

== Notes ==
{{Notelist}}

== Citations ==
{{Reflist}}

== References ==
{{Refbegin}}
* {{Cite journal | last=Steinbach | first=Peter | year=1997 | title=Golden fields: A case for the Heptagon | journal=Mathematics Magazine | volume=70 | issue=Feb 1997 | pages=22–31 | doi=10.1080/0025570X.1997.11996494 | jstor=2691048 | ref={{SfnRef|Steinbach|1997}} }}
* {{Cite journal | last=Steinbach | first=Peter | year=2000 | title=Sections Beyond Golden| journal=Bridges: Mathematical Connections in Art, Music and Science | issue=2000 | pages=35-44 | url=https://archive.bridgesmathart.org/2000/bridges2000-35.pdf | ref={{SfnRef|Steinbach|2000}}}}
* {{Cite journal | last1=Kappraff | first1=Jay | last2=Jablan | first2=Slavik | last3=Adamson | first3=Gary | last4=Sazdanovich | first4=Radmila | year=2004 | title=Golden Fields, Generalized Fibonacci Sequences, and Chaotic Matrices | journal=Forma | volume=19 | pages=367-387 | url=https://archive.bridgesmathart.org/2005/bridges2005-369.pdf | ref={{SfnRef|Kappraff, Jablan, Adamson &amp; Sazdanovich|2004}} }}
* {{Cite journal | last1=Kappraff | first1=Jay | last2=Adamson | first2=Gary | year=2004 | title=Polygons and Chaos | journal=Dynamical Systems and Geometric Theories | url=https://archive.bridgesmathart.org/2001/bridges2001-67.pdf | ref={{SfnRef|Kappraff &amp; Adamson|2004}} }}
* {{Cite journal | last1=Fontaine | first1=Anne | last2=Hurley | first2=Susan | year=2006 | title=Proof by Picture: Products and Reciprocals of Diagonal Length Ratios in the Regular Polygon | journal=Forum Geometricorum | volume=6 | pages=97-101 | url=https://scispace.com/pdf/proof-by-picture-products-and-reciprocals-of-diagonal-length-1aian8mgp9.pdf }}
{{Refend}}</text>
      <sha1>h4od4l6j2xumnlrcey5cmu4gm8hghbe</sha1>
    </revision>
    <revision>
      <id>2809770</id>
      <parentid>2809767</parentid>
      <timestamp>2026-05-16T22:19:34Z</timestamp>
      <contributor>
        <username>Dc.samizdat</username>
        <id>2856930</id>
      </contributor>
      <comment>/* The 8-point regular polytopes */</comment>
      <origin>2809770</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="46729" sha1="2xhk6juo1p9q99g8y0ey8tqdg16wnd4" xml:space="preserve">{{align|center|David Brooks Christie}}
{{align|center|dc@samizdat.org}}
{{align|center|Draft in progress}}
{{align|center|January 2026 - April 2026}}

&lt;blockquote&gt;Steinbach discovered the formula for the ratios of diagonal to side in the regular polygons. Fontaine and Hurley extended this result, discovering a formula for the reciprocal of a regular polygon chord derived geometrically from the chord's star polygon. We observe that these findings in plane geometry apply more generally, to polytopes of any dimensionality. Fontaine and Hurley's geometric procedure for finding the reciprocals of the chords of a regular polygon from their star polygons also finds the rotational geodesics of any polytope of any dimensionality.&lt;/blockquote&gt;
== Introduction ==
Steinbach discovered the Diagonal Product Formula and the Golden Fields family of ratios of diagonal to side in the regular polygons. He showed how this family extends beyond the pentagon {5} with its well-known golden bisection proportional to 𝜙, finding that the heptagon {7} has an analogous trisection, the nonagon {9} has an analogous quadrasection, and the hendecagon {11} has an analogous pentasection, an extended family of golden proportions with quasiperiodic properties. 

Kappraff and Adamson extended these findings in plane geometry to a theory of Generalized Fibonacci Sequences, showing that the Golden Fields not only do not end with the hendecagon, they form an infinite number of periodic trajectories when operated on by the Mandelbrot operator. They found a relation between the edges of star polygons and dynamical systems in the state of chaos, revealing a connection between chaos theory, number, and rotations in Coxeter Euclidean geometry. 

Fontaine and Hurley examined Steinbach's finding that the length of each chord of a regular polygon is both the product of two chords and the sum of a set of smaller chords, so that in rotations to add is to multiply. They illustrated Steinbach's sets of additive chords lying parallel to each other in the plane (pointing in the same direction), and by applying Steinbach's formula more generally they found another summation relation of signed parallel chords (pointing in opposite directions) which relates each chord length to its reciprocal, and relates the summation to a distinct star polygon rotation. 

We examine these remarkable findings (which stem from study of the chords of humble regular polygons) in higher-dimensional spaces, specifically in the chords, polygons and rotations of the [[120-cell]], the largest four-dimensional regular convex polytope.

== Visualizing the 120-cell ==
{| class=&quot;wikitable floatright&quot; width=&quot;400&quot;
|style=&quot;vertical-align:top&quot;|[[File:120-cell.gif|200px]]&lt;br&gt;Orthographic projection of the 600-point 120-cell &lt;small&gt;&lt;math&gt;\{5,3,3\}&lt;/math&gt;&lt;/small&gt; performing a [[W:SO(4)#Geometry of 4D rotations|simple rotation]].{{Sfn|Hise|2011|loc=File:120-cell.gif|ps=; &quot;Created by Jason Hise with Maya and Macromedia Fireworks. A 3D projection of a 120-cell performing a [[W:SO(4)#Geometry of 4D rotations|simple rotation]].&quot;}} In this simplified rendering only the 120-cell's own edges are shown; its 29 interior chords are not rendered. Therefore even though it is translucent, only its outer surface is visible. The complex interior parts of the 120-cell, all its inscribed 5-cells, 16-cells, 8-cells, 24-cells, 600-cells and its much larger inventory of polyhedra, are completely invisible in this view, as none of their edges are rendered at all.
|style=&quot;vertical-align:top&quot;|[[File:Ortho solid 016-uniform polychoron p33-t0.png|200px]]&lt;br&gt;Orthographic projection of the 600-point [[W:Great grand stellated 120-cell|great grand stellated 120-cell]] &lt;small&gt;&lt;math&gt;\{\tfrac{5}{2},3,3\}&lt;/math&gt;&lt;/small&gt;.{{Sfn|Ruen: Great grand stellated 120-cell|2007}} The 120-cell is its convex hull. The projection to the left renders only the 120-cell's shortest chord, its 1200 edges. The projection above also renders only one of the 120-cell's 30 chords, the edges of its 120 inscribed regular 5-cells. The 120-cell itself (the convex hull) is invisible in this view, as its edges are not rendered.
|}

[[120-cell#Geometry|The 120-cell is the maximally complex regular 4-polytope]], containing inscribed instances of every regular 1-, 2-, 3-, and 4-polytope, except the regular polygons of more than {15} sides. 

The 120-cell is the convex hull of a regular [[120-cell#Relationships among interior polytopes|compound of each of the 6 regular convex 4-polytopes]]. They are the [[5-cell|5-point (5-cell) 4-simplex]], the [[16-cell|8-point (16-cell) 4-orthoplex]], the [[W:Tesseract|16-point (8-cell) tesseract]], the [[24-cell|24-point (24-cell)]], the [[600-cell|120-point (600-cell)]], and the [[120-cell|600-point (120-cell)]]. The 120-cell is the convex hull of a compound of 120 disjoint regular 5-cells, of 75 disjoint 16-cells, of 25 disjoint 24-cells, and of 5 disjoint 600-cells.

The 120-cell contains an even larger inventory of irregular polytopes, created by the intersection of multiple instances of these component regular 4-polytopes. Many are quite unexpected, because they do not occur as components of any regular polytope smaller than the 120-cell. As just one example among the [[120-cell#Concentric hulls|sections of the 120-cell]], there is an irregular 24-point polyhedron with 16 triangle faces and 4 nonagon {9} faces.{{Sfn|Moxness|}}

Most renderings of the 120-cell, like the rotating projection here, only illustrate its outer surface, which is a honeycomb of face-bonded dodecahedral cells. Only the objects in its 3-dimensional surface are rendered, namely the 120 dodecahedra, their pentagon faces, and their edges. Although the 120-cell has chords of 30 distinct lengths, in this kind of simplified rendering only the 120-cell's own edges (its shortest chord) are shown. Its 29 interior chords, the edges of objects in the interior of the 120-cell, are not rendered, so interior objects are not visible at all.

Visualizing the complete interior of the 600-vertex 120-cell in a single image is impractical because of its complexity. Only four 120-cell edges are incident at each vertex, but [[120-cell#Chords|600 chords (of all 30 lengths)]] are incident at ''each'' vertex.

== Compounds in the 120-cell ==
The 8-point (16-cell), not the 5-point (5-cell), is the smallest building block; it compounds to every larger regular 4-polytope. The 5-point (5-cell) does compound to the 600-point (120-cell), but it does not fit into any smaller regular 4-polytope. 

The 8-point (16-cell) compounds by 2 in the 16-point (8-cell), and by 3 in the 24-point (24-cell). The 16-point (8-cell) compounds in the 24-point (24-cell) by 3 non-disjoint instances of itself, with each of the 24 vertices shared by two 16-point (8-cells). The 24-point (24-cell) compounds by 5 disjoint instances of itself in the 120-point (600-cell), and the 120-point (600-cell) compounds by 5 disjoint instances of itself in the 600-point (120-cell).

The 24-point (24-cell) also compounds by &lt;math&gt;5^2&lt;/math&gt; non-disjoint instances of itself in the 120-point (600-cell); it compounds in 5 disjoint instances of itself, 10 (not 5) different ways. Whichever set of 5 disjoint 24-point (24-cells) are assembled, the resulting 120-point (600-cell) contains 25 distinct 24-point (24-cells), not just 5 (or 10). This implies that 15 disjoint 8-point (16-cells) will construct a 120-point (600-cell), which will contain 75 distinct 8-point (16-cells). 

The 600-point (120-cell) is 5 disjoint 120-point (600-cells), just 2 different ways (not 5 or 10 ways), so it is 10 distinct 120-point (600-cells). This implies that the 8-point (16-cell) compounds by 3 times &lt;math&gt;5^2&lt;/math&gt; (75) disjoint instances of itself in the 600-point (120-cell), which contains &lt;math&gt;3^2&lt;/math&gt; times  &lt;math&gt;5^2&lt;/math&gt; (225) distinct instances of the 24-point (24-cell), and  &lt;math&gt;3^3&lt;/math&gt; times &lt;math&gt;5^2&lt;/math&gt; (675) distinct instances of the 8-point (16-cell). 

These facts were discovered painstakingly by various researchers, and no one has found a general rule governing subsumption relations among regular polytopes. The reasons for some of their numeric incidence relations are far from obvious. [[W:Pieter Hendrik Schoute|Schoute]] was the first to see that the 120-point (600-cell) is a compound of 5 24-point (24-cells) ''10 different ways'', and after he saw it a hundred years lapsed until Denney, Hooker, Johnson, Robinson, Butler &amp; Claiborne proved his result, and showed why.{{Sfn|Denney, Hooker, Johnson, Robinson, Butler &amp; Claiborne|2020|loc=''The geometry of H4 polytopes''}}

So much for the compounds of 16-cells. The 120-cell is also the convex hull of the compound of 120 disjoint regular 5-cells. That stellated compound (without its convex hull of 120-cell edges) is the [[w:Great_grand_stellated_120-cell|great grand stellated 120-cell]] illustrated above, the final regular [[W:Stellation|stellation]] of the 120-cell, and the only [[W:Schläfli-Hess polychoron|regular star 4-polytope]] to have the 120-cell for its convex hull. The edges of the great grand stellated 120-cell are &lt;math&gt;\phi^6&lt;/math&gt; as long as those of its 120-cell [[W:List of polyhedral stellations#Stellation process|stellation core]] deep inside.

The compound of 120 disjoint 5-point (5-cells) can be seen to be equivalent to the compound of 5 disjoint 120-point (600-cells), as follows. Beginning with a single 120-point (600-cell), expand each vertex into a regular 5-cell, by adding 4 new equidistant vertices, such that the 5 vertices form a regular 5-cell inscribed in the 3-sphere. The 120 5-cells are disjoint, and the 600 vertices form 5 disjoint 120-point (600-cells): a 120-cell.

== Thirty distinguished distances ==
The 30 numbers listed in the table are all-important in Euclidean geometry. A case can be made on symmetry grounds that their squares are the 30 most important numbers between 0 and 4. The 30 rows of the table are the 30 distinct [[120-cell#Geodesic rectangles|chord lengths of the unit-radius 120-cell]], the largest regular convex 4-polytope. Since the 120-cell subsumes all smaller regular polytopes, its 30 chords are the complete chord set of all the regular polytopes that can be constructed in the first four dimensions of Euclidean space, except for regular polygons of more than 15 sides.

{| class=&quot;wikitable&quot; style=&quot;white-space:nowrap;text-align:center&quot;
!rowspan=2|&lt;math&gt;c_t&lt;/math&gt;
!rowspan=2|arc
!rowspan=2|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{n}\right\}&lt;/math&gt;&lt;/small&gt;
!rowspan=2|&lt;math&gt;\left\{p\right\}&lt;/math&gt;
!rowspan=2|&lt;small&gt;&lt;math&gt;m\left\{\frac{k}{d}\right\}&lt;/math&gt;&lt;/small&gt;
!rowspan=2|Steinbach roots
!colspan=7|Chord lengths of the unit 120-cell
|-
!colspan=5|unit-radius length &lt;math&gt;c_t&lt;/math&gt;
!colspan=2|unit-edge length &lt;math&gt;c_t/c_1&lt;/math&gt;&lt;br&gt;in 120-cell of radius &lt;math&gt;c_8=\sqrt{2}\phi^2&lt;/math&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{1,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;15.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{30\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{30\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;c_{4,1}-c_{2,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7-3 \sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.270091&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2} \phi ^2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2 \phi ^4}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.072949}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{2,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;25.2{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{2}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \left\{15\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(c_{18,1}-c_{4,1}\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{3-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.437016&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2} \phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2 \phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.190983}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.61803&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{3,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;36{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{10\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3 \left\{\frac{10}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(\sqrt{5}-1\right) c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(\sqrt{5}-1\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.618034&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{\phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.381966}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.28825&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{4,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;41.4{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{c_{8,1}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.707107&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.61803&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{5,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;44.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{4}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \left\{\frac{15}{2}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} c_{2,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{9-3 \sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.756934&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{\frac{3}{2}}}{\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2 \phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.572949}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} \phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.80252&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{6,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;49.1{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{17}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{5-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{5-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.831254&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt[4]{5} \sqrt{\frac{1}{\phi }}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\sqrt{5}}{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.690983}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\phi ^3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.07768&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{7,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;56.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{20}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{1}{\phi }} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{2}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.93913&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{\frac{\psi }{\phi }}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\psi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.881966}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\psi  \phi ^3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.47709&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;60{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{5}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{6\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{6\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.70246&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{9,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;66.1{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{40}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{1}{2 \phi }} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.09132&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{\frac{\chi }{\phi }}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\chi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.19098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\chi  \phi ^3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.04057&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{10,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;69.8{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{11}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi  c_{4,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1+\sqrt{5}}{2 \sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.14412&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\phi }{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\phi ^2}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.30902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^3&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.23607&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{11,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;72{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{6}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{5\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{5\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\frac{1}{\phi }} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\frac{2}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.17557&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3-\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3-\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.38197}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \sqrt{3-\phi } \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.3525&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{12,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;75.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{24}{5}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.22474&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.53457&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{13,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;81.1{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{13}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{9-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{9-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.30038&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{9-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(9-\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.69098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(9-\sqrt{5}\right)} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.8146&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{14,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;84.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{40}{9}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt[4]{5} \sqrt{\phi } c_{8,1}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt[4]{5} \sqrt{1+\sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.345&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt[4]{5} \sqrt{\phi }}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\sqrt{5} \phi }{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.80902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\phi ^5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.9798&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{15,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;90.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{4\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{4\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 c_{4,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.41421&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.23607&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{16,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;95.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{29}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{11-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.4802&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(11-\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.19098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(11-\sqrt{5}\right)} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.48037&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{17,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;98.9{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{31}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7+\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{7+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.51954&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{7+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(7+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.30902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\psi  \phi ^5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.62605&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{18,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;104.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{8}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{15}{4}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.58114&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{5} \sqrt{\phi ^4}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.8541&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{19,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;108.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{9}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{10}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;c_{3,1}+c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(1+\sqrt{5}\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.61803&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1+\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.61803}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \phi ^3&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.9907&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{20,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;110.2{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{13-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.64042&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(13-\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.69098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\phi ^2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.07359&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{21,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;113.9{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{19}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.67601&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.80902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\frac{\chi }{\phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.20537&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{22,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;120{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{10}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{3\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{3\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.73205&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{6} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.41285&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{23,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;124.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{41}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{\phi }+\frac{5}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{2}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.7658&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4-\frac{\psi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4-\frac{\psi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.11803}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\chi  \phi ^5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.53779&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{24,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;130.9{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{20}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{11+\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.81907&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(11+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.30902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\frac{\sqrt{5}}{\phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.73503&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{25,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;135.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{11}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{11}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7+3 \sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7+3 \sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.85123&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\phi ^2}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\phi ^4}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.42705}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^4&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.8541&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{26,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;138.6{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{12}{5}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.87083&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{7} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.92667&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{27,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;144{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{12}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{5}{2}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(5+\sqrt{5}\right)} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(5+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.90211&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\phi +2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2+\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.61803}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{2 \phi +4}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.0425&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{28,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;154.8{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{13}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{13}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{13+\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.95167&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(13+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.80902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\frac{1}{\phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.22598&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{29,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;164.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{14}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{15}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi  c_{12,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{\frac{3}{2}} \left(1+\sqrt{5}\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.98168&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}} \phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3 \phi ^2}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.92705}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} \phi ^3&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.33708&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{30,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;180{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{15}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{2\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{2\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \sqrt{2} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.40492&lt;/math&gt;&lt;/small&gt;
|-
|rowspan=4 colspan=6|
|rowspan=4 colspan=4|
&lt;small&gt;&lt;math&gt;\phi&lt;/math&gt;&lt;/small&gt; is the golden ratio:&lt;br&gt;
&lt;small&gt;&lt;math&gt;\phi ^2-\phi -1=0&lt;/math&gt;&lt;/small&gt;&lt;br&gt;
&lt;small&gt;&lt;math&gt;\frac{1}{\phi }+1=\phi&lt;/math&gt;&lt;/small&gt;, and: &lt;small&gt;&lt;math&gt;\phi+1=\phi^2&lt;/math&gt;&lt;/small&gt;&lt;br&gt;
&lt;small&gt;&lt;math&gt;\frac{1}{\phi }::1::\phi ::\phi ^2&lt;/math&gt;&lt;/small&gt;&lt;br&gt;
&lt;small&gt;&lt;math&gt;1/\phi&lt;/math&gt;&lt;/small&gt; and &lt;small&gt;&lt;math&gt;\phi&lt;/math&gt;&lt;/small&gt; are the golden sections of &lt;small&gt;&lt;math&gt;\sqrt{5}&lt;/math&gt;&lt;/small&gt;:&lt;br&gt;
&lt;small&gt;&lt;math&gt;\phi +\frac{1}{\phi }=\sqrt{5}&lt;/math&gt;&lt;/small&gt;
|colspan=2|&lt;small&gt;&lt;math&gt;\phi = (\sqrt{5} + 1)/2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.618034&lt;/math&gt;&lt;/small&gt;
|-
|colspan=2|&lt;small&gt;&lt;math&gt;\chi = (3\sqrt{5} + 1)/2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.854102&lt;/math&gt;&lt;/small&gt;
|-
|colspan=2|&lt;small&gt;&lt;math&gt;\psi = (3\sqrt{5} - 1)/2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.854102&lt;/math&gt;&lt;/small&gt;
|-
|colspan=2|&lt;small&gt;&lt;math&gt;\psi = 11/\chi = 22/(3\sqrt{5} + 1)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.854102&lt;/math&gt;&lt;/small&gt;
|}

...

== The 8-point regular polytopes ==
In 2-space we have the regular 8-point octagon, in 3-space the regular 8-point cube, and in 4-space the regular 8-point [[16-cell]].

A planar octagon with rigid edges of unit length has chords of length:

:&lt;math&gt;r_1=1,r_2=\sqrt{2+\sqrt{2}} \approx 1.84776,r_3=1+\sqrt{2} \approx 2.41421,r_4=\sqrt{4 + \sqrt{8}} \approx 2.61313&lt;/math&gt;

The chord ratio &lt;math&gt;r_3=1+\sqrt{2}&lt;/math&gt; is a geometrical proportion, the [[W:Silver ratio|silver ratio]]. Fontaine and Hurley's procedure for obtaining the reciprocal of a chord tells us that:

:&lt;math&gt;r_3-r_1-r_1=1/r_3 \approx 0.41421&lt;/math&gt;

Note that &lt;math&gt;1/r_3=\sqrt{2}-1=r_3-2&lt;/math&gt;.

If we embed this planar octagon in 3-space, we can make it skew, repositioning its vertices so that each is one unit-edge length distant from three others instead of two others, at the vertices of a unit-edge cube with chords of length:

:&lt;math&gt;r_1=1, r_2=\sqrt{2}, r_3=\sqrt{3}, r_4=\sqrt{2}&lt;/math&gt;

If we embed this cube in 4-space, we can skew it some more, repositioning its vertices so that each is one unit-edge length distant from six others instead of three others, at the vertices of a unit-edge 4-polytope with chords of length:

:&lt;math&gt;r_1=1,r_2=1,r_3=1,r_4=\sqrt{2}&lt;/math&gt;

All of its chords except its long diameters are the same unit length as its edge. In fact they are its 24 edges, and it is a 16-cell of radius &lt;small&gt;&lt;math&gt;1/\sqrt{2}&lt;/math&gt;&lt;/small&gt;.

[[File:octagon16cell.png|thumb|Orthogonal projection of a regular 16-cell to the [[16-cell#Projections|B&lt;sub&gt;4&lt;/sub&gt; Coxeter plane]]. Only its edges are shown; its long diameter chords are not drawn. All 24 edges are the same length. Only the edges of the two disjoint squares lie parallel to the projection plane, in completely orthogonal central planes.]]

The [[16-cell]] is the [[W:Regular convex 4-polytope|regular convex 4-polytope]] with [[W:Schläfli symbol|Schläfli symbol]] {3,3,4}. It has 8 vertices, 24 edges, 32 equilateral triangle faces, and 16 regular tetrahedron cells. It is the [[16-cell#Octahedral dipyramid|four-dimensional analogue of the octahedron]], and each of its four orthogonal central hyperplanes is an octahedron.

The only planar regular polygons found in the 16-cell are face triangles and central plane squares, but the 16-cell also contains a skew regular octagon, its [[W:Petrie polygon|Petrie polygon]]. The chords of this regular octagon, which lies skew in 4-space, are those given above for the 16-cell, as opposed to those for the cube or the regular octagon in the plane. The 16-cell is a construct of 3 Petrie octagons which share the same 8 vertices but have disjoint sets of 8 edges each.

The regular octad has higher symmetry in 4-space than it does in 2-space. The 16-cell is the 4-orthoplex, the simplest regular 4-polytope after the [[5-cell|4-simplex]]. All the larger regular 4-polytopes, including the 120-cell, are compounds of the 16-cell. The regular octagon exhibits this high symmetry only when embedded in 4-space at the vertices of the 16-cell.

The 16-cell constitutes an [[W:Orthonormal basis|orthonormal basis]] for the choice of a 4-dimensional Cartesian reference frame, because its vertices define four orthogonal axes. The eight vertices of a unit-radius 16-cell are (±1, 0, 0, 0), (0, ±1, 0, 0), (0, 0, ±1, 0), (0, 0, 0, ±1). All vertices are connected by &lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt; edges except opposite pairs. 

The vertex coordinates of the 16-cell form 6 central squares lying in 6 pairwise [[W:Orthogonal|orthogonal]] coordinate planes. Great squares in ''opposite'' planes that do not share an axis (e.g. in the ''xy'' and ''wz'' planes) are completely disjoint (they do not intersect at any vertices). These planes are [[W:Completely orthogonal|completely orthogonal]].{{Efn|name=Six orthogonal planes of the Cartesian basis}}

Since this unit-radius coordinate system is convenient, let us derive the unit-radius 16-cell by skewing a unit-radius planar octagon, which has chords of length:

:&lt;math&gt;r_1=\sqrt{2-\sqrt{2}} \approx 0.76537,r_2=\sqrt{2},r_3=\sqrt{2+\sqrt{2}} \approx 1.84776,r_4=2&lt;/math&gt;

We will need a planar octagon with rigid &lt;math&gt;r_2&lt;/math&gt; chords, rather than one with rigid &lt;math&gt;r_1&lt;/math&gt; edges. The octagon's &lt;math&gt;r_2&lt;/math&gt; chords form two disjoint squares, which we can reposition in 3-space to form a cube by making them parallel, and in 4-space to form a 16-cell by making them completely orthogonal.

The &lt;math&gt;r_2&lt;/math&gt; chords form two disjoint great squares, visible in the orthogonal projection. These central squares are completely orthogonal: both parallel and perpendicular to each other. A ''simple'' rotation of the 16-cell in ''one'' of these two central planes rotates that square like a wheel, while the other square does not move. The four vertices of the rotating square orbit on a great circle.

The &lt;math&gt;r_1&lt;/math&gt; chords form a Petrie polygon which zig-zags back and forth between the two completely orthogonal &lt;math&gt;r_2&lt;/math&gt; squares.

The &lt;math&gt;r_3&lt;/math&gt; chords form a circular helix, visible as a skew {8/3} polygram in the orthogonal projection. A ''double'' rotation of the 16-cell, in ''both'' of the two completely orthogonal &lt;math&gt;r_2&lt;/math&gt; central square planes at once, moves the vertices along the circular helix over the &lt;math&gt;r_3&lt;/math&gt; chords.

[[W:Rotations in 4-dimensional Euclidean space|Rotations in 4-dimensional Euclidean space]] can be seen as the composition of two 2-dimensional rotations in completely orthogonal planes. The general rotation in 4-space is a double rotation in pairs of completely orthogonal planes. Two completely orthogonal planes are called invariant planes of the rotation when all points in the plane rotate on circles that remain in the plane, even as the whole plane tilts sideways (like a coin flipping) into another plane. The two completely orthogonal rotations of each plane (like a wheel, and like a coin flipping) are simultaneous but independent, in that they are not geometrically constrained to turn at the same rate. However, the most circular kind of rotation (as opposed to an elliptical double rotation of a rigid spherical object) occurs when the invariant planes do rotate through the same angle in the same time interval. Such equi-angled double rotations are called [[w:SO(4)#Isoclinic_rotations|isoclinic]], also [[w:William_Kingdon_Clifford|Clifford]] displacements.

The 16-cell is the simplest possible frame in which to [[16-cell#Rotations|observe 4-dimensional rotations]] because its characteristic isoclinic rotations feature a single pair of invariant rotation planes. In the 16-cell an isoclinic rotation by 90° in any pair of invariant completely orthogonal square central planes takes every square central plane to its completely orthogonal square central plane in a twisting displacment, as they tilt sideways 90° into each other's plane while rotating 90° internally. All the vertices move at once on separate circular [[w:Geodesic|geodesics]], displaced 90° in 8 orthogonal directions, and the rigid 16-cell assumes a new orientation in 4-space. When the 90° isoclinic rotation is continued in the same rotational direction through an additional 90°, each vertex is again displaced 90°, but from the new orientation in a direction orthogonal to its first 90° displacement. After 360° of rotation each vertex reaches its antipodal position.

The trajectory of each vertex over each 90° isoclinic rotational displacement is a one-eighth segment of its geodesic orbit. Its entire orbit traces a circular helix in 4-space over eight &lt;math&gt;r_3&lt;/math&gt; chords, and also traces a great circle twice over the four &lt;math&gt;r_2&lt;/math&gt; chords of one of the two moving invariant rotation planes. In the course of a 720° isoclinic rotation each vertex departs from all 8 vertex positions just once and returns to its original position, and the 16-cell returns to its original orientation.

== Hypercubes ==
The long diameter of the unit-edge [[W:Hypercube|hypercube]] of dimension &lt;small&gt;&lt;math&gt;n&lt;/math&gt;&lt;/small&gt; is &lt;small&gt;&lt;math&gt;\sqrt{n}&lt;/math&gt;&lt;/small&gt;, so the unit-edge [[w:Tesseract|4-hypercube, the 16-point (8-cell) tesseract,]] has chords:
:&lt;math&gt;r_1=\sqrt{1},r_2=\sqrt{2},r_3=\sqrt{3},r_4=\sqrt{4}&lt;/math&gt;
Uniquely in its 4-dimensional case, the hypercube's edge length equals its radius, like the hexagon. We call such polytopes ''radially equilateral'', because they can be constructed from equilateral triangles which meet at their center, each contributing two radii and an edge. The cuboctahedron and the 24-cell are also radially equilateral.

The [[W:Tesseract|tesseract]] is the [[W:Regular convex 4-polytope|regular convex 4-polytope]] with [[W:Schläfli symbol|Schläfli symbol]] {4,3,3}. It has 16 vertices, 32 edges, 24 square faces, and 8 cube cells. It is the four-dimensional analogue of the cube.

The tesseract is the [[W:Dual polytope|dual polytope]] of the 16-cell. They have the same Petrie polygon, the regular octagon, but the tesseract contains 2 disjoint instances and 4 distinct instances of the skew octagon. We can construct the tesseract by skewing two planar octagons. Because the tesseract is radially equilateral (unlike the 16-cell), we start with our original octagon of unit-edge length, rather than the octagon of edge length &lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt; that we needed to build the unit-radius 16-cell.

For our tesseract construction we skew each planar octagon into a cube, so we have a compound of two completely orthogonal cubes. Provided the planes were completely orthogonal in 4-space and we skewed them both the same way, the 16 vertices will be the vertices of a tesseract with half of its 32 edges missing.

The 16-point tesseract is the convex hull of a compound of two 8-point 16-cells, in exact dimensional analogy to the way the 8-point cube is the convex hull of a [[W:Stellated octahedron|compound of two regular 4-point tetrahedra]]. The [[W:Demihypercube|demihypercubes]] occupy alternate vertices of the hypercubes. The diagonals of the square faces of the unit-radius tesseract are the &lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt; edges of two unit-radius 16-cells, which are also the edges of the square central planes.

Because the tesseract contains two 16-cells in alternate positions it has two sets of 6 orthogonal square central planes. Two angles are required to specify the relationship between two planes in 4-space. Pairs of planes within each 16-cell are 90° apart in one angle, and either 0° or 90° apart in the other angle. They are 90° apart in both angles if and only if they are completely orthogonal planes, 90° apart by isoclinic rotation, with no vertices in common and their corresponding vertices 180° apart. Otherwise they are 0° apart in one of the angles, 90° apart by simple rotation with their corresponding vertices 90° apart, and they intersect in one axis and lie in a common 3-dimensional hyperplane.{{Efn|A double rotation in which one of the two angles of rotation is 0°, so that one of the completely orthogonal invariant planes does not rotate, is called a simple rotation. Ordinary rotations observed in a 3-dimensional space are simple rotations.}}

A pair of square central planes from alternate 16-cells are 60° apart by isoclinic rotation, with their corresponding vertices 120° apart. The planes are not orthogonal or parallel, so they intersect in a line somewhere, but they have no vertices in common, they have no 3-dimensional hyperplane in common, and they cannot reach each other by simple rotation. Such pairs of objects are called [[W:Clifford parallel|Clifford parallel]] because all their corresponding pairs of vertices are the same distance apart, although they are not parallel in the usual sense, because they have a common center. Not only the alternate 16-cells' corresponding square central planes, but also the 16-cells themselves, are Clifford parallel objects.

We can rotate the tesseract isoclinically the way we rotated the 16-cell, by 90° in two completely orthogonal invariant square central planes, with the same effect on both alternate 16-cells. In the course of a 720° isoclinic rotation in invariant square central planes each vertex departs from all 8 vertex positions of its 16-cell just once and returns to its original position, but it does not visit the vertex positions of the other 16-cell. The skew octagon geodesic orbits of the 16 vertices are disjoint circular helixes, and those 16 circular helixes are Clifford parallel objects.

== The 24-cell ==
In 2-space we have the radially equilateral 6-point hexagon. In 3-space we have the radially equilateral 12-point cuboctahedron, with 4 hexagonal central planes. In 4-space we have the radially equilateral 24-point 24-cell, with 4 cuboctahedral central hyperplanes and 16 hexagonal central planes.

Great hexagons are a rounder choice than great squares for the invariant rotation planes in which to rotate a 4-polytope isoclinically. The complete hexagonal isoclinic revolution requires 720° like the square isoclinic revolution, but it is completed in 6 chordal steps of 120° each rather than 8 chordal steps of 90° each.

...

== The 600-cell ==

...

== Finally the 120-cell ==

...

== Conclusions ==

Fontaine and Hurley's discovery is more than a formula for the reciprocal of a regular ''n''-polygon diagonal. It also yields the discrete sequence of isocline chords of the distinct isoclinic rotation characteristic of a ''d''-dimensional regular polytope. The characteristic rotational chord sequence of the ''d''-polytope can be represented geometrically in two dimensions on a distinct star polygon, but it lies on a geodesic circle through ''d''-dimensional space. Fontaine and Hurley discovered the geodesic topology of polytopes generally. Their procedure will reveal the geodesics of arbitrary non-uniform polytopes, since it can be applied to a polytope of any dimensionality and irregularity, by first fitting the polytope to the smallest regular polygon whose chords include its chords.

Fontaine and Hurley's discovery of a chordal formula for isoclinic rotations closes the circuit on Kappraff and Adamson's discovery of a rotational connection between dynamical systems, Steinbach's golden fields, and Coxeter's Euclidean geometry of ''n'' dimensions. Application of the Fontaine and Hurley procedure in higher-dimensional spaces demonstrates why the connection exists: because polytope sequences generally, from Steinbach's golden polygon chord sequences, to chord sequences in isoclinic rotation helixes, to subsumption relations in the sequence of regular 4-polytopes, arise as expressions of the reflections and rotations of distinct Coxeter symmetry groups, when those various groups interact.

== Appendix: Sequence of regular 4-polytopes ==
{{Regular convex 4-polytopes|wiki=W:|columns=7}}

== Notes ==
{{Notelist}}

== Citations ==
{{Reflist}}

== References ==
{{Refbegin}}
* {{Cite journal | last=Steinbach | first=Peter | year=1997 | title=Golden fields: A case for the Heptagon | journal=Mathematics Magazine | volume=70 | issue=Feb 1997 | pages=22–31 | doi=10.1080/0025570X.1997.11996494 | jstor=2691048 | ref={{SfnRef|Steinbach|1997}} }}
* {{Cite journal | last=Steinbach | first=Peter | year=2000 | title=Sections Beyond Golden| journal=Bridges: Mathematical Connections in Art, Music and Science | issue=2000 | pages=35-44 | url=https://archive.bridgesmathart.org/2000/bridges2000-35.pdf | ref={{SfnRef|Steinbach|2000}}}}
* {{Cite journal | last1=Kappraff | first1=Jay | last2=Jablan | first2=Slavik | last3=Adamson | first3=Gary | last4=Sazdanovich | first4=Radmila | year=2004 | title=Golden Fields, Generalized Fibonacci Sequences, and Chaotic Matrices | journal=Forma | volume=19 | pages=367-387 | url=https://archive.bridgesmathart.org/2005/bridges2005-369.pdf | ref={{SfnRef|Kappraff, Jablan, Adamson &amp; Sazdanovich|2004}} }}
* {{Cite journal | last1=Kappraff | first1=Jay | last2=Adamson | first2=Gary | year=2004 | title=Polygons and Chaos | journal=Dynamical Systems and Geometric Theories | url=https://archive.bridgesmathart.org/2001/bridges2001-67.pdf | ref={{SfnRef|Kappraff &amp; Adamson|2004}} }}
* {{Cite journal | last1=Fontaine | first1=Anne | last2=Hurley | first2=Susan | year=2006 | title=Proof by Picture: Products and Reciprocals of Diagonal Length Ratios in the Regular Polygon | journal=Forum Geometricorum | volume=6 | pages=97-101 | url=https://scispace.com/pdf/proof-by-picture-products-and-reciprocals-of-diagonal-length-1aian8mgp9.pdf }}
{{Refend}}</text>
      <sha1>2xhk6juo1p9q99g8y0ey8tqdg16wnd4</sha1>
    </revision>
    <revision>
      <id>2809779</id>
      <parentid>2809770</parentid>
      <timestamp>2026-05-17T00:12:42Z</timestamp>
      <contributor>
        <username>Dc.samizdat</username>
        <id>2856930</id>
      </contributor>
      <comment>/* The 8-point regular polytopes */</comment>
      <origin>2809779</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="46675" sha1="l7scyxbdp7138k9g6ntou7brp9nh66o" xml:space="preserve">{{align|center|David Brooks Christie}}
{{align|center|dc@samizdat.org}}
{{align|center|Draft in progress}}
{{align|center|January 2026 - April 2026}}

&lt;blockquote&gt;Steinbach discovered the formula for the ratios of diagonal to side in the regular polygons. Fontaine and Hurley extended this result, discovering a formula for the reciprocal of a regular polygon chord derived geometrically from the chord's star polygon. We observe that these findings in plane geometry apply more generally, to polytopes of any dimensionality. Fontaine and Hurley's geometric procedure for finding the reciprocals of the chords of a regular polygon from their star polygons also finds the rotational geodesics of any polytope of any dimensionality.&lt;/blockquote&gt;
== Introduction ==
Steinbach discovered the Diagonal Product Formula and the Golden Fields family of ratios of diagonal to side in the regular polygons. He showed how this family extends beyond the pentagon {5} with its well-known golden bisection proportional to 𝜙, finding that the heptagon {7} has an analogous trisection, the nonagon {9} has an analogous quadrasection, and the hendecagon {11} has an analogous pentasection, an extended family of golden proportions with quasiperiodic properties. 

Kappraff and Adamson extended these findings in plane geometry to a theory of Generalized Fibonacci Sequences, showing that the Golden Fields not only do not end with the hendecagon, they form an infinite number of periodic trajectories when operated on by the Mandelbrot operator. They found a relation between the edges of star polygons and dynamical systems in the state of chaos, revealing a connection between chaos theory, number, and rotations in Coxeter Euclidean geometry. 

Fontaine and Hurley examined Steinbach's finding that the length of each chord of a regular polygon is both the product of two chords and the sum of a set of smaller chords, so that in rotations to add is to multiply. They illustrated Steinbach's sets of additive chords lying parallel to each other in the plane (pointing in the same direction), and by applying Steinbach's formula more generally they found another summation relation of signed parallel chords (pointing in opposite directions) which relates each chord length to its reciprocal, and relates the summation to a distinct star polygon rotation. 

We examine these remarkable findings (which stem from study of the chords of humble regular polygons) in higher-dimensional spaces, specifically in the chords, polygons and rotations of the [[120-cell]], the largest four-dimensional regular convex polytope.

== Visualizing the 120-cell ==
{| class=&quot;wikitable floatright&quot; width=&quot;400&quot;
|style=&quot;vertical-align:top&quot;|[[File:120-cell.gif|200px]]&lt;br&gt;Orthographic projection of the 600-point 120-cell &lt;small&gt;&lt;math&gt;\{5,3,3\}&lt;/math&gt;&lt;/small&gt; performing a [[W:SO(4)#Geometry of 4D rotations|simple rotation]].{{Sfn|Hise|2011|loc=File:120-cell.gif|ps=; &quot;Created by Jason Hise with Maya and Macromedia Fireworks. A 3D projection of a 120-cell performing a [[W:SO(4)#Geometry of 4D rotations|simple rotation]].&quot;}} In this simplified rendering only the 120-cell's own edges are shown; its 29 interior chords are not rendered. Therefore even though it is translucent, only its outer surface is visible. The complex interior parts of the 120-cell, all its inscribed 5-cells, 16-cells, 8-cells, 24-cells, 600-cells and its much larger inventory of polyhedra, are completely invisible in this view, as none of their edges are rendered at all.
|style=&quot;vertical-align:top&quot;|[[File:Ortho solid 016-uniform polychoron p33-t0.png|200px]]&lt;br&gt;Orthographic projection of the 600-point [[W:Great grand stellated 120-cell|great grand stellated 120-cell]] &lt;small&gt;&lt;math&gt;\{\tfrac{5}{2},3,3\}&lt;/math&gt;&lt;/small&gt;.{{Sfn|Ruen: Great grand stellated 120-cell|2007}} The 120-cell is its convex hull. The projection to the left renders only the 120-cell's shortest chord, its 1200 edges. The projection above also renders only one of the 120-cell's 30 chords, the edges of its 120 inscribed regular 5-cells. The 120-cell itself (the convex hull) is invisible in this view, as its edges are not rendered.
|}

[[120-cell#Geometry|The 120-cell is the maximally complex regular 4-polytope]], containing inscribed instances of every regular 1-, 2-, 3-, and 4-polytope, except the regular polygons of more than {15} sides. 

The 120-cell is the convex hull of a regular [[120-cell#Relationships among interior polytopes|compound of each of the 6 regular convex 4-polytopes]]. They are the [[5-cell|5-point (5-cell) 4-simplex]], the [[16-cell|8-point (16-cell) 4-orthoplex]], the [[W:Tesseract|16-point (8-cell) tesseract]], the [[24-cell|24-point (24-cell)]], the [[600-cell|120-point (600-cell)]], and the [[120-cell|600-point (120-cell)]]. The 120-cell is the convex hull of a compound of 120 disjoint regular 5-cells, of 75 disjoint 16-cells, of 25 disjoint 24-cells, and of 5 disjoint 600-cells.

The 120-cell contains an even larger inventory of irregular polytopes, created by the intersection of multiple instances of these component regular 4-polytopes. Many are quite unexpected, because they do not occur as components of any regular polytope smaller than the 120-cell. As just one example among the [[120-cell#Concentric hulls|sections of the 120-cell]], there is an irregular 24-point polyhedron with 16 triangle faces and 4 nonagon {9} faces.{{Sfn|Moxness|}}

Most renderings of the 120-cell, like the rotating projection here, only illustrate its outer surface, which is a honeycomb of face-bonded dodecahedral cells. Only the objects in its 3-dimensional surface are rendered, namely the 120 dodecahedra, their pentagon faces, and their edges. Although the 120-cell has chords of 30 distinct lengths, in this kind of simplified rendering only the 120-cell's own edges (its shortest chord) are shown. Its 29 interior chords, the edges of objects in the interior of the 120-cell, are not rendered, so interior objects are not visible at all.

Visualizing the complete interior of the 600-vertex 120-cell in a single image is impractical because of its complexity. Only four 120-cell edges are incident at each vertex, but [[120-cell#Chords|600 chords (of all 30 lengths)]] are incident at ''each'' vertex.

== Compounds in the 120-cell ==
The 8-point (16-cell), not the 5-point (5-cell), is the smallest building block; it compounds to every larger regular 4-polytope. The 5-point (5-cell) does compound to the 600-point (120-cell), but it does not fit into any smaller regular 4-polytope. 

The 8-point (16-cell) compounds by 2 in the 16-point (8-cell), and by 3 in the 24-point (24-cell). The 16-point (8-cell) compounds in the 24-point (24-cell) by 3 non-disjoint instances of itself, with each of the 24 vertices shared by two 16-point (8-cells). The 24-point (24-cell) compounds by 5 disjoint instances of itself in the 120-point (600-cell), and the 120-point (600-cell) compounds by 5 disjoint instances of itself in the 600-point (120-cell).

The 24-point (24-cell) also compounds by &lt;math&gt;5^2&lt;/math&gt; non-disjoint instances of itself in the 120-point (600-cell); it compounds in 5 disjoint instances of itself, 10 (not 5) different ways. Whichever set of 5 disjoint 24-point (24-cells) are assembled, the resulting 120-point (600-cell) contains 25 distinct 24-point (24-cells), not just 5 (or 10). This implies that 15 disjoint 8-point (16-cells) will construct a 120-point (600-cell), which will contain 75 distinct 8-point (16-cells). 

The 600-point (120-cell) is 5 disjoint 120-point (600-cells), just 2 different ways (not 5 or 10 ways), so it is 10 distinct 120-point (600-cells). This implies that the 8-point (16-cell) compounds by 3 times &lt;math&gt;5^2&lt;/math&gt; (75) disjoint instances of itself in the 600-point (120-cell), which contains &lt;math&gt;3^2&lt;/math&gt; times  &lt;math&gt;5^2&lt;/math&gt; (225) distinct instances of the 24-point (24-cell), and  &lt;math&gt;3^3&lt;/math&gt; times &lt;math&gt;5^2&lt;/math&gt; (675) distinct instances of the 8-point (16-cell). 

These facts were discovered painstakingly by various researchers, and no one has found a general rule governing subsumption relations among regular polytopes. The reasons for some of their numeric incidence relations are far from obvious. [[W:Pieter Hendrik Schoute|Schoute]] was the first to see that the 120-point (600-cell) is a compound of 5 24-point (24-cells) ''10 different ways'', and after he saw it a hundred years lapsed until Denney, Hooker, Johnson, Robinson, Butler &amp; Claiborne proved his result, and showed why.{{Sfn|Denney, Hooker, Johnson, Robinson, Butler &amp; Claiborne|2020|loc=''The geometry of H4 polytopes''}}

So much for the compounds of 16-cells. The 120-cell is also the convex hull of the compound of 120 disjoint regular 5-cells. That stellated compound (without its convex hull of 120-cell edges) is the [[w:Great_grand_stellated_120-cell|great grand stellated 120-cell]] illustrated above, the final regular [[W:Stellation|stellation]] of the 120-cell, and the only [[W:Schläfli-Hess polychoron|regular star 4-polytope]] to have the 120-cell for its convex hull. The edges of the great grand stellated 120-cell are &lt;math&gt;\phi^6&lt;/math&gt; as long as those of its 120-cell [[W:List of polyhedral stellations#Stellation process|stellation core]] deep inside.

The compound of 120 disjoint 5-point (5-cells) can be seen to be equivalent to the compound of 5 disjoint 120-point (600-cells), as follows. Beginning with a single 120-point (600-cell), expand each vertex into a regular 5-cell, by adding 4 new equidistant vertices, such that the 5 vertices form a regular 5-cell inscribed in the 3-sphere. The 120 5-cells are disjoint, and the 600 vertices form 5 disjoint 120-point (600-cells): a 120-cell.

== Thirty distinguished distances ==
The 30 numbers listed in the table are all-important in Euclidean geometry. A case can be made on symmetry grounds that their squares are the 30 most important numbers between 0 and 4. The 30 rows of the table are the 30 distinct [[120-cell#Geodesic rectangles|chord lengths of the unit-radius 120-cell]], the largest regular convex 4-polytope. Since the 120-cell subsumes all smaller regular polytopes, its 30 chords are the complete chord set of all the regular polytopes that can be constructed in the first four dimensions of Euclidean space, except for regular polygons of more than 15 sides.

{| class=&quot;wikitable&quot; style=&quot;white-space:nowrap;text-align:center&quot;
!rowspan=2|&lt;math&gt;c_t&lt;/math&gt;
!rowspan=2|arc
!rowspan=2|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{n}\right\}&lt;/math&gt;&lt;/small&gt;
!rowspan=2|&lt;math&gt;\left\{p\right\}&lt;/math&gt;
!rowspan=2|&lt;small&gt;&lt;math&gt;m\left\{\frac{k}{d}\right\}&lt;/math&gt;&lt;/small&gt;
!rowspan=2|Steinbach roots
!colspan=7|Chord lengths of the unit 120-cell
|-
!colspan=5|unit-radius length &lt;math&gt;c_t&lt;/math&gt;
!colspan=2|unit-edge length &lt;math&gt;c_t/c_1&lt;/math&gt;&lt;br&gt;in 120-cell of radius &lt;math&gt;c_8=\sqrt{2}\phi^2&lt;/math&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{1,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;15.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{30\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{30\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;c_{4,1}-c_{2,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7-3 \sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.270091&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2} \phi ^2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2 \phi ^4}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.072949}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{2,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;25.2{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{2}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \left\{15\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(c_{18,1}-c_{4,1}\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{3-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.437016&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2} \phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2 \phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.190983}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.61803&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{3,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;36{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{10\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3 \left\{\frac{10}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(\sqrt{5}-1\right) c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(\sqrt{5}-1\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.618034&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{\phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.381966}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.28825&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{4,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;41.4{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{c_{8,1}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.707107&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.61803&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{5,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;44.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{4}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \left\{\frac{15}{2}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} c_{2,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{9-3 \sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.756934&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{\frac{3}{2}}}{\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2 \phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.572949}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} \phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.80252&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{6,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;49.1{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{17}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{5-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{5-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.831254&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt[4]{5} \sqrt{\frac{1}{\phi }}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\sqrt{5}}{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.690983}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\phi ^3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.07768&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{7,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;56.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{20}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{1}{\phi }} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{2}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.93913&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{\frac{\psi }{\phi }}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\psi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.881966}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\psi  \phi ^3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.47709&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;60{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{5}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{6\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{6\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.70246&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{9,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;66.1{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{40}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{1}{2 \phi }} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.09132&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{\frac{\chi }{\phi }}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\chi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.19098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\chi  \phi ^3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.04057&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{10,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;69.8{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{11}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi  c_{4,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1+\sqrt{5}}{2 \sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.14412&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\phi }{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\phi ^2}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.30902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^3&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.23607&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{11,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;72{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{6}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{5\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{5\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\frac{1}{\phi }} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\frac{2}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.17557&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3-\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3-\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.38197}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \sqrt{3-\phi } \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.3525&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{12,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;75.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{24}{5}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.22474&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.53457&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{13,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;81.1{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{13}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{9-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{9-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.30038&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{9-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(9-\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.69098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(9-\sqrt{5}\right)} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.8146&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{14,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;84.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{40}{9}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt[4]{5} \sqrt{\phi } c_{8,1}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt[4]{5} \sqrt{1+\sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.345&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt[4]{5} \sqrt{\phi }}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\sqrt{5} \phi }{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.80902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\phi ^5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.9798&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{15,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;90.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{4\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{4\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 c_{4,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.41421&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.23607&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{16,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;95.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{29}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{11-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.4802&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(11-\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.19098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(11-\sqrt{5}\right)} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.48037&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{17,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;98.9{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{31}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7+\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{7+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.51954&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{7+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(7+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.30902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\psi  \phi ^5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.62605&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{18,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;104.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{8}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{15}{4}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.58114&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{5} \sqrt{\phi ^4}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.8541&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{19,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;108.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{9}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{10}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;c_{3,1}+c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(1+\sqrt{5}\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.61803&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1+\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.61803}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \phi ^3&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.9907&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{20,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;110.2{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{13-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.64042&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(13-\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.69098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\phi ^2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.07359&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{21,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;113.9{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{19}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.67601&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.80902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\frac{\chi }{\phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.20537&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{22,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;120{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{10}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{3\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{3\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.73205&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{6} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.41285&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{23,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;124.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{41}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{\phi }+\frac{5}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{2}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.7658&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4-\frac{\psi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4-\frac{\psi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.11803}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\chi  \phi ^5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.53779&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{24,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;130.9{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{20}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{11+\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.81907&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(11+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.30902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\frac{\sqrt{5}}{\phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.73503&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{25,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;135.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{11}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{11}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7+3 \sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7+3 \sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.85123&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\phi ^2}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\phi ^4}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.42705}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^4&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.8541&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{26,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;138.6{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{12}{5}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.87083&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{7} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.92667&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{27,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;144{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{12}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{5}{2}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(5+\sqrt{5}\right)} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(5+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.90211&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\phi +2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2+\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.61803}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{2 \phi +4}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.0425&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{28,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;154.8{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{13}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{13}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{13+\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.95167&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(13+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.80902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\frac{1}{\phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.22598&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{29,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;164.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{14}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{15}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi  c_{12,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{\frac{3}{2}} \left(1+\sqrt{5}\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.98168&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}} \phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3 \phi ^2}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.92705}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} \phi ^3&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.33708&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{30,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;180{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{15}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{2\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{2\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \sqrt{2} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.40492&lt;/math&gt;&lt;/small&gt;
|-
|rowspan=4 colspan=6|
|rowspan=4 colspan=4|
&lt;small&gt;&lt;math&gt;\phi&lt;/math&gt;&lt;/small&gt; is the golden ratio:&lt;br&gt;
&lt;small&gt;&lt;math&gt;\phi ^2-\phi -1=0&lt;/math&gt;&lt;/small&gt;&lt;br&gt;
&lt;small&gt;&lt;math&gt;\frac{1}{\phi }+1=\phi&lt;/math&gt;&lt;/small&gt;, and: &lt;small&gt;&lt;math&gt;\phi+1=\phi^2&lt;/math&gt;&lt;/small&gt;&lt;br&gt;
&lt;small&gt;&lt;math&gt;\frac{1}{\phi }::1::\phi ::\phi ^2&lt;/math&gt;&lt;/small&gt;&lt;br&gt;
&lt;small&gt;&lt;math&gt;1/\phi&lt;/math&gt;&lt;/small&gt; and &lt;small&gt;&lt;math&gt;\phi&lt;/math&gt;&lt;/small&gt; are the golden sections of &lt;small&gt;&lt;math&gt;\sqrt{5}&lt;/math&gt;&lt;/small&gt;:&lt;br&gt;
&lt;small&gt;&lt;math&gt;\phi +\frac{1}{\phi }=\sqrt{5}&lt;/math&gt;&lt;/small&gt;
|colspan=2|&lt;small&gt;&lt;math&gt;\phi = (\sqrt{5} + 1)/2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.618034&lt;/math&gt;&lt;/small&gt;
|-
|colspan=2|&lt;small&gt;&lt;math&gt;\chi = (3\sqrt{5} + 1)/2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.854102&lt;/math&gt;&lt;/small&gt;
|-
|colspan=2|&lt;small&gt;&lt;math&gt;\psi = (3\sqrt{5} - 1)/2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.854102&lt;/math&gt;&lt;/small&gt;
|-
|colspan=2|&lt;small&gt;&lt;math&gt;\psi = 11/\chi = 22/(3\sqrt{5} + 1)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.854102&lt;/math&gt;&lt;/small&gt;
|}

...

== The 8-point regular polytopes ==
In 2-space we have the regular 8-point octagon, in 3-space the regular 8-point cube, and in 4-space the regular 8-point [[16-cell]].

A planar octagon with rigid edges of unit length has chords of length:

:&lt;math&gt;r_1=1,r_2=\sqrt{2+\sqrt{2}} \approx 1.84776,r_3=1+\sqrt{2} \approx 2.41421,r_4=\sqrt{4 + \sqrt{8}} \approx 2.61313&lt;/math&gt;

The chord ratio &lt;math&gt;r_3=1+\sqrt{2}&lt;/math&gt; is a geometrical proportion, the [[W:Silver ratio|silver ratio]]. Fontaine and Hurley's procedure for obtaining the reciprocal of a chord tells us that:

:&lt;math&gt;r_3-r_1-r_1=1/r_3 \approx 0.41421&lt;/math&gt;

Note that &lt;math&gt;1/r_3=\sqrt{2}-1=r_3-2&lt;/math&gt;.

If we embed this planar octagon in 3-space, we can make it skew, repositioning its vertices so that each is one unit-edge length distant from three others instead of two others, at the vertices of a unit-edge cube with chords of length:

:&lt;math&gt;r_1=1, r_2=\sqrt{2}, r_3=\sqrt{3}, r_4=\sqrt{2}&lt;/math&gt;

If we embed this cube in 4-space, we can skew it some more, repositioning its vertices so that each is one unit-edge length distant from six others instead of three others, at the vertices of a unit-edge 4-polytope with chords of length:

:&lt;math&gt;r_1=1,r_2=1,r_3=1,r_4=\sqrt{2}&lt;/math&gt;

All of its chords except its long diameters are the same unit length as its edge. In fact they are its 24 edges, and it is a 16-cell of radius &lt;small&gt;&lt;math&gt;1/\sqrt{2}&lt;/math&gt;&lt;/small&gt;.

[[File:octagon16cell.png|thumb|Orthogonal projection of a regular 16-cell to the [[16-cell#Projections|B&lt;sub&gt;4&lt;/sub&gt; Coxeter plane]]. Only its edges are shown; its long diameter chords are not drawn. All 24 edges are the same length. Only the edges of the two disjoint squares lie parallel to the projection plane, in completely orthogonal central planes.]]

The [[16-cell]] is the [[W:Regular convex 4-polytope|regular convex 4-polytope]] with [[W:Schläfli symbol|Schläfli symbol]] {3,3,4}. It has 8 vertices, 24 edges, 32 equilateral triangle faces, and 16 regular tetrahedron cells. It is the [[16-cell#Octahedral dipyramid|four-dimensional analogue of the octahedron]], and each of its four orthogonal central hyperplanes is an octahedron.

The only planar regular polygons found in the 16-cell are face triangles and central plane squares, but the 16-cell also contains a skew regular octagon, its [[W:Petrie polygon|Petrie polygon]]. The chords of this regular octagon, which lies skew in 4-space, are those given above for the 16-cell, as opposed to those for the cube or the regular octagon in the plane. The 16-cell is a construct of 3 Petrie octagons which share the same 8 vertices but have disjoint sets of 8 edges each.

The regular octad has higher symmetry in 4-space than it does in 2-space. The 16-cell is the 4-orthoplex, the simplest regular 4-polytope after the [[5-cell|4-simplex]]. All the larger regular 4-polytopes, including the 120-cell, are compounds of the 16-cell. The regular octagon exhibits this high symmetry only when embedded in 4-space at the vertices of the 16-cell.

The 16-cell constitutes an [[W:Orthonormal basis|orthonormal basis]] for the choice of a 4-dimensional Cartesian reference frame, because its vertices define four orthogonal axes. The eight vertices of a unit-radius 16-cell are (±1, 0, 0, 0), (0, ±1, 0, 0), (0, 0, ±1, 0), (0, 0, 0, ±1). All vertices are connected by &lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt; edges except opposite pairs. 

The vertex coordinates of the 16-cell form 6 central squares lying in 6 pairwise [[W:Orthogonal|orthogonal]] coordinate planes. Great squares in ''opposite'' planes that do not share an axis (e.g. in the ''xy'' and ''wz'' planes) are completely disjoint (they do not intersect at any vertices). These planes are [[W:Completely orthogonal|completely orthogonal]].{{Efn|name=Six orthogonal planes of the Cartesian basis}}

Since this unit-radius coordinate system is convenient, let us derive the unit-radius 16-cell by skewing a unit-radius planar octagon, which has chords of length:

:&lt;math&gt;r_1=\sqrt{2-\sqrt{2}} \approx 0.76537,r_2=\sqrt{2},r_3=\sqrt{2+\sqrt{2}} \approx 1.84776,r_4=2&lt;/math&gt;

We will need a planar octagon with rigid &lt;math&gt;r_2&lt;/math&gt; chords, rather than one with rigid &lt;math&gt;r_1&lt;/math&gt; edges. The octagon's &lt;math&gt;r_2&lt;/math&gt; chords form two disjoint great squares, visible in the orthogonal projection, which we can reposition in 3-space to form a cube by making them parallel, and in 4-space to form a 16-cell by making them completely orthogonal.

In the 16-cell the two disjoint great squares are both parallel and perpendicular to each other. A ''simple'' rotation of the 16-cell in ''one'' of those two central planes rotates that square like a wheel, while the other square does not move. The four vertices of the rotating square orbit on a great circle.

The &lt;math&gt;r_1&lt;/math&gt; chords form a Petrie polygon which zig-zags back and forth between the two completely orthogonal &lt;math&gt;r_2&lt;/math&gt; squares.

The &lt;math&gt;r_3&lt;/math&gt; chords form a circular helix, visible as a skew {8/3} polygram in the orthogonal projection. A ''double'' rotation of the 16-cell, in ''both'' of the two completely orthogonal &lt;math&gt;r_2&lt;/math&gt; central square planes at once, moves the vertices along the circular helix over the &lt;math&gt;r_3&lt;/math&gt; chords.

[[W:Rotations in 4-dimensional Euclidean space|Rotations in 4-dimensional Euclidean space]] can be seen as the composition of two 2-dimensional rotations in completely orthogonal planes. The general rotation in 4-space is a double rotation in pairs of completely orthogonal planes. Two completely orthogonal planes are called invariant planes of the rotation when all points in the plane rotate on circles that remain in the plane, even as the whole plane tilts sideways (like a coin flipping) into another plane. The two completely orthogonal rotations of each plane (like a wheel, and like a coin flipping) are simultaneous but independent, in that they are not geometrically constrained to turn at the same rate. However, the most circular kind of rotation (as opposed to an elliptical double rotation of a rigid spherical object) occurs when the invariant planes do rotate through the same angle in the same time interval. Such equi-angled double rotations are called [[w:SO(4)#Isoclinic_rotations|isoclinic]], also [[w:William_Kingdon_Clifford|Clifford]] displacements.

The 16-cell is the simplest possible frame in which to [[16-cell#Rotations|observe 4-dimensional rotations]] because its characteristic isoclinic rotations feature a single pair of invariant rotation planes. In the 16-cell an isoclinic rotation by 90° in any pair of invariant completely orthogonal square central planes takes every square central plane to its completely orthogonal square central plane in a twisting displacment, as they tilt sideways 90° into each other's plane while rotating 90° internally. All the vertices move at once on separate circular [[w:Geodesic|geodesics]], displaced 90° in 8 orthogonal directions, and the rigid 16-cell assumes a new orientation in 4-space. When the 90° isoclinic rotation is continued in the same rotational direction through an additional 90°, each vertex is again displaced 90°, but from the new orientation in a direction orthogonal to its first 90° displacement. After 360° of rotation each vertex reaches its antipodal position.

The trajectory of each vertex over each 90° isoclinic rotational displacement is a one-eighth segment of its geodesic orbit. Its entire orbit traces a circular helix in 4-space over eight &lt;math&gt;r_3&lt;/math&gt; chords, and also traces a great circle twice over the four &lt;math&gt;r_2&lt;/math&gt; chords of one of the two moving invariant rotation planes. In the course of a 720° isoclinic rotation each vertex departs from all 8 vertex positions just once and returns to its original position, and the 16-cell returns to its original orientation.

== Hypercubes ==
The long diameter of the unit-edge [[W:Hypercube|hypercube]] of dimension &lt;small&gt;&lt;math&gt;n&lt;/math&gt;&lt;/small&gt; is &lt;small&gt;&lt;math&gt;\sqrt{n}&lt;/math&gt;&lt;/small&gt;, so the unit-edge [[w:Tesseract|4-hypercube, the 16-point (8-cell) tesseract,]] has chords:
:&lt;math&gt;r_1=\sqrt{1},r_2=\sqrt{2},r_3=\sqrt{3},r_4=\sqrt{4}&lt;/math&gt;
Uniquely in its 4-dimensional case, the hypercube's edge length equals its radius, like the hexagon. We call such polytopes ''radially equilateral'', because they can be constructed from equilateral triangles which meet at their center, each contributing two radii and an edge. The cuboctahedron and the 24-cell are also radially equilateral.

The [[W:Tesseract|tesseract]] is the [[W:Regular convex 4-polytope|regular convex 4-polytope]] with [[W:Schläfli symbol|Schläfli symbol]] {4,3,3}. It has 16 vertices, 32 edges, 24 square faces, and 8 cube cells. It is the four-dimensional analogue of the cube.

The tesseract is the [[W:Dual polytope|dual polytope]] of the 16-cell. They have the same Petrie polygon, the regular octagon, but the tesseract contains 2 disjoint instances and 4 distinct instances of the skew octagon. We can construct the tesseract by skewing two planar octagons. Because the tesseract is radially equilateral (unlike the 16-cell), we start with our original octagon of unit-edge length, rather than the octagon of edge length &lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt; that we needed to build the unit-radius 16-cell.

For our tesseract construction we skew each planar octagon into a cube, so we have a compound of two completely orthogonal cubes. Provided the planes were completely orthogonal in 4-space and we skewed them both the same way, the 16 vertices will be the vertices of a tesseract with half of its 32 edges missing.

The 16-point tesseract is the convex hull of a compound of two 8-point 16-cells, in exact dimensional analogy to the way the 8-point cube is the convex hull of a [[W:Stellated octahedron|compound of two regular 4-point tetrahedra]]. The [[W:Demihypercube|demihypercubes]] occupy alternate vertices of the hypercubes. The diagonals of the square faces of the unit-radius tesseract are the &lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt; edges of two unit-radius 16-cells, which are also the edges of the square central planes.

Because the tesseract contains two 16-cells in alternate positions it has two sets of 6 orthogonal square central planes. Two angles are required to specify the relationship between two planes in 4-space. Pairs of planes within each 16-cell are 90° apart in one angle, and either 0° or 90° apart in the other angle. They are 90° apart in both angles if and only if they are completely orthogonal planes, 90° apart by isoclinic rotation, with no vertices in common and their corresponding vertices 180° apart. Otherwise they are 0° apart in one of the angles, 90° apart by simple rotation with their corresponding vertices 90° apart, and they intersect in one axis and lie in a common 3-dimensional hyperplane.{{Efn|A double rotation in which one of the two angles of rotation is 0°, so that one of the completely orthogonal invariant planes does not rotate, is called a simple rotation. Ordinary rotations observed in a 3-dimensional space are simple rotations.}}

A pair of square central planes from alternate 16-cells are 60° apart by isoclinic rotation, with their corresponding vertices 120° apart. The planes are not orthogonal or parallel, so they intersect in a line somewhere, but they have no vertices in common, they have no 3-dimensional hyperplane in common, and they cannot reach each other by simple rotation. Such pairs of objects are called [[W:Clifford parallel|Clifford parallel]] because all their corresponding pairs of vertices are the same distance apart, although they are not parallel in the usual sense, because they have a common center. Not only the alternate 16-cells' corresponding square central planes, but also the 16-cells themselves, are Clifford parallel objects.

We can rotate the tesseract isoclinically the way we rotated the 16-cell, by 90° in two completely orthogonal invariant square central planes, with the same effect on both alternate 16-cells. In the course of a 720° isoclinic rotation in invariant square central planes each vertex departs from all 8 vertex positions of its 16-cell just once and returns to its original position, but it does not visit the vertex positions of the other 16-cell. The skew octagon geodesic orbits of the 16 vertices are disjoint circular helixes, and those 16 circular helixes are Clifford parallel objects.

== The 24-cell ==
In 2-space we have the radially equilateral 6-point hexagon. In 3-space we have the radially equilateral 12-point cuboctahedron, with 4 hexagonal central planes. In 4-space we have the radially equilateral 24-point 24-cell, with 4 cuboctahedral central hyperplanes and 16 hexagonal central planes.

Great hexagons are a rounder choice than great squares for the invariant rotation planes in which to rotate a 4-polytope isoclinically. The complete hexagonal isoclinic revolution requires 720° like the square isoclinic revolution, but it is completed in 6 chordal steps of 120° each rather than 8 chordal steps of 90° each.

...

== The 600-cell ==

...

== Finally the 120-cell ==

...

== Conclusions ==

Fontaine and Hurley's discovery is more than a formula for the reciprocal of a regular ''n''-polygon diagonal. It also yields the discrete sequence of isocline chords of the distinct isoclinic rotation characteristic of a ''d''-dimensional regular polytope. The characteristic rotational chord sequence of the ''d''-polytope can be represented geometrically in two dimensions on a distinct star polygon, but it lies on a geodesic circle through ''d''-dimensional space. Fontaine and Hurley discovered the geodesic topology of polytopes generally. Their procedure will reveal the geodesics of arbitrary non-uniform polytopes, since it can be applied to a polytope of any dimensionality and irregularity, by first fitting the polytope to the smallest regular polygon whose chords include its chords.

Fontaine and Hurley's discovery of a chordal formula for isoclinic rotations closes the circuit on Kappraff and Adamson's discovery of a rotational connection between dynamical systems, Steinbach's golden fields, and Coxeter's Euclidean geometry of ''n'' dimensions. Application of the Fontaine and Hurley procedure in higher-dimensional spaces demonstrates why the connection exists: because polytope sequences generally, from Steinbach's golden polygon chord sequences, to chord sequences in isoclinic rotation helixes, to subsumption relations in the sequence of regular 4-polytopes, arise as expressions of the reflections and rotations of distinct Coxeter symmetry groups, when those various groups interact.

== Appendix: Sequence of regular 4-polytopes ==
{{Regular convex 4-polytopes|wiki=W:|columns=7}}

== Notes ==
{{Notelist}}

== Citations ==
{{Reflist}}

== References ==
{{Refbegin}}
* {{Cite journal | last=Steinbach | first=Peter | year=1997 | title=Golden fields: A case for the Heptagon | journal=Mathematics Magazine | volume=70 | issue=Feb 1997 | pages=22–31 | doi=10.1080/0025570X.1997.11996494 | jstor=2691048 | ref={{SfnRef|Steinbach|1997}} }}
* {{Cite journal | last=Steinbach | first=Peter | year=2000 | title=Sections Beyond Golden| journal=Bridges: Mathematical Connections in Art, Music and Science | issue=2000 | pages=35-44 | url=https://archive.bridgesmathart.org/2000/bridges2000-35.pdf | ref={{SfnRef|Steinbach|2000}}}}
* {{Cite journal | last1=Kappraff | first1=Jay | last2=Jablan | first2=Slavik | last3=Adamson | first3=Gary | last4=Sazdanovich | first4=Radmila | year=2004 | title=Golden Fields, Generalized Fibonacci Sequences, and Chaotic Matrices | journal=Forma | volume=19 | pages=367-387 | url=https://archive.bridgesmathart.org/2005/bridges2005-369.pdf | ref={{SfnRef|Kappraff, Jablan, Adamson &amp; Sazdanovich|2004}} }}
* {{Cite journal | last1=Kappraff | first1=Jay | last2=Adamson | first2=Gary | year=2004 | title=Polygons and Chaos | journal=Dynamical Systems and Geometric Theories | url=https://archive.bridgesmathart.org/2001/bridges2001-67.pdf | ref={{SfnRef|Kappraff &amp; Adamson|2004}} }}
* {{Cite journal | last1=Fontaine | first1=Anne | last2=Hurley | first2=Susan | year=2006 | title=Proof by Picture: Products and Reciprocals of Diagonal Length Ratios in the Regular Polygon | journal=Forum Geometricorum | volume=6 | pages=97-101 | url=https://scispace.com/pdf/proof-by-picture-products-and-reciprocals-of-diagonal-length-1aian8mgp9.pdf }}
{{Refend}}</text>
      <sha1>l7scyxbdp7138k9g6ntou7brp9nh66o</sha1>
    </revision>
    <revision>
      <id>2809780</id>
      <parentid>2809779</parentid>
      <timestamp>2026-05-17T00:17:39Z</timestamp>
      <contributor>
        <username>Dc.samizdat</username>
        <id>2856930</id>
      </contributor>
      <comment>/* The 8-point regular polytopes */</comment>
      <origin>2809780</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="46743" sha1="80q5ea0sd4ih9pvkrz2ayjmupl5r8cw" xml:space="preserve">{{align|center|David Brooks Christie}}
{{align|center|dc@samizdat.org}}
{{align|center|Draft in progress}}
{{align|center|January 2026 - April 2026}}

&lt;blockquote&gt;Steinbach discovered the formula for the ratios of diagonal to side in the regular polygons. Fontaine and Hurley extended this result, discovering a formula for the reciprocal of a regular polygon chord derived geometrically from the chord's star polygon. We observe that these findings in plane geometry apply more generally, to polytopes of any dimensionality. Fontaine and Hurley's geometric procedure for finding the reciprocals of the chords of a regular polygon from their star polygons also finds the rotational geodesics of any polytope of any dimensionality.&lt;/blockquote&gt;
== Introduction ==
Steinbach discovered the Diagonal Product Formula and the Golden Fields family of ratios of diagonal to side in the regular polygons. He showed how this family extends beyond the pentagon {5} with its well-known golden bisection proportional to 𝜙, finding that the heptagon {7} has an analogous trisection, the nonagon {9} has an analogous quadrasection, and the hendecagon {11} has an analogous pentasection, an extended family of golden proportions with quasiperiodic properties. 

Kappraff and Adamson extended these findings in plane geometry to a theory of Generalized Fibonacci Sequences, showing that the Golden Fields not only do not end with the hendecagon, they form an infinite number of periodic trajectories when operated on by the Mandelbrot operator. They found a relation between the edges of star polygons and dynamical systems in the state of chaos, revealing a connection between chaos theory, number, and rotations in Coxeter Euclidean geometry. 

Fontaine and Hurley examined Steinbach's finding that the length of each chord of a regular polygon is both the product of two chords and the sum of a set of smaller chords, so that in rotations to add is to multiply. They illustrated Steinbach's sets of additive chords lying parallel to each other in the plane (pointing in the same direction), and by applying Steinbach's formula more generally they found another summation relation of signed parallel chords (pointing in opposite directions) which relates each chord length to its reciprocal, and relates the summation to a distinct star polygon rotation. 

We examine these remarkable findings (which stem from study of the chords of humble regular polygons) in higher-dimensional spaces, specifically in the chords, polygons and rotations of the [[120-cell]], the largest four-dimensional regular convex polytope.

== Visualizing the 120-cell ==
{| class=&quot;wikitable floatright&quot; width=&quot;400&quot;
|style=&quot;vertical-align:top&quot;|[[File:120-cell.gif|200px]]&lt;br&gt;Orthographic projection of the 600-point 120-cell &lt;small&gt;&lt;math&gt;\{5,3,3\}&lt;/math&gt;&lt;/small&gt; performing a [[W:SO(4)#Geometry of 4D rotations|simple rotation]].{{Sfn|Hise|2011|loc=File:120-cell.gif|ps=; &quot;Created by Jason Hise with Maya and Macromedia Fireworks. A 3D projection of a 120-cell performing a [[W:SO(4)#Geometry of 4D rotations|simple rotation]].&quot;}} In this simplified rendering only the 120-cell's own edges are shown; its 29 interior chords are not rendered. Therefore even though it is translucent, only its outer surface is visible. The complex interior parts of the 120-cell, all its inscribed 5-cells, 16-cells, 8-cells, 24-cells, 600-cells and its much larger inventory of polyhedra, are completely invisible in this view, as none of their edges are rendered at all.
|style=&quot;vertical-align:top&quot;|[[File:Ortho solid 016-uniform polychoron p33-t0.png|200px]]&lt;br&gt;Orthographic projection of the 600-point [[W:Great grand stellated 120-cell|great grand stellated 120-cell]] &lt;small&gt;&lt;math&gt;\{\tfrac{5}{2},3,3\}&lt;/math&gt;&lt;/small&gt;.{{Sfn|Ruen: Great grand stellated 120-cell|2007}} The 120-cell is its convex hull. The projection to the left renders only the 120-cell's shortest chord, its 1200 edges. The projection above also renders only one of the 120-cell's 30 chords, the edges of its 120 inscribed regular 5-cells. The 120-cell itself (the convex hull) is invisible in this view, as its edges are not rendered.
|}

[[120-cell#Geometry|The 120-cell is the maximally complex regular 4-polytope]], containing inscribed instances of every regular 1-, 2-, 3-, and 4-polytope, except the regular polygons of more than {15} sides. 

The 120-cell is the convex hull of a regular [[120-cell#Relationships among interior polytopes|compound of each of the 6 regular convex 4-polytopes]]. They are the [[5-cell|5-point (5-cell) 4-simplex]], the [[16-cell|8-point (16-cell) 4-orthoplex]], the [[W:Tesseract|16-point (8-cell) tesseract]], the [[24-cell|24-point (24-cell)]], the [[600-cell|120-point (600-cell)]], and the [[120-cell|600-point (120-cell)]]. The 120-cell is the convex hull of a compound of 120 disjoint regular 5-cells, of 75 disjoint 16-cells, of 25 disjoint 24-cells, and of 5 disjoint 600-cells.

The 120-cell contains an even larger inventory of irregular polytopes, created by the intersection of multiple instances of these component regular 4-polytopes. Many are quite unexpected, because they do not occur as components of any regular polytope smaller than the 120-cell. As just one example among the [[120-cell#Concentric hulls|sections of the 120-cell]], there is an irregular 24-point polyhedron with 16 triangle faces and 4 nonagon {9} faces.{{Sfn|Moxness|}}

Most renderings of the 120-cell, like the rotating projection here, only illustrate its outer surface, which is a honeycomb of face-bonded dodecahedral cells. Only the objects in its 3-dimensional surface are rendered, namely the 120 dodecahedra, their pentagon faces, and their edges. Although the 120-cell has chords of 30 distinct lengths, in this kind of simplified rendering only the 120-cell's own edges (its shortest chord) are shown. Its 29 interior chords, the edges of objects in the interior of the 120-cell, are not rendered, so interior objects are not visible at all.

Visualizing the complete interior of the 600-vertex 120-cell in a single image is impractical because of its complexity. Only four 120-cell edges are incident at each vertex, but [[120-cell#Chords|600 chords (of all 30 lengths)]] are incident at ''each'' vertex.

== Compounds in the 120-cell ==
The 8-point (16-cell), not the 5-point (5-cell), is the smallest building block; it compounds to every larger regular 4-polytope. The 5-point (5-cell) does compound to the 600-point (120-cell), but it does not fit into any smaller regular 4-polytope. 

The 8-point (16-cell) compounds by 2 in the 16-point (8-cell), and by 3 in the 24-point (24-cell). The 16-point (8-cell) compounds in the 24-point (24-cell) by 3 non-disjoint instances of itself, with each of the 24 vertices shared by two 16-point (8-cells). The 24-point (24-cell) compounds by 5 disjoint instances of itself in the 120-point (600-cell), and the 120-point (600-cell) compounds by 5 disjoint instances of itself in the 600-point (120-cell).

The 24-point (24-cell) also compounds by &lt;math&gt;5^2&lt;/math&gt; non-disjoint instances of itself in the 120-point (600-cell); it compounds in 5 disjoint instances of itself, 10 (not 5) different ways. Whichever set of 5 disjoint 24-point (24-cells) are assembled, the resulting 120-point (600-cell) contains 25 distinct 24-point (24-cells), not just 5 (or 10). This implies that 15 disjoint 8-point (16-cells) will construct a 120-point (600-cell), which will contain 75 distinct 8-point (16-cells). 

The 600-point (120-cell) is 5 disjoint 120-point (600-cells), just 2 different ways (not 5 or 10 ways), so it is 10 distinct 120-point (600-cells). This implies that the 8-point (16-cell) compounds by 3 times &lt;math&gt;5^2&lt;/math&gt; (75) disjoint instances of itself in the 600-point (120-cell), which contains &lt;math&gt;3^2&lt;/math&gt; times  &lt;math&gt;5^2&lt;/math&gt; (225) distinct instances of the 24-point (24-cell), and  &lt;math&gt;3^3&lt;/math&gt; times &lt;math&gt;5^2&lt;/math&gt; (675) distinct instances of the 8-point (16-cell). 

These facts were discovered painstakingly by various researchers, and no one has found a general rule governing subsumption relations among regular polytopes. The reasons for some of their numeric incidence relations are far from obvious. [[W:Pieter Hendrik Schoute|Schoute]] was the first to see that the 120-point (600-cell) is a compound of 5 24-point (24-cells) ''10 different ways'', and after he saw it a hundred years lapsed until Denney, Hooker, Johnson, Robinson, Butler &amp; Claiborne proved his result, and showed why.{{Sfn|Denney, Hooker, Johnson, Robinson, Butler &amp; Claiborne|2020|loc=''The geometry of H4 polytopes''}}

So much for the compounds of 16-cells. The 120-cell is also the convex hull of the compound of 120 disjoint regular 5-cells. That stellated compound (without its convex hull of 120-cell edges) is the [[w:Great_grand_stellated_120-cell|great grand stellated 120-cell]] illustrated above, the final regular [[W:Stellation|stellation]] of the 120-cell, and the only [[W:Schläfli-Hess polychoron|regular star 4-polytope]] to have the 120-cell for its convex hull. The edges of the great grand stellated 120-cell are &lt;math&gt;\phi^6&lt;/math&gt; as long as those of its 120-cell [[W:List of polyhedral stellations#Stellation process|stellation core]] deep inside.

The compound of 120 disjoint 5-point (5-cells) can be seen to be equivalent to the compound of 5 disjoint 120-point (600-cells), as follows. Beginning with a single 120-point (600-cell), expand each vertex into a regular 5-cell, by adding 4 new equidistant vertices, such that the 5 vertices form a regular 5-cell inscribed in the 3-sphere. The 120 5-cells are disjoint, and the 600 vertices form 5 disjoint 120-point (600-cells): a 120-cell.

== Thirty distinguished distances ==
The 30 numbers listed in the table are all-important in Euclidean geometry. A case can be made on symmetry grounds that their squares are the 30 most important numbers between 0 and 4. The 30 rows of the table are the 30 distinct [[120-cell#Geodesic rectangles|chord lengths of the unit-radius 120-cell]], the largest regular convex 4-polytope. Since the 120-cell subsumes all smaller regular polytopes, its 30 chords are the complete chord set of all the regular polytopes that can be constructed in the first four dimensions of Euclidean space, except for regular polygons of more than 15 sides.

{| class=&quot;wikitable&quot; style=&quot;white-space:nowrap;text-align:center&quot;
!rowspan=2|&lt;math&gt;c_t&lt;/math&gt;
!rowspan=2|arc
!rowspan=2|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{n}\right\}&lt;/math&gt;&lt;/small&gt;
!rowspan=2|&lt;math&gt;\left\{p\right\}&lt;/math&gt;
!rowspan=2|&lt;small&gt;&lt;math&gt;m\left\{\frac{k}{d}\right\}&lt;/math&gt;&lt;/small&gt;
!rowspan=2|Steinbach roots
!colspan=7|Chord lengths of the unit 120-cell
|-
!colspan=5|unit-radius length &lt;math&gt;c_t&lt;/math&gt;
!colspan=2|unit-edge length &lt;math&gt;c_t/c_1&lt;/math&gt;&lt;br&gt;in 120-cell of radius &lt;math&gt;c_8=\sqrt{2}\phi^2&lt;/math&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{1,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;15.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{30\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{30\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;c_{4,1}-c_{2,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7-3 \sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.270091&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2} \phi ^2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2 \phi ^4}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.072949}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{2,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;25.2{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{2}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \left\{15\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(c_{18,1}-c_{4,1}\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{3-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.437016&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2} \phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2 \phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.190983}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.61803&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{3,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;36{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{10\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3 \left\{\frac{10}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(\sqrt{5}-1\right) c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(\sqrt{5}-1\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.618034&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{\phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.381966}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.28825&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{4,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;41.4{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{c_{8,1}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.707107&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.61803&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{5,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;44.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{4}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \left\{\frac{15}{2}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} c_{2,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{9-3 \sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.756934&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{\frac{3}{2}}}{\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2 \phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.572949}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} \phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.80252&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{6,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;49.1{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{17}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{5-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{5-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.831254&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt[4]{5} \sqrt{\frac{1}{\phi }}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\sqrt{5}}{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.690983}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\phi ^3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.07768&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{7,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;56.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{20}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{1}{\phi }} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{2}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.93913&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{\frac{\psi }{\phi }}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\psi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.881966}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\psi  \phi ^3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.47709&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;60{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{5}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{6\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{6\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.70246&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{9,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;66.1{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{40}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{1}{2 \phi }} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.09132&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{\frac{\chi }{\phi }}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\chi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.19098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\chi  \phi ^3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.04057&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{10,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;69.8{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{11}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi  c_{4,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1+\sqrt{5}}{2 \sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.14412&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\phi }{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\phi ^2}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.30902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^3&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.23607&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{11,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;72{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{6}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{5\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{5\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\frac{1}{\phi }} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\frac{2}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.17557&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3-\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3-\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.38197}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \sqrt{3-\phi } \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.3525&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{12,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;75.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{24}{5}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.22474&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.53457&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{13,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;81.1{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{13}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{9-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{9-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.30038&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{9-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(9-\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.69098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(9-\sqrt{5}\right)} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.8146&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{14,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;84.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{40}{9}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt[4]{5} \sqrt{\phi } c_{8,1}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt[4]{5} \sqrt{1+\sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.345&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt[4]{5} \sqrt{\phi }}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\sqrt{5} \phi }{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.80902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\phi ^5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.9798&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{15,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;90.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{4\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{4\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 c_{4,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.41421&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.23607&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{16,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;95.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{29}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{11-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.4802&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(11-\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.19098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(11-\sqrt{5}\right)} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.48037&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{17,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;98.9{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{31}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7+\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{7+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.51954&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{7+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(7+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.30902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\psi  \phi ^5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.62605&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{18,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;104.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{8}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{15}{4}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.58114&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{5} \sqrt{\phi ^4}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.8541&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{19,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;108.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{9}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{10}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;c_{3,1}+c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(1+\sqrt{5}\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.61803&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1+\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.61803}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \phi ^3&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.9907&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{20,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;110.2{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{13-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.64042&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(13-\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.69098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\phi ^2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.07359&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{21,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;113.9{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{19}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.67601&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.80902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\frac{\chi }{\phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.20537&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{22,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;120{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{10}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{3\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{3\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.73205&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{6} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.41285&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{23,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;124.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{41}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{\phi }+\frac{5}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{2}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.7658&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4-\frac{\psi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4-\frac{\psi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.11803}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\chi  \phi ^5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.53779&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{24,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;130.9{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{20}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{11+\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.81907&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(11+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.30902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\frac{\sqrt{5}}{\phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.73503&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{25,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;135.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{11}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{11}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7+3 \sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7+3 \sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.85123&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\phi ^2}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\phi ^4}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.42705}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^4&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.8541&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{26,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;138.6{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{12}{5}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.87083&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{7} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.92667&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{27,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;144{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{12}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{5}{2}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(5+\sqrt{5}\right)} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(5+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.90211&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\phi +2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2+\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.61803}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{2 \phi +4}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.0425&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{28,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;154.8{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{13}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{13}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{13+\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.95167&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(13+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.80902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\frac{1}{\phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.22598&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{29,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;164.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{14}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{15}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi  c_{12,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{\frac{3}{2}} \left(1+\sqrt{5}\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.98168&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}} \phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3 \phi ^2}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.92705}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} \phi ^3&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.33708&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{30,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;180{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{15}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{2\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{2\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \sqrt{2} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.40492&lt;/math&gt;&lt;/small&gt;
|-
|rowspan=4 colspan=6|
|rowspan=4 colspan=4|
&lt;small&gt;&lt;math&gt;\phi&lt;/math&gt;&lt;/small&gt; is the golden ratio:&lt;br&gt;
&lt;small&gt;&lt;math&gt;\phi ^2-\phi -1=0&lt;/math&gt;&lt;/small&gt;&lt;br&gt;
&lt;small&gt;&lt;math&gt;\frac{1}{\phi }+1=\phi&lt;/math&gt;&lt;/small&gt;, and: &lt;small&gt;&lt;math&gt;\phi+1=\phi^2&lt;/math&gt;&lt;/small&gt;&lt;br&gt;
&lt;small&gt;&lt;math&gt;\frac{1}{\phi }::1::\phi ::\phi ^2&lt;/math&gt;&lt;/small&gt;&lt;br&gt;
&lt;small&gt;&lt;math&gt;1/\phi&lt;/math&gt;&lt;/small&gt; and &lt;small&gt;&lt;math&gt;\phi&lt;/math&gt;&lt;/small&gt; are the golden sections of &lt;small&gt;&lt;math&gt;\sqrt{5}&lt;/math&gt;&lt;/small&gt;:&lt;br&gt;
&lt;small&gt;&lt;math&gt;\phi +\frac{1}{\phi }=\sqrt{5}&lt;/math&gt;&lt;/small&gt;
|colspan=2|&lt;small&gt;&lt;math&gt;\phi = (\sqrt{5} + 1)/2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.618034&lt;/math&gt;&lt;/small&gt;
|-
|colspan=2|&lt;small&gt;&lt;math&gt;\chi = (3\sqrt{5} + 1)/2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.854102&lt;/math&gt;&lt;/small&gt;
|-
|colspan=2|&lt;small&gt;&lt;math&gt;\psi = (3\sqrt{5} - 1)/2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.854102&lt;/math&gt;&lt;/small&gt;
|-
|colspan=2|&lt;small&gt;&lt;math&gt;\psi = 11/\chi = 22/(3\sqrt{5} + 1)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.854102&lt;/math&gt;&lt;/small&gt;
|}

...

== The 8-point regular polytopes ==
In 2-space we have the regular 8-point octagon, in 3-space the regular 8-point cube, and in 4-space the regular 8-point [[16-cell]].

A planar octagon with rigid edges of unit length has chords of length:

:&lt;math&gt;r_1=1,r_2=\sqrt{2+\sqrt{2}} \approx 1.84776,r_3=1+\sqrt{2} \approx 2.41421,r_4=\sqrt{4 + \sqrt{8}} \approx 2.61313&lt;/math&gt;

The chord ratio &lt;math&gt;r_3=1+\sqrt{2}&lt;/math&gt; is a geometrical proportion, the [[W:Silver ratio|silver ratio]]. Fontaine and Hurley's procedure for obtaining the reciprocal of a chord tells us that:

:&lt;math&gt;r_3-r_1-r_1=1/r_3 \approx 0.41421&lt;/math&gt;

Note that &lt;math&gt;1/r_3=\sqrt{2}-1=r_3-2&lt;/math&gt;.

If we embed this planar octagon in 3-space, we can make it skew, repositioning its vertices so that each is one unit-edge length distant from three others instead of two others, at the vertices of a unit-edge cube with chords of length:

:&lt;math&gt;r_1=1, r_2=\sqrt{2}, r_3=\sqrt{3}, r_4=\sqrt{2}&lt;/math&gt;

If we embed this cube in 4-space, we can skew it some more, repositioning its vertices so that each is one unit-edge length distant from six others instead of three others, at the vertices of a unit-edge 4-polytope with chords of length:

:&lt;math&gt;r_1=1,r_2=1,r_3=1,r_4=\sqrt{2}&lt;/math&gt;

All of its chords except its long diameters are the same unit length as its edge. In fact they are its 24 edges, and it is a 16-cell of radius &lt;small&gt;&lt;math&gt;1/\sqrt{2}&lt;/math&gt;&lt;/small&gt;.

[[File:octagon16cell.png|thumb|Orthogonal projection of a regular 16-cell to the [[16-cell#Projections|B&lt;sub&gt;4&lt;/sub&gt; Coxeter plane]]. Only its edges are shown; its long diameter chords are not drawn. All 24 edges are the same length. Only the edges of the two disjoint squares lie parallel to the projection plane, in completely orthogonal central planes.]]

The [[16-cell]] is the [[W:Regular convex 4-polytope|regular convex 4-polytope]] with [[W:Schläfli symbol|Schläfli symbol]] {3,3,4}. It has 8 vertices, 24 edges, 32 equilateral triangle faces, and 16 regular tetrahedron cells. It is the [[16-cell#Octahedral dipyramid|four-dimensional analogue of the octahedron]], and each of its four orthogonal central hyperplanes is an octahedron.

The only planar regular polygons found in the 16-cell are face triangles and central plane squares, but the 16-cell also contains a skew regular octagon, its [[W:Petrie polygon|Petrie polygon]]. The chords of this regular octagon, which lies skew in 4-space, are those given above for the 16-cell, as opposed to those for the cube or the regular octagon in the plane. The 16-cell is a construct of 3 Petrie octagons which share the same 8 vertices but have disjoint sets of 8 edges each.

The regular octad has higher symmetry in 4-space than it does in 2-space. The 16-cell is the 4-orthoplex, the simplest regular 4-polytope after the [[5-cell|4-simplex]]. All the larger regular 4-polytopes, including the 120-cell, are compounds of the 16-cell. The regular octagon exhibits this high symmetry only when embedded in 4-space at the vertices of the 16-cell.

The 16-cell constitutes an [[W:Orthonormal basis|orthonormal basis]] for the choice of a 4-dimensional Cartesian reference frame, because its vertices define four orthogonal axes. The eight vertices of a unit-radius 16-cell are (±1, 0, 0, 0), (0, ±1, 0, 0), (0, 0, ±1, 0), (0, 0, 0, ±1). All vertices are connected by &lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt; edges except opposite pairs. 

The vertex coordinates of the 16-cell form 6 central squares lying in 6 pairwise [[W:Orthogonal|orthogonal]] coordinate planes. Great squares in ''opposite'' planes that do not share an axis (e.g. in the ''xy'' and ''wz'' planes) are completely disjoint (they do not intersect at any vertices). These planes are [[W:Completely orthogonal|completely orthogonal]].{{Efn|name=Six orthogonal planes of the Cartesian basis}}

Since this unit-radius coordinate system is convenient, let us derive the unit-radius 16-cell by skewing a unit-radius planar octagon, which has chords of length:

:&lt;math&gt;r_1=\sqrt{2-\sqrt{2}} \approx 0.76537,r_2=\sqrt{2},r_3=\sqrt{2+\sqrt{2}} \approx 1.84776,r_4=2&lt;/math&gt;

We will need a planar octagon with rigid &lt;math&gt;r_2&lt;/math&gt; chords, rather than one with rigid &lt;math&gt;r_1&lt;/math&gt; edges. The octagon's &lt;math&gt;r_2&lt;/math&gt; chords form two disjoint great squares, visible in the orthogonal projection, which we can reposition in 3-space to form a cube by making them parallel, and in 4-space to form a 16-cell by making them completely orthogonal.

In the 16-cell the two disjoint great squares formed by the &lt;math&gt;r_2&lt;/math&gt; chords are both parallel and perpendicular to each other. A ''simple'' rotation of the 16-cell in ''one'' of those two central planes rotates that square like a wheel, while the other square does not move. The four vertices of the rotating square orbit on a great circle.

The &lt;math&gt;r_1&lt;/math&gt; chords of the 16-cell form a Petrie polygon which zig-zags back and forth between the two completely orthogonal &lt;math&gt;r_2&lt;/math&gt; squares.

The &lt;math&gt;r_3&lt;/math&gt; chords of the 16-cell form a circular helix, visible as a skew {8/3} polygram in the orthogonal projection. A ''double'' rotation of the 16-cell, in ''both'' of the two completely orthogonal &lt;math&gt;r_2&lt;/math&gt; central square planes at once, moves the vertices along the circular helix over the &lt;math&gt;r_3&lt;/math&gt; chords.

[[W:Rotations in 4-dimensional Euclidean space|Rotations in 4-dimensional Euclidean space]] can be seen as the composition of two 2-dimensional rotations in completely orthogonal planes. The general rotation in 4-space is a double rotation in pairs of completely orthogonal planes. Two completely orthogonal planes are called invariant planes of the rotation when all points in the plane rotate on circles that remain in the plane, even as the whole plane tilts sideways (like a coin flipping) into another plane. The two completely orthogonal rotations of each plane (like a wheel, and like a coin flipping) are simultaneous but independent, in that they are not geometrically constrained to turn at the same rate. However, the most circular kind of rotation (as opposed to an elliptical double rotation of a rigid spherical object) occurs when the invariant planes do rotate through the same angle in the same time interval. Such equi-angled double rotations are called [[w:SO(4)#Isoclinic_rotations|isoclinic]], also [[w:William_Kingdon_Clifford|Clifford]] displacements.

The 16-cell is the simplest possible frame in which to [[16-cell#Rotations|observe 4-dimensional rotations]] because its characteristic isoclinic rotations feature a single pair of invariant rotation planes. In the 16-cell an isoclinic rotation by 90° in any pair of invariant completely orthogonal square central planes takes every square central plane to its completely orthogonal square central plane in a twisting displacment, as they tilt sideways 90° into each other's plane while rotating 90° internally. All the vertices move at once on separate circular [[w:Geodesic|geodesics]], displaced 90° in 8 orthogonal directions, and the rigid 16-cell assumes a new orientation in 4-space. When the 90° isoclinic rotation is continued in the same rotational direction through an additional 90°, each vertex is again displaced 90°, but from the new orientation in a direction orthogonal to its first 90° displacement. After 360° of rotation each vertex reaches its antipodal position.

The trajectory of each vertex over each 90° isoclinic rotational displacement is a one-eighth segment of its geodesic orbit. Its entire orbit traces a circular helix in 4-space over eight &lt;math&gt;r_3&lt;/math&gt; chords, and also traces a great circle twice over the four &lt;math&gt;r_2&lt;/math&gt; chords of one of the two moving invariant rotation planes. In the course of a 720° isoclinic rotation each vertex departs from all 8 vertex positions just once and returns to its original position, and the 16-cell returns to its original orientation.

== Hypercubes ==
The long diameter of the unit-edge [[W:Hypercube|hypercube]] of dimension &lt;small&gt;&lt;math&gt;n&lt;/math&gt;&lt;/small&gt; is &lt;small&gt;&lt;math&gt;\sqrt{n}&lt;/math&gt;&lt;/small&gt;, so the unit-edge [[w:Tesseract|4-hypercube, the 16-point (8-cell) tesseract,]] has chords:
:&lt;math&gt;r_1=\sqrt{1},r_2=\sqrt{2},r_3=\sqrt{3},r_4=\sqrt{4}&lt;/math&gt;
Uniquely in its 4-dimensional case, the hypercube's edge length equals its radius, like the hexagon. We call such polytopes ''radially equilateral'', because they can be constructed from equilateral triangles which meet at their center, each contributing two radii and an edge. The cuboctahedron and the 24-cell are also radially equilateral.

The [[W:Tesseract|tesseract]] is the [[W:Regular convex 4-polytope|regular convex 4-polytope]] with [[W:Schläfli symbol|Schläfli symbol]] {4,3,3}. It has 16 vertices, 32 edges, 24 square faces, and 8 cube cells. It is the four-dimensional analogue of the cube.

The tesseract is the [[W:Dual polytope|dual polytope]] of the 16-cell. They have the same Petrie polygon, the regular octagon, but the tesseract contains 2 disjoint instances and 4 distinct instances of the skew octagon. We can construct the tesseract by skewing two planar octagons. Because the tesseract is radially equilateral (unlike the 16-cell), we start with our original octagon of unit-edge length, rather than the octagon of edge length &lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt; that we needed to build the unit-radius 16-cell.

For our tesseract construction we skew each planar octagon into a cube, so we have a compound of two completely orthogonal cubes. Provided the planes were completely orthogonal in 4-space and we skewed them both the same way, the 16 vertices will be the vertices of a tesseract with half of its 32 edges missing.

The 16-point tesseract is the convex hull of a compound of two 8-point 16-cells, in exact dimensional analogy to the way the 8-point cube is the convex hull of a [[W:Stellated octahedron|compound of two regular 4-point tetrahedra]]. The [[W:Demihypercube|demihypercubes]] occupy alternate vertices of the hypercubes. The diagonals of the square faces of the unit-radius tesseract are the &lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt; edges of two unit-radius 16-cells, which are also the edges of the square central planes.

Because the tesseract contains two 16-cells in alternate positions it has two sets of 6 orthogonal square central planes. Two angles are required to specify the relationship between two planes in 4-space. Pairs of planes within each 16-cell are 90° apart in one angle, and either 0° or 90° apart in the other angle. They are 90° apart in both angles if and only if they are completely orthogonal planes, 90° apart by isoclinic rotation, with no vertices in common and their corresponding vertices 180° apart. Otherwise they are 0° apart in one of the angles, 90° apart by simple rotation with their corresponding vertices 90° apart, and they intersect in one axis and lie in a common 3-dimensional hyperplane.{{Efn|A double rotation in which one of the two angles of rotation is 0°, so that one of the completely orthogonal invariant planes does not rotate, is called a simple rotation. Ordinary rotations observed in a 3-dimensional space are simple rotations.}}

A pair of square central planes from alternate 16-cells are 60° apart by isoclinic rotation, with their corresponding vertices 120° apart. The planes are not orthogonal or parallel, so they intersect in a line somewhere, but they have no vertices in common, they have no 3-dimensional hyperplane in common, and they cannot reach each other by simple rotation. Such pairs of objects are called [[W:Clifford parallel|Clifford parallel]] because all their corresponding pairs of vertices are the same distance apart, although they are not parallel in the usual sense, because they have a common center. Not only the alternate 16-cells' corresponding square central planes, but also the 16-cells themselves, are Clifford parallel objects.

We can rotate the tesseract isoclinically the way we rotated the 16-cell, by 90° in two completely orthogonal invariant square central planes, with the same effect on both alternate 16-cells. In the course of a 720° isoclinic rotation in invariant square central planes each vertex departs from all 8 vertex positions of its 16-cell just once and returns to its original position, but it does not visit the vertex positions of the other 16-cell. The skew octagon geodesic orbits of the 16 vertices are disjoint circular helixes, and those 16 circular helixes are Clifford parallel objects.

== The 24-cell ==
In 2-space we have the radially equilateral 6-point hexagon. In 3-space we have the radially equilateral 12-point cuboctahedron, with 4 hexagonal central planes. In 4-space we have the radially equilateral 24-point 24-cell, with 4 cuboctahedral central hyperplanes and 16 hexagonal central planes.

Great hexagons are a rounder choice than great squares for the invariant rotation planes in which to rotate a 4-polytope isoclinically. The complete hexagonal isoclinic revolution requires 720° like the square isoclinic revolution, but it is completed in 6 chordal steps of 120° each rather than 8 chordal steps of 90° each.

...

== The 600-cell ==

...

== Finally the 120-cell ==

...

== Conclusions ==

Fontaine and Hurley's discovery is more than a formula for the reciprocal of a regular ''n''-polygon diagonal. It also yields the discrete sequence of isocline chords of the distinct isoclinic rotation characteristic of a ''d''-dimensional regular polytope. The characteristic rotational chord sequence of the ''d''-polytope can be represented geometrically in two dimensions on a distinct star polygon, but it lies on a geodesic circle through ''d''-dimensional space. Fontaine and Hurley discovered the geodesic topology of polytopes generally. Their procedure will reveal the geodesics of arbitrary non-uniform polytopes, since it can be applied to a polytope of any dimensionality and irregularity, by first fitting the polytope to the smallest regular polygon whose chords include its chords.

Fontaine and Hurley's discovery of a chordal formula for isoclinic rotations closes the circuit on Kappraff and Adamson's discovery of a rotational connection between dynamical systems, Steinbach's golden fields, and Coxeter's Euclidean geometry of ''n'' dimensions. Application of the Fontaine and Hurley procedure in higher-dimensional spaces demonstrates why the connection exists: because polytope sequences generally, from Steinbach's golden polygon chord sequences, to chord sequences in isoclinic rotation helixes, to subsumption relations in the sequence of regular 4-polytopes, arise as expressions of the reflections and rotations of distinct Coxeter symmetry groups, when those various groups interact.

== Appendix: Sequence of regular 4-polytopes ==
{{Regular convex 4-polytopes|wiki=W:|columns=7}}

== Notes ==
{{Notelist}}

== Citations ==
{{Reflist}}

== References ==
{{Refbegin}}
* {{Cite journal | last=Steinbach | first=Peter | year=1997 | title=Golden fields: A case for the Heptagon | journal=Mathematics Magazine | volume=70 | issue=Feb 1997 | pages=22–31 | doi=10.1080/0025570X.1997.11996494 | jstor=2691048 | ref={{SfnRef|Steinbach|1997}} }}
* {{Cite journal | last=Steinbach | first=Peter | year=2000 | title=Sections Beyond Golden| journal=Bridges: Mathematical Connections in Art, Music and Science | issue=2000 | pages=35-44 | url=https://archive.bridgesmathart.org/2000/bridges2000-35.pdf | ref={{SfnRef|Steinbach|2000}}}}
* {{Cite journal | last1=Kappraff | first1=Jay | last2=Jablan | first2=Slavik | last3=Adamson | first3=Gary | last4=Sazdanovich | first4=Radmila | year=2004 | title=Golden Fields, Generalized Fibonacci Sequences, and Chaotic Matrices | journal=Forma | volume=19 | pages=367-387 | url=https://archive.bridgesmathart.org/2005/bridges2005-369.pdf | ref={{SfnRef|Kappraff, Jablan, Adamson &amp; Sazdanovich|2004}} }}
* {{Cite journal | last1=Kappraff | first1=Jay | last2=Adamson | first2=Gary | year=2004 | title=Polygons and Chaos | journal=Dynamical Systems and Geometric Theories | url=https://archive.bridgesmathart.org/2001/bridges2001-67.pdf | ref={{SfnRef|Kappraff &amp; Adamson|2004}} }}
* {{Cite journal | last1=Fontaine | first1=Anne | last2=Hurley | first2=Susan | year=2006 | title=Proof by Picture: Products and Reciprocals of Diagonal Length Ratios in the Regular Polygon | journal=Forum Geometricorum | volume=6 | pages=97-101 | url=https://scispace.com/pdf/proof-by-picture-products-and-reciprocals-of-diagonal-length-1aian8mgp9.pdf }}
{{Refend}}</text>
      <sha1>80q5ea0sd4ih9pvkrz2ayjmupl5r8cw</sha1>
    </revision>
    <revision>
      <id>2809787</id>
      <parentid>2809780</parentid>
      <timestamp>2026-05-17T01:04:10Z</timestamp>
      <contributor>
        <username>Dc.samizdat</username>
        <id>2856930</id>
      </contributor>
      <comment>/* The 8-point regular polytopes */</comment>
      <origin>2809787</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="46749" sha1="9j9qrghhf9t77f3umvw86apt8j0eqr9" xml:space="preserve">{{align|center|David Brooks Christie}}
{{align|center|dc@samizdat.org}}
{{align|center|Draft in progress}}
{{align|center|January 2026 - April 2026}}

&lt;blockquote&gt;Steinbach discovered the formula for the ratios of diagonal to side in the regular polygons. Fontaine and Hurley extended this result, discovering a formula for the reciprocal of a regular polygon chord derived geometrically from the chord's star polygon. We observe that these findings in plane geometry apply more generally, to polytopes of any dimensionality. Fontaine and Hurley's geometric procedure for finding the reciprocals of the chords of a regular polygon from their star polygons also finds the rotational geodesics of any polytope of any dimensionality.&lt;/blockquote&gt;
== Introduction ==
Steinbach discovered the Diagonal Product Formula and the Golden Fields family of ratios of diagonal to side in the regular polygons. He showed how this family extends beyond the pentagon {5} with its well-known golden bisection proportional to 𝜙, finding that the heptagon {7} has an analogous trisection, the nonagon {9} has an analogous quadrasection, and the hendecagon {11} has an analogous pentasection, an extended family of golden proportions with quasiperiodic properties. 

Kappraff and Adamson extended these findings in plane geometry to a theory of Generalized Fibonacci Sequences, showing that the Golden Fields not only do not end with the hendecagon, they form an infinite number of periodic trajectories when operated on by the Mandelbrot operator. They found a relation between the edges of star polygons and dynamical systems in the state of chaos, revealing a connection between chaos theory, number, and rotations in Coxeter Euclidean geometry. 

Fontaine and Hurley examined Steinbach's finding that the length of each chord of a regular polygon is both the product of two chords and the sum of a set of smaller chords, so that in rotations to add is to multiply. They illustrated Steinbach's sets of additive chords lying parallel to each other in the plane (pointing in the same direction), and by applying Steinbach's formula more generally they found another summation relation of signed parallel chords (pointing in opposite directions) which relates each chord length to its reciprocal, and relates the summation to a distinct star polygon rotation. 

We examine these remarkable findings (which stem from study of the chords of humble regular polygons) in higher-dimensional spaces, specifically in the chords, polygons and rotations of the [[120-cell]], the largest four-dimensional regular convex polytope.

== Visualizing the 120-cell ==
{| class=&quot;wikitable floatright&quot; width=&quot;400&quot;
|style=&quot;vertical-align:top&quot;|[[File:120-cell.gif|200px]]&lt;br&gt;Orthographic projection of the 600-point 120-cell &lt;small&gt;&lt;math&gt;\{5,3,3\}&lt;/math&gt;&lt;/small&gt; performing a [[W:SO(4)#Geometry of 4D rotations|simple rotation]].{{Sfn|Hise|2011|loc=File:120-cell.gif|ps=; &quot;Created by Jason Hise with Maya and Macromedia Fireworks. A 3D projection of a 120-cell performing a [[W:SO(4)#Geometry of 4D rotations|simple rotation]].&quot;}} In this simplified rendering only the 120-cell's own edges are shown; its 29 interior chords are not rendered. Therefore even though it is translucent, only its outer surface is visible. The complex interior parts of the 120-cell, all its inscribed 5-cells, 16-cells, 8-cells, 24-cells, 600-cells and its much larger inventory of polyhedra, are completely invisible in this view, as none of their edges are rendered at all.
|style=&quot;vertical-align:top&quot;|[[File:Ortho solid 016-uniform polychoron p33-t0.png|200px]]&lt;br&gt;Orthographic projection of the 600-point [[W:Great grand stellated 120-cell|great grand stellated 120-cell]] &lt;small&gt;&lt;math&gt;\{\tfrac{5}{2},3,3\}&lt;/math&gt;&lt;/small&gt;.{{Sfn|Ruen: Great grand stellated 120-cell|2007}} The 120-cell is its convex hull. The projection to the left renders only the 120-cell's shortest chord, its 1200 edges. The projection above also renders only one of the 120-cell's 30 chords, the edges of its 120 inscribed regular 5-cells. The 120-cell itself (the convex hull) is invisible in this view, as its edges are not rendered.
|}

[[120-cell#Geometry|The 120-cell is the maximally complex regular 4-polytope]], containing inscribed instances of every regular 1-, 2-, 3-, and 4-polytope, except the regular polygons of more than {15} sides. 

The 120-cell is the convex hull of a regular [[120-cell#Relationships among interior polytopes|compound of each of the 6 regular convex 4-polytopes]]. They are the [[5-cell|5-point (5-cell) 4-simplex]], the [[16-cell|8-point (16-cell) 4-orthoplex]], the [[W:Tesseract|16-point (8-cell) tesseract]], the [[24-cell|24-point (24-cell)]], the [[600-cell|120-point (600-cell)]], and the [[120-cell|600-point (120-cell)]]. The 120-cell is the convex hull of a compound of 120 disjoint regular 5-cells, of 75 disjoint 16-cells, of 25 disjoint 24-cells, and of 5 disjoint 600-cells.

The 120-cell contains an even larger inventory of irregular polytopes, created by the intersection of multiple instances of these component regular 4-polytopes. Many are quite unexpected, because they do not occur as components of any regular polytope smaller than the 120-cell. As just one example among the [[120-cell#Concentric hulls|sections of the 120-cell]], there is an irregular 24-point polyhedron with 16 triangle faces and 4 nonagon {9} faces.{{Sfn|Moxness|}}

Most renderings of the 120-cell, like the rotating projection here, only illustrate its outer surface, which is a honeycomb of face-bonded dodecahedral cells. Only the objects in its 3-dimensional surface are rendered, namely the 120 dodecahedra, their pentagon faces, and their edges. Although the 120-cell has chords of 30 distinct lengths, in this kind of simplified rendering only the 120-cell's own edges (its shortest chord) are shown. Its 29 interior chords, the edges of objects in the interior of the 120-cell, are not rendered, so interior objects are not visible at all.

Visualizing the complete interior of the 600-vertex 120-cell in a single image is impractical because of its complexity. Only four 120-cell edges are incident at each vertex, but [[120-cell#Chords|600 chords (of all 30 lengths)]] are incident at ''each'' vertex.

== Compounds in the 120-cell ==
The 8-point (16-cell), not the 5-point (5-cell), is the smallest building block; it compounds to every larger regular 4-polytope. The 5-point (5-cell) does compound to the 600-point (120-cell), but it does not fit into any smaller regular 4-polytope. 

The 8-point (16-cell) compounds by 2 in the 16-point (8-cell), and by 3 in the 24-point (24-cell). The 16-point (8-cell) compounds in the 24-point (24-cell) by 3 non-disjoint instances of itself, with each of the 24 vertices shared by two 16-point (8-cells). The 24-point (24-cell) compounds by 5 disjoint instances of itself in the 120-point (600-cell), and the 120-point (600-cell) compounds by 5 disjoint instances of itself in the 600-point (120-cell).

The 24-point (24-cell) also compounds by &lt;math&gt;5^2&lt;/math&gt; non-disjoint instances of itself in the 120-point (600-cell); it compounds in 5 disjoint instances of itself, 10 (not 5) different ways. Whichever set of 5 disjoint 24-point (24-cells) are assembled, the resulting 120-point (600-cell) contains 25 distinct 24-point (24-cells), not just 5 (or 10). This implies that 15 disjoint 8-point (16-cells) will construct a 120-point (600-cell), which will contain 75 distinct 8-point (16-cells). 

The 600-point (120-cell) is 5 disjoint 120-point (600-cells), just 2 different ways (not 5 or 10 ways), so it is 10 distinct 120-point (600-cells). This implies that the 8-point (16-cell) compounds by 3 times &lt;math&gt;5^2&lt;/math&gt; (75) disjoint instances of itself in the 600-point (120-cell), which contains &lt;math&gt;3^2&lt;/math&gt; times  &lt;math&gt;5^2&lt;/math&gt; (225) distinct instances of the 24-point (24-cell), and  &lt;math&gt;3^3&lt;/math&gt; times &lt;math&gt;5^2&lt;/math&gt; (675) distinct instances of the 8-point (16-cell). 

These facts were discovered painstakingly by various researchers, and no one has found a general rule governing subsumption relations among regular polytopes. The reasons for some of their numeric incidence relations are far from obvious. [[W:Pieter Hendrik Schoute|Schoute]] was the first to see that the 120-point (600-cell) is a compound of 5 24-point (24-cells) ''10 different ways'', and after he saw it a hundred years lapsed until Denney, Hooker, Johnson, Robinson, Butler &amp; Claiborne proved his result, and showed why.{{Sfn|Denney, Hooker, Johnson, Robinson, Butler &amp; Claiborne|2020|loc=''The geometry of H4 polytopes''}}

So much for the compounds of 16-cells. The 120-cell is also the convex hull of the compound of 120 disjoint regular 5-cells. That stellated compound (without its convex hull of 120-cell edges) is the [[w:Great_grand_stellated_120-cell|great grand stellated 120-cell]] illustrated above, the final regular [[W:Stellation|stellation]] of the 120-cell, and the only [[W:Schläfli-Hess polychoron|regular star 4-polytope]] to have the 120-cell for its convex hull. The edges of the great grand stellated 120-cell are &lt;math&gt;\phi^6&lt;/math&gt; as long as those of its 120-cell [[W:List of polyhedral stellations#Stellation process|stellation core]] deep inside.

The compound of 120 disjoint 5-point (5-cells) can be seen to be equivalent to the compound of 5 disjoint 120-point (600-cells), as follows. Beginning with a single 120-point (600-cell), expand each vertex into a regular 5-cell, by adding 4 new equidistant vertices, such that the 5 vertices form a regular 5-cell inscribed in the 3-sphere. The 120 5-cells are disjoint, and the 600 vertices form 5 disjoint 120-point (600-cells): a 120-cell.

== Thirty distinguished distances ==
The 30 numbers listed in the table are all-important in Euclidean geometry. A case can be made on symmetry grounds that their squares are the 30 most important numbers between 0 and 4. The 30 rows of the table are the 30 distinct [[120-cell#Geodesic rectangles|chord lengths of the unit-radius 120-cell]], the largest regular convex 4-polytope. Since the 120-cell subsumes all smaller regular polytopes, its 30 chords are the complete chord set of all the regular polytopes that can be constructed in the first four dimensions of Euclidean space, except for regular polygons of more than 15 sides.

{| class=&quot;wikitable&quot; style=&quot;white-space:nowrap;text-align:center&quot;
!rowspan=2|&lt;math&gt;c_t&lt;/math&gt;
!rowspan=2|arc
!rowspan=2|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{n}\right\}&lt;/math&gt;&lt;/small&gt;
!rowspan=2|&lt;math&gt;\left\{p\right\}&lt;/math&gt;
!rowspan=2|&lt;small&gt;&lt;math&gt;m\left\{\frac{k}{d}\right\}&lt;/math&gt;&lt;/small&gt;
!rowspan=2|Steinbach roots
!colspan=7|Chord lengths of the unit 120-cell
|-
!colspan=5|unit-radius length &lt;math&gt;c_t&lt;/math&gt;
!colspan=2|unit-edge length &lt;math&gt;c_t/c_1&lt;/math&gt;&lt;br&gt;in 120-cell of radius &lt;math&gt;c_8=\sqrt{2}\phi^2&lt;/math&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{1,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;15.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{30\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{30\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;c_{4,1}-c_{2,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7-3 \sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.270091&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2} \phi ^2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2 \phi ^4}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.072949}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{2,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;25.2{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{2}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \left\{15\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(c_{18,1}-c_{4,1}\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{3-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.437016&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2} \phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2 \phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.190983}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.61803&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{3,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;36{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{10\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3 \left\{\frac{10}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(\sqrt{5}-1\right) c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(\sqrt{5}-1\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.618034&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{\phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.381966}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.28825&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{4,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;41.4{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{c_{8,1}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.707107&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.61803&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{5,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;44.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{4}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \left\{\frac{15}{2}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} c_{2,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{9-3 \sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.756934&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{\frac{3}{2}}}{\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2 \phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.572949}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} \phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.80252&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{6,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;49.1{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{17}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{5-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{5-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.831254&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt[4]{5} \sqrt{\frac{1}{\phi }}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\sqrt{5}}{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.690983}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\phi ^3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.07768&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{7,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;56.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{20}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{1}{\phi }} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{2}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.93913&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{\frac{\psi }{\phi }}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\psi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.881966}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\psi  \phi ^3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.47709&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;60{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{5}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{6\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{6\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.70246&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{9,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;66.1{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{40}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{1}{2 \phi }} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.09132&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{\frac{\chi }{\phi }}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\chi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.19098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\chi  \phi ^3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.04057&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{10,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;69.8{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{11}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi  c_{4,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1+\sqrt{5}}{2 \sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.14412&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\phi }{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\phi ^2}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.30902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^3&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.23607&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{11,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;72{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{6}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{5\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{5\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\frac{1}{\phi }} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\frac{2}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.17557&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3-\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3-\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.38197}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \sqrt{3-\phi } \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.3525&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{12,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;75.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{24}{5}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.22474&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.53457&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{13,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;81.1{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{13}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{9-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{9-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.30038&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{9-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(9-\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.69098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(9-\sqrt{5}\right)} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.8146&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{14,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;84.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{40}{9}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt[4]{5} \sqrt{\phi } c_{8,1}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt[4]{5} \sqrt{1+\sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.345&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt[4]{5} \sqrt{\phi }}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\sqrt{5} \phi }{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.80902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\phi ^5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.9798&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{15,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;90.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{4\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{4\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 c_{4,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.41421&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.23607&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{16,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;95.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{29}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{11-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.4802&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(11-\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.19098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(11-\sqrt{5}\right)} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.48037&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{17,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;98.9{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{31}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7+\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{7+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.51954&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{7+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(7+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.30902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\psi  \phi ^5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.62605&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{18,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;104.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{8}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{15}{4}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.58114&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{5} \sqrt{\phi ^4}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.8541&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{19,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;108.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{9}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{10}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;c_{3,1}+c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(1+\sqrt{5}\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.61803&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1+\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.61803}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \phi ^3&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.9907&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{20,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;110.2{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{13-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.64042&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(13-\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.69098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\phi ^2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.07359&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{21,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;113.9{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{19}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.67601&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.80902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\frac{\chi }{\phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.20537&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{22,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;120{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{10}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{3\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{3\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.73205&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{6} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.41285&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{23,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;124.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{41}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{\phi }+\frac{5}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{2}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.7658&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4-\frac{\psi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4-\frac{\psi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.11803}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\chi  \phi ^5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.53779&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{24,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;130.9{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{20}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{11+\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.81907&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(11+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.30902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\frac{\sqrt{5}}{\phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.73503&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{25,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;135.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{11}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{11}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7+3 \sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7+3 \sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.85123&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\phi ^2}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\phi ^4}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.42705}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^4&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.8541&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{26,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;138.6{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{12}{5}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.87083&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{7} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.92667&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{27,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;144{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{12}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{5}{2}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(5+\sqrt{5}\right)} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(5+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.90211&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\phi +2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2+\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.61803}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{2 \phi +4}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.0425&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{28,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;154.8{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{13}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{13}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{13+\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.95167&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(13+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.80902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\frac{1}{\phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.22598&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{29,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;164.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{14}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{15}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi  c_{12,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{\frac{3}{2}} \left(1+\sqrt{5}\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.98168&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}} \phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3 \phi ^2}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.92705}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} \phi ^3&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.33708&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{30,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;180{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{15}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{2\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{2\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \sqrt{2} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.40492&lt;/math&gt;&lt;/small&gt;
|-
|rowspan=4 colspan=6|
|rowspan=4 colspan=4|
&lt;small&gt;&lt;math&gt;\phi&lt;/math&gt;&lt;/small&gt; is the golden ratio:&lt;br&gt;
&lt;small&gt;&lt;math&gt;\phi ^2-\phi -1=0&lt;/math&gt;&lt;/small&gt;&lt;br&gt;
&lt;small&gt;&lt;math&gt;\frac{1}{\phi }+1=\phi&lt;/math&gt;&lt;/small&gt;, and: &lt;small&gt;&lt;math&gt;\phi+1=\phi^2&lt;/math&gt;&lt;/small&gt;&lt;br&gt;
&lt;small&gt;&lt;math&gt;\frac{1}{\phi }::1::\phi ::\phi ^2&lt;/math&gt;&lt;/small&gt;&lt;br&gt;
&lt;small&gt;&lt;math&gt;1/\phi&lt;/math&gt;&lt;/small&gt; and &lt;small&gt;&lt;math&gt;\phi&lt;/math&gt;&lt;/small&gt; are the golden sections of &lt;small&gt;&lt;math&gt;\sqrt{5}&lt;/math&gt;&lt;/small&gt;:&lt;br&gt;
&lt;small&gt;&lt;math&gt;\phi +\frac{1}{\phi }=\sqrt{5}&lt;/math&gt;&lt;/small&gt;
|colspan=2|&lt;small&gt;&lt;math&gt;\phi = (\sqrt{5} + 1)/2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.618034&lt;/math&gt;&lt;/small&gt;
|-
|colspan=2|&lt;small&gt;&lt;math&gt;\chi = (3\sqrt{5} + 1)/2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.854102&lt;/math&gt;&lt;/small&gt;
|-
|colspan=2|&lt;small&gt;&lt;math&gt;\psi = (3\sqrt{5} - 1)/2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.854102&lt;/math&gt;&lt;/small&gt;
|-
|colspan=2|&lt;small&gt;&lt;math&gt;\psi = 11/\chi = 22/(3\sqrt{5} + 1)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.854102&lt;/math&gt;&lt;/small&gt;
|}

...

== The 8-point regular polytopes ==
In 2-space we have the regular 8-point octagon, in 3-space the regular 8-point cube, and in 4-space the regular 8-point [[16-cell]].

A planar octagon with rigid edges of unit length has chords of length:

:&lt;math&gt;r_1=1,r_2=\sqrt{2+\sqrt{2}} \approx 1.84776,r_3=1+\sqrt{2} \approx 2.41421,r_4=\sqrt{4 + \sqrt{8}} \approx 2.61313&lt;/math&gt;

The chord ratio &lt;math&gt;r_3=1+\sqrt{2}&lt;/math&gt; is a geometrical proportion, the [[W:Silver ratio|silver ratio]]. Fontaine and Hurley's procedure for obtaining the reciprocal of a chord tells us that:

:&lt;math&gt;r_3-r_1-r_1=1/r_3 \approx 0.41421&lt;/math&gt;

Note that &lt;math&gt;1/r_3=\sqrt{2}-1=r_3-2&lt;/math&gt;.

If we embed this planar octagon in 3-space, we can make it skew, repositioning its vertices so that each is one unit-edge length distant from three others instead of two others, at the vertices of a unit-edge cube with chords of length:

:&lt;math&gt;r_1=1, r_2=\sqrt{2}, r_3=\sqrt{3}, r_4=\sqrt{2}&lt;/math&gt;

If we embed this cube in 4-space, we can skew it some more, repositioning its vertices so that each is one unit-edge length distant from six others instead of three others, at the vertices of a unit-edge 4-polytope with chords of length:

:&lt;math&gt;r_1=1,r_2=1,r_3=1,r_4=\sqrt{2}&lt;/math&gt;

All of its chords except its long diameters are the same unit length as its edge. In fact they are its 24 edges, and it is a 16-cell of radius &lt;small&gt;&lt;math&gt;1/\sqrt{2}&lt;/math&gt;&lt;/small&gt;.

[[File:octagon16cell.png|thumb|Orthogonal projection of a regular 16-cell to the [[16-cell#Projections|B&lt;sub&gt;4&lt;/sub&gt; Coxeter plane]]. Only its edges are shown; its long diameter chords are not drawn. All 24 edges are the same length. Only the edges of the two disjoint squares lie parallel to the projection plane, in completely orthogonal central planes.]]

The [[16-cell]] is the [[W:Regular convex 4-polytope|regular convex 4-polytope]] with [[W:Schläfli symbol|Schläfli symbol]] {3,3,4}. It has 8 vertices, 24 edges, 32 equilateral triangle faces, and 16 regular tetrahedron cells. It is the [[16-cell#Octahedral dipyramid|four-dimensional analogue of the octahedron]], and each of its four orthogonal central hyperplanes is an octahedron.

The only planar regular polygons found in the 16-cell are face triangles and central plane squares, but the 16-cell also contains a skew regular octagon, its [[W:Petrie polygon|Petrie polygon]]. The chords of this regular octagon, which lies skew in 4-space, are those given above for the 16-cell, as opposed to those for the cube or the regular octagon in the plane. The 16-cell is a construct of 3 Petrie octagons which share the same 8 vertices but have disjoint sets of 8 edges each.

The regular octad has higher symmetry in 4-space than it does in 2-space. The 16-cell is the 4-orthoplex, the simplest regular 4-polytope after the [[5-cell|4-simplex]]. All the larger regular 4-polytopes, including the 120-cell, are compounds of the 16-cell. The regular octagon exhibits this high symmetry only when embedded in 4-space at the vertices of the 16-cell.

The 16-cell constitutes an [[W:Orthonormal basis|orthonormal basis]] for the choice of a 4-dimensional Cartesian reference frame, because its vertices define four orthogonal axes. The eight vertices of a unit-radius 16-cell are (±1, 0, 0, 0), (0, ±1, 0, 0), (0, 0, ±1, 0), (0, 0, 0, ±1). All vertices are connected by &lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt; edges except opposite pairs. 

The vertex coordinates of the 16-cell form 6 central squares lying in 6 pairwise [[W:Orthogonal|orthogonal]] coordinate planes. Great squares in ''opposite'' planes that do not share an axis (e.g. in the ''xy'' and ''wz'' planes) are completely disjoint (they do not intersect at any vertices). These planes are [[W:Completely orthogonal|completely orthogonal]].{{Efn|name=Six orthogonal planes of the Cartesian basis}}

Since this unit-radius coordinate system is convenient, let us derive the unit-radius 16-cell by skewing a unit-radius planar octagon, which has chords of length:

:&lt;math&gt;r_1=\sqrt{2-\sqrt{2}} \approx 0.76537,r_2=\sqrt{2},r_3=\sqrt{2+\sqrt{2}} \approx 1.84776,r_4=2&lt;/math&gt;

We will need a planar octagon with rigid &lt;math&gt;r_2&lt;/math&gt; chords, rather than one with rigid &lt;math&gt;r_1&lt;/math&gt; edges. The octagon's &lt;math&gt;r_2&lt;/math&gt; chords form two disjoint great squares, visible in the orthogonal projection, which we can reposition in 3-space to form a cube by making them parallel, and in 4-space to form a 16-cell by making them completely orthogonal.

In the 16-cell the two disjoint great squares formed by the &lt;math&gt;r_2&lt;/math&gt; chords are both parallel and perpendicular to each other. A ''simple'' rotation of the 16-cell in ''one'' of those two central planes rotates that square like a wheel, while the other square does not move. The four vertices of the rotating square orbit on a great circle.

The &lt;math&gt;r_1&lt;/math&gt; chords of the 16-cell form a Petrie polygon which zig-zags back and forth between the two completely orthogonal &lt;math&gt;r_2&lt;/math&gt; squares.

The &lt;math&gt;r_3&lt;/math&gt; chords of the 16-cell form a circular helix, visible as a skew {8/3} polygram in the orthogonal projection. A ''double'' rotation of the 16-cell, in ''both'' of the two completely orthogonal &lt;math&gt;r_2&lt;/math&gt; central square planes at once, moves the eight vertices along the circular helix over the &lt;math&gt;r_3&lt;/math&gt; chords.

[[W:Rotations in 4-dimensional Euclidean space|Rotations in 4-dimensional Euclidean space]] can be seen as the composition of two 2-dimensional rotations in completely orthogonal planes. The general rotation in 4-space is a double rotation in pairs of completely orthogonal planes. Two completely orthogonal planes are called invariant planes of the rotation when all points in the plane rotate on circles that remain in the plane, even as the whole plane tilts sideways (like a coin flipping) into another plane. The two completely orthogonal rotations of each plane (like a wheel, and like a coin flipping) are simultaneous but independent, in that they are not geometrically constrained to turn at the same rate. However, the most circular kind of rotation (as opposed to an elliptical double rotation of a rigid spherical object) occurs when the invariant planes do rotate through the same angle in the same time interval. Such equi-angled double rotations are called [[w:SO(4)#Isoclinic_rotations|isoclinic]], also [[w:William_Kingdon_Clifford|Clifford]] displacements.

The 16-cell is the simplest possible frame in which to [[16-cell#Rotations|observe 4-dimensional rotations]] because its characteristic isoclinic rotations feature a single pair of invariant rotation planes. In the 16-cell an isoclinic rotation by 90° in any pair of invariant completely orthogonal square central planes takes every square central plane to its completely orthogonal square central plane in a twisting displacment, as they tilt sideways 90° into each other's plane while rotating 90° internally. All the vertices move at once on separate circular [[w:Geodesic|geodesics]], displaced 90° in 8 orthogonal directions, and the rigid 16-cell assumes a new orientation in 4-space. When the 90° isoclinic rotation is continued in the same rotational direction through an additional 90°, each vertex is again displaced 90°, but from the new orientation in a direction orthogonal to its first 90° displacement. After 360° of rotation each vertex reaches its antipodal position.

The trajectory of each vertex over each 90° isoclinic rotational displacement is a one-eighth segment of its geodesic orbit. Its entire orbit traces a circular helix in 4-space over eight &lt;math&gt;r_3&lt;/math&gt; chords, and also traces a great circle twice over the four &lt;math&gt;r_2&lt;/math&gt; chords of one of the two moving invariant rotation planes. In the course of a 720° isoclinic rotation each vertex departs from all 8 vertex positions just once and returns to its original position, and the 16-cell returns to its original orientation.

== Hypercubes ==
The long diameter of the unit-edge [[W:Hypercube|hypercube]] of dimension &lt;small&gt;&lt;math&gt;n&lt;/math&gt;&lt;/small&gt; is &lt;small&gt;&lt;math&gt;\sqrt{n}&lt;/math&gt;&lt;/small&gt;, so the unit-edge [[w:Tesseract|4-hypercube, the 16-point (8-cell) tesseract,]] has chords:
:&lt;math&gt;r_1=\sqrt{1},r_2=\sqrt{2},r_3=\sqrt{3},r_4=\sqrt{4}&lt;/math&gt;
Uniquely in its 4-dimensional case, the hypercube's edge length equals its radius, like the hexagon. We call such polytopes ''radially equilateral'', because they can be constructed from equilateral triangles which meet at their center, each contributing two radii and an edge. The cuboctahedron and the 24-cell are also radially equilateral.

The [[W:Tesseract|tesseract]] is the [[W:Regular convex 4-polytope|regular convex 4-polytope]] with [[W:Schläfli symbol|Schläfli symbol]] {4,3,3}. It has 16 vertices, 32 edges, 24 square faces, and 8 cube cells. It is the four-dimensional analogue of the cube.

The tesseract is the [[W:Dual polytope|dual polytope]] of the 16-cell. They have the same Petrie polygon, the regular octagon, but the tesseract contains 2 disjoint instances and 4 distinct instances of the skew octagon. We can construct the tesseract by skewing two planar octagons. Because the tesseract is radially equilateral (unlike the 16-cell), we start with our original octagon of unit-edge length, rather than the octagon of edge length &lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt; that we needed to build the unit-radius 16-cell.

For our tesseract construction we skew each planar octagon into a cube, so we have a compound of two completely orthogonal cubes. Provided the planes were completely orthogonal in 4-space and we skewed them both the same way, the 16 vertices will be the vertices of a tesseract with half of its 32 edges missing.

The 16-point tesseract is the convex hull of a compound of two 8-point 16-cells, in exact dimensional analogy to the way the 8-point cube is the convex hull of a [[W:Stellated octahedron|compound of two regular 4-point tetrahedra]]. The [[W:Demihypercube|demihypercubes]] occupy alternate vertices of the hypercubes. The diagonals of the square faces of the unit-radius tesseract are the &lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt; edges of two unit-radius 16-cells, which are also the edges of the square central planes.

Because the tesseract contains two 16-cells in alternate positions it has two sets of 6 orthogonal square central planes. Two angles are required to specify the relationship between two planes in 4-space. Pairs of planes within each 16-cell are 90° apart in one angle, and either 0° or 90° apart in the other angle. They are 90° apart in both angles if and only if they are completely orthogonal planes, 90° apart by isoclinic rotation, with no vertices in common and their corresponding vertices 180° apart. Otherwise they are 0° apart in one of the angles, 90° apart by simple rotation with their corresponding vertices 90° apart, and they intersect in one axis and lie in a common 3-dimensional hyperplane.{{Efn|A double rotation in which one of the two angles of rotation is 0°, so that one of the completely orthogonal invariant planes does not rotate, is called a simple rotation. Ordinary rotations observed in a 3-dimensional space are simple rotations.}}

A pair of square central planes from alternate 16-cells are 60° apart by isoclinic rotation, with their corresponding vertices 120° apart. The planes are not orthogonal or parallel, so they intersect in a line somewhere, but they have no vertices in common, they have no 3-dimensional hyperplane in common, and they cannot reach each other by simple rotation. Such pairs of objects are called [[W:Clifford parallel|Clifford parallel]] because all their corresponding pairs of vertices are the same distance apart, although they are not parallel in the usual sense, because they have a common center. Not only the alternate 16-cells' corresponding square central planes, but also the 16-cells themselves, are Clifford parallel objects.

We can rotate the tesseract isoclinically the way we rotated the 16-cell, by 90° in two completely orthogonal invariant square central planes, with the same effect on both alternate 16-cells. In the course of a 720° isoclinic rotation in invariant square central planes each vertex departs from all 8 vertex positions of its 16-cell just once and returns to its original position, but it does not visit the vertex positions of the other 16-cell. The skew octagon geodesic orbits of the 16 vertices are disjoint circular helixes, and those 16 circular helixes are Clifford parallel objects.

== The 24-cell ==
In 2-space we have the radially equilateral 6-point hexagon. In 3-space we have the radially equilateral 12-point cuboctahedron, with 4 hexagonal central planes. In 4-space we have the radially equilateral 24-point 24-cell, with 4 cuboctahedral central hyperplanes and 16 hexagonal central planes.

Great hexagons are a rounder choice than great squares for the invariant rotation planes in which to rotate a 4-polytope isoclinically. The complete hexagonal isoclinic revolution requires 720° like the square isoclinic revolution, but it is completed in 6 chordal steps of 120° each rather than 8 chordal steps of 90° each.

...

== The 600-cell ==

...

== Finally the 120-cell ==

...

== Conclusions ==

Fontaine and Hurley's discovery is more than a formula for the reciprocal of a regular ''n''-polygon diagonal. It also yields the discrete sequence of isocline chords of the distinct isoclinic rotation characteristic of a ''d''-dimensional regular polytope. The characteristic rotational chord sequence of the ''d''-polytope can be represented geometrically in two dimensions on a distinct star polygon, but it lies on a geodesic circle through ''d''-dimensional space. Fontaine and Hurley discovered the geodesic topology of polytopes generally. Their procedure will reveal the geodesics of arbitrary non-uniform polytopes, since it can be applied to a polytope of any dimensionality and irregularity, by first fitting the polytope to the smallest regular polygon whose chords include its chords.

Fontaine and Hurley's discovery of a chordal formula for isoclinic rotations closes the circuit on Kappraff and Adamson's discovery of a rotational connection between dynamical systems, Steinbach's golden fields, and Coxeter's Euclidean geometry of ''n'' dimensions. Application of the Fontaine and Hurley procedure in higher-dimensional spaces demonstrates why the connection exists: because polytope sequences generally, from Steinbach's golden polygon chord sequences, to chord sequences in isoclinic rotation helixes, to subsumption relations in the sequence of regular 4-polytopes, arise as expressions of the reflections and rotations of distinct Coxeter symmetry groups, when those various groups interact.

== Appendix: Sequence of regular 4-polytopes ==
{{Regular convex 4-polytopes|wiki=W:|columns=7}}

== Notes ==
{{Notelist}}

== Citations ==
{{Reflist}}

== References ==
{{Refbegin}}
* {{Cite journal | last=Steinbach | first=Peter | year=1997 | title=Golden fields: A case for the Heptagon | journal=Mathematics Magazine | volume=70 | issue=Feb 1997 | pages=22–31 | doi=10.1080/0025570X.1997.11996494 | jstor=2691048 | ref={{SfnRef|Steinbach|1997}} }}
* {{Cite journal | last=Steinbach | first=Peter | year=2000 | title=Sections Beyond Golden| journal=Bridges: Mathematical Connections in Art, Music and Science | issue=2000 | pages=35-44 | url=https://archive.bridgesmathart.org/2000/bridges2000-35.pdf | ref={{SfnRef|Steinbach|2000}}}}
* {{Cite journal | last1=Kappraff | first1=Jay | last2=Jablan | first2=Slavik | last3=Adamson | first3=Gary | last4=Sazdanovich | first4=Radmila | year=2004 | title=Golden Fields, Generalized Fibonacci Sequences, and Chaotic Matrices | journal=Forma | volume=19 | pages=367-387 | url=https://archive.bridgesmathart.org/2005/bridges2005-369.pdf | ref={{SfnRef|Kappraff, Jablan, Adamson &amp; Sazdanovich|2004}} }}
* {{Cite journal | last1=Kappraff | first1=Jay | last2=Adamson | first2=Gary | year=2004 | title=Polygons and Chaos | journal=Dynamical Systems and Geometric Theories | url=https://archive.bridgesmathart.org/2001/bridges2001-67.pdf | ref={{SfnRef|Kappraff &amp; Adamson|2004}} }}
* {{Cite journal | last1=Fontaine | first1=Anne | last2=Hurley | first2=Susan | year=2006 | title=Proof by Picture: Products and Reciprocals of Diagonal Length Ratios in the Regular Polygon | journal=Forum Geometricorum | volume=6 | pages=97-101 | url=https://scispace.com/pdf/proof-by-picture-products-and-reciprocals-of-diagonal-length-1aian8mgp9.pdf }}
{{Refend}}</text>
      <sha1>9j9qrghhf9t77f3umvw86apt8j0eqr9</sha1>
    </revision>
    <revision>
      <id>2809824</id>
      <parentid>2809787</parentid>
      <timestamp>2026-05-17T03:19:20Z</timestamp>
      <contributor>
        <username>Dc.samizdat</username>
        <id>2856930</id>
      </contributor>
      <comment>/* The 8-point regular polytopes */</comment>
      <origin>2809824</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="47061" sha1="junfaj2on33de43kmqiambn5hkzqpix" xml:space="preserve">{{align|center|David Brooks Christie}}
{{align|center|dc@samizdat.org}}
{{align|center|Draft in progress}}
{{align|center|January 2026 - April 2026}}

&lt;blockquote&gt;Steinbach discovered the formula for the ratios of diagonal to side in the regular polygons. Fontaine and Hurley extended this result, discovering a formula for the reciprocal of a regular polygon chord derived geometrically from the chord's star polygon. We observe that these findings in plane geometry apply more generally, to polytopes of any dimensionality. Fontaine and Hurley's geometric procedure for finding the reciprocals of the chords of a regular polygon from their star polygons also finds the rotational geodesics of any polytope of any dimensionality.&lt;/blockquote&gt;
== Introduction ==
Steinbach discovered the Diagonal Product Formula and the Golden Fields family of ratios of diagonal to side in the regular polygons. He showed how this family extends beyond the pentagon {5} with its well-known golden bisection proportional to 𝜙, finding that the heptagon {7} has an analogous trisection, the nonagon {9} has an analogous quadrasection, and the hendecagon {11} has an analogous pentasection, an extended family of golden proportions with quasiperiodic properties. 

Kappraff and Adamson extended these findings in plane geometry to a theory of Generalized Fibonacci Sequences, showing that the Golden Fields not only do not end with the hendecagon, they form an infinite number of periodic trajectories when operated on by the Mandelbrot operator. They found a relation between the edges of star polygons and dynamical systems in the state of chaos, revealing a connection between chaos theory, number, and rotations in Coxeter Euclidean geometry. 

Fontaine and Hurley examined Steinbach's finding that the length of each chord of a regular polygon is both the product of two chords and the sum of a set of smaller chords, so that in rotations to add is to multiply. They illustrated Steinbach's sets of additive chords lying parallel to each other in the plane (pointing in the same direction), and by applying Steinbach's formula more generally they found another summation relation of signed parallel chords (pointing in opposite directions) which relates each chord length to its reciprocal, and relates the summation to a distinct star polygon rotation. 

We examine these remarkable findings (which stem from study of the chords of humble regular polygons) in higher-dimensional spaces, specifically in the chords, polygons and rotations of the [[120-cell]], the largest four-dimensional regular convex polytope.

== Visualizing the 120-cell ==
{| class=&quot;wikitable floatright&quot; width=&quot;400&quot;
|style=&quot;vertical-align:top&quot;|[[File:120-cell.gif|200px]]&lt;br&gt;Orthographic projection of the 600-point 120-cell &lt;small&gt;&lt;math&gt;\{5,3,3\}&lt;/math&gt;&lt;/small&gt; performing a [[W:SO(4)#Geometry of 4D rotations|simple rotation]].{{Sfn|Hise|2011|loc=File:120-cell.gif|ps=; &quot;Created by Jason Hise with Maya and Macromedia Fireworks. A 3D projection of a 120-cell performing a [[W:SO(4)#Geometry of 4D rotations|simple rotation]].&quot;}} In this simplified rendering only the 120-cell's own edges are shown; its 29 interior chords are not rendered. Therefore even though it is translucent, only its outer surface is visible. The complex interior parts of the 120-cell, all its inscribed 5-cells, 16-cells, 8-cells, 24-cells, 600-cells and its much larger inventory of polyhedra, are completely invisible in this view, as none of their edges are rendered at all.
|style=&quot;vertical-align:top&quot;|[[File:Ortho solid 016-uniform polychoron p33-t0.png|200px]]&lt;br&gt;Orthographic projection of the 600-point [[W:Great grand stellated 120-cell|great grand stellated 120-cell]] &lt;small&gt;&lt;math&gt;\{\tfrac{5}{2},3,3\}&lt;/math&gt;&lt;/small&gt;.{{Sfn|Ruen: Great grand stellated 120-cell|2007}} The 120-cell is its convex hull. The projection to the left renders only the 120-cell's shortest chord, its 1200 edges. The projection above also renders only one of the 120-cell's 30 chords, the edges of its 120 inscribed regular 5-cells. The 120-cell itself (the convex hull) is invisible in this view, as its edges are not rendered.
|}

[[120-cell#Geometry|The 120-cell is the maximally complex regular 4-polytope]], containing inscribed instances of every regular 1-, 2-, 3-, and 4-polytope, except the regular polygons of more than {15} sides. 

The 120-cell is the convex hull of a regular [[120-cell#Relationships among interior polytopes|compound of each of the 6 regular convex 4-polytopes]]. They are the [[5-cell|5-point (5-cell) 4-simplex]], the [[16-cell|8-point (16-cell) 4-orthoplex]], the [[W:Tesseract|16-point (8-cell) tesseract]], the [[24-cell|24-point (24-cell)]], the [[600-cell|120-point (600-cell)]], and the [[120-cell|600-point (120-cell)]]. The 120-cell is the convex hull of a compound of 120 disjoint regular 5-cells, of 75 disjoint 16-cells, of 25 disjoint 24-cells, and of 5 disjoint 600-cells.

The 120-cell contains an even larger inventory of irregular polytopes, created by the intersection of multiple instances of these component regular 4-polytopes. Many are quite unexpected, because they do not occur as components of any regular polytope smaller than the 120-cell. As just one example among the [[120-cell#Concentric hulls|sections of the 120-cell]], there is an irregular 24-point polyhedron with 16 triangle faces and 4 nonagon {9} faces.{{Sfn|Moxness|}}

Most renderings of the 120-cell, like the rotating projection here, only illustrate its outer surface, which is a honeycomb of face-bonded dodecahedral cells. Only the objects in its 3-dimensional surface are rendered, namely the 120 dodecahedra, their pentagon faces, and their edges. Although the 120-cell has chords of 30 distinct lengths, in this kind of simplified rendering only the 120-cell's own edges (its shortest chord) are shown. Its 29 interior chords, the edges of objects in the interior of the 120-cell, are not rendered, so interior objects are not visible at all.

Visualizing the complete interior of the 600-vertex 120-cell in a single image is impractical because of its complexity. Only four 120-cell edges are incident at each vertex, but [[120-cell#Chords|600 chords (of all 30 lengths)]] are incident at ''each'' vertex.

== Compounds in the 120-cell ==
The 8-point (16-cell), not the 5-point (5-cell), is the smallest building block; it compounds to every larger regular 4-polytope. The 5-point (5-cell) does compound to the 600-point (120-cell), but it does not fit into any smaller regular 4-polytope. 

The 8-point (16-cell) compounds by 2 in the 16-point (8-cell), and by 3 in the 24-point (24-cell). The 16-point (8-cell) compounds in the 24-point (24-cell) by 3 non-disjoint instances of itself, with each of the 24 vertices shared by two 16-point (8-cells). The 24-point (24-cell) compounds by 5 disjoint instances of itself in the 120-point (600-cell), and the 120-point (600-cell) compounds by 5 disjoint instances of itself in the 600-point (120-cell).

The 24-point (24-cell) also compounds by &lt;math&gt;5^2&lt;/math&gt; non-disjoint instances of itself in the 120-point (600-cell); it compounds in 5 disjoint instances of itself, 10 (not 5) different ways. Whichever set of 5 disjoint 24-point (24-cells) are assembled, the resulting 120-point (600-cell) contains 25 distinct 24-point (24-cells), not just 5 (or 10). This implies that 15 disjoint 8-point (16-cells) will construct a 120-point (600-cell), which will contain 75 distinct 8-point (16-cells). 

The 600-point (120-cell) is 5 disjoint 120-point (600-cells), just 2 different ways (not 5 or 10 ways), so it is 10 distinct 120-point (600-cells). This implies that the 8-point (16-cell) compounds by 3 times &lt;math&gt;5^2&lt;/math&gt; (75) disjoint instances of itself in the 600-point (120-cell), which contains &lt;math&gt;3^2&lt;/math&gt; times  &lt;math&gt;5^2&lt;/math&gt; (225) distinct instances of the 24-point (24-cell), and  &lt;math&gt;3^3&lt;/math&gt; times &lt;math&gt;5^2&lt;/math&gt; (675) distinct instances of the 8-point (16-cell). 

These facts were discovered painstakingly by various researchers, and no one has found a general rule governing subsumption relations among regular polytopes. The reasons for some of their numeric incidence relations are far from obvious. [[W:Pieter Hendrik Schoute|Schoute]] was the first to see that the 120-point (600-cell) is a compound of 5 24-point (24-cells) ''10 different ways'', and after he saw it a hundred years lapsed until Denney, Hooker, Johnson, Robinson, Butler &amp; Claiborne proved his result, and showed why.{{Sfn|Denney, Hooker, Johnson, Robinson, Butler &amp; Claiborne|2020|loc=''The geometry of H4 polytopes''}}

So much for the compounds of 16-cells. The 120-cell is also the convex hull of the compound of 120 disjoint regular 5-cells. That stellated compound (without its convex hull of 120-cell edges) is the [[w:Great_grand_stellated_120-cell|great grand stellated 120-cell]] illustrated above, the final regular [[W:Stellation|stellation]] of the 120-cell, and the only [[W:Schläfli-Hess polychoron|regular star 4-polytope]] to have the 120-cell for its convex hull. The edges of the great grand stellated 120-cell are &lt;math&gt;\phi^6&lt;/math&gt; as long as those of its 120-cell [[W:List of polyhedral stellations#Stellation process|stellation core]] deep inside.

The compound of 120 disjoint 5-point (5-cells) can be seen to be equivalent to the compound of 5 disjoint 120-point (600-cells), as follows. Beginning with a single 120-point (600-cell), expand each vertex into a regular 5-cell, by adding 4 new equidistant vertices, such that the 5 vertices form a regular 5-cell inscribed in the 3-sphere. The 120 5-cells are disjoint, and the 600 vertices form 5 disjoint 120-point (600-cells): a 120-cell.

== Thirty distinguished distances ==
The 30 numbers listed in the table are all-important in Euclidean geometry. A case can be made on symmetry grounds that their squares are the 30 most important numbers between 0 and 4. The 30 rows of the table are the 30 distinct [[120-cell#Geodesic rectangles|chord lengths of the unit-radius 120-cell]], the largest regular convex 4-polytope. Since the 120-cell subsumes all smaller regular polytopes, its 30 chords are the complete chord set of all the regular polytopes that can be constructed in the first four dimensions of Euclidean space, except for regular polygons of more than 15 sides.

{| class=&quot;wikitable&quot; style=&quot;white-space:nowrap;text-align:center&quot;
!rowspan=2|&lt;math&gt;c_t&lt;/math&gt;
!rowspan=2|arc
!rowspan=2|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{n}\right\}&lt;/math&gt;&lt;/small&gt;
!rowspan=2|&lt;math&gt;\left\{p\right\}&lt;/math&gt;
!rowspan=2|&lt;small&gt;&lt;math&gt;m\left\{\frac{k}{d}\right\}&lt;/math&gt;&lt;/small&gt;
!rowspan=2|Steinbach roots
!colspan=7|Chord lengths of the unit 120-cell
|-
!colspan=5|unit-radius length &lt;math&gt;c_t&lt;/math&gt;
!colspan=2|unit-edge length &lt;math&gt;c_t/c_1&lt;/math&gt;&lt;br&gt;in 120-cell of radius &lt;math&gt;c_8=\sqrt{2}\phi^2&lt;/math&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{1,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;15.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{30\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{30\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;c_{4,1}-c_{2,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7-3 \sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.270091&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2} \phi ^2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2 \phi ^4}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.072949}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{2,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;25.2{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{2}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \left\{15\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(c_{18,1}-c_{4,1}\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{3-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.437016&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2} \phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2 \phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.190983}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.61803&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{3,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;36{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{10\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3 \left\{\frac{10}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(\sqrt{5}-1\right) c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(\sqrt{5}-1\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.618034&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{\phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.381966}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.28825&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{4,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;41.4{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{c_{8,1}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.707107&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.61803&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{5,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;44.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{4}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \left\{\frac{15}{2}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} c_{2,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{9-3 \sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.756934&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{\frac{3}{2}}}{\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2 \phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.572949}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} \phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.80252&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{6,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;49.1{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{17}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{5-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{5-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.831254&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt[4]{5} \sqrt{\frac{1}{\phi }}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\sqrt{5}}{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.690983}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\phi ^3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.07768&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{7,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;56.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{20}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{1}{\phi }} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{2}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.93913&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{\frac{\psi }{\phi }}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\psi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.881966}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\psi  \phi ^3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.47709&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;60{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{5}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{6\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{6\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.70246&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{9,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;66.1{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{40}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{1}{2 \phi }} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.09132&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{\frac{\chi }{\phi }}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\chi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.19098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\chi  \phi ^3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.04057&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{10,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;69.8{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{11}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi  c_{4,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1+\sqrt{5}}{2 \sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.14412&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\phi }{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\phi ^2}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.30902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^3&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.23607&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{11,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;72{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{6}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{5\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{5\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\frac{1}{\phi }} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\frac{2}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.17557&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3-\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3-\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.38197}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \sqrt{3-\phi } \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.3525&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{12,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;75.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{24}{5}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.22474&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.53457&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{13,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;81.1{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{13}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{9-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{9-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.30038&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{9-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(9-\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.69098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(9-\sqrt{5}\right)} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.8146&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{14,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;84.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{40}{9}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt[4]{5} \sqrt{\phi } c_{8,1}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt[4]{5} \sqrt{1+\sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.345&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt[4]{5} \sqrt{\phi }}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\sqrt{5} \phi }{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.80902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\phi ^5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.9798&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{15,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;90.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{4\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{4\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 c_{4,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.41421&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.23607&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{16,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;95.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{29}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{11-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.4802&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(11-\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.19098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(11-\sqrt{5}\right)} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.48037&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{17,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;98.9{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{31}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7+\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{7+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.51954&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{7+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(7+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.30902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\psi  \phi ^5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.62605&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{18,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;104.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{8}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{15}{4}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.58114&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{5} \sqrt{\phi ^4}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.8541&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{19,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;108.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{9}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{10}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;c_{3,1}+c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(1+\sqrt{5}\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.61803&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1+\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.61803}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \phi ^3&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.9907&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{20,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;110.2{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{13-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.64042&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(13-\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.69098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\phi ^2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.07359&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{21,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;113.9{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{19}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.67601&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.80902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\frac{\chi }{\phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.20537&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{22,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;120{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{10}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{3\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{3\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.73205&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{6} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.41285&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{23,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;124.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{41}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{\phi }+\frac{5}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{2}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.7658&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4-\frac{\psi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4-\frac{\psi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.11803}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\chi  \phi ^5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.53779&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{24,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;130.9{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{20}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{11+\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.81907&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(11+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.30902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\frac{\sqrt{5}}{\phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.73503&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{25,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;135.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{11}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{11}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7+3 \sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7+3 \sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.85123&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\phi ^2}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\phi ^4}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.42705}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^4&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.8541&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{26,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;138.6{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{12}{5}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.87083&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{7} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.92667&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{27,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;144{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{12}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{5}{2}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(5+\sqrt{5}\right)} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(5+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.90211&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\phi +2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2+\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.61803}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{2 \phi +4}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.0425&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{28,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;154.8{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{13}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{13}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{13+\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.95167&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(13+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.80902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\frac{1}{\phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.22598&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{29,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;164.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{14}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{15}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi  c_{12,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{\frac{3}{2}} \left(1+\sqrt{5}\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.98168&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}} \phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3 \phi ^2}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.92705}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} \phi ^3&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.33708&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{30,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;180{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{15}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{2\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{2\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \sqrt{2} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.40492&lt;/math&gt;&lt;/small&gt;
|-
|rowspan=4 colspan=6|
|rowspan=4 colspan=4|
&lt;small&gt;&lt;math&gt;\phi&lt;/math&gt;&lt;/small&gt; is the golden ratio:&lt;br&gt;
&lt;small&gt;&lt;math&gt;\phi ^2-\phi -1=0&lt;/math&gt;&lt;/small&gt;&lt;br&gt;
&lt;small&gt;&lt;math&gt;\frac{1}{\phi }+1=\phi&lt;/math&gt;&lt;/small&gt;, and: &lt;small&gt;&lt;math&gt;\phi+1=\phi^2&lt;/math&gt;&lt;/small&gt;&lt;br&gt;
&lt;small&gt;&lt;math&gt;\frac{1}{\phi }::1::\phi ::\phi ^2&lt;/math&gt;&lt;/small&gt;&lt;br&gt;
&lt;small&gt;&lt;math&gt;1/\phi&lt;/math&gt;&lt;/small&gt; and &lt;small&gt;&lt;math&gt;\phi&lt;/math&gt;&lt;/small&gt; are the golden sections of &lt;small&gt;&lt;math&gt;\sqrt{5}&lt;/math&gt;&lt;/small&gt;:&lt;br&gt;
&lt;small&gt;&lt;math&gt;\phi +\frac{1}{\phi }=\sqrt{5}&lt;/math&gt;&lt;/small&gt;
|colspan=2|&lt;small&gt;&lt;math&gt;\phi = (\sqrt{5} + 1)/2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.618034&lt;/math&gt;&lt;/small&gt;
|-
|colspan=2|&lt;small&gt;&lt;math&gt;\chi = (3\sqrt{5} + 1)/2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.854102&lt;/math&gt;&lt;/small&gt;
|-
|colspan=2|&lt;small&gt;&lt;math&gt;\psi = (3\sqrt{5} - 1)/2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.854102&lt;/math&gt;&lt;/small&gt;
|-
|colspan=2|&lt;small&gt;&lt;math&gt;\psi = 11/\chi = 22/(3\sqrt{5} + 1)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.854102&lt;/math&gt;&lt;/small&gt;
|}

...

== The 8-point regular polytopes ==
In 2-space we have the regular 8-point octagon, in 3-space the regular 8-point cube, and in 4-space the regular 8-point [[16-cell]].

A planar octagon with rigid edges of unit length has chords of length:

:&lt;math&gt;r_1=1,r_2=\sqrt{2+\sqrt{2}} \approx 1.84776,r_3=1+\sqrt{2} \approx 2.41421,r_4=\sqrt{4 + \sqrt{8}} \approx 2.61313&lt;/math&gt;

The chord ratio &lt;math&gt;r_3=1+\sqrt{2}&lt;/math&gt; is a geometrical proportion, the [[W:Silver ratio|silver ratio]]. Fontaine and Hurley's procedure for obtaining the reciprocal of a chord tells us that:

:&lt;math&gt;r_3-r_1-r_1=1/r_3 \approx 0.41421&lt;/math&gt;

Note that &lt;math&gt;1/r_3=\sqrt{2}-1=r_3-2&lt;/math&gt;.

If we embed this planar octagon in 3-space, we can make it skew, repositioning its vertices so that each is one unit-edge length distant from three others instead of two others, at the vertices of a unit-edge cube with chords of length:

:&lt;math&gt;r_1=1, r_2=\sqrt{2}, r_3=\sqrt{3}, r_4=\sqrt{2}&lt;/math&gt;

If we embed this cube in 4-space, we can skew it some more, repositioning its vertices so that each is one unit-edge length distant from six others instead of three others, at the vertices of a unit-edge 4-polytope with chords of length:

:&lt;math&gt;r_1=1,r_2=1,r_3=1,r_4=\sqrt{2}&lt;/math&gt;

All of its chords except its long diameters are the same unit length as its edge. In fact they are its 24 edges, and it is a 16-cell of radius &lt;small&gt;&lt;math&gt;1/\sqrt{2}&lt;/math&gt;&lt;/small&gt;.

[[File:octagon16cell.png|thumb|Orthogonal projection of a regular 16-cell to the [[16-cell#Projections|B&lt;sub&gt;4&lt;/sub&gt; Coxeter plane]]. Only its edges are shown; its long diameter chords are not drawn. All 24 edges are the same length. Only the edges of the two disjoint squares lie parallel to the projection plane, in completely orthogonal central planes.]]

The [[16-cell]] is the [[W:Regular convex 4-polytope|regular convex 4-polytope]] with [[W:Schläfli symbol|Schläfli symbol]] {3,3,4}. It has 8 vertices, 24 edges, 32 equilateral triangle faces, and 16 regular tetrahedron cells. It is the [[16-cell#Octahedral dipyramid|four-dimensional analogue of the octahedron]], and each of its four orthogonal central hyperplanes is an octahedron.

The only planar regular polygons found in the 16-cell are face triangles and central plane squares, but the 16-cell also contains a skew regular octagon, its [[W:Petrie polygon|Petrie polygon]]. The chords of this regular octagon, which lies skew in 4-space, are those given above for the 16-cell, as opposed to those for the cube or the regular octagon in the plane. The 16-cell is a construct of 3 Petrie octagons which share the same 8 vertices but have disjoint sets of 8 edges each.

The regular octad has higher symmetry in 4-space than it does in 2-space. The 16-cell is the 4-orthoplex, the simplest regular 4-polytope after the [[5-cell|4-simplex]]. All the larger regular 4-polytopes, including the 120-cell, are compounds of the 16-cell. The regular octagon exhibits this high symmetry only when embedded in 4-space at the vertices of the 16-cell.

The 16-cell constitutes an [[W:Orthonormal basis|orthonormal basis]] for the choice of a 4-dimensional Cartesian reference frame, because its vertices define four orthogonal axes. The eight vertices of a unit-radius 16-cell are (±1, 0, 0, 0), (0, ±1, 0, 0), (0, 0, ±1, 0), (0, 0, 0, ±1). All vertices are connected by &lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt; edges except opposite pairs. 

The vertex coordinates of the 16-cell form 6 central squares lying in 6 pairwise [[W:Orthogonal|orthogonal]] coordinate planes. Great squares in ''opposite'' planes that do not share an axis (e.g. in the ''xy'' and ''wz'' planes) are completely disjoint (they do not intersect at any vertices). These planes are [[W:Completely orthogonal|completely orthogonal]].{{Efn|name=Six orthogonal planes of the Cartesian basis}}

Since this unit-radius coordinate system is convenient, let us derive the unit-radius 16-cell by skewing a unit-radius planar octagon, which has chords of length:

:&lt;math&gt;r_1=\sqrt{2-\sqrt{2}} \approx 0.76537,r_2=\sqrt{2},r_3=\sqrt{2+\sqrt{2}} \approx 1.84776,r_4=2&lt;/math&gt;

We will need a planar octagon with rigid &lt;math&gt;r_2&lt;/math&gt; chords, rather than one with rigid &lt;math&gt;r_1&lt;/math&gt; edges. The octagon's &lt;math&gt;r_2&lt;/math&gt; chords form two disjoint great squares, visible in the orthogonal projection, which we can reposition in 3-space to form a cube by making them parallel, and in 4-space to form a 16-cell by making them completely orthogonal.

In the 16-cell the two disjoint great squares formed by the &lt;math&gt;r_2&lt;/math&gt; chords are both parallel and perpendicular to each other. A ''simple'' rotation of the 16-cell in ''one'' of those two central planes rotates that square like a wheel, while the other square does not move. The four vertices of the rotating square orbit on a great circle in the plane.

The &lt;math&gt;r_1&lt;/math&gt; chords of the 16-cell form a Petrie polygon which zig-zags back and forth between the two completely orthogonal &lt;math&gt;r_2&lt;/math&gt; squares.

The &lt;math&gt;r_3&lt;/math&gt; chords of the 16-cell form a circular helix, visible as a skew {8/3} octagram in the orthogonal projection. A ''double'' rotation of the 16-cell, in ''both'' of the two completely orthogonal &lt;math&gt;r_2&lt;/math&gt; central square planes at once by the same angle, moves the eight vertices along the circular helix over the &lt;math&gt;r_3&lt;/math&gt; chords. The circular helix is a [[w:Geodesic|geodesic]] great circle on the 3-sphere of a special kind: it does not lie in a single central plane, its circumference is &lt;math&gt;4 \pi&lt;/math&gt;, and it occurs in either a left or right hand chiral form.

[[W:Rotations in 4-dimensional Euclidean space|Rotations in 4-dimensional Euclidean space]] can be seen as the composition of two 2-dimensional rotations in completely orthogonal planes. The general rotation in 4-space is a double rotation in pairs of completely orthogonal planes. Two completely orthogonal planes are called invariant planes of the rotation when all points in the plane rotate on circles that remain in the plane, even as the whole plane tilts sideways (like a coin flipping) into another plane. The two completely orthogonal rotations of each plane (like a wheel, and like a coin flipping) are simultaneous but independent, in that they are not geometrically constrained to turn at the same rate. However, the most circular kind of rotation (as opposed to an elliptical double rotation of a rigid spherical object) occurs when the invariant planes do rotate through the same angle in the same time interval. Such equi-angled double rotations are called [[w:SO(4)#Isoclinic_rotations|isoclinic]], also [[w:William_Kingdon_Clifford|Clifford]] displacements.

The 16-cell is the simplest possible frame in which to [[16-cell#Rotations|observe 4-dimensional rotations]] because its characteristic rotations feature a single pair of invariant rotation planes. In the 16-cell an isoclinic rotation by 90° in any pair of invariant completely orthogonal square central planes takes every square central plane to its completely orthogonal square central plane in a twisting displacement, as they tilt sideways 90° into each other's plane while rotating 90° internally. All the vertices move at once on the same circular helix geodesic, displaced 90° in 8 orthogonal directions, and the rigid 16-cell assumes a new orientation in 4-space. When the 90° isoclinic rotation is continued in the same rotational direction through an additional 90°, each vertex is again displaced 90°, but from the new orientation in a direction orthogonal to its first 90° displacement. After 360° of rotation each vertex reaches its antipodal position.

The trajectory of each vertex over each 90° isoclinic rotational displacement is a one-eighth segment of its geodesic orbit. Its entire orbit traces a circular helix in 4-space over eight &lt;math&gt;r_3&lt;/math&gt; chords, and also traces an ordinary great circle twice over the four &lt;math&gt;r_2&lt;/math&gt; chords within one of the two moving invariant rotation planes. In the course of a 720° isoclinic rotation each vertex departs from all 8 vertex positions just once and returns to its original position, and the 16-cell returns to its original orientation.

== Hypercubes ==
The long diameter of the unit-edge [[W:Hypercube|hypercube]] of dimension &lt;small&gt;&lt;math&gt;n&lt;/math&gt;&lt;/small&gt; is &lt;small&gt;&lt;math&gt;\sqrt{n}&lt;/math&gt;&lt;/small&gt;, so the unit-edge [[w:Tesseract|4-hypercube, the 16-point (8-cell) tesseract,]] has chords:
:&lt;math&gt;r_1=\sqrt{1},r_2=\sqrt{2},r_3=\sqrt{3},r_4=\sqrt{4}&lt;/math&gt;
Uniquely in its 4-dimensional case, the hypercube's edge length equals its radius, like the hexagon. We call such polytopes ''radially equilateral'', because they can be constructed from equilateral triangles which meet at their center, each contributing two radii and an edge. The cuboctahedron and the 24-cell are also radially equilateral.

The [[W:Tesseract|tesseract]] is the [[W:Regular convex 4-polytope|regular convex 4-polytope]] with [[W:Schläfli symbol|Schläfli symbol]] {4,3,3}. It has 16 vertices, 32 edges, 24 square faces, and 8 cube cells. It is the four-dimensional analogue of the cube.

The tesseract is the [[W:Dual polytope|dual polytope]] of the 16-cell. They have the same Petrie polygon, the regular octagon, but the tesseract contains 2 disjoint instances and 4 distinct instances of the skew octagon. We can construct the tesseract by skewing two planar octagons. Because the tesseract is radially equilateral (unlike the 16-cell), we start with our original octagon of unit-edge length, rather than the octagon of edge length &lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt; that we needed to build the unit-radius 16-cell.

For our tesseract construction we skew each planar octagon into a cube, so we have a compound of two completely orthogonal cubes. Provided the planes were completely orthogonal in 4-space and we skewed them both the same way, the 16 vertices will be the vertices of a tesseract with half of its 32 edges missing.

The 16-point tesseract is the convex hull of a compound of two 8-point 16-cells, in exact dimensional analogy to the way the 8-point cube is the convex hull of a [[W:Stellated octahedron|compound of two regular 4-point tetrahedra]]. The [[W:Demihypercube|demihypercubes]] occupy alternate vertices of the hypercubes. The diagonals of the square faces of the unit-radius tesseract are the &lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt; edges of two unit-radius 16-cells, which are also the edges of the square central planes.

Because the tesseract contains two 16-cells in alternate positions it has two sets of 6 orthogonal square central planes. Two angles are required to specify the relationship between two planes in 4-space. Pairs of planes within each 16-cell are 90° apart in one angle, and either 0° or 90° apart in the other angle. They are 90° apart in both angles if and only if they are completely orthogonal planes, 90° apart by isoclinic rotation, with no vertices in common and their corresponding vertices 180° apart. Otherwise they are 0° apart in one of the angles, 90° apart by simple rotation with their corresponding vertices 90° apart, and they intersect in one axis and lie in a common 3-dimensional hyperplane.{{Efn|A double rotation in which one of the two angles of rotation is 0°, so that one of the completely orthogonal invariant planes does not rotate, is called a simple rotation. Ordinary rotations observed in a 3-dimensional space are simple rotations.}}

A pair of square central planes from alternate 16-cells are 60° apart by isoclinic rotation, with their corresponding vertices 120° apart. The planes are not orthogonal or parallel, so they intersect in a line somewhere, but they have no vertices in common, they have no 3-dimensional hyperplane in common, and they cannot reach each other by simple rotation. Such pairs of objects are called [[W:Clifford parallel|Clifford parallel]] because all their corresponding pairs of vertices are the same distance apart, although they are not parallel in the usual sense, because they have a common center. Not only the alternate 16-cells' corresponding square central planes, but also the 16-cells themselves, are Clifford parallel objects.

We can rotate the tesseract isoclinically the way we rotated the 16-cell, by 90° in two completely orthogonal invariant square central planes, with the same effect on both alternate 16-cells. In the course of a 720° isoclinic rotation in invariant square central planes each vertex departs from all 8 vertex positions of its 16-cell just once and returns to its original position, but it does not visit the vertex positions of the other 16-cell. The skew octagon geodesic orbits of the 16 vertices lie on two disjoint octagram circular helixes of the same chirality, which are Clifford parallel objects that form a circular double helix.

== The 24-cell ==
In 2-space we have the radially equilateral 6-point hexagon. In 3-space we have the radially equilateral 12-point cuboctahedron, with 4 hexagonal central planes. In 4-space we have the radially equilateral 24-point 24-cell, with 4 cuboctahedral central hyperplanes and 16 hexagonal central planes.

Great hexagons are a rounder choice than great squares for the invariant rotation planes in which to rotate a 4-polytope isoclinically. The complete hexagonal isoclinic revolution requires 720° like the square isoclinic revolution, but it is completed in 6 chordal steps of 120° each rather than 8 chordal steps of 90° each.

...

== The 600-cell ==

...

== Finally the 120-cell ==

...

== Conclusions ==

Fontaine and Hurley's discovery is more than a formula for the reciprocal of a regular ''n''-polygon diagonal. It also yields the discrete sequence of isocline chords of the distinct isoclinic rotation characteristic of a ''d''-dimensional regular polytope. The characteristic rotational chord sequence of the ''d''-polytope can be represented geometrically in two dimensions on a distinct star polygon, but it lies on a geodesic circle through ''d''-dimensional space. Fontaine and Hurley discovered the geodesic topology of polytopes generally. Their procedure will reveal the geodesics of arbitrary non-uniform polytopes, since it can be applied to a polytope of any dimensionality and irregularity, by first fitting the polytope to the smallest regular polygon whose chords include its chords.

Fontaine and Hurley's discovery of a chordal formula for isoclinic rotations closes the circuit on Kappraff and Adamson's discovery of a rotational connection between dynamical systems, Steinbach's golden fields, and Coxeter's Euclidean geometry of ''n'' dimensions. Application of the Fontaine and Hurley procedure in higher-dimensional spaces demonstrates why the connection exists: because polytope sequences generally, from Steinbach's golden polygon chord sequences, to chord sequences in isoclinic rotation helixes, to subsumption relations in the sequence of regular 4-polytopes, arise as expressions of the reflections and rotations of distinct Coxeter symmetry groups, when those various groups interact.

== Appendix: Sequence of regular 4-polytopes ==
{{Regular convex 4-polytopes|wiki=W:|columns=7}}

== Notes ==
{{Notelist}}

== Citations ==
{{Reflist}}

== References ==
{{Refbegin}}
* {{Cite journal | last=Steinbach | first=Peter | year=1997 | title=Golden fields: A case for the Heptagon | journal=Mathematics Magazine | volume=70 | issue=Feb 1997 | pages=22–31 | doi=10.1080/0025570X.1997.11996494 | jstor=2691048 | ref={{SfnRef|Steinbach|1997}} }}
* {{Cite journal | last=Steinbach | first=Peter | year=2000 | title=Sections Beyond Golden| journal=Bridges: Mathematical Connections in Art, Music and Science | issue=2000 | pages=35-44 | url=https://archive.bridgesmathart.org/2000/bridges2000-35.pdf | ref={{SfnRef|Steinbach|2000}}}}
* {{Cite journal | last1=Kappraff | first1=Jay | last2=Jablan | first2=Slavik | last3=Adamson | first3=Gary | last4=Sazdanovich | first4=Radmila | year=2004 | title=Golden Fields, Generalized Fibonacci Sequences, and Chaotic Matrices | journal=Forma | volume=19 | pages=367-387 | url=https://archive.bridgesmathart.org/2005/bridges2005-369.pdf | ref={{SfnRef|Kappraff, Jablan, Adamson &amp; Sazdanovich|2004}} }}
* {{Cite journal | last1=Kappraff | first1=Jay | last2=Adamson | first2=Gary | year=2004 | title=Polygons and Chaos | journal=Dynamical Systems and Geometric Theories | url=https://archive.bridgesmathart.org/2001/bridges2001-67.pdf | ref={{SfnRef|Kappraff &amp; Adamson|2004}} }}
* {{Cite journal | last1=Fontaine | first1=Anne | last2=Hurley | first2=Susan | year=2006 | title=Proof by Picture: Products and Reciprocals of Diagonal Length Ratios in the Regular Polygon | journal=Forum Geometricorum | volume=6 | pages=97-101 | url=https://scispace.com/pdf/proof-by-picture-products-and-reciprocals-of-diagonal-length-1aian8mgp9.pdf }}
{{Refend}}</text>
      <sha1>junfaj2on33de43kmqiambn5hkzqpix</sha1>
    </revision>
    <revision>
      <id>2809825</id>
      <parentid>2809824</parentid>
      <timestamp>2026-05-17T03:34:48Z</timestamp>
      <contributor>
        <username>Dc.samizdat</username>
        <id>2856930</id>
      </contributor>
      <comment>/* The 8-point regular polytopes */</comment>
      <origin>2809825</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="47074" sha1="f6mvhwplgq8us2odbroo9xo8ycfbu54" xml:space="preserve">{{align|center|David Brooks Christie}}
{{align|center|dc@samizdat.org}}
{{align|center|Draft in progress}}
{{align|center|January 2026 - April 2026}}

&lt;blockquote&gt;Steinbach discovered the formula for the ratios of diagonal to side in the regular polygons. Fontaine and Hurley extended this result, discovering a formula for the reciprocal of a regular polygon chord derived geometrically from the chord's star polygon. We observe that these findings in plane geometry apply more generally, to polytopes of any dimensionality. Fontaine and Hurley's geometric procedure for finding the reciprocals of the chords of a regular polygon from their star polygons also finds the rotational geodesics of any polytope of any dimensionality.&lt;/blockquote&gt;
== Introduction ==
Steinbach discovered the Diagonal Product Formula and the Golden Fields family of ratios of diagonal to side in the regular polygons. He showed how this family extends beyond the pentagon {5} with its well-known golden bisection proportional to 𝜙, finding that the heptagon {7} has an analogous trisection, the nonagon {9} has an analogous quadrasection, and the hendecagon {11} has an analogous pentasection, an extended family of golden proportions with quasiperiodic properties. 

Kappraff and Adamson extended these findings in plane geometry to a theory of Generalized Fibonacci Sequences, showing that the Golden Fields not only do not end with the hendecagon, they form an infinite number of periodic trajectories when operated on by the Mandelbrot operator. They found a relation between the edges of star polygons and dynamical systems in the state of chaos, revealing a connection between chaos theory, number, and rotations in Coxeter Euclidean geometry. 

Fontaine and Hurley examined Steinbach's finding that the length of each chord of a regular polygon is both the product of two chords and the sum of a set of smaller chords, so that in rotations to add is to multiply. They illustrated Steinbach's sets of additive chords lying parallel to each other in the plane (pointing in the same direction), and by applying Steinbach's formula more generally they found another summation relation of signed parallel chords (pointing in opposite directions) which relates each chord length to its reciprocal, and relates the summation to a distinct star polygon rotation. 

We examine these remarkable findings (which stem from study of the chords of humble regular polygons) in higher-dimensional spaces, specifically in the chords, polygons and rotations of the [[120-cell]], the largest four-dimensional regular convex polytope.

== Visualizing the 120-cell ==
{| class=&quot;wikitable floatright&quot; width=&quot;400&quot;
|style=&quot;vertical-align:top&quot;|[[File:120-cell.gif|200px]]&lt;br&gt;Orthographic projection of the 600-point 120-cell &lt;small&gt;&lt;math&gt;\{5,3,3\}&lt;/math&gt;&lt;/small&gt; performing a [[W:SO(4)#Geometry of 4D rotations|simple rotation]].{{Sfn|Hise|2011|loc=File:120-cell.gif|ps=; &quot;Created by Jason Hise with Maya and Macromedia Fireworks. A 3D projection of a 120-cell performing a [[W:SO(4)#Geometry of 4D rotations|simple rotation]].&quot;}} In this simplified rendering only the 120-cell's own edges are shown; its 29 interior chords are not rendered. Therefore even though it is translucent, only its outer surface is visible. The complex interior parts of the 120-cell, all its inscribed 5-cells, 16-cells, 8-cells, 24-cells, 600-cells and its much larger inventory of polyhedra, are completely invisible in this view, as none of their edges are rendered at all.
|style=&quot;vertical-align:top&quot;|[[File:Ortho solid 016-uniform polychoron p33-t0.png|200px]]&lt;br&gt;Orthographic projection of the 600-point [[W:Great grand stellated 120-cell|great grand stellated 120-cell]] &lt;small&gt;&lt;math&gt;\{\tfrac{5}{2},3,3\}&lt;/math&gt;&lt;/small&gt;.{{Sfn|Ruen: Great grand stellated 120-cell|2007}} The 120-cell is its convex hull. The projection to the left renders only the 120-cell's shortest chord, its 1200 edges. The projection above also renders only one of the 120-cell's 30 chords, the edges of its 120 inscribed regular 5-cells. The 120-cell itself (the convex hull) is invisible in this view, as its edges are not rendered.
|}

[[120-cell#Geometry|The 120-cell is the maximally complex regular 4-polytope]], containing inscribed instances of every regular 1-, 2-, 3-, and 4-polytope, except the regular polygons of more than {15} sides. 

The 120-cell is the convex hull of a regular [[120-cell#Relationships among interior polytopes|compound of each of the 6 regular convex 4-polytopes]]. They are the [[5-cell|5-point (5-cell) 4-simplex]], the [[16-cell|8-point (16-cell) 4-orthoplex]], the [[W:Tesseract|16-point (8-cell) tesseract]], the [[24-cell|24-point (24-cell)]], the [[600-cell|120-point (600-cell)]], and the [[120-cell|600-point (120-cell)]]. The 120-cell is the convex hull of a compound of 120 disjoint regular 5-cells, of 75 disjoint 16-cells, of 25 disjoint 24-cells, and of 5 disjoint 600-cells.

The 120-cell contains an even larger inventory of irregular polytopes, created by the intersection of multiple instances of these component regular 4-polytopes. Many are quite unexpected, because they do not occur as components of any regular polytope smaller than the 120-cell. As just one example among the [[120-cell#Concentric hulls|sections of the 120-cell]], there is an irregular 24-point polyhedron with 16 triangle faces and 4 nonagon {9} faces.{{Sfn|Moxness|}}

Most renderings of the 120-cell, like the rotating projection here, only illustrate its outer surface, which is a honeycomb of face-bonded dodecahedral cells. Only the objects in its 3-dimensional surface are rendered, namely the 120 dodecahedra, their pentagon faces, and their edges. Although the 120-cell has chords of 30 distinct lengths, in this kind of simplified rendering only the 120-cell's own edges (its shortest chord) are shown. Its 29 interior chords, the edges of objects in the interior of the 120-cell, are not rendered, so interior objects are not visible at all.

Visualizing the complete interior of the 600-vertex 120-cell in a single image is impractical because of its complexity. Only four 120-cell edges are incident at each vertex, but [[120-cell#Chords|600 chords (of all 30 lengths)]] are incident at ''each'' vertex.

== Compounds in the 120-cell ==
The 8-point (16-cell), not the 5-point (5-cell), is the smallest building block; it compounds to every larger regular 4-polytope. The 5-point (5-cell) does compound to the 600-point (120-cell), but it does not fit into any smaller regular 4-polytope. 

The 8-point (16-cell) compounds by 2 in the 16-point (8-cell), and by 3 in the 24-point (24-cell). The 16-point (8-cell) compounds in the 24-point (24-cell) by 3 non-disjoint instances of itself, with each of the 24 vertices shared by two 16-point (8-cells). The 24-point (24-cell) compounds by 5 disjoint instances of itself in the 120-point (600-cell), and the 120-point (600-cell) compounds by 5 disjoint instances of itself in the 600-point (120-cell).

The 24-point (24-cell) also compounds by &lt;math&gt;5^2&lt;/math&gt; non-disjoint instances of itself in the 120-point (600-cell); it compounds in 5 disjoint instances of itself, 10 (not 5) different ways. Whichever set of 5 disjoint 24-point (24-cells) are assembled, the resulting 120-point (600-cell) contains 25 distinct 24-point (24-cells), not just 5 (or 10). This implies that 15 disjoint 8-point (16-cells) will construct a 120-point (600-cell), which will contain 75 distinct 8-point (16-cells). 

The 600-point (120-cell) is 5 disjoint 120-point (600-cells), just 2 different ways (not 5 or 10 ways), so it is 10 distinct 120-point (600-cells). This implies that the 8-point (16-cell) compounds by 3 times &lt;math&gt;5^2&lt;/math&gt; (75) disjoint instances of itself in the 600-point (120-cell), which contains &lt;math&gt;3^2&lt;/math&gt; times  &lt;math&gt;5^2&lt;/math&gt; (225) distinct instances of the 24-point (24-cell), and  &lt;math&gt;3^3&lt;/math&gt; times &lt;math&gt;5^2&lt;/math&gt; (675) distinct instances of the 8-point (16-cell). 

These facts were discovered painstakingly by various researchers, and no one has found a general rule governing subsumption relations among regular polytopes. The reasons for some of their numeric incidence relations are far from obvious. [[W:Pieter Hendrik Schoute|Schoute]] was the first to see that the 120-point (600-cell) is a compound of 5 24-point (24-cells) ''10 different ways'', and after he saw it a hundred years lapsed until Denney, Hooker, Johnson, Robinson, Butler &amp; Claiborne proved his result, and showed why.{{Sfn|Denney, Hooker, Johnson, Robinson, Butler &amp; Claiborne|2020|loc=''The geometry of H4 polytopes''}}

So much for the compounds of 16-cells. The 120-cell is also the convex hull of the compound of 120 disjoint regular 5-cells. That stellated compound (without its convex hull of 120-cell edges) is the [[w:Great_grand_stellated_120-cell|great grand stellated 120-cell]] illustrated above, the final regular [[W:Stellation|stellation]] of the 120-cell, and the only [[W:Schläfli-Hess polychoron|regular star 4-polytope]] to have the 120-cell for its convex hull. The edges of the great grand stellated 120-cell are &lt;math&gt;\phi^6&lt;/math&gt; as long as those of its 120-cell [[W:List of polyhedral stellations#Stellation process|stellation core]] deep inside.

The compound of 120 disjoint 5-point (5-cells) can be seen to be equivalent to the compound of 5 disjoint 120-point (600-cells), as follows. Beginning with a single 120-point (600-cell), expand each vertex into a regular 5-cell, by adding 4 new equidistant vertices, such that the 5 vertices form a regular 5-cell inscribed in the 3-sphere. The 120 5-cells are disjoint, and the 600 vertices form 5 disjoint 120-point (600-cells): a 120-cell.

== Thirty distinguished distances ==
The 30 numbers listed in the table are all-important in Euclidean geometry. A case can be made on symmetry grounds that their squares are the 30 most important numbers between 0 and 4. The 30 rows of the table are the 30 distinct [[120-cell#Geodesic rectangles|chord lengths of the unit-radius 120-cell]], the largest regular convex 4-polytope. Since the 120-cell subsumes all smaller regular polytopes, its 30 chords are the complete chord set of all the regular polytopes that can be constructed in the first four dimensions of Euclidean space, except for regular polygons of more than 15 sides.

{| class=&quot;wikitable&quot; style=&quot;white-space:nowrap;text-align:center&quot;
!rowspan=2|&lt;math&gt;c_t&lt;/math&gt;
!rowspan=2|arc
!rowspan=2|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{n}\right\}&lt;/math&gt;&lt;/small&gt;
!rowspan=2|&lt;math&gt;\left\{p\right\}&lt;/math&gt;
!rowspan=2|&lt;small&gt;&lt;math&gt;m\left\{\frac{k}{d}\right\}&lt;/math&gt;&lt;/small&gt;
!rowspan=2|Steinbach roots
!colspan=7|Chord lengths of the unit 120-cell
|-
!colspan=5|unit-radius length &lt;math&gt;c_t&lt;/math&gt;
!colspan=2|unit-edge length &lt;math&gt;c_t/c_1&lt;/math&gt;&lt;br&gt;in 120-cell of radius &lt;math&gt;c_8=\sqrt{2}\phi^2&lt;/math&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{1,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;15.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{30\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{30\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;c_{4,1}-c_{2,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7-3 \sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.270091&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2} \phi ^2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2 \phi ^4}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.072949}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{2,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;25.2{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{2}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \left\{15\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(c_{18,1}-c_{4,1}\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{3-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.437016&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2} \phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2 \phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.190983}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.61803&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{3,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;36{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{10\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3 \left\{\frac{10}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(\sqrt{5}-1\right) c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(\sqrt{5}-1\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.618034&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{\phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.381966}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.28825&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{4,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;41.4{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{c_{8,1}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.707107&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.61803&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{5,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;44.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{4}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \left\{\frac{15}{2}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} c_{2,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{9-3 \sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.756934&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{\frac{3}{2}}}{\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2 \phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.572949}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} \phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.80252&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{6,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;49.1{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{17}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{5-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{5-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.831254&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt[4]{5} \sqrt{\frac{1}{\phi }}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\sqrt{5}}{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.690983}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\phi ^3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.07768&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{7,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;56.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{20}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{1}{\phi }} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{2}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.93913&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{\frac{\psi }{\phi }}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\psi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.881966}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\psi  \phi ^3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.47709&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;60{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{5}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{6\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{6\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.70246&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{9,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;66.1{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{40}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{1}{2 \phi }} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.09132&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{\frac{\chi }{\phi }}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\chi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.19098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\chi  \phi ^3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.04057&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{10,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;69.8{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{11}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi  c_{4,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1+\sqrt{5}}{2 \sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.14412&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\phi }{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\phi ^2}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.30902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^3&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.23607&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{11,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;72{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{6}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{5\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{5\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\frac{1}{\phi }} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\frac{2}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.17557&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3-\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3-\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.38197}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \sqrt{3-\phi } \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.3525&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{12,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;75.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{24}{5}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.22474&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.53457&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{13,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;81.1{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{13}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{9-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{9-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.30038&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{9-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(9-\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.69098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(9-\sqrt{5}\right)} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.8146&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{14,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;84.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{40}{9}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt[4]{5} \sqrt{\phi } c_{8,1}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt[4]{5} \sqrt{1+\sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.345&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt[4]{5} \sqrt{\phi }}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\sqrt{5} \phi }{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.80902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\phi ^5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.9798&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{15,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;90.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{4\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{4\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 c_{4,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.41421&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.23607&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{16,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;95.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{29}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{11-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.4802&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(11-\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.19098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(11-\sqrt{5}\right)} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.48037&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{17,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;98.9{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{31}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7+\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{7+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.51954&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{7+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(7+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.30902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\psi  \phi ^5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.62605&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{18,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;104.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{8}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{15}{4}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.58114&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{5} \sqrt{\phi ^4}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.8541&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{19,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;108.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{9}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{10}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;c_{3,1}+c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(1+\sqrt{5}\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.61803&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1+\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.61803}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \phi ^3&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.9907&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{20,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;110.2{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{13-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.64042&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(13-\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.69098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\phi ^2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.07359&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{21,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;113.9{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{19}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.67601&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.80902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\frac{\chi }{\phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.20537&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{22,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;120{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{10}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{3\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{3\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.73205&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{6} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.41285&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{23,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;124.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{41}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{\phi }+\frac{5}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{2}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.7658&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4-\frac{\psi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4-\frac{\psi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.11803}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\chi  \phi ^5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.53779&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{24,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;130.9{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{20}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{11+\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.81907&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(11+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.30902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\frac{\sqrt{5}}{\phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.73503&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{25,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;135.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{11}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{11}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7+3 \sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7+3 \sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.85123&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\phi ^2}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\phi ^4}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.42705}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^4&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.8541&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{26,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;138.6{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{12}{5}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.87083&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{7} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.92667&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{27,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;144{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{12}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{5}{2}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(5+\sqrt{5}\right)} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(5+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.90211&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\phi +2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2+\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.61803}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{2 \phi +4}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.0425&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{28,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;154.8{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{13}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{13}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{13+\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.95167&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(13+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.80902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\frac{1}{\phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.22598&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{29,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;164.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{14}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{15}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi  c_{12,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{\frac{3}{2}} \left(1+\sqrt{5}\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.98168&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}} \phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3 \phi ^2}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.92705}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} \phi ^3&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.33708&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{30,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;180{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{15}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{2\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{2\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \sqrt{2} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.40492&lt;/math&gt;&lt;/small&gt;
|-
|rowspan=4 colspan=6|
|rowspan=4 colspan=4|
&lt;small&gt;&lt;math&gt;\phi&lt;/math&gt;&lt;/small&gt; is the golden ratio:&lt;br&gt;
&lt;small&gt;&lt;math&gt;\phi ^2-\phi -1=0&lt;/math&gt;&lt;/small&gt;&lt;br&gt;
&lt;small&gt;&lt;math&gt;\frac{1}{\phi }+1=\phi&lt;/math&gt;&lt;/small&gt;, and: &lt;small&gt;&lt;math&gt;\phi+1=\phi^2&lt;/math&gt;&lt;/small&gt;&lt;br&gt;
&lt;small&gt;&lt;math&gt;\frac{1}{\phi }::1::\phi ::\phi ^2&lt;/math&gt;&lt;/small&gt;&lt;br&gt;
&lt;small&gt;&lt;math&gt;1/\phi&lt;/math&gt;&lt;/small&gt; and &lt;small&gt;&lt;math&gt;\phi&lt;/math&gt;&lt;/small&gt; are the golden sections of &lt;small&gt;&lt;math&gt;\sqrt{5}&lt;/math&gt;&lt;/small&gt;:&lt;br&gt;
&lt;small&gt;&lt;math&gt;\phi +\frac{1}{\phi }=\sqrt{5}&lt;/math&gt;&lt;/small&gt;
|colspan=2|&lt;small&gt;&lt;math&gt;\phi = (\sqrt{5} + 1)/2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.618034&lt;/math&gt;&lt;/small&gt;
|-
|colspan=2|&lt;small&gt;&lt;math&gt;\chi = (3\sqrt{5} + 1)/2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.854102&lt;/math&gt;&lt;/small&gt;
|-
|colspan=2|&lt;small&gt;&lt;math&gt;\psi = (3\sqrt{5} - 1)/2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.854102&lt;/math&gt;&lt;/small&gt;
|-
|colspan=2|&lt;small&gt;&lt;math&gt;\psi = 11/\chi = 22/(3\sqrt{5} + 1)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.854102&lt;/math&gt;&lt;/small&gt;
|}

...

== The 8-point regular polytopes ==
In 2-space we have the regular 8-point octagon, in 3-space the regular 8-point cube, and in 4-space the regular 8-point [[16-cell]].

A planar octagon with rigid edges of unit length has chords of length:

:&lt;math&gt;r_1=1,r_2=\sqrt{2+\sqrt{2}} \approx 1.84776,r_3=1+\sqrt{2} \approx 2.41421,r_4=\sqrt{4 + \sqrt{8}} \approx 2.61313&lt;/math&gt;

The chord ratio &lt;math&gt;r_3=1+\sqrt{2}&lt;/math&gt; is a geometrical proportion, the [[W:Silver ratio|silver ratio]]. Fontaine and Hurley's procedure for obtaining the reciprocal of a chord tells us that:

:&lt;math&gt;r_3-r_1-r_1=1/r_3 \approx 0.41421&lt;/math&gt;

Note that &lt;math&gt;1/r_3=\sqrt{2}-1=r_3-2&lt;/math&gt;.

If we embed this planar octagon in 3-space, we can make it skew, repositioning its vertices so that each is one unit-edge length distant from three others instead of two others, at the vertices of a unit-edge cube with chords of length:

:&lt;math&gt;r_1=1, r_2=\sqrt{2}, r_3=\sqrt{3}, r_4=\sqrt{2}&lt;/math&gt;

If we embed this cube in 4-space, we can skew it some more, repositioning its vertices so that each is one unit-edge length distant from six others instead of three others, at the vertices of a unit-edge 4-polytope with chords of length:

:&lt;math&gt;r_1=1,r_2=1,r_3=1,r_4=\sqrt{2}&lt;/math&gt;

All of its chords except its long diameters are the same unit length as its edge. In fact they are its 24 edges, and it is a 16-cell of radius &lt;small&gt;&lt;math&gt;1/\sqrt{2}&lt;/math&gt;&lt;/small&gt;.

[[File:octagon16cell.png|thumb|Orthogonal projection of a regular 16-cell to the [[16-cell#Projections|B&lt;sub&gt;4&lt;/sub&gt; Coxeter plane]]. Only its edges are shown; its long diameter chords are not drawn. All 24 edges are the same length. Only the edges of the two disjoint squares lie parallel to the projection plane, in completely orthogonal central planes.]]

The [[16-cell]] is the [[W:Regular convex 4-polytope|regular convex 4-polytope]] with [[W:Schläfli symbol|Schläfli symbol]] {3,3,4}. It has 8 vertices, 24 edges, 32 equilateral triangle faces, and 16 regular tetrahedron cells. It is the [[16-cell#Octahedral dipyramid|four-dimensional analogue of the octahedron]], and each of its four orthogonal central hyperplanes is an octahedron.

The only planar regular polygons found in the 16-cell are face triangles and central plane squares, but the 16-cell also contains a skew regular octagon, its [[W:Petrie polygon|Petrie polygon]]. The chords of this regular octagon, which lies skew in 4-space, are those given above for the 16-cell, as opposed to those for the cube or the regular octagon in the plane. The 16-cell is a construct of 3 Petrie octagons which share the same 8 vertices but have disjoint sets of 8 edges each.

The regular octad has higher symmetry in 4-space than it does in 2-space. The 16-cell is the 4-orthoplex, the simplest regular 4-polytope after the [[5-cell|4-simplex]]. All the larger regular 4-polytopes, including the 120-cell, are compounds of the 16-cell. The regular octagon exhibits this high symmetry only when embedded in 4-space at the vertices of the 16-cell.

The 16-cell constitutes an [[W:Orthonormal basis|orthonormal basis]] for the choice of a 4-dimensional Cartesian reference frame, because its vertices define four orthogonal axes. The eight vertices of a unit-radius 16-cell are (±1, 0, 0, 0), (0, ±1, 0, 0), (0, 0, ±1, 0), (0, 0, 0, ±1). All vertices are connected by &lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt; edges except opposite pairs. 

The vertex coordinates of the 16-cell form 6 central squares lying in 6 pairwise [[W:Orthogonal|orthogonal]] coordinate planes. Great squares in ''opposite'' planes that do not share an axis (e.g. in the ''xy'' and ''wz'' planes) are completely disjoint (they do not intersect at any vertices). These planes are [[W:Completely orthogonal|completely orthogonal]].{{Efn|name=Six orthogonal planes of the Cartesian basis}}

Since this unit-radius coordinate system is convenient, let us derive the unit-radius 16-cell by skewing a unit-radius planar octagon, which has chords of length:

:&lt;math&gt;r_1=\sqrt{2-\sqrt{2}} \approx 0.76537,r_2=\sqrt{2},r_3=\sqrt{2+\sqrt{2}} \approx 1.84776,r_4=2&lt;/math&gt;

We will need a planar octagon with rigid &lt;math&gt;r_2&lt;/math&gt; chords, rather than one with rigid &lt;math&gt;r_1&lt;/math&gt; edges. The octagon's &lt;math&gt;r_2&lt;/math&gt; chords form two disjoint great squares, visible in the orthogonal projection, which we can reposition in 3-space to form a cube by making them parallel, and in 4-space to form a 16-cell by making them completely orthogonal.

In the 16-cell the two completely orthogonal great squares formed by the &lt;math&gt;r_2&lt;/math&gt; chords are both parallel and perpendicular to each other. A ''simple'' rotation of the 16-cell in ''one'' of those two central planes rotates that square like a wheel, while the other square does not move. The four vertices of the rotating square orbit on a great circle in the plane.

The &lt;math&gt;r_1&lt;/math&gt; chords of the 16-cell form a Petrie polygon which zig-zags back and forth between the two completely orthogonal &lt;math&gt;r_2&lt;/math&gt; squares.

The &lt;math&gt;r_3&lt;/math&gt; chords of the 16-cell form a circular helix, visible as a skew {8/3} octagram in the orthogonal projection. A ''double'' rotation of the 16-cell, in ''both'' of the two completely orthogonal &lt;math&gt;r_2&lt;/math&gt; central square planes at once by the same angle, moves the eight vertices along the circular helix over the &lt;math&gt;r_3&lt;/math&gt; chords. The circular helix is a [[w:Geodesic|geodesic]] great circle on the 3-sphere of a special kind: it does not lie in a single central plane, its circumference is &lt;math&gt;4 \pi&lt;/math&gt;, and it occurs in either a left or right hand chiral form.

[[W:Rotations in 4-dimensional Euclidean space|Rotations in 4-dimensional Euclidean space]] can be seen as the composition of two 2-dimensional rotations in completely orthogonal planes. The general rotation in 4-space is a double rotation in pairs of completely orthogonal planes. Two completely orthogonal planes are called invariant planes of the rotation when all points in the plane rotate on circles that remain in the plane, even as the whole plane tilts sideways (like a coin flipping) into another plane. The two completely orthogonal rotations of each plane (like a wheel, and like a coin flipping) are simultaneous but independent, in that they are not geometrically constrained to turn at the same rate. However, the most circular kind of rotation (as opposed to an elliptical double rotation of a rigid spherical object) occurs when the invariant planes do rotate through the same angle in the same time interval. Such equi-angled double rotations are called [[w:SO(4)#Isoclinic_rotations|isoclinic]], also [[w:William_Kingdon_Clifford|Clifford]] displacements.

The 16-cell is the simplest possible frame in which to [[16-cell#Rotations|observe 4-dimensional rotations]] because its characteristic rotations feature a single pair of invariant rotation planes. In the 16-cell an isoclinic rotation by 90° in any pair of invariant completely orthogonal square central planes takes every square central plane to its completely orthogonal square central plane in a twisting displacement, as they tilt sideways 90° into each other's plane while rotating 90° internally. All the vertices move at once on the same circular helix geodesic, displaced 90° in 8 orthogonal directions, and the rigid 16-cell assumes a new orientation in 4-space. When the 90° isoclinic rotation is continued in the same rotational direction through an additional 90°, each vertex is again displaced 90°, but from the new orientation in a direction orthogonal to its first 90° displacement. After 360° of rotation each vertex reaches its antipodal position.

The trajectory of each vertex over each 90° isoclinic rotational displacement is a one-eighth segment of its geodesic orbit. Its entire orbit traces a circular helix in 4-space over eight &lt;math&gt;r_3&lt;/math&gt; chords, and also traces an ordinary great circle twice over the four &lt;math&gt;r_2&lt;/math&gt; chords within one of the two moving invariant rotation planes. In the course of a 720° isoclinic rotation each vertex departs from all 8 vertex positions just once and returns to its original position, and the 16-cell returns to its original orientation.

== Hypercubes ==
The long diameter of the unit-edge [[W:Hypercube|hypercube]] of dimension &lt;small&gt;&lt;math&gt;n&lt;/math&gt;&lt;/small&gt; is &lt;small&gt;&lt;math&gt;\sqrt{n}&lt;/math&gt;&lt;/small&gt;, so the unit-edge [[w:Tesseract|4-hypercube, the 16-point (8-cell) tesseract,]] has chords:
:&lt;math&gt;r_1=\sqrt{1},r_2=\sqrt{2},r_3=\sqrt{3},r_4=\sqrt{4}&lt;/math&gt;
Uniquely in its 4-dimensional case, the hypercube's edge length equals its radius, like the hexagon. We call such polytopes ''radially equilateral'', because they can be constructed from equilateral triangles which meet at their center, each contributing two radii and an edge. The cuboctahedron and the 24-cell are also radially equilateral.

The [[W:Tesseract|tesseract]] is the [[W:Regular convex 4-polytope|regular convex 4-polytope]] with [[W:Schläfli symbol|Schläfli symbol]] {4,3,3}. It has 16 vertices, 32 edges, 24 square faces, and 8 cube cells. It is the four-dimensional analogue of the cube.

The tesseract is the [[W:Dual polytope|dual polytope]] of the 16-cell. They have the same Petrie polygon, the regular octagon, but the tesseract contains 2 disjoint instances and 4 distinct instances of the skew octagon. We can construct the tesseract by skewing two planar octagons. Because the tesseract is radially equilateral (unlike the 16-cell), we start with our original octagon of unit-edge length, rather than the octagon of edge length &lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt; that we needed to build the unit-radius 16-cell.

For our tesseract construction we skew each planar octagon into a cube, so we have a compound of two completely orthogonal cubes. Provided the planes were completely orthogonal in 4-space and we skewed them both the same way, the 16 vertices will be the vertices of a tesseract with half of its 32 edges missing.

The 16-point tesseract is the convex hull of a compound of two 8-point 16-cells, in exact dimensional analogy to the way the 8-point cube is the convex hull of a [[W:Stellated octahedron|compound of two regular 4-point tetrahedra]]. The [[W:Demihypercube|demihypercubes]] occupy alternate vertices of the hypercubes. The diagonals of the square faces of the unit-radius tesseract are the &lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt; edges of two unit-radius 16-cells, which are also the edges of the square central planes.

Because the tesseract contains two 16-cells in alternate positions it has two sets of 6 orthogonal square central planes. Two angles are required to specify the relationship between two planes in 4-space. Pairs of planes within each 16-cell are 90° apart in one angle, and either 0° or 90° apart in the other angle. They are 90° apart in both angles if and only if they are completely orthogonal planes, 90° apart by isoclinic rotation, with no vertices in common and their corresponding vertices 180° apart. Otherwise they are 0° apart in one of the angles, 90° apart by simple rotation with their corresponding vertices 90° apart, and they intersect in one axis and lie in a common 3-dimensional hyperplane.{{Efn|A double rotation in which one of the two angles of rotation is 0°, so that one of the completely orthogonal invariant planes does not rotate, is called a simple rotation. Ordinary rotations observed in a 3-dimensional space are simple rotations.}}

A pair of square central planes from alternate 16-cells are 60° apart by isoclinic rotation, with their corresponding vertices 120° apart. The planes are not orthogonal or parallel, so they intersect in a line somewhere, but they have no vertices in common, they have no 3-dimensional hyperplane in common, and they cannot reach each other by simple rotation. Such pairs of objects are called [[W:Clifford parallel|Clifford parallel]] because all their corresponding pairs of vertices are the same distance apart, although they are not parallel in the usual sense, because they have a common center. Not only the alternate 16-cells' corresponding square central planes, but also the 16-cells themselves, are Clifford parallel objects.

We can rotate the tesseract isoclinically the way we rotated the 16-cell, by 90° in two completely orthogonal invariant square central planes, with the same effect on both alternate 16-cells. In the course of a 720° isoclinic rotation in invariant square central planes each vertex departs from all 8 vertex positions of its 16-cell just once and returns to its original position, but it does not visit the vertex positions of the other 16-cell. The skew octagon geodesic orbits of the 16 vertices lie on two disjoint octagram circular helixes of the same chirality, which are Clifford parallel objects that form a circular double helix.

== The 24-cell ==
In 2-space we have the radially equilateral 6-point hexagon. In 3-space we have the radially equilateral 12-point cuboctahedron, with 4 hexagonal central planes. In 4-space we have the radially equilateral 24-point 24-cell, with 4 cuboctahedral central hyperplanes and 16 hexagonal central planes.

Great hexagons are a rounder choice than great squares for the invariant rotation planes in which to rotate a 4-polytope isoclinically. The complete hexagonal isoclinic revolution requires 720° like the square isoclinic revolution, but it is completed in 6 chordal steps of 120° each rather than 8 chordal steps of 90° each.

...

== The 600-cell ==

...

== Finally the 120-cell ==

...

== Conclusions ==

Fontaine and Hurley's discovery is more than a formula for the reciprocal of a regular ''n''-polygon diagonal. It also yields the discrete sequence of isocline chords of the distinct isoclinic rotation characteristic of a ''d''-dimensional regular polytope. The characteristic rotational chord sequence of the ''d''-polytope can be represented geometrically in two dimensions on a distinct star polygon, but it lies on a geodesic circle through ''d''-dimensional space. Fontaine and Hurley discovered the geodesic topology of polytopes generally. Their procedure will reveal the geodesics of arbitrary non-uniform polytopes, since it can be applied to a polytope of any dimensionality and irregularity, by first fitting the polytope to the smallest regular polygon whose chords include its chords.

Fontaine and Hurley's discovery of a chordal formula for isoclinic rotations closes the circuit on Kappraff and Adamson's discovery of a rotational connection between dynamical systems, Steinbach's golden fields, and Coxeter's Euclidean geometry of ''n'' dimensions. Application of the Fontaine and Hurley procedure in higher-dimensional spaces demonstrates why the connection exists: because polytope sequences generally, from Steinbach's golden polygon chord sequences, to chord sequences in isoclinic rotation helixes, to subsumption relations in the sequence of regular 4-polytopes, arise as expressions of the reflections and rotations of distinct Coxeter symmetry groups, when those various groups interact.

== Appendix: Sequence of regular 4-polytopes ==
{{Regular convex 4-polytopes|wiki=W:|columns=7}}

== Notes ==
{{Notelist}}

== Citations ==
{{Reflist}}

== References ==
{{Refbegin}}
* {{Cite journal | last=Steinbach | first=Peter | year=1997 | title=Golden fields: A case for the Heptagon | journal=Mathematics Magazine | volume=70 | issue=Feb 1997 | pages=22–31 | doi=10.1080/0025570X.1997.11996494 | jstor=2691048 | ref={{SfnRef|Steinbach|1997}} }}
* {{Cite journal | last=Steinbach | first=Peter | year=2000 | title=Sections Beyond Golden| journal=Bridges: Mathematical Connections in Art, Music and Science | issue=2000 | pages=35-44 | url=https://archive.bridgesmathart.org/2000/bridges2000-35.pdf | ref={{SfnRef|Steinbach|2000}}}}
* {{Cite journal | last1=Kappraff | first1=Jay | last2=Jablan | first2=Slavik | last3=Adamson | first3=Gary | last4=Sazdanovich | first4=Radmila | year=2004 | title=Golden Fields, Generalized Fibonacci Sequences, and Chaotic Matrices | journal=Forma | volume=19 | pages=367-387 | url=https://archive.bridgesmathart.org/2005/bridges2005-369.pdf | ref={{SfnRef|Kappraff, Jablan, Adamson &amp; Sazdanovich|2004}} }}
* {{Cite journal | last1=Kappraff | first1=Jay | last2=Adamson | first2=Gary | year=2004 | title=Polygons and Chaos | journal=Dynamical Systems and Geometric Theories | url=https://archive.bridgesmathart.org/2001/bridges2001-67.pdf | ref={{SfnRef|Kappraff &amp; Adamson|2004}} }}
* {{Cite journal | last1=Fontaine | first1=Anne | last2=Hurley | first2=Susan | year=2006 | title=Proof by Picture: Products and Reciprocals of Diagonal Length Ratios in the Regular Polygon | journal=Forum Geometricorum | volume=6 | pages=97-101 | url=https://scispace.com/pdf/proof-by-picture-products-and-reciprocals-of-diagonal-length-1aian8mgp9.pdf }}
{{Refend}}</text>
      <sha1>f6mvhwplgq8us2odbroo9xo8ycfbu54</sha1>
    </revision>
    <revision>
      <id>2809832</id>
      <parentid>2809825</parentid>
      <timestamp>2026-05-17T03:45:42Z</timestamp>
      <contributor>
        <username>Dc.samizdat</username>
        <id>2856930</id>
      </contributor>
      <comment>/* The 8-point regular polytopes */</comment>
      <origin>2809832</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="47066" sha1="hg0ij8c6rwk1l3d3ylfmc1d6uxz06y7" xml:space="preserve">{{align|center|David Brooks Christie}}
{{align|center|dc@samizdat.org}}
{{align|center|Draft in progress}}
{{align|center|January 2026 - April 2026}}

&lt;blockquote&gt;Steinbach discovered the formula for the ratios of diagonal to side in the regular polygons. Fontaine and Hurley extended this result, discovering a formula for the reciprocal of a regular polygon chord derived geometrically from the chord's star polygon. We observe that these findings in plane geometry apply more generally, to polytopes of any dimensionality. Fontaine and Hurley's geometric procedure for finding the reciprocals of the chords of a regular polygon from their star polygons also finds the rotational geodesics of any polytope of any dimensionality.&lt;/blockquote&gt;
== Introduction ==
Steinbach discovered the Diagonal Product Formula and the Golden Fields family of ratios of diagonal to side in the regular polygons. He showed how this family extends beyond the pentagon {5} with its well-known golden bisection proportional to 𝜙, finding that the heptagon {7} has an analogous trisection, the nonagon {9} has an analogous quadrasection, and the hendecagon {11} has an analogous pentasection, an extended family of golden proportions with quasiperiodic properties. 

Kappraff and Adamson extended these findings in plane geometry to a theory of Generalized Fibonacci Sequences, showing that the Golden Fields not only do not end with the hendecagon, they form an infinite number of periodic trajectories when operated on by the Mandelbrot operator. They found a relation between the edges of star polygons and dynamical systems in the state of chaos, revealing a connection between chaos theory, number, and rotations in Coxeter Euclidean geometry. 

Fontaine and Hurley examined Steinbach's finding that the length of each chord of a regular polygon is both the product of two chords and the sum of a set of smaller chords, so that in rotations to add is to multiply. They illustrated Steinbach's sets of additive chords lying parallel to each other in the plane (pointing in the same direction), and by applying Steinbach's formula more generally they found another summation relation of signed parallel chords (pointing in opposite directions) which relates each chord length to its reciprocal, and relates the summation to a distinct star polygon rotation. 

We examine these remarkable findings (which stem from study of the chords of humble regular polygons) in higher-dimensional spaces, specifically in the chords, polygons and rotations of the [[120-cell]], the largest four-dimensional regular convex polytope.

== Visualizing the 120-cell ==
{| class=&quot;wikitable floatright&quot; width=&quot;400&quot;
|style=&quot;vertical-align:top&quot;|[[File:120-cell.gif|200px]]&lt;br&gt;Orthographic projection of the 600-point 120-cell &lt;small&gt;&lt;math&gt;\{5,3,3\}&lt;/math&gt;&lt;/small&gt; performing a [[W:SO(4)#Geometry of 4D rotations|simple rotation]].{{Sfn|Hise|2011|loc=File:120-cell.gif|ps=; &quot;Created by Jason Hise with Maya and Macromedia Fireworks. A 3D projection of a 120-cell performing a [[W:SO(4)#Geometry of 4D rotations|simple rotation]].&quot;}} In this simplified rendering only the 120-cell's own edges are shown; its 29 interior chords are not rendered. Therefore even though it is translucent, only its outer surface is visible. The complex interior parts of the 120-cell, all its inscribed 5-cells, 16-cells, 8-cells, 24-cells, 600-cells and its much larger inventory of polyhedra, are completely invisible in this view, as none of their edges are rendered at all.
|style=&quot;vertical-align:top&quot;|[[File:Ortho solid 016-uniform polychoron p33-t0.png|200px]]&lt;br&gt;Orthographic projection of the 600-point [[W:Great grand stellated 120-cell|great grand stellated 120-cell]] &lt;small&gt;&lt;math&gt;\{\tfrac{5}{2},3,3\}&lt;/math&gt;&lt;/small&gt;.{{Sfn|Ruen: Great grand stellated 120-cell|2007}} The 120-cell is its convex hull. The projection to the left renders only the 120-cell's shortest chord, its 1200 edges. The projection above also renders only one of the 120-cell's 30 chords, the edges of its 120 inscribed regular 5-cells. The 120-cell itself (the convex hull) is invisible in this view, as its edges are not rendered.
|}

[[120-cell#Geometry|The 120-cell is the maximally complex regular 4-polytope]], containing inscribed instances of every regular 1-, 2-, 3-, and 4-polytope, except the regular polygons of more than {15} sides. 

The 120-cell is the convex hull of a regular [[120-cell#Relationships among interior polytopes|compound of each of the 6 regular convex 4-polytopes]]. They are the [[5-cell|5-point (5-cell) 4-simplex]], the [[16-cell|8-point (16-cell) 4-orthoplex]], the [[W:Tesseract|16-point (8-cell) tesseract]], the [[24-cell|24-point (24-cell)]], the [[600-cell|120-point (600-cell)]], and the [[120-cell|600-point (120-cell)]]. The 120-cell is the convex hull of a compound of 120 disjoint regular 5-cells, of 75 disjoint 16-cells, of 25 disjoint 24-cells, and of 5 disjoint 600-cells.

The 120-cell contains an even larger inventory of irregular polytopes, created by the intersection of multiple instances of these component regular 4-polytopes. Many are quite unexpected, because they do not occur as components of any regular polytope smaller than the 120-cell. As just one example among the [[120-cell#Concentric hulls|sections of the 120-cell]], there is an irregular 24-point polyhedron with 16 triangle faces and 4 nonagon {9} faces.{{Sfn|Moxness|}}

Most renderings of the 120-cell, like the rotating projection here, only illustrate its outer surface, which is a honeycomb of face-bonded dodecahedral cells. Only the objects in its 3-dimensional surface are rendered, namely the 120 dodecahedra, their pentagon faces, and their edges. Although the 120-cell has chords of 30 distinct lengths, in this kind of simplified rendering only the 120-cell's own edges (its shortest chord) are shown. Its 29 interior chords, the edges of objects in the interior of the 120-cell, are not rendered, so interior objects are not visible at all.

Visualizing the complete interior of the 600-vertex 120-cell in a single image is impractical because of its complexity. Only four 120-cell edges are incident at each vertex, but [[120-cell#Chords|600 chords (of all 30 lengths)]] are incident at ''each'' vertex.

== Compounds in the 120-cell ==
The 8-point (16-cell), not the 5-point (5-cell), is the smallest building block; it compounds to every larger regular 4-polytope. The 5-point (5-cell) does compound to the 600-point (120-cell), but it does not fit into any smaller regular 4-polytope. 

The 8-point (16-cell) compounds by 2 in the 16-point (8-cell), and by 3 in the 24-point (24-cell). The 16-point (8-cell) compounds in the 24-point (24-cell) by 3 non-disjoint instances of itself, with each of the 24 vertices shared by two 16-point (8-cells). The 24-point (24-cell) compounds by 5 disjoint instances of itself in the 120-point (600-cell), and the 120-point (600-cell) compounds by 5 disjoint instances of itself in the 600-point (120-cell).

The 24-point (24-cell) also compounds by &lt;math&gt;5^2&lt;/math&gt; non-disjoint instances of itself in the 120-point (600-cell); it compounds in 5 disjoint instances of itself, 10 (not 5) different ways. Whichever set of 5 disjoint 24-point (24-cells) are assembled, the resulting 120-point (600-cell) contains 25 distinct 24-point (24-cells), not just 5 (or 10). This implies that 15 disjoint 8-point (16-cells) will construct a 120-point (600-cell), which will contain 75 distinct 8-point (16-cells). 

The 600-point (120-cell) is 5 disjoint 120-point (600-cells), just 2 different ways (not 5 or 10 ways), so it is 10 distinct 120-point (600-cells). This implies that the 8-point (16-cell) compounds by 3 times &lt;math&gt;5^2&lt;/math&gt; (75) disjoint instances of itself in the 600-point (120-cell), which contains &lt;math&gt;3^2&lt;/math&gt; times  &lt;math&gt;5^2&lt;/math&gt; (225) distinct instances of the 24-point (24-cell), and  &lt;math&gt;3^3&lt;/math&gt; times &lt;math&gt;5^2&lt;/math&gt; (675) distinct instances of the 8-point (16-cell). 

These facts were discovered painstakingly by various researchers, and no one has found a general rule governing subsumption relations among regular polytopes. The reasons for some of their numeric incidence relations are far from obvious. [[W:Pieter Hendrik Schoute|Schoute]] was the first to see that the 120-point (600-cell) is a compound of 5 24-point (24-cells) ''10 different ways'', and after he saw it a hundred years lapsed until Denney, Hooker, Johnson, Robinson, Butler &amp; Claiborne proved his result, and showed why.{{Sfn|Denney, Hooker, Johnson, Robinson, Butler &amp; Claiborne|2020|loc=''The geometry of H4 polytopes''}}

So much for the compounds of 16-cells. The 120-cell is also the convex hull of the compound of 120 disjoint regular 5-cells. That stellated compound (without its convex hull of 120-cell edges) is the [[w:Great_grand_stellated_120-cell|great grand stellated 120-cell]] illustrated above, the final regular [[W:Stellation|stellation]] of the 120-cell, and the only [[W:Schläfli-Hess polychoron|regular star 4-polytope]] to have the 120-cell for its convex hull. The edges of the great grand stellated 120-cell are &lt;math&gt;\phi^6&lt;/math&gt; as long as those of its 120-cell [[W:List of polyhedral stellations#Stellation process|stellation core]] deep inside.

The compound of 120 disjoint 5-point (5-cells) can be seen to be equivalent to the compound of 5 disjoint 120-point (600-cells), as follows. Beginning with a single 120-point (600-cell), expand each vertex into a regular 5-cell, by adding 4 new equidistant vertices, such that the 5 vertices form a regular 5-cell inscribed in the 3-sphere. The 120 5-cells are disjoint, and the 600 vertices form 5 disjoint 120-point (600-cells): a 120-cell.

== Thirty distinguished distances ==
The 30 numbers listed in the table are all-important in Euclidean geometry. A case can be made on symmetry grounds that their squares are the 30 most important numbers between 0 and 4. The 30 rows of the table are the 30 distinct [[120-cell#Geodesic rectangles|chord lengths of the unit-radius 120-cell]], the largest regular convex 4-polytope. Since the 120-cell subsumes all smaller regular polytopes, its 30 chords are the complete chord set of all the regular polytopes that can be constructed in the first four dimensions of Euclidean space, except for regular polygons of more than 15 sides.

{| class=&quot;wikitable&quot; style=&quot;white-space:nowrap;text-align:center&quot;
!rowspan=2|&lt;math&gt;c_t&lt;/math&gt;
!rowspan=2|arc
!rowspan=2|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{n}\right\}&lt;/math&gt;&lt;/small&gt;
!rowspan=2|&lt;math&gt;\left\{p\right\}&lt;/math&gt;
!rowspan=2|&lt;small&gt;&lt;math&gt;m\left\{\frac{k}{d}\right\}&lt;/math&gt;&lt;/small&gt;
!rowspan=2|Steinbach roots
!colspan=7|Chord lengths of the unit 120-cell
|-
!colspan=5|unit-radius length &lt;math&gt;c_t&lt;/math&gt;
!colspan=2|unit-edge length &lt;math&gt;c_t/c_1&lt;/math&gt;&lt;br&gt;in 120-cell of radius &lt;math&gt;c_8=\sqrt{2}\phi^2&lt;/math&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{1,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;15.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{30\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{30\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;c_{4,1}-c_{2,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7-3 \sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.270091&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2} \phi ^2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2 \phi ^4}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.072949}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{2,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;25.2{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{2}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \left\{15\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(c_{18,1}-c_{4,1}\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{3-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.437016&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2} \phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2 \phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.190983}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.61803&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{3,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;36{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{10\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3 \left\{\frac{10}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(\sqrt{5}-1\right) c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(\sqrt{5}-1\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.618034&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{\phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.381966}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.28825&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{4,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;41.4{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{c_{8,1}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.707107&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.61803&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{5,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;44.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{4}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \left\{\frac{15}{2}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} c_{2,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{9-3 \sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.756934&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{\frac{3}{2}}}{\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2 \phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.572949}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} \phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.80252&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{6,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;49.1{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{17}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{5-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{5-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.831254&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt[4]{5} \sqrt{\frac{1}{\phi }}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\sqrt{5}}{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.690983}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\phi ^3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.07768&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{7,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;56.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{20}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{1}{\phi }} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{2}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.93913&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{\frac{\psi }{\phi }}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\psi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.881966}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\psi  \phi ^3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.47709&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;60{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{5}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{6\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{6\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.70246&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{9,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;66.1{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{40}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{1}{2 \phi }} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.09132&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{\frac{\chi }{\phi }}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\chi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.19098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\chi  \phi ^3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.04057&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{10,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;69.8{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{11}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi  c_{4,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1+\sqrt{5}}{2 \sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.14412&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\phi }{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\phi ^2}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.30902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^3&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.23607&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{11,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;72{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{6}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{5\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{5\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\frac{1}{\phi }} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\frac{2}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.17557&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3-\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3-\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.38197}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \sqrt{3-\phi } \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.3525&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{12,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;75.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{24}{5}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.22474&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.53457&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{13,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;81.1{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{13}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{9-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{9-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.30038&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{9-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(9-\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.69098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(9-\sqrt{5}\right)} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.8146&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{14,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;84.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{40}{9}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt[4]{5} \sqrt{\phi } c_{8,1}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt[4]{5} \sqrt{1+\sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.345&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt[4]{5} \sqrt{\phi }}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\sqrt{5} \phi }{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.80902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\phi ^5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.9798&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{15,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;90.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{4\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{4\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 c_{4,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.41421&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.23607&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{16,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;95.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{29}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{11-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.4802&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(11-\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.19098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(11-\sqrt{5}\right)} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.48037&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{17,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;98.9{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{31}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7+\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{7+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.51954&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{7+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(7+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.30902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\psi  \phi ^5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.62605&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{18,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;104.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{8}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{15}{4}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.58114&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{5} \sqrt{\phi ^4}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.8541&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{19,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;108.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{9}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{10}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;c_{3,1}+c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(1+\sqrt{5}\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.61803&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1+\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.61803}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \phi ^3&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.9907&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{20,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;110.2{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{13-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.64042&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(13-\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.69098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\phi ^2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.07359&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{21,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;113.9{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{19}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.67601&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.80902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\frac{\chi }{\phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.20537&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{22,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;120{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{10}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{3\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{3\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.73205&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{6} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.41285&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{23,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;124.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{41}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{\phi }+\frac{5}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{2}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.7658&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4-\frac{\psi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4-\frac{\psi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.11803}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\chi  \phi ^5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.53779&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{24,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;130.9{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{20}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{11+\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.81907&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(11+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.30902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\frac{\sqrt{5}}{\phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.73503&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{25,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;135.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{11}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{11}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7+3 \sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7+3 \sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.85123&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\phi ^2}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\phi ^4}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.42705}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^4&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.8541&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{26,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;138.6{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{12}{5}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.87083&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{7} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.92667&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{27,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;144{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{12}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{5}{2}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(5+\sqrt{5}\right)} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(5+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.90211&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\phi +2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2+\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.61803}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{2 \phi +4}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.0425&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{28,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;154.8{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{13}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{13}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{13+\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.95167&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(13+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.80902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\frac{1}{\phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.22598&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{29,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;164.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{14}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{15}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi  c_{12,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{\frac{3}{2}} \left(1+\sqrt{5}\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.98168&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}} \phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3 \phi ^2}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.92705}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} \phi ^3&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.33708&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{30,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;180{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{15}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{2\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{2\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \sqrt{2} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.40492&lt;/math&gt;&lt;/small&gt;
|-
|rowspan=4 colspan=6|
|rowspan=4 colspan=4|
&lt;small&gt;&lt;math&gt;\phi&lt;/math&gt;&lt;/small&gt; is the golden ratio:&lt;br&gt;
&lt;small&gt;&lt;math&gt;\phi ^2-\phi -1=0&lt;/math&gt;&lt;/small&gt;&lt;br&gt;
&lt;small&gt;&lt;math&gt;\frac{1}{\phi }+1=\phi&lt;/math&gt;&lt;/small&gt;, and: &lt;small&gt;&lt;math&gt;\phi+1=\phi^2&lt;/math&gt;&lt;/small&gt;&lt;br&gt;
&lt;small&gt;&lt;math&gt;\frac{1}{\phi }::1::\phi ::\phi ^2&lt;/math&gt;&lt;/small&gt;&lt;br&gt;
&lt;small&gt;&lt;math&gt;1/\phi&lt;/math&gt;&lt;/small&gt; and &lt;small&gt;&lt;math&gt;\phi&lt;/math&gt;&lt;/small&gt; are the golden sections of &lt;small&gt;&lt;math&gt;\sqrt{5}&lt;/math&gt;&lt;/small&gt;:&lt;br&gt;
&lt;small&gt;&lt;math&gt;\phi +\frac{1}{\phi }=\sqrt{5}&lt;/math&gt;&lt;/small&gt;
|colspan=2|&lt;small&gt;&lt;math&gt;\phi = (\sqrt{5} + 1)/2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.618034&lt;/math&gt;&lt;/small&gt;
|-
|colspan=2|&lt;small&gt;&lt;math&gt;\chi = (3\sqrt{5} + 1)/2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.854102&lt;/math&gt;&lt;/small&gt;
|-
|colspan=2|&lt;small&gt;&lt;math&gt;\psi = (3\sqrt{5} - 1)/2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.854102&lt;/math&gt;&lt;/small&gt;
|-
|colspan=2|&lt;small&gt;&lt;math&gt;\psi = 11/\chi = 22/(3\sqrt{5} + 1)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.854102&lt;/math&gt;&lt;/small&gt;
|}

...

== The 8-point regular polytopes ==
In 2-space we have the regular 8-point octagon, in 3-space the regular 8-point cube, and in 4-space the regular 8-point [[16-cell]].

A planar octagon with rigid edges of unit length has chords of length:

:&lt;math&gt;r_1=1,r_2=\sqrt{2+\sqrt{2}} \approx 1.84776,r_3=1+\sqrt{2} \approx 2.41421,r_4=\sqrt{4 + \sqrt{8}} \approx 2.61313&lt;/math&gt;

The chord ratio &lt;math&gt;r_3=1+\sqrt{2}&lt;/math&gt; is a geometrical proportion, the [[W:Silver ratio|silver ratio]]. Fontaine and Hurley's procedure for obtaining the reciprocal of a chord tells us that:

:&lt;math&gt;r_3-r_1-r_1=1/r_3 \approx 0.41421&lt;/math&gt;

Note that &lt;math&gt;1/r_3=\sqrt{2}-1=r_3-2&lt;/math&gt;.

If we embed this planar octagon in 3-space, we can make it skew, repositioning its vertices so that each is one unit-edge length distant from three others instead of two others, at the vertices of a unit-edge cube with chords of length:

:&lt;math&gt;r_1=1, r_2=\sqrt{2}, r_3=\sqrt{3}, r_4=\sqrt{2}&lt;/math&gt;

If we embed this cube in 4-space, we can skew it some more, repositioning its vertices so that each is one unit-edge length distant from six others instead of three others, at the vertices of a unit-edge 4-polytope with chords of length:

:&lt;math&gt;r_1=1,r_2=1,r_3=1,r_4=\sqrt{2}&lt;/math&gt;

All of its chords except its long diameters are the same unit length as its edge. In fact they are its 24 edges, and it is a 16-cell of radius &lt;small&gt;&lt;math&gt;1/\sqrt{2}&lt;/math&gt;&lt;/small&gt;.

[[File:octagon16cell.png|thumb|Orthogonal projection of a regular 16-cell to the [[16-cell#Projections|B&lt;sub&gt;4&lt;/sub&gt; Coxeter plane]]. Only its edges are shown; its long diameter chords are not drawn. All 24 edges are the same length. Only the edges of the two disjoint squares lie parallel to the projection plane, in completely orthogonal central planes.]]

The [[16-cell]] is the [[W:Regular convex 4-polytope|regular convex 4-polytope]] with [[W:Schläfli symbol|Schläfli symbol]] {3,3,4}. It has 8 vertices, 24 edges, 32 equilateral triangle faces, and 16 regular tetrahedron cells. It is the [[16-cell#Octahedral dipyramid|four-dimensional analogue of the octahedron]], and each of its four orthogonal central hyperplanes is an octahedron.

The only planar regular polygons found in the 16-cell are face triangles and central plane squares, but the 16-cell also contains a skew regular octagon, its [[W:Petrie polygon|Petrie polygon]]. The chords of this regular octagon, which lies skew in 4-space, are those given above for the 16-cell, as opposed to those for the cube or the regular octagon in the plane. The 16-cell is a construct of 3 Petrie octagons which share the same 8 vertices but have disjoint sets of 8 edges each.

The regular octad has higher symmetry in 4-space than it does in 2-space. The 16-cell is the 4-orthoplex, the simplest regular 4-polytope after the [[5-cell|4-simplex]]. All the larger regular 4-polytopes, including the 120-cell, are compounds of the 16-cell. The regular octagon exhibits this high symmetry only when embedded in 4-space at the vertices of the 16-cell.

The 16-cell constitutes an [[W:Orthonormal basis|orthonormal basis]] for the choice of a 4-dimensional Cartesian reference frame, because its vertices define four orthogonal axes. The eight vertices of a unit-radius 16-cell are (±1, 0, 0, 0), (0, ±1, 0, 0), (0, 0, ±1, 0), (0, 0, 0, ±1). All vertices are connected by &lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt; edges except opposite pairs. 

The vertex coordinates of the 16-cell form 6 central squares lying in 6 pairwise [[W:Orthogonal|orthogonal]] coordinate planes. Great squares in ''opposite'' planes that do not share an axis (e.g. in the ''xy'' and ''wz'' planes) are completely disjoint (they do not intersect at any vertices). These planes are [[W:Completely orthogonal|completely orthogonal]].{{Efn|name=Six orthogonal planes of the Cartesian basis}}

Since this unit-radius coordinate system is convenient, let us derive the unit-radius 16-cell by skewing a unit-radius planar octagon, which has chords of length:

:&lt;math&gt;r_1=\sqrt{2-\sqrt{2}} \approx 0.76537,r_2=\sqrt{2},r_3=\sqrt{2+\sqrt{2}} \approx 1.84776,r_4=2&lt;/math&gt;

We will need a planar octagon with rigid &lt;math&gt;r_2&lt;/math&gt; chords, rather than one with rigid &lt;math&gt;r_1&lt;/math&gt; edges. The octagon's &lt;math&gt;r_2&lt;/math&gt; chords form two disjoint great squares, visible in the orthogonal projection, which we can reposition in 3-space to form a cube by making them parallel, and in 4-space to form a 16-cell by making them completely orthogonal.

In the 16-cell the two completely orthogonal great squares formed by the &lt;math&gt;r_2&lt;/math&gt; chords are both parallel and perpendicular to each other. A ''simple'' rotation of the 16-cell in ''one'' of those two central planes rotates that square like a wheel, while the other square does not move. The four vertices of the rotating square orbit on a great circle in the plane.

The &lt;math&gt;r_1&lt;/math&gt; chords of the 16-cell form a Petrie polygon which zig-zags back and forth between the two completely orthogonal &lt;math&gt;r_2&lt;/math&gt; squares.

The &lt;math&gt;r_3&lt;/math&gt; chords of the 16-cell form a circular helix, visible as a skew {8/3} octagram in the orthogonal projection. A ''double'' rotation of the 16-cell, in ''both'' of the two completely orthogonal &lt;math&gt;r_2&lt;/math&gt; square planes at once by the same angle, moves the eight vertices along the circular helix over the &lt;math&gt;r_3&lt;/math&gt; chords. The circular helix is a [[w:Geodesic|geodesic]] great circle on the 3-sphere of a special kind: it does not lie in a single central plane, its circumference is &lt;math&gt;4 \pi&lt;/math&gt;, and it occurs in either a left or right hand chiral form.

[[W:Rotations in 4-dimensional Euclidean space|Rotations in 4-dimensional Euclidean space]] can be seen as the composition of two 2-dimensional rotations in completely orthogonal planes. The general rotation in 4-space is a double rotation in pairs of completely orthogonal planes. Two completely orthogonal planes are called invariant planes of the rotation when all points in the plane rotate on circles that remain in the plane, even as the whole plane tilts sideways (like a coin flipping) into another plane. The two completely orthogonal rotations of each plane (like a wheel, and like a coin flipping) are simultaneous but independent, in that they are not geometrically constrained to turn at the same rate. However, the most circular kind of rotation (as opposed to an elliptical double rotation of a rigid spherical object) occurs when the invariant planes do rotate through the same angle in the same time interval. Such equi-angled double rotations are called [[w:SO(4)#Isoclinic_rotations|isoclinic]], also [[w:William_Kingdon_Clifford|Clifford]] displacements.

The 16-cell is the simplest possible frame in which to [[16-cell#Rotations|observe 4-dimensional rotations]] because its characteristic rotations feature a single pair of invariant rotation planes. In the 16-cell an isoclinic rotation by 90° in any pair of invariant completely orthogonal square central planes takes every square central plane to its completely orthogonal square central plane in a twisting displacement, as they tilt sideways 90° into each other's plane while rotating 90° internally. All the vertices move at once on the same circular helix geodesic, displaced 90° in 8 orthogonal directions, and the rigid 16-cell assumes a new orientation in 4-space. When the 90° isoclinic rotation is continued in the same rotational direction through an additional 90°, each vertex is again displaced 90°, but from the new orientation in a direction orthogonal to its first 90° displacement. After 360° of rotation each vertex reaches its antipodal position.

The trajectory of each vertex over each 90° isoclinic rotational displacement is a one-eighth segment of its geodesic orbit. Its entire orbit traces a circular helix in 4-space over eight &lt;math&gt;r_3&lt;/math&gt; chords, and also traces an ordinary great circle twice over the four &lt;math&gt;r_2&lt;/math&gt; chords within one of the two moving invariant rotation planes. In the course of a 720° isoclinic rotation each vertex departs from all 8 vertex positions just once and returns to its original position, and the 16-cell returns to its original orientation.

== Hypercubes ==
The long diameter of the unit-edge [[W:Hypercube|hypercube]] of dimension &lt;small&gt;&lt;math&gt;n&lt;/math&gt;&lt;/small&gt; is &lt;small&gt;&lt;math&gt;\sqrt{n}&lt;/math&gt;&lt;/small&gt;, so the unit-edge [[w:Tesseract|4-hypercube, the 16-point (8-cell) tesseract,]] has chords:
:&lt;math&gt;r_1=\sqrt{1},r_2=\sqrt{2},r_3=\sqrt{3},r_4=\sqrt{4}&lt;/math&gt;
Uniquely in its 4-dimensional case, the hypercube's edge length equals its radius, like the hexagon. We call such polytopes ''radially equilateral'', because they can be constructed from equilateral triangles which meet at their center, each contributing two radii and an edge. The cuboctahedron and the 24-cell are also radially equilateral.

The [[W:Tesseract|tesseract]] is the [[W:Regular convex 4-polytope|regular convex 4-polytope]] with [[W:Schläfli symbol|Schläfli symbol]] {4,3,3}. It has 16 vertices, 32 edges, 24 square faces, and 8 cube cells. It is the four-dimensional analogue of the cube.

The tesseract is the [[W:Dual polytope|dual polytope]] of the 16-cell. They have the same Petrie polygon, the regular octagon, but the tesseract contains 2 disjoint instances and 4 distinct instances of the skew octagon. We can construct the tesseract by skewing two planar octagons. Because the tesseract is radially equilateral (unlike the 16-cell), we start with our original octagon of unit-edge length, rather than the octagon of edge length &lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt; that we needed to build the unit-radius 16-cell.

For our tesseract construction we skew each planar octagon into a cube, so we have a compound of two completely orthogonal cubes. Provided the planes were completely orthogonal in 4-space and we skewed them both the same way, the 16 vertices will be the vertices of a tesseract with half of its 32 edges missing.

The 16-point tesseract is the convex hull of a compound of two 8-point 16-cells, in exact dimensional analogy to the way the 8-point cube is the convex hull of a [[W:Stellated octahedron|compound of two regular 4-point tetrahedra]]. The [[W:Demihypercube|demihypercubes]] occupy alternate vertices of the hypercubes. The diagonals of the square faces of the unit-radius tesseract are the &lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt; edges of two unit-radius 16-cells, which are also the edges of the square central planes.

Because the tesseract contains two 16-cells in alternate positions it has two sets of 6 orthogonal square central planes. Two angles are required to specify the relationship between two planes in 4-space. Pairs of planes within each 16-cell are 90° apart in one angle, and either 0° or 90° apart in the other angle. They are 90° apart in both angles if and only if they are completely orthogonal planes, 90° apart by isoclinic rotation, with no vertices in common and their corresponding vertices 180° apart. Otherwise they are 0° apart in one of the angles, 90° apart by simple rotation with their corresponding vertices 90° apart, and they intersect in one axis and lie in a common 3-dimensional hyperplane.{{Efn|A double rotation in which one of the two angles of rotation is 0°, so that one of the completely orthogonal invariant planes does not rotate, is called a simple rotation. Ordinary rotations observed in a 3-dimensional space are simple rotations.}}

A pair of square central planes from alternate 16-cells are 60° apart by isoclinic rotation, with their corresponding vertices 120° apart. The planes are not orthogonal or parallel, so they intersect in a line somewhere, but they have no vertices in common, they have no 3-dimensional hyperplane in common, and they cannot reach each other by simple rotation. Such pairs of objects are called [[W:Clifford parallel|Clifford parallel]] because all their corresponding pairs of vertices are the same distance apart, although they are not parallel in the usual sense, because they have a common center. Not only the alternate 16-cells' corresponding square central planes, but also the 16-cells themselves, are Clifford parallel objects.

We can rotate the tesseract isoclinically the way we rotated the 16-cell, by 90° in two completely orthogonal invariant square central planes, with the same effect on both alternate 16-cells. In the course of a 720° isoclinic rotation in invariant square central planes each vertex departs from all 8 vertex positions of its 16-cell just once and returns to its original position, but it does not visit the vertex positions of the other 16-cell. The skew octagon geodesic orbits of the 16 vertices lie on two disjoint octagram circular helixes of the same chirality, which are Clifford parallel objects that form a circular double helix.

== The 24-cell ==
In 2-space we have the radially equilateral 6-point hexagon. In 3-space we have the radially equilateral 12-point cuboctahedron, with 4 hexagonal central planes. In 4-space we have the radially equilateral 24-point 24-cell, with 4 cuboctahedral central hyperplanes and 16 hexagonal central planes.

Great hexagons are a rounder choice than great squares for the invariant rotation planes in which to rotate a 4-polytope isoclinically. The complete hexagonal isoclinic revolution requires 720° like the square isoclinic revolution, but it is completed in 6 chordal steps of 120° each rather than 8 chordal steps of 90° each.

...

== The 600-cell ==

...

== Finally the 120-cell ==

...

== Conclusions ==

Fontaine and Hurley's discovery is more than a formula for the reciprocal of a regular ''n''-polygon diagonal. It also yields the discrete sequence of isocline chords of the distinct isoclinic rotation characteristic of a ''d''-dimensional regular polytope. The characteristic rotational chord sequence of the ''d''-polytope can be represented geometrically in two dimensions on a distinct star polygon, but it lies on a geodesic circle through ''d''-dimensional space. Fontaine and Hurley discovered the geodesic topology of polytopes generally. Their procedure will reveal the geodesics of arbitrary non-uniform polytopes, since it can be applied to a polytope of any dimensionality and irregularity, by first fitting the polytope to the smallest regular polygon whose chords include its chords.

Fontaine and Hurley's discovery of a chordal formula for isoclinic rotations closes the circuit on Kappraff and Adamson's discovery of a rotational connection between dynamical systems, Steinbach's golden fields, and Coxeter's Euclidean geometry of ''n'' dimensions. Application of the Fontaine and Hurley procedure in higher-dimensional spaces demonstrates why the connection exists: because polytope sequences generally, from Steinbach's golden polygon chord sequences, to chord sequences in isoclinic rotation helixes, to subsumption relations in the sequence of regular 4-polytopes, arise as expressions of the reflections and rotations of distinct Coxeter symmetry groups, when those various groups interact.

== Appendix: Sequence of regular 4-polytopes ==
{{Regular convex 4-polytopes|wiki=W:|columns=7}}

== Notes ==
{{Notelist}}

== Citations ==
{{Reflist}}

== References ==
{{Refbegin}}
* {{Cite journal | last=Steinbach | first=Peter | year=1997 | title=Golden fields: A case for the Heptagon | journal=Mathematics Magazine | volume=70 | issue=Feb 1997 | pages=22–31 | doi=10.1080/0025570X.1997.11996494 | jstor=2691048 | ref={{SfnRef|Steinbach|1997}} }}
* {{Cite journal | last=Steinbach | first=Peter | year=2000 | title=Sections Beyond Golden| journal=Bridges: Mathematical Connections in Art, Music and Science | issue=2000 | pages=35-44 | url=https://archive.bridgesmathart.org/2000/bridges2000-35.pdf | ref={{SfnRef|Steinbach|2000}}}}
* {{Cite journal | last1=Kappraff | first1=Jay | last2=Jablan | first2=Slavik | last3=Adamson | first3=Gary | last4=Sazdanovich | first4=Radmila | year=2004 | title=Golden Fields, Generalized Fibonacci Sequences, and Chaotic Matrices | journal=Forma | volume=19 | pages=367-387 | url=https://archive.bridgesmathart.org/2005/bridges2005-369.pdf | ref={{SfnRef|Kappraff, Jablan, Adamson &amp; Sazdanovich|2004}} }}
* {{Cite journal | last1=Kappraff | first1=Jay | last2=Adamson | first2=Gary | year=2004 | title=Polygons and Chaos | journal=Dynamical Systems and Geometric Theories | url=https://archive.bridgesmathart.org/2001/bridges2001-67.pdf | ref={{SfnRef|Kappraff &amp; Adamson|2004}} }}
* {{Cite journal | last1=Fontaine | first1=Anne | last2=Hurley | first2=Susan | year=2006 | title=Proof by Picture: Products and Reciprocals of Diagonal Length Ratios in the Regular Polygon | journal=Forum Geometricorum | volume=6 | pages=97-101 | url=https://scispace.com/pdf/proof-by-picture-products-and-reciprocals-of-diagonal-length-1aian8mgp9.pdf }}
{{Refend}}</text>
      <sha1>hg0ij8c6rwk1l3d3ylfmc1d6uxz06y7</sha1>
    </revision>
    <revision>
      <id>2809834</id>
      <parentid>2809832</parentid>
      <timestamp>2026-05-17T03:47:38Z</timestamp>
      <contributor>
        <username>Dc.samizdat</username>
        <id>2856930</id>
      </contributor>
      <comment>/* The 8-point regular polytopes */</comment>
      <origin>2809834</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="47059" sha1="oexuz3nl4vrh6sagtdbipvvxcenhml7" xml:space="preserve">{{align|center|David Brooks Christie}}
{{align|center|dc@samizdat.org}}
{{align|center|Draft in progress}}
{{align|center|January 2026 - April 2026}}

&lt;blockquote&gt;Steinbach discovered the formula for the ratios of diagonal to side in the regular polygons. Fontaine and Hurley extended this result, discovering a formula for the reciprocal of a regular polygon chord derived geometrically from the chord's star polygon. We observe that these findings in plane geometry apply more generally, to polytopes of any dimensionality. Fontaine and Hurley's geometric procedure for finding the reciprocals of the chords of a regular polygon from their star polygons also finds the rotational geodesics of any polytope of any dimensionality.&lt;/blockquote&gt;
== Introduction ==
Steinbach discovered the Diagonal Product Formula and the Golden Fields family of ratios of diagonal to side in the regular polygons. He showed how this family extends beyond the pentagon {5} with its well-known golden bisection proportional to 𝜙, finding that the heptagon {7} has an analogous trisection, the nonagon {9} has an analogous quadrasection, and the hendecagon {11} has an analogous pentasection, an extended family of golden proportions with quasiperiodic properties. 

Kappraff and Adamson extended these findings in plane geometry to a theory of Generalized Fibonacci Sequences, showing that the Golden Fields not only do not end with the hendecagon, they form an infinite number of periodic trajectories when operated on by the Mandelbrot operator. They found a relation between the edges of star polygons and dynamical systems in the state of chaos, revealing a connection between chaos theory, number, and rotations in Coxeter Euclidean geometry. 

Fontaine and Hurley examined Steinbach's finding that the length of each chord of a regular polygon is both the product of two chords and the sum of a set of smaller chords, so that in rotations to add is to multiply. They illustrated Steinbach's sets of additive chords lying parallel to each other in the plane (pointing in the same direction), and by applying Steinbach's formula more generally they found another summation relation of signed parallel chords (pointing in opposite directions) which relates each chord length to its reciprocal, and relates the summation to a distinct star polygon rotation. 

We examine these remarkable findings (which stem from study of the chords of humble regular polygons) in higher-dimensional spaces, specifically in the chords, polygons and rotations of the [[120-cell]], the largest four-dimensional regular convex polytope.

== Visualizing the 120-cell ==
{| class=&quot;wikitable floatright&quot; width=&quot;400&quot;
|style=&quot;vertical-align:top&quot;|[[File:120-cell.gif|200px]]&lt;br&gt;Orthographic projection of the 600-point 120-cell &lt;small&gt;&lt;math&gt;\{5,3,3\}&lt;/math&gt;&lt;/small&gt; performing a [[W:SO(4)#Geometry of 4D rotations|simple rotation]].{{Sfn|Hise|2011|loc=File:120-cell.gif|ps=; &quot;Created by Jason Hise with Maya and Macromedia Fireworks. A 3D projection of a 120-cell performing a [[W:SO(4)#Geometry of 4D rotations|simple rotation]].&quot;}} In this simplified rendering only the 120-cell's own edges are shown; its 29 interior chords are not rendered. Therefore even though it is translucent, only its outer surface is visible. The complex interior parts of the 120-cell, all its inscribed 5-cells, 16-cells, 8-cells, 24-cells, 600-cells and its much larger inventory of polyhedra, are completely invisible in this view, as none of their edges are rendered at all.
|style=&quot;vertical-align:top&quot;|[[File:Ortho solid 016-uniform polychoron p33-t0.png|200px]]&lt;br&gt;Orthographic projection of the 600-point [[W:Great grand stellated 120-cell|great grand stellated 120-cell]] &lt;small&gt;&lt;math&gt;\{\tfrac{5}{2},3,3\}&lt;/math&gt;&lt;/small&gt;.{{Sfn|Ruen: Great grand stellated 120-cell|2007}} The 120-cell is its convex hull. The projection to the left renders only the 120-cell's shortest chord, its 1200 edges. The projection above also renders only one of the 120-cell's 30 chords, the edges of its 120 inscribed regular 5-cells. The 120-cell itself (the convex hull) is invisible in this view, as its edges are not rendered.
|}

[[120-cell#Geometry|The 120-cell is the maximally complex regular 4-polytope]], containing inscribed instances of every regular 1-, 2-, 3-, and 4-polytope, except the regular polygons of more than {15} sides. 

The 120-cell is the convex hull of a regular [[120-cell#Relationships among interior polytopes|compound of each of the 6 regular convex 4-polytopes]]. They are the [[5-cell|5-point (5-cell) 4-simplex]], the [[16-cell|8-point (16-cell) 4-orthoplex]], the [[W:Tesseract|16-point (8-cell) tesseract]], the [[24-cell|24-point (24-cell)]], the [[600-cell|120-point (600-cell)]], and the [[120-cell|600-point (120-cell)]]. The 120-cell is the convex hull of a compound of 120 disjoint regular 5-cells, of 75 disjoint 16-cells, of 25 disjoint 24-cells, and of 5 disjoint 600-cells.

The 120-cell contains an even larger inventory of irregular polytopes, created by the intersection of multiple instances of these component regular 4-polytopes. Many are quite unexpected, because they do not occur as components of any regular polytope smaller than the 120-cell. As just one example among the [[120-cell#Concentric hulls|sections of the 120-cell]], there is an irregular 24-point polyhedron with 16 triangle faces and 4 nonagon {9} faces.{{Sfn|Moxness|}}

Most renderings of the 120-cell, like the rotating projection here, only illustrate its outer surface, which is a honeycomb of face-bonded dodecahedral cells. Only the objects in its 3-dimensional surface are rendered, namely the 120 dodecahedra, their pentagon faces, and their edges. Although the 120-cell has chords of 30 distinct lengths, in this kind of simplified rendering only the 120-cell's own edges (its shortest chord) are shown. Its 29 interior chords, the edges of objects in the interior of the 120-cell, are not rendered, so interior objects are not visible at all.

Visualizing the complete interior of the 600-vertex 120-cell in a single image is impractical because of its complexity. Only four 120-cell edges are incident at each vertex, but [[120-cell#Chords|600 chords (of all 30 lengths)]] are incident at ''each'' vertex.

== Compounds in the 120-cell ==
The 8-point (16-cell), not the 5-point (5-cell), is the smallest building block; it compounds to every larger regular 4-polytope. The 5-point (5-cell) does compound to the 600-point (120-cell), but it does not fit into any smaller regular 4-polytope. 

The 8-point (16-cell) compounds by 2 in the 16-point (8-cell), and by 3 in the 24-point (24-cell). The 16-point (8-cell) compounds in the 24-point (24-cell) by 3 non-disjoint instances of itself, with each of the 24 vertices shared by two 16-point (8-cells). The 24-point (24-cell) compounds by 5 disjoint instances of itself in the 120-point (600-cell), and the 120-point (600-cell) compounds by 5 disjoint instances of itself in the 600-point (120-cell).

The 24-point (24-cell) also compounds by &lt;math&gt;5^2&lt;/math&gt; non-disjoint instances of itself in the 120-point (600-cell); it compounds in 5 disjoint instances of itself, 10 (not 5) different ways. Whichever set of 5 disjoint 24-point (24-cells) are assembled, the resulting 120-point (600-cell) contains 25 distinct 24-point (24-cells), not just 5 (or 10). This implies that 15 disjoint 8-point (16-cells) will construct a 120-point (600-cell), which will contain 75 distinct 8-point (16-cells). 

The 600-point (120-cell) is 5 disjoint 120-point (600-cells), just 2 different ways (not 5 or 10 ways), so it is 10 distinct 120-point (600-cells). This implies that the 8-point (16-cell) compounds by 3 times &lt;math&gt;5^2&lt;/math&gt; (75) disjoint instances of itself in the 600-point (120-cell), which contains &lt;math&gt;3^2&lt;/math&gt; times  &lt;math&gt;5^2&lt;/math&gt; (225) distinct instances of the 24-point (24-cell), and  &lt;math&gt;3^3&lt;/math&gt; times &lt;math&gt;5^2&lt;/math&gt; (675) distinct instances of the 8-point (16-cell). 

These facts were discovered painstakingly by various researchers, and no one has found a general rule governing subsumption relations among regular polytopes. The reasons for some of their numeric incidence relations are far from obvious. [[W:Pieter Hendrik Schoute|Schoute]] was the first to see that the 120-point (600-cell) is a compound of 5 24-point (24-cells) ''10 different ways'', and after he saw it a hundred years lapsed until Denney, Hooker, Johnson, Robinson, Butler &amp; Claiborne proved his result, and showed why.{{Sfn|Denney, Hooker, Johnson, Robinson, Butler &amp; Claiborne|2020|loc=''The geometry of H4 polytopes''}}

So much for the compounds of 16-cells. The 120-cell is also the convex hull of the compound of 120 disjoint regular 5-cells. That stellated compound (without its convex hull of 120-cell edges) is the [[w:Great_grand_stellated_120-cell|great grand stellated 120-cell]] illustrated above, the final regular [[W:Stellation|stellation]] of the 120-cell, and the only [[W:Schläfli-Hess polychoron|regular star 4-polytope]] to have the 120-cell for its convex hull. The edges of the great grand stellated 120-cell are &lt;math&gt;\phi^6&lt;/math&gt; as long as those of its 120-cell [[W:List of polyhedral stellations#Stellation process|stellation core]] deep inside.

The compound of 120 disjoint 5-point (5-cells) can be seen to be equivalent to the compound of 5 disjoint 120-point (600-cells), as follows. Beginning with a single 120-point (600-cell), expand each vertex into a regular 5-cell, by adding 4 new equidistant vertices, such that the 5 vertices form a regular 5-cell inscribed in the 3-sphere. The 120 5-cells are disjoint, and the 600 vertices form 5 disjoint 120-point (600-cells): a 120-cell.

== Thirty distinguished distances ==
The 30 numbers listed in the table are all-important in Euclidean geometry. A case can be made on symmetry grounds that their squares are the 30 most important numbers between 0 and 4. The 30 rows of the table are the 30 distinct [[120-cell#Geodesic rectangles|chord lengths of the unit-radius 120-cell]], the largest regular convex 4-polytope. Since the 120-cell subsumes all smaller regular polytopes, its 30 chords are the complete chord set of all the regular polytopes that can be constructed in the first four dimensions of Euclidean space, except for regular polygons of more than 15 sides.

{| class=&quot;wikitable&quot; style=&quot;white-space:nowrap;text-align:center&quot;
!rowspan=2|&lt;math&gt;c_t&lt;/math&gt;
!rowspan=2|arc
!rowspan=2|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{n}\right\}&lt;/math&gt;&lt;/small&gt;
!rowspan=2|&lt;math&gt;\left\{p\right\}&lt;/math&gt;
!rowspan=2|&lt;small&gt;&lt;math&gt;m\left\{\frac{k}{d}\right\}&lt;/math&gt;&lt;/small&gt;
!rowspan=2|Steinbach roots
!colspan=7|Chord lengths of the unit 120-cell
|-
!colspan=5|unit-radius length &lt;math&gt;c_t&lt;/math&gt;
!colspan=2|unit-edge length &lt;math&gt;c_t/c_1&lt;/math&gt;&lt;br&gt;in 120-cell of radius &lt;math&gt;c_8=\sqrt{2}\phi^2&lt;/math&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{1,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;15.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{30\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{30\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;c_{4,1}-c_{2,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7-3 \sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.270091&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2} \phi ^2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2 \phi ^4}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.072949}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{2,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;25.2{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{2}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \left\{15\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(c_{18,1}-c_{4,1}\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{3-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.437016&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2} \phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2 \phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.190983}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.61803&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{3,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;36{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{10\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3 \left\{\frac{10}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(\sqrt{5}-1\right) c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(\sqrt{5}-1\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.618034&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{\phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.381966}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.28825&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{4,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;41.4{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{c_{8,1}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.707107&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.61803&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{5,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;44.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{4}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \left\{\frac{15}{2}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} c_{2,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{9-3 \sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.756934&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{\frac{3}{2}}}{\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2 \phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.572949}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} \phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.80252&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{6,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;49.1{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{17}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{5-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{5-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.831254&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt[4]{5} \sqrt{\frac{1}{\phi }}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\sqrt{5}}{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.690983}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\phi ^3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.07768&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{7,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;56.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{20}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{1}{\phi }} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{2}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;0.93913&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{\frac{\psi }{\phi }}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\psi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{0.881966}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\psi  \phi ^3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.47709&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;60{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{5}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{6\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{6\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.70246&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{9,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;66.1{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{40}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{1}{2 \phi }} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}-\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.09132&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{\frac{\chi }{\phi }}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\chi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.19098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\chi  \phi ^3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.04057&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{10,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;69.8{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{11}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi  c_{4,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1+\sqrt{5}}{2 \sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.14412&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\phi }{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\phi ^2}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.30902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^3&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.23607&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{11,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;72{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{6}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{5\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{5\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\frac{1}{\phi }} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\frac{2}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.17557&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3-\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3-\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.38197}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \sqrt{3-\phi } \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.3525&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{12,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;75.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{24}{5}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.22474&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.53457&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{13,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;81.1{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{13}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{9-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{9-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.30038&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{9-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(9-\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.69098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(9-\sqrt{5}\right)} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.8146&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{14,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;84.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{40}{9}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt[4]{5} \sqrt{\phi } c_{8,1}}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt[4]{5} \sqrt{1+\sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.345&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt[4]{5} \sqrt{\phi }}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\sqrt{5} \phi }{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1.80902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt[4]{5} \sqrt{\phi ^5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;4.9798&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{15,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;90.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{4\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{4\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 c_{4,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.41421&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.23607&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{16,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;95.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{29}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{11-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.4802&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(11-\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.19098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(11-\sqrt{5}\right)} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.48037&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{17,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;98.9{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{31}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7+\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{7+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.51954&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{7+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(7+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.30902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\psi  \phi ^5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.62605&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{18,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;104.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{8}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{15}{4}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.58114&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{5} \sqrt{\phi ^4}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.8541&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{19,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;108.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{9}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{10}{3}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;c_{3,1}+c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \left(1+\sqrt{5}\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.61803&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{1+\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.61803}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2} \phi ^3&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;5.9907&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{20,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;110.2{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{13-\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.64042&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13-\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(13-\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.69098}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\phi ^2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.07359&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{21,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;113.9{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{60}{19}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.67601&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{1}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2.80902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\frac{\chi }{\phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.20537&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{22,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;120{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{10}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{3\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{3\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.73205&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{6} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.41285&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{23,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;124.0{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{120}{41}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{\phi }+\frac{5}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{5}{2}+\frac{2}{1+\sqrt{5}}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.7658&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4-\frac{\psi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4-\frac{\psi }{2 \phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.11803}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\chi  \phi ^5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.53779&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{24,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;130.9{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{20}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{11+\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.81907&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{11+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(11+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.30902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\frac{\sqrt{5}}{\phi }}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.73503&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{25,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;135.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{11}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{11}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7+3 \sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{7+3 \sqrt{5}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.85123&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\phi ^2}{\sqrt{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{\phi ^4}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.42705}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^4&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.8541&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{26,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;138.6{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{12}{5}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.87083&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{7}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.5}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{7} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;6.92667&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{27,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;144{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{12}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{5}{2}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(5+\sqrt{5}\right)} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{2} \left(5+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.90211&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\phi +2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{2+\phi }&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.61803}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{2 \phi +4}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.0425&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{28,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;154.8{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{13}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{13}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{13+\sqrt{5}} c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.95167&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{\sqrt{13+\sqrt{5}}}{2}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{1}{4} \left(13+\sqrt{5}\right)}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.80902}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi ^2 \sqrt{8-\frac{1}{\phi ^2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.22598&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{29,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;164.5{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{14}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{15}{7}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\phi  c_{12,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\frac{1}{2} \sqrt{\frac{3}{2}} \left(1+\sqrt{5}\right)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.98168&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3}{2}} \phi &lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{\frac{3 \phi ^2}{2}}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3.92705}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{3} \phi ^3&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.33708&lt;/math&gt;&lt;/small&gt;
|-
|&lt;small&gt;&lt;math&gt;c_{30,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;180{}^{\circ}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{\frac{30}{15}\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{2\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\left\{2\right\}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 c_{8,1}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;\sqrt{4.}&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2 \sqrt{2} \phi ^2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;7.40492&lt;/math&gt;&lt;/small&gt;
|-
|rowspan=4 colspan=6|
|rowspan=4 colspan=4|
&lt;small&gt;&lt;math&gt;\phi&lt;/math&gt;&lt;/small&gt; is the golden ratio:&lt;br&gt;
&lt;small&gt;&lt;math&gt;\phi ^2-\phi -1=0&lt;/math&gt;&lt;/small&gt;&lt;br&gt;
&lt;small&gt;&lt;math&gt;\frac{1}{\phi }+1=\phi&lt;/math&gt;&lt;/small&gt;, and: &lt;small&gt;&lt;math&gt;\phi+1=\phi^2&lt;/math&gt;&lt;/small&gt;&lt;br&gt;
&lt;small&gt;&lt;math&gt;\frac{1}{\phi }::1::\phi ::\phi ^2&lt;/math&gt;&lt;/small&gt;&lt;br&gt;
&lt;small&gt;&lt;math&gt;1/\phi&lt;/math&gt;&lt;/small&gt; and &lt;small&gt;&lt;math&gt;\phi&lt;/math&gt;&lt;/small&gt; are the golden sections of &lt;small&gt;&lt;math&gt;\sqrt{5}&lt;/math&gt;&lt;/small&gt;:&lt;br&gt;
&lt;small&gt;&lt;math&gt;\phi +\frac{1}{\phi }=\sqrt{5}&lt;/math&gt;&lt;/small&gt;
|colspan=2|&lt;small&gt;&lt;math&gt;\phi = (\sqrt{5} + 1)/2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;1.618034&lt;/math&gt;&lt;/small&gt;
|-
|colspan=2|&lt;small&gt;&lt;math&gt;\chi = (3\sqrt{5} + 1)/2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;3.854102&lt;/math&gt;&lt;/small&gt;
|-
|colspan=2|&lt;small&gt;&lt;math&gt;\psi = (3\sqrt{5} - 1)/2&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.854102&lt;/math&gt;&lt;/small&gt;
|-
|colspan=2|&lt;small&gt;&lt;math&gt;\psi = 11/\chi = 22/(3\sqrt{5} + 1)&lt;/math&gt;&lt;/small&gt;
|&lt;small&gt;&lt;math&gt;2.854102&lt;/math&gt;&lt;/small&gt;
|}

...

== The 8-point regular polytopes ==
In 2-space we have the regular 8-point octagon, in 3-space the regular 8-point cube, and in 4-space the regular 8-point [[16-cell]].

A planar octagon with rigid edges of unit length has chords of length:

:&lt;math&gt;r_1=1,r_2=\sqrt{2+\sqrt{2}} \approx 1.84776,r_3=1+\sqrt{2} \approx 2.41421,r_4=\sqrt{4 + \sqrt{8}} \approx 2.61313&lt;/math&gt;

The chord ratio &lt;math&gt;r_3=1+\sqrt{2}&lt;/math&gt; is a geometrical proportion, the [[W:Silver ratio|silver ratio]]. Fontaine and Hurley's procedure for obtaining the reciprocal of a chord tells us that:

:&lt;math&gt;r_3-r_1-r_1=1/r_3 \approx 0.41421&lt;/math&gt;

Note that &lt;math&gt;1/r_3=\sqrt{2}-1=r_3-2&lt;/math&gt;.

If we embed this planar octagon in 3-space, we can make it skew, repositioning its vertices so that each is one unit-edge length distant from three others instead of two others, at the vertices of a unit-edge cube with chords of length:

:&lt;math&gt;r_1=1, r_2=\sqrt{2}, r_3=\sqrt{3}, r_4=\sqrt{2}&lt;/math&gt;

If we embed this cube in 4-space, we can skew it some more, repositioning its vertices so that each is one unit-edge length distant from six others instead of three others, at the vertices of a unit-edge 4-polytope with chords of length:

:&lt;math&gt;r_1=1,r_2=1,r_3=1,r_4=\sqrt{2}&lt;/math&gt;

All of its chords except its long diameters are the same unit length as its edge. In fact they are its 24 edges, and it is a 16-cell of radius &lt;small&gt;&lt;math&gt;1/\sqrt{2}&lt;/math&gt;&lt;/small&gt;.

[[File:octagon16cell.png|thumb|Orthogonal projection of a regular 16-cell to the [[16-cell#Projections|B&lt;sub&gt;4&lt;/sub&gt; Coxeter plane]]. Only its edges are shown; its long diameter chords are not drawn. All 24 edges are the same length. Only the edges of the two disjoint squares lie parallel to the projection plane, in completely orthogonal central planes.]]

The [[16-cell]] is the [[W:Regular convex 4-polytope|regular convex 4-polytope]] with [[W:Schläfli symbol|Schläfli symbol]] {3,3,4}. It has 8 vertices, 24 edges, 32 equilateral triangle faces, and 16 regular tetrahedron cells. It is the [[16-cell#Octahedral dipyramid|four-dimensional analogue of the octahedron]], and each of its four orthogonal central hyperplanes is an octahedron.

The only planar regular polygons found in the 16-cell are face triangles and central plane squares, but the 16-cell also contains a skew regular octagon, its [[W:Petrie polygon|Petrie polygon]]. The chords of this regular octagon, which lies skew in 4-space, are those given above for the 16-cell, as opposed to those for the cube or the regular octagon in the plane. The 16-cell is a construct of 3 Petrie octagons which share the same 8 vertices but have disjoint sets of 8 edges each.

The regular octad has higher symmetry in 4-space than it does in 2-space. The 16-cell is the 4-orthoplex, the simplest regular 4-polytope after the [[5-cell|4-simplex]]. All the larger regular 4-polytopes, including the 120-cell, are compounds of the 16-cell. The regular octagon exhibits this high symmetry only when embedded in 4-space at the vertices of the 16-cell.

The 16-cell constitutes an [[W:Orthonormal basis|orthonormal basis]] for the choice of a 4-dimensional Cartesian reference frame, because its vertices define four orthogonal axes. The eight vertices of a unit-radius 16-cell are (±1, 0, 0, 0), (0, ±1, 0, 0), (0, 0, ±1, 0), (0, 0, 0, ±1). All vertices are connected by &lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt; edges except opposite pairs. 

The vertex coordinates of the 16-cell form 6 central squares lying in 6 pairwise [[W:Orthogonal|orthogonal]] coordinate planes. Great squares in ''opposite'' planes that do not share an axis (e.g. in the ''xy'' and ''wz'' planes) are completely disjoint (they do not intersect at any vertices). These planes are [[W:Completely orthogonal|completely orthogonal]].{{Efn|name=Six orthogonal planes of the Cartesian basis}}

Since this unit-radius coordinate system is convenient, let us derive the unit-radius 16-cell by skewing a unit-radius planar octagon, which has chords of length:

:&lt;math&gt;r_1=\sqrt{2-\sqrt{2}} \approx 0.76537,r_2=\sqrt{2},r_3=\sqrt{2+\sqrt{2}} \approx 1.84776,r_4=2&lt;/math&gt;

We will need a planar octagon with rigid &lt;math&gt;r_2&lt;/math&gt; chords, rather than one with rigid &lt;math&gt;r_1&lt;/math&gt; edges. The octagon's &lt;math&gt;r_2&lt;/math&gt; chords form two disjoint great squares, visible in the orthogonal projection, which we can reposition in 3-space to form a cube by making them parallel, and in 4-space to form a 16-cell by making them completely orthogonal.

In the 16-cell the two completely orthogonal great squares formed by the &lt;math&gt;r_2&lt;/math&gt; chords are both parallel and perpendicular to each other. A ''simple'' rotation of the 16-cell in ''one'' of those two central planes rotates that square like a wheel, while the other square does not move. The four vertices of the rotating square orbit on a great circle in the plane.

The &lt;math&gt;r_1&lt;/math&gt; chords of the 16-cell form a Petrie polygon which zig-zags back and forth between the two completely orthogonal &lt;math&gt;r_2&lt;/math&gt; squares.

The &lt;math&gt;r_3&lt;/math&gt; chords of the 16-cell form a circular helix, visible as a skew {8/3} octagram in the orthogonal projection. A ''double'' rotation of the 16-cell, in ''both'' of the two completely orthogonal &lt;math&gt;r_2&lt;/math&gt; square planes at once by the same angle, moves the eight vertices along the circular helix over the &lt;math&gt;r_3&lt;/math&gt; chords. The circular helix is a [[w:Geodesic|geodesic]] great circle on the 3-sphere of a special kind: it does not lie in a central plane, its circumference is &lt;math&gt;4 \pi&lt;/math&gt;, and it occurs in either a left or right hand chiral form.

[[W:Rotations in 4-dimensional Euclidean space|Rotations in 4-dimensional Euclidean space]] can be seen as the composition of two 2-dimensional rotations in completely orthogonal planes. The general rotation in 4-space is a double rotation in pairs of completely orthogonal planes. Two completely orthogonal planes are called invariant planes of the rotation when all points in the plane rotate on circles that remain in the plane, even as the whole plane tilts sideways (like a coin flipping) into another plane. The two completely orthogonal rotations of each plane (like a wheel, and like a coin flipping) are simultaneous but independent, in that they are not geometrically constrained to turn at the same rate. However, the most circular kind of rotation (as opposed to an elliptical double rotation of a rigid spherical object) occurs when the invariant planes do rotate through the same angle in the same time interval. Such equi-angled double rotations are called [[w:SO(4)#Isoclinic_rotations|isoclinic]], also [[w:William_Kingdon_Clifford|Clifford]] displacements.

The 16-cell is the simplest possible frame in which to [[16-cell#Rotations|observe 4-dimensional rotations]] because its characteristic rotations feature a single pair of invariant rotation planes. In the 16-cell an isoclinic rotation by 90° in any pair of invariant completely orthogonal square central planes takes every square central plane to its completely orthogonal square central plane in a twisting displacement, as they tilt sideways 90° into each other's plane while rotating 90° internally. All the vertices move at once on the same circular helix geodesic, displaced 90° in 8 orthogonal directions, and the rigid 16-cell assumes a new orientation in 4-space. When the 90° isoclinic rotation is continued in the same rotational direction through an additional 90°, each vertex is again displaced 90°, but from the new orientation in a direction orthogonal to its first 90° displacement. After 360° of rotation each vertex reaches its antipodal position.

The trajectory of each vertex over each 90° isoclinic rotational displacement is a one-eighth segment of its geodesic orbit. Its entire orbit traces a circular helix in 4-space over eight &lt;math&gt;r_3&lt;/math&gt; chords, and also traces an ordinary great circle twice over the four &lt;math&gt;r_2&lt;/math&gt; chords within one of the two moving invariant rotation planes. In the course of a 720° isoclinic rotation each vertex departs from all 8 vertex positions just once and returns to its original position, and the 16-cell returns to its original orientation.

== Hypercubes ==
The long diameter of the unit-edge [[W:Hypercube|hypercube]] of dimension &lt;small&gt;&lt;math&gt;n&lt;/math&gt;&lt;/small&gt; is &lt;small&gt;&lt;math&gt;\sqrt{n}&lt;/math&gt;&lt;/small&gt;, so the unit-edge [[w:Tesseract|4-hypercube, the 16-point (8-cell) tesseract,]] has chords:
:&lt;math&gt;r_1=\sqrt{1},r_2=\sqrt{2},r_3=\sqrt{3},r_4=\sqrt{4}&lt;/math&gt;
Uniquely in its 4-dimensional case, the hypercube's edge length equals its radius, like the hexagon. We call such polytopes ''radially equilateral'', because they can be constructed from equilateral triangles which meet at their center, each contributing two radii and an edge. The cuboctahedron and the 24-cell are also radially equilateral.

The [[W:Tesseract|tesseract]] is the [[W:Regular convex 4-polytope|regular convex 4-polytope]] with [[W:Schläfli symbol|Schläfli symbol]] {4,3,3}. It has 16 vertices, 32 edges, 24 square faces, and 8 cube cells. It is the four-dimensional analogue of the cube.

The tesseract is the [[W:Dual polytope|dual polytope]] of the 16-cell. They have the same Petrie polygon, the regular octagon, but the tesseract contains 2 disjoint instances and 4 distinct instances of the skew octagon. We can construct the tesseract by skewing two planar octagons. Because the tesseract is radially equilateral (unlike the 16-cell), we start with our original octagon of unit-edge length, rather than the octagon of edge length &lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt; that we needed to build the unit-radius 16-cell.

For our tesseract construction we skew each planar octagon into a cube, so we have a compound of two completely orthogonal cubes. Provided the planes were completely orthogonal in 4-space and we skewed them both the same way, the 16 vertices will be the vertices of a tesseract with half of its 32 edges missing.

The 16-point tesseract is the convex hull of a compound of two 8-point 16-cells, in exact dimensional analogy to the way the 8-point cube is the convex hull of a [[W:Stellated octahedron|compound of two regular 4-point tetrahedra]]. The [[W:Demihypercube|demihypercubes]] occupy alternate vertices of the hypercubes. The diagonals of the square faces of the unit-radius tesseract are the &lt;small&gt;&lt;math&gt;\sqrt{2}&lt;/math&gt;&lt;/small&gt; edges of two unit-radius 16-cells, which are also the edges of the square central planes.

Because the tesseract contains two 16-cells in alternate positions it has two sets of 6 orthogonal square central planes. Two angles are required to specify the relationship between two planes in 4-space. Pairs of planes within each 16-cell are 90° apart in one angle, and either 0° or 90° apart in the other angle. They are 90° apart in both angles if and only if they are completely orthogonal planes, 90° apart by isoclinic rotation, with no vertices in common and their corresponding vertices 180° apart. Otherwise they are 0° apart in one of the angles, 90° apart by simple rotation with their corresponding vertices 90° apart, and they intersect in one axis and lie in a common 3-dimensional hyperplane.{{Efn|A double rotation in which one of the two angles of rotation is 0°, so that one of the completely orthogonal invariant planes does not rotate, is called a simple rotation. Ordinary rotations observed in a 3-dimensional space are simple rotations.}}

A pair of square central planes from alternate 16-cells are 60° apart by isoclinic rotation, with their corresponding vertices 120° apart. The planes are not orthogonal or parallel, so they intersect in a line somewhere, but they have no vertices in common, they have no 3-dimensional hyperplane in common, and they cannot reach each other by simple rotation. Such pairs of objects are called [[W:Clifford parallel|Clifford parallel]] because all their corresponding pairs of vertices are the same distance apart, although they are not parallel in the usual sense, because they have a common center. Not only the alternate 16-cells' corresponding square central planes, but also the 16-cells themselves, are Clifford parallel objects.

We can rotate the tesseract isoclinically the way we rotated the 16-cell, by 90° in two completely orthogonal invariant square central planes, with the same effect on both alternate 16-cells. In the course of a 720° isoclinic rotation in invariant square central planes each vertex departs from all 8 vertex positions of its 16-cell just once and returns to its original position, but it does not visit the vertex positions of the other 16-cell. The skew octagon geodesic orbits of the 16 vertices lie on two disjoint octagram circular helixes of the same chirality, which are Clifford parallel objects that form a circular double helix.

== The 24-cell ==
In 2-space we have the radially equilateral 6-point hexagon. In 3-space we have the radially equilateral 12-point cuboctahedron, with 4 hexagonal central planes. In 4-space we have the radially equilateral 24-point 24-cell, with 4 cuboctahedral central hyperplanes and 16 hexagonal central planes.

Great hexagons are a rounder choice than great squares for the invariant rotation planes in which to rotate a 4-polytope isoclinically. The complete hexagonal isoclinic revolution requires 720° like the square isoclinic revolution, but it is completed in 6 chordal steps of 120° each rather than 8 chordal steps of 90° each.

...

== The 600-cell ==

...

== Finally the 120-cell ==

...

== Conclusions ==

Fontaine and Hurley's discovery is more than a formula for the reciprocal of a regular ''n''-polygon diagonal. It also yields the discrete sequence of isocline chords of the distinct isoclinic rotation characteristic of a ''d''-dimensional regular polytope. The characteristic rotational chord sequence of the ''d''-polytope can be represented geometrically in two dimensions on a distinct star polygon, but it lies on a geodesic circle through ''d''-dimensional space. Fontaine and Hurley discovered the geodesic topology of polytopes generally. Their procedure will reveal the geodesics of arbitrary non-uniform polytopes, since it can be applied to a polytope of any dimensionality and irregularity, by first fitting the polytope to the smallest regular polygon whose chords include its chords.

Fontaine and Hurley's discovery of a chordal formula for isoclinic rotations closes the circuit on Kappraff and Adamson's discovery of a rotational connection between dynamical systems, Steinbach's golden fields, and Coxeter's Euclidean geometry of ''n'' dimensions. Application of the Fontaine and Hurley procedure in higher-dimensional spaces demonstrates why the connection exists: because polytope sequences generally, from Steinbach's golden polygon chord sequences, to chord sequences in isoclinic rotation helixes, to subsumption relations in the sequence of regular 4-polytopes, arise as expressions of the reflections and rotations of distinct Coxeter symmetry groups, when those various groups interact.

== Appendix: Sequence of regular 4-polytopes ==
{{Regular convex 4-polytopes|wiki=W:|columns=7}}

== Notes ==
{{Notelist}}

== Citations ==
{{Reflist}}

== References ==
{{Refbegin}}
* {{Cite journal | last=Steinbach | first=Peter | year=1997 | title=Golden fields: A case for the Heptagon | journal=Mathematics Magazine | volume=70 | issue=Feb 1997 | pages=22–31 | doi=10.1080/0025570X.1997.11996494 | jstor=2691048 | ref={{SfnRef|Steinbach|1997}} }}
* {{Cite journal | last=Steinbach | first=Peter | year=2000 | title=Sections Beyond Golden| journal=Bridges: Mathematical Connections in Art, Music and Science | issue=2000 | pages=35-44 | url=https://archive.bridgesmathart.org/2000/bridges2000-35.pdf | ref={{SfnRef|Steinbach|2000}}}}
* {{Cite journal | last1=Kappraff | first1=Jay | last2=Jablan | first2=Slavik | last3=Adamson | first3=Gary | last4=Sazdanovich | first4=Radmila | year=2004 | title=Golden Fields, Generalized Fibonacci Sequences, and Chaotic Matrices | journal=Forma | volume=19 | pages=367-387 | url=https://archive.bridgesmathart.org/2005/bridges2005-369.pdf | ref={{SfnRef|Kappraff, Jablan, Adamson &amp; Sazdanovich|2004}} }}
* {{Cite journal | last1=Kappraff | first1=Jay | last2=Adamson | first2=Gary | year=2004 | title=Polygons and Chaos | journal=Dynamical Systems and Geometric Theories | url=https://archive.bridgesmathart.org/2001/bridges2001-67.pdf | ref={{SfnRef|Kappraff &amp; Adamson|2004}} }}
* {{Cite journal | last1=Fontaine | first1=Anne | last2=Hurley | first2=Susan | year=2006 | title=Proof by Picture: Products and Reciprocals of Diagonal Length Ratios in the Regular Polygon | journal=Forum Geometricorum | volume=6 | pages=97-101 | url=https://scispace.com/pdf/proof-by-picture-products-and-reciprocals-of-diagonal-length-1aian8mgp9.pdf }}
{{Refend}}</text>
      <sha1>oexuz3nl4vrh6sagtdbipvvxcenhml7</sha1>
    </revision>
  </page>
  <page>
    <title>Media Literacy and You</title>
    <ns>0</ns>
    <id>327555</id>
    <revision>
      <id>2809771</id>
      <parentid>2809432</parentid>
      <timestamp>2026-05-16T22:33:00Z</timestamp>
      <contributor>
        <username>DavidMCEddy</username>
        <id>218607</id>
      </contributor>
      <comment>cite: Wikipedia: most democratic force ...</comment>
      <origin>2809771</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="36034" sha1="pxde1vpnac5k4fpukwqd9jyib3r908a" xml:space="preserve">[[File:Pharoah - James VI and I - Trump.png|thumb|Religious and media leaders from the time of the Pharaohs convinced common folk to give increasing shares of what they produced to elites.]]
:''This book uses dates in [[:w:ISO 8601|ISO 8601]], YYYY-MM-DD, when convenient.'' 

== Invitation to edit this book ==

You, dear reader, are invited to contribute questions, ideas and citations to support or refute claims made in this book possibly adding chapters. Wikiversity like other Wikimedia Foundation Projects invites humans to [[w:Wikipedia:Be bold|“be bold but not reckless,”]] while writing from a [[Wikiversity:Disclosures|neutral point of view]], [[Wikiversity:Cite sources|citing credible sources]]. Others are invited to change or revert what you wrote. What stays tends to be written from a neutral point of view citing credible sources. If someone reverts your edit or you have a question, take it to the ''[[Wikiversity:FAQ|''''“Discuss”'''' page]]'' associated with the specific Wikiversity page most related to your concerns. 

Those who teach media literacy are encouraged to invite their students to debate and revise the contents of this book. Doing so would build on a tradition of [[:w:Wikipedia:Student assignments|instructors requiring students to edit wikipedia article(s).]]  Editing [[:w:Wikipedia|Wikipedia]] and other [[:w:Wikimedia Foundation|Wikimedia Foundation]] projects like this book is itself an exercise in media literacy: 

:''Central tenets of media literacy might include writing from a neutral point of view citing credible sources and engaging others, some of whom may disagree, in civil, supportive conversations about what can and cannot be said based on a reasonable evaluation of the available evidence. Wikimedia rules invite contributors to do just that, encouraging them to “be bold but not reckless,” contributing revisions written from a neutral point of view, citing credible sources -- and raising other questions and concerns on the ''''“Discuss”'''' page associated with the specific Wikiversity page most related to your concerns, as mentioned above.''&lt;ref&gt;For more on this, see Graves (2024).&lt;/ref&gt; 
== Text and self-help book and point of discuss ==

This book is intended both as a text and self-help book and as a point of discussion on media literacy from three perspectives: 

:1. Passive media literacy, which is helping individuals understand the importance of looking for information that might contradict one's preconceptions (including suggestions on how to find alternative source of information). This suggests a need for ''disconfirmation bias'' to overcome the [[w:confirmation bias|confirmation bias]] that is a problematic feature of human psychology exploited by the major media, including for-profit social media, to please those who control most of their money.

:2. Proactive media literacy, which is helping individuals learn how to engage others in open, non-threatening and supportive conversations to share concerns, compare sources of information, and build relationships in which different humans can collaborate productively on areas on of common concern while agreeing to disagree agreeable where they differ. 

:3. Active media literacy, by which students of media literacy educate others on media literacy. If each one teaches two&lt;ref&gt;&quot;[[:w:Each one teach one|Each one teach one]]&quot; is an African-American proverb from the time of legalized slavery. However, if each one teaches only one, the growth in literacy will only be linear. Having &quot;each one teaching two&quot;, on average, unleashes the power of doubling and [[:w:exponential growth|exponential growth]], which has the potential of educating the entirety of humanity in a reasonable period of time -- namely after 33 doublings starting from one.&lt;/ref&gt; in a certain period of time, that time period becomes a [[:w:Doubling time|doubling time]]. Ten doublings is a thousand -- actually 1,024 to be precise.&lt;ref&gt;2 time 2 = 4 times 2 = 8 times 2 = 16 times 2 = 32 times 2 = 64 times 2 = 128 times 2 = 256 times 2 = 512 times 2 = 1024: That's 10 doublings, as anyone with a modest understanding of modern digital [[:w:computer|computer]]s will tell you.&lt;/ref&gt; Twenty doublings become a million. Thirty doublings become a billion. Three more doublings become 8 billion, the [[:w:World population|world population]] as of approximately 2022-11-15.&lt;ref&gt;This book uses dates in [[:w:ISO 8601|ISO 8601]], YYYY-MM-DD, when convenient.&lt;/ref&gt; Many organizations, including several United Nations agencies, already have active [[w:media literacy|media literacy]] programs that have already trained many.&lt;ref&gt;''[[Wikibooks:Antiracist Activism for Teachers and Students]]'' includes a chapter on [[Wikibooks:Antiracist Activism for Teachers and Students/Points to Consider for Teaching Anti-racism/Media Literacy In Schools|Media Literacy In Schools]].&lt;/ref&gt; This book is being written hoping to increase the effectiveness and accelerate the rate of growth in media literacy and thereby accelerate progress against many of the most pressing issues facing humanity today.

Much of this book is a [[w:Monograph|research monograph]] summarizing research that seems to have been underreported by the major media to avoid offending people who control most of the money for the media. These research results seem to be central to major political divisions. Each chapter ends in exercises to help the reader practice media literacy skills and have fun doing it. Remember: 

:''I am entitled to my [[Wiktionary:cockamamie|cockamamie]] ideas, and you are entitled to yours.''

Humor is important but must be offered in a way that does not offend others. If others are offended, they may be less interested in dialogue. The term &quot;cockamamie&quot; is used here, hoping that this style of [[w:Self-deprecation|self-deprecation]] might be more inviting for dialogue.

''Never say, &quot;You're wrong, and I'm right!&quot; instead, ask, &quot;May I offer a contrary perspective?&quot; Or &quot;May I share with you another view that I've heard?&quot; ''

Much of the information in this book seems to have been largely overlooked and perhaps suppressed, apparently because it would increase the cost of producing news, some of which would clearly offend people who control much of the money for the media; see the brief discussion of conflicts of interest by the major media in the next &quot;Key claims&quot; section.

==Key claims==

* ''Primary drivers of every major conflict include differences between the media that the different parties find credible''.
:-- This works, because everything we think we know is coded in systems of connections between neurons in our brains. These systems are more unique than fingerprints and evolve over time. The words we use do not mean the same to two different humans nor even to the same human at different points in time. In many cases these differences are inconsequential. ''Sometimes they are fatal.''&lt;ref&gt;Graves and Bailey (2026).&lt;/ref&gt;
:-- ''[[w:Social constructionism|Show me someone who knows the truth]], and I will show you someone who is dangerous'' -- especially during war or any other situation where humans may be moved to violence mandated by their belief system.&lt;ref&gt;[[w:Collateral damage|Collateral damage]] that &quot;they&quot; commit proves to &quot;us&quot; that &quot;they&quot; are subhuman or at best criminally misled and must be resisted by any means necessary. By contrast, collateral damage that &quot;we&quot; commit is unfortunate but necessary.&lt;/ref&gt;
* The major media everywhere have [[w:Conflict of interest|conflicts of interest ]] in honestly reporting on [[v:Information is a public good per communications prof Pickard|anything that might offend anyone who controls large portions of the money for the media]].&lt;ref&gt;Pickard and Graves (2025), accessed 2026-02-08; Pickard (2020).&lt;/ref&gt; [[v:Media Reform Coalition challenges anti-democratic media bias in the UK|British journalist and media reform advocate Dan Hind]] said that the content produced by the [[w:BBC|BBC]] was frivolous, soap opera stuff, because leading media personalities know very little about issues of substance and believe &quot;they might get in trouble if&quot; they produced anything serious. Similar analyses seem to apply to the major media everywhere&lt;ref&gt;Hind and Graves (2025), accessed 2026-02-09.&lt;/ref&gt; but may not apply to non-profit and local media, which seem more likely to produce [[w:Investigative journalism|investigative]] / [[v:Dean Starkman and the watchdog that didn't bark|accountability journalism]]:&lt;ref&gt;Usher and Kim-Leffingwell (2022); see also Starkman and Graves (2025), accessed 2026-02-09.&lt;/ref&gt; [[w:Watchdog journalism|Watchdogs]] tend to protect the people who feed them. Argentine journalist [[w:Horacio Verbitsky|Horacio Verbitsky]] said, &quot;Journalism is disseminating information that someone does not want known; the rest is [[w:propaganda|propaganda]].&quot;&lt;ref&gt;p. 16 in Verbitsky (1997); English translation from [[Wikiquote:Horacio Verbitsky]], accessed 2026-02-09.&lt;/ref&gt;
* The major media everywhere create the stage upon which politicians read their lines. 
:- Their selection of acceptable topics for news and entertainment create and maintain the &quot;[[w:Overton window|Overton window]]&quot;, which is the range of acceptable political discourse. For example, in early 1964, US President [[w:Lyndon B. Johnson|Lyndon Johnson]] understood that he could lose the 1964 presidential election that year if he were seen to be soft on communism. His response was to clandestinely provoke an attack on US naval vessels in the Gulf of Tonkin, which he could then denounce as &quot;unprovoked&quot;. During a dark and stormy night 1964-08-04 the [[w:USS Maddox (DD-731)|USS ''Maddox'']] and [[w:USS Turner Joy|''Turner Joy'']] spent a couple of hours &quot;defending themselves&quot; against radar snow, then [[w:Gulf of Tonkin incident|reported that they had sunk two attacking North Vietnamese torpedo boats]]; subsequent investigations found no evidence of the reported attacks. That incident was used to justify the [[w:Gulf of Tonkin Resolution|Gulf of Tonkin Resolution]], with only two dissenting votes in the US Congress: Those two dissenters were defeated in their next reelection campaigns, illustrating the point that the major media create the environment in which many politicians cannot get elected without betraying the nation. 

=== The value of noncommercial news outlets ===

Some of the problems with the media and their contributions to increasing political polarization and violence are documented in the research summary on &quot;[[Information is a public good: Designing experiments to improve government]]&quot; and in the podcast series available on Wikiversity under &quot;[[:Category:Media reform to improve democracy]]&quot; with leading experts discussing their recommendations. One of the most compelling of the references discussed in that podcast series is Usher and Kim-Leffingwell (2022), who tallied all the federal prosecutions for political corruption in each of the 94 [[w:United States federal judicial district|US federal court district]]s between 2003 and 2019. During that period, the number of journalists in the US fell by a factor of roughly 3 -- between 60 and 70 percent. They found no statistically significant impact on federal prosecutions for political corruption of that decline in the number of journalists. 

However, each member of the [[w:Institute for Nonprofit News|Institute for Nonprofit News]] (INN) in a federal court district in one year was associated with on average 1.4 additional prosecutions for political corruption the following year. 

This suggests that the major media outlets that had so dramatically reduced their staffs had not substantively reduced the amount of investigative journalism they did. If we assume that the people prosecuted for political corruption also control substantive advertising budgets, then the major media outlets have conflicts of interest in honestly reporting on such. They may report on it if some other organization like a member of INN does the research and they are threatened with a loss of audience from not reporting on it. 

:'''''Major point''''': You and I benefit, the vast majority of humans on earth benefit, from news reports presumably published by members if INN that contributed to those on average 1.4 additional prosecutions for political corruption estimated by Usher and Kim-Leffingwell (2022). We benefit even if we never heard about the news reports that contributed to those prosecutions. We benefit even if we have never heard of the news outlets that presumably did the investigative journalism behind those additional prosecutions. Why? Because on average those news reports likely deterred other incidents of political corruption, which likely contributed to broadly shared economic growth and the development of new technology that ultimately benefit the vast majority of humanity. Other aspects of this are documented in the research on the impact of [[w:news desert|news desert]]s, which we summarize next.  

=== Costs increase in news deserts===

There's a growing body of research describing what happens when local newspapers die. 

Perhaps most important, a 2018 research report by Gao et al. reported that the death of a local newspaper was followed by … increases in local tax revenue, averaging $85 per human per year.&lt;ref name = Gao2018&gt;Gao et al. (2018).&lt;/ref&gt; That $85 was roughly 13 hundredths of a percent of the 2019 US GDP. That's mentioned in the 2025-07-17 interview with [[Democratic delusions: Fix the media to fix democracy|Natalie Fenton about her new book, ''Democratic Delusions, How the Media Hollows out democracy and What We Can Do About It'']].

One of the most spectacular example of the cost of a news desert is the [[w:City of Bell scandal|Scandal of Bell, California]]. Their local newspaper died around 1999. Roughly a decade later the city was nearly bankrupt in spite of having property tax rates among the highest in the nation. An investigation by the ''[[w:Los Angeles Times|Los Angeles Times]]'' documented that the city manager had a compensation package worth $1.5 million a year, well over double that of the President of the United States. Other senior city officials were similarly well-remunerated. Some of the city officials went to jail over that. Did the city manager decide after 1999, &quot;Wow: The watchdog is dead. Let's have a party&quot;? 

Malfeasance also increases in business as pollution and workplace accidents increase as does the cost of capital, because investors know their money is not as secure without a local newspaper. That leads to a reduction in investments in new products, services and processes -- slowing economic growth. See &quot;[[Local newspapers limit malfeasance]]&quot;, esp. Kim et al. (2021). 

And executive compensation in increases in nonprofits, so less of what people donate goes to the charitable purpose for which they donated, according to Felix et al. (2024). Also, voter participation and split-ticket voting decline, per Benton (2019) and other references discussed in &quot;[[Information is a public good: Designing experiments to improve government]]&quot;. And the ultra-right does better, as noted in [[News from Germany 1900-1945 and implications for today]] and the section on &quot;[[Information is a public good: Designing experiments to improve government#Previous research|Previous research]]&quot; in the Wikiversity article on &quot;[[Information is a public good: Designing experiments to improve government]]&quot;.&lt;ref&gt;Flößer (2024).&lt;/ref&gt; 

The 0.13 percent of GDP savings estimated by Gao et al. (2018) is roughly $120 per human per year. With over 300 million humans in the U.S, that is roughly $40 billion nationwide. 

{| class=&quot;wikitable&quot;
|+ Table 1. Costs increase in news deserts
|- 
! Entity !! What !!Source
|-
| local government || costs incr. 0.13% of GDP || Gao et al. (2018)
|- 
| local businesses || pollution &amp; workplace accidents incr., innovation &amp; econ growth decr. || Kim et al. (2021)
|- 
| nonprofits || exec. compensation incr. || Felix et al. (2024) 
|- 
| rowspan=2 | elections
| voter participation &amp; split-ticket voting decl. || Benton (2019)
|-
| Ultra-right does better || Flößer (2024)
|}

=== Government subsidies === 

John (1995) documented how in the first half of the nineteenth century the US had more independent newspaper publishers per million population than at any other time or place in human history.&lt;ref&gt;This is discussed in the 2025-06-08 [[Media concentration per Columbia History Professor Richard John|interview with him]], available on Wikiversity under [[:Category:Media reform to improve democracy]], accessed 2026-04-30.&lt;/ref&gt; This encouraged literacy and limited political corruption, both of which helped [[The Great American Paradox|the early United States stay together and grow]]  while contemporary [[w:New Spain|New Spain]] / [[w:Mexico|Mexico]], fractured, shrank, and stagnated economically. As documented with Figure 1 in the chapter below on [[/The impact of the media on political economy since the time of the Pharaohs/]], that growth catapulted the young United States into its current position of dominance in the international political economy, a position it has been losing since at least 1990 -- or since the Reagan Revolution began in 1981, according to the analysis in the chapter below on [[/Fox, the Great Depression, the Great Recession, and our future/]]. Other countries now have stronger democracies due in part to government subsidies for media in the range of 0.05 and 0.25 percent of GDP with a firewall that limits political interference in the content, according to Neff and Pickard (2024). Table 1 in &quot;[[Information is a public good: Designing experiments to improve government]] compares media subsidies in various places with &quot;other points of reference&quot;.  

McChesney and Nichols (2010, pp. 310-311, note 88) suggested that the relatively high rate of economic growth of the economy in the early US was due in part to postal subsidies under the US [[w:Postal Service Act|Postal Service Act]] of 1792.&lt;ref&gt;See also the Wikiversity article on &quot;[[The Great American Paradox]]&quot;, accessed 2026-04-30.&lt;/ref&gt; They estimated those subsidies at 0.21 percent of GDP. To improve the current political economy of the US, they recommended subsidies of 0.15 percent of GDP distributed to local news nonprofits on the basis of local elections.&lt;ref&gt;McChesney and Nichols (2021, 2022).&lt;/ref&gt; The Wikipedia article on &quot;[[Information is a public good: Designing experiments to improve government]]&quot; documents how some jurisdictions can devote that much money to local news nonprofits by matching what they spend on accounting, advertising, and public relations.&lt;ref&gt;See the section on &quot;[[Information is a public good: Designing experiments to improve government#Sampling units / experimental polities|Sampling units / experimental polities]]&quot; in the Wikiversity article on &quot;[[Information is a public good: Designing experiments to improve government]]&quot;, accessed 2026-04-30.&lt;/ref&gt;  

Pickard (2023) describes three basic strategies for confronting concentrated commercial media power: (1) break them up, (2) regulate them, and (3) create non-commercial, public alternatives. A fourth possibility might be [[w:externality|a graduated tax on income and wealth]] in proportion to the threat that major corporations pose to democracy. 

One class of noncommercial alternatives that Packard mentions is local multi-media / Public Media Centers (PMCs) with management split between local journalists and boards, e.g., selected at random from registered voters. A key here is to have the boards selected in a way that cannot be influenced by people with power, whether business or political elites. Picard recommends considering '''six discrete layers''' when discussing PMCs, each of which, he says, must be radically democratised: 
# funding, 
# governance, 
# ascertainment (to determine a community’s ''critical information needs''), 
# infrastructure (including universal broadband service), 
# algorithmic (e.g., not allowing companies like Google and Facebook to suppress indexing information the might challenge their hegemony of those markets, [[w:Deep web|treating them like pedophilia and the Islamic State]]), 
# engagement, involving local communities in making their own news and in communicating their own stories; this is paramount to building trust and the grassroots-level support that this new local journalistic model requires.

All this needs to be managed in ways that provide substantive support to news deserts and underserved communities that have long been subjected to various kinds of informational redlining. This might be done by including the proposed PMCs within local libraries staffed by professional journalists, who provide training in media literacy in local schools for children and supervise students producing school newspapers. 

Management of such PMCs might be split between journalists on staff and boards of, e.g., six members selected at random from voter registration rolls serving staggered terms of one year with a new member rotated in every 2 months.  

Another alternative that could be done in parallel with local PMCs calls for 200 journalists in each US Congressional district funded at $10 billion annually in 2022 dollars, which is just a little under 4 hundredths of one percent of GDP; if such allocations are expressed as fractions of a percent of GDP, they would grow naturally with the economy. (The nominal GDP for the US was roughly $26.1 trillion in 2022.&lt;ref&gt;Johnston and Williamson (2026).&lt;/ref&gt; For 2026 it is estimated at $32.4 trillion.&lt;ref&gt;[[w:United States|United States]], accessed 2026-04-30.&lt;/ref&gt;) 

A similar model is the [[w:BBC|BBC]]’s Local Democracy Reporting Service (LDRS), in which the BBC funds journalists to cover the work of local councils and other local public bodies, funded at £8 million per year, which is a little under 2 hundredths of a percent of the [[w:United Kingdom|UK]]'s GDP of £7.27 trillion.&lt;ref&gt;[[w:United Kingdom|United Kingdom]], accessed 2026-04-30.&lt;/ref&gt; 

Pickard (2023) ended by saying, &quot;Today we face a crossroads: technocracy and oligarchy from above or radical democracy and structural reform from below. ... [T]his is not just a journalism crisis: it is a
democracy crisis.&quot;

==[proposed] Table of Contents==
*[[/Introduction/]] including an exercise, asking all to discuss perceptions of the settlement of ''[[w:Dominion Voting Systems v. Fox News Network|Dominion Voting Systems v. Fox News Network]]'' in a friendly supportive manner with humans with whom they may vehemently disagree, because the alternative could be killing humans over misunderstandings. 

===Part I. The media and political economy===
# [[/The impact of the media on political economy since the time of the Pharaohs/]] describes how hierarchical societies prior to [[w:James VI and I|King James of the King James bible]] were divided between those who fought, prayed, and worked. It was the responsibility of those who prayed to convince those who worked to live in poverty while giving increasing shares of what they produced so those who fought and prayed could live lives of leisure and opulence. During the reign of King James, pamphlets and newspapers began to compete with the church for helping commoners understand their roles in society. This produced the Industrial Revolution and modern democracies. Media consolidation since World War II gradually slowed and then reversed this trend. 
# [[/Fox, the Great Depression, the Great Recession, and our future/]] describes the unprecedented performance of the US political economy during the presidency of Franklin Roosevelt (FDR), insisting that much of what FDR achieved can be replicated, giving a media system that supports honest discussion of the available evidence. 
# [[/Media consolidation, social media, and political polarization/]] (Combine from McChesney and Nichols discussing the [[w:Postal Service Act|US Postal Service Act]] of 1792 with [[Media concentration per Columbia History Professor Richard John]], the section on &quot;[[v:Information is a public good: Designing experiments to improve government#Threats from social media|Threats from social media]]&quot; in &quot;[[Information is a public good: Designing experiments to improve government]], and the comments by [[v:Facebook whistleblower Frances Haugen says|Facebook whistleblower Frances Haugen that, &quot;the shortest path to a click is anger or hate.&quot;]].

===Part II. The media and war===
# [[/Deterrence without threat/]] (Draft in [https://peaceworkskc.org/deterrence-without-threat/ &quot;Deterrence without threat&quot; on the website of PeaceWorks Kansas City], noting that the historical record is clear: Nations that have prepared for war often got war, not peace. This happens for at least two reasons: First, some leaders cannot resist the temptation to use force inappropriately, sometimes clandestinely provoking others to do things that are then denounced as &quot;unprovoked&quot;. Alternatively, potential adversaries may believe -- or claim -- that you are actually preparing a first strike, and they must move preemptively or lose their ability to retaliate adequately. We can avoid these possibilities with three supportive policies: [a] Legislation that ''prohibits'' projecting force beyond our own borders. [b] Civilian-based defense training in nonviolent noncooperation like what helped Denmark survive Nazi occupation with minimal damage. And [c] A media system that makes it harder for the people who control most of the money for the media to create an environment that makes it hard for common folk to understand, &quot;Why they hate us&quot;, and that encourages leaders to be more bellicose than would best support broadly shared peace and prosperity. It is naive to assume that (i) military command, control and communications systems never malfunction, (ii) potential adversaries will behave as we expect, and (iii) no one wants to initiate Armageddon. Supporters of the current US system claim that (i) is virtually foolproof, though [[w:Daniel Ellsberg|Daniel Ellsberg]], who was a nuclear war planner prior to releasing the Pentagon Papers, disagrees; see [[w:Gold Codes|Gold Codes]]. The other two assumptions are demonstrably false. Under current practice, major media can defame poor folk and foreigners with impunity. Major wars like the US-led invasions of Iraq in 2003, Afghanistan in 2001, and Vietnam decades earlier might have played out very differently if individual foreigners and foreign governments had successfully sued the major US media, especially the [[w:Big Three (American television)|Big three US television networks]], [[w:NBC|NBC]], [[w:CBS|CBS]], and [[w:American Broadcasting Company|ABC]], for defamation following the principle in ''[[w:New York Times Co. v. Sullivan|New York Times Co. v. Sullivan]]''.) Another policy for parties to the [[w:Treaty on the Prohibition of Nuclear Weapons|Treaty on the Prohibition of Nuclear Weapons]] (TPNW) would be to institute gradually increasing tariffs on trade with nuclear-weapon states. Free trade agreements supported by the [[w:World Trade Organization|World Trade Organization]] allow exemptions for national security and other objectives. Even a minor nuclear war between India and Pakistan would have a negative impact on the entirety of humanity. It therefore seems sensible for parties to the TPNW to institute gradually increasing tariffs on nuclear weapon states, not so great as to seriously impact the economies of parties to the TPNW but aggressive enough to gradually wean their economy from reliance on trace with nuclear-weapon states. Regarding [a], [https://www.rsn.org/001/inside-the-ukrainian-interceptor-drones-wanted-around-the-gulf.html?ref=messenger.rsn.org see &quot;Inside the Ukrainian Interceptor Drones Wanted Around the Gulf&quot; Dan Peleschuk / Reuters, 2026-03-18] and [https://www.rsn.org/001/building-tanks-while-the-ukrainians-master-drones.html?ref=messenger.rsn.org &quot;Building Tanks While the Ukrainians Master Drones&quot;, Simon Shuster / The Atlantic, 2026-03-18.]. Regarding [b], [https://www.zinnedproject.org/news/tdih/bree-newsome-removes-confederate-flag/?emci=45687920-ee1c-f111-9a48-000d3a14b640&amp;emdi=3b97ae4e-de25-f111-9a48-000d3a14b640&amp;ceid=19269752 On June 27, 2015, while politicians debated the implications of taking down the Confederate flag after the white supremacist murder of nine African Americans at Emmanuel AME Church] and several arson fires on Black churches in the South that followed, 30-year-old Ms. [[w:Bree Newsome|Bree Newsome]] scaled the South Carolina state flag pole and took the flag down. [[w:Bree Newsome#2015|twelve days later, the SC House of Reps]] voted to discontinue the use of the Confederate flag, and it was removed the next day.
# [[/Responding to a nuclear attack/]] (draft in [[Responding to a nuclear attack]]. Add a discussion of Russia's Poseidon nuclear powered unmanned underwater vehicle, armed with nuclear weapons. With that, cite the record of &quot;[[w:System accident|system accident]]s&quot;. Also add material from [[Nuclear weapons and effective defense]]). 
# [[/Threats from excessive government secrecy/]] (draft in [https://sanjosepeace.org/restrict-secrecy-more-than-data-collection/ &quot;Restrict secrecy more than data collection&quot;], adding material from [https://kkfi.org/program-episodes/does-us-government-secrecy-threaten-national-security/ Connelly (2023) ''The Declassification Engine: What History Reveals About America's Top Secrets''], [[Wikipedia:Moynihan Commission on Government Secrecy]] and [[1998 Embassy bombings and September 11]].

===Part III. Climate, immigrants, education, public health, and criminal justice===
# [[/Global warming/]] [Summarize research especially on conflicts of interest of major media in honestly reporting on this issue and the research on global warming itself and activities of groups concerned about this issue. Decompose into global population times CO2 equivalents per human.] 
# [[/Immigrants/]] [Summarize research documenting that [[w:Sanctuary city|sanctuary cities tend to have higher median incomes and no more crime than non-sanctuary jurisdictions]], and some studies report less crime. Moreover economists have documented that immigrants tend to be more entrepreneurial, overrepresented in patent applications, and generally increasing the rate of economic growth. See, e.g., Aghion et al. (2022) ''The power of creative destruction''; Aghion shared the 2025 Nobel Memorial Prize in Economics with two others.] 
# [[/Education/]] (draft in [[Invest in children]].) 
# [[/Public health/]] [Draft in [[UN public health data]] to be revised to be consistent with Bezruchka (2023, 2025).]
# [[/Criminal justice/]] (The section on &quot;[[w:United States incarceration rate#Editorial policies of major media|Editorial policies of major media]]&quot; in &quot;[[Wikipedia:United States incarceration rate]]&quot; cites research claiming that within the range range of experience in the US political economy since 1925, the incarceration rate is uncorrelated with crime: It's a function of the public's perception of crime, and that's a function of the media.)
# [[/Substance abuse and addictive behavior/]] (Research in cited in &quot;[[Wikipedia:War on drugs]]&quot; insists that the US and the world would have fewer problems with substance abuse and addiction problems with 100 percent public funding for treatment programs and complete decriminalization of possession and use of retail quantities of addictive substances. We would also likely have fewer problems with immigrants, as that would make it harder for the US to intervene in the internal affairs of fohttps://en.wikiversity.org/wiki/Wikiversity:FAQ/Editing/Edit_summaryreign countries funded off the books, as exposed in the [[w:Iran–Contra affair|Iran–Contra affair]].)
# [[/Empower women and girls/]] [Cite research claiming that a primary restraint on population growth is empowering women and girls. Empowering women and girls is not just a matter of equity: It is also a means to reduce the threats of global warming, of increasing exposure to animal diseases and other problems that come with unrestrained population growth.]

=== Continuation ===

* [[/The evolving media literacy movement/]] to invite others to keep this book current with the evolving understanding of media literacy, how to encourage and promote it and the benefits of doing so.

==See also==

* [[Wikibooks:Antiracist Activism for Teachers and Students/Points to Consider for Teaching Anti-racism/Media Literacy In Schools]]

==Notes==
{{reflist}}
	
==Bibliography==

* &lt;!--Perry Bacon Jr. (2022-10-17) &quot;America Should Spend Billions to Revive Local News&quot;--&gt;{{cite Q|Q139594786}}
* &lt;!-- Joshua Benton (9 April 2019). &quot;When local newspapers shrink, fewer people bother to run for mayor&quot;. Nieman Foundation for Journalism --&gt;{{cite Q|Q63127216}}
* &lt;!--Stephen Bezruchka (2023) Inequality Kills Us All--&gt;{{cite Q|Q136047815}}
* &lt;!--Stephen Bezruchka (2025) ''Born Sick in the USA''--&gt;{{cite Q|Q138749292}} 
* &lt;!--Robert Felix, Joshua A. Khavis, and Mikhail Pevzner (2024) &quot;The effects of local newspaper closures on nonprofits’ executive compensation&quot;--&gt;{{cite Q|Q132730972}}
* &lt;!--Maxim Flößer (2024-03-06) &quot;Keine Lokalzeitung -- mehr AfD&quot;, Kontext--&gt;{{cite Q|Q125287792}}
* &lt;!--Pengjie Gao, Chang Lee, and Dermot Murphy (2018) &quot;Financing Dies in Darkness? The Impact of Newspaper Closures on Public Finance&quot;--&gt;{{cite Q|Q55670016}}
* &lt;!--Spencer Graves (2024) &quot;Wikipedia: The most democratic force on earth--&gt;{{cite Q|Q137796922}}
* &lt;!--Spencer Graves and Bryan Bailey (2025)  &quot;We have to talk&quot;, blog at PeaceWorksKC.org--&gt;{{cite Q|Q136126262}}
* [[d:Q138038060|Dan Hind and Spencer Graves (2025) &quot;Media Reform Coalition challenges anti-democratic media bias in the UK&quot; on Wikiversity]].
* &lt;!--Richard R. John (1995) Spreading the News: The American Postal System from Franklin to Morse--&gt;{{cite Q|Q54641943}}
* &lt;!--Louis Johnston and Samuel H. Williamson, &quot;What Was the U.S. GDP Then?&quot; MeasuringWorth, 2026--&gt;{{cite Q|Q56881105}}
* &lt;!-- Min Kim, Derrald Stice, Han Stice, and Roger M. White (2021)  &quot;Stop the presses! Or wait, we might need them: Firm responses to local newspaper closures and layoffs&quot;--&gt;{{cite Q|Q132459373}}
* &lt;!-- Robert W. McChesney; John Nichols (2010). The Death and Life of American Journalism (Bold Type Books) --&gt;{{cite Q|Q104888067}}.
* &lt;!-- Robert W. McChesney; John Nichols (2021). &quot;The Local Journalism Initiative: a proposal to protect and extend democracy&quot;. Columbia Journalism Review, 30 November 2021 --&gt;{{cite Q|Q109978060}}
* &lt;!-- Robert W. McChesney; John Nichols (2022), To Protect and Extend Democracy, Recreate Local News Media (PDF), FreePress.net (updated 25 January 2022) --&gt;{{cite Q|Q109978337|access-date=2024-06-23}}
* &lt;!-- Victor Pickard (2023-05-12) &quot;Another Media System is Possible: Ripping Open the Overton Window, from Platforms to Public Broadcasting&quot;--&gt;{{cite Q|Q131398460}}
* &lt;!--Neff and Pickard (2024) &quot;Funding Democracy: Public Media and Democratic Health in 33 Countries&quot;--&gt;{{cite Q|Q131468289}}
* [[d:Q131398359|Victor Pickard (2020) ''Democracy without journalism? : confronting the misinformation society'' (Oxford U. Pr.)]].
* [[d:Q138037937|Dean Starkman and Spencer Graves (2025) &quot;Dean Starkman and the watchdog that didn't bark anglais&quot; on Wikiversity]].
* [[d:Q134715465|Nikki Usher and Sanghoon Kim-Leffingwell (2022) &quot;How Loud Does the Watchdog Bark? A Reconsideration of Local Journalism, News Non-profits, and Political Corruption&quot;, ''SSRN Electronic Journal'']].
* [[d:Q61013892|Horacio Verbitsky (1997) ''Un mundo sin periodistas'' (in Spanish: A world without journalists; Editorial Sudamericana)]].

[[Category:Communication]]
[[Category:Political science]]
[[Category:Law]]
[[Category:Psychology]]
[[Category:Sociology]]
[[Category:Education]]
[[Category:Economics]]
[[Category:Media Literacy and You]]
[[Category:Freedom and abundance]]
&lt;!--
https://en.wikiversity.org/wiki/Category_Review
--&gt;</text>
      <sha1>pxde1vpnac5k4fpukwqd9jyib3r908a</sha1>
    </revision>
    <revision>
      <id>2809808</id>
      <parentid>2809771</parentid>
      <timestamp>2026-05-17T01:49:46Z</timestamp>
      <contributor>
        <username>DavidMCEddy</username>
        <id>218607</id>
      </contributor>
      <comment>4 lvls of melit</comment>
      <origin>2809808</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="36845" sha1="87w83szst3pa8x7zki51eix2fb5qchx" xml:space="preserve">[[File:Pharoah - James VI and I - Trump.png|thumb|Religious and media leaders from the time of the Pharaohs convinced common folk to give increasing shares of what they produced to elites.]]
:''This book uses dates in [[:w:ISO 8601|ISO 8601]], YYYY-MM-DD, when convenient.'' 

== Invitation to edit this book ==

You, dear reader, are invited to contribute questions, ideas and citations to support or refute claims made in this book possibly adding chapters. Wikiversity like other Wikimedia Foundation Projects invites humans to [[w:Wikipedia:Be bold|“be bold but not reckless,”]] while writing from a [[Wikiversity:Disclosures|neutral point of view]], [[Wikiversity:Cite sources|citing credible sources]]. Others are invited to change or revert what you wrote. What stays tends to be written from a neutral point of view citing credible sources. If someone reverts your edit or you have a question, take it to the ''[[Wikiversity:FAQ|''''“Discuss”'''' page]]'' associated with the specific Wikiversity page most related to your concerns. 

Those who teach media literacy are encouraged to invite their students to debate and revise the contents of this book. Doing so would build on a tradition of [[:w:Wikipedia:Student assignments|instructors requiring students to edit wikipedia article(s).]]  Editing [[:w:Wikipedia|Wikipedia]] and other [[:w:Wikimedia Foundation|Wikimedia Foundation]] projects like this book is itself an exercise in media literacy: 

:''Central tenets of media literacy might include writing from a neutral point of view citing credible sources and engaging others, some of whom may disagree, in civil, supportive conversations about what can and cannot be said based on a reasonable evaluation of the available evidence. Wikimedia rules invite contributors to do just that, encouraging them to “be bold but not reckless,” contributing revisions written from a neutral point of view, citing credible sources -- and raising other questions and concerns on the ''''“Discuss”'''' page associated with the specific Wikiversity page most related to your concerns, as mentioned above.''&lt;ref&gt;For more on this, see Graves (2024).&lt;/ref&gt; 
== Text and self-help book and point of discuss ==

This book is intended both as a text and self-help book and as a point of discussion considering four levels of media literacy: 

:1. '''Think before you share''': [[Facebook whistleblower Frances Haugen says|Facebook whistleblower Frances Haugen said]], &quot;The shortest path to a click is anger or hate.&quot; The social psychology behind this phenomenon exploited also by legacy media has contributed to [[Media Literacy and You/Media consolidation, social media, and political polarization|the dramatic increase in political polarization and violence worldwide]], especially since the end of the [[w:Fairness doctrine|Fairness doctrine]] in 1987. To counter this, DiResta (2024, p. 335) recommends, &quot;Think before you share.&quot;
:2. '''Disconfirmation bias''': [[w:Information is a public good: Designing experiments to improve government#Previous research|Virtually everyone]] (a) thinks they know more than they do ([[w:Overconfidence effect|overconfidence effect]]), and (b) prefers information and sources consistent with preconceptions ([[w:Confirmation bias|confirmation bias]]). The major media everywhere exploit this to please those who control most of the money for the media. Humans can counter this by searching for sources to help us understand our designated enemies. If we cannot explain circumstances under which we could see ourselves doing what we see our designated enemies doing, we haven't looked hard enough. 
:3. '''Talk''': Push ourselves to have friendly supportive conversations with others with whom we may vehemently disagree with the goals of agreeing to disagree agreeably and building collaboration on areas of common concern. 
:4. '''Teach''': Humans who develop skills in the first three levels can leverage that knowledge in helping others acquire those skills. If each one teaches two&lt;ref&gt;&quot;[[:w:Each one teach one|Each one teach one]]&quot; is an African-American proverb from the time of legalized slavery. However, if each one teaches only one, the growth in literacy will only be linear. Having &quot;each one teaching two&quot;, on average, unleashes the power of doubling and [[:w:exponential growth|exponential growth]], which has the potential of educating the entirety of humanity in a reasonable period of time -- namely after 33 doublings starting from one.&lt;/ref&gt; in a certain period of time, that time period becomes a [[:w:Doubling time|doubling time]]. Ten doublings is a thousand -- actually 1,024 to be precise.&lt;ref&gt;2 time 2 = 4 times 2 = 8 times 2 = 16 times 2 = 32 times 2 = 64 times 2 = 128 times 2 = 256 times 2 = 512 times 2 = 1024: That's 10 doublings, as anyone with a modest understanding of modern digital [[:w:computer|computer]]s will tell you.&lt;/ref&gt; Twenty doublings become a million. Thirty doublings become a billion. Three more doublings become 8 billion, the [[:w:World population|world population]] as of approximately 2022-11-15.&lt;ref&gt;This book uses dates in [[:w:ISO 8601|ISO 8601]], YYYY-MM-DD, when convenient.&lt;/ref&gt; Many organizations, including several United Nations agencies, already have active [[w:media literacy|media literacy]] programs that have already trained many.&lt;ref&gt;''[[Wikibooks:Antiracist Activism for Teachers and Students]]'' includes a chapter on [[Wikibooks:Antiracist Activism for Teachers and Students/Points to Consider for Teaching Anti-racism/Media Literacy In Schools|Media Literacy In Schools]].&lt;/ref&gt; This book is being written hoping to increase the effectiveness and accelerate the rate of growth in media literacy and thereby accelerate progress against many of the most pressing issues facing humanity today.

Much of this book is a [[w:Monograph|research monograph]] summarizing research that seems to have been underreported by the major media to avoid offending people who control most of the money for the media. These research results seem to be central to major political divisions. Each chapter ends in exercises to help the reader practice media literacy skills and have fun doing it. Remember: 

:''I am entitled to my [[Wiktionary:cockamamie|cockamamie]] ideas, and you are entitled to yours.''

Humor is important but must be offered in a way that does not offend others. If others are offended, they may be less interested in dialogue. The term &quot;cockamamie&quot; is used here, hoping that this style of [[w:Self-deprecation|self-deprecation]] might be more inviting for dialogue.

''Never say, &quot;You're wrong, and I'm right!&quot; instead, ask, &quot;May I offer a contrary perspective?&quot; Or &quot;May I share with you another view that I've heard?&quot; ''

Much of the information in this book seems to have been largely overlooked and perhaps suppressed, apparently because it would increase the cost of producing news, some of which would clearly offend people who control much of the money for the media; see the brief discussion of conflicts of interest by the major media in the next &quot;Key claims&quot; section.

==Key claims==

* ''Primary drivers of every major conflict include differences between the media that the different parties find credible''.
:-- This works, because everything we think we know is coded in systems of connections between neurons in our brains. These systems are more unique than fingerprints and evolve over time. The words we use do not mean the same to two different humans nor even to the same human at different points in time. In many cases these differences are inconsequential. ''Sometimes they are fatal.''&lt;ref&gt;Graves and Bailey (2026).&lt;/ref&gt;
:-- ''[[w:Social constructionism|Show me someone who knows the truth]], and I will show you someone who is dangerous'' -- especially during war or any other situation where humans may be moved to violence mandated by their belief system.&lt;ref&gt;[[w:Collateral damage|Collateral damage]] that &quot;they&quot; commit proves to &quot;us&quot; that &quot;they&quot; are subhuman or at best criminally misled and must be resisted by any means necessary. By contrast, collateral damage that &quot;we&quot; commit is unfortunate but necessary.&lt;/ref&gt;
* The major media everywhere have [[w:Conflict of interest|conflicts of interest ]] in honestly reporting on [[v:Information is a public good per communications prof Pickard|anything that might offend anyone who controls large portions of the money for the media]].&lt;ref&gt;Pickard and Graves (2025), accessed 2026-02-08; Pickard (2020).&lt;/ref&gt; [[v:Media Reform Coalition challenges anti-democratic media bias in the UK|British journalist and media reform advocate Dan Hind]] said that the content produced by the [[w:BBC|BBC]] was frivolous, soap opera stuff, because leading media personalities know very little about issues of substance and believe &quot;they might get in trouble if&quot; they produced anything serious. Similar analyses seem to apply to the major media everywhere&lt;ref&gt;Hind and Graves (2025), accessed 2026-02-09.&lt;/ref&gt; but may not apply to non-profit and local media, which seem more likely to produce [[w:Investigative journalism|investigative]] / [[v:Dean Starkman and the watchdog that didn't bark|accountability journalism]]:&lt;ref&gt;Usher and Kim-Leffingwell (2022); see also Starkman and Graves (2025), accessed 2026-02-09.&lt;/ref&gt; [[w:Watchdog journalism|Watchdogs]] tend to protect the people who feed them. Argentine journalist [[w:Horacio Verbitsky|Horacio Verbitsky]] said, &quot;Journalism is disseminating information that someone does not want known; the rest is [[w:propaganda|propaganda]].&quot;&lt;ref&gt;p. 16 in Verbitsky (1997); English translation from [[Wikiquote:Horacio Verbitsky]], accessed 2026-02-09.&lt;/ref&gt;
* The major media everywhere create the stage upon which politicians read their lines. 
:- Their selection of acceptable topics for news and entertainment create and maintain the &quot;[[w:Overton window|Overton window]]&quot;, which is the range of acceptable political discourse. For example, in early 1964, US President [[w:Lyndon B. Johnson|Lyndon Johnson]] understood that he could lose the 1964 presidential election that year if he were seen to be soft on communism. His response was to clandestinely provoke an attack on US naval vessels in the Gulf of Tonkin, which he could then denounce as &quot;unprovoked&quot;. During a dark and stormy night 1964-08-04 the [[w:USS Maddox (DD-731)|USS ''Maddox'']] and [[w:USS Turner Joy|''Turner Joy'']] spent a couple of hours &quot;defending themselves&quot; against radar snow, then [[w:Gulf of Tonkin incident|reported that they had sunk two attacking North Vietnamese torpedo boats]]; subsequent investigations found no evidence of the reported attacks. That incident was used to justify the [[w:Gulf of Tonkin Resolution|Gulf of Tonkin Resolution]], with only two dissenting votes in the US Congress: Those two dissenters were defeated in their next reelection campaigns, illustrating the point that the major media create the environment in which many politicians cannot get elected without betraying the nation. 

=== The value of noncommercial news outlets ===

Some of the problems with the media and their contributions to increasing political polarization and violence are documented in the research summary on &quot;[[Information is a public good: Designing experiments to improve government]]&quot; and in the podcast series available on Wikiversity under &quot;[[:Category:Media reform to improve democracy]]&quot; with leading experts discussing their recommendations. One of the most compelling of the references discussed in that podcast series is Usher and Kim-Leffingwell (2022), who tallied all the federal prosecutions for political corruption in each of the 94 [[w:United States federal judicial district|US federal court district]]s between 2003 and 2019. During that period, the number of journalists in the US fell by a factor of roughly 3 -- between 60 and 70 percent. They found no statistically significant impact on federal prosecutions for political corruption of that decline in the number of journalists. 

However, each member of the [[w:Institute for Nonprofit News|Institute for Nonprofit News]] (INN) in a federal court district in one year was associated with on average 1.4 additional prosecutions for political corruption the following year. 

This suggests that the major media outlets that had so dramatically reduced their staffs had not substantively reduced the amount of investigative journalism they did. If we assume that the people prosecuted for political corruption also control substantive advertising budgets, then the major media outlets have conflicts of interest in honestly reporting on such. They may report on it if some other organization like a member of INN does the research and they are threatened with a loss of audience from not reporting on it. 

:'''''Major point''''': You and I benefit, the vast majority of humans on earth benefit, from news reports presumably published by members if INN that contributed to those on average 1.4 additional prosecutions for political corruption estimated by Usher and Kim-Leffingwell (2022). We benefit even if we never heard about the news reports that contributed to those prosecutions. We benefit even if we have never heard of the news outlets that presumably did the investigative journalism behind those additional prosecutions. Why? Because on average those news reports likely deterred other incidents of political corruption, which likely contributed to broadly shared economic growth and the development of new technology that ultimately benefit the vast majority of humanity. Other aspects of this are documented in the research on the impact of [[w:news desert|news desert]]s, which we summarize next.  

=== Costs increase in news deserts===

There's a growing body of research describing what happens when local newspapers die. 

Perhaps most important, a 2018 research report by Gao et al. reported that the death of a local newspaper was followed by … increases in local tax revenue, averaging $85 per human per year.&lt;ref name = Gao2018&gt;Gao et al. (2018).&lt;/ref&gt; That $85 was roughly 13 hundredths of a percent of the 2019 US GDP. That's mentioned in the 2025-07-17 interview with [[Democratic delusions: Fix the media to fix democracy|Natalie Fenton about her new book, ''Democratic Delusions, How the Media Hollows out democracy and What We Can Do About It'']].

One of the most spectacular example of the cost of a news desert is the [[w:City of Bell scandal|Scandal of Bell, California]]. Their local newspaper died around 1999. Roughly a decade later the city was nearly bankrupt in spite of having property tax rates among the highest in the nation. An investigation by the ''[[w:Los Angeles Times|Los Angeles Times]]'' documented that the city manager had a compensation package worth $1.5 million a year, well over double that of the President of the United States. Other senior city officials were similarly well-remunerated. Some of the city officials went to jail over that. Did the city manager decide after 1999, &quot;Wow: The watchdog is dead. Let's have a party&quot;? 

Malfeasance also increases in business as pollution and workplace accidents increase as does the cost of capital, because investors know their money is not as secure without a local newspaper. That leads to a reduction in investments in new products, services and processes -- slowing economic growth. See &quot;[[Local newspapers limit malfeasance]]&quot;, esp. Kim et al. (2021). 

And executive compensation in increases in nonprofits, so less of what people donate goes to the charitable purpose for which they donated, according to Felix et al. (2024). Also, voter participation and split-ticket voting decline, per Benton (2019) and other references discussed in &quot;[[Information is a public good: Designing experiments to improve government]]&quot;. And the ultra-right does better, as noted in [[News from Germany 1900-1945 and implications for today]] and the section on &quot;[[Information is a public good: Designing experiments to improve government#Previous research|Previous research]]&quot; in the Wikiversity article on &quot;[[Information is a public good: Designing experiments to improve government]]&quot;.&lt;ref&gt;Flößer (2024).&lt;/ref&gt; 

The 0.13 percent of GDP savings estimated by Gao et al. (2018) is roughly $120 per human per year. With over 300 million humans in the U.S, that is roughly $40 billion nationwide. 

{| class=&quot;wikitable&quot;
|+ Table 1. Costs increase in news deserts
|- 
! Entity !! What !!Source
|-
| local government || costs incr. 0.13% of GDP || Gao et al. (2018)
|- 
| local businesses || pollution &amp; workplace accidents incr., innovation &amp; econ growth decr. || Kim et al. (2021)
|- 
| nonprofits || exec. compensation incr. || Felix et al. (2024) 
|- 
| rowspan=2 | elections
| voter participation &amp; split-ticket voting decl. || Benton (2019)
|-
| Ultra-right does better || Flößer (2024)
|}

=== Government subsidies === 

John (1995) documented how in the first half of the nineteenth century the US had more independent newspaper publishers per million population than at any other time or place in human history.&lt;ref&gt;This is discussed in the 2025-06-08 [[Media concentration per Columbia History Professor Richard John|interview with him]], available on Wikiversity under [[:Category:Media reform to improve democracy]], accessed 2026-04-30.&lt;/ref&gt; This encouraged literacy and limited political corruption, both of which helped [[The Great American Paradox|the early United States stay together and grow]]  while contemporary [[w:New Spain|New Spain]] / [[w:Mexico|Mexico]], fractured, shrank, and stagnated economically. As documented with Figure 1 in the chapter below on [[/The impact of the media on political economy since the time of the Pharaohs/]], that growth catapulted the young United States into its current position of dominance in the international political economy, a position it has been losing since at least 1990 -- or since the Reagan Revolution began in 1981, according to the analysis in the chapter below on [[/Fox, the Great Depression, the Great Recession, and our future/]]. Other countries now have stronger democracies due in part to government subsidies for media in the range of 0.05 and 0.25 percent of GDP with a firewall that limits political interference in the content, according to Neff and Pickard (2024). Table 1 in &quot;[[Information is a public good: Designing experiments to improve government]] compares media subsidies in various places with &quot;other points of reference&quot;.  

McChesney and Nichols (2010, pp. 310-311, note 88) suggested that the relatively high rate of economic growth of the economy in the early US was due in part to postal subsidies under the US [[w:Postal Service Act|Postal Service Act]] of 1792.&lt;ref&gt;See also the Wikiversity article on &quot;[[The Great American Paradox]]&quot;, accessed 2026-04-30.&lt;/ref&gt; They estimated those subsidies at 0.21 percent of GDP. To improve the current political economy of the US, they recommended subsidies of 0.15 percent of GDP distributed to local news nonprofits on the basis of local elections.&lt;ref&gt;McChesney and Nichols (2021, 2022).&lt;/ref&gt; The Wikipedia article on &quot;[[Information is a public good: Designing experiments to improve government]]&quot; documents how some jurisdictions can devote that much money to local news nonprofits by matching what they spend on accounting, advertising, and public relations.&lt;ref&gt;See the section on &quot;[[Information is a public good: Designing experiments to improve government#Sampling units / experimental polities|Sampling units / experimental polities]]&quot; in the Wikiversity article on &quot;[[Information is a public good: Designing experiments to improve government]]&quot;, accessed 2026-04-30.&lt;/ref&gt;  

Pickard (2023) describes three basic strategies for confronting concentrated commercial media power: (1) break them up, (2) regulate them, and (3) create non-commercial, public alternatives. A fourth possibility might be [[w:externality|a graduated tax on income and wealth]] in proportion to the threat that major corporations pose to democracy. 

One class of noncommercial alternatives that Packard mentions is local multi-media / Public Media Centers (PMCs) with management split between local journalists and boards, e.g., selected at random from registered voters. A key here is to have the boards selected in a way that cannot be influenced by people with power, whether business or political elites. Picard recommends considering '''six discrete layers''' when discussing PMCs, each of which, he says, must be radically democratised: 
# funding, 
# governance, 
# ascertainment (to determine a community’s ''critical information needs''), 
# infrastructure (including universal broadband service), 
# algorithmic (e.g., not allowing companies like Google and Facebook to suppress indexing information the might challenge their hegemony of those markets, [[w:Deep web|treating them like pedophilia and the Islamic State]]), 
# engagement, involving local communities in making their own news and in communicating their own stories; this is paramount to building trust and the grassroots-level support that this new local journalistic model requires.

All this needs to be managed in ways that provide substantive support to news deserts and underserved communities that have long been subjected to various kinds of informational redlining. This might be done by including the proposed PMCs within local libraries staffed by professional journalists, who provide training in media literacy in local schools for children and supervise students producing school newspapers. 

Management of such PMCs might be split between journalists on staff and boards of, e.g., six members selected at random from voter registration rolls serving staggered terms of one year with a new member rotated in every 2 months.  

Another alternative that could be done in parallel with local PMCs calls for 200 journalists in each US Congressional district funded at $10 billion annually in 2022 dollars, which is just a little under 4 hundredths of one percent of GDP; if such allocations are expressed as fractions of a percent of GDP, they would grow naturally with the economy. (The nominal GDP for the US was roughly $26.1 trillion in 2022.&lt;ref&gt;Johnston and Williamson (2026).&lt;/ref&gt; For 2026 it is estimated at $32.4 trillion.&lt;ref&gt;[[w:United States|United States]], accessed 2026-04-30.&lt;/ref&gt;) 

A similar model is the [[w:BBC|BBC]]’s Local Democracy Reporting Service (LDRS), in which the BBC funds journalists to cover the work of local councils and other local public bodies, funded at £8 million per year, which is a little under 2 hundredths of a percent of the [[w:United Kingdom|UK]]'s GDP of £7.27 trillion.&lt;ref&gt;[[w:United Kingdom|United Kingdom]], accessed 2026-04-30.&lt;/ref&gt; 

Pickard (2023) ended by saying, &quot;Today we face a crossroads: technocracy and oligarchy from above or radical democracy and structural reform from below. ... [T]his is not just a journalism crisis: it is a
democracy crisis.&quot;

==[proposed] Table of Contents==
*[[/Introduction/]] including an exercise, asking all to discuss perceptions of the settlement of ''[[w:Dominion Voting Systems v. Fox News Network|Dominion Voting Systems v. Fox News Network]]'' in a friendly supportive manner with humans with whom they may vehemently disagree, because the alternative could be killing humans over misunderstandings. 

===Part I. The media and political economy===
# [[/The impact of the media on political economy since the time of the Pharaohs/]] describes how hierarchical societies prior to [[w:James VI and I|King James of the King James bible]] were divided between those who fought, prayed, and worked. It was the responsibility of those who prayed to convince those who worked to live in poverty while giving increasing shares of what they produced so those who fought and prayed could live lives of leisure and opulence. During the reign of King James, pamphlets and newspapers began to compete with the church for helping commoners understand their roles in society. This produced the Industrial Revolution and modern democracies. Media consolidation since World War II gradually slowed and then reversed this trend. 
# [[/Fox, the Great Depression, the Great Recession, and our future/]] describes the unprecedented performance of the US political economy during the presidency of Franklin Roosevelt (FDR), insisting that much of what FDR achieved can be replicated, giving a media system that supports honest discussion of the available evidence. 
# [[/Media consolidation, social media, and political polarization/]] (Combine from McChesney and Nichols discussing the [[w:Postal Service Act|US Postal Service Act]] of 1792 with [[Media concentration per Columbia History Professor Richard John]], the section on &quot;[[v:Information is a public good: Designing experiments to improve government#Threats from social media|Threats from social media]]&quot; in &quot;[[Information is a public good: Designing experiments to improve government]], and the comments by [[v:Facebook whistleblower Frances Haugen says|Facebook whistleblower Frances Haugen that, &quot;the shortest path to a click is anger or hate.&quot;]].

===Part II. The media and war===
# [[/Deterrence without threat/]] (Draft in [https://peaceworkskc.org/deterrence-without-threat/ &quot;Deterrence without threat&quot; on the website of PeaceWorks Kansas City], noting that the historical record is clear: Nations that have prepared for war often got war, not peace. This happens for at least two reasons: First, some leaders cannot resist the temptation to use force inappropriately, sometimes clandestinely provoking others to do things that are then denounced as &quot;unprovoked&quot;. Alternatively, potential adversaries may believe -- or claim -- that you are actually preparing a first strike, and they must move preemptively or lose their ability to retaliate adequately. We can avoid these possibilities with three supportive policies: [a] Legislation that ''prohibits'' projecting force beyond our own borders. [b] Civilian-based defense training in nonviolent noncooperation like what helped Denmark survive Nazi occupation with minimal damage. And [c] A media system that makes it harder for the people who control most of the money for the media to create an environment that makes it hard for common folk to understand, &quot;Why they hate us&quot;, and that encourages leaders to be more bellicose than would best support broadly shared peace and prosperity. It is naive to assume that (i) military command, control and communications systems never malfunction, (ii) potential adversaries will behave as we expect, and (iii) no one wants to initiate Armageddon. Supporters of the current US system claim that (i) is virtually foolproof, though [[w:Daniel Ellsberg|Daniel Ellsberg]], who was a nuclear war planner prior to releasing the Pentagon Papers, disagrees; see [[w:Gold Codes|Gold Codes]]. The other two assumptions are demonstrably false. Under current practice, major media can defame poor folk and foreigners with impunity. Major wars like the US-led invasions of Iraq in 2003, Afghanistan in 2001, and Vietnam decades earlier might have played out very differently if individual foreigners and foreign governments had successfully sued the major US media, especially the [[w:Big Three (American television)|Big three US television networks]], [[w:NBC|NBC]], [[w:CBS|CBS]], and [[w:American Broadcasting Company|ABC]], for defamation following the principle in ''[[w:New York Times Co. v. Sullivan|New York Times Co. v. Sullivan]]''.) Another policy for parties to the [[w:Treaty on the Prohibition of Nuclear Weapons|Treaty on the Prohibition of Nuclear Weapons]] (TPNW) would be to institute gradually increasing tariffs on trade with nuclear-weapon states. Free trade agreements supported by the [[w:World Trade Organization|World Trade Organization]] allow exemptions for national security and other objectives. Even a minor nuclear war between India and Pakistan would have a negative impact on the entirety of humanity. It therefore seems sensible for parties to the TPNW to institute gradually increasing tariffs on nuclear weapon states, not so great as to seriously impact the economies of parties to the TPNW but aggressive enough to gradually wean their economy from reliance on trace with nuclear-weapon states. Regarding [a], [https://www.rsn.org/001/inside-the-ukrainian-interceptor-drones-wanted-around-the-gulf.html?ref=messenger.rsn.org see &quot;Inside the Ukrainian Interceptor Drones Wanted Around the Gulf&quot; Dan Peleschuk / Reuters, 2026-03-18] and [https://www.rsn.org/001/building-tanks-while-the-ukrainians-master-drones.html?ref=messenger.rsn.org &quot;Building Tanks While the Ukrainians Master Drones&quot;, Simon Shuster / The Atlantic, 2026-03-18.]. Regarding [b], [https://www.zinnedproject.org/news/tdih/bree-newsome-removes-confederate-flag/?emci=45687920-ee1c-f111-9a48-000d3a14b640&amp;emdi=3b97ae4e-de25-f111-9a48-000d3a14b640&amp;ceid=19269752 On June 27, 2015, while politicians debated the implications of taking down the Confederate flag after the white supremacist murder of nine African Americans at Emmanuel AME Church] and several arson fires on Black churches in the South that followed, 30-year-old Ms. [[w:Bree Newsome|Bree Newsome]] scaled the South Carolina state flag pole and took the flag down. [[w:Bree Newsome#2015|twelve days later, the SC House of Reps]] voted to discontinue the use of the Confederate flag, and it was removed the next day.
# [[/Responding to a nuclear attack/]] (draft in [[Responding to a nuclear attack]]. Add a discussion of Russia's Poseidon nuclear powered unmanned underwater vehicle, armed with nuclear weapons. With that, cite the record of &quot;[[w:System accident|system accident]]s&quot;. Also add material from [[Nuclear weapons and effective defense]]). 
# [[/Threats from excessive government secrecy/]] (draft in [https://sanjosepeace.org/restrict-secrecy-more-than-data-collection/ &quot;Restrict secrecy more than data collection&quot;], adding material from [https://kkfi.org/program-episodes/does-us-government-secrecy-threaten-national-security/ Connelly (2023) ''The Declassification Engine: What History Reveals About America's Top Secrets''], [[Wikipedia:Moynihan Commission on Government Secrecy]] and [[1998 Embassy bombings and September 11]].

===Part III. Climate, immigrants, education, public health, and criminal justice===
# [[/Global warming/]] [Summarize research especially on conflicts of interest of major media in honestly reporting on this issue and the research on global warming itself and activities of groups concerned about this issue. Decompose into global population times CO2 equivalents per human.] 
# [[/Immigrants/]] [Summarize research documenting that [[w:Sanctuary city|sanctuary cities tend to have higher median incomes and no more crime than non-sanctuary jurisdictions]], and some studies report less crime. Moreover economists have documented that immigrants tend to be more entrepreneurial, overrepresented in patent applications, and generally increasing the rate of economic growth. See, e.g., Aghion et al. (2022) ''The power of creative destruction''; Aghion shared the 2025 Nobel Memorial Prize in Economics with two others.] 
# [[/Education/]] (draft in [[Invest in children]].) 
# [[/Public health/]] [Draft in [[UN public health data]] to be revised to be consistent with Bezruchka (2023, 2025).]
# [[/Criminal justice/]] (The section on &quot;[[w:United States incarceration rate#Editorial policies of major media|Editorial policies of major media]]&quot; in &quot;[[Wikipedia:United States incarceration rate]]&quot; cites research claiming that within the range range of experience in the US political economy since 1925, the incarceration rate is uncorrelated with crime: It's a function of the public's perception of crime, and that's a function of the media.)
# [[/Substance abuse and addictive behavior/]] (Research in cited in &quot;[[Wikipedia:War on drugs]]&quot; insists that the US and the world would have fewer problems with substance abuse and addiction problems with 100 percent public funding for treatment programs and complete decriminalization of possession and use of retail quantities of addictive substances. We would also likely have fewer problems with immigrants, as that would make it harder for the US to intervene in the internal affairs of fohttps://en.wikiversity.org/wiki/Wikiversity:FAQ/Editing/Edit_summaryreign countries funded off the books, as exposed in the [[w:Iran–Contra affair|Iran–Contra affair]].)
# [[/Empower women and girls/]] [Cite research claiming that a primary restraint on population growth is empowering women and girls. Empowering women and girls is not just a matter of equity: It is also a means to reduce the threats of global warming, of increasing exposure to animal diseases and other problems that come with unrestrained population growth.]

=== Continuation ===

* [[/The evolving media literacy movement/]] to invite others to keep this book current with the evolving understanding of media literacy, how to encourage and promote it and the benefits of doing so.

==See also==

* [[Wikibooks:Antiracist Activism for Teachers and Students/Points to Consider for Teaching Anti-racism/Media Literacy In Schools]]

==Notes==
{{reflist}}
	
==Bibliography==

* &lt;!--Perry Bacon Jr. (2022-10-17) &quot;America Should Spend Billions to Revive Local News&quot;--&gt;{{cite Q|Q139594786}}
* &lt;!-- Joshua Benton (9 April 2019). &quot;When local newspapers shrink, fewer people bother to run for mayor&quot;. Nieman Foundation for Journalism --&gt;{{cite Q|Q63127216}}
* &lt;!--Stephen Bezruchka (2023) Inequality Kills Us All--&gt;{{cite Q|Q136047815}}
* &lt;!--Stephen Bezruchka (2025) ''Born Sick in the USA''--&gt;{{cite Q|Q138749292}} 
* &lt;!--Renée DiResta (2024) Invisible Rulers: The People Who Turn Lies into Reality--&gt;{{cite Q|Q135107164}}
* &lt;!--Robert Felix, Joshua A. Khavis, and Mikhail Pevzner (2024) &quot;The effects of local newspaper closures on nonprofits’ executive compensation&quot;--&gt;{{cite Q|Q132730972}}
* &lt;!--Maxim Flößer (2024-03-06) &quot;Keine Lokalzeitung -- mehr AfD&quot;, Kontext--&gt;{{cite Q|Q125287792}}
* &lt;!--Pengjie Gao, Chang Lee, and Dermot Murphy (2018) &quot;Financing Dies in Darkness? The Impact of Newspaper Closures on Public Finance&quot;--&gt;{{cite Q|Q55670016}}
* &lt;!--Spencer Graves (2024) &quot;Wikipedia: The most democratic force on earth--&gt;{{cite Q|Q137796922}}
* &lt;!--Spencer Graves and Bryan Bailey (2025)  &quot;We have to talk&quot;, blog at PeaceWorksKC.org--&gt;{{cite Q|Q136126262}}
* [[d:Q138038060|Dan Hind and Spencer Graves (2025) &quot;Media Reform Coalition challenges anti-democratic media bias in the UK&quot; on Wikiversity]].
* &lt;!--Richard R. John (1995) Spreading the News: The American Postal System from Franklin to Morse--&gt;{{cite Q|Q54641943}}
* &lt;!--Louis Johnston and Samuel H. Williamson, &quot;What Was the U.S. GDP Then?&quot; MeasuringWorth, 2026--&gt;{{cite Q|Q56881105}}
* &lt;!-- Min Kim, Derrald Stice, Han Stice, and Roger M. White (2021)  &quot;Stop the presses! Or wait, we might need them: Firm responses to local newspaper closures and layoffs&quot;--&gt;{{cite Q|Q132459373}}
* &lt;!-- Robert W. McChesney; John Nichols (2010). The Death and Life of American Journalism (Bold Type Books) --&gt;{{cite Q|Q104888067}}.
* &lt;!-- Robert W. McChesney; John Nichols (2021). &quot;The Local Journalism Initiative: a proposal to protect and extend democracy&quot;. Columbia Journalism Review, 30 November 2021 --&gt;{{cite Q|Q109978060}}
* &lt;!-- Robert W. McChesney; John Nichols (2022), To Protect and Extend Democracy, Recreate Local News Media (PDF), FreePress.net (updated 25 January 2022) --&gt;{{cite Q|Q109978337|access-date=2024-06-23}}
* &lt;!-- Victor Pickard (2023-05-12) &quot;Another Media System is Possible: Ripping Open the Overton Window, from Platforms to Public Broadcasting&quot;--&gt;{{cite Q|Q131398460}}
* &lt;!--Neff and Pickard (2024) &quot;Funding Democracy: Public Media and Democratic Health in 33 Countries&quot;--&gt;{{cite Q|Q131468289}}
* [[d:Q131398359|Victor Pickard (2020) ''Democracy without journalism? : confronting the misinformation society'' (Oxford U. Pr.)]].
* [[d:Q138037937|Dean Starkman and Spencer Graves (2025) &quot;Dean Starkman and the watchdog that didn't bark anglais&quot; on Wikiversity]].
* [[d:Q134715465|Nikki Usher and Sanghoon Kim-Leffingwell (2022) &quot;How Loud Does the Watchdog Bark? A Reconsideration of Local Journalism, News Non-profits, and Political Corruption&quot;, ''SSRN Electronic Journal'']].
* [[d:Q61013892|Horacio Verbitsky (1997) ''Un mundo sin periodistas'' (in Spanish: A world without journalists; Editorial Sudamericana)]].

[[Category:Communication]]
[[Category:Political science]]
[[Category:Law]]
[[Category:Psychology]]
[[Category:Sociology]]
[[Category:Education]]
[[Category:Economics]]
[[Category:Media Literacy and You]]
[[Category:Freedom and abundance]]
&lt;!--
https://en.wikiversity.org/wiki/Category_Review
--&gt;</text>
      <sha1>87w83szst3pa8x7zki51eix2fb5qchx</sha1>
    </revision>
  </page>
  <page>
    <title>Communications Law in Mexico</title>
    <ns>0</ns>
    <id>328211</id>
    <revision>
      <id>2809753</id>
      <parentid>2809633</parentid>
      <timestamp>2026-05-16T21:06:47Z</timestamp>
      <contributor>
        <username>Mendezre</username>
        <id>3076329</id>
      </contributor>
      <comment>/* Child Protection */</comment>
      <origin>2809753</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="51065" sha1="pfvnw6pbdxlz314bdvz2vuxopvgxaq2" xml:space="preserve">= '''[[International Communication Law|Communications Law in Mexico]]''' =
[[File:Mexico location.svg|thumb]]
Mexico is in southern North America and the third-largest country in Latin America. The nation shares a border to the north with the United States and its southern borders with Guatemala and Belize.

Mexico’s legal system has its roots in the Civil Law Tradition due in large part to its ties to Spain. The Mexican legal system also takes inspiration from Roman law, canon law, and medieval commercial law. The current Mexican Constitution is commonly referred to as the 1917 Constitution but more formally known as the Political Constitution of the United Mexican States.

The federal judiciary in Mexico is governed by Articles 94 through 107 of the Constitution and the Organic Law of the Federal Judiciary. The system establishes circuit judges, district judges and the Supreme Court of Justice of the Nation (“SCJN” which contains 11 Justices and 1 Chief Justice).[1] Historical jurisprudence before 1917 has no binding force.[2] Additionally, the legal principle of stare decisis, a common law tradition, is not recognized by the civil law tradition because civil law is created by legal scholars and not by judges.[3]

== '''Primary Sources of Mexican Communications Law''' ==

=== '''National Law''' ===

==== '''Constitutional Law''' ====
The most important place to begin the analysis of communication law in Mexico is the document that governs the land itself, the Constitution. The Mexican Constitution was adopted in 1917 after the Mexican Revolution and reflects the countries commitment to social justice and constitutional democracy. Article 2 of the Constitution creates substantive state duties and communication rights that requite the federal government to protect free information by ensuring that Indigenous communities are able to access media and communication channels. [4] Article 2(B)(II) states that authorities are obligated to: extend the communication infrastructure, enable integration of communities to the rest of the country, by constructing and expanding transportation routes &amp; telecommunications means and support productive activities and sustain development of indigenous communities through actions that allow them to achieve economic self-sufficiency such as the use of new technology to increase productive capacity. [5] Article 6(b)(ii) labels telecommunications as public services of general interest and mandates that the State guarantee “quality, plurality, universal coverage, interconnection, convergence, continuity, free access, and free from arbitrary interferences.[6]

==== '''Statutory Framework''' ====
As the Constitution was adopted in 1917 before the age of the internet and media, statutes regulate telecommunication. Since 2014, Mexican communications law has been governed by the “''Federal Telecommunications and Broadcasting Law”'' which is intended to regulate the use, development, and operation of the radio spectrum, the public telecommunication networks, access to active and passive infrastructure, satellite orbits, public broadcasting, rights of users and audiences and competition processes in these sectors. The Mexican Senate and Chamber of Deputes approved legislation in July of 2025 that replaced the previous legal framework. This 2025 Federal Telecommunications and Broadcasting Law initiated significant institutional regulatory body restructuring in an effort to combat poverty as around 46.8% of the population live in poverty and do not have access to digital infrastructure. [7] The LMTR governs broadcasting, telecommunication services, user and audience rights, infrastructure sharing and interconnection and network access.[8]

=== '''National Regulatory Bodies''' ===
In Mexico, all telecommunication regulations are governed by the Federal Telecommunications and Broadcasting Law, which forms the legal framework for internet services, broadcasting, and telecom infrastructure. These laws are enforced by the Federal Telecommunications Institute who is an independent regulatory agency. The FTI oversees and regulates internet, television, radio and mobile services across Mexico and has the ability to submit policy recommendations.

The Federal Telecommunications Institute (FTI) is the independent regulator for broadcasting and telecommunications and oversees all competition, consumer protection and spectrum use. The FTI was established in 2013 and was tasked with breaking apart monopolies, increasing transparency and ensuring that the regulation remained apolitical. The FTI oversees and regulates internet, television, radio and mobile services across Mexico and has the ability to submit policy recommendations.

The Agency for Digital Transformation and Telecommunications (ATDT) manages private and public telecommunication corporations and projects. The ATDT has the authority to temporarily block digital platforms in non-compliance upon request by the competent authority and established a mobile user database.

The Telecommunications Regulatory Commission (TRC) is a decentralized body within the Agency itself that has operational and technical autonomy. It is comprised of 5 commissioners nominated by the President and ratified by the Senate who will be responsible for granting concessions, authorization and registration certificates. Additionally, the TRC will be manage bidding processes and assignment of frequency bands and orbital resources.

=== '''Regional &amp; International Law Sources of Communication Law:''' ===
These international treaties and agreements influence the structure and coverage of Mexican domestic communication law.

The following are regional trade agreements that influence telecommunication law. The United States-Mexico-Canada (USMCA) Agreement is an agreement between America and Mexico. The U.S. is Mexico’s largest trading partner which incentivizes the need for the USMCA. Chapter 18 Telecommunications includes provisions that restrict dominant telecommunication organizations from blocking international competitors from entering the market (Mexican Supreme Court case regarding “Movil”.[9] Other provisions within this Agreement mandate all providers to offer interconnection at reasonable rates, ban unreasonable conditions on resale of telecommunication services to competitors and declare that market forces may be more appropriate than regulation in setting up telecommunications.

The American Convention on Human Rights (Pact of San Jose) was ratified by Mexico ratified in 1981 and granted the Inter-American Court of Human Rights (IACHR) jurisdiction in 1998.[10] This implies that Mexico must comply with the Convention and with the Court’s judicial rulings.[11] In 2006, the IACHR began taking an active role in verifying that domestic judges, from countries that signed the Convention, ensured national laws were consistent with the Pact of San Jose.[12] This is accomplished through a conventionality review, which requires that domestic judges articulate their decisions on cases that involve human rights and do not adhere to the Convention.[13] Since its adoption, the Mexican government has consistently requested the opinion of the IACHR on issues related to human rights, but the Mexican government has not always been collaborative. Fortunately, Mexico passed a constitutional reform in 2011 that changed several articles to require all state authorities to take the constitution and international treaties, which Mexico is a party to, into consideration when the matter is related to human rights. Article 13(3) Freedom of Thought and Expression states that the right of expression shall not be restricted by indirect methods or means such as the private controls of newsprint, radio broadcasting frequencies, or equipment used in the dissemination of information or by any other means tending to impede the communication and circulation of ideas and opinions.[14]

The following are international agreements that influence telecommunication law. The International Telecommunications Union (ITU) is a United Nations agency that coordinates global telecommunications policy. ITU policies are incorporated into Mexico’s domestic regulatory practice. The ITU facilitates international communication networks, coordinates global standards for broadband, wireless, optical fiber etc., and strives for universal access.[15]

The World Trade Organization, Basic Telecommunications Agreement states that member countries agree to open their markets to foreign carriers for telecommunication services. Additionally, domestic providers and carriers will be treated as equals to foreign providers. This ensures that Mexican-owned telecommunication companies are treated fairly in foreign countries as long as Mexico treats foreign telecommunication companies equally.

United Nations Educational, Scientific, and Cultural Organization (UNESCO): Mexico has been a member of UNESCO since 1946.[16] UNESCO plays a critical role in promoting freedom of expression, education, media pluralism, and access to information. UNESCO strongly encourages participant countries to prohibit censorship and maintain independent media. Additionally, UNESCO is vocal about the dangers of monopolies in broadcasting, communication infrastructure, and media.[17] 

== '''Unit 2: The Media''' ==
Telecommunication markets are vulnerable to high levels of concentration due to infrastructure being expensive and due to large entities benefiting from the events of operating its own network.[18] As previously mentioned, the primary statute regulating media and telecommunications in Mexico is the Federal Telecommunications and Broadcasting Law (FTBL). Recent amendments to Article 28 authorized the FTI to identify and impose regulations on companies that are dominating broadcasting or telecommunications markets.

This reform created the concept of a “preponderant economic agent,” which is given to any company that controls more than 50% of the national market in Mexico in broadcasting or telecommunications. This distinction is reached by measuring the amount of revenue, the amount of infrastructure control, and the number of individuals using the broadcasting or telecommunications service. This reform was incredibly important to Mexican telecommunication and broadcasting regulation as Mexico had very high levels of market concentration where between one to three corporations-controlled majority of the market.
[[File:The tournament of today - a set-to between labor and monopoly - F. Graetz. LCCN2012645501.jpg|thumb]]
For decades, ''America Movil'' was the dominant power in telecommunication services through itself and its subsidiaries, Telcel and Telmex. This concentration of power created massive issues for smaller providers who were attempting to enter the market because constructing and maintaining the infrastructure required massive financial undertakings. In 2021, the Supreme Court of Justice of the Nation upheld the FTI’s decision to classify ''America Movil'' as a preponderant economic agent. America Movil argued that the restrictions set by the regulator restricted their constitutional right and economic freedoms and were unfairly only applicable to them, however America Movil dominated majority of the market through its subsidiaries Telcel and Telmex. The FTI imposed obligations and restrictions on Movil to share infrastructure with smaller telecommunication groups, publish pricing information, unbundle its networks, mandate interconnections. . . all designed to reduce monopolistic practices. Supporters argued that these regulations were necessary and vital because new entities and telecommunication groups could not replicate the same level of service. These restrictions act to promote competition and reduce the barriers to entering the telecommunications industry. Ultimately, the Court concluded that the FTI had the ability to regulate America Movil and impose these regulations on any corporation who meets the preponderant agent standard.

These reforms represent a positive stride towards balancing government interest in preventing the formation of monopolies in essential sectors and promoting free markets. In essence, these reforms promote competition by reducing barriers for new telecommunication agencies which in turn expands choices for consumers.

== '''Unit 3: Censorship and Violent Content''' ==

=== '''Constitutional Protections''' ===
Freedom of speech and the press are constitutional rights in Mexico; however, the application of these rights have been contested and complex. Article 6 of the 1917 Constitution protects freedom of expression by prohibiting censorship and safeguarding the publication, paper, and internet, on many subjects although there are exceptions to these rights.[19] Furthermore, Article 7 states that freedom of speech, opinion, ideas and information shall not be abridged nor shall it be aimed at impeding transmission or circulation of ideas and opinions. [20] However, these expressions may be restricted if they infringe on the rights of others, offend good morals, incite crime, or disturb public order. Overall, Mexico’s constitutional approach demonstrates an equal weighing of competing interests by allowing freedom of expression while restricting expression that may harm public order or morality.

==== '''Violent Content''' ====
Mexico does not have a general federal statute that regulates violent content on social media platforms. However, Mexican authorities do have the ability to issue specific orders if the social media content violates criminal law by inciting violence, threats or child pornography.

Mexico has passed a federal statute that addresses harmful and violent content on digital platforms, which is known as the General Law on Women’s Access to a Life Free of Violence.[21] Article 20 lays the groundwork by stating that “digital violence is any malicious action carried out through the use of information and communication technologies, by which real or simulated images, audio. . . of intimate sexual content. . . are exposed, distributed, disseminated. . . without their approval and that causes psychological harm.”[22] Article 20d states that media violence is any act through which directly or indirectly promotes sexist stereotypes, advocates violence against women, gender discrimination . . . using media outlets and Article 21e grants the Public Prosecutor’s Office or judge the ability to order the necessary protection measures to the companies of digital platforms.[23] Digital platforms who do not comply can be subject to fines or civil liability. While framed within the context of preventing gender-based violence, these provisions and statutes create a basis for courts to order the removal of harmful, violent, or non-consensual content from digital platforms.

==== '''Cyberstalking/Online Harassment''' ====
Mexico’s constitutional commitment to protecting freedom of speech is seen in ''Amparo'' ''81/2025.'' Article 480 of the Puebla’s Penal Code, a regional/state law, was amended to state that a crime is committed by anyone who, “through the use of information and communication technologies, social networks, or email or any digital space, repeatedly or systematically carried out acts of surveillance, harassment, intimidation, or offense to another person, and as a consequence alters their daily life, disturbs their privacy or damages their physical or emotional integrity”. The Third District Judge in criminal matters in the State of Puebla declared the law to be unconstitutional due to its vague and confusing phrasing by refusing to define repeated or systematic, very little clarity on how allegations of this nature cause damage to physical integrity and exceptions labeled “behaviors of public interests” with no proper definition or example of what are “behaviors of public interest.”

==== '''Illegal Pornography &amp; Child Protection''' ====
Mexico strongly opposes and criminalizes child pornography. Article 202 of the Federal Criminal Code criminalizes production, distribution, sale possession and storage of child pornography. [24] This law includes digital content such as videos and images and simulated or altered images.[25] Recent amendments have reacted to the modernization of the internet and artificial intelligence to include altered or simulated images of child pornography.

Not only is Mexico’s criminalization of child pornography grounded in domestic law, but it is also grounded by its ratification of several international human rights treaties. Most notably, Mexico has ratified the UN Convention on the Rights of Children which requires member states to protect children from sexual exploitation and sexual abuse, including pornographic materials.[26] This treaty also includes coverage of altered or simulated images of children in sexual activities which is in full agreement with Mexico’s recent federal amendments.

=== '''Child Protection''' ===
Mexico also goes to extreme lengths to ensure that children are not being exposed to content on televisions or radios that include potentially harmful or explicit conduct. Article 4 of the Constitution broadly establishes that the best interests of the child are paramount.[27] The Federal Telecommunications and Broadcasting Law (FTBL) has several protections for minors which include restricted time slots for adult content, limits advertising tobacco, alcohol or other products, broadcast content classification by age, and restrictions on broadcast content. However, Mexico does not yet have a comprehensive federal statute that regulates internet content or social media content from private corporations by age-based classifications.[28]  

Mexico remains strongly committed to regulating content that depicts children in explicit and violent situations as well as protecting what minors are exposed to on all forms of media. Mexico has dealt with gang violence towards all people but specifically women and thus has passed the General Law on Women’s Access to a Life Free of Violence to strongly condemn and prosecute offenders. 

== '''Unit 4: Truth, Honor, and Tolerance''' ==

=== '''Defamation and Libel''' ===
In one of the most significant rulings on defamation and the press involving Mexico, the United Nations Human Rights Committee (UNHRC) found that a Mexican state had violated Lydia Cacho Riberio, a journalist, freedom of expression. In July 2005, Lydia Cacho published “The Demons of Eden” which allegedly exposed a network of child exploitation and crimes that involved government officials. A businessman by the name of Jose Borge filed a criminal complaint of defamation and the Mexican police arrested Lydia in Cancun and detained her for 30 hours under defamation charges where she experienced severe mistreatment. Criminal proceedings were dropped and Lydia filed a communication with the UN under Article 19 which was a treaty ratified by Mexico. The Committee noted that Mexico failed to show that the arrest of a member of the press was proportionate or necessary and warned that this punitive response to Lydia’s book appeared to be an effort to chill the freedom of expression.

=== '''Reform to Defamation and Slander''' ===
Shortly after Mexico underwent major reform in the area of defamation and slander. In 2011, the Mexican Legislative bodies brought forth and passed significant reform to abolish federal criminal libel, slander and defamation and relegated them to the civil courts under moral damages. This legislation passed unanimously in the Senate and reflected bipartisan agreement that criminal defamation did not align with democratic standards.

The amended version, Article 1916 of the Federal Civil Code defines defamation as follows: “moral damage is understood as the harm that a person suffers in their feelings, affections, beliefs, dignity, honor, reputation, private life or moral integrity. . . and the person responsible for that damage has the obligation to repair it by monetary compensation.”[29] The SCJN adopted a test, similar to ''New York Times v. Sullivan'' in USA jurisdictions, in ''Amparo Direct Revision 2044/2008''. The mayor of Acambaro decided to sue a newspaper director after the local newspaper published an interview with his former driver where it was alleged that the mayor had been using public resources for personal reasons, had misused municipal vehicles and due to comments about the mayor’s sexual history. The mayor claimed in court that these comments were untrue and harmed his reputation. The Court ultimately concluded that public officials must deal with grater public scrutiny because of the role itself and that comments about sexual history or conduct do not necessarily or immediately invade private life. The SCJN held that public officials seeking liability for defamatory statements to prove that the false statements were made with knowledge of falsity and disregard for the truth. This heightened standard encourages journalists to exercise their freedom of expression while disincentivizing journalists from intentionally spreading false statements.[30]

Furthermore, Mexico is also part of the Inter'''-'''American Court of Human Rights which instructs countries that public officials must be able to tolerate more criticism than the average person and warns that criminal defamation statutes must be proportionate and not chill free speech or journalism.

=== '''Hate Speech''' ===
The Federal Government of Mexico has not created a broad hate speech statute like those found in the United States of America or European countries. Instead, the Constitution and cases from the Supreme Court of Justice of the Nation have defined speech that would fall under the hate speech bucket and not freedom of expression. Article 1 of the Mexican Constitution state that “any form of discrimination, based on ethnic or national origin, disabilities, sexual orientation . . . which violate the human dignity or seek to annul or diminish the rights and freedoms of the people, is prohibited.” The SCJN has established hate speech as conduct that promotes discrimination or violence against a person or group. The factual scenario for the case Direct Amparo in Review 2806/2012 is as follows: EHQ published a note in a newspaper referring to APH, another journalist, using homophobic and derogatory language and that his poor performance was due to his sexual orientation. The Court stated that these comments were not just strong criticism but were an offensive expression unrelated to the opinion expressed. The Court also recognized that media corporations/organizations have a social responsibility to prevent discriminatory discourse.

Furthermore, Mexico is also part of the American Convention on Human Rights, otherwise known as the Pact of San Jose. Article 13(5) requires the states to prohibit “any propaganda for war and any advocacy of national, racial, or religious hatred that constitutes incitement to lawless violence.

== '''Unit 5:''' '''Cultural Expressions''' '''&amp; Religion in Education''' ==
Despite their general distrust and skepticism of the national government, Mexican citizens are very proud of their country and its cultural practices.[31] Mexico celebrates known holidays like New Years (Ano Nuevo), Easter week (Semana Santa), Christmas Eve and Christmas Day (Nochebuena and &amp; Navidad). However, Mexico has several cultural festivals that are exclusive to itself or unique to the regional area.

=== Festivals ===
[[File:Carnaval tropical Paris 2014 Golden Stars 114 Guadeloupe.jpg|thumb]]
The first holiday is Carnaval Guaymas, which is one of Mexico’s oldest celebrations, a regional public festival which includes colorful floats, parades, dancers, concerts, and fireworks. Carnaval Guaymas serves as a social gathering that symbolizes regional pride, Sonoran identity, and port-city heritage.[32] The festival has roots in Catholic tradition, as it precedes lent, reflecting temporary indulgence before sacrifice. The holiday was most recently held from February 12, 2026, to February 17, 2026, and had hundreds of thousands of visitors and participants. [33]

The second holiday is the Cinco de Mayo which marks the Battle of Puebla on May 5, 1862, when Mexican forces defeated the French forces of Napoleon III. This festival is celebrated on May 5&lt;sup&gt;th&lt;/sup&gt; every year with parades, music, speeches, and reenactments and is meant to symbolize Mexican resistance and sovereignty.[34]
[[File:Gran Desfile del Día de Muertos 2033.jpg|thumb]]
One of the largest and most well-known festivals is the Dia de los Muertos. This festival originated in the Aztec empire. The holiday honored and celebrated the Lady of the Dead, Mictecacihuatl, whose job it was to watch over the bones of past life that would be used to create new life in the land of the living.[35] The Spanish conquistadors conquered the Aztec Empire and infused Catholicism with the Day of the Dead. These modern-day celebrations, influenced by the Spanish, replaced Mictecacihuatl with la Catrina – a skeleton woman wearing a European hat adorned with flowers and feathers.[36]

=== '''Constitutional Protection of Religious Freedom in Mexico''' ===
In Mexico, religious freedom of expression and choice are enshrined in the Mexican Constitution and a protected right. Mexico does not have a national religion but ensures that Congress cannot dictate laws that establish or abolish any specific religion… Mexico has adopted a strict separation between church and state. Article 130 of the Mexican Constitution orders that ‘the historic principle of separation between the State and religion shall guide the provisions established in this article’.[37]

==== '''Secularism and the Separation of Church and State''' ====
As previously mentioned, Article 24 of the Constitution instructs Congress from establishing or prohibiting any religion and mandates the separation of church and state.[38] This is further supported by in Article 55 wherein ‘any elected official may not be a priest or minister of any religion’ although they may maintain and practice their own beliefs and Article 82 which prohibits any candidate for the Presidency from being a priest or minister of any religion.[39] Furthermore, Article 130 states that ‘the formation of any kind of political group or with a name containing any word or other symbol related to any religion is strictly prohibited’ and Article 82 prohibits any candidate for the Presidency from being a priest or minister of any religion.[40]

Article 24 of the Mexican Constitution states that “every person has the right to have freedom of ethical convictions, of conscience and of religion, and to have or to adopt, as the cause may be, the one of her preferences and that such freedom includes the right to participate, individually mor collectively, in both public and private ceremonies, worship or religious acts of the respective cult, as long as they are not a felony or a misdemeanor punished by law”. [41] In essence, Article 24 guarantees the freedom to maintain ethical convictions of religion and the ability to participate in religious ceremonies and acts of worship.

==== '''Religion in Education''' ====
As stated in Article 3 Section I, the religion and education provided by the State shall be secular, therefore, state education shall be maintained entirely apart from any religious doctrine.[42] The Mexican Constitution elaborates that state education is based on scientific progress and democratic principles and shall contribute to human coexistence while being of quality.

The Supreme Court of Justice reviewed the constitutionality of a statute passed by the State of Nuevo Leon. Article 7, Section XII of the statute stated that one of the aims of the state is to develop solitary attitudes in individuals and to create awareness for the respect of life “from conception until natural death”. As stated by the Supreme Court of Justice, Mexico’s constitution requires that public education be secular which means that the state must remain neutral on all religious beliefs such as questions about when life begins. Additionally, the Court interpreted this state goal was indoctrination into a single view and that the intent of this statute was related and in response to a constitutional abortion amendment. Ultimately, the Court concluded that the term was unconstitutional. [43]

==== '''Religious Expression''' ====
The Mexican Constitution grants individuals the protection of freedom of speech and expression. Mexico does not maintain a modern federal criminal law specifically prohibiting insults or offensive language towards religious beliefs. However, these expressions may be restricted if they infringe on the rights of others, offend good morals, incite crime, or disturb public order. 

== '''Module 6 – Privacy and Data Protection''' ==

=== '''The Right to Access Information''' ===
In 2001, Oaxaca Group, a group of lawyers, reporters, and editors, joined forces to draft a freedom of information initiative.[44] The objective of the Oaxaca Group was to ensure that the new government would live up to the promise that they consistently stated during their campaign to bring about a transparent government.[45] This movement promoting transparency was inspired by human rights activists who were seeking information on state-sponsored crimes that had occurred in the years prior by prior Presidents, specifically the Tlatelolco Massacre. [46]

The Oaxaca Group lobbied for the bill and assisted with revisions or edits that legislators found important and it unanimously passed on April 30, 2002. On June 10, 2002, President Vicente Fox signed the ‘Ley Federal de Transparencia y Acceso a la Informacion Publica Gubernamental’ (Federal Law on Transparency and Access to Public Information). This law created the Federal Institute for Access of Information which established a new international standard for independent FOI oversight. Additionally, this was the first law in Latin America to impose an obligation on the State to declassify and release any information on investigations relating to ‘grave violations of fundamental rights or crimes against humanity is at stake’.[47] President Fox released thousands of documents on June 18, 2002, and they displayed evidence of the State’s role in the surveillance, capture, and torture of tens of thousands of Mexican citizens.

=== '''Evolution of the Right to Access Information''' ===
In 2006, Mexico’s government feared that a new administration may look to gut or weaken the Federal Institute for Access of Information. Thus, Mexico’s government bolstered the Federal Law on Transparency and Access to Public Government Information through a substantial constitutional expansion to Article 6 of the Mexican Constitution.[48] The reform was passed by Congress and approved by the state legislature. The amendment established that access to public information stemming from government action was a constitutionally protected right and not merely a statutory right. The amendment established principles of transparency and provided minimum standards for access to public information at federal, state, and municipal levels.[49] Additionally, it also required that individuals store their documents in updated administrational archives, mandated expedited mechanisms of release of public information, and protects personal data and private lives of individuals.[50]

As expected, this constitutional amendment did not come without challenge. In one instance, the Attorney General of the Republic of Mexico challenged provisions of state transparency laws on the grounds that they did not meet or comply with the federal constitutional standards established under Article 6 of the Mexican Constitution. The Supreme Court of Justice held that the amended Article 6 created a minimum baseline for transparency and access to public information and that no state or municipality was entitled to dilute or weaken constitutional rights.

Another important case is ''Amparo'' 168/2011 where an individual was disappeared by Mexican state agents in the 1970s.[51] The individual’s family member was seeking information from a federal investigation by the Attorney General into the disappearance.[52] The Office of the Attorney General denied the request stating that the files were confidential and that prior requests were already submitted for these files.[53] The SCJN held that any allegation of forced disappearance constituted a grave human rights violation and that transparency in such situations is the constitutional mandate.[54]

Ultimately, Mexico’s transparency reforms benefit democratic and human rights interests. Democracy will be promoted by allowing journalists, media, and even normal citizens to monitor government conduct, request documentation and even expose misconduct or abuses of power. Returning to the intent driving these reforms was the respect for human rights. The goal was to receive documentation from government investigations into individuals who were ‘disappeared’ before a previous administration, and it is now codified that there can be no exceptions to requested documents relating to missing persons.

== '''Module 7: RIGHT TO BODILY, SPIRITUAL, &amp; DIGITAL IDENTITY''' ==

=== '''Digital Identity''' ===
On July 17, 2025, Mexico’s Congress approved reforms to the General Population Law and the General Law on Forced Disappearance that mandated the creation and usage of an identity document that contains biometric data. The biometric Population Registry Code (CURP) is an official identification document that is mandated and available in both physical and digital formats that will integrate fingerprints, iris scans, and photographs.[55] Mexico’s Congress stated it would be used for identity validation, immigration procedures, access to health services, legal processes, and to support the search for missing persons.[56] The biometric CURP will contain information on the following: names and surnames, date of birth, sex, place of birth, nationality, a photograph, a digital signature, fingerprints, iris scans, and an alphanumeric code containing 18 letters and numbers. The main purpose driving its creation is to help the combat Mexico’s missing persons crisis and to prevent the crime of identity theft that is occurring in organized crime and drug trafficking. Although government leaders have spoken out in public claiming that the CURP is not ‘mandatory, individuals against the CURP have stated that many essential documents and identifications will only be accessible via CURP and thus be required.

=== '''Storage of Digital Identity''' ===
Under the new law, the storage and management of the CURP will be administered by the Ministry of the Interior and the federal Digital Transformation Agency on a new platform. Mexican citizens will need to create a personal account on the ‘Llave MX’ portal, which provides them to obtain a digital identity connected to their personal information. However, the legislation eliminated the National Council for Regulatory Improvement and the National Observatory for Regulatory Improvement which provided oversight, review and transparency. The removal of these critical agencies and entities has cast doubt on whether the government can be monitored and held accountable as they collect, store and use biometric data. A lack of accountability or oversight from a separate government body or agency could lead to a tool of mass surveillance.

=== '''Mass Surveillance''' ===
Mass surveillance uses systems or technologies that collect, analyze, and generate data on indefinite or large numbers of people instead of limiting surveillance to individuals about which there is reasonable suspicion of wrongdoing.[57] Biometric data is uniquely dangerous because it describes the physiological and behavioral characteristics of individuals. [58] If the country adopting biometric data has a weak legal framework and weak safeguard, the technology poses a grave threat to privacy and personal security as biometric data can identify a person for their entire lifetime.[59] Opposition to this law have labeled it the “Spy Bill” as all data, ranging from access to public and private services, missing persons data, tax contributions, and others, will be kept in the Unique Identity Platform. Government entities like the National Intelligence Centre and National Guard will have complete access to the biometric data that is stored in the Unique Identity Platform. [60] Additionally, authorities will be able to view this data without a lawful court order, and individuals will not be made aware when their information has been viewed by authorities, how many times it has been viewed or even what agency viewed it. [61]

Further concerns arise when one considers the Mexican government’s history with surveillance. Digital rights groups have recorded many instances of the government surveilling journalists and human rights defenders. Other specific examples include when Meta’s U.S. lawsuit proved that an Israeli cyberintelligence group spied on over 400 people in Mexico in 2019 and when a hacker working for the Sinaloa drug cartel obtained information from the technology of an FBI agent and used surveillance cameras in Mexico City to track and kill the FBI’s informants in 2018.[62] Finally, in March 2025, the United States requested that Mexico’s government share all biometric information of migrants, although the Mexican government declined merely because it did not yet have a catalog or biometric data ID system.[63]

Ultimately, Mexico’s legal framework reflects a balancing of competing interests that has made progress but remains unfinished. The state’s need for security and public order are vital but proper watchdog and accountability mechanisms must be put in place to avoid infringements of constitutional rights and violations of privacy.

== '''Unit 8: Consent of Acquisition of Private Information''' ==
[[File:Digital Safety and Privacy - Human Rights Team (1).pptx.pdf|thumb]]
At the core of Mexico’s unique approach to private information is the ‘Ley Federal De Proteccion De Datos Personales en Posesion de los Particulares (Federal Law on the Protection of Personal Data Held by Private Parties).[64] This law is designed to protect individuals’ privacy by regulating how private entities can retain, process, store, or use personal data. Article 7 of the law requires that any processing of personal data shall require the consent of the individual unless specific exceptions apply.[65] This clause protects Mexican consumers and individuals who use their personal data in transactions on the internet or in-person. However, the Mexican government has established through Article 9 exceptions to the rule.[66] Article 9 of the Federal Law on the Protection of Personal Data Held by Private parties lays out that a controller is not required to obtain consent from an individual when required by law, the data appears in publicly accessible sources, when the data has undergone dissociations, or in medical emergencies. These exceptions balance two competing interests, privacy protection and practical governance, by allowing medical facilities to act quickly in emergency situations with private information and inversely restricting business entities from processing personal information from online transactions without consent.[67]

=== '''The Right to Reject Information''' ===
Privacy law in Mexico has given citizens control over how companies and private entities collect, use, store, and share their personal information. At the core of Mexico’s unique approach is the ‘Ley Federal De Proteccion De Datos Personales en Posesion de los Particulares (Federal Law on the Protection of Personal Data Held by Private Parties). This law sets out ‘ARCO rights’ which stand for rights of: access, rectification, cancellation, and opposition.[68]

Access allows individuals or otherwise known as data subjects to know when companies possess their personal information, see how it is being used, and who it could be sent to among others. Under Article 28, an ARCO rights request must include the name of the data subject, address or notification method, proof of identity, description of the requested data, and description of the ARCO right exercised.[69] The controller must respond within twenty days and process the request within fifteen days if it is approved however Article 33 permits the controller to deny the request when the identity is not proven, a legal impediment exists, or the data is not held by the controller.[70]

Article 23 states that rectification allows citizens to correct personal information that is in possession of the entity that is misleading, incomplete or incorrect.[71] Additionally, the individual must specify the exact information that requires modification and provide documentation that supports the modification.[72] The controller may deny if the data provided does not exist or legal impediments stand in the way.

Cancellation allows citizens to request that personal information be removed from the database storing it after it becomes unnecessary to hold or a specific amount of time passes. Article 24 states that data subjects shall have the right to request cancellation of personal data from files, records, systems, and databases of the controller.[73] The data must then be put into a blocking period and subsequently deleted. Article 25 lists several exceptions that allow the controller to continue possessing the information such as when it may be necessary for contractual performance, serves public interest, is ordered by law to be retained, and would obstruct judicial proceedings.[74]

Opposition allows citizens to oppose the processing of their personal information when: a legitimate cause exists and continued processing would case harm, or automated processing procedures produce unwanted legal effects or significantly affects the subject’s interests, rights or freedoms. Article 26 lists several factors that automated systems may use such as health, sexual preferences, and economic situation which are placed into a predictive analysis system or algorithm to specifically target the individual.[75]

=== '''Anti-Spam''' ===
[[File:No-spam.svg|thumb]]
Mexico’s unsolicited marketing and anti-spam are enforced through the Federal Consumer Protection Law and the Public Registry to Avoid Advertising which are administered by the Federal Consumer Protection Agency. The Federal Consumer Protection Law gives consumers the ability to opt out of any unsolicited marketing communications and restricts entities from continuing to send advertising once the consumer has opted out.[76] Entities that violate these opt-outs may face sanctions or other penalties.[77] Additionally, Mexico has the Public Registry to Avoid Advertising which allows individuals to block telemarketing calls, text advertising, and other promotional communications with very limited exceptions by inputting their phone number and or email contact information.[78]              

----[1] Francis A. Avalos, ''The Mexican Legal System: A Comprehensive Research Guide'' (3d ed. 2013).

[2]  ''Id''.

[3]  ''Id''.

[4] Mex. Const. art. 2.

[5] Mex. Const. art. 2, § B, para. II.

[6] Mex. Const. art. 6, § B, para. II.

[7] Giuseppe Gonzalez &amp; Fernando Borjón, ''Access Alert: The New Telecom Reform—A Turning Point for Mexico’s Digital Future'', '''Access Partnership''' (Apr. 14, 2025), &lt;nowiki&gt;https://www.accesspartnership.com&lt;/nowiki&gt;

[8] ''Id.''

[9] Tori Smith &amp; Gabriella Beaumont-Smith, ''An Analysis of the United States–Mexico–Canada Agreement'', '''The Heritage Foundation''' (Jan. 28, 2019).

[10] Azul A. Aguiar-Aguilar (2015): Harmonizing national law with inter American human rights law: Evidence from Mexico, Journal of Human Rights.

[11] ''Id''.

[12] ''Id''.

[13] ''Id''.

[14] '''American Convention on Human Rights''' art. 13(3), Nov. 22, 1969, 1144 U.N.T.S. 123.

[15] '''International Telecommunication Union''' Constitution and Convention of the International Telecommunication Union, Dec. 22, 1992, 1825 U.N.T.S. 331 (as amended).

[16] Mexico, UNESCO Country Profile.

[17] Id.

'''[18] Telecommunications and Broadcasting in Mexico''', ch. 10.1, “Competition Law and Telecommunications” (Mex.).

[19] ''Mex. Const''. art. 7 (1917)

[20] ''Mex. Const''. art. 7 (1917) 

[21] ''General Law on Women’s Access to a Life Free of Violence,'' Diario Oficial de la Federación [DOF], Feb. 1, 2007, amended Feb. 13, 2026 (Mex.).

[22] ''General Law on Women’s Access to a Life Free of Violence'' art. 20 (Mex.).

[23] ''General Law on Women’s Access to a Life Free of Violence'' arts. 20(d) &amp; 21(e) (Mex.).

[24] Federal Criminal Code [Mexico], art. 202, Diario Oficial de la Federación [DOF], Aug. 14, 1931, as amended through June 7, 2024 (Mex.).

[25] Federal Criminal Code [Código Penal Federal], art. 202 (Mex.).

[26] Convention on the Rights of the Child art. 34, Nov. 20, 1989, 1577 U.N.T.S. 3.

[27] Article 4 establishes the ''best interests of the child'' principle and guarantees children’s rights to protection and well-being, which underpins media protection statutes for minors.

[28] Federal Telecommunications and Broadcasting Law [Ley Federal de Telecomunicaciones y Radiodifusión], arts. 64, 66, 68 (Mex.).

[29] ''Código Civil Federal'' [Civil Code] art. 1916 (Mex.).

[30] Supreme Court of Justice of the Nation [SCJN], First Chamber, Amparo Directo en Revisión 2044/2008, José Ramón Cossío Díaz, J., decision of June 17, 2009 (Mex.).

[31] Clare Ribando Seelke &amp; M. Angeles Villarreal, ''Mexico: Political Overview and U.S.-Mexican Relations'', Cong. Rsch. Serv. IF12765, at 1 (Jan. 30, 2025), &lt;nowiki&gt;https://www.congress.gov/crs_external_products/IF/PDF/IF12765/IF12765.4.pdf&lt;/nowiki&gt;

[32] Miguel Leyva, Guaymas Carnival 2026 “The People Are Celebrating” Concludes with a White Balance and a Family Celebration Full of Joy, Grupo Radio Guaymas (Feb. 19, 2026), &lt;nowiki&gt;https://www.gruporadioguaymas.com/carnaval-guaymas-2026-el-pueblo-esta-de-fiesta-concluye-con-saldo-blanco-y-una-celebracion-familiar-llena-de-alegria/&lt;/nowiki&gt;

[33] Id.

[34] The Editors of Encyclopaedia Britannica, Cinco de Mayo, Britannica (Mar. 2, 2026), &lt;nowiki&gt;https://www.britannica.com/story/cinco-de-mayo&lt;/nowiki&gt;

[35] History.com Editors, Day of the Dead (Día de los Muertos), HISTORY (Oct. 30, 2018), &lt;nowiki&gt;https://www.history.com/articles/day-of-the-dead&lt;/nowiki&gt;

[36] University of Kansas Center for Latin American and Caribbean Studies, “Día de los Muertos History,” KU International Affairs Center for Latin American and Caribbean Studies

[37] ''Constitución Política de los Estados Unidos Mexicanos'' [Political Constitution of the United Mexican States], as amended, art. 130, Diario Oficial de la Federación [DOF], Feb. 5, 1917 (Mex.).

[38] Id.

[39] ''Constitución Política de los Estados Unidos Mexicanos'' [Political Constitution of the United Mexican States], as amended, art. 55, Diario Oficial de la Federación [DOF], Feb. 5, 1917 (Mex.).

[40] ''Constitución Política de los Estados Unidos Mexicanos'' [Political Constitution of the United Mexican States], as amended, art. 130, Diario Oficial de la Federación [DOF], Feb. 5, 1917 (Mex.).

[41] ''Constitución Política de los Estados Unidos Mexicanos'' [Political Constitution of the United Mexican States], as amended, art. 24, Diario Oficial de la Federación [DOF], Feb. 5, 1917 (Mex.).

[42] ''Constitución Política de los Estados Unidos Mexicanos'' [Political Constitution of the United Mexican States], as amended, art. 3, § I, Diario Oficial de la Federación [DOF], Feb. 5, 1917 (Mex.).

[43] Supreme Court of Justice of the Nation [SCJN], Action of Unconstitutionality challenging Article 7, Section XII of the Education Law of the State of Nuevo León (Mex.).

[44] FreedomInfo.org, Mexico, FreedomInfo.org, &lt;nowiki&gt;https://www.freedominfo.org/regions/latin-america/mexico/mexico2/&lt;/nowiki&gt;

[45] Id.

[46] Id.

[47] Federal Law on Transparency and Access to Public Government Information (LFTAIPG), art. 18 Diario Oficial de la Federación [DOF], June 11, 2002 (Mex.).

[48] ''Mexico’s Constitutional Reform Guarantees the Right to Know'', National Security Archive (2007), &lt;nowiki&gt;https://nsarchive2.gwu.edu/mexico/constitution.htm&lt;/nowiki&gt;

[49] ''Id''.

[50] ''Id''.

[51] Supreme Court of Justice of the Nation [SCJN], Amparo on Review 168/2011 (Mex.).

[52] Id.

[53] Id.

[54] Id.

[55] Marisol Torres, ''Is Mexico Ready for the Biometric CURP?'', Thomson Reuters Institute (2025), &lt;nowiki&gt;https://www.thomsonreuters.com/en-us/posts/government/mexico-biometric-curp/&lt;/nowiki&gt;.

[56] Id.

[57] Privacy International, Mass Surveillance, Privacy International, &lt;nowiki&gt;https://privacyinternational.org/learn/mass-surveillance&lt;/nowiki&gt;

[58] Privacy International, Biometrics, Privacy International, &lt;nowiki&gt;https://privacyinternational.org/learn/biometrics&lt;/nowiki&gt;

[59] Id.

[60] Diana Baptista, Will Mexico’s New Biometric ID Card Harm Digital Privacy?, Context (July 14, 2025), &lt;nowiki&gt;https://www.context.news/digital-rights/will-mexicos-new-biometric-id-card-harm-digital-privacy&lt;/nowiki&gt;

[61] Id.

[62] Id.

[63] Id.

[64] Federal Law on the Protection of Personal Data Held by Private Parties, Diario Oficial de la Federación [DOF], July 5, 2010 (Mex.).

[65] Federal Law on the Protection of Personal Data Held by Private Parties, art. 7, Diario Oficial de la Federación [DOF], July 5, 2010 (Mex.).

[66] Federal Law on the Protection of Personal Data Held by Private Parties, art. 9, Diario Oficial de la Federación [DOF], July 5, 2010 (Mex.).

[67] Id.

[68] Id.

[69] Federal Law on the Protection of Personal Data Held by Private Parties, art. 28, Diario Oficial de la Federación [DOF], July 5, 2010 (Mex.).

[70] '''Federal Law on the Protection of Personal Data Held by Private Parties''', art. 33, Diario Oficial de la Federación [DOF], July 5, 2010 (Mex.).

[71] '''Federal Law on the Protection of Personal Data Held by Private Parties''', art. 23, Diario Oficial de la Federación [DOF], July 5, 2010 (Mex.).

[72] Id.

[73] '''Federal Law on the Protection of Personal Data Held by Private Parties''' art. 24 (Mex.).

[74] Id.

[75] '''Federal Law on the Protection of Personal Data Held by Private Parties''', art. 26, Diario Oficial de la Federación [DOF], July 5, 2010 (Mex.).

[76] '''Federal Consumer Protection Law''', Official Gazette of the Federation, Dec. 24, 1992, as amended Jan. 26, 2024 (Mex.).

[77] Id.

[78] '''Public Registry for Avoiding Advertising''' (REPEP), Federal Consumer Protection Agency (PROFECO) (Mex.).
[[Category:Communication|Law in Mexico]]
[[Category:Law]]
[[Category:Mexico]]</text>
      <sha1>pfvnw6pbdxlz314bdvz2vuxopvgxaq2</sha1>
    </revision>
  </page>
  <page>
    <title>User talk:PieWriter/RFD.js</title>
    <ns>3</ns>
    <id>328448</id>
    <revision>
      <id>2809909</id>
      <parentid>2798645</parentid>
      <timestamp>2026-05-17T11:21:55Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <comment>Category</comment>
      <origin>2809909</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="930" sha1="lqe7lt2w1jg9h3g7hxcrkuv2rj6hctt" xml:space="preserve">== Invocation ==

{{U|PieWriter}} having installed your script it is not clear to me how it is invoked. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 12:38, 17 March 2026 (UTC)

:check the RFD button beside view history @[[User:Timtrent|Timtrent]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 13:19, 17 March 2026 (UTC)
:&lt;small&gt;I forgot to remove the &lt;nowiki&gt;{{rfd}}&lt;/nowiki&gt; &lt;/small&gt; [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 13:22, 17 March 2026 (UTC)

== Category ==
{{U|Piewrite}} is there a way to stop this page from listing at [[:Category:Requests for Deletion]]? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:21, 17 May 2026 (UTC)</text>
      <sha1>lqe7lt2w1jg9h3g7hxcrkuv2rj6hctt</sha1>
    </revision>
    <revision>
      <id>2809910</id>
      <parentid>2809909</parentid>
      <timestamp>2026-05-17T11:22:11Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <minor />
      <comment>/* Category */</comment>
      <origin>2809910</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="931" sha1="rwwo8nl9anb7s1dmwhjg1fwy10zc6v7" xml:space="preserve">== Invocation ==

{{U|PieWriter}} having installed your script it is not clear to me how it is invoked. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 12:38, 17 March 2026 (UTC)

:check the RFD button beside view history @[[User:Timtrent|Timtrent]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 13:19, 17 March 2026 (UTC)
:&lt;small&gt;I forgot to remove the &lt;nowiki&gt;{{rfd}}&lt;/nowiki&gt; &lt;/small&gt; [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 13:22, 17 March 2026 (UTC)

== Category ==
{{U|Piewriter}} is there a way to stop this page from listing at [[:Category:Requests for Deletion]]? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:21, 17 May 2026 (UTC)</text>
      <sha1>rwwo8nl9anb7s1dmwhjg1fwy10zc6v7</sha1>
    </revision>
    <revision>
      <id>2809911</id>
      <parentid>2809910</parentid>
      <timestamp>2026-05-17T11:22:27Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <minor />
      <comment>/* Category */</comment>
      <origin>2809911</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="931" sha1="longc4ncruqbu3feo84kcrbv9jisl70" xml:space="preserve">== Invocation ==

{{U|PieWriter}} having installed your script it is not clear to me how it is invoked. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 12:38, 17 March 2026 (UTC)

:check the RFD button beside view history @[[User:Timtrent|Timtrent]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 13:19, 17 March 2026 (UTC)
:&lt;small&gt;I forgot to remove the &lt;nowiki&gt;{{rfd}}&lt;/nowiki&gt; &lt;/small&gt; [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 13:22, 17 March 2026 (UTC)

== Category ==
{{U|PieWriter}} is there a way to stop this page from listing at [[:Category:Requests for Deletion]]? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:21, 17 May 2026 (UTC)</text>
      <sha1>longc4ncruqbu3feo84kcrbv9jisl70</sha1>
    </revision>
  </page>
  <page>
    <title>User talk:~2026-18400-87</title>
    <ns>3</ns>
    <id>328644</id>
    <revision>
      <id>2809875</id>
      <parentid>2806238</parentid>
      <timestamp>2026-05-17T06:57:07Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <comment>Welcome ip</comment>
      <origin>2809875</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="4034" sha1="dishdmcplltnyycbenwl2o91m6w935r" xml:space="preserve">Welcome to Talk Page!
All Archives
[[User talk:~2026-18400-87/Archive 1]]

== 2026-03-25 ==
[[File:Information.svg|25px|alt=Information icon]] Hello, I’m letting you know that one or more of your recent contributions have been reverted because they did not appear constructive. If you would like to experiment, please use the [[Wikiversity:Sandbox|sandbox]] or ask for assistance at the [[Wikiversity:Colloquium|Colloquium]]. Thank you.&lt;!-- Glow-vandalism1 @ 1774443582138.3s --&gt;&lt;nowiki&gt;&lt;/nowiki&gt; [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 12:59, 25 March 2026 (UTC)

:ok [[Special:Contributions/&amp;#126;2026-18400-87|&amp;#126;2026-18400-87]] ([[User talk:&amp;#126;2026-18400-87|talk]]) 14:58, 25 March 2026 (UTC)

== Hey I Got Blanked ==

User!!!!! [[Special:Contributions/&amp;#126;2026-18400-87|&amp;#126;2026-18400-87]] ([[User talk:&amp;#126;2026-18400-87|talk]]) 01:37, 29 March 2026 (UTC)

== 2026-04-01 ==
&lt;div class=&quot;mw-content-ltr&quot; dir=&quot;ltr&quot; style=&quot;text-align: left; display: inline&quot; lang=&quot;en&quot;&gt;[[File:Information orange.svg|25px|alt=Information icon]] Sorry for writing in English, but please do not make unconstructive edits to &lt;span style=&quot;white-space:nowrap&quot;&gt;Wikiversity&lt;/span&gt;. Your edits appear to constitute [[:m:en:Wikipedia:Vandalism|vandalism]] and have been reverted. If you would like to experiment, please use the sandbox. Repeated vandalism may result in the loss of editing privileges. Thank you. &lt;/div&gt;&lt;!-- Glow-vandalism2 @ 1775048926726.3s --&gt;&lt;nowiki&gt;&lt;/nowiki&gt; [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 13:08, 1 April 2026 (UTC)

== Deletion per request ==

I have deleted [[User:~2026-18400-87/Templates|the page you have requested]]. Next time use a standard template like {{tl|delete}} [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 05:53, 24 April 2026 (UTC)

{{#ifeq:{{NAMESPACE}}|User talk||{{error|Error: substitution required. Use &lt;nowiki&gt;{{subst:Welcomeip}}&lt;/nowiki&gt; instead.}}[[Category:Template substitution errors]]&lt;div style=&quot;display:none;&quot;&gt;}}{{Robelbox|theme=9|title=Welcome!|width=100%}}
&lt;div style=&quot;{{Robelbox/pad}}&quot;&gt;
Hello, and [[Wikiversity:Welcome, newcomers|welcome]] to [[Wikiversity]]. Thank you for your contributions.

Currently, you are [[Help:Editing|editing]] without a permanent account. You can continue to do so, as you are not required to log in to Wikiversity to read and edit articles; however, logging in will result in a username being shown instead of a temporary account (which will expire 90 days after first edit). Logging in does not require any personal details, and there are many other '''[[Wikiversity:Why create an account|benefits for logging in]]'''.

When you edit pages:

* Please [[Wikiversity:Copyrights|respect others' copyrights]]; do not copy and paste the contents from webpages directly.
* Please use a [[Wikiversity:Disclosures|neutral point of view]] when editing articles.
* If you are testing, please use the [[Wikiversity:Sandbox|Sandbox]] to &lt;span class=&quot;plainlinks&quot;&gt;[http://en.wikiversity.org/w/index.php?title=Wikiversity:Sandbox&amp;action=edit do so].&lt;/span&gt; 
* Do not add unreasonable contents into any [[Wikiversity:Browse|articles]], such as copyrighted text, advertisement messages, and text that is not related to an areas's subject. Adding such content or editing articles maliciously is considered [[Wikiversity:Blocking policy|vandalism]].

The [[Wikiversity:Introduction|Introduction]] is a good place to start learning about Wikiversity. For now, if you are stuck, you can ask a question on {{#if:|[[user talk:{{{1}}}|my Talk page]]|my Talk page}}. I will answer your questions as far as I can! Thank you again for contributing to Wikiversity. -- -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 06:56, 17 May 2026 (UTC)
&lt;/div&gt;
{{Robelbox/close}}
{{#ifeq:{{NAMESPACE}}|User talk||&lt;/div&gt;}}</text>
      <sha1>dishdmcplltnyycbenwl2o91m6w935r</sha1>
    </revision>
  </page>
  <page>
    <title>Trirectangular Tetrahedrons</title>
    <ns>0</ns>
    <id>328769</id>
    <revision>
      <id>2809841</id>
      <parentid>2807435</parentid>
      <timestamp>2026-05-17T03:58:34Z</timestamp>
      <contributor>
        <username>HenriPittier</username>
        <id>3076895</id>
      </contributor>
      <origin>2809841</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="11247" sha1="c7pi0bg6ivk4ozm1zz70cljhtxywv1o" xml:space="preserve">{{delete}}
=== &lt;math&gt;A\ Trirectangular\ Tetrahedron\ is\ a\ tetrahedron\ where\ the\ Origin\bigl(x,y,z\bigr)\ is\ composed\ of &lt;/math&gt;&lt;math&gt;3\ Right\ Angled\ Triangles.\ There\ are\ Five\ Hidden\ mathematical\ equalities\ in\ Trirectangular  &lt;/math&gt;&lt;math&gt;Tetrahedrons.\ They\ exist\ only\ in\ these\ types\ of\ tetrahedrons.  &lt;/math&gt; ===

== . ==

=== &lt;big&gt;&lt;math&gt;Here\ are\ the\ Five\ Hidden\ Equalities\ and\ they\ are\ magical.&lt;/math&gt;&lt;/big&gt; ===

=== &lt;big&gt;&lt;math&gt;K=\Biggl[\frac{\ a^2+b^2+c^2}{2}\Biggr]=\Bigl[x^2+y^2+z^2\Bigr]=\Bigl[a^2+z^2\Bigr]=\Bigl[b^2+y^2\Bigr]=\Bigl[c^2+x^2\Bigr]&lt;/math&gt;&lt;/big&gt; ===
'''&lt;big&gt;&lt;math&gt;If\ given\ \bigl(a,b,c\bigr)\ use\ the\ 1st\ term\ K=\frac{\ a^2+b^2+c^2}{2}\ \ This\ equation\ is\ a\ modification\ of &lt;/math&gt;&lt;/big&gt;'''&lt;big&gt;&lt;math&gt;Heron's\ Semiperimeter.\ Then\ use\ \bigl(a,b,c\bigr)\ to\ calculate\ \bigl(x,y,z\bigr)\ as\ shown\ beneath\ this\ diagram.&lt;/math&gt;&lt;/big&gt;[[File:(ABC) = (XYZ).png|thumb|708x708px|CaliCat 1]]

=== &lt;math&gt;K\ equals\ all\ 5\ equations.&lt;/math&gt; ===

=== &lt;big&gt;&lt;math&gt;K=\frac{\ a^2+b^2+c^2}{2}&lt;/math&gt;&lt;/big&gt; ===

=== &lt;big&gt;&lt;math&gt;K=x^2+y^2+z^2&lt;/math&gt;&lt;/big&gt; ===

=== &lt;big&gt;''&lt;math&gt;K=a^2+z^2\qquad\ Blue&lt;/math&gt;''&lt;/big&gt; ===

=== &lt;big&gt;''&lt;math&gt;K=b^2+y^2\qquad\ Black&lt;/math&gt;''&lt;/big&gt; ===

=== &lt;big&gt;''&lt;math&gt;K=c^2+x^2\qquad\ Red&lt;/math&gt;''&lt;/big&gt; ===
''.&lt;big&gt;And they interlock in such a way that they greatly simplify solving Trirectangular problems. Here the mating pairs are color coded for easy understanding.&lt;/big&gt;''

&lt;big&gt;''The other way to remember which diagonal line'' (''a,b,c'') ''mates with it's rectangular counterpart'' (''x,y,z'') ''is to realize the mating pairs are the only lines that never touch each other'' !&lt;/big&gt;

&lt;big&gt;&lt;math&gt;Thus\ A\ \ Mates\ only\ with\ Z\ \ Blue&lt;/math&gt;&lt;math&gt;\qquad\ \ B\ \ Mates\ only\ with\ Y\ \ Black&lt;/math&gt;&lt;math&gt;\qquad\ \ C\ \ Mates\ only\ with\ X\ \ Red&lt;/math&gt;&lt;/big&gt;

== .&lt;math&gt;IF\ \ given\ \ \bigl(a,b,c\bigr)\ \ then\ \ use\ \ K=\biggl[\frac{\ a^2+b^2+c^2}{2}\biggr]\ \ to\ calculate\ \ \bigl(x,y,z\bigr)&lt;/math&gt;&lt;math&gt;Then\ \ x=\sqrt{_{_.}K-c^2\ }\qquad\ y=\sqrt{_{_.}K-b^2\ }\qquad\ z=\sqrt{_{_.}K-a^2\ }&lt;/math&gt; ==

=== &lt;big&gt;&lt;math&gt;IF\ \ Given\ \bigl(x,y,z\bigr)\ \ then\ \ use\ \ K=\Bigl[x^2+y^2+z^2\Bigr]\ \ to\ calculate\ \bigl(a,b,c\bigr)&lt;/math&gt;&lt;/big&gt; ===

=== &lt;big&gt;&lt;math&gt;Then\quad a=\sqrt{_{_.}K-z^2\ }\qquad b=\sqrt{\ K-y^2\ }\qquad\ c=\sqrt{_{_.}K-x^2\ }&lt;/math&gt;&lt;/big&gt; ===

=== &lt;big&gt;&lt;math&gt;Or:\quad\ a=\sqrt{_{_.}x^2+y^2\ }\qquad b=\sqrt{_{_.}x^2+z^2\ }\qquad c=\sqrt{_{_.}y^2+z^2\ }&lt;/math&gt;&lt;/big&gt; ===

== . ==

=== &lt;big&gt;&lt;math&gt;Proof\ of\ the\ accuracy\ of\ the\ K\ formulas.\ Try\ these\ test\ numbers\ yourself.&lt;/math&gt;&lt;/big&gt; ===

=== &lt;math&gt;Given:\qquad a=14.4\qquad b=10\qquad c=12&lt;/math&gt;&lt;big&gt;&lt;math&gt;Then\ use\ the\ Pythagorean\ Theorem\ to\ Calculate\ (x,y,z)&lt;/math&gt;&lt;/big&gt; ===

=== &lt;math&gt;K=\frac{\ a^2+b^2+c^2}{2}=225.68&lt;/math&gt; ===

=== &lt;math&gt;K=x^2+y^2+z^2\ \ =225.68&lt;/math&gt;&lt;math&gt;K=a^2+z^2\qquad\ \ \ =225.68\quad\bigl(a=14.4\quad z=4.280186911806539319650461\bigr)&lt;/math&gt;&lt;math&gt;K=b^2+y^2\qquad\ \ \ =225.68\quad\bigl(b=10\quad \ \ \ \ y=11.210709165793214885544255\bigr)&lt;/math&gt;&lt;math&gt;K=c^2+x^2\qquad\ \ \ =225.68\quad\bigl(c=12\quad \ \ \ \ x=9.037698822156002781875821\bigr)&lt;/math&gt; ===

== . ==

=== &lt;math&gt;The\ area\ of\ the\ Base\ Triangle\ derived\ by\ using\ \bigl(x,y,z\bigr)\ \&amp;\ directly\ below\ that\ by\ using\ \bigl(a,b,c\bigr)&lt;/math&gt;&lt;math&gt;The\ \bigl(H\bigr)_{abc}\ designation\ is\ used\ to\ identify\ it\ as\ Heron's\ Triangle.\ \bigl(The\ BASE\ triangle\bigr)&lt;/math&gt;. ===

=== &lt;math&gt;Rectangular\ (x,y,z) \quad H_{abc}=\frac{\ \ \sqrt{\ x^2y^2+z^2\bigl(x^2+y^2\bigr)\ }\ \ }{2_{.}}&lt;/math&gt;&lt;math&gt;Heron's\ Theorem\qquad H_{abc}=\sqrt{\ S(S-a)(S-b)(S-c)\ }\quad where\ \ S=\frac{\ a+b+c\ }{2}&lt;/math&gt; ===

== . ==

=== &lt;math&gt;Height\ of\ Tetrahedron\ from\ Base\ of\ Heron's\ Triangle\ H_{abc}\ to\ the\ origin\ \bigl(x,y,z\bigr)&lt;/math&gt;&lt;math&gt;This\ amazing\ equation\ was\ found\ on\ the\ internet.\ It\ is\ not\ my\ own\ work\ !&lt;/math&gt;&lt;math&gt;It\ is\ accurate\ and\ I\ Reworked\ it\ from\ its\ original\ form.\ \bigl(See\ Original\ Form\ at\ the\ bottom\ \bigr)&lt;/math&gt;. ===

=== ''&lt;big&gt;&lt;math&gt;h=\frac{xyz}{\ \sqrt{\ x^2y^2+z^2\bigl(x^2+y^2\bigr)\ \ }\ \ }&lt;/math&gt;&lt;/big&gt;''  &lt;ref&gt;{{Cite web|url=https://en.wikipedia.org/wiki/Trirectangular_tetrahedron|title=Trirectangular tetrahedron - Metric formulas}}&lt;/ref&gt; &lt;ref&gt;{{Cite web|url=https://www.formuladen.com/en/|title=Formula Den}}&lt;/ref&gt; ===

=== &lt;big&gt;&lt;math&gt;Areas:&lt;/math&gt;&lt;math&gt;A_{xy}=\frac{\ xy\ }{2}\qquad B_{xz}=\frac{\ xz\ }{2}\qquad C_{yz}=\frac{\ yz\ }{2}\qquad H_{abc}=\frac{\ \sqrt{\ x^2y^2+z^2\bigl(x^2+y^2\bigr)\ }\ \ }{2}&lt;/math&gt;&lt;/big&gt; ===

=== &lt;math&gt;A_{total}=A_{xy}+B_{xz}+C_{yz}+H_{abc}&lt;/math&gt; ===

=== &lt;big&gt;&lt;math&gt;A_{total}=\frac{\ xy+z(x+y)+\sqrt{\ x^2y^2+z^2\bigl(x^2+y^2\bigr)\ }\ \ }{2}&lt;/math&gt;&lt;/big&gt; ===

== . ==

=== &lt;big&gt;&lt;math&gt;Volume:&lt;/math&gt;&lt;/big&gt; ===

=== &lt;math&gt;V_{box}=xyz\qquad V_{tet}=\frac{\ V_{box}\ }{6}\qquad V_{tet}=\frac{\ xyz\ }{6}&lt;/math&gt; ===

=== . ===
&lt;big&gt;&lt;math&gt;The\ similar\ appearence\ between\ Heron's\ semiperimeter\ \&amp;\ its\ K\ substitute\ is\ obvious. &lt;/math&gt;&lt;math&gt;Heron's\ \ Theorem\qquad\ Trirectangular\ \ Theorem\ (?)&lt;/math&gt;&lt;/big&gt;

=== &lt;big&gt;&lt;math&gt;S=\frac{\ a+b+c\ }{2}\qquad K=\frac{\ a^2+b^2+c^2\ }{2}&lt;/math&gt;&lt;/big&gt; ===
.

== &lt;math&gt;Interesting\ Items&lt;/math&gt; ==

=== &lt;big&gt;&lt;math&gt;K\ solutions\qquad\qquad\quad Transition\qquad\qquad\quad Perk\ solutions &lt;/math&gt;&lt;/big&gt; ===
&lt;big&gt;&lt;math&gt;x=\sqrt{_{_.}K-c^2\ }\qquad x=\sqrt{\ \frac{_{_.}a^2+b^2+c^2\ }{2}-c^2\ }\qquad x=\sqrt{\ \frac{_{_.}a^2+b^2-c^2\ }{2}\ }&lt;/math&gt;&lt;/big&gt;

&lt;big&gt;&lt;math&gt;y=\sqrt{_{_.}K-b^2\ }\qquad\ y=\sqrt{\ \frac{_{_.}a^2+b^2+c^2\ }{2}-b^2\ }\qquad y=\sqrt{\ \frac{_{_.}a^2+c^2-b^2\ }{2}\ }&lt;/math&gt;&lt;/big&gt;

&lt;big&gt;&lt;math&gt;z=\sqrt{_{_.}K-a^2\ }\qquad z=\sqrt{\ \frac{_{_.}a^2+b^2+c^2\ }{2}-a^2\ }\qquad z=\sqrt{\ \frac{_{_.}b^2+c^2-a^2\ }{2}\ }&lt;/math&gt;&lt;/big&gt;

&lt;big&gt;&lt;math&gt;It\ is\ interesting\ to\ note\ that\ in\ the\ perk\ column \ that\ all\ 3\ diagonals\ (a,b,c)\ are\ in\ the&lt;/math&gt;&lt;math&gt;numerators\ of\ each\ equation.\ And\ that\ any\ 2\ of\ the\ diagonals\ are\ added\ together\ while&lt;/math&gt;&lt;math&gt;the\ 3rd\ one\ is\ subtrated\ from\ that\ sum.\ And\ the\ solution\ is\ always\ the\ rectangular\ (x,y,z)&lt;/math&gt;&lt;math&gt;mate\ of\ the\ diagonal\ being\ subtracted.\ The\ mating\ pairs\ are\ the\ only\ lines\ that\ never\ touch&lt;/math&gt;&lt;math&gt;each\ other.&lt;/math&gt;&lt;/big&gt;

&lt;big&gt;&lt;math&gt;1)\ \ Subtract\ (c)\ to\ get\ (x)\quad Because\ (c)\ never\ touches\ (x)&lt;/math&gt;&lt;math&gt;2)\ \ Subtract\ (b)\ to\ get\ (y)\quad Because\ (b)\ never\ touches\ (y)&lt;/math&gt;&lt;math&gt;3)\ \ Subtract\ (a)\ to\ get\ (z)\quad Because\ (a)\ never\ touches\ (z)&lt;/math&gt;&lt;/big&gt;

== &lt;math&gt;This\ amazing\ formula\ was\ found\ online\ BUT\ it\ is\ NOT\ my\ own \ work.&lt;/math&gt; ==
&lt;big&gt;&lt;math&gt;BUT\ no\ useable\ proof\ of\ its\ accuracy\ could\ be\ found\ online.&lt;/math&gt;&lt;/big&gt;

=== &lt;big&gt;&lt;math&gt;Original\ form\qquad \frac{1}{\ h^2}=\frac{1}{\ x^2}+\frac{1}{\ y^2}+\frac{1}{\ z^2}&lt;/math&gt;&lt;/big&gt; ===

=== &lt;big&gt;&lt;math&gt;Transposed\ form\quad h=\frac{xyz}{\ \sqrt{\ x^2y^2+z^2\bigl(x^2+y^2\bigr)\ \ }\ \ }&lt;/math&gt;&lt;/big&gt; ===
&lt;big&gt;&lt;math&gt;The\ accuracy\ of\ \bigl(h\bigr)\ will\ be\ proven\ using\ Heron's\ Theorem.&lt;/math&gt;&lt;math&gt;The\ 1_{st}\ diagram\ CaliCat\ 1\ labels\ \bigl(x,y,z\bigr),\ \bigl (a,b,c\bigr)\ and\ \big(h\bigr)&lt;/math&gt;&lt;math&gt;The\ 2_{nd}\ diagram\ CaliCat\ 2\ labels\ \bigl(x,y,z\bigr),\bigl(x_{a},y_{a},z_{a}\bigr),\bigl(a,b,c\bigr)\ and\ \big(h\bigr)&lt;/math&gt;&lt;math&gt;The\ 3_{rd}\ diagram\ CaliCat\ 3\ labels\ \bigl(x,y,z\bigr),\bigl(x_{a},y_{a},z_{a}\bigr), \bigl(a,b,c\bigr)\ and\ \big(h\bigr)\ much\ more\ clearly.&lt;/math&gt;&lt;/big&gt;

&lt;big&gt;&lt;math&gt;\bigl(h\bigr)\ is\ the\ green\ line\ between\ the\ origin\ \bigl(x,y,z\bigr)\ \&amp;\ the\ point\ of\ intersection\ where\ \bigl(x_{a},y_{a},z_{a}\bigr)&lt;/math&gt;&lt;math&gt;meet\ on\ the\ \bigl(a,b,c\bigr)\ plain.\ This\ is\ the\ face\ of\ the\ base.&lt;/math&gt;&lt;/big&gt;
[[File:New Picture (8).png|thumb|490x490px|CaliCat 2]]
.

&lt;big&gt;&lt;math&gt;x_{a}\ is\ the\ adjacent\ of\ \bigl(x,h\bigr)\quad x_{a}=\sqrt{_{.}x^2-h^2\ }&lt;/math&gt;&lt;/big&gt;

&lt;big&gt;&lt;math&gt;y_{a}\ is\ the\ adjacent\ of\ \bigl(y,h\big)\ \quad y_{a}=\sqrt{_{.}y^2-h^2\ }&lt;/math&gt;&lt;/big&gt;

&lt;big&gt;&lt;math&gt;z_{a}\ is\ the\ adjacent\ of\ \bigl(z,h\bigr)\quad\ z_{a}=\sqrt{_{.}z^2-h^2\ }&lt;/math&gt;&lt;/big&gt;

=== &lt;big&gt;&lt;math&gt;Heron's\ Theorem\ is\ applied\ 4\ times.&lt;/math&gt;&lt;/big&gt; ===
&lt;math&gt;S=\frac{\ a+b+c\ }{2}\quad\quad\ H_{abc}=\sqrt{\ S \Bigl(S-a\Bigr)\Bigl(S-b\Bigr)\Bigl(S-c\Bigr)\ }&lt;/math&gt;

&lt;math&gt;S_{a}=\frac{\ a+x_{a}+y_{a}\ }{2}\quad A_{xy}=\sqrt{\ S_{a}\Bigl(S_{a}-a\Bigr)\Bigl(S_{a}-x_{a}\Bigr)\Bigl(S_{a}-y_{a}\Bigr)\ }&lt;/math&gt;

&lt;math&gt;S_{b}=\frac{\ b+x_{a}+z_{a}\ }{2}\ \quad B_{xz}=\sqrt{\ _{_.}S_{b}\Bigl(S_{b}-b\Bigr)\Bigl(S_{b}-x_{a}\Bigr)\Bigl(S_{b}-z_{a}\Bigr)\ }&lt;/math&gt;

&lt;math&gt;S_{c}=\frac{\ c+y_{a}+z_{a}\ }{2}\ \quad C_{yz}=\sqrt{\ _{_.}S_{c}\Bigl(S_{c}-c\Bigr)\Bigl(S_{c}-y_{a}\Bigr)\Bigl(S_{c}-z_{a}\Bigr)\ }&lt;/math&gt;

== . ==
&lt;big&gt;&lt;math&gt;The\ purple\ triangle\ is\ the\ base\ facing\ down\ with\ the\ origin\ \bigl(x,y,z\bigr)\ pointing\ up.\ This\ is\ to&lt;/math&gt;&lt;math&gt;clearly\ show\ how\ the\ height\ \bigl(h\bigr)\ fits\ into\ the\ tetrahedron\ between\ the\ base\ \&amp;\ the\ origin.&lt;/math&gt;&lt;/big&gt;

&lt;big&gt;&lt;math&gt;Where:&lt;/math&gt;&lt;math&gt;X_{(Adjacent)}\ \ x_a=\sqrt{_{_.}x^2-h^2\ }\qquad Y_{(Adjacent)}\ \ y_a=\sqrt{_{_.}y^2-h^2\ }\qquad Z_{(Adjacent)}\ \ z_a =\sqrt{_{_.}z^2-h^2\ }&lt;/math&gt;&lt;/big&gt;

&lt;big&gt;&lt;math&gt;This\ is\ an\ atempt\ to\ show\ why\ \bigl(h\bigr)\ must=\sqrt{\ x^2-{x_{a}}^2\ }=\sqrt{\ y^2-{y_{a}}^2\ }=\sqrt{\ z^2-{z_{a}}^2\ }&lt;/math&gt;&lt;/big&gt;

&lt;big&gt;&lt;math&gt;Or\ the\ sum\ of\ the\ areas\ of\ triangles\ \bigl(a,x_{a},y_{a}\bigr)+\bigl(b,x_{a},z_{a}\bigr)+\bigl(c,y_{a},z_{a}\bigr)\ will\ not\ equal\ the &lt;/math&gt;&lt;math&gt;area\ of\ the\ base.\ Which\ is\ also\ Heron's\ triangle\ \bigl(a,b,c\bigr).\ \ Thus\ h=\frac{xyz}{\ 2A\ }\ where\ A=H_{abc}.&lt;/math&gt;&lt;/big&gt;

&lt;big&gt;&lt;math&gt;Now\ it\ seems\ to\ be\ magical\ to\ know\ that\ the\ height\ \bigl(h\bigr)\ of\ a\ trirectangular\ tetrahedron&lt;/math&gt;&lt;math&gt;is\ simply\ the\ volume\ xyz\ divided\ by\ twice\ the\ base\ area.&lt;/math&gt;&lt;/big&gt;[[File:New Picture (12).png|center|thumb|725x725px|CaliCat 3]]

&lt;big&gt;&lt;math&gt;Here\ the\ formulas\ are\ shown\ once\ again\ BUT\ directly\ under\ the\ clearer\ diagram\ \&amp;\ with&lt;/math&gt;&lt;math&gt;the\ numbers\ that\ apply\ as\ proof\ of\ accuracy.&lt;/math&gt;&lt;/big&gt;

&lt;big&gt;&lt;math&gt;S=\frac{\ a+b+c\ }{2}\quad\quad\ H_{abc}=\sqrt{\ S \Bigl(S-a\Bigr)\Bigl(S-b\Bigr)\Bigl(S-c\Bigr)\ }\qquad\qquad\ \ H_{abc}=59.296664324&lt;/math&gt;&lt;math&gt;S_{a}=\frac{\ a+x_{a}+y_{a}\ }{2}\quad A_{xy}=\sqrt{\ S_{a}\Bigl(S_{a}-a\Bigr)\Bigl(S_{a}-x_{a}\Bigr)\Bigl(S_{a}-y_{a}\Bigr)\ }\qquad A_{xy}=43.280437934&lt;/math&gt;&lt;/big&gt;&lt;big&gt;&lt;math&gt;S_{b}=\frac{\ b+x_{a}+z_{a}\ }{2}\ \quad B_{xz}=\sqrt{\ _{_.}S_{b}\Bigl(S_{b}-b\Bigr)\Bigl(S_{b}-x_{a}\Bigr)\Bigl(S_{b}-z_{a}\Bigr)\ }\qquad\ B_{xz}=6.308860781&lt;/math&gt;&lt;math&gt;S_{c}=\frac{\ c+y_{a}+z_{a}\ }{2}\ \quad C_{yz}=\sqrt{\ _{_.}S_{c}\Bigl(S_{c}-c\Bigr)\Bigl(S_{c}-y_{a}\Bigr)\Bigl(S_{c}-z_{a}\Bigr)\ }\ \ \ \qquad C_{yz}=9.707365609&lt;/math&gt;&lt;/big&gt;

&lt;big&gt;&lt;math&gt;If\ the\ value\ of\ \bigl(h\bigr)\ is\ correct\ then\ Heron's\ Area\ \bigl(A_{abc}\bigr)\ must\ equal\ the\ sum\ of\ the\ other\ 3. &lt;/math&gt;&lt;/big&gt;

&lt;big&gt;&lt;math&gt;H_{abc}=59.296664324=A_{xy}+B_{xz}+C_{yz}=43.280437934\ +6.308860781\ +9.707365609&lt;/math&gt;&lt;/big&gt;

== . ==
&lt;big&gt;&lt;math&gt;Original\ form\quad\frac{1}{\ h^2\ }=\frac{1}{\ x^2\ }+\frac{1}{\ y^2\ }+\frac{1}{\ z^2\ } &lt;/math&gt;&lt;/big&gt;</text>
      <sha1>c7pi0bg6ivk4ozm1zz70cljhtxywv1o</sha1>
    </revision>
    <revision>
      <id>2809859</id>
      <parentid>2809841</parentid>
      <timestamp>2026-05-17T04:30:29Z</timestamp>
      <contributor>
        <username>NguoiDungKhongDinhDanh</username>
        <id>2922842</id>
      </contributor>
      <minor />
      <comment>Reverted edit by [[Special:Contributions/HenriPittier|HenriPittier]] ([[User_talk:HenriPittier|talk]]) to last version by [[User:Tet-Math4|Tet-Math4]] using [[Wikiversity:Rollback|rollback]]</comment>
      <origin>2807435</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="11236" sha1="hg8vaudkzrmm6lbc5j3znblbn55ih94" xml:space="preserve">=== &lt;math&gt;A\ Trirectangular\ Tetrahedron\ is\ a\ tetrahedron\ where\ the\ Origin\bigl(x,y,z\bigr)\ is\ composed\ of &lt;/math&gt;&lt;math&gt;3\ Right\ Angled\ Triangles.\ There\ are\ Five\ Hidden\ mathematical\ equalities\ in\ Trirectangular  &lt;/math&gt;&lt;math&gt;Tetrahedrons.\ They\ exist\ only\ in\ these\ types\ of\ tetrahedrons.  &lt;/math&gt; ===

== . ==

=== &lt;big&gt;&lt;math&gt;Here\ are\ the\ Five\ Hidden\ Equalities\ and\ they\ are\ magical.&lt;/math&gt;&lt;/big&gt; ===

=== &lt;big&gt;&lt;math&gt;K=\Biggl[\frac{\ a^2+b^2+c^2}{2}\Biggr]=\Bigl[x^2+y^2+z^2\Bigr]=\Bigl[a^2+z^2\Bigr]=\Bigl[b^2+y^2\Bigr]=\Bigl[c^2+x^2\Bigr]&lt;/math&gt;&lt;/big&gt; ===
'''&lt;big&gt;&lt;math&gt;If\ given\ \bigl(a,b,c\bigr)\ use\ the\ 1st\ term\ K=\frac{\ a^2+b^2+c^2}{2}\ \ This\ equation\ is\ a\ modification\ of &lt;/math&gt;&lt;/big&gt;'''&lt;big&gt;&lt;math&gt;Heron's\ Semiperimeter.\ Then\ use\ \bigl(a,b,c\bigr)\ to\ calculate\ \bigl(x,y,z\bigr)\ as\ shown\ beneath\ this\ diagram.&lt;/math&gt;&lt;/big&gt;[[File:(ABC) = (XYZ).png|thumb|708x708px|CaliCat 1]]

=== &lt;math&gt;K\ equals\ all\ 5\ equations.&lt;/math&gt; ===

=== &lt;big&gt;&lt;math&gt;K=\frac{\ a^2+b^2+c^2}{2}&lt;/math&gt;&lt;/big&gt; ===

=== &lt;big&gt;&lt;math&gt;K=x^2+y^2+z^2&lt;/math&gt;&lt;/big&gt; ===

=== &lt;big&gt;''&lt;math&gt;K=a^2+z^2\qquad\ Blue&lt;/math&gt;''&lt;/big&gt; ===

=== &lt;big&gt;''&lt;math&gt;K=b^2+y^2\qquad\ Black&lt;/math&gt;''&lt;/big&gt; ===

=== &lt;big&gt;''&lt;math&gt;K=c^2+x^2\qquad\ Red&lt;/math&gt;''&lt;/big&gt; ===
''.&lt;big&gt;And they interlock in such a way that they greatly simplify solving Trirectangular problems. Here the mating pairs are color coded for easy understanding.&lt;/big&gt;''

&lt;big&gt;''The other way to remember which diagonal line'' (''a,b,c'') ''mates with it's rectangular counterpart'' (''x,y,z'') ''is to realize the mating pairs are the only lines that never touch each other'' !&lt;/big&gt;

&lt;big&gt;&lt;math&gt;Thus\ A\ \ Mates\ only\ with\ Z\ \ Blue&lt;/math&gt;&lt;math&gt;\qquad\ \ B\ \ Mates\ only\ with\ Y\ \ Black&lt;/math&gt;&lt;math&gt;\qquad\ \ C\ \ Mates\ only\ with\ X\ \ Red&lt;/math&gt;&lt;/big&gt;

== .&lt;math&gt;IF\ \ given\ \ \bigl(a,b,c\bigr)\ \ then\ \ use\ \ K=\biggl[\frac{\ a^2+b^2+c^2}{2}\biggr]\ \ to\ calculate\ \ \bigl(x,y,z\bigr)&lt;/math&gt;&lt;math&gt;Then\ \ x=\sqrt{_{_.}K-c^2\ }\qquad\ y=\sqrt{_{_.}K-b^2\ }\qquad\ z=\sqrt{_{_.}K-a^2\ }&lt;/math&gt; ==

=== &lt;big&gt;&lt;math&gt;IF\ \ Given\ \bigl(x,y,z\bigr)\ \ then\ \ use\ \ K=\Bigl[x^2+y^2+z^2\Bigr]\ \ to\ calculate\ \bigl(a,b,c\bigr)&lt;/math&gt;&lt;/big&gt; ===

=== &lt;big&gt;&lt;math&gt;Then\quad a=\sqrt{_{_.}K-z^2\ }\qquad b=\sqrt{\ K-y^2\ }\qquad\ c=\sqrt{_{_.}K-x^2\ }&lt;/math&gt;&lt;/big&gt; ===

=== &lt;big&gt;&lt;math&gt;Or:\quad\ a=\sqrt{_{_.}x^2+y^2\ }\qquad b=\sqrt{_{_.}x^2+z^2\ }\qquad c=\sqrt{_{_.}y^2+z^2\ }&lt;/math&gt;&lt;/big&gt; ===

== . ==

=== &lt;big&gt;&lt;math&gt;Proof\ of\ the\ accuracy\ of\ the\ K\ formulas.\ Try\ these\ test\ numbers\ yourself.&lt;/math&gt;&lt;/big&gt; ===

=== &lt;math&gt;Given:\qquad a=14.4\qquad b=10\qquad c=12&lt;/math&gt;&lt;big&gt;&lt;math&gt;Then\ use\ the\ Pythagorean\ Theorem\ to\ Calculate\ (x,y,z)&lt;/math&gt;&lt;/big&gt; ===

=== &lt;math&gt;K=\frac{\ a^2+b^2+c^2}{2}=225.68&lt;/math&gt; ===

=== &lt;math&gt;K=x^2+y^2+z^2\ \ =225.68&lt;/math&gt;&lt;math&gt;K=a^2+z^2\qquad\ \ \ =225.68\quad\bigl(a=14.4\quad z=4.280186911806539319650461\bigr)&lt;/math&gt;&lt;math&gt;K=b^2+y^2\qquad\ \ \ =225.68\quad\bigl(b=10\quad \ \ \ \ y=11.210709165793214885544255\bigr)&lt;/math&gt;&lt;math&gt;K=c^2+x^2\qquad\ \ \ =225.68\quad\bigl(c=12\quad \ \ \ \ x=9.037698822156002781875821\bigr)&lt;/math&gt; ===

== . ==

=== &lt;math&gt;The\ area\ of\ the\ Base\ Triangle\ derived\ by\ using\ \bigl(x,y,z\bigr)\ \&amp;\ directly\ below\ that\ by\ using\ \bigl(a,b,c\bigr)&lt;/math&gt;&lt;math&gt;The\ \bigl(H\bigr)_{abc}\ designation\ is\ used\ to\ identify\ it\ as\ Heron's\ Triangle.\ \bigl(The\ BASE\ triangle\bigr)&lt;/math&gt;. ===

=== &lt;math&gt;Rectangular\ (x,y,z) \quad H_{abc}=\frac{\ \ \sqrt{\ x^2y^2+z^2\bigl(x^2+y^2\bigr)\ }\ \ }{2_{.}}&lt;/math&gt;&lt;math&gt;Heron's\ Theorem\qquad H_{abc}=\sqrt{\ S(S-a)(S-b)(S-c)\ }\quad where\ \ S=\frac{\ a+b+c\ }{2}&lt;/math&gt; ===

== . ==

=== &lt;math&gt;Height\ of\ Tetrahedron\ from\ Base\ of\ Heron's\ Triangle\ H_{abc}\ to\ the\ origin\ \bigl(x,y,z\bigr)&lt;/math&gt;&lt;math&gt;This\ amazing\ equation\ was\ found\ on\ the\ internet.\ It\ is\ not\ my\ own\ work\ !&lt;/math&gt;&lt;math&gt;It\ is\ accurate\ and\ I\ Reworked\ it\ from\ its\ original\ form.\ \bigl(See\ Original\ Form\ at\ the\ bottom\ \bigr)&lt;/math&gt;. ===

=== ''&lt;big&gt;&lt;math&gt;h=\frac{xyz}{\ \sqrt{\ x^2y^2+z^2\bigl(x^2+y^2\bigr)\ \ }\ \ }&lt;/math&gt;&lt;/big&gt;''  &lt;ref&gt;{{Cite web|url=https://en.wikipedia.org/wiki/Trirectangular_tetrahedron|title=Trirectangular tetrahedron - Metric formulas}}&lt;/ref&gt; &lt;ref&gt;{{Cite web|url=https://www.formuladen.com/en/|title=Formula Den}}&lt;/ref&gt; ===

=== &lt;big&gt;&lt;math&gt;Areas:&lt;/math&gt;&lt;math&gt;A_{xy}=\frac{\ xy\ }{2}\qquad B_{xz}=\frac{\ xz\ }{2}\qquad C_{yz}=\frac{\ yz\ }{2}\qquad H_{abc}=\frac{\ \sqrt{\ x^2y^2+z^2\bigl(x^2+y^2\bigr)\ }\ \ }{2}&lt;/math&gt;&lt;/big&gt; ===

=== &lt;math&gt;A_{total}=A_{xy}+B_{xz}+C_{yz}+H_{abc}&lt;/math&gt; ===

=== &lt;big&gt;&lt;math&gt;A_{total}=\frac{\ xy+z(x+y)+\sqrt{\ x^2y^2+z^2\bigl(x^2+y^2\bigr)\ }\ \ }{2}&lt;/math&gt;&lt;/big&gt; ===

== . ==

=== &lt;big&gt;&lt;math&gt;Volume:&lt;/math&gt;&lt;/big&gt; ===

=== &lt;math&gt;V_{box}=xyz\qquad V_{tet}=\frac{\ V_{box}\ }{6}\qquad V_{tet}=\frac{\ xyz\ }{6}&lt;/math&gt; ===

=== . ===
&lt;big&gt;&lt;math&gt;The\ similar\ appearence\ between\ Heron's\ semiperimeter\ \&amp;\ its\ K\ substitute\ is\ obvious. &lt;/math&gt;&lt;math&gt;Heron's\ \ Theorem\qquad\ Trirectangular\ \ Theorem\ (?)&lt;/math&gt;&lt;/big&gt;

=== &lt;big&gt;&lt;math&gt;S=\frac{\ a+b+c\ }{2}\qquad K=\frac{\ a^2+b^2+c^2\ }{2}&lt;/math&gt;&lt;/big&gt; ===
.

== &lt;math&gt;Interesting\ Items&lt;/math&gt; ==

=== &lt;big&gt;&lt;math&gt;K\ solutions\qquad\qquad\quad Transition\qquad\qquad\quad Perk\ solutions &lt;/math&gt;&lt;/big&gt; ===
&lt;big&gt;&lt;math&gt;x=\sqrt{_{_.}K-c^2\ }\qquad x=\sqrt{\ \frac{_{_.}a^2+b^2+c^2\ }{2}-c^2\ }\qquad x=\sqrt{\ \frac{_{_.}a^2+b^2-c^2\ }{2}\ }&lt;/math&gt;&lt;/big&gt;

&lt;big&gt;&lt;math&gt;y=\sqrt{_{_.}K-b^2\ }\qquad\ y=\sqrt{\ \frac{_{_.}a^2+b^2+c^2\ }{2}-b^2\ }\qquad y=\sqrt{\ \frac{_{_.}a^2+c^2-b^2\ }{2}\ }&lt;/math&gt;&lt;/big&gt;

&lt;big&gt;&lt;math&gt;z=\sqrt{_{_.}K-a^2\ }\qquad z=\sqrt{\ \frac{_{_.}a^2+b^2+c^2\ }{2}-a^2\ }\qquad z=\sqrt{\ \frac{_{_.}b^2+c^2-a^2\ }{2}\ }&lt;/math&gt;&lt;/big&gt;

&lt;big&gt;&lt;math&gt;It\ is\ interesting\ to\ note\ that\ in\ the\ perk\ column \ that\ all\ 3\ diagonals\ (a,b,c)\ are\ in\ the&lt;/math&gt;&lt;math&gt;numerators\ of\ each\ equation.\ And\ that\ any\ 2\ of\ the\ diagonals\ are\ added\ together\ while&lt;/math&gt;&lt;math&gt;the\ 3rd\ one\ is\ subtrated\ from\ that\ sum.\ And\ the\ solution\ is\ always\ the\ rectangular\ (x,y,z)&lt;/math&gt;&lt;math&gt;mate\ of\ the\ diagonal\ being\ subtracted.\ The\ mating\ pairs\ are\ the\ only\ lines\ that\ never\ touch&lt;/math&gt;&lt;math&gt;each\ other.&lt;/math&gt;&lt;/big&gt;

&lt;big&gt;&lt;math&gt;1)\ \ Subtract\ (c)\ to\ get\ (x)\quad Because\ (c)\ never\ touches\ (x)&lt;/math&gt;&lt;math&gt;2)\ \ Subtract\ (b)\ to\ get\ (y)\quad Because\ (b)\ never\ touches\ (y)&lt;/math&gt;&lt;math&gt;3)\ \ Subtract\ (a)\ to\ get\ (z)\quad Because\ (a)\ never\ touches\ (z)&lt;/math&gt;&lt;/big&gt;

== &lt;math&gt;This\ amazing\ formula\ was\ found\ online\ BUT\ it\ is\ NOT\ my\ own \ work.&lt;/math&gt; ==
&lt;big&gt;&lt;math&gt;BUT\ no\ useable\ proof\ of\ its\ accuracy\ could\ be\ found\ online.&lt;/math&gt;&lt;/big&gt;

=== &lt;big&gt;&lt;math&gt;Original\ form\qquad \frac{1}{\ h^2}=\frac{1}{\ x^2}+\frac{1}{\ y^2}+\frac{1}{\ z^2}&lt;/math&gt;&lt;/big&gt; ===

=== &lt;big&gt;&lt;math&gt;Transposed\ form\quad h=\frac{xyz}{\ \sqrt{\ x^2y^2+z^2\bigl(x^2+y^2\bigr)\ \ }\ \ }&lt;/math&gt;&lt;/big&gt; ===
&lt;big&gt;&lt;math&gt;The\ accuracy\ of\ \bigl(h\bigr)\ will\ be\ proven\ using\ Heron's\ Theorem.&lt;/math&gt;&lt;math&gt;The\ 1_{st}\ diagram\ CaliCat\ 1\ labels\ \bigl(x,y,z\bigr),\ \bigl (a,b,c\bigr)\ and\ \big(h\bigr)&lt;/math&gt;&lt;math&gt;The\ 2_{nd}\ diagram\ CaliCat\ 2\ labels\ \bigl(x,y,z\bigr),\bigl(x_{a},y_{a},z_{a}\bigr),\bigl(a,b,c\bigr)\ and\ \big(h\bigr)&lt;/math&gt;&lt;math&gt;The\ 3_{rd}\ diagram\ CaliCat\ 3\ labels\ \bigl(x,y,z\bigr),\bigl(x_{a},y_{a},z_{a}\bigr), \bigl(a,b,c\bigr)\ and\ \big(h\bigr)\ much\ more\ clearly.&lt;/math&gt;&lt;/big&gt;

&lt;big&gt;&lt;math&gt;\bigl(h\bigr)\ is\ the\ green\ line\ between\ the\ origin\ \bigl(x,y,z\bigr)\ \&amp;\ the\ point\ of\ intersection\ where\ \bigl(x_{a},y_{a},z_{a}\bigr)&lt;/math&gt;&lt;math&gt;meet\ on\ the\ \bigl(a,b,c\bigr)\ plain.\ This\ is\ the\ face\ of\ the\ base.&lt;/math&gt;&lt;/big&gt;
[[File:New Picture (8).png|thumb|490x490px|CaliCat 2]]
.

&lt;big&gt;&lt;math&gt;x_{a}\ is\ the\ adjacent\ of\ \bigl(x,h\bigr)\quad x_{a}=\sqrt{_{.}x^2-h^2\ }&lt;/math&gt;&lt;/big&gt;

&lt;big&gt;&lt;math&gt;y_{a}\ is\ the\ adjacent\ of\ \bigl(y,h\big)\ \quad y_{a}=\sqrt{_{.}y^2-h^2\ }&lt;/math&gt;&lt;/big&gt;

&lt;big&gt;&lt;math&gt;z_{a}\ is\ the\ adjacent\ of\ \bigl(z,h\bigr)\quad\ z_{a}=\sqrt{_{.}z^2-h^2\ }&lt;/math&gt;&lt;/big&gt;

=== &lt;big&gt;&lt;math&gt;Heron's\ Theorem\ is\ applied\ 4\ times.&lt;/math&gt;&lt;/big&gt; ===
&lt;math&gt;S=\frac{\ a+b+c\ }{2}\quad\quad\ H_{abc}=\sqrt{\ S \Bigl(S-a\Bigr)\Bigl(S-b\Bigr)\Bigl(S-c\Bigr)\ }&lt;/math&gt;

&lt;math&gt;S_{a}=\frac{\ a+x_{a}+y_{a}\ }{2}\quad A_{xy}=\sqrt{\ S_{a}\Bigl(S_{a}-a\Bigr)\Bigl(S_{a}-x_{a}\Bigr)\Bigl(S_{a}-y_{a}\Bigr)\ }&lt;/math&gt;

&lt;math&gt;S_{b}=\frac{\ b+x_{a}+z_{a}\ }{2}\ \quad B_{xz}=\sqrt{\ _{_.}S_{b}\Bigl(S_{b}-b\Bigr)\Bigl(S_{b}-x_{a}\Bigr)\Bigl(S_{b}-z_{a}\Bigr)\ }&lt;/math&gt;

&lt;math&gt;S_{c}=\frac{\ c+y_{a}+z_{a}\ }{2}\ \quad C_{yz}=\sqrt{\ _{_.}S_{c}\Bigl(S_{c}-c\Bigr)\Bigl(S_{c}-y_{a}\Bigr)\Bigl(S_{c}-z_{a}\Bigr)\ }&lt;/math&gt;

== . ==
&lt;big&gt;&lt;math&gt;The\ purple\ triangle\ is\ the\ base\ facing\ down\ with\ the\ origin\ \bigl(x,y,z\bigr)\ pointing\ up.\ This\ is\ to&lt;/math&gt;&lt;math&gt;clearly\ show\ how\ the\ height\ \bigl(h\bigr)\ fits\ into\ the\ tetrahedron\ between\ the\ base\ \&amp;\ the\ origin.&lt;/math&gt;&lt;/big&gt;

&lt;big&gt;&lt;math&gt;Where:&lt;/math&gt;&lt;math&gt;X_{(Adjacent)}\ \ x_a=\sqrt{_{_.}x^2-h^2\ }\qquad Y_{(Adjacent)}\ \ y_a=\sqrt{_{_.}y^2-h^2\ }\qquad Z_{(Adjacent)}\ \ z_a =\sqrt{_{_.}z^2-h^2\ }&lt;/math&gt;&lt;/big&gt;

&lt;big&gt;&lt;math&gt;This\ is\ an\ atempt\ to\ show\ why\ \bigl(h\bigr)\ must=\sqrt{\ x^2-{x_{a}}^2\ }=\sqrt{\ y^2-{y_{a}}^2\ }=\sqrt{\ z^2-{z_{a}}^2\ }&lt;/math&gt;&lt;/big&gt;

&lt;big&gt;&lt;math&gt;Or\ the\ sum\ of\ the\ areas\ of\ triangles\ \bigl(a,x_{a},y_{a}\bigr)+\bigl(b,x_{a},z_{a}\bigr)+\bigl(c,y_{a},z_{a}\bigr)\ will\ not\ equal\ the &lt;/math&gt;&lt;math&gt;area\ of\ the\ base.\ Which\ is\ also\ Heron's\ triangle\ \bigl(a,b,c\bigr).\ \ Thus\ h=\frac{xyz}{\ 2A\ }\ where\ A=H_{abc}.&lt;/math&gt;&lt;/big&gt;

&lt;big&gt;&lt;math&gt;Now\ it\ seems\ to\ be\ magical\ to\ know\ that\ the\ height\ \bigl(h\bigr)\ of\ a\ trirectangular\ tetrahedron&lt;/math&gt;&lt;math&gt;is\ simply\ the\ volume\ xyz\ divided\ by\ twice\ the\ base\ area.&lt;/math&gt;&lt;/big&gt;[[File:New Picture (12).png|center|thumb|725x725px|CaliCat 3]]

&lt;big&gt;&lt;math&gt;Here\ the\ formulas\ are\ shown\ once\ again\ BUT\ directly\ under\ the\ clearer\ diagram\ \&amp;\ with&lt;/math&gt;&lt;math&gt;the\ numbers\ that\ apply\ as\ proof\ of\ accuracy.&lt;/math&gt;&lt;/big&gt;

&lt;big&gt;&lt;math&gt;S=\frac{\ a+b+c\ }{2}\quad\quad\ H_{abc}=\sqrt{\ S \Bigl(S-a\Bigr)\Bigl(S-b\Bigr)\Bigl(S-c\Bigr)\ }\qquad\qquad\ \ H_{abc}=59.296664324&lt;/math&gt;&lt;math&gt;S_{a}=\frac{\ a+x_{a}+y_{a}\ }{2}\quad A_{xy}=\sqrt{\ S_{a}\Bigl(S_{a}-a\Bigr)\Bigl(S_{a}-x_{a}\Bigr)\Bigl(S_{a}-y_{a}\Bigr)\ }\qquad A_{xy}=43.280437934&lt;/math&gt;&lt;/big&gt;&lt;big&gt;&lt;math&gt;S_{b}=\frac{\ b+x_{a}+z_{a}\ }{2}\ \quad B_{xz}=\sqrt{\ _{_.}S_{b}\Bigl(S_{b}-b\Bigr)\Bigl(S_{b}-x_{a}\Bigr)\Bigl(S_{b}-z_{a}\Bigr)\ }\qquad\ B_{xz}=6.308860781&lt;/math&gt;&lt;math&gt;S_{c}=\frac{\ c+y_{a}+z_{a}\ }{2}\ \quad C_{yz}=\sqrt{\ _{_.}S_{c}\Bigl(S_{c}-c\Bigr)\Bigl(S_{c}-y_{a}\Bigr)\Bigl(S_{c}-z_{a}\Bigr)\ }\ \ \ \qquad C_{yz}=9.707365609&lt;/math&gt;&lt;/big&gt;

&lt;big&gt;&lt;math&gt;If\ the\ value\ of\ \bigl(h\bigr)\ is\ correct\ then\ Heron's\ Area\ \bigl(A_{abc}\bigr)\ must\ equal\ the\ sum\ of\ the\ other\ 3. &lt;/math&gt;&lt;/big&gt;

&lt;big&gt;&lt;math&gt;H_{abc}=59.296664324=A_{xy}+B_{xz}+C_{yz}=43.280437934\ +6.308860781\ +9.707365609&lt;/math&gt;&lt;/big&gt;

== . ==
&lt;big&gt;&lt;math&gt;Original\ form\quad\frac{1}{\ h^2\ }=\frac{1}{\ x^2\ }+\frac{1}{\ y^2\ }+\frac{1}{\ z^2\ } &lt;/math&gt;&lt;/big&gt;</text>
      <sha1>hg8vaudkzrmm6lbc5j3znblbn55ih94</sha1>
    </revision>
  </page>
  <page>
    <title>Intuitive Calculus</title>
    <ns>0</ns>
    <id>329025</id>
    <revision>
      <id>2809672</id>
      <parentid>2809399</parentid>
      <timestamp>2026-05-16T17:59:33Z</timestamp>
      <contributor>
        <username>Atcovi</username>
        <id>276019</id>
      </contributor>
      <comment>/* Adequality */ +5/16/2026</comment>
      <origin>2809672</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="7495" sha1="g33eomwrdk61oc9yodl68vcir45ha33" xml:space="preserve">{{mathematics}}'''&lt;u&gt;Book&lt;/u&gt;''': ''Infinite Powers'' by Steven Strogatz (ISBN#: 1328879984){{tertiary}}
{{Notes}}
{{juststarted}}
{{contrib-creator|[[User:Atcovi|Atcovi]]}}
== Notes ==
[[File:Parts of Parabola.svg|thumb|A diagram of a parabola.]]

=== 4/11/2026 ===
* Archimedes and figuring out the ''quadratic'' (or computation of the area) of a parabolic segment. This is just basically spamming smaller triangles into a [[parabola]] to equal one big triangle (&lt;math display=&quot;inline&quot;&gt;=1&lt;/math&gt;) in order to figure out the area.

Total area of a parabolic segment from Archimedes findings: &lt;math display=&quot;inline&quot;&gt;1&lt;/math&gt; + &lt;math display=&quot;inline&quot;&gt;1/4&lt;/math&gt; + &lt;math display=&quot;inline&quot;&gt;1/16&lt;/math&gt; + &lt;math display=&quot;inline&quot;&gt;1/64&lt;/math&gt; ← geometric series.

^each term is &lt;math display=&quot;inline&quot;&gt;1/4&lt;/math&gt; of the term preceding it as the daughter triangles always contribute a total of 1 quarter as much area as their parents do. 

Archimedes proved that &lt;math display=&quot;inline&quot;&gt;a = 4/3&lt;/math&gt; through a '''double reductio ad absurdum'''&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=36}}&lt;/ref&gt; using the '''method of exhaustion''', an analytical way of finding a result&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=102}}&lt;/ref&gt;.

=== 5/2/2026 ===

==== [[w:Johannes_Kepler|Johannes Kepler]] ====

# '''[[w:Elliptic orbit|Elliptical orbits]]'''
#*'''Ellipse''': Plane curve where the sum of distances from any point on the curve to two fixed points (foci) is constant. For example, a circle is a type of ellipse. A circle is a set of points where distance from a given point (aka its center) is constant. Kepler stated that all planets follow an elliptical orbit. 
# '''[https://www.socratica.com/pages/keplers-second-law-of-motion Equal Areas in Equal Times]'''
#*'''Formula''': Time (P&lt;sub&gt;1&lt;/sub&gt; → P&lt;sub&gt;2&lt;/sub&gt;) = Time (P&lt;sub&gt;3&lt;/sub&gt; → P&lt;sub&gt;4&lt;/sub&gt;) [their sectors have equal areas]
# '''Third Law and the Sacred Frenzy'''&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=84}}&lt;/ref&gt;
#*&lt;math display=&quot;inline&quot;&gt;T&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt; = &lt;math display=&quot;inline&quot;&gt;a&lt;/math&gt;&lt;sup&gt;3&lt;/sup&gt;
#**&lt;math display=&quot;inline&quot;&gt;T&lt;/math&gt; = how long it takes for a planet to go around the sun just once.
#**&lt;math display=&quot;inline&quot;&gt;A&lt;/math&gt; = avg. of the planet's nearest and farthest distance from the sun.

=== 5/14/2026 ===
* '''[[w:Differential_calculus|Differential calculus]]:''' cuts complicated problems into infinitely many simpler pieces. Ex, derivatives. 
* '''[[w:Integral_calculus|Integral calculus]]''': puts the pieces back together again to solve the original problem. Ex, integrals. 
[[File:Tangent function animation.gif|thumb|The derivative at different points of a differentiable function. In this case, the derivative is equal to &lt;math&gt;\sin \left(x^2\right) + 2x^2 \cos\left(x^2\right)&lt;/math&gt;.&lt;ref&gt;{{Cite journal|date=2026-04-13|title=Derivative|url=https://en.wikipedia.org/w/index.php?title=Derivative&amp;oldid=1348562692|journal=Wikipedia|language=en}}&lt;/ref&gt;]]
[[File:Cartesian-coordinate-system.svg|thumb|This is known as a ''Cartesian coordinate system''.|left]]
* '''[[w:Analytical_geometry|Analytical geometry]]''': Also known as Cartesian geometry, is geometry using a coordinate system (pictured towards the left). Analytical geometry is used in physics, engineering, and aviation. &quot;Analysis&quot; in analytic geometry is meant to be understood as a way of ''figuring out'' the results rather than proving the results&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=101}}&lt;/ref&gt;. 
==== Adequality ====
''See pages 103 to 107, which provide a breakdown of [[w:Pierre_de_Fermat|Pierre de Fermat]] and his concept of adequality.''

Pierre de Fermat's concept of adequality (meaning ''approximate equality''&lt;ref&gt;{{Cite journal|date=2024-09-18|title=Number Theory: An Approach Through History from Hammurapi to Legendre|url=https://en.wikipedia.org/w/index.php?title=Number_Theory:_An_Approach_Through_History_from_Hammurapi_to_Legendre&amp;oldid=1246411217|journal=Wikipedia|language=en}}&lt;/ref&gt;) was a way of finding the maxima, minima, tangents, and other problems in calculus. For example, two nearly equal values, [let's say] ''a'' and ''b'' at the maximum of a parabola, are used to find the maxima of a parabola through a small 'nudge' in the variable&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=106}}&lt;/ref&gt;.

Fermat's ideas eventually led to the concept of derivatives (illustrated towards the right) in modern calculus. 
{{Notice|1=
'''5/14/2026''' - STOPPING POINT&lt;br&gt;
To watch for later: https://www.youtube.com/watch?v=AOKoo_nQSts (6:01)

To read for later: https://digitalcommons.ursinus.edu/cgi/viewcontent.cgi?params=/context/triumphs_calculus/article/1011/&amp;path_info=M05_Fermats_Method_for_Finding_Maxima_and_Minima_2022_05_17.pdf&amp;cs=1&amp;hl=en-US&amp;biw=1280&amp;bih=631.3333740234375}}
=== 5/16/2026 (continuation of Fermat's adequality) ===
What is the purpose of the equation (see https://youtube.com/AOKoo_nQSts?si=1RfOYMAHm-Ll5sVT&amp;t [minute 4:17] for context/writing of this equation): &lt;math display=&quot;inline&quot;&gt;bx&lt;/math&gt; - &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt; = &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt;?

If we take a line (total = &lt;math display=&quot;inline&quot;&gt;b&lt;/math&gt;), and make a cut at some point in the line (and designate the cut 'mark' as &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;), how could we figure out &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt; (output produced by the equation, &lt;math display=&quot;inline&quot;&gt;bx&lt;/math&gt; - &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt; = &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt;)? 

&lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt; represents a portion of the line, while &lt;math display=&quot;inline&quot;&gt;b - x&lt;/math&gt; represents the remaining portion of the line. The product of both &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt; and &lt;math display=&quot;inline&quot;&gt;b - x&lt;/math&gt; is &lt;math display=&quot;inline&quot;&gt;bx&lt;/math&gt; - &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt;. The goal is to find the value of &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt; that would produce the highest &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt; value. 
== Wikipedia/Study Links ==
[[w:Archimedes|'''Archimedes''']]
* [[w:Approximations_of_pi|approximations of pi]]
* quadrature (computation of area) of a parabolic segment
* [[w:Archimedes_Palimpsest|''Archimedes Palimpsest'']]
* [https://math.nyu.edu/Archimedes/Lever/LeverLaw.html Archimedes' Law of the Lever]

== See Also ==
* [[User:Addemf/sandbox/Who Invented Calculus?]]

== References/Sources ==
[[Category:Atcovi's Work]]
[[Category:Calculus]]</text>
      <sha1>g33eomwrdk61oc9yodl68vcir45ha33</sha1>
    </revision>
    <revision>
      <id>2809676</id>
      <parentid>2809672</parentid>
      <timestamp>2026-05-16T18:06:23Z</timestamp>
      <contributor>
        <username>Atcovi</username>
        <id>276019</id>
      </contributor>
      <comment>/* 5/16/2026 (continuation of Fermat's adequality) */</comment>
      <origin>2809676</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="7749" sha1="4liz5npvtyoymid27rufc3fxcxyti09" xml:space="preserve">{{mathematics}}'''&lt;u&gt;Book&lt;/u&gt;''': ''Infinite Powers'' by Steven Strogatz (ISBN#: 1328879984){{tertiary}}
{{Notes}}
{{juststarted}}
{{contrib-creator|[[User:Atcovi|Atcovi]]}}
== Notes ==
[[File:Parts of Parabola.svg|thumb|A diagram of a parabola.]]

=== 4/11/2026 ===
* Archimedes and figuring out the ''quadratic'' (or computation of the area) of a parabolic segment. This is just basically spamming smaller triangles into a [[parabola]] to equal one big triangle (&lt;math display=&quot;inline&quot;&gt;=1&lt;/math&gt;) in order to figure out the area.

Total area of a parabolic segment from Archimedes findings: &lt;math display=&quot;inline&quot;&gt;1&lt;/math&gt; + &lt;math display=&quot;inline&quot;&gt;1/4&lt;/math&gt; + &lt;math display=&quot;inline&quot;&gt;1/16&lt;/math&gt; + &lt;math display=&quot;inline&quot;&gt;1/64&lt;/math&gt; ← geometric series.

^each term is &lt;math display=&quot;inline&quot;&gt;1/4&lt;/math&gt; of the term preceding it as the daughter triangles always contribute a total of 1 quarter as much area as their parents do. 

Archimedes proved that &lt;math display=&quot;inline&quot;&gt;a = 4/3&lt;/math&gt; through a '''double reductio ad absurdum'''&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=36}}&lt;/ref&gt; using the '''method of exhaustion''', an analytical way of finding a result&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=102}}&lt;/ref&gt;.

=== 5/2/2026 ===

==== [[w:Johannes_Kepler|Johannes Kepler]] ====

# '''[[w:Elliptic orbit|Elliptical orbits]]'''
#*'''Ellipse''': Plane curve where the sum of distances from any point on the curve to two fixed points (foci) is constant. For example, a circle is a type of ellipse. A circle is a set of points where distance from a given point (aka its center) is constant. Kepler stated that all planets follow an elliptical orbit. 
# '''[https://www.socratica.com/pages/keplers-second-law-of-motion Equal Areas in Equal Times]'''
#*'''Formula''': Time (P&lt;sub&gt;1&lt;/sub&gt; → P&lt;sub&gt;2&lt;/sub&gt;) = Time (P&lt;sub&gt;3&lt;/sub&gt; → P&lt;sub&gt;4&lt;/sub&gt;) [their sectors have equal areas]
# '''Third Law and the Sacred Frenzy'''&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=84}}&lt;/ref&gt;
#*&lt;math display=&quot;inline&quot;&gt;T&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt; = &lt;math display=&quot;inline&quot;&gt;a&lt;/math&gt;&lt;sup&gt;3&lt;/sup&gt;
#**&lt;math display=&quot;inline&quot;&gt;T&lt;/math&gt; = how long it takes for a planet to go around the sun just once.
#**&lt;math display=&quot;inline&quot;&gt;A&lt;/math&gt; = avg. of the planet's nearest and farthest distance from the sun.

=== 5/14/2026 ===
* '''[[w:Differential_calculus|Differential calculus]]:''' cuts complicated problems into infinitely many simpler pieces. Ex, derivatives. 
* '''[[w:Integral_calculus|Integral calculus]]''': puts the pieces back together again to solve the original problem. Ex, integrals. 
[[File:Tangent function animation.gif|thumb|The derivative at different points of a differentiable function. In this case, the derivative is equal to &lt;math&gt;\sin \left(x^2\right) + 2x^2 \cos\left(x^2\right)&lt;/math&gt;.&lt;ref&gt;{{Cite journal|date=2026-04-13|title=Derivative|url=https://en.wikipedia.org/w/index.php?title=Derivative&amp;oldid=1348562692|journal=Wikipedia|language=en}}&lt;/ref&gt;]]
[[File:Cartesian-coordinate-system.svg|thumb|This is known as a ''Cartesian coordinate system''.|left]]
* '''[[w:Analytical_geometry|Analytical geometry]]''': Also known as Cartesian geometry, is geometry using a coordinate system (pictured towards the left). Analytical geometry is used in physics, engineering, and aviation. &quot;Analysis&quot; in analytic geometry is meant to be understood as a way of ''figuring out'' the results rather than proving the results&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=101}}&lt;/ref&gt;. 
==== Adequality ====
''See pages 103 to 107, which provide a breakdown of [[w:Pierre_de_Fermat|Pierre de Fermat]] and his concept of adequality.''

Pierre de Fermat's concept of adequality (meaning ''approximate equality''&lt;ref&gt;{{Cite journal|date=2024-09-18|title=Number Theory: An Approach Through History from Hammurapi to Legendre|url=https://en.wikipedia.org/w/index.php?title=Number_Theory:_An_Approach_Through_History_from_Hammurapi_to_Legendre&amp;oldid=1246411217|journal=Wikipedia|language=en}}&lt;/ref&gt;) was a way of finding the maxima, minima, tangents, and other problems in calculus. For example, two nearly equal values, [let's say] ''a'' and ''b'' at the maximum of a parabola, are used to find the maxima of a parabola through a small 'nudge' in the variable&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=106}}&lt;/ref&gt;.

Fermat's ideas eventually led to the concept of derivatives (illustrated towards the right) in modern calculus. 
{{Notice|1=
'''5/14/2026''' - STOPPING POINT&lt;br&gt;
To watch for later: https://www.youtube.com/watch?v=AOKoo_nQSts (6:01)

To read for later: https://digitalcommons.ursinus.edu/cgi/viewcontent.cgi?params=/context/triumphs_calculus/article/1011/&amp;path_info=M05_Fermats_Method_for_Finding_Maxima_and_Minima_2022_05_17.pdf&amp;cs=1&amp;hl=en-US&amp;biw=1280&amp;bih=631.3333740234375}}
=== 5/16/2026 (continuation of Fermat's adequality) ===
[[File:Week 9 Fermat and Adequality Proto-Calculus Notes - Part 1.jpg|thumb|438x438px|Written statements [in all caps] are as follows (from the top-down): 1. WHAT IS THE MAXIMUM VALUE? 2. TWO NEARBY X-VALUES, X1 AND X2, PRODUCE ALMOST THE SAME OUTPUT.]]
What is the purpose of the equation (see https://youtube.com/AOKoo_nQSts?si=1RfOYMAHm-Ll5sVT&amp;t [minute 4:17] for context/writing of this equation): &lt;math display=&quot;inline&quot;&gt;bx&lt;/math&gt; - &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt; = &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt;?

If we take a line (total = &lt;math display=&quot;inline&quot;&gt;b&lt;/math&gt;), and make a cut at some point in the line (and designate the cut 'mark' as &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;), how could we figure out &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt; (output produced by the equation, &lt;math display=&quot;inline&quot;&gt;bx&lt;/math&gt; - &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt; = &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt;)? 

&lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt; represents a portion of the line, while &lt;math display=&quot;inline&quot;&gt;b - x&lt;/math&gt; represents the remaining portion of the line. The product of both &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt; and &lt;math display=&quot;inline&quot;&gt;b - x&lt;/math&gt; is &lt;math display=&quot;inline&quot;&gt;bx&lt;/math&gt; - &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt;. The goal is to find the value of &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt; that would produce the highest &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt; value. 
== Wikipedia/Study Links ==
[[w:Archimedes|'''Archimedes''']]
* [[w:Approximations_of_pi|approximations of pi]]
* quadrature (computation of area) of a parabolic segment
* [[w:Archimedes_Palimpsest|''Archimedes Palimpsest'']]
* [https://math.nyu.edu/Archimedes/Lever/LeverLaw.html Archimedes' Law of the Lever]

== See Also ==
* [[User:Addemf/sandbox/Who Invented Calculus?]]

== References/Sources ==
[[Category:Atcovi's Work]]
[[Category:Calculus]]</text>
      <sha1>4liz5npvtyoymid27rufc3fxcxyti09</sha1>
    </revision>
    <revision>
      <id>2809677</id>
      <parentid>2809676</parentid>
      <timestamp>2026-05-16T18:07:43Z</timestamp>
      <contributor>
        <username>Atcovi</username>
        <id>276019</id>
      </contributor>
      <minor />
      <comment>/* 5/16/2026 (continuation of Fermat's adequality) */ clarifying hill diagram</comment>
      <origin>2809677</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="7821" sha1="sgijxwvyih6e7214y74ip6drmux0gsk" xml:space="preserve">{{mathematics}}'''&lt;u&gt;Book&lt;/u&gt;''': ''Infinite Powers'' by Steven Strogatz (ISBN#: 1328879984){{tertiary}}
{{Notes}}
{{juststarted}}
{{contrib-creator|[[User:Atcovi|Atcovi]]}}
== Notes ==
[[File:Parts of Parabola.svg|thumb|A diagram of a parabola.]]

=== 4/11/2026 ===
* Archimedes and figuring out the ''quadratic'' (or computation of the area) of a parabolic segment. This is just basically spamming smaller triangles into a [[parabola]] to equal one big triangle (&lt;math display=&quot;inline&quot;&gt;=1&lt;/math&gt;) in order to figure out the area.

Total area of a parabolic segment from Archimedes findings: &lt;math display=&quot;inline&quot;&gt;1&lt;/math&gt; + &lt;math display=&quot;inline&quot;&gt;1/4&lt;/math&gt; + &lt;math display=&quot;inline&quot;&gt;1/16&lt;/math&gt; + &lt;math display=&quot;inline&quot;&gt;1/64&lt;/math&gt; ← geometric series.

^each term is &lt;math display=&quot;inline&quot;&gt;1/4&lt;/math&gt; of the term preceding it as the daughter triangles always contribute a total of 1 quarter as much area as their parents do. 

Archimedes proved that &lt;math display=&quot;inline&quot;&gt;a = 4/3&lt;/math&gt; through a '''double reductio ad absurdum'''&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=36}}&lt;/ref&gt; using the '''method of exhaustion''', an analytical way of finding a result&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=102}}&lt;/ref&gt;.

=== 5/2/2026 ===

==== [[w:Johannes_Kepler|Johannes Kepler]] ====

# '''[[w:Elliptic orbit|Elliptical orbits]]'''
#*'''Ellipse''': Plane curve where the sum of distances from any point on the curve to two fixed points (foci) is constant. For example, a circle is a type of ellipse. A circle is a set of points where distance from a given point (aka its center) is constant. Kepler stated that all planets follow an elliptical orbit. 
# '''[https://www.socratica.com/pages/keplers-second-law-of-motion Equal Areas in Equal Times]'''
#*'''Formula''': Time (P&lt;sub&gt;1&lt;/sub&gt; → P&lt;sub&gt;2&lt;/sub&gt;) = Time (P&lt;sub&gt;3&lt;/sub&gt; → P&lt;sub&gt;4&lt;/sub&gt;) [their sectors have equal areas]
# '''Third Law and the Sacred Frenzy'''&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=84}}&lt;/ref&gt;
#*&lt;math display=&quot;inline&quot;&gt;T&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt; = &lt;math display=&quot;inline&quot;&gt;a&lt;/math&gt;&lt;sup&gt;3&lt;/sup&gt;
#**&lt;math display=&quot;inline&quot;&gt;T&lt;/math&gt; = how long it takes for a planet to go around the sun just once.
#**&lt;math display=&quot;inline&quot;&gt;A&lt;/math&gt; = avg. of the planet's nearest and farthest distance from the sun.

=== 5/14/2026 ===
* '''[[w:Differential_calculus|Differential calculus]]:''' cuts complicated problems into infinitely many simpler pieces. Ex, derivatives. 
* '''[[w:Integral_calculus|Integral calculus]]''': puts the pieces back together again to solve the original problem. Ex, integrals. 
[[File:Tangent function animation.gif|thumb|The derivative at different points of a differentiable function. In this case, the derivative is equal to &lt;math&gt;\sin \left(x^2\right) + 2x^2 \cos\left(x^2\right)&lt;/math&gt;.&lt;ref&gt;{{Cite journal|date=2026-04-13|title=Derivative|url=https://en.wikipedia.org/w/index.php?title=Derivative&amp;oldid=1348562692|journal=Wikipedia|language=en}}&lt;/ref&gt;]]
[[File:Cartesian-coordinate-system.svg|thumb|This is known as a ''Cartesian coordinate system''.|left]]
* '''[[w:Analytical_geometry|Analytical geometry]]''': Also known as Cartesian geometry, is geometry using a coordinate system (pictured towards the left). Analytical geometry is used in physics, engineering, and aviation. &quot;Analysis&quot; in analytic geometry is meant to be understood as a way of ''figuring out'' the results rather than proving the results&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=101}}&lt;/ref&gt;. 
==== Adequality ====
''See pages 103 to 107, which provide a breakdown of [[w:Pierre_de_Fermat|Pierre de Fermat]] and his concept of adequality.''

Pierre de Fermat's concept of adequality (meaning ''approximate equality''&lt;ref&gt;{{Cite journal|date=2024-09-18|title=Number Theory: An Approach Through History from Hammurapi to Legendre|url=https://en.wikipedia.org/w/index.php?title=Number_Theory:_An_Approach_Through_History_from_Hammurapi_to_Legendre&amp;oldid=1246411217|journal=Wikipedia|language=en}}&lt;/ref&gt;) was a way of finding the maxima, minima, tangents, and other problems in calculus. For example, two nearly equal values, [let's say] ''a'' and ''b'' at the maximum of a parabola, are used to find the maxima of a parabola through a small 'nudge' in the variable&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=106}}&lt;/ref&gt;.

Fermat's ideas eventually led to the concept of derivatives (illustrated towards the right) in modern calculus. 
{{Notice|1=
'''5/14/2026''' - STOPPING POINT&lt;br&gt;
To watch for later: https://www.youtube.com/watch?v=AOKoo_nQSts (6:01)

To read for later: https://digitalcommons.ursinus.edu/cgi/viewcontent.cgi?params=/context/triumphs_calculus/article/1011/&amp;path_info=M05_Fermats_Method_for_Finding_Maxima_and_Minima_2022_05_17.pdf&amp;cs=1&amp;hl=en-US&amp;biw=1280&amp;bih=631.3333740234375}}
=== 5/16/2026 (continuation of Fermat's adequality) ===
[[File:Week 9 Fermat and Adequality Proto-Calculus Notes - Part 1.jpg|thumb|438x438px|Written statements [in all caps] are as follows (from the top-down): 1. WHAT IS THE MAXIMUM VALUE? 2. TWO NEARBY X-VALUES, X&lt;sub&gt;1&lt;/sub&gt; AND X&lt;sub&gt;2&lt;/sub&gt;, PRODUCE ALMOST THE SAME OUTPUT; l = left side, r = right side in the hill diagram]]
What is the purpose of the equation (see https://youtube.com/AOKoo_nQSts?si=1RfOYMAHm-Ll5sVT&amp;t [minute 4:17] for context/writing of this equation): &lt;math display=&quot;inline&quot;&gt;bx&lt;/math&gt; - &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt; = &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt;?

If we take a line (total = &lt;math display=&quot;inline&quot;&gt;b&lt;/math&gt;), and make a cut at some point in the line (and designate the cut 'mark' as &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;), how could we figure out &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt; (output produced by the equation, &lt;math display=&quot;inline&quot;&gt;bx&lt;/math&gt; - &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt; = &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt;)? 

&lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt; represents a portion of the line, while &lt;math display=&quot;inline&quot;&gt;b - x&lt;/math&gt; represents the remaining portion of the line. The product of both &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt; and &lt;math display=&quot;inline&quot;&gt;b - x&lt;/math&gt; is &lt;math display=&quot;inline&quot;&gt;bx&lt;/math&gt; - &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt;. The goal is to find the value of &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt; that would produce the highest &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt; value.

== Wikipedia/Study Links ==
[[w:Archimedes|'''Archimedes''']]
* [[w:Approximations_of_pi|approximations of pi]]
* quadrature (computation of area) of a parabolic segment
* [[w:Archimedes_Palimpsest|''Archimedes Palimpsest'']]
* [https://math.nyu.edu/Archimedes/Lever/LeverLaw.html Archimedes' Law of the Lever]

== See Also ==
* [[User:Addemf/sandbox/Who Invented Calculus?]]

== References/Sources ==
[[Category:Atcovi's Work]]
[[Category:Calculus]]</text>
      <sha1>sgijxwvyih6e7214y74ip6drmux0gsk</sha1>
    </revision>
    <revision>
      <id>2809807</id>
      <parentid>2809677</parentid>
      <timestamp>2026-05-17T01:38:51Z</timestamp>
      <contributor>
        <username>Atcovi</username>
        <id>276019</id>
      </contributor>
      <minor />
      <comment>/* Notes */ more meaningful headers</comment>
      <origin>2809807</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="7932" sha1="7z9a0dx9rhy8ebolif09y2kxpowhzh8" xml:space="preserve">{{mathematics}}'''&lt;u&gt;Book&lt;/u&gt;''': ''Infinite Powers'' by Steven Strogatz (ISBN#: 1328879984){{tertiary}}
{{Notes}}
{{juststarted}}
{{contrib-creator|[[User:Atcovi|Atcovi]]}}
== Notes ==
[[File:Parts of Parabola.svg|thumb|A diagram of a parabola.]]

=== 4/11/2026 (Archimedes and the method of exhaustion) ===
* Archimedes and figuring out the ''quadratic'' (or computation of the area) of a parabolic segment. This is just basically spamming smaller triangles into a [[parabola]] to equal one big triangle (&lt;math display=&quot;inline&quot;&gt;=1&lt;/math&gt;) in order to figure out the area.

Total area of a parabolic segment from Archimedes findings: &lt;math display=&quot;inline&quot;&gt;1&lt;/math&gt; + &lt;math display=&quot;inline&quot;&gt;1/4&lt;/math&gt; + &lt;math display=&quot;inline&quot;&gt;1/16&lt;/math&gt; + &lt;math display=&quot;inline&quot;&gt;1/64&lt;/math&gt; ← geometric series.

^each term is &lt;math display=&quot;inline&quot;&gt;1/4&lt;/math&gt; of the term preceding it as the daughter triangles always contribute a total of 1 quarter as much area as their parents do. 

Archimedes proved that &lt;math display=&quot;inline&quot;&gt;a = 4/3&lt;/math&gt; through a '''double reductio ad absurdum'''&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=36}}&lt;/ref&gt; using the '''method of exhaustion''', an analytical way of finding a result&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=102}}&lt;/ref&gt;.

=== 5/2/2026 (Johannes Kepler) ===

==== [[w:Johannes_Kepler|Johannes Kepler]] ====

# '''[[w:Elliptic orbit|Elliptical orbits]]'''
#*'''Ellipse''': Plane curve where the sum of distances from any point on the curve to two fixed points (foci) is constant. For example, a circle is a type of ellipse. A circle is a set of points where distance from a given point (aka its center) is constant. Kepler stated that all planets follow an elliptical orbit. 
# '''[https://www.socratica.com/pages/keplers-second-law-of-motion Equal Areas in Equal Times]'''
#*'''Formula''': Time (P&lt;sub&gt;1&lt;/sub&gt; → P&lt;sub&gt;2&lt;/sub&gt;) = Time (P&lt;sub&gt;3&lt;/sub&gt; → P&lt;sub&gt;4&lt;/sub&gt;) [their sectors have equal areas]
# '''Third Law and the Sacred Frenzy'''&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=84}}&lt;/ref&gt;
#*&lt;math display=&quot;inline&quot;&gt;T&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt; = &lt;math display=&quot;inline&quot;&gt;a&lt;/math&gt;&lt;sup&gt;3&lt;/sup&gt;
#**&lt;math display=&quot;inline&quot;&gt;T&lt;/math&gt; = how long it takes for a planet to go around the sun just once.
#**&lt;math display=&quot;inline&quot;&gt;A&lt;/math&gt; = avg. of the planet's nearest and farthest distance from the sun.

=== 5/14/2026 (Calculus definitions, introduction to adequality) ===
* '''[[w:Differential_calculus|Differential calculus]]:''' cuts complicated problems into infinitely many simpler pieces. Ex, derivatives. 
* '''[[w:Integral_calculus|Integral calculus]]''': puts the pieces back together again to solve the original problem. Ex, integrals. 
[[File:Tangent function animation.gif|thumb|The derivative at different points of a differentiable function. In this case, the derivative is equal to &lt;math&gt;\sin \left(x^2\right) + 2x^2 \cos\left(x^2\right)&lt;/math&gt;.&lt;ref&gt;{{Cite journal|date=2026-04-13|title=Derivative|url=https://en.wikipedia.org/w/index.php?title=Derivative&amp;oldid=1348562692|journal=Wikipedia|language=en}}&lt;/ref&gt;]]
[[File:Cartesian-coordinate-system.svg|thumb|This is known as a ''Cartesian coordinate system''.|left]]
* '''[[w:Analytical_geometry|Analytical geometry]]''': Also known as Cartesian geometry, is geometry using a coordinate system (pictured towards the left). Analytical geometry is used in physics, engineering, and aviation. &quot;Analysis&quot; in analytic geometry is meant to be understood as a way of ''figuring out'' the results rather than proving the results&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=101}}&lt;/ref&gt;. 
==== Adequality ====
''See pages 103 to 107, which provide a breakdown of [[w:Pierre_de_Fermat|Pierre de Fermat]] and his concept of adequality.''

Pierre de Fermat's concept of adequality (meaning ''approximate equality''&lt;ref&gt;{{Cite journal|date=2024-09-18|title=Number Theory: An Approach Through History from Hammurapi to Legendre|url=https://en.wikipedia.org/w/index.php?title=Number_Theory:_An_Approach_Through_History_from_Hammurapi_to_Legendre&amp;oldid=1246411217|journal=Wikipedia|language=en}}&lt;/ref&gt;) was a way of finding the maxima, minima, tangents, and other problems in calculus. For example, two nearly equal values, [let's say] ''a'' and ''b'' at the maximum of a parabola, are used to find the maxima of a parabola through a small 'nudge' in the variable&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=106}}&lt;/ref&gt;.

Fermat's ideas eventually led to the concept of derivatives (illustrated towards the right) in modern calculus. 
{{Notice|1=
'''5/14/2026''' - STOPPING POINT&lt;br&gt;
To watch for later: https://www.youtube.com/watch?v=AOKoo_nQSts (6:01)

To read for later: https://digitalcommons.ursinus.edu/cgi/viewcontent.cgi?params=/context/triumphs_calculus/article/1011/&amp;path_info=M05_Fermats_Method_for_Finding_Maxima_and_Minima_2022_05_17.pdf&amp;cs=1&amp;hl=en-US&amp;biw=1280&amp;bih=631.3333740234375}}
=== 5/16/2026 (continuation of Fermat's adequality) ===
[[File:Week 9 Fermat and Adequality Proto-Calculus Notes - Part 1.jpg|thumb|438x438px|Written statements [in all caps] are as follows (from the top-down): 1. WHAT IS THE MAXIMUM VALUE? 2. TWO NEARBY X-VALUES, X&lt;sub&gt;1&lt;/sub&gt; AND X&lt;sub&gt;2&lt;/sub&gt;, PRODUCE ALMOST THE SAME OUTPUT; l = left side, r = right side in the hill diagram]]
What is the purpose of the equation (see https://youtube.com/AOKoo_nQSts?si=1RfOYMAHm-Ll5sVT&amp;t [minute 4:17] for context/writing of this equation): &lt;math display=&quot;inline&quot;&gt;bx&lt;/math&gt; - &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt; = &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt;?

If we take a line (total = &lt;math display=&quot;inline&quot;&gt;b&lt;/math&gt;), and make a cut at some point in the line (and designate the cut 'mark' as &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;), how could we figure out &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt; (output produced by the equation, &lt;math display=&quot;inline&quot;&gt;bx&lt;/math&gt; - &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt; = &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt;)? 

&lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt; represents a portion of the line, while &lt;math display=&quot;inline&quot;&gt;b - x&lt;/math&gt; represents the remaining portion of the line. The product of both &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt; and &lt;math display=&quot;inline&quot;&gt;b - x&lt;/math&gt; is &lt;math display=&quot;inline&quot;&gt;bx&lt;/math&gt; - &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt;. The goal is to find the value of &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt; that would produce the highest &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt; value.

== Wikipedia/Study Links ==
[[w:Archimedes|'''Archimedes''']]
* [[w:Approximations_of_pi|approximations of pi]]
* quadrature (computation of area) of a parabolic segment
* [[w:Archimedes_Palimpsest|''Archimedes Palimpsest'']]
* [https://math.nyu.edu/Archimedes/Lever/LeverLaw.html Archimedes' Law of the Lever]

== See Also ==
* [[User:Addemf/sandbox/Who Invented Calculus?]]

== References/Sources ==
[[Category:Atcovi's Work]]
[[Category:Calculus]]</text>
      <sha1>7z9a0dx9rhy8ebolif09y2kxpowhzh8</sha1>
    </revision>
    <revision>
      <id>2809817</id>
      <parentid>2809807</parentid>
      <timestamp>2026-05-17T02:32:41Z</timestamp>
      <contributor>
        <username>Atcovi</username>
        <id>276019</id>
      </contributor>
      <comment>/* 5/16/2026 (continuation of Fermat's adequality) */</comment>
      <origin>2809817</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="8654" sha1="g5gwb9cj5zsa2dvuu6i2lzu2mcqsur6" xml:space="preserve">{{mathematics}}'''&lt;u&gt;Book&lt;/u&gt;''': ''Infinite Powers'' by Steven Strogatz (ISBN#: 1328879984){{tertiary}}
{{Notes}}
{{juststarted}}
{{contrib-creator|[[User:Atcovi|Atcovi]]}}
== Notes ==
[[File:Parts of Parabola.svg|thumb|A diagram of a parabola.]]

=== 4/11/2026 (Archimedes and the method of exhaustion) ===
* Archimedes and figuring out the ''quadratic'' (or computation of the area) of a parabolic segment. This is just basically spamming smaller triangles into a [[parabola]] to equal one big triangle (&lt;math display=&quot;inline&quot;&gt;=1&lt;/math&gt;) in order to figure out the area.

Total area of a parabolic segment from Archimedes findings: &lt;math display=&quot;inline&quot;&gt;1&lt;/math&gt; + &lt;math display=&quot;inline&quot;&gt;1/4&lt;/math&gt; + &lt;math display=&quot;inline&quot;&gt;1/16&lt;/math&gt; + &lt;math display=&quot;inline&quot;&gt;1/64&lt;/math&gt; ← geometric series.

^each term is &lt;math display=&quot;inline&quot;&gt;1/4&lt;/math&gt; of the term preceding it as the daughter triangles always contribute a total of 1 quarter as much area as their parents do. 

Archimedes proved that &lt;math display=&quot;inline&quot;&gt;a = 4/3&lt;/math&gt; through a '''double reductio ad absurdum'''&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=36}}&lt;/ref&gt; using the '''method of exhaustion''', an analytical way of finding a result&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=102}}&lt;/ref&gt;.

=== 5/2/2026 (Johannes Kepler) ===

==== [[w:Johannes_Kepler|Johannes Kepler]] ====

# '''[[w:Elliptic orbit|Elliptical orbits]]'''
#*'''Ellipse''': Plane curve where the sum of distances from any point on the curve to two fixed points (foci) is constant. For example, a circle is a type of ellipse. A circle is a set of points where distance from a given point (aka its center) is constant. Kepler stated that all planets follow an elliptical orbit. 
# '''[https://www.socratica.com/pages/keplers-second-law-of-motion Equal Areas in Equal Times]'''
#*'''Formula''': Time (P&lt;sub&gt;1&lt;/sub&gt; → P&lt;sub&gt;2&lt;/sub&gt;) = Time (P&lt;sub&gt;3&lt;/sub&gt; → P&lt;sub&gt;4&lt;/sub&gt;) [their sectors have equal areas]
# '''Third Law and the Sacred Frenzy'''&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=84}}&lt;/ref&gt;
#*&lt;math display=&quot;inline&quot;&gt;T&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt; = &lt;math display=&quot;inline&quot;&gt;a&lt;/math&gt;&lt;sup&gt;3&lt;/sup&gt;
#**&lt;math display=&quot;inline&quot;&gt;T&lt;/math&gt; = how long it takes for a planet to go around the sun just once.
#**&lt;math display=&quot;inline&quot;&gt;A&lt;/math&gt; = avg. of the planet's nearest and farthest distance from the sun.

=== 5/14/2026 (Calculus definitions, introduction to adequality) ===
* '''[[w:Differential_calculus|Differential calculus]]:''' cuts complicated problems into infinitely many simpler pieces. Ex, derivatives. 
* '''[[w:Integral_calculus|Integral calculus]]''': puts the pieces back together again to solve the original problem. Ex, integrals. 
[[File:Tangent function animation.gif|thumb|The derivative at different points of a differentiable function. In this case, the derivative is equal to &lt;math&gt;\sin \left(x^2\right) + 2x^2 \cos\left(x^2\right)&lt;/math&gt;.&lt;ref&gt;{{Cite journal|date=2026-04-13|title=Derivative|url=https://en.wikipedia.org/w/index.php?title=Derivative&amp;oldid=1348562692|journal=Wikipedia|language=en}}&lt;/ref&gt;]]
[[File:Cartesian-coordinate-system.svg|thumb|This is known as a ''Cartesian coordinate system''.|left]]
* '''[[w:Analytical_geometry|Analytical geometry]]''': Also known as Cartesian geometry, is geometry using a coordinate system (pictured towards the left). Analytical geometry is used in physics, engineering, and aviation. &quot;Analysis&quot; in analytic geometry is meant to be understood as a way of ''figuring out'' the results rather than proving the results&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=101}}&lt;/ref&gt;. 
==== Adequality ====
''See pages 103 to 107, which provide a breakdown of [[w:Pierre_de_Fermat|Pierre de Fermat]] and his concept of adequality.''

Pierre de Fermat's concept of adequality (meaning ''approximate equality''&lt;ref&gt;{{Cite journal|date=2024-09-18|title=Number Theory: An Approach Through History from Hammurapi to Legendre|url=https://en.wikipedia.org/w/index.php?title=Number_Theory:_An_Approach_Through_History_from_Hammurapi_to_Legendre&amp;oldid=1246411217|journal=Wikipedia|language=en}}&lt;/ref&gt;) was a way of finding the maxima, minima, tangents, and other problems in calculus. For example, two nearly equal values, [let's say] ''a'' and ''b'' at the maximum of a parabola, are used to find the maxima of a parabola through a small 'nudge' in the variable&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=106}}&lt;/ref&gt;.

Fermat's ideas eventually led to the concept of derivatives (illustrated towards the right) in modern calculus. 
{{Notice|1=
'''5/14/2026''' - STOPPING POINT&lt;br&gt;
To watch for later: https://www.youtube.com/watch?v=AOKoo_nQSts (6:01)

To read for later: https://digitalcommons.ursinus.edu/cgi/viewcontent.cgi?params=/context/triumphs_calculus/article/1011/&amp;path_info=M05_Fermats_Method_for_Finding_Maxima_and_Minima_2022_05_17.pdf&amp;cs=1&amp;hl=en-US&amp;biw=1280&amp;bih=631.3333740234375}}
=== 5/16/2026 (continuation of Fermat's adequality) ===

==== What does b - (x&lt;sub&gt;1&lt;/sub&gt; + x&lt;sub&gt;2&lt;/sub&gt;) = 0 represent? ====
b = x&lt;sub&gt;1&lt;/sub&gt; + x&lt;sub&gt;2&lt;/sub&gt;

Reference the hill diagram in '''Figure 1'''. X&lt;sub&gt;1&lt;/sub&gt; and X&lt;sub&gt;2&lt;/sub&gt; represent two of the highest points in at the top of the parabola (see the diagram below for a visual representation). 

       /\   &lt;- maximum

x1 -&gt;/  \&lt;- x2

For both of the values, adding both X&lt;sub&gt;1&lt;/sub&gt; and X&lt;sub&gt;2&lt;/sub&gt; would equal b (the total length). B = x&lt;sub&gt;1&lt;/sub&gt; + x&lt;sub&gt;2&lt;/sub&gt; would come out to B = 2x, with '''x = b/2''' (the maxima). This is the value of x that would ideally give the highest value for &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt; (see below).

==== Purpose of bx - x&lt;sup&gt;2&lt;/sup&gt; = c? ====
[[File:Week 9 Fermat and Adequality Proto-Calculus Notes - Part 1.jpg|thumb|438x438px|'''Figure 1.''' Written statements [in all caps] are as follows (from the top-down): 1. WHAT IS THE MAXIMUM VALUE? 2. TWO NEARBY X-VALUES, X&lt;sub&gt;1&lt;/sub&gt; AND X&lt;sub&gt;2&lt;/sub&gt;, PRODUCE ALMOST THE SAME OUTPUT; l = left side, r = right side in the hill diagram]]
What is the purpose of the equation (see https://youtube.com/AOKoo_nQSts?si=1RfOYMAHm-Ll5sVT&amp;t [minute 4:17] for context/writing of this equation): &lt;math display=&quot;inline&quot;&gt;bx&lt;/math&gt; - &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt; = &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt;?

If we take a line (total = &lt;math display=&quot;inline&quot;&gt;b&lt;/math&gt;), and make a cut at some point in the line (and designate the cut 'mark' as &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;), how could we figure out &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt; (output produced by the equation, &lt;math display=&quot;inline&quot;&gt;bx&lt;/math&gt; - &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt; = &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt;)? 

&lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt; represents a portion of the line, while &lt;math display=&quot;inline&quot;&gt;b - x&lt;/math&gt; represents the remaining portion of the line. The product of both &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt; and &lt;math display=&quot;inline&quot;&gt;b - x&lt;/math&gt; is &lt;math display=&quot;inline&quot;&gt;bx&lt;/math&gt; - &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt;. The goal is to find the value of &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt; that would produce the highest &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt; value.

== Wikipedia/Study Links ==
[[w:Archimedes|'''Archimedes''']]
* [[w:Approximations_of_pi|approximations of pi]]
* quadrature (computation of area) of a parabolic segment
* [[w:Archimedes_Palimpsest|''Archimedes Palimpsest'']]
* [https://math.nyu.edu/Archimedes/Lever/LeverLaw.html Archimedes' Law of the Lever]

== See Also ==
* [[User:Addemf/sandbox/Who Invented Calculus?]]

== References/Sources ==
[[Category:Atcovi's Work]]
[[Category:Calculus]]</text>
      <sha1>g5gwb9cj5zsa2dvuu6i2lzu2mcqsur6</sha1>
    </revision>
    <revision>
      <id>2809818</id>
      <parentid>2809817</parentid>
      <timestamp>2026-05-17T02:32:51Z</timestamp>
      <contributor>
        <username>Atcovi</username>
        <id>276019</id>
      </contributor>
      <minor />
      <comment>/* What does b - (x1 + x2) = 0 represent? */</comment>
      <origin>2809818</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="8656" sha1="pwy9si84rqb4p5qv3q4rkt7c2cef3ss" xml:space="preserve">{{mathematics}}'''&lt;u&gt;Book&lt;/u&gt;''': ''Infinite Powers'' by Steven Strogatz (ISBN#: 1328879984){{tertiary}}
{{Notes}}
{{juststarted}}
{{contrib-creator|[[User:Atcovi|Atcovi]]}}
== Notes ==
[[File:Parts of Parabola.svg|thumb|A diagram of a parabola.]]

=== 4/11/2026 (Archimedes and the method of exhaustion) ===
* Archimedes and figuring out the ''quadratic'' (or computation of the area) of a parabolic segment. This is just basically spamming smaller triangles into a [[parabola]] to equal one big triangle (&lt;math display=&quot;inline&quot;&gt;=1&lt;/math&gt;) in order to figure out the area.

Total area of a parabolic segment from Archimedes findings: &lt;math display=&quot;inline&quot;&gt;1&lt;/math&gt; + &lt;math display=&quot;inline&quot;&gt;1/4&lt;/math&gt; + &lt;math display=&quot;inline&quot;&gt;1/16&lt;/math&gt; + &lt;math display=&quot;inline&quot;&gt;1/64&lt;/math&gt; ← geometric series.

^each term is &lt;math display=&quot;inline&quot;&gt;1/4&lt;/math&gt; of the term preceding it as the daughter triangles always contribute a total of 1 quarter as much area as their parents do. 

Archimedes proved that &lt;math display=&quot;inline&quot;&gt;a = 4/3&lt;/math&gt; through a '''double reductio ad absurdum'''&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=36}}&lt;/ref&gt; using the '''method of exhaustion''', an analytical way of finding a result&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=102}}&lt;/ref&gt;.

=== 5/2/2026 (Johannes Kepler) ===

==== [[w:Johannes_Kepler|Johannes Kepler]] ====

# '''[[w:Elliptic orbit|Elliptical orbits]]'''
#*'''Ellipse''': Plane curve where the sum of distances from any point on the curve to two fixed points (foci) is constant. For example, a circle is a type of ellipse. A circle is a set of points where distance from a given point (aka its center) is constant. Kepler stated that all planets follow an elliptical orbit. 
# '''[https://www.socratica.com/pages/keplers-second-law-of-motion Equal Areas in Equal Times]'''
#*'''Formula''': Time (P&lt;sub&gt;1&lt;/sub&gt; → P&lt;sub&gt;2&lt;/sub&gt;) = Time (P&lt;sub&gt;3&lt;/sub&gt; → P&lt;sub&gt;4&lt;/sub&gt;) [their sectors have equal areas]
# '''Third Law and the Sacred Frenzy'''&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=84}}&lt;/ref&gt;
#*&lt;math display=&quot;inline&quot;&gt;T&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt; = &lt;math display=&quot;inline&quot;&gt;a&lt;/math&gt;&lt;sup&gt;3&lt;/sup&gt;
#**&lt;math display=&quot;inline&quot;&gt;T&lt;/math&gt; = how long it takes for a planet to go around the sun just once.
#**&lt;math display=&quot;inline&quot;&gt;A&lt;/math&gt; = avg. of the planet's nearest and farthest distance from the sun.

=== 5/14/2026 (Calculus definitions, introduction to adequality) ===
* '''[[w:Differential_calculus|Differential calculus]]:''' cuts complicated problems into infinitely many simpler pieces. Ex, derivatives. 
* '''[[w:Integral_calculus|Integral calculus]]''': puts the pieces back together again to solve the original problem. Ex, integrals. 
[[File:Tangent function animation.gif|thumb|The derivative at different points of a differentiable function. In this case, the derivative is equal to &lt;math&gt;\sin \left(x^2\right) + 2x^2 \cos\left(x^2\right)&lt;/math&gt;.&lt;ref&gt;{{Cite journal|date=2026-04-13|title=Derivative|url=https://en.wikipedia.org/w/index.php?title=Derivative&amp;oldid=1348562692|journal=Wikipedia|language=en}}&lt;/ref&gt;]]
[[File:Cartesian-coordinate-system.svg|thumb|This is known as a ''Cartesian coordinate system''.|left]]
* '''[[w:Analytical_geometry|Analytical geometry]]''': Also known as Cartesian geometry, is geometry using a coordinate system (pictured towards the left). Analytical geometry is used in physics, engineering, and aviation. &quot;Analysis&quot; in analytic geometry is meant to be understood as a way of ''figuring out'' the results rather than proving the results&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=101}}&lt;/ref&gt;. 
==== Adequality ====
''See pages 103 to 107, which provide a breakdown of [[w:Pierre_de_Fermat|Pierre de Fermat]] and his concept of adequality.''

Pierre de Fermat's concept of adequality (meaning ''approximate equality''&lt;ref&gt;{{Cite journal|date=2024-09-18|title=Number Theory: An Approach Through History from Hammurapi to Legendre|url=https://en.wikipedia.org/w/index.php?title=Number_Theory:_An_Approach_Through_History_from_Hammurapi_to_Legendre&amp;oldid=1246411217|journal=Wikipedia|language=en}}&lt;/ref&gt;) was a way of finding the maxima, minima, tangents, and other problems in calculus. For example, two nearly equal values, [let's say] ''a'' and ''b'' at the maximum of a parabola, are used to find the maxima of a parabola through a small 'nudge' in the variable&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=106}}&lt;/ref&gt;.

Fermat's ideas eventually led to the concept of derivatives (illustrated towards the right) in modern calculus. 
{{Notice|1=
'''5/14/2026''' - STOPPING POINT&lt;br&gt;
To watch for later: https://www.youtube.com/watch?v=AOKoo_nQSts (6:01)

To read for later: https://digitalcommons.ursinus.edu/cgi/viewcontent.cgi?params=/context/triumphs_calculus/article/1011/&amp;path_info=M05_Fermats_Method_for_Finding_Maxima_and_Minima_2022_05_17.pdf&amp;cs=1&amp;hl=en-US&amp;biw=1280&amp;bih=631.3333740234375}}
=== 5/16/2026 (continuation of Fermat's adequality) ===

==== What does b - (x&lt;sub&gt;1&lt;/sub&gt; + x&lt;sub&gt;2&lt;/sub&gt;) = 0 represent? ====
b = x&lt;sub&gt;1&lt;/sub&gt; + x&lt;sub&gt;2&lt;/sub&gt;

Reference the hill diagram in '''Figure 1'''. X&lt;sub&gt;1&lt;/sub&gt; and X&lt;sub&gt;2&lt;/sub&gt; represent two of the highest points in at the top of the parabola (see the diagram below for a visual representation). 

         /\   &lt;- maximum

x1 -&gt;/  \&lt;- x2

For both of the values, adding both X&lt;sub&gt;1&lt;/sub&gt; and X&lt;sub&gt;2&lt;/sub&gt; would equal b (the total length). B = x&lt;sub&gt;1&lt;/sub&gt; + x&lt;sub&gt;2&lt;/sub&gt; would come out to B = 2x, with '''x = b/2''' (the maxima). This is the value of x that would ideally give the highest value for &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt; (see below).

==== Purpose of bx - x&lt;sup&gt;2&lt;/sup&gt; = c? ====
[[File:Week 9 Fermat and Adequality Proto-Calculus Notes - Part 1.jpg|thumb|438x438px|'''Figure 1.''' Written statements [in all caps] are as follows (from the top-down): 1. WHAT IS THE MAXIMUM VALUE? 2. TWO NEARBY X-VALUES, X&lt;sub&gt;1&lt;/sub&gt; AND X&lt;sub&gt;2&lt;/sub&gt;, PRODUCE ALMOST THE SAME OUTPUT; l = left side, r = right side in the hill diagram]]
What is the purpose of the equation (see https://youtube.com/AOKoo_nQSts?si=1RfOYMAHm-Ll5sVT&amp;t [minute 4:17] for context/writing of this equation): &lt;math display=&quot;inline&quot;&gt;bx&lt;/math&gt; - &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt; = &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt;?

If we take a line (total = &lt;math display=&quot;inline&quot;&gt;b&lt;/math&gt;), and make a cut at some point in the line (and designate the cut 'mark' as &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;), how could we figure out &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt; (output produced by the equation, &lt;math display=&quot;inline&quot;&gt;bx&lt;/math&gt; - &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt; = &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt;)? 

&lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt; represents a portion of the line, while &lt;math display=&quot;inline&quot;&gt;b - x&lt;/math&gt; represents the remaining portion of the line. The product of both &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt; and &lt;math display=&quot;inline&quot;&gt;b - x&lt;/math&gt; is &lt;math display=&quot;inline&quot;&gt;bx&lt;/math&gt; - &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt;. The goal is to find the value of &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt; that would produce the highest &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt; value.

== Wikipedia/Study Links ==
[[w:Archimedes|'''Archimedes''']]
* [[w:Approximations_of_pi|approximations of pi]]
* quadrature (computation of area) of a parabolic segment
* [[w:Archimedes_Palimpsest|''Archimedes Palimpsest'']]
* [https://math.nyu.edu/Archimedes/Lever/LeverLaw.html Archimedes' Law of the Lever]

== See Also ==
* [[User:Addemf/sandbox/Who Invented Calculus?]]

== References/Sources ==
[[Category:Atcovi's Work]]
[[Category:Calculus]]</text>
      <sha1>pwy9si84rqb4p5qv3q4rkt7c2cef3ss</sha1>
    </revision>
    <revision>
      <id>2809819</id>
      <parentid>2809818</parentid>
      <timestamp>2026-05-17T02:33:26Z</timestamp>
      <contributor>
        <username>Atcovi</username>
        <id>276019</id>
      </contributor>
      <minor />
      <comment>/* What does b - (x1 + x2) = 0 represent? */ remove</comment>
      <origin>2809819</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="8598" sha1="cfm73azjzkoso6jbz2bbq9sc0nnuslg" xml:space="preserve">{{mathematics}}'''&lt;u&gt;Book&lt;/u&gt;''': ''Infinite Powers'' by Steven Strogatz (ISBN#: 1328879984){{tertiary}}
{{Notes}}
{{juststarted}}
{{contrib-creator|[[User:Atcovi|Atcovi]]}}
== Notes ==
[[File:Parts of Parabola.svg|thumb|A diagram of a parabola.]]

=== 4/11/2026 (Archimedes and the method of exhaustion) ===
* Archimedes and figuring out the ''quadratic'' (or computation of the area) of a parabolic segment. This is just basically spamming smaller triangles into a [[parabola]] to equal one big triangle (&lt;math display=&quot;inline&quot;&gt;=1&lt;/math&gt;) in order to figure out the area.

Total area of a parabolic segment from Archimedes findings: &lt;math display=&quot;inline&quot;&gt;1&lt;/math&gt; + &lt;math display=&quot;inline&quot;&gt;1/4&lt;/math&gt; + &lt;math display=&quot;inline&quot;&gt;1/16&lt;/math&gt; + &lt;math display=&quot;inline&quot;&gt;1/64&lt;/math&gt; ← geometric series.

^each term is &lt;math display=&quot;inline&quot;&gt;1/4&lt;/math&gt; of the term preceding it as the daughter triangles always contribute a total of 1 quarter as much area as their parents do. 

Archimedes proved that &lt;math display=&quot;inline&quot;&gt;a = 4/3&lt;/math&gt; through a '''double reductio ad absurdum'''&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=36}}&lt;/ref&gt; using the '''method of exhaustion''', an analytical way of finding a result&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=102}}&lt;/ref&gt;.

=== 5/2/2026 (Johannes Kepler) ===

==== [[w:Johannes_Kepler|Johannes Kepler]] ====

# '''[[w:Elliptic orbit|Elliptical orbits]]'''
#*'''Ellipse''': Plane curve where the sum of distances from any point on the curve to two fixed points (foci) is constant. For example, a circle is a type of ellipse. A circle is a set of points where distance from a given point (aka its center) is constant. Kepler stated that all planets follow an elliptical orbit. 
# '''[https://www.socratica.com/pages/keplers-second-law-of-motion Equal Areas in Equal Times]'''
#*'''Formula''': Time (P&lt;sub&gt;1&lt;/sub&gt; → P&lt;sub&gt;2&lt;/sub&gt;) = Time (P&lt;sub&gt;3&lt;/sub&gt; → P&lt;sub&gt;4&lt;/sub&gt;) [their sectors have equal areas]
# '''Third Law and the Sacred Frenzy'''&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=84}}&lt;/ref&gt;
#*&lt;math display=&quot;inline&quot;&gt;T&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt; = &lt;math display=&quot;inline&quot;&gt;a&lt;/math&gt;&lt;sup&gt;3&lt;/sup&gt;
#**&lt;math display=&quot;inline&quot;&gt;T&lt;/math&gt; = how long it takes for a planet to go around the sun just once.
#**&lt;math display=&quot;inline&quot;&gt;A&lt;/math&gt; = avg. of the planet's nearest and farthest distance from the sun.

=== 5/14/2026 (Calculus definitions, introduction to adequality) ===
* '''[[w:Differential_calculus|Differential calculus]]:''' cuts complicated problems into infinitely many simpler pieces. Ex, derivatives. 
* '''[[w:Integral_calculus|Integral calculus]]''': puts the pieces back together again to solve the original problem. Ex, integrals. 
[[File:Tangent function animation.gif|thumb|The derivative at different points of a differentiable function. In this case, the derivative is equal to &lt;math&gt;\sin \left(x^2\right) + 2x^2 \cos\left(x^2\right)&lt;/math&gt;.&lt;ref&gt;{{Cite journal|date=2026-04-13|title=Derivative|url=https://en.wikipedia.org/w/index.php?title=Derivative&amp;oldid=1348562692|journal=Wikipedia|language=en}}&lt;/ref&gt;]]
[[File:Cartesian-coordinate-system.svg|thumb|This is known as a ''Cartesian coordinate system''.|left]]
* '''[[w:Analytical_geometry|Analytical geometry]]''': Also known as Cartesian geometry, is geometry using a coordinate system (pictured towards the left). Analytical geometry is used in physics, engineering, and aviation. &quot;Analysis&quot; in analytic geometry is meant to be understood as a way of ''figuring out'' the results rather than proving the results&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=101}}&lt;/ref&gt;. 
==== Adequality ====
''See pages 103 to 107, which provide a breakdown of [[w:Pierre_de_Fermat|Pierre de Fermat]] and his concept of adequality.''

Pierre de Fermat's concept of adequality (meaning ''approximate equality''&lt;ref&gt;{{Cite journal|date=2024-09-18|title=Number Theory: An Approach Through History from Hammurapi to Legendre|url=https://en.wikipedia.org/w/index.php?title=Number_Theory:_An_Approach_Through_History_from_Hammurapi_to_Legendre&amp;oldid=1246411217|journal=Wikipedia|language=en}}&lt;/ref&gt;) was a way of finding the maxima, minima, tangents, and other problems in calculus. For example, two nearly equal values, [let's say] ''a'' and ''b'' at the maximum of a parabola, are used to find the maxima of a parabola through a small 'nudge' in the variable&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=106}}&lt;/ref&gt;.

Fermat's ideas eventually led to the concept of derivatives (illustrated towards the right) in modern calculus. 
{{Notice|1=
'''5/14/2026''' - STOPPING POINT&lt;br&gt;
To watch for later: https://www.youtube.com/watch?v=AOKoo_nQSts (6:01)

To read for later: https://digitalcommons.ursinus.edu/cgi/viewcontent.cgi?params=/context/triumphs_calculus/article/1011/&amp;path_info=M05_Fermats_Method_for_Finding_Maxima_and_Minima_2022_05_17.pdf&amp;cs=1&amp;hl=en-US&amp;biw=1280&amp;bih=631.3333740234375}}
=== 5/16/2026 (continuation of Fermat's adequality) ===

==== What does b - (x&lt;sub&gt;1&lt;/sub&gt; + x&lt;sub&gt;2&lt;/sub&gt;) = 0 represent? ====
b = x&lt;sub&gt;1&lt;/sub&gt; + x&lt;sub&gt;2&lt;/sub&gt;

Reference the hill diagram in '''Figure 1''' (you may have to open the file and zoom in). X&lt;sub&gt;1&lt;/sub&gt; and X&lt;sub&gt;2&lt;/sub&gt; represent two of the highest points at the top of the parabola. 

For both of the values, adding both X&lt;sub&gt;1&lt;/sub&gt; and X&lt;sub&gt;2&lt;/sub&gt; would equal b (the total length). B = x&lt;sub&gt;1&lt;/sub&gt; + x&lt;sub&gt;2&lt;/sub&gt; would come out to B = 2x, with '''x = b/2''' (the maxima). This is the value of x that would ideally give the highest value for &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt; (see below).

==== Purpose of bx - x&lt;sup&gt;2&lt;/sup&gt; = c? ====
[[File:Week 9 Fermat and Adequality Proto-Calculus Notes - Part 1.jpg|thumb|438x438px|'''Figure 1.''' Written statements [in all caps] are as follows (from the top-down): 1. WHAT IS THE MAXIMUM VALUE? 2. TWO NEARBY X-VALUES, X&lt;sub&gt;1&lt;/sub&gt; AND X&lt;sub&gt;2&lt;/sub&gt;, PRODUCE ALMOST THE SAME OUTPUT; l = left side, r = right side in the hill diagram]]
What is the purpose of the equation (see https://youtube.com/AOKoo_nQSts?si=1RfOYMAHm-Ll5sVT&amp;t [minute 4:17] for context/writing of this equation): &lt;math display=&quot;inline&quot;&gt;bx&lt;/math&gt; - &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt; = &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt;?

If we take a line (total = &lt;math display=&quot;inline&quot;&gt;b&lt;/math&gt;), and make a cut at some point in the line (and designate the cut 'mark' as &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;), how could we figure out &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt; (output produced by the equation, &lt;math display=&quot;inline&quot;&gt;bx&lt;/math&gt; - &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt; = &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt;)? 

&lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt; represents a portion of the line, while &lt;math display=&quot;inline&quot;&gt;b - x&lt;/math&gt; represents the remaining portion of the line. The product of both &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt; and &lt;math display=&quot;inline&quot;&gt;b - x&lt;/math&gt; is &lt;math display=&quot;inline&quot;&gt;bx&lt;/math&gt; - &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt;. The goal is to find the value of &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt; that would produce the highest &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt; value.

== Wikipedia/Study Links ==
[[w:Archimedes|'''Archimedes''']]
* [[w:Approximations_of_pi|approximations of pi]]
* quadrature (computation of area) of a parabolic segment
* [[w:Archimedes_Palimpsest|''Archimedes Palimpsest'']]
* [https://math.nyu.edu/Archimedes/Lever/LeverLaw.html Archimedes' Law of the Lever]

== See Also ==
* [[User:Addemf/sandbox/Who Invented Calculus?]]

== References/Sources ==
[[Category:Atcovi's Work]]
[[Category:Calculus]]</text>
      <sha1>cfm73azjzkoso6jbz2bbq9sc0nnuslg</sha1>
    </revision>
    <revision>
      <id>2809820</id>
      <parentid>2809819</parentid>
      <timestamp>2026-05-17T02:35:51Z</timestamp>
      <contributor>
        <username>Atcovi</username>
        <id>276019</id>
      </contributor>
      <minor />
      <comment>/* What does b - (x1 + x2) = 0 represent? */ fix up</comment>
      <origin>2809820</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="8651" sha1="fxjviq4oa3rg4ja649m63hupzbua2b6" xml:space="preserve">{{mathematics}}'''&lt;u&gt;Book&lt;/u&gt;''': ''Infinite Powers'' by Steven Strogatz (ISBN#: 1328879984){{tertiary}}
{{Notes}}
{{juststarted}}
{{contrib-creator|[[User:Atcovi|Atcovi]]}}
== Notes ==
[[File:Parts of Parabola.svg|thumb|A diagram of a parabola.]]

=== 4/11/2026 (Archimedes and the method of exhaustion) ===
* Archimedes and figuring out the ''quadratic'' (or computation of the area) of a parabolic segment. This is just basically spamming smaller triangles into a [[parabola]] to equal one big triangle (&lt;math display=&quot;inline&quot;&gt;=1&lt;/math&gt;) in order to figure out the area.

Total area of a parabolic segment from Archimedes findings: &lt;math display=&quot;inline&quot;&gt;1&lt;/math&gt; + &lt;math display=&quot;inline&quot;&gt;1/4&lt;/math&gt; + &lt;math display=&quot;inline&quot;&gt;1/16&lt;/math&gt; + &lt;math display=&quot;inline&quot;&gt;1/64&lt;/math&gt; ← geometric series.

^each term is &lt;math display=&quot;inline&quot;&gt;1/4&lt;/math&gt; of the term preceding it as the daughter triangles always contribute a total of 1 quarter as much area as their parents do. 

Archimedes proved that &lt;math display=&quot;inline&quot;&gt;a = 4/3&lt;/math&gt; through a '''double reductio ad absurdum'''&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=36}}&lt;/ref&gt; using the '''method of exhaustion''', an analytical way of finding a result&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=102}}&lt;/ref&gt;.

=== 5/2/2026 (Johannes Kepler) ===

==== [[w:Johannes_Kepler|Johannes Kepler]] ====

# '''[[w:Elliptic orbit|Elliptical orbits]]'''
#*'''Ellipse''': Plane curve where the sum of distances from any point on the curve to two fixed points (foci) is constant. For example, a circle is a type of ellipse. A circle is a set of points where distance from a given point (aka its center) is constant. Kepler stated that all planets follow an elliptical orbit. 
# '''[https://www.socratica.com/pages/keplers-second-law-of-motion Equal Areas in Equal Times]'''
#*'''Formula''': Time (P&lt;sub&gt;1&lt;/sub&gt; → P&lt;sub&gt;2&lt;/sub&gt;) = Time (P&lt;sub&gt;3&lt;/sub&gt; → P&lt;sub&gt;4&lt;/sub&gt;) [their sectors have equal areas]
# '''Third Law and the Sacred Frenzy'''&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=84}}&lt;/ref&gt;
#*&lt;math display=&quot;inline&quot;&gt;T&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt; = &lt;math display=&quot;inline&quot;&gt;a&lt;/math&gt;&lt;sup&gt;3&lt;/sup&gt;
#**&lt;math display=&quot;inline&quot;&gt;T&lt;/math&gt; = how long it takes for a planet to go around the sun just once.
#**&lt;math display=&quot;inline&quot;&gt;A&lt;/math&gt; = avg. of the planet's nearest and farthest distance from the sun.

=== 5/14/2026 (Calculus definitions, introduction to adequality) ===
* '''[[w:Differential_calculus|Differential calculus]]:''' cuts complicated problems into infinitely many simpler pieces. Ex, derivatives. 
* '''[[w:Integral_calculus|Integral calculus]]''': puts the pieces back together again to solve the original problem. Ex, integrals. 
[[File:Tangent function animation.gif|thumb|The derivative at different points of a differentiable function. In this case, the derivative is equal to &lt;math&gt;\sin \left(x^2\right) + 2x^2 \cos\left(x^2\right)&lt;/math&gt;.&lt;ref&gt;{{Cite journal|date=2026-04-13|title=Derivative|url=https://en.wikipedia.org/w/index.php?title=Derivative&amp;oldid=1348562692|journal=Wikipedia|language=en}}&lt;/ref&gt;]]
[[File:Cartesian-coordinate-system.svg|thumb|This is known as a ''Cartesian coordinate system''.|left]]
* '''[[w:Analytical_geometry|Analytical geometry]]''': Also known as Cartesian geometry, is geometry using a coordinate system (pictured towards the left). Analytical geometry is used in physics, engineering, and aviation. &quot;Analysis&quot; in analytic geometry is meant to be understood as a way of ''figuring out'' the results rather than proving the results&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=101}}&lt;/ref&gt;. 
==== Adequality ====
''See pages 103 to 107, which provide a breakdown of [[w:Pierre_de_Fermat|Pierre de Fermat]] and his concept of adequality.''

Pierre de Fermat's concept of adequality (meaning ''approximate equality''&lt;ref&gt;{{Cite journal|date=2024-09-18|title=Number Theory: An Approach Through History from Hammurapi to Legendre|url=https://en.wikipedia.org/w/index.php?title=Number_Theory:_An_Approach_Through_History_from_Hammurapi_to_Legendre&amp;oldid=1246411217|journal=Wikipedia|language=en}}&lt;/ref&gt;) was a way of finding the maxima, minima, tangents, and other problems in calculus. For example, two nearly equal values, [let's say] ''a'' and ''b'' at the maximum of a parabola, are used to find the maxima of a parabola through a small 'nudge' in the variable&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=106}}&lt;/ref&gt;.

Fermat's ideas eventually led to the concept of derivatives (illustrated towards the right) in modern calculus. 
{{Notice|1=
'''5/14/2026''' - STOPPING POINT&lt;br&gt;
To watch for later: https://www.youtube.com/watch?v=AOKoo_nQSts (6:01)

To read for later: https://digitalcommons.ursinus.edu/cgi/viewcontent.cgi?params=/context/triumphs_calculus/article/1011/&amp;path_info=M05_Fermats_Method_for_Finding_Maxima_and_Minima_2022_05_17.pdf&amp;cs=1&amp;hl=en-US&amp;biw=1280&amp;bih=631.3333740234375}}
=== 5/16/2026 (continuation of Fermat's adequality) ===

==== What does b - (x&lt;sub&gt;1&lt;/sub&gt; + x&lt;sub&gt;2&lt;/sub&gt;) = 0 represent? ====
b = x&lt;sub&gt;1&lt;/sub&gt; + x&lt;sub&gt;2&lt;/sub&gt;

Reference the hill diagram in '''Figure 1''' (you may have to open the file and zoom in). X&lt;sub&gt;1&lt;/sub&gt; and X&lt;sub&gt;2&lt;/sub&gt; represent two nearby points on the both sides of the &quot;hill&quot; which both produce almost the same output.  

For both of the values, adding both X&lt;sub&gt;1&lt;/sub&gt; and X&lt;sub&gt;2&lt;/sub&gt; would equal b (the total length). B = x&lt;sub&gt;1&lt;/sub&gt; + x&lt;sub&gt;2&lt;/sub&gt; would come out to B = 2x, with '''x = b/2''' (where the maxima occurs). This is the value of x that would ideally give the highest value for &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt; (see below).

==== Purpose of bx - x&lt;sup&gt;2&lt;/sup&gt; = c? ====
[[File:Week 9 Fermat and Adequality Proto-Calculus Notes - Part 1.jpg|thumb|438x438px|'''Figure 1.''' Written statements [in all caps] are as follows (from the top-down): 1. WHAT IS THE MAXIMUM VALUE? 2. TWO NEARBY X-VALUES, X&lt;sub&gt;1&lt;/sub&gt; AND X&lt;sub&gt;2&lt;/sub&gt;, PRODUCE ALMOST THE SAME OUTPUT; l = left side, r = right side in the hill diagram]]
What is the purpose of the equation (see https://youtube.com/AOKoo_nQSts?si=1RfOYMAHm-Ll5sVT&amp;t [minute 4:17] for context/writing of this equation): &lt;math display=&quot;inline&quot;&gt;bx&lt;/math&gt; - &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt; = &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt;?

If we take a line (total = &lt;math display=&quot;inline&quot;&gt;b&lt;/math&gt;), and make a cut at some point in the line (and designate the cut 'mark' as &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;), how could we figure out &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt; (output produced by the equation, &lt;math display=&quot;inline&quot;&gt;bx&lt;/math&gt; - &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt; = &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt;)? 

&lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt; represents a portion of the line, while &lt;math display=&quot;inline&quot;&gt;b - x&lt;/math&gt; represents the remaining portion of the line. The product of both &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt; and &lt;math display=&quot;inline&quot;&gt;b - x&lt;/math&gt; is &lt;math display=&quot;inline&quot;&gt;bx&lt;/math&gt; - &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt;. The goal is to find the value of &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt; that would produce the highest &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt; value.

== Wikipedia/Study Links ==
[[w:Archimedes|'''Archimedes''']]
* [[w:Approximations_of_pi|approximations of pi]]
* quadrature (computation of area) of a parabolic segment
* [[w:Archimedes_Palimpsest|''Archimedes Palimpsest'']]
* [https://math.nyu.edu/Archimedes/Lever/LeverLaw.html Archimedes' Law of the Lever]

== See Also ==
* [[User:Addemf/sandbox/Who Invented Calculus?]]

== References/Sources ==
[[Category:Atcovi's Work]]
[[Category:Calculus]]</text>
      <sha1>fxjviq4oa3rg4ja649m63hupzbua2b6</sha1>
    </revision>
    <revision>
      <id>2809821</id>
      <parentid>2809820</parentid>
      <timestamp>2026-05-17T02:37:14Z</timestamp>
      <contributor>
        <username>Atcovi</username>
        <id>276019</id>
      </contributor>
      <minor />
      <comment>/* What does b - (x1 + x2) = 0 represent? */</comment>
      <origin>2809821</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="8707" sha1="94mhukq6ej274d2nkd4760hu3xot6en" xml:space="preserve">{{mathematics}}'''&lt;u&gt;Book&lt;/u&gt;''': ''Infinite Powers'' by Steven Strogatz (ISBN#: 1328879984){{tertiary}}
{{Notes}}
{{juststarted}}
{{contrib-creator|[[User:Atcovi|Atcovi]]}}
== Notes ==
[[File:Parts of Parabola.svg|thumb|A diagram of a parabola.]]

=== 4/11/2026 (Archimedes and the method of exhaustion) ===
* Archimedes and figuring out the ''quadratic'' (or computation of the area) of a parabolic segment. This is just basically spamming smaller triangles into a [[parabola]] to equal one big triangle (&lt;math display=&quot;inline&quot;&gt;=1&lt;/math&gt;) in order to figure out the area.

Total area of a parabolic segment from Archimedes findings: &lt;math display=&quot;inline&quot;&gt;1&lt;/math&gt; + &lt;math display=&quot;inline&quot;&gt;1/4&lt;/math&gt; + &lt;math display=&quot;inline&quot;&gt;1/16&lt;/math&gt; + &lt;math display=&quot;inline&quot;&gt;1/64&lt;/math&gt; ← geometric series.

^each term is &lt;math display=&quot;inline&quot;&gt;1/4&lt;/math&gt; of the term preceding it as the daughter triangles always contribute a total of 1 quarter as much area as their parents do. 

Archimedes proved that &lt;math display=&quot;inline&quot;&gt;a = 4/3&lt;/math&gt; through a '''double reductio ad absurdum'''&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=36}}&lt;/ref&gt; using the '''method of exhaustion''', an analytical way of finding a result&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=102}}&lt;/ref&gt;.

=== 5/2/2026 (Johannes Kepler) ===

==== [[w:Johannes_Kepler|Johannes Kepler]] ====

# '''[[w:Elliptic orbit|Elliptical orbits]]'''
#*'''Ellipse''': Plane curve where the sum of distances from any point on the curve to two fixed points (foci) is constant. For example, a circle is a type of ellipse. A circle is a set of points where distance from a given point (aka its center) is constant. Kepler stated that all planets follow an elliptical orbit. 
# '''[https://www.socratica.com/pages/keplers-second-law-of-motion Equal Areas in Equal Times]'''
#*'''Formula''': Time (P&lt;sub&gt;1&lt;/sub&gt; → P&lt;sub&gt;2&lt;/sub&gt;) = Time (P&lt;sub&gt;3&lt;/sub&gt; → P&lt;sub&gt;4&lt;/sub&gt;) [their sectors have equal areas]
# '''Third Law and the Sacred Frenzy'''&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=84}}&lt;/ref&gt;
#*&lt;math display=&quot;inline&quot;&gt;T&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt; = &lt;math display=&quot;inline&quot;&gt;a&lt;/math&gt;&lt;sup&gt;3&lt;/sup&gt;
#**&lt;math display=&quot;inline&quot;&gt;T&lt;/math&gt; = how long it takes for a planet to go around the sun just once.
#**&lt;math display=&quot;inline&quot;&gt;A&lt;/math&gt; = avg. of the planet's nearest and farthest distance from the sun.

=== 5/14/2026 (Calculus definitions, introduction to adequality) ===
* '''[[w:Differential_calculus|Differential calculus]]:''' cuts complicated problems into infinitely many simpler pieces. Ex, derivatives. 
* '''[[w:Integral_calculus|Integral calculus]]''': puts the pieces back together again to solve the original problem. Ex, integrals. 
[[File:Tangent function animation.gif|thumb|The derivative at different points of a differentiable function. In this case, the derivative is equal to &lt;math&gt;\sin \left(x^2\right) + 2x^2 \cos\left(x^2\right)&lt;/math&gt;.&lt;ref&gt;{{Cite journal|date=2026-04-13|title=Derivative|url=https://en.wikipedia.org/w/index.php?title=Derivative&amp;oldid=1348562692|journal=Wikipedia|language=en}}&lt;/ref&gt;]]
[[File:Cartesian-coordinate-system.svg|thumb|This is known as a ''Cartesian coordinate system''.|left]]
* '''[[w:Analytical_geometry|Analytical geometry]]''': Also known as Cartesian geometry, is geometry using a coordinate system (pictured towards the left). Analytical geometry is used in physics, engineering, and aviation. &quot;Analysis&quot; in analytic geometry is meant to be understood as a way of ''figuring out'' the results rather than proving the results&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=101}}&lt;/ref&gt;. 
==== Adequality ====
''See pages 103 to 107, which provide a breakdown of [[w:Pierre_de_Fermat|Pierre de Fermat]] and his concept of adequality.''

Pierre de Fermat's concept of adequality (meaning ''approximate equality''&lt;ref&gt;{{Cite journal|date=2024-09-18|title=Number Theory: An Approach Through History from Hammurapi to Legendre|url=https://en.wikipedia.org/w/index.php?title=Number_Theory:_An_Approach_Through_History_from_Hammurapi_to_Legendre&amp;oldid=1246411217|journal=Wikipedia|language=en}}&lt;/ref&gt;) was a way of finding the maxima, minima, tangents, and other problems in calculus. For example, two nearly equal values, [let's say] ''a'' and ''b'' at the maximum of a parabola, are used to find the maxima of a parabola through a small 'nudge' in the variable&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=106}}&lt;/ref&gt;.

Fermat's ideas eventually led to the concept of derivatives (illustrated towards the right) in modern calculus. 
{{Notice|1=
'''5/14/2026''' - STOPPING POINT&lt;br&gt;
To watch for later: https://www.youtube.com/watch?v=AOKoo_nQSts (6:01)

To read for later: https://digitalcommons.ursinus.edu/cgi/viewcontent.cgi?params=/context/triumphs_calculus/article/1011/&amp;path_info=M05_Fermats_Method_for_Finding_Maxima_and_Minima_2022_05_17.pdf&amp;cs=1&amp;hl=en-US&amp;biw=1280&amp;bih=631.3333740234375}}
=== 5/16/2026 (continuation of Fermat's adequality) ===

==== What does b - (x&lt;sub&gt;1&lt;/sub&gt; + x&lt;sub&gt;2&lt;/sub&gt;) = 0 represent? ====
b = x&lt;sub&gt;1&lt;/sub&gt; + x&lt;sub&gt;2&lt;/sub&gt;

Reference the hill diagram in '''Figure 1''' (you may have to open the file and zoom in). X&lt;sub&gt;1&lt;/sub&gt; and X&lt;sub&gt;2&lt;/sub&gt; represent two nearby points on both sides of the &quot;hill&quot; which both produce almost the same output.  

For both of the values, adding both X&lt;sub&gt;1&lt;/sub&gt; and X&lt;sub&gt;2&lt;/sub&gt; would equal &lt;math display=&quot;inline&quot;&gt;b&lt;/math&gt; (the total length). B = x&lt;sub&gt;1&lt;/sub&gt; + x&lt;sub&gt;2&lt;/sub&gt; would come out to B = 2x, with '''x = b/2''' (where the maxima occurs). This is the value of &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt; that would ideally give the highest value for &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt; (see below).

==== Purpose of bx - x&lt;sup&gt;2&lt;/sup&gt; = c? ====
[[File:Week 9 Fermat and Adequality Proto-Calculus Notes - Part 1.jpg|thumb|438x438px|'''Figure 1.''' Written statements [in all caps] are as follows (from the top-down): 1. WHAT IS THE MAXIMUM VALUE? 2. TWO NEARBY X-VALUES, X&lt;sub&gt;1&lt;/sub&gt; AND X&lt;sub&gt;2&lt;/sub&gt;, PRODUCE ALMOST THE SAME OUTPUT; l = left side, r = right side in the hill diagram]]
What is the purpose of the equation (see https://youtube.com/AOKoo_nQSts?si=1RfOYMAHm-Ll5sVT&amp;t [minute 4:17] for context/writing of this equation): &lt;math display=&quot;inline&quot;&gt;bx&lt;/math&gt; - &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt; = &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt;?

If we take a line (total = &lt;math display=&quot;inline&quot;&gt;b&lt;/math&gt;), and make a cut at some point in the line (and designate the cut 'mark' as &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;), how could we figure out &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt; (output produced by the equation, &lt;math display=&quot;inline&quot;&gt;bx&lt;/math&gt; - &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt; = &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt;)? 

&lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt; represents a portion of the line, while &lt;math display=&quot;inline&quot;&gt;b - x&lt;/math&gt; represents the remaining portion of the line. The product of both &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt; and &lt;math display=&quot;inline&quot;&gt;b - x&lt;/math&gt; is &lt;math display=&quot;inline&quot;&gt;bx&lt;/math&gt; - &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt;. The goal is to find the value of &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt; that would produce the highest &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt; value.

== Wikipedia/Study Links ==
[[w:Archimedes|'''Archimedes''']]
* [[w:Approximations_of_pi|approximations of pi]]
* quadrature (computation of area) of a parabolic segment
* [[w:Archimedes_Palimpsest|''Archimedes Palimpsest'']]
* [https://math.nyu.edu/Archimedes/Lever/LeverLaw.html Archimedes' Law of the Lever]

== See Also ==
* [[User:Addemf/sandbox/Who Invented Calculus?]]

== References/Sources ==
[[Category:Atcovi's Work]]
[[Category:Calculus]]</text>
      <sha1>94mhukq6ej274d2nkd4760hu3xot6en</sha1>
    </revision>
    <revision>
      <id>2809822</id>
      <parentid>2809821</parentid>
      <timestamp>2026-05-17T02:44:59Z</timestamp>
      <contributor>
        <username>Atcovi</username>
        <id>276019</id>
      </contributor>
      <minor />
      <comment>/* Notes */ rearrange</comment>
      <origin>2809822</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="8705" sha1="2afl7t9wq838yz4tu9kln5jadwpi9w9" xml:space="preserve">{{mathematics}}'''&lt;u&gt;Book&lt;/u&gt;''': ''Infinite Powers'' by Steven Strogatz (ISBN#: 1328879984){{tertiary}}
{{Notes}}
{{juststarted}}
{{contrib-creator|[[User:Atcovi|Atcovi]]}}
== Notes ==
[[File:Parts of Parabola.svg|thumb|A diagram of a parabola.]]

=== 4/11/2026 (Archimedes and the method of exhaustion) ===
* Archimedes and figuring out the ''quadratic'' (or computation of the area) of a parabolic segment. This is just basically spamming smaller triangles into a [[parabola]] to equal one big triangle (&lt;math display=&quot;inline&quot;&gt;=1&lt;/math&gt;) in order to figure out the area.

Total area of a parabolic segment from Archimedes findings: &lt;math display=&quot;inline&quot;&gt;1&lt;/math&gt; + &lt;math display=&quot;inline&quot;&gt;1/4&lt;/math&gt; + &lt;math display=&quot;inline&quot;&gt;1/16&lt;/math&gt; + &lt;math display=&quot;inline&quot;&gt;1/64&lt;/math&gt; ← geometric series.

^each term is &lt;math display=&quot;inline&quot;&gt;1/4&lt;/math&gt; of the term preceding it as the daughter triangles always contribute a total of 1 quarter as much area as their parents do. 

Archimedes proved that &lt;math display=&quot;inline&quot;&gt;a = 4/3&lt;/math&gt; through a '''double reductio ad absurdum'''&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=36}}&lt;/ref&gt; using the '''method of exhaustion''', an analytical way of finding a result&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=102}}&lt;/ref&gt;.

=== 5/2/2026 (Johannes Kepler) ===

==== [[w:Johannes_Kepler|Johannes Kepler]] ====

# '''[[w:Elliptic orbit|Elliptical orbits]]'''
#*'''Ellipse''': Plane curve where the sum of distances from any point on the curve to two fixed points (foci) is constant. For example, a circle is a type of ellipse. A circle is a set of points where distance from a given point (aka its center) is constant. Kepler stated that all planets follow an elliptical orbit. 
# '''[https://www.socratica.com/pages/keplers-second-law-of-motion Equal Areas in Equal Times]'''
#*'''Formula''': Time (P&lt;sub&gt;1&lt;/sub&gt; → P&lt;sub&gt;2&lt;/sub&gt;) = Time (P&lt;sub&gt;3&lt;/sub&gt; → P&lt;sub&gt;4&lt;/sub&gt;) [their sectors have equal areas]
# '''Third Law and the Sacred Frenzy'''&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=84}}&lt;/ref&gt;
#*&lt;math display=&quot;inline&quot;&gt;T&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt; = &lt;math display=&quot;inline&quot;&gt;a&lt;/math&gt;&lt;sup&gt;3&lt;/sup&gt;
#**&lt;math display=&quot;inline&quot;&gt;T&lt;/math&gt; = how long it takes for a planet to go around the sun just once.
#**&lt;math display=&quot;inline&quot;&gt;A&lt;/math&gt; = avg. of the planet's nearest and farthest distance from the sun.

=== 5/14/2026 (Calculus definitions, introduction to adequality) ===
* '''[[w:Differential_calculus|Differential calculus]]:''' cuts complicated problems into infinitely many simpler pieces. Ex, derivatives. 
* '''[[w:Integral_calculus|Integral calculus]]''': puts the pieces back together again to solve the original problem. Ex, integrals. 
[[File:Tangent function animation.gif|thumb|The derivative at different points of a differentiable function. In this case, the derivative is equal to &lt;math&gt;\sin \left(x^2\right) + 2x^2 \cos\left(x^2\right)&lt;/math&gt;.&lt;ref&gt;{{Cite journal|date=2026-04-13|title=Derivative|url=https://en.wikipedia.org/w/index.php?title=Derivative&amp;oldid=1348562692|journal=Wikipedia|language=en}}&lt;/ref&gt;]]
[[File:Cartesian-coordinate-system.svg|thumb|This is known as a ''Cartesian coordinate system''.|left]]
* '''[[w:Analytical_geometry|Analytical geometry]]''': Also known as Cartesian geometry, is geometry using a coordinate system (pictured towards the left). Analytical geometry is used in physics, engineering, and aviation. &quot;Analysis&quot; in analytic geometry is meant to be understood as a way of ''figuring out'' the results rather than proving the results&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=101}}&lt;/ref&gt;. 
==== Adequality ====
''See pages 103 to 107, which provide a breakdown of [[w:Pierre_de_Fermat|Pierre de Fermat]] and his concept of adequality.''

Pierre de Fermat's concept of adequality (meaning ''approximate equality''&lt;ref&gt;{{Cite journal|date=2024-09-18|title=Number Theory: An Approach Through History from Hammurapi to Legendre|url=https://en.wikipedia.org/w/index.php?title=Number_Theory:_An_Approach_Through_History_from_Hammurapi_to_Legendre&amp;oldid=1246411217|journal=Wikipedia|language=en}}&lt;/ref&gt;) was a way of finding the maxima, minima, tangents, and other problems in calculus. For example, two nearly equal values, [let's say] ''a'' and ''b'' at the maximum of a parabola, are used to find the maxima of a parabola through a small 'nudge' in the variable&lt;ref&gt;{{Cite book|title=Infinite powers: how calculus reveals the secrets of the universe|last=Strogatz|first=Steven|date=2020|publisher=Mariner Books ; Houghton Mifflin Harcourt|isbn=978-1-328-87998-1|edition=First Mariner books edition|location=Boston New York|pages=106}}&lt;/ref&gt;.

Fermat's ideas eventually led to the concept of derivatives (illustrated towards the right) in modern calculus. 
{{Notice|1=
'''5/14/2026''' - STOPPING POINT&lt;br&gt;
To watch for later: https://www.youtube.com/watch?v=AOKoo_nQSts (6:01)

To read for later: https://digitalcommons.ursinus.edu/cgi/viewcontent.cgi?params=/context/triumphs_calculus/article/1011/&amp;path_info=M05_Fermats_Method_for_Finding_Maxima_and_Minima_2022_05_17.pdf&amp;cs=1&amp;hl=en-US&amp;biw=1280&amp;bih=631.3333740234375}}
=== 5/16/2026 (continuation of Fermat's adequality) ===
[[File:Week 9 Fermat and Adequality Proto-Calculus Notes - Part 1.jpg|thumb|438x438px|'''Figure 1.''' Written statements [in all caps] are as follows (from the top-down): 1. WHAT IS THE MAXIMUM VALUE? 2. TWO NEARBY X-VALUES, X&lt;sub&gt;1&lt;/sub&gt; AND X&lt;sub&gt;2&lt;/sub&gt;, PRODUCE ALMOST THE SAME OUTPUT; l = left side, r = right side in the hill diagram]]
==== What does b - (x&lt;sub&gt;1&lt;/sub&gt; + x&lt;sub&gt;2&lt;/sub&gt;) = 0 represent? ====
b = x&lt;sub&gt;1&lt;/sub&gt; + x&lt;sub&gt;2&lt;/sub&gt;

Reference the hill diagram in '''Figure 1''' (you may have to open the file and zoom in). X&lt;sub&gt;1&lt;/sub&gt; and X&lt;sub&gt;2&lt;/sub&gt; represent two nearby points on both sides of the &quot;hill&quot; which both produce almost the same output.  

For both of the values, adding both X&lt;sub&gt;1&lt;/sub&gt; and X&lt;sub&gt;2&lt;/sub&gt; would equal &lt;math display=&quot;inline&quot;&gt;b&lt;/math&gt; (the total length). B = x&lt;sub&gt;1&lt;/sub&gt; + x&lt;sub&gt;2&lt;/sub&gt; would come out to B = 2x, with '''x = b/2''' (where the maxima occurs). This is the value of &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt; that would ideally give the highest value for &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt; (see below).
==== Purpose of bx - x&lt;sup&gt;2&lt;/sup&gt; = c? ====
What is the purpose of the equation (see https://youtube.com/AOKoo_nQSts?si=1RfOYMAHm-Ll5sVT&amp;t [minute 4:17] for context/writing of this equation): &lt;math display=&quot;inline&quot;&gt;bx&lt;/math&gt; - &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt; = &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt;?

If we take a line (total = &lt;math display=&quot;inline&quot;&gt;b&lt;/math&gt;), and make a cut at some point in the line (and designate the cut 'mark' as &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;), how could we figure out &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt; (output produced by the equation, &lt;math display=&quot;inline&quot;&gt;bx&lt;/math&gt; - &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt; = &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt;)? 

&lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt; represents a portion of the line, while &lt;math display=&quot;inline&quot;&gt;b - x&lt;/math&gt; represents the remaining portion of the line. The product of both &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt; and &lt;math display=&quot;inline&quot;&gt;b - x&lt;/math&gt; is &lt;math display=&quot;inline&quot;&gt;bx&lt;/math&gt; - &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt;&lt;sup&gt;2&lt;/sup&gt;. The goal is to find the value of &lt;math display=&quot;inline&quot;&gt;x&lt;/math&gt; that would produce the highest &lt;math display=&quot;inline&quot;&gt;c&lt;/math&gt; value.

== Wikipedia/Study Links ==
[[w:Archimedes|'''Archimedes''']]
* [[w:Approximations_of_pi|approximations of pi]]
* quadrature (computation of area) of a parabolic segment
* [[w:Archimedes_Palimpsest|''Archimedes Palimpsest'']]
* [https://math.nyu.edu/Archimedes/Lever/LeverLaw.html Archimedes' Law of the Lever]

== See Also ==
* [[User:Addemf/sandbox/Who Invented Calculus?]]

== References/Sources ==
[[Category:Atcovi's Work]]
[[Category:Calculus]]</text>
      <sha1>2afl7t9wq838yz4tu9kln5jadwpi9w9</sha1>
    </revision>
  </page>
  <page>
    <title>Template:Inactive curator</title>
    <ns>10</ns>
    <id>329245</id>
    <revision>
      <id>2809874</id>
      <parentid>2808916</parentid>
      <timestamp>2026-05-17T06:46:22Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <comment>+ [[Wikiversity:Curatorship#Inactivity|inactivity criteria]]</comment>
      <origin>2809874</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="834" sha1="jgloso4qwt2t74r4t9to4h1pma1e3a2" xml:space="preserve">== Review of your curator permissions due to inactivity ==
Hello, valued Wikiversity contributor.

According to the [[Wikiversity:Curatorship#Notes|curatorship policy]], your account meets the [[Wikiversity:Curatorship#Inactivity|inactivity criteria]] for curators (no edits or no logged actions for 2 years). A community notice about this review has been also posted at the [[Wikiversity:Colloquium|Colloquium]].

If you wish to resign your curator permissions, you can request their removal at [[Wikiversity:Request custodian action]].

If no response is received within one month, we will proceed with removing your curator permissions in accordance with the policy.

If you have any comments or questions, please share them on the Colloquium.

Thank you.&lt;!-- Template:Inactive curator --&gt;&lt;noinclude&gt;
{{documentation}}
&lt;/noinclude&gt;</text>
      <sha1>jgloso4qwt2t74r4t9to4h1pma1e3a2</sha1>
    </revision>
  </page>
  <page>
    <title>Online platforms' effects on public health, safety and democracy</title>
    <ns>0</ns>
    <id>329333</id>
    <revision>
      <id>2809870</id>
      <parentid>2808439</parentid>
      <timestamp>2026-05-17T05:14:18Z</timestamp>
      <contributor>
        <username>DavidMCEddy</username>
        <id>218607</id>
      </contributor>
      <comment>highlights</comment>
      <origin>2809870</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="33267" sha1="s4fcw5yk1awzn9e6hrl6ql51q1gx5ba" xml:space="preserve">:''This discusses a 2026-05-06 interview with [[w:Yael Eisenstat|Yael Eisenstat]] about the impact of online platforms on public health, safety and democracy. A video and 29:00 mm:ss podcast excerpted from the interview will be added when available. The podcast will be released 2026-05-16 to the fortnightly &quot;Media &amp; Democracy&quot; show&lt;ref name=M&amp;D&gt;&lt;!--Media &amp; Democracy--&gt;{{cite Q|Q127839818}}&lt;/ref&gt; syndicated for the [[w:Pacifica Foundation|Pacifica Radio]]&lt;ref&gt;&lt;!--Pacifica Radio Network--&gt;{{cite Q|Q2045587}}&lt;/ref&gt; Network of [[w:List of Pacifica Radio stations and affiliates|over 200 community radio stations]].''&lt;ref&gt;&lt;!--list of Pacifica Radio stations and affiliates--&gt;{{cite Q|Q6593294}}&lt;/ref&gt;

:''It is posted here to invite others to contribute other perspectives, subject to the Wikimedia rules of [[w:Wikipedia:Neutral point of view|writing from a neutral point of view]] while [[w:Wikipedia:Citing sources|citing credible sources]]&lt;ref name=NPOV&gt;The rules of writing from a neutral point of view citing credible sources may not be enforced on other parts of Wikiversity. However, they can facilitate dialog between people with dramatically different beliefs&lt;/ref&gt; and treating others with respect.''&lt;ref name=AGF&gt;[[Wikiversity:Assume good faith|Wikiversity asks contributors to assume good faith]], similar to Wikipedia. The rule in [[w:Wikinews|Wikinews]] is different: Contributors there are asked to [[Wikinews:Never assume|&quot;Don't assume things; be skeptical about everything.&quot;]] That's wise. However, we should still treat others with respect while being skeptical.&lt;/ref&gt;

[[File:Online platforms' effects on public health, safety and democracy.webm|thumb|2026-05-06 interview with [[w:Yaël Eisenstat| Yaël Eisenstat]] about how some online platforms have been degrading public health, safety and democracy]]

[[File:Online platforms' effects on public health, safety and democracy.ogg|thumb|29:00 mm:ss excerpts from 2026-05-06 interview with [[w:Yaël Eisenstat|Yaël Eisenstat]] about how some online platforms have been degrading public health, safety and democracy.]]

[[w:Yaël Eisenstat|Yaël Eisenstat]] discusses the impact of online platforms on public health, safety and democracy. She is currently&lt;ref&gt;&lt;!--Yael Eisenstat--&gt;{{cite Q|Q82046593}}&lt;/ref&gt; the Director of Policy and Impact at Cybersecurity for Democracy (C4D),&lt;ref&gt;&lt;!--Cybersecurity for Democracy--&gt;{{cite Q|Q139568543}}&lt;/ref&gt; working on policy solutions for how to hold [[w:Social media|social media]] and other online platforms accountable for their effects on public safety and democracy. Previously, she was Vice President at the [[w:Anti-Defamation League|Anti-Defamation League]] (ADL) Center for Technology &amp; Society (CTS). She was a [[w:Facebook|Facebook]] election integrity head in 2018 and later became a whistleblower, speaking publicly about the dangers to democracy stemming from the company's decisions and products. She has held other other positions protecting democracy including as an intelligence officer, diplomat, and White House advisor.  C4D contributed to the recent March 24, 2026, jury verdict in a civil case against Internet companies in [[w:New Mexico|New Mexico]].&lt;ref name=NM&gt;McQue (2026), &lt;!--C4D and the Courts: Meta Guilty Verdicts--&gt;{{cite Q|Q139572464}}&lt;/ref&gt;  

Eisenstat is interviewed by Spencer Graves.&lt;ref name=Graves&gt;&lt;!--Spencer Graves--&gt;{{cite Q|Q56452480}}&lt;/ref&gt; 

== Eisenstat's work == 

Eisenstat's work includes a [[w:TED (conference)|TED Talk]] and an [[w:South by Southwest|SXSW panel]] in 2020 and a 2024 research report on tech platforms and political violence. 

=== 2020 TED talk === 

In Eisenstat's (2020) TED talk, she said that around 2015 she began to notice that she was losing the ability to engage with others who were thought differently. Conversations with others in the US were becoming more difficult than conversations she had had as a CIA officer and diplomat drinking tea and talking with outspoken anti-Western clerics and suspected terrorists in Africa. Many of those engagements began with mutual suspicion but none degenerated into shouting or insults. In some cases she built collaboration on areas of mutual interest. Her most powerful tools were to listen, learn and build empathy. Most of her contacts wanted to feel heard, validated and respected. But social media companies like [[w:Facebook|Facebook]] incentivize inflammatory content contributing to a culture of political polarization and mistrust. This generates revenue for Facebook and similar companies that make money from clicks, &quot;because the shortest path to a click is anger or hate&quot;, in the words of [[Facebook whistleblower Frances Haugen says|Facebook whistleblower Frances Haugen]], interviewed 2024-08-19 for this Media &amp; Democracy series. When Facebook asked Eisenstat in 2018 to lead their work to support global elections integrity for political ads, she agreed. She left six months later, speaking openly about Facebook's inability to meet its responsibility to secure elections, subsequently documented, e.g., in the thousands of internal Facebook documents that [[w:Frances Haugen|Haugen]] released to the [[w:Securities and Exchange Commission|Securities and Exchange Commission]] and ''[[w:The Wall Street Journal|The Wall Street Journal]]'' in 2021.

=== 2020 SXSW panel === 

Eisenstat was part of a &quot;panel about the Future of Tech Responsibility&quot; for the 2020 [[w:South by Southwest|South by Southwest]] festival. The festival was cancelled due to COVID-19, but the panel was held virtually. This panel included a discussion of [[w:Section 230|Section 230]] of the [[w:Communications Act of 1934|Communications Act of 1934]], as amended by the [[w:Communications Decency Act|Communications Decency Act]] of 1996.&lt;ref&gt;Reid (2020).&lt;/ref&gt; It was &quot;written before platforms such as [[w:Facebook|Facebook]], [[w:YouTube|YouTube]] and [[w:X (social network)|Twitter]] existed&quot; -- written while [[w:Google|Google]] was a research project by [[w:Stanford University|Stanford]] [[w:Doctor of Philosophy|PhD]] students [[w:Larry Page|Larry Page]] and [[w:Sergey Brin|Sergey Brin]]. Section 230 includes, &quot;No provider or user of an interactive computer service shall be treated as the publisher or speaker of any information provided by another information content provider.&quot;&lt;ref&gt;&lt;!--47 U.S. Code § 230 - Protection for private blocking and screening of offensive material--&gt;{{cite Q|Q139570261}}&lt;/ref&gt; Eisenstat says that it's time to revisit Section 230, to demand accountability where Internet companies promote or suppress information based on the content while protecting web freedom otherwise. This is similar to the [[Dean Baker on Internet companies threatening democracy internationally and how to fix that|recommendations of]] [[w:Dean Baker|Dean Baker]] that when Internet companies make money by promoting information differentially based on content, they should be liable as are legacy media under the US Supreme Court decision in ''[[w:New York Times Co. v. Sullivan|NYT v. Sullivan]]'' (1964). In other cases, they should be treated as [[w:Common carrier|common carrier]]s like telephone companies. 

=== 2024: Tech platforms and political violence === 

More recently, Eisenstat et al. (2024a, b) are insisting that, &quot;Tech Platforms Must Do More to Avoid Contributing to Potential Political Violence&quot;. ''The New York Times'' had reported that, &quot;a steady undercurrent of violence and physical risk has become a new normal,&quot; particularly targeting public officials and democratic institutions. A survey from the Brennan Center found that 38% of election officials have experienced violent threats. They attributed these threats primarily to tech platforms and gave seven recommendations in four themes &quot;congruent with any number of papers that academics and civil society leaders have published over the years.&quot; They said that platforms 
* must develop robust standards for threat assessment and engage in scenario planning, crisis training, and engagement with external stakeholders, with as much transparency as possible.
* should enforce clear and actionable content moderation policies that address election integrity.
* should enforce their rules uniformly, not exempting politicians and other political influencers. 
* must clearly explain important content moderation decisions, ensuring transparency especially when it comes to high profile accounts.

They hope that increasing demands for accountability will prompt platforms to act more responsibly and prioritize the risk of political violence both in the United States and abroad.

== Highlights ==

:''These excerpts are rushed, lightly edited for readability, and may not be in final form. The ultimate authority on what was said is the accompanying video.''

===Most important issues ===

When asked about the most important things she wanted to communicate to this audience, Eisenstat replied, {{quote|

There's been a debate for a number of years now on whether or not or how social media companies and online platforms are affecting our democracy, whether or not they're contributing to the rise in extremism, to threats to our elections, to democratic backsliding. These have been really important questions we've been interrogating for a number of years now. I think we've really arrived at a tipping point now, especially with some of the cases that we have seen happening in this space recently, that really show that some of the things that many of us have been saying for years are really starting to be proven, both by the actions and statements of some of the leaders of these companies themselves, or some of the documents that are showing up in court cases now. 

But I like to start by debunking some of the myths that surround these conversations. No, I am ''not'' saying that social media is the end all, be all cause of all of our grievances, and that democracy would be a perfect thriving thing if not for social media. I have never said that. That is not actually the point of the conversation. 

The question is: What role have these companies been playing, whether it's undermining elections, perhaps bringing more extremist fringe views to the mainstream and contributing to radicalization of certain people and populations and also as tools for some authoritarian regimes and leaders to truly influence not just the space in which we make sense of our information and in which we engage, both in political debate and democracy and all of it, but fundamentally, what effect are they also having on our safety, our public health, all of these issues? 

And so I think, you know, we're at a real tipping point where what was long viewed as some activists screaming from a mountaintop, some academics proving things through their scientific rigor, some journalists exposing things. I think we're actually at the point now where enough of the public has understood that these issues really matter, and so let's figure out how to course correct and hopefully fix some of them.}}

===Recommendations===

Graves then asked for her recommended course corrections. She replied, {{quote|

We have allowed a very small handful of companies and tech leaders to have an unimaginable amount of control over how information flows, how political campaigning is communicated, how we are actually making sense of the information that underpins a healthy democracy. We have allowed that to be controlled by such a small handful of people. The irony is the original promise of the Internet was to create a much more open system, where the traditional small set of gatekeepers would be disrupted. ...

I love the idea of democratizing both access to information and access to be the voices of issues. All of these things, all of these aspirations, were wonderful ideas. 

But let's be very clear, that is not how it is shaped up. Once a very small handful of people figured out how to both dominate this industry, scale their ideas recklessly, ensure that they could do so with all the legal protections, more than any other industry has ever been granted in place and with no accountability for the outcomes of their actions. 

There's no one silver bullet. ... The public needs to understand how these technologies are affecting them. Because even let's say you wanted legal and legislative changes, which I do, ... you need a constituency that believes that that change has to happen to pressure their lawmakers to actually undertake that process of fixing some of these issues. 

There's public education of really helping people understand, and I think that we've made some really great strides in that. If you just look at these recent court cases, more and more of the public -- they don't need to understand how an algorithm works. ... They just need to understand there is something that is not working here. I've seen enough to know I don't like how it's addicting my child or I don't like how it's making conversations so extreme that nobody feels safe to disagree with anyone anymore. I don't like how it's allowing foreign state actors to intervene in our elections in a way that was never so easy and, frankly, cheap in the past. 

They only need to understand that they don't like that and then say that something has to change. They don't have to be the ones to figure out exactly what that change is. And then it's on lawmakers. It's on courts, but also public pressure to the companies. ...}} 

=== Migrating from for-profit to non-profit social media and Internet companies? ===

Graves then asked if she had suggestions about how to migrate from for-profit to non-profit social media and Internet companies? She replied, {{quote|

It is really challenging right now. I want to be clear, I still use these companies. I would be a hypocrite if my takeaway was to tell everybody to get off of [[w:Instagram|Instagram]], [[w:TikTok|TikTok]], [[w:Facebook|Facebook]], whatever platform people are using. ... 

I don't want to imply that I think everybody needs to get off all of these platforms. At the end of the day, it's very hard to put the toothpaste back in the tube. These companies are part of every ounce of our being. I'll give you an example.

A man I know around 57 years old never joined Instagram. Never used it. And then his child went off to college, and the parents group around all of the freshmen that were all in a group together created a group on Instagram to communicate with each other about their kids' experience and whatnot. And that person at 57 years old had to join Instagram if he wanted to be part of the parents group for his kid that just went off to school. 

I hate that. I wish they would have figured out a different way to create a parents group. But at the end of the day, telling people &quot;You just need to get off these platforms&quot; is a bit of an unfair fight, when these platforms are so ubiquitous and such a part of our everyday life. 

That said, people can understand how to use it in a more healthy way. ... I don't see a nonprofit social media space growing to the scale of something like [[w:Meta Platforms|Meta]] to have the [[w:Network effect|network effects]] of basically engaging almost everybody on the planet. ...  

If you look at [[w:Bluesky|Bluesky]] as the answer to '''[[w:X (social network)|X]]''', that's not really the answer to what you're talking about. That's still a very niche community. ... 

I would just like to get to the point where there's enough understanding that the status quo is not okay, and that we get to figure out how to differentiate product safety from this sort of false narrative that every single thing about a social media company is just about [[w:Freedom of speech|free speech]], and therefore it's untouchable. Hopefully, some of these recent cases have started to prove that there are real business decisions, deceptive practices, design features that are not necessarily about content, but that cause real harm in the world. 

These are the things we need to start grappling with, as opposed to telling everybody how to just get off the platforms. 

I would love to give you a recipe for how to rely more on nonprofit social media. I hope that happens someday, because at the end of the day, as long as these companies entire existence is to make money, and the only way they can truly believe they're going to make money is through this [[w:Surveillance capitalism|surveillance advertising business model]]. These issues are going to be very hard to solve, but I don't think you're going to find the nonprofit platforms catching up yet.}} 

===Frances Haugen ===

Graves noted that he had interviewed [[Facebook whistleblower Frances Haugen says|Facebook whistleblower Francis Haugen in 2024]], who said, {{quote|

The shortest path to a click is anger or hate.}}

Graves asked for Eisenstat's thoughts on that. She replied that Haugen was referring to Meta's business model: {{quote|

When a social media company's business model is predicated on being able to sell you personalized, targeted ads, they want to keep you on the platform as long as humanly possible, so they can [[Wiktionary:hoover|hoover]] up as much of your data as possible so they can sell this idea to an advertiser. ... For example, they know exactly which sneaker you're going to click on, as opposed to just sending that ad to like everybody on the platform. That doesn't sound so harmful. Cool: Maybe I'll get an ad for something that's interesting to me. 

The point about the anger and the emotion, which is something actually I really dug into in my TED Talk in 2020, ... that algorithm is coded with a goal in mind. Let's be very clear, it is a human being who is making a decision when designing that algorithm. It is not some mysterious thing that created itself. ... 

This is not something unique to social media. I spent the first half of my career in the field, on the ground, before social media existed. I was one of our government's top counter extremism officials. I was working with communities susceptible to extremist messaging in the early 2000s to help figure out how to inoculate them from being exploited by extremists who were going to prey on those vulnerabilities to then radicalize them in the future. 

And what we're seeing online is the same exact thing but at a much huger scale. The algorithms know what is going to keep you engaged. And we all know that's going to be emotional content. We all know that's usually going to be something that gets your blood racing. So it's usually going to be something gets you really upset, really angry, really outraged. And that's what's going to keep you going and engaging and sharing and commenting. They're not doing that because they care about that content. They're doing that because the more you share, click, engage, the more they're able to sell you and your data and your behavioral profile to an advertiser. ...  

That is fundamentally the problem with this business model. It's why all the [[w:Externality|externalities]] are what's really concerning to me. 

I don't know that Mark Zuckerberg purposely said ever. -- I doubt he did -- &quot;I want to make sure that more [[w:QAnon|QAnon]] content is recommended to people.&quot; Or, &quot;I want to make sure that more and more people are watching these misogynistic content creators talking about how to do terrible things to women.&quot; ... 

There is enough evidence that that is exactly what his algorithms have been incentivizing, and because it has been incentivizing that content, there is a real world consequence of taking what was once more fringe and making it more and more mainstream. And what the most important thing to understand is what happens online has real consequences offline.}} 

=== Externalities ===

Graves noted that Eisenstat mentioned [[w:Externality|externalities]]  and asked if she had suggestions about internalizing those externalities? She replied, {{quote|

&quot;Some of them fall into areas that unfortunately are harder to solve because they're not actually illegal, but they are causing real harm. There are different categories. I look a lot at how these platforms are helping to fuel things like political violence, extremism, radicalization -- things that are, I think many would agree, quite harmful to our democracy and our society. Again, repeating what I said earlier, I'm not saying social media is the end all, be all singular reason that these things are happening. 

But as others have said (I am not alone in this), they are certainly the gasoline being poured on the fire. ... 

Some of the documents that Francis exposed are really important in proving some of these points. ... There was an article written called &quot;Carol's Journey to QAnon&quot;.&lt;ref&gt;Bidar et al. (2021).&lt;/ref&gt; ... It was based on Facebook's own internal research at the time. It showed that Facebook internal researchers had set up this account, named her Carol, made her a mom from, I think, like the Midwest somewhere, had her start to follow a few things online, including, I think, a few politicians. 

But it didn't start with, &quot;I am following QAnon&quot; and all these crazy like right wing conspiracies. And it showed that within a very short period of time, the recommendation engines were recommending her QAnon content. 

We've replicated studies like that outside of Facebook. We did a study called something like the amplification of [[w:antisemitism|antisemitism]] and hate.&lt;ref&gt;Center for Technology &amp; Society (2023).&lt;/ref&gt; It also showed that the recommendation engines themselves were recommending children, teenagers who weren't even searching for conspiracy theories or antisemitic or other kinds of hate filled content, were recommending these things to them. 

But the reason I bring up the documents that Francis exposed is that proves that the company knew it. ... They knew these things were happening. That's a very critical point ... going back to the idea of a business model that does end up incentivizing the most extreme and salacious content. ... I think that &quot;Carol's Journey to AQnon&quot; is the perfect example. 

We started looking also at like the profiles of some of the people who commit mass violence in the United States. ... It has been skewing more and more towards young men or committing acts of political violence. I'm not going to sit here and say every single one that's ever happened. But if you look at the profile online of a lot of these people ... are spending a lot of time online in these conspiracy theory sort of rabbit holes ... . 

After the [[w:January 6 United States Capitol attack|January 6, 2021, insurrection on the Capitol]], you started to look at the online activity of certain individuals that were involved and implicated. You can see it. You can see that they were going more and more into very extreme content, reposting some very harmful conspiracy theories. ... Whether it's '''[[w:X (social network)|X]]''', whether it's [[w:TikTok|TikTok]], whether it's [[w:Instagram|Instagram]], I get that they are not personally responsible for the [[w:White supremacy|White supremacist]] or [[w:Neo-Nazism|Neo-Nazi]] out there who wants to spread hate. 

But I cannot accept that they bear no responsibility for how their own engines that they have designed not only amplify that, but actually connect people to it. Actually recommend it to children. ... 

Actually recommend a 57 year old predator online. &quot;Oh, these are your likes. Here's a 13 year old girl you might want to connect with.&quot; 

And, yes, that has been proven to happen. Both the investigation that the New Mexico Attorney General did&lt;ref&gt;Lee (2026).&lt;/ref&gt; and some other independent civil society and academics have done research in this space showing that the recommendation engines connect predators with children. 

These are the things that, to me, are inexcusable, that we allow companies to do with absolutely no repercussions.}}

Graves interrupted, &quot;No: There are big repercussions. They make money doing it.&quot; Eisenstat agreed, {{quote| 

Correct, and those are the things that we need to change. ...

A lot of the work that I'm involved in right now, or have been for years, is really trying to disentangle this idea of what about what online really is speech, and I believe in some of the core spirit of this original law from 1996 called [[w:Section 230|Section 230]], which, at its core, preemptively immunizes these platforms for the speech of their users ... while also immunizing them so that they can engage in content moderation. ...

That second part people forget about a lot. ... 

What we've been trying to do for years ... are disentangling what is truly product design that's not actually about somebody else's speech, but is about trying to elicit a particular behavior from what is third party speech so that everything doesn't get thrown out before even getting to see the light of day in court. 

And so that is why these two cases, Los Angeles&lt;ref&gt;Allyn (2026).&lt;/ref&gt; and New Mexico,&lt;ref name=NM/&gt; these two big cases against Meta and Los Angeles was also against Google.

These were the first two cases that actually went to a jury, because for so many years, they've been preemptively immunized by Section 230 and what was different in these cases, and you can read some of our work on this. 

We filed an amicus brief for the big MDL, the multi district litigation.&lt;ref&gt;Eisenstat and Murray (2025).&lt;/ref&gt; We've written a lot about these cases. Some of our research underpinned some of it ... showing that these are products ... using computer science and technological research to prove that some of the products are designed 100% to have nothing to do with content itself, but to elicit a behavior. 

You can just read their patents, which is what we did. If you read our amicus brief, we did a lot of patent analysis. If you read their patents behind things like infinite scroll, or behind things like their intermittent reward, variable rewards, they patent this technology. They're very clear of what goal they are trying to achieve with it. Regardless of the content, those design features, those technologies, if they are, in the end, contributing to an illegal activity or to harm, that's what we should be addressing. 

I might hate some of the racist, homophobic, antisemitic speech that's happening online. That's not the core of what I'm trying to go after. ... Even if I hate it, it's free speech, it's [[w:First Amendment to the United States Constitution|First Amendment]] protected. It's part of what makes us an open society, 

But how a company itself is designing its tools to keep us on the platform, to elicit a certain behavior, to allow people to even monetize the worst of the worst. And then what harm is that creating? That's the important question.}}

=== Can Zuckerberg be prosecuted for perjury? ===

Graves noted that Zuckerberg testified in one of these trials and asked if he could be prosecuted for [[w:Perjury|perjury]]? Eisenstat replied, {{quote|

That's an interesting question. ... I'm not a lawyer, so I don't know the exact answer to that. I will say that for years, we have heard, especially senior executives from Meta lie about what they know about their own products. We've heard it in congressional testimonies. ... I wasn't at the trial in Los Angeles. I don't know whether he lied or not on the stand ... .  

Part of why it's so important for a case like this to go to trial is because ... then you get to go into [[w:Discovery (law)|discovery]]. And what happens during discovery? You get a bunch of documents from internal communications. And the internal communications are showing exactly what they knew and what they decided to do with what they knew. 

And my understanding from these cases, and part of the reason the juries returned the verdicts they did, was it was proven very clearly where they keep lying about what they knew, where they keep lying about the fact that they knew their products are harming children or other issues involved there, and whether or not they decided to do anything about it. 

Whether he can be held for perjury, I don't know. ... I don't know if he actually lied on the stand in Los Angeles. I have heard multiple Facebook senior executives say untrue things, both in the media and in congressional hearings, but I'm not sure about in the case itself.}}

=== In sum ===

Graves then noted that we are about out of time and asked for final words for the audience. Eisenstat replied, {{quote|

For parents right now, it can feel very overwhelming, because you keep getting told that social media is the most terrible thing in the world, and predators are going to stalk your children, and it's going to create terrorists around every corner. I'm not saying that's the case. 

I do think it can be quite dangerous, and especially for parents. They really need to get to understand the platform. Have an open conversation with their children about how they're using it. Explain to them the healthy ways to use it. Engage as a parent with your child's experience online. 

That said a lot of adults aren't using it in a healthy way either. ... Not everything that happens on social media is terrible. It's not. I use it still.

Government's job, whether it's regulators, whether it's courts, whether it's legislators, their job is to protect the vulnerable from illegal activity, from exploitation, while hopefully also allowing innovation to thrive. ...

The amount of money and power that is at stake here is unprecedented in US history. A lot of people don't understand why it has taken so long. I've been screaming about this since I left the company in 2018 and I decided to go public as a whistleblower and speak about what I saw happening there. People were speaking out before I did, and people continue to take really serious risks to try to expose what is happening in these companies. 

But the amount of money and power at stake is why it is so hard to find the solutions. There are so many constituents yelling at legislators, &quot;If you do this, you're going to break the whole internet. If you do that, like the world will cease to exist.&quot;  

But I would just ask people to keep supporting those who are truly doing the work. It is a long battle, but I think we are starting to see real success. The ultimate goal is not to shut down every social media company. The ultimate goal is to figure out what a safer online experience looks like and what accountability looks like when something unsafe happens.}}

== The need for media reform to improve democracy == 

This article is part of [[:category:Media reform to improve democracy]]. A summary of episodes to 2025-11-15 is available in [[Media &amp; Democracy lessons for the future]]. 

==Discussion ==

:''[Interested readers are invite to comment here, subject to the Wikimedia rules of [[w:Wikipedia:Neutral point of view|writing from a neutral point of view]] [[w:Wikipedia:Citing sources|citing credible sources]]&lt;ref name=NPOV/&gt; and treating others with respect.&lt;ref name=AGF/&gt;]''

== Notes ==
{{reflist}}

== Bibliography ==

* &lt;!--Bobby Allyn (2026-03-25) &quot;Jury finds Meta and Google negligent in social media harms trial--&gt;{{cite Q|Q139572103}}
* &lt;!--Musadiq Bidar, Laurie Segall, Dan Patterson, Michael Kaplan, Jessica Kegu (2021-10-25) &quot;Facebook internal documents show execs knew platform spread misinformation and failed to act at times&quot;--&gt;{{cite Q|Q139719521}}
* &lt;!--Center for Technology &amp; Society (2023-08-16) &quot;From Bad To Worse: Amplification and Auto-Generation of Hate--&gt;{{cite Q|Q139719742|author=Center for Technology &amp; Society }}
* &lt;!--Yaël Eisenstat (2020-08) &quot;Dear Facebook, this is how you're breaking democracy&quot;--&gt;{{cite Q|Q138844363}}
* &lt;!--Yaël Eisenstat (2021) &quot;Section 230 Revisited: Web Freedom vs Accountability--&gt;{{cite Q|Q139568755|date=2021}}
* &lt;!-- Yaël Eisenstat, Justin Hendrix, and Daniel Kreiss (2024-05-22, 2024a) &quot;
Preventing Tech-Fueled Political Violence: What online platforms can do to ensure that they do not contribute to election-related violence&quot;, The Bulletin of Technology &amp; Public Life--&gt;{{cite Q|Q139571027|date=2024a}} 
* &lt;!-- Yaël Eisenstat, Justin Hendrix, and Daniel Kreiss (2024-05-22, 2024b) &quot;
Tech Platforms Must Do More to Avoid Contributing to Potential Political Violence
&quot;, Tech Policy Press and Just Security--&gt;{{cite Q|Q139571163|date=2024b}}
* &lt;!-- Yael Eisenstat and Christopher Murray (2025-07-08)  C4D partners with legal and social media experts on amicus brief in MDL case against Meta--&gt;{{cite Q|Q139720052}}
* &lt;!--Morgan Lee (2026-01-31)  Undercover investigation of Meta heads to trial in New Mexico in first stand-alone case by state--&gt;{{cite Q|Q139719943}}
* &lt;!--Katie McQue (2026-04-24) &quot; Meta ordered to pay $375m after being found liable in child exploitation case--&gt;{{cite Q|Q139572337}}
* &lt;!--Blake E. Reid (2020-09-04) &quot;Section 230 of… what?--&gt;{{cite Q|Q139570229}} 

[[Category:Media]]
[[Category:News]]
[[Category:Democracy]]
[[Category:Suicide]]
[[Category:Politics]]
[[Category:Safety]]
[[Category:Public health]]
[[Category:Google]]
[[Category:Internet]]
[[Category:Social media]]
[[Category:Media reform to improve democracy]]
&lt;!--list of categories
https://en.wikiversity.org/wiki/Wikiversity:Category_Review
[[Wikiversity:Category Review]]--&gt;</text>
      <sha1>s4fcw5yk1awzn9e6hrl6ql51q1gx5ba</sha1>
    </revision>
  </page>
  <page>
    <title>User talk:Atcovi/OGM &amp; Suicide/The Paper</title>
    <ns>3</ns>
    <id>329387</id>
    <revision>
      <id>2809809</id>
      <parentid>2807237</parentid>
      <timestamp>2026-05-17T01:55:57Z</timestamp>
      <contributor>
        <username>Atcovi</username>
        <id>276019</id>
      </contributor>
      <comment>/* Plan (5/16/2026) [poster --&gt; paper] */ new section</comment>
      <origin>2809809</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="2383" sha1="1jig01ow3xrw1w08kp8ga208qmfzecg" xml:space="preserve">== AI-Notes (5.1.2026) ==

= 🔍 Let’s test your concern directly =
Your paragraph says:&lt;blockquote&gt;OGM → cognitive vulnerability

→ problem solving, rumination, hopelessness

→ suicidal ideation (via IMV)&lt;/blockquote&gt;
----

== 📊 Does your actual paper list support that? ==

=== ✔ 1. OGM → suicidal ideation ===

* Jiang → OGM mediates SI ✔
* Zhu → OGM predicts SI independent of depression ✔
* Kaviani → OGM linked to SI ✔

👉 Covered heavily
----

=== ✔ 2. OGM → problem solving → hopelessness ===

* Kaviani → OGM → poor problem solving → hopelessness → SI ✔
* Arie → same pathway ✔

👉 Direct support (this is your strongest mechanism)
----

=== ✔ 3. OGM → rumination ===

* Watkins → rumination maintains OGM ✔
* CaR-FA-X framework → capture + rumination ✔

👉 Covered
----

=== ✔ 4. OGM → vulnerability (trait-like) ===

* Champagne → persists after depression ✔
* Hallford → remitted depression ✔
* Young → high-risk individuals ✔

👉 Strong support
----

=== ✔ 5. Conditional / nuance (VERY important) ===

* Crane → no effect in general population ✔
* Stange → only under stress ✔

👉 This actually '''strengthens your intro claim''', not weakens it —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 14:19, 1 May 2026 (UTC)

== Plan (5/16/2026) [poster --&gt; paper] ==

Needs to academically mature. Things to work on:
* Placement of OGM within IMV needs sharper justification.
* Needs to synthesize studies into broader conclusions rather than just summarizing studies.
* OGM being primarily a problem in high-risk population needs to be the central theme.
* Conceptual boundaries need tightenining. OGM is either associated with suicidal ideation (A) or helps explain escalation within the suicidal process (B)?
* Language needs to go from exploratory to academically appropriate.
* IMV integration needs to be backbone, not something that is merely hinted at.
* Visual model would elevate the game.
* Potential questions:
**why OGM specifically?
**why not just depression severity?
**what makes OGM unique from general cognitive dysfunction?
**is this causal or correlational?
**why IMV over other models?
—[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 01:55, 17 May 2026 (UTC)</text>
      <sha1>1jig01ow3xrw1w08kp8ga208qmfzecg</sha1>
    </revision>
    <revision>
      <id>2809810</id>
      <parentid>2809809</parentid>
      <timestamp>2026-05-17T01:58:09Z</timestamp>
      <contributor>
        <username>Atcovi</username>
        <id>276019</id>
      </contributor>
      <comment>/* Plan (5/16/2026) [poster --&gt; paper] */ +5-10 more papers?</comment>
      <origin>2809810</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="2709" sha1="rxfyn8rqmovy4tbm1b41x23exy97h5b" xml:space="preserve">== AI-Notes (5.1.2026) ==

= 🔍 Let’s test your concern directly =
Your paragraph says:&lt;blockquote&gt;OGM → cognitive vulnerability

→ problem solving, rumination, hopelessness

→ suicidal ideation (via IMV)&lt;/blockquote&gt;
----

== 📊 Does your actual paper list support that? ==

=== ✔ 1. OGM → suicidal ideation ===

* Jiang → OGM mediates SI ✔
* Zhu → OGM predicts SI independent of depression ✔
* Kaviani → OGM linked to SI ✔

👉 Covered heavily
----

=== ✔ 2. OGM → problem solving → hopelessness ===

* Kaviani → OGM → poor problem solving → hopelessness → SI ✔
* Arie → same pathway ✔

👉 Direct support (this is your strongest mechanism)
----

=== ✔ 3. OGM → rumination ===

* Watkins → rumination maintains OGM ✔
* CaR-FA-X framework → capture + rumination ✔

👉 Covered
----

=== ✔ 4. OGM → vulnerability (trait-like) ===

* Champagne → persists after depression ✔
* Hallford → remitted depression ✔
* Young → high-risk individuals ✔

👉 Strong support
----

=== ✔ 5. Conditional / nuance (VERY important) ===

* Crane → no effect in general population ✔
* Stange → only under stress ✔

👉 This actually '''strengthens your intro claim''', not weakens it —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 14:19, 1 May 2026 (UTC)

== Plan (5/16/2026) [poster --&gt; paper] ==

Needs to academically mature. Things to work on:
* Placement of OGM within IMV needs sharper justification.
* Needs to synthesize studies into broader conclusions rather than just summarizing studies.
* OGM being primarily a problem in high-risk population needs to be the central theme.
* Conceptual boundaries need tightenining. OGM is either associated with suicidal ideation (A) or helps explain escalation within the suicidal process (B)?
* Language needs to go from exploratory to academically appropriate.
* IMV integration needs to be backbone, not something that is merely hinted at.
* Visual model would elevate the game.
* Potential questions:
**why OGM specifically?
**why not just depression severity?
**what makes OGM unique from general cognitive dysfunction?
**is this causal or correlational?
**why IMV over other models?
—[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 01:55, 17 May 2026 (UTC)
===Add 5-10 more papers?===
Specifically about...

* IMV-related cognition papers
* autobiographical memory mechanism papers
* hopelessness/entrapment pathway papers
* papers challenging OGM specificity
—[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 01:58, 17 May 2026 (UTC)</text>
      <sha1>rxfyn8rqmovy4tbm1b41x23exy97h5b</sha1>
    </revision>
    <revision>
      <id>2809811</id>
      <parentid>2809810</parentid>
      <timestamp>2026-05-17T01:59:17Z</timestamp>
      <contributor>
        <username>Atcovi</username>
        <id>276019</id>
      </contributor>
      <minor />
      <comment>fix</comment>
      <origin>2809811</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="2712" sha1="jfai7hykhxmp0vrpyu66c17e4rf32gp" xml:space="preserve">== AI-Notes (5.1.2026) ==

🔍 '''Let’s test your concern directly'''

Your paragraph says:&lt;blockquote&gt;OGM → cognitive vulnerability

→ problem solving, rumination, hopelessness

→ suicidal ideation (via IMV)&lt;/blockquote&gt;
----

== 📊 Does your actual paper list support that? ==

=== ✔ 1. OGM → suicidal ideation ===

* Jiang → OGM mediates SI ✔
* Zhu → OGM predicts SI independent of depression ✔
* Kaviani → OGM linked to SI ✔

👉 Covered heavily
----

=== ✔ 2. OGM → problem solving → hopelessness ===

* Kaviani → OGM → poor problem solving → hopelessness → SI ✔
* Arie → same pathway ✔

👉 Direct support (this is your strongest mechanism)
----

=== ✔ 3. OGM → rumination ===

* Watkins → rumination maintains OGM ✔
* CaR-FA-X framework → capture + rumination ✔

👉 Covered
----

=== ✔ 4. OGM → vulnerability (trait-like) ===

* Champagne → persists after depression ✔
* Hallford → remitted depression ✔
* Young → high-risk individuals ✔

👉 Strong support
----

=== ✔ 5. Conditional / nuance (VERY important) ===

* Crane → no effect in general population ✔
* Stange → only under stress ✔

👉 This actually '''strengthens your intro claim''', not weakens it —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 14:19, 1 May 2026 (UTC)

== Plan (5/16/2026) [poster --&gt; paper] ==

Needs to academically mature. Things to work on:
* Placement of OGM within IMV needs sharper justification.
* Needs to synthesize studies into broader conclusions rather than just summarizing studies.
* OGM being primarily a problem in high-risk population needs to be the central theme.
* Conceptual boundaries need tightenining. OGM is either associated with suicidal ideation (A) or helps explain escalation within the suicidal process (B)?
* Language needs to go from exploratory to academically appropriate.
* IMV integration needs to be backbone, not something that is merely hinted at.
* Visual model would elevate the game.
* Potential questions:
**why OGM specifically?
**why not just depression severity?
**what makes OGM unique from general cognitive dysfunction?
**is this causal or correlational?
**why IMV over other models?
—[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 01:55, 17 May 2026 (UTC)
===Add 5-10 more papers?===
Specifically about...

* IMV-related cognition papers
* autobiographical memory mechanism papers
* hopelessness/entrapment pathway papers
* papers challenging OGM specificity
—[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 01:58, 17 May 2026 (UTC)</text>
      <sha1>jfai7hykhxmp0vrpyu66c17e4rf32gp</sha1>
    </revision>
    <revision>
      <id>2809812</id>
      <parentid>2809811</parentid>
      <timestamp>2026-05-17T02:00:50Z</timestamp>
      <contributor>
        <username>Atcovi</username>
        <id>276019</id>
      </contributor>
      <comment>/* Plan (5/16/2026) [poster --&gt; paper] */ +journal ideas</comment>
      <origin>2809812</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="3088" sha1="4x069b864ia9t22fqt0rclaw4mfodcy" xml:space="preserve">== AI-Notes (5.1.2026) ==

🔍 '''Let’s test your concern directly'''

Your paragraph says:&lt;blockquote&gt;OGM → cognitive vulnerability

→ problem solving, rumination, hopelessness

→ suicidal ideation (via IMV)&lt;/blockquote&gt;
----

== 📊 Does your actual paper list support that? ==

=== ✔ 1. OGM → suicidal ideation ===

* Jiang → OGM mediates SI ✔
* Zhu → OGM predicts SI independent of depression ✔
* Kaviani → OGM linked to SI ✔

👉 Covered heavily
----

=== ✔ 2. OGM → problem solving → hopelessness ===

* Kaviani → OGM → poor problem solving → hopelessness → SI ✔
* Arie → same pathway ✔

👉 Direct support (this is your strongest mechanism)
----

=== ✔ 3. OGM → rumination ===

* Watkins → rumination maintains OGM ✔
* CaR-FA-X framework → capture + rumination ✔

👉 Covered
----

=== ✔ 4. OGM → vulnerability (trait-like) ===

* Champagne → persists after depression ✔
* Hallford → remitted depression ✔
* Young → high-risk individuals ✔

👉 Strong support
----

=== ✔ 5. Conditional / nuance (VERY important) ===

* Crane → no effect in general population ✔
* Stange → only under stress ✔

👉 This actually '''strengthens your intro claim''', not weakens it —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 14:19, 1 May 2026 (UTC)

== Plan (5/16/2026) [poster --&gt; paper] ==

Needs to academically mature. Things to work on:
* Placement of OGM within IMV needs sharper justification.
* Needs to synthesize studies into broader conclusions rather than just summarizing studies.
* OGM being primarily a problem in high-risk population needs to be the central theme.
* Conceptual boundaries need tightenining. OGM is either associated with suicidal ideation (A) or helps explain escalation within the suicidal process (B)?
* Language needs to go from exploratory to academically appropriate.
* IMV integration needs to be backbone, not something that is merely hinted at.
* Visual model would elevate the game.
* Potential questions:
**why OGM specifically?
**why not just depression severity?
**what makes OGM unique from general cognitive dysfunction?
**is this causal or correlational?
**why IMV over other models?
—[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 01:55, 17 May 2026 (UTC)
===Add 5-10 more papers?===
Specifically about...

* IMV-related cognition papers
* autobiographical memory mechanism papers
* hopelessness/entrapment pathway papers
* papers challenging OGM specificity
—[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 01:58, 17 May 2026 (UTC)
===Journal Ideas?===
*American Association of Suicidology — Suicide and Life-Threatening Behavior (SLTB)
*Frontiers in Psychiatry / Frontiers in Psychology
*BMC — BMC Psychiatry
*Frontiers Media — Frontiers
*Journal of Affective Disorders Reports
—[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 02:00, 17 May 2026 (UTC)</text>
      <sha1>4x069b864ia9t22fqt0rclaw4mfodcy</sha1>
    </revision>
  </page>
  <page>
    <title>File:CP.FileCntl.B.20260504.pdf</title>
    <ns>6</ns>
    <id>329465</id>
    <revision>
      <id>2809791</id>
      <parentid>2807568</parentid>
      <timestamp>2026-05-17T01:06:23Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>/* Summary */</comment>
      <origin>2809791</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="254" sha1="tef3gd1ojq2mckgw8czpuun87cd4hin" xml:space="preserve">== Summary ==
{{Information
|Description=FF Timing (20260511 - 20260506)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}

== Licensing ==
{{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}</text>
      <sha1>tef3gd1ojq2mckgw8czpuun87cd4hin</sha1>
    </revision>
    <revision>
      <id>2809795</id>
      <parentid>2809791</parentid>
      <timestamp>2026-05-17T01:08:50Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>/* Summary */</comment>
      <origin>2809795</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="265" sha1="dk8zeoqetocz7k4wjcya3wohkga5lxx" xml:space="preserve">== Summary ==
{{Information
|Description=FF Timing (20260511 - 20260506) Wrong file
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}

== Licensing ==
{{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}</text>
      <sha1>dk8zeoqetocz7k4wjcya3wohkga5lxx</sha1>
    </revision>
  </page>
  <page>
    <title>Athena problem</title>
    <ns>0</ns>
    <id>329548</id>
    <revision>
      <id>2809760</id>
      <parentid>2809610</parentid>
      <timestamp>2026-05-16T22:04:44Z</timestamp>
      <contributor>
        <username>雅典娜241</username>
        <id>3071373</id>
      </contributor>
      <origin>2809760</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="45197" sha1="8r908qjm53nba397iyt88zqtj5yddro" xml:space="preserve">'''Athena problem''' is an [[:w:List of unsolved problems in mathematics|unsolved problem]] in [[:w:Number theory|number theory]] and [[:w:Formal language theory|formal language theory]] and [[:w:Order theory|order theory]], this problem is named after the ancient Greek goddess [[:w:Athena|Athena]] (which is associated with [[:w:Wisdom|wisdom]]). Athena problem is: Give a [[:w:Natural number|natural number]] ''b'' &gt; 1, find the [[:w:Set (mathematics)|set]] of the [[:w:Minimal element|minimal element]]s of the set of the &quot;[[:w:Prime number|prime number]] [[:w:Greater than|&gt;]] ''b''&quot; [[:w:Numerical digit|digit]] [[:w:String (computer science)|string]]s in the [[:w:Positional numeral system|positional numeral system]] with [[:w:Radix|base]] ''b'' for the [[:w:Subsequence|subsequence]] [[:w:Partially ordered set|ordering]]. (A string ''x'' is a subsequence of another string ''y'', if ''x'' can be obtained from ''y'' by deleting zero or more of the [[:w:Character (computing)|character]]s in ''y''. For example, 514 is a subsequence of 352148, &quot;string&quot; is a subsequence of &quot;meistersinger&quot;. In contrast, 758 is not a subsequence of 378259, &quot;abc&quot; is not a subsequence of &quot;cbacacba&quot;, since the characters must be in the same order) (Unlike [[:w:Substring|substring]], subsequence is not required to occupy consecutive positions within the original sequences)

Using [[:w:Formal language theory|formal language theory]] terminology, Athena problem is finding the [[:w:Set (mathematics)|set]] of the [[:w:Minimal element|minimal element]]s of the [[:w:Formal language|language]] of base-''b'' [[:w:Representation (mathematics)|representation]]s of the [[:w:Prime number|prime number]]s [[:w:Greater than|&gt;]] ''b'' (which is a set of [[:w:String (computer science)|string]]s of [[:w:Symbol|symbol]]s over the [[:w:Alphabet (formal languages)|alphabet]] ''Σ''&lt;sub&gt;''b''&lt;/sub&gt; := {0, 1, ..., ''b''−1}), under the subsequence ordering (i.e. the [[:w:Binary relation|binary relation]] &quot;is a subsequence of&quot;, which is a [[:w:Partially ordered set|partial ordering]]), for a given natural number ''b'' &gt; 1. (You can draw this ordering as [[:w:Hasse diagram|Hasse diagram]] to find all [[:w:Minimal element|minimal element]]s)

By [[:w:Higman's lemma|Higman's lemma]], there are no [[:w:Infinite set|infinite]] [[:w:Antichain|antichain]]s for the subsequence ordering (i.e. the subsequence ordering is always a [[:w:Well-quasi-ordering|well quasi order]]) (i.e. under the subsequence ordering (i.e. the [[:w:Binary relation|binary relation]] &quot;is a subsequence of&quot;, which is a [[:w:Partially ordered set|partial ordering]]), every set of pairwise incomparable (i.e. not [[:w:Comparability|comparable]]) strings is finite), thus there must be only finitely many such minimal elements. In other words, the set of such minimal elements must be a [[:w:Finite set|finite set]], e.g. in [[:w:Decimal|decimal]] (base ''b'' = 10), this set has exactly 77 [[:w:Element of a set|element]]s: {11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 227, 251, 257, 277, 281, 349, 409, 449, 499, 521, 557, 577, 587, 727, 757, 787, 821, 827, 857, 877, 881, 887, 991, 2087, 2221, 5051, 5081, 5501, 5581, 5801, 5851, 6469, 6949, 8501, 9001, 9049, 9221, 9551, 9649, 9851, 9949, 20021, 20201, 50207, 60649, 80051, 666649, 946669, 5200007, 22000001, 60000049, 66000049, 66600049, 80555551, 555555555551, 5000000000000000000000000000027}.

For bases 2 ≤ ''b'' ≤ 36, Athena problem is fully solved in bases ''b'' = 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 18, 20, 24, and also solved in bases ''b'' = 11, 13, 16, 22, 30 if [[:w:Probable prime|probable prime]]s are allowed. For the unsolved bases ''b'' = 17, 19, 21, 23, 25, 26, 27, 28, 29, 31, 32, 34, 35, 36, Athena problem is solved (if probable primes are allowed) except 771 [[:w:Indexed family|families]] of the form ''x''{''y''}''z'' (where ''x'' and ''z'' are strings (may be [[:w:Empty string|empty]]) of digits in base ''b'', ''y'' is a digit in base ''b''), all of these 771 families contain no primes or probable primes with length ≤ 100000.

== Results ==

These are the results of the Athena problem in bases 2 ≤ ''b'' ≤ 36 (we stop at base 36 since this base is the maximum base for which it is possible to write the numbers with the [[:w:Symbol|symbol]]s 0, 1, 2, ..., 9 and A, B, C, ..., Z (i.e. the 10 [[:w:Arabic numerals|Arabic numerals]] and the 26 [[:w:Latin script|Latin letters]]): (some large primes are only probable primes, i.e. not definitely primes, since they are too large to be [[:w:Elliptic curve primality|ECPP proved]] and [[:w:Pocklington primality test#Extensions and variants|neither ''N''−1 nor ''N''+1 can be ≥ 1/3 factored]], all of them pass the [[:w:Baillie–PSW primality test|Baillie–PSW primality test]] and the [[:w:Strong pseudoprime|strong primality test]] (i.e. the [[:w:Miller–Rabin primality test|Miller–Rabin primality test]]) with all prime bases ''p'' ≤ 61, however, all primes &lt; 10&lt;sup&gt;25000&lt;/sup&gt; for bases ''b'' = 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 18, 20, 22, 24, 26, 28, 30, 36 are definitely primes, most of them &gt; 10&lt;sup&gt;299&lt;/sup&gt; are proven primes with [[:w:Elliptic curve primality|ECPP proving]], others &gt; 10&lt;sup&gt;299&lt;/sup&gt; are proven primes with [[:w:Pocklington primality test#Extensions and variants|''N''−1 or ''N''+1 proving]])

To solve the Athena problem for a given base ''b'', we must [[:w:Computing|compute]] the element up to families of the form ''x''{''y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''y'' is a digit in base ''b'') (we call such families ''linear families''), and find the smallest prime &gt; ''b'' in all such families.

Shrinking the family ''x''{''Y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''Y'' is a set of digits in base ''b'')

* If ''y'' ∈ ''Y'' and the string ''xyyz'' represents a prime &gt; ''b'' in base ''b'' (in this case, add this prime to the list) or has a subsequence which represents a prime &gt; ''b'' in base ''b'', then ''x''{''Y''}''z'' can be replaced with ''x''{''Y'' \ ''y''}''z'' ∪ ''x''{''Y'' \ ''y''}''y''{''Y'' \ ''y''}''z''.
* If ''y''&lt;sub&gt;1&lt;/sub&gt; ∈ ''Y'' and ''y''&lt;sub&gt;2&lt;/sub&gt; ∈ ''Y'' and ''y''&lt;sub&gt;1&lt;/sub&gt; ≠ ''y''&lt;sub&gt;2&lt;/sub&gt; and the string ''xy''&lt;sub&gt;1&lt;/sub&gt;''y''&lt;sub&gt;2&lt;/sub&gt;''z'' represents a prime &gt; ''b'' in base ''b'' (in this case, add this prime to the list) or has a subsequence which represents a prime &gt; ''b'' in base ''b'', then ''x''{''Y''}''z'' can be replaced with ''x''{''Y'' \ ''y''&lt;sub&gt;1&lt;/sub&gt;}{''Y'' \ ''y''&lt;sub&gt;2&lt;/sub&gt;}''z''.
* If ''y''&lt;sub&gt;1&lt;/sub&gt; ∈ ''Y'' and ''y''&lt;sub&gt;2&lt;/sub&gt; ∈ ''Y'' and ''y''&lt;sub&gt;1&lt;/sub&gt; ≠ ''y''&lt;sub&gt;2&lt;/sub&gt; and both the strings ''xy''&lt;sub&gt;1&lt;/sub&gt;''y''&lt;sub&gt;2&lt;/sub&gt;''z'' and ''xy''&lt;sub&gt;2&lt;/sub&gt;''y''&lt;sub&gt;1&lt;/sub&gt;''z'' represent a prime &gt; ''b'' in base ''b'' (in this case, add this prime to the list) or have a subsequence which represents a prime &gt; ''b'' in base ''b'', then ''x''{''Y''}''z'' can be replaced with ''x''{''Y'' \ ''y''&lt;sub&gt;1&lt;/sub&gt;}''z'' ∪ ''x''{''Y'' \ ''y''&lt;sub&gt;2&lt;/sub&gt;}''z''.

e.g. in decimal (base ''b'' = 10):

* 2221 is a prime &gt; 10, thus the family 2{0,2}1 splits into the two families 2{0}1 and 2{0}2{0}1.
* 227 is a prime &gt; 10, and it is a subsequence of 5227, thus the family 5{0,2}7 splits into the two families 5{0}7 and 5{0}2{0}7.
* 449 is a prime &gt; 10, and it is a subsequence of 6449, thus the family 6{0,3,4,6,9}9 splits into the two families 6{0,3,6,9}9 and 6{0,3,6,9}4{0,3,6,9}9.
* Both 5051 and 5501 are primes &gt; 10, thus the family 5{0,5}1 splits into the two families 5{0}1 and 5{5}1 = {5}1.
* 8501 is a prime &gt; 10, thus the family 8{0,5}1 splits into the family 8{0}{5}1.
* 887 is a prime &gt; 10, and it is a subsequence of 2887, also 2087 is a prime &gt; 10, thus the family 2{0,8}7 splits into the two families 2{0}7 and 28{0}7.
* 349 and 449 are primes &gt; 10, and they are subsequences of 9349 and 9449, respectively, also 9049, 9649, 9949 are primes &gt; 10, thus the family 9{0,3,4,6,9}9 splits into the two families 9{0,3,6,9}9 and 94{0,3,6,9}9.
* 251, 281, 521, 821, 881 are primes &gt; 10, and they are subsequences of 9251, 9281, 9521, 9821, 9881, respectively, also 9001, 9221, 9551, 9851 are primes &gt; 10, thus the family 9{0,2,5,8}1 splits into the numbers {91, 901, 921, 951, 981, 9021, 9051, 9081, 9201, 9501, 9581, 9801, 90581, 95081, 95801}.

If the methods we have discussed cannot be used to rule out or shrink ''x''{''Y''}''z'' where ''Y'' = {''y''&lt;sub&gt;1&lt;/sub&gt;, ''y''&lt;sub&gt;2&lt;/sub&gt;, ..., ''y''&lt;sub&gt;''n''&lt;/sub&gt;}, then we can replace ''x''{''Y''}''z'' by ''xy''&lt;sub&gt;1&lt;/sub&gt;{''Y''}''z'' ∪ ''xy''&lt;sub&gt;2&lt;/sub&gt;{''Y''}''z'' ∪ ... ∪ ''xy''&lt;sub&gt;''n''&lt;/sub&gt;{''Y''}''z'' and re-run the methods on this new language.

If all remain families are linear families (i.e. of the form ''x''{''y''}''z'', where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''y'' is a digit in base ''b''), then we search the smallest (probable) primes in these families and add these primes to the list.

e.g. in decimal (base ''b'' = 10):

* The smallest prime in the family 5{0}27 is 5000000000000000000000000000027.
* The smallest prime in the family {5}1 is 555555555551.
* The smallest prime in the family 8{5}1 is 8555555555555555555551, but 8555555555555555555551 is not a minimal element since 555555555551 is a subsequence of 8555555555555555555551.

There is no guarantee that the techniques discussed will ever terminate, but in practice they often do. They are able to determine the set of the minimal elements in base ''b'' for 2 ≤ ''b'' ≤ 16 and ''b'' = 18, 20, 22, 24, 30. The bases ''b'' = 17, 19, 21, 23, 25 ≤ ''b'' ≤ 29, 31 ≤ ''b'' ≤ 36 are solved with the exception of 771 families of the form ''x''{''y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''y'' is a digit in base ''b'').

The following is a &quot;[[:w:Semi-algorithm|semi-algorithm]]&quot; that is guaranteed to solve the Athena problem for a given base ''b'', but it is not so easy to implement:

# ''M'' = ''[[:w:Empty string|∅]]''
# while (''L'' ≠ ''∅'') do
# choose ''x'', a shortest string in ''L''
# ''M'' := ''M'' ∪ {''x''}
# ''L'' := ''L'' − ''sup''({''x''})

In practice, for arbitrary ''L'', we cannot feasibly carry out step 5. Instead, we work with ''L''&amp;#39;, some regular overapproximation to ''L'', until we can show ''L''&amp;#39; = ''∅'' (which implies ''L'' = ''∅''). In practice, ''L''&amp;#39; is usually chosen to be a finite [[:w:Union (set theory)|union]] of sets of the form ''L''&lt;sub&gt;1&lt;/sub&gt;{''L''&lt;sub&gt;2&lt;/sub&gt;}''L''&lt;sub&gt;3&lt;/sub&gt;, where each of ''L''&lt;sub&gt;1&lt;/sub&gt;, ''L''&lt;sub&gt;2&lt;/sub&gt;, ''L''&lt;sub&gt;3&lt;/sub&gt; is finite. In the case we consider in this project, we then have to determine whether such a family contains a prime or not.

Thus, Athena problem in bases ''b'' around 500 may be [[:w:NP-complete|NP-complete]] or [[:w:NP-hard|NP-hard]], or an [[:w:Undecidable problem|undecidable problem]], or an example of [[:w:Gödel's incompleteness theorems|Gödel's incompleteness theorems]] (like the [[:w:Continuum hypothesis|continuum hypothesis]] and the [[:w:Halting problem|halting problem]]).

To solve the Athena problem, we need to determine whether a given family contains a prime. In practice, if family ''x''{''Y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''Y'' is a set of digits in base ''b'') could not be ruled out as only containing composites and ''Y'' contains two or more digits, then a relatively small prime &gt; ''b'' could always be found in this family. Intuitively, this is because there are a large number of small strings in such a family, and at least one is likely to be prime (e.g. there are 2&lt;sup&gt;''n''−2&lt;/sup&gt; strings of length ''n'' in the family 1{3,7}9, and there are over a thousand strings of length 12 in the family 1{3,7}9, thus it is very impossible that these numbers are all composite). In the case ''Y'' contains only one digit, this family is of the form ''x''{''y''}''z'', and there is only a single string of each length &gt; (the length of ''x'' + the length of ''z''), and it is not known if the following [[:w:Decision problem|decision problem]] is recursively solvable (just like [[:w:Sierpiński number|Sierpiński problem]] and [[:w:Riesel number|Riesel problem]], Sierpiński problem and Riesel problem can be generalized to other bases ''b'', in fact, Athena problem in base ''b'' covers the Sierpiński problem in base ''b'' and the Riesel problem in base ''b'' with ''k'' &lt; ''b'', i.e. finding the smallest prime of the form ''k''×''b''&lt;sup&gt;''n''&lt;/sup&gt;+1 and ''k''×''b''&lt;sup&gt;''n''&lt;/sup&gt;−1 (or prove such prime does not exist) with ''k'' &lt; ''b'', since the smallest prime of the form ''k''×''b''&lt;sup&gt;''n''&lt;/sup&gt;+1 and ''k''×''b''&lt;sup&gt;''n''&lt;/sup&gt;−1 (if exists) must be a minimal element in base ''b''):

Problem: Given strings ''x'', ''z'' (may be empty), a digit ''y'', and a base ''b'' (''x'' does not [[:w:Leading zero|start with the digit 0]], ''z'' ends with a digit which [[:w:Coprime integers|coprime]] to ''b'', ''y'' is not 0 if ''x'' is empty, ''y'' is coprime to ''b'' if ''z'' is empty), does there exist a prime number whose base-''b'' expansion is of the form ''xy''&lt;sub&gt;''n''&lt;/sub&gt;''z'' for some ''n'' ≥ 0?

Some families can be ruled out to contain no prime &gt; ''b'' by [[:w:Covering set|covering congruence]], [[:w:Factorization of polynomials|algebraic factorization]] (e.g. [[:w:Difference of two squares|difference of two squares]], [[:w:Sum of two cubes|sum of two cubes]], [[:w:Sophie Germain's identity|Sophie Germain's identity of ''x''&lt;sup&gt;4&lt;/sup&gt;+4×''y''&lt;sup&gt;4&lt;/sup&gt;]]), or combine of them, e.g.

* The base 9 family 2{7}: Always divisible by 2 or 5
* The base 16 family {8}F: Always divisible by 3, 7, or 13
* The base 21 family {7}D: Always divisible by 2, 13, or 17
* The base 23 family {D}GA: Always divisible by 2, 5, 7, 37, or 79
* The base 9 family 3{8}: Can be written as 4×9&lt;sup&gt;''n''&lt;/sup&gt;−1 and can be factored as (2×3&lt;sup&gt;''n''&lt;/sup&gt;−1) × (2×3&lt;sup&gt;''n''&lt;/sup&gt;+1)
* The base 8 family 1{0}1: Can be written as 8&lt;sup&gt;''n''&lt;/sup&gt;+1 and can be factored as (2&lt;sup&gt;''n''&lt;/sup&gt;+1) × (4&lt;sup&gt;''n''&lt;/sup&gt;−2&lt;sup&gt;''n''&lt;/sup&gt;+1)
* The base 16 family {4}1: Can be written as (4×16&lt;sup&gt;''n''&lt;/sup&gt;−49)/15 and can be factored as (2×3&lt;sup&gt;''n''&lt;/sup&gt;−7) × (2×3&lt;sup&gt;''n''&lt;/sup&gt;+7) / 15
* The base 16 family {C}D: Can be written as (4×16&lt;sup&gt;''n''&lt;/sup&gt;+1)/5 and can be factored as (2×4&lt;sup&gt;''n''&lt;/sup&gt;−2×2&lt;sup&gt;''n''&lt;/sup&gt;+1) × (2×4&lt;sup&gt;''n''&lt;/sup&gt;+2×2&lt;sup&gt;''n''&lt;/sup&gt;+1) / 5
* The base 14 family 8{D}: Can be written as 9×14&lt;sup&gt;''n''&lt;/sup&gt;−1, it is divisible by 5 if ''n'' is odd and can be factored as (3×14&lt;sup&gt;''n''/2&lt;/sup&gt;−1) × (3×14&lt;sup&gt;''n''/2&lt;/sup&gt;+1) if ''n'' is even
* The base 12 family {B}9B: Can be written as 12&lt;sup&gt;''n''&lt;/sup&gt;−25, it is divisible by 13 if ''n'' is odd and can be factored as (12&lt;sup&gt;''n''/2&lt;/sup&gt;−5) × (12&lt;sup&gt;''n''/2&lt;/sup&gt;+5) if ''n'' is even
* The base 17 family 1{9}: Can be written as (25×17&lt;sup&gt;''n''&lt;/sup&gt;−9)/16, it is divisible by 2 if ''n'' is odd and can be factored as (5×17&lt;sup&gt;''n''/2&lt;/sup&gt;−3) × (5×17&lt;sup&gt;''n''/2&lt;/sup&gt;+3) / 16 if ''n'' is even
* The base 19 family 1{6}: Can be written as (4×19&lt;sup&gt;''n''&lt;/sup&gt;−1)/3, it is divisible by 5 if ''n'' is odd and can be factored as (2×19&lt;sup&gt;''n''/2&lt;/sup&gt;−1) × (2×19&lt;sup&gt;''n''/2&lt;/sup&gt;+1) / 3 if ''n'' is even

By the [[:w:Prime number theorem|prime number theorem]], the [[:w:Probability|chance]] that a [[:w:Random number|random]] ''n''-digit base ''b'' number is prime is [[:w:Asymptotic analysis|approximately]] 1/''n'' (more accurately, the chance is approximately 1/(''n''×''ln''(''b'')), where ''ln'' is the [[:w:Natural logarithm|natural logarithm]]). If one conjectures the numbers ''x''{''y''}''z'' behave similarly (i.e. the numbers ''x''{''y''}''z'' is a [[:w:Pseudorandomness|pseudorandom sequence]]) you would expect [[:w:Harmonic_series (mathematics)|1/1 + 1/2 + 1/3 + 1/4 + ... = ∞]] primes of the form ''x''{''y''}''z'' (of course, this does not always happen, since some ''x''{''y''}''z'' families can be ruled out to contain no prime &gt; ''b'' (by covering congruence, algebraic factorization, or combine of them), but it is at least a reasonable conjecture in the absence of evidence to the contrary. Hence, the [[:w:Heuristic argument|heuristic argument]] suggests there are always infinitely many primes in family ''x''{''y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''y'' is a digit in base ''b'') if it cannot be ruled out to contain no prime or only contain finitely many primes, by covering congruence, algebraic factorization, or combine of them. However, some families ''x''{''y''}''z'' could not be proven to contain no primes &gt; ''b'' (by covering congruence, algebraic factorization, or combine of them) but no primes &gt; ''b'' could be found in the family, even after searching through numbers with over 100000 digits. In such a case, the only way to proceed is to test the primality of larger and larger numbers of such form and hope a prime is eventually discovered. e.g. the smallest (probable) prime in the family A{3}A in base ''b'' = 13 is A3&lt;sub&gt;592197&lt;/sub&gt;A, which written in decimal contains 659677 digits (it is only probable prime, i.e. not definitely prime).

All numbers are written in base ''b'', [[:w:Senary#Base 36 as senary compression|using A to Z to represent digit values 10 to 35]], &quot;{}&quot; means repeating, e.g. family 12{3}45 means the sequence {1245, 12345, 123345, 1233345, 12333345, 123333345, ...} (where the members are expressed as base ''b'' strings), subscripts are used to indicate repetitions of digits, e.g. 123&lt;sub&gt;4&lt;/sub&gt;567 means 123333567 (all subscripts are written in decimal).

Base 2: 1 prime (the largest of which has 2 digits): {11}

Base 3: 3 primes (the largest of which has 3 digits): {12, 21, 111}

Base 4: 5 primes (the largest of which has 3 digits): {11, 13, 23, 31, 221}

Base 5: 22 primes (the largest of which has 96 digits): {12, 21, 23, 32, 34, 43, 104, 111, 131, 133, 313, 401, 414, 3101, 10103, 14444, 30301, 33001, 33331, 44441, 300031, 100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000013}

Base 6: 11 primes (the largest of which has 5 digits): {11, 15, 21, 25, 31, 35, 45, 51, 4401, 4441, 40041}

Base 7: 71 primes (the largest of which has 17 digits): {14, 16, 23, 25, 32, 41, 43, 52, 56, 61, 65, 113, 115, 131, 133, 155, 212, 221, 304, 313, 335, 344, 346, 364, 445, 515, 533, 535, 544, 551, 553, 1022, 1051, 1112, 1202, 1211, 1222, 2111, 3031, 3055, 3334, 3503, 3505, 3545, 4504, 4555, 5011, 5455, 5545, 5554, 6034, 6634, 11111, 11201, 30011, 30101, 31001, 31111, 33001, 33311, 35555, 40054, 100121, 150001, 300053, 351101, 531101, 1100021, 33333301, 5100000001, 33333333333333331}

Base 8: 75 primes (the largest of which has 221 digits): {13, 15, 21, 23, 27, 35, 37, 45, 51, 53, 57, 65, 73, 75, 107, 111, 117, 141, 147, 161, 177, 225, 255, 301, 343, 361, 401, 407, 417, 431, 433, 463, 467, 471, 631, 643, 661, 667, 701, 711, 717, 747, 767, 3331, 3411, 4043, 4443, 4611, 5205, 6007, 6101, 6441, 6477, 6707, 6777, 7461, 7641, 47777, 60171, 60411, 60741, 444641, 500025, 505525, 3344441, 4444477, 5500525, 5550525, 55555025, 444444441, 744444441, 77774444441, 7777777777771, 555555555555525, 44444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444447}

Base 9: 151 primes (the largest of which has 1161 digits): {12, 14, 18, 21, 25, 32, 34, 41, 45, 47, 52, 58, 65, 67, 74, 78, 81, 87, 117, 131, 135, 151, 155, 175, 177, 238, 272, 308, 315, 331, 337, 355, 371, 375, 377, 438, 504, 515, 517, 531, 537, 557, 564, 601, 638, 661, 702, 711, 722, 735, 737, 751, 755, 757, 771, 805, 838, 1011, 1015, 1101, 1701, 2027, 2207, 3017, 3057, 3101, 3501, 3561, 3611, 3688, 3868, 5035, 5051, 5071, 5101, 5501, 5554, 5705, 5707, 7017, 7075, 7105, 7301, 8535, 8544, 8555, 8854, 20777, 22227, 22777, 30161, 33388, 50161, 50611, 53335, 55111, 55535, 55551, 57061, 57775, 70631, 71007, 77207, 100037, 100071, 100761, 105007, 270707, 301111, 305111, 333035, 333385, 333835, 338885, 350007, 500075, 530005, 555611, 631111, 720707, 2770007, 3030335, 7776662, 30300005, 30333335, 38333335, 51116111, 70000361, 300030005, 300033305, 351111111, 1300000007, 5161111111, 8333333335, 300000000035, 311111111161, 544444444444, 2000000000007, 5700000000001, 7270000000007, 88888888833335, 100000000000507, 5111111111111161, 7277777777777777707, 8888888888888888888335, 30000000000000000000051, 1000000000000000000000000057, 56111111111111111111111111111111111111, 7666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666662, 27777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777707, 300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000011}

Base 10: 77 primes (the largest of which has 31 digits): {11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 227, 251, 257, 277, 281, 349, 409, 449, 499, 521, 557, 577, 587, 727, 757, 787, 821, 827, 857, 877, 881, 887, 991, 2087, 2221, 5051, 5081, 5501, 5581, 5801, 5851, 6469, 6949, 8501, 9001, 9049, 9221, 9551, 9649, 9851, 9949, 20021, 20201, 50207, 60649, 80051, 666649, 946669, 5200007, 22000001, 60000049, 66000049, 66600049, 80555551, 555555555551, 5000000000000000000000000000027}

Base 11: 1068 primes (including 1 unproven probable prime: 57&lt;sub&gt;62668&lt;/sub&gt;), the largest of which has 62669 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel11 Data of Athena problem base 11]

Base 12: 106 primes (the largest of which has 42 digits): {11, 15, 17, 1B, 25, 27, 31, 35, 37, 3B, 45, 4B, 51, 57, 5B, 61, 67, 6B, 75, 81, 85, 87, 8B, 91, 95, A7, AB, B5, B7, 221, 241, 2A1, 2B1, 2BB, 401, 421, 447, 471, 497, 565, 655, 665, 701, 70B, 721, 747, 771, 77B, 797, 7A1, 7BB, 907, 90B, 9BB, A41, B21, B2B, 2001, 200B, 202B, 222B, 229B, 292B, 299B, 4441, 4707, 4777, 6A05, 6AA5, 729B, 7441, 7B41, 929B, 9777, 992B, 9947, 997B, 9997, A0A1, A201, A605, A6A5, AA65, B001, B0B1, BB01, BB41, 600A5, 7999B, 9999B, AAAA1, B04A1, B0B9B, BAA01, BAAA1, BB09B, BBBB1, 44AAA1, A00065, BBBAA1, AAA0001, B00099B, AA000001, BBBBBB99B, B0000000000000000000000000009B, 400000000000000000000000000000000000000077}

Base 13: 3197 primes (including 4 unproven probable primes: C5&lt;sub&gt;23755&lt;/sub&gt;C, 80&lt;sub&gt;32017&lt;/sub&gt;111, 95&lt;sub&gt;197420&lt;/sub&gt;, A3&lt;sub&gt;592197&lt;/sub&gt;A), the largest of which has 592199 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel13 Data of Athena problem base 13]

Base 14: 650 primes, the largest of which has 19699 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel14 Data of Athena problem base 14]

Base 15: 1284 primes, the largest of which has 157 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel15 Data of Athena problem base 15]

Base 16: 2347 primes (including 3 unproven probable primes: DB&lt;sub&gt;32234&lt;/sub&gt;, 4&lt;sub&gt;72785&lt;/sub&gt;DD, 3&lt;sub&gt;116137&lt;/sub&gt;AF), the largest of which has 116139 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel16 Data of Athena problem base 16]

Base 17: 10415 known primes (including many unproven probable primes) and 12 unsolved families (1{7}, 1F{0}7, 4{7}A, 70F{0}D, 8{B}9, 9{5}9, A{D}F, B{0}B3, {B}E9, {B}EE, F1{9}, FD0{D}, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel17 Data of Athena problem base 17] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left17 Data of unsolved families for base 17]

Base 18: 549 primes, the largest of which has 6271 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel18 Data of Athena problem base 18]

Base 19: 31417 known primes (including many unproven probable primes) and 17 unsolved families (4B5{0}H, {5}3, 5{H}05, 5{H}0H, 5{H}5, 66{B}, 71{0}177, 7AF{0}H, 97{0}3, C{H}C, EE1{6}, F{7}5, F{B}G, F{D}F, H0F{0}7A, HB{0}5B5, II{D}, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel19 Data of Athena problem base 19] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left19 Data of unsolved families for base 19]

Base 20: 3314 primes, the largest of which has 6271 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel20 Data of Athena problem base 20]

Base 21: 13386 known primes (including many unproven probable primes) and 8 unsolved families (5{0}DJ, {9}D, B3{0}EB, B{H}6H, C{F}0K, {F}35, G{0}FK, H{0}7771, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel21 Data of Athena problem base 21] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left21 Data of unsolved families for base 21]

Base 22: 8003 primes (including 1 unproven probable prime: BK&lt;sub&gt;22001&lt;/sub&gt;5), the largest of which has 22003 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel22 Data of Athena problem base 22]

Base 23: 65178 known primes (including many unproven probable primes) and 87 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel23 Data of Athena problem base 23] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left23 Data of unsolved families for base 23]

Base 24: 3409 primes, the largest of which has 8134 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel24 Data of Athena problem base 24]

Base 25: 133639 known primes (including many unproven probable primes) and 85 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel25 Data of Athena problem base 25] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left25 Data of unsolved families for base 25]

Base 26: 25256 known primes (including 7 unproven probable primes: 5&lt;sub&gt;19391&lt;/sub&gt;6F, 7&lt;sub&gt;20279&lt;/sub&gt;OL, LD0&lt;sub&gt;20975&lt;/sub&gt;7, 6K&lt;sub&gt;23300&lt;/sub&gt;5, J0&lt;sub&gt;44303&lt;/sub&gt;KCB, M0&lt;sub&gt;61186&lt;/sub&gt;2BB, 85M&lt;sub&gt;197060&lt;/sub&gt;B) and 3 unsolved families ({A}6F, {H}MH, {I}GL, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel26 Data of Athena problem base 26]

Base 27: 102852 known primes (including many unproven probable primes) and 44 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel27 Data of Athena problem base 27] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left27 Data of unsolved families for base 27]

Base 28: 25528 known primes (including 3 unproven probable primes: N6&lt;sub&gt;24051&lt;/sub&gt;LR, 5OA&lt;sub&gt;31238&lt;/sub&gt;F, O4O&lt;sub&gt;94535&lt;/sub&gt;9) and 1 unsolved family (O{A}F, no primes or probable primes with length ≤ 709070, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel28 Data of Athena problem base 28]

Base 29: 355242 known primes (including many unproven probable primes) and 125 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel29 Data of Athena problem base 29] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left29 Data of unsolved families for base 29]

Base 30: 2619 primes (including 1 unproven probable prime: I0&lt;sub&gt;24608&lt;/sub&gt;D), the largest of which has 34206 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel30 Data of Athena problem base 30]

Base 31: 569323 known primes (including many unproven probable primes) and 77 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel31 Data of Athena problem base 31] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left31 Data of unsolved families for base 31]

Base 32: 168882 known primes (including many unproven probable primes) and 120 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel32 Data of Athena problem base 32] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left32 Data of unsolved families for base 32]

Base 33: 280012 known primes (including many unproven probable primes) and 81 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel33 Data of Athena problem base 33] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left33 Data of unsolved families for base 33]

Base 34: 184785 known primes (including many unproven probable primes) and 47 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel34 Data of Athena problem base 34] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left34 Data of unsolved families for base 34]

Base 35: 720002 known primes (including many unproven probable primes) and 60 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel35 Data of Athena problem base 35] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left35 Data of unsolved families for base 35]

Base 36: 35286 known primes (including 3 unproven probable primes: 7K&lt;sub&gt;26567&lt;/sub&gt;Z, S0&lt;sub&gt;75007&lt;/sub&gt;8H, P&lt;sub&gt;81993&lt;/sub&gt;SZ) and 4 unsolved families (B{0}EUV, HM{0}N, N{0}YYN, O{L}Z, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel36 Data of Athena problem base 36]

== The fully proof of Athena problem in decimal (base ''b'' = 10) ==

'''Bold''' for the minimal elements, ''x'' ◁ ''y'' means ''x'' is a subsequence of ''y''.

Assume ''p'' is a prime &gt; 10, and the last digit of ''p'' must lie in {1,3,7,9}.

Case 1: ''p'' ends with 1.

In this case we can write ''p'' = ''x''1. If ''x'' contains 1, 3, 4, 6, or 7, then (respectively) '''11''' ◁ ''p'', '''31''' ◁ ''p'', '''41''' ◁ ''p'', '''61''' ◁ ''p'', or '''71''' ◁ ''p''. Hence we may assume all digits of ''x'' are 0, 2, 5, 8, or 9.

Case 1.1: ''p'' begins with 2.

In this case we can write ''p'' = 2''y''1. If 5 ◁ ''y'', then '''251''' ◁ ''p''. If 8 ◁ ''y'', then '''281''' ◁ ''p''. If 9 ◁ ''y'', then 29 ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 2.

If 22 ◁ ''y'', then '''2221''' ◁ ''p''. Hence we may assume ''y'' contains zero or one 2's.

If ''y'' contains no 2's, then ''p'' ∈ 2{0}1. But then, since the sum of the digits of ''p'' is 3, ''p'' is divisible by 3, so ''p'' cannot be prime.

If ''y'' contains exactly one 2, then we can write ''p'' = 2''z''2''w''1, where ''z'',''w'' ∈ {0}. If 0 ◁ ''z'' and 0 ◁ ''w'', then '''20201''' ◁ ''p''. Hence we may assume either ''z'' or ''w'' is empty.

If ''z'' is empty, then ''p'' ∈ 22{0}1, and the smallest prime ''p'' ∈ 22{0}1 is '''22000001'''.

If ''w'' is empty, then ''p'' ∈ 2{0}21, and the smallest prime ''p'' ∈ 2{0}21 is '''20021'''.

Case 1.2: ''p'' begins with 5.

In this case we can write ''p'' = 5''y''1. If 2 ◁ ''y'', then '''521''' ◁ ''p''. If 9 ◁ ''y'', then 59 ◁ ''p''. Hence we may assume all digits of ''y'' are 0, 5, or 8.

If 05 ◁ ''y'', then '''5051''' ◁ ''p''. If 08 ◁ ''y'', then '''5081''' ◁ ''p''. If 50 ◁ ''y'', then '''5501''' ◁ ''p''. If 58 ◁ ''y'', then '''5581''' ◁ ''p''. If 80 ◁ ''y'', then '''5801''' ◁ ''p''. If 85 ◁ ''y'', then '''5851''' ◁ ''p''. Hence we may assume ''y'' ∈ {0} ∪ {5} ∪ {8}.

If ''y'' ∈ {0}, then ''p'' ∈ 5{0}1. But then, since the sum of the digits of ''p'' is 6, ''p'' is divisible by 3, so ''p'' cannot be prime.

If ''y'' ∈ {5}, then ''p'' ∈ 5{5}1, and the smallest prime ''p'' ∈ 5{5}1 is '''555555555551'''.

If ''y'' ∈ {8}, since if 88 ◁ ''y'', then 881 ◁ ''p'', hence we may assume ''y'' ∈ {''𝜆'',8}, and thus ''p'' ∈ {51,581}, but 51 and 581 are both composite.

Case 1.3: ''p'' begins with 8.

In this case we can write p = 8''y''1. If 2 ◁ ''y'', then '''821''' ◁ ''p''. If 8 ◁ ''y'', then '''881''' ◁ ''p''. If 9 ◁ ''y'', then 89 ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 5.

If 50 ◁ ''y'', then '''8501''' ◁ ''p''. Hence we may assume y ∈ {0}{5}.

If 005 ◁ ''y'', then '''80051''' ◁ p. Hence we may assume y ∈ {0} ∪ {5} ∪ 0{5}.

If y ∈ {0}, then ''p'' ∈ 8{0}1. But then, since the sum of the digits of ''p'' is 9, ''p'' is divisible by 3, so ''p'' cannot be prime.

If y ∈ {5}, since if 55555555555 ◁ ''y'', then 555555555551 ◁ ''p'', hence we may assume ''y'' ∈ {''𝜆'', 5, 55, 555, 5555, 55555, 555555, 5555555, 55555555, 555555555, 5555555555}, and thus ''p'' ∈ {81, 851, 8551, 85551, 855551, 8555551, 85555551, 855555551, 8555555551, 85555555551, 855555555551}, but all of these numbers are composite.

If y ∈ 0{5}, since if 55555555555 ◁ ''y'', then 555555555551 ◁ ''p'', hence we may assume ''y'' ∈ {0, 05, 055, 0555, 05555, 055555, 0555555, 05555555, 055555555, 0555555555, 05555555555}, and thus ''p'' ∈ {801, 8051, 80551, 805551, 8055551, 80555551, 805555551, 8055555551, 80555555551, 805555555551, 8055555555551}, and of these numbers only 80555551 and 8055555551 are primes, but 80555551 ◁ 8055555551, thus only '''80555551''' is a minimal element.

Case 1.4: ''p'' begins with 9.

In this case we can write p = 9''y''1. If 9 ◁ ''y'', then '''991''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0, 2, 5, or 8.

If 00 ◁ ''y'', then '''9001''' ◁ ''p''. If 22 ◁ ''y'', then '''9221''' ◁ ''p''. If 55 ◁ ''y'', then '''9551''' ◁ ''p''. If 88 ◁ ''y'', then 881 ◁ ''p''. Hence we may assume ''y'' contains at most one 0, at most one 2, at most one 5, and at most one 8.

If ''y'' only contains at most one 0 and does not contain any of {2,5,8}, then ''y'' ∈ {''𝜆'',0}, and thus ''p'' ∈ {91,901}, but 91 and 901 are both composite. If ''y'' only contains at most one 0 and only one of {2,5,8}, then the sum of the digits of ''p'' is divisible by 3, ''p'' is divisible by 3, so ''p'' cannot be prime. Hence we may assume ''y'' contains at least two of {2,5,8}.

If 25 ◁ ''y'', then 251 ◁ ''p''. If 28 ◁ ''y'', then 281 ◁ ''p''. If 52 ◁ ''y'', then 521 ◁ ''p''. If 82 ◁ ''y'', then 821 ◁ ''p''. Hence we may assume ''y'' contains no 2's (since if ''y'' contains 2, then ''y'' cannot contain either 5's or 8's, which is a contradiction).

If 85 ◁ ''y'', then '''9851''' ◁ ''p''. Hence we may assume ''y'' ∈ {58,580,508,058}, and thus ''p'' ∈ {9581,95801,95081,90581}, and of these numbers only 95801 is prime, but 95801 is not a minimal element since 5801 ◁ 95801.

Case 2: ''p'' ends with 3.

In this case we can write p = ''x''3. If ''x'' contains 1, 2, 4, 5, 7, or 8, then (respectively) '''13''' ◁ ''p'', '''23''' ◁ ''p'', '''43''' ◁ ''p'', '''53''' ◁ ''p'', '''73''' ◁ ''p'', or '''83''' ◁ ''p''. Hence we may assume all digits of ''x'' are 0, 3, 6, or 9, and thus all digits of ''p'' are 0, 3, 6, or 9. But then, since the digits of ''p'' all have a common factor 3, ''p'' is divisible by 3, so ''p'' cannot be prime.

Case 3: ''p'' ends with 7.

In this case we can write ''p'' = ''x''7. If ''x'' contains 1, 3, 4, 6, or 9, then (respectively) '''17''' ◁ ''p'', '''37''' ◁ ''p'', '''47''' ◁ ''p'', '''67''' ◁ ''p'', or '''97''' ◁ ''p''. Hence we may assume all digits of ''x'' are 0, 2, 5, 7, or 8.

Case 3.1: ''p'' begins with 2.

In this case we can write ''p'' = 2''y''7. If 2 ◁ ''y'', then '''227''' ◁ ''p''. If 5 ◁ ''y'', then '''257''' ◁ ''p''. If 7 ◁ ''y'', then '''277''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 8.

If 08 ◁ ''y'', then '''2087''' ◁ ''p''. If 88 ◁ ''y'', then 887 ◁ ''p''. Hence we may assume ''y'' ∈ {0} ∪ 8{0}.

If ''y'' ∈ {0}, then ''p'' ∈ 2{0}7. But then, since the sum of the digits of ''p'' is 9, ''p'' is divisible by 3, so ''p'' cannot be prime.

If y ∈ 8{0}, then ''p'' ∈ 28{0}7. But then ''p'' is divisible by 7, since for ''n'' ≥ 0 we have 7 × 40&lt;sub&gt;''n''&lt;/sub&gt;1 = 280&lt;sub&gt;''n''&lt;/sub&gt;7.

Case 3.2: ''p'' begins with 5.

In this case we can write ''p'' = 5''y''7. If 5 ◁ ''y'', then '''557''' ◁ ''p''. If 7 ◁ ''y'', then '''577''' ◁ ''p''. If 8 ◁ ''y'', then '''587''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 2.

If 22 ◁ ''y'', then 227 ◁ ''p''. Hence we may assume ''y'' contains zero or one 2's.

If ''y'' contains no 2's, then ''p'' ∈ 5{0}7. But then, since the sum of the digits of ''p'' is 12, ''p'' is divisible by 3, so ''p'' cannot be prime.

If ''y'' contains exactly one 2, then we can write ''p'' = 5''z''2''w''7, where ''z'',''w'' ∈ {0}. If 0 ◁ ''z'' and 0 ◁ ''w'', then '''50207''' ◁ ''p''. Hence we may assume either ''z'' or ''w'' is empty.

If ''z'' is empty, then ''p'' ∈ 52{0}7, and the smallest prime ''p'' ∈ 52{0}7 is '''5200007'''.

If ''w'' is empty, then ''p'' ∈ 5{0}27, and the smallest prime ''p'' ∈ 5{0}27 is '''5000000000000000000000000000027'''.

Case 3.3: ''p'' begins with 7.

In this case we can write ''p'' = 7''y''7. If 2 ◁ ''y'', then '''727''' ◁ ''p''. If 5 ◁ ''y'', then '''757''' ◁ ''p''. If 8 ◁ ''y'', then '''787''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 7, and thus all digits of ''p'' are 0 or 7. But then, since the digits of ''p'' all have a common factor 7, ''p'' is divisible by 7, so ''p'' cannot be prime.

Case 3.4: ''p'' begins with 8.

In this case we can write ''p'' = 8''y''7. If 2 ◁ ''y'', then '''827''' ◁ ''p''. If 5 ◁ ''y'', then '''857''' ◁ ''p''. If 7 ◁ ''y'', then '''877''' ◁ ''p''. If 8 ◁ ''y'', then '''887''' ◁ ''p''. Hence we may assume ''y'' ∈ {0}, and thus ''p'' ∈ 8{0}7. But then, since the sum of the digits of ''p'' is 15, ''p'' is divisible by 3, so ''p'' cannot be prime.

Case 4: ''p'' ends with 9.

In this case we can write ''p'' = ''x''9. If ''x'' contains 1, 2, 5, 7, or 8, then (respectively) '''19''' ◁ ''p'', '''29''' ◁ ''p'', '''59''' ◁ ''p'', '''79''' ◁ ''p'', or '''89''' ◁ ''p''. Hence we may assume all digits of ''x'' are 0, 3, 4, 6, or 9.

If 44 ◁ ''x'', then '''449''' ◁ ''p''. Hence we may assume ''x'' contains zero or one 4's.

If x contains no 4's, then all digits of ''x'' are 0, 3, 6, or 9, and thus all digits of ''p'' are 0, 3, 6, or 9. But then, since the digits of ''p'' all have a common factor 3, ''p'' is divisible by 3, so ''p'' cannot be prime. Hence we may assume that ''x'' contains exactly one 4.

Case 4.1: ''p'' begins with 3.

In this case we can write ''p'' = 3''y''4''z''9, where all digits of ''y'', ''z'' are 0, 3, 6, or 9. We must have '''349''' ◁ ''p''.

Case 4.2: ''p'' begins with 4.

In this case we can write ''p'' = 4''y''9, where all digits of ''y'' are 0, 3, 6, or 9. If 0 ◁ ''y'', then '''409''' ◁ ''p''. If 3 ◁ ''y'', then 43 ◁ ''p''. If 9 ◁ ''y'', then '''499''' ◁ ''p''. Hence we may assume ''y'' ∈ {6}, and thus ''p'' ∈ 4{6}9. But then ''p'' is divisible by 7, since for ''n'' ≥ 0 we have 7 × 6&lt;sub&gt;''n''&lt;/sub&gt;7 = 46&lt;sub&gt;''n''&lt;/sub&gt;9.

Case 4.3: ''p'' begins with 6.

In this case we can write p = 6''y''4''z''9, where all digits of ''y'', ''z'' are 0, 3, 6, or 9. If 0 ◁ ''z'', then 409 ◁ ''p''. If 3 ◁ ''z'', then 43 ◁ ''p''. If 6 ◁ ''z'', then '''6469''' ◁ ''p''. If 9 ◁ ''z'', then 499 ◁ ''p''. Hence we may assume ''z'' is empty.

If 3 ◁ ''y'', then 349 ◁ ''p''. If 9 ◁ ''y'', then '''6949''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 6.

If 06 ◁ ''y'', then '''60649''' ◁ ''p''. Hence we may assume ''y'' ∈ {6}{0}.

If 666 ◁ ''y'', then '''666649''' ◁ ''p''. If 00000 ◁ ''y'', then '''60000049''' ◁ ''p''. Hence we may assume ''y'' ∈ {''𝜆'', 0, 00, 000, 0000, 6, 60, 600, 6000, 60000, 66, 660, 6600, 66000, 660000}, and thus ''p'' ∈ {649, 6049, 60049, 600049, 6000049, 6649, 66049, 660049, 6600049, 66000049, 66649, 666049, 6660049, 66600049, 666000049}, and of these numbers only '''66000049''' and '''66600049''' are primes.

Case 4.4: ''p'' begins with 9.

In this case we can write p = 9''y''4''z''9, where all digits of ''y'', ''z'' are 0, 3, 6, or 9. If 0 ◁ ''y'', then '''9049''' ◁ ''p''. If 3 ◁ ''y'', then 349 ◁ ''p''. If 6 ◁ ''y'', then '''9649''' ◁ ''p''. If 9 ◁ ''y'', then '''9949''' ◁ ''p''. Hence we may assume ''y'' is empty.

If 0 ◁ ''z'', then 409 ◁ ''p''. If 3 ◁ ''z'', then 43 ◁ ''p''. If 9 ◁ ''z'', then 499 ◁ ''p''. Hence we may assume ''z'' ∈ {6}, and thus ''p'' ∈ 94{6}9, and the smallest prime ''p'' ∈ 94{6}9 is 946669.

[[Category:Number theory]]</text>
      <sha1>8r908qjm53nba397iyt88zqtj5yddro</sha1>
    </revision>
    <revision>
      <id>2809761</id>
      <parentid>2809760</parentid>
      <timestamp>2026-05-16T22:07:39Z</timestamp>
      <contributor>
        <username>雅典娜241</username>
        <id>3071373</id>
      </contributor>
      <origin>2809761</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="45220" sha1="ctsh9tb57k3l69skxkc3dme3uhocduh" xml:space="preserve">'''Athena problem''' is an [[:w:List of unsolved problems in mathematics|unsolved problem]] in [[:w:Number theory|number theory]] and [[:w:Formal language theory|formal language theory]] and [[:w:Order theory|order theory]], this problem is named after the ancient Greek goddess [[:w:Athena|Athena]] (which is associated with [[:w:Wisdom|wisdom]]). Athena problem is: Give a [[:w:Natural number|natural number]] ''b'' &gt; 1, find the [[:w:Set (mathematics)|set]] of the [[:w:Minimal element|minimal element]]s of the set of the &quot;[[:w:Prime number|prime number]] [[:w:Greater than|&gt;]] ''b''&quot; [[:w:Numerical digit|digit]] [[:w:String (computer science)|string]]s in the [[:w:Positional numeral system|positional numeral system]] with [[:w:Radix|base]] ''b'' for the [[:w:Subsequence|subsequence]] [[:w:Partially ordered set|ordering]]. (A string ''x'' is a subsequence of another string ''y'', if ''x'' can be obtained from ''y'' by deleting zero or more of the [[:w:Character (computing)|character]]s in ''y''. For example, 514 is a subsequence of 352148, &quot;string&quot; is a subsequence of &quot;meistersinger&quot;. In contrast, 758 is not a subsequence of 378259, &quot;abc&quot; is not a subsequence of &quot;cbacacba&quot;, since the characters must be in the same order) (Unlike [[:w:Substring|substring]], subsequence is not required to occupy consecutive positions within the original sequences)

Using [[:w:Formal language theory|formal language theory]] terminology, Athena problem is finding the [[:w:Set (mathematics)|set]] of the [[:w:Minimal element|minimal element]]s of the [[:w:Formal language|language]] of base-''b'' [[:w:Representation (mathematics)|representation]]s of the [[:w:Prime number|prime number]]s [[:w:Greater than|&gt;]] ''b'' (which is a set of [[:w:String (computer science)|string]]s of [[:w:Symbol|symbol]]s over the [[:w:Alphabet (formal languages)|alphabet]] ''Σ''&lt;sub&gt;''b''&lt;/sub&gt; := {0, 1, ..., ''b''−1}), under the subsequence ordering (i.e. the [[:w:Binary relation|binary relation]] &quot;is a subsequence of&quot;, which is a [[:w:Partially ordered set|partial ordering]]), for a given natural number ''b'' &gt; 1. (You can draw this ordering as [[:w:Hasse diagram|Hasse diagram]] to find all [[:w:Minimal element|minimal element]]s)

By [[:w:Higman's lemma|Higman's lemma]], there are no [[:w:Infinite set|infinite]] [[:w:Antichain|antichain]]s for the subsequence ordering (i.e. the subsequence ordering is always a [[:w:Well-quasi-ordering|well quasi order]]) (i.e. under the subsequence ordering (i.e. the [[:w:Binary relation|binary relation]] &quot;is a subsequence of&quot;, which is a [[:w:Partially ordered set|partial ordering]]), every set of pairwise incomparable (i.e. not [[:w:Comparability|comparable]]) strings is finite), thus there must be only finitely many such minimal elements. In other words, the set of such minimal elements must be a [[:w:Finite set|finite set]], e.g. in [[:w:Decimal|decimal]] (base ''b'' = 10), this set has exactly 77 [[:w:Element of a set|element]]s: {11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 227, 251, 257, 277, 281, 349, 409, 449, 499, 521, 557, 577, 587, 727, 757, 787, 821, 827, 857, 877, 881, 887, 991, 2087, 2221, 5051, 5081, 5501, 5581, 5801, 5851, 6469, 6949, 8501, 9001, 9049, 9221, 9551, 9649, 9851, 9949, 20021, 20201, 50207, 60649, 80051, 666649, 946669, 5200007, 22000001, 60000049, 66000049, 66600049, 80555551, 555555555551, 5000000000000000000000000000027}.

For bases 2 ≤ ''b'' ≤ 36, Athena problem is fully solved in bases ''b'' = 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 18, 20, 24, and also solved in bases ''b'' = 11, 13, 16, 22, 30 if [[:w:Probable prime|probable prime]]s are allowed. For the unsolved bases ''b'' = 17, 19, 21, 23, 25, 26, 27, 28, 29, 31, 32, 34, 35, 36, Athena problem is solved (if probable primes are allowed) except 771 [[:w:Indexed family|families]] of the form ''x''{''y''}''z'' (where ''x'' and ''z'' are strings (may be [[:w:Empty string|empty]]) of digits in base ''b'', ''y'' is a digit in base ''b''), all of these 771 families contain no primes or probable primes with length ≤ 100000.

== Results ==

These are the results of the Athena problem in bases 2 ≤ ''b'' ≤ 36 (we stop at base 36 since this base is the maximum base for which it is possible to write the numbers with the [[:w:Symbol|symbol]]s 0, 1, 2, ..., 9 and A, B, C, ..., Z (i.e. the 10 [[:w:Arabic numerals|Arabic numerals]] and the 26 [[:w:Latin script|Latin letters]]): (some large primes are only probable primes, i.e. not definitely primes, since they are too large to be [[:w:Elliptic curve primality|ECPP proved]] and [[:w:Pocklington primality test#Extensions and variants|neither ''N''−1 nor ''N''+1 can be ≥ 1/3 factored]], all of them pass the [[:w:Baillie–PSW primality test|Baillie–PSW primality test]] and the [[:w:Strong pseudoprime|strong primality test]] (i.e. the [[:w:Miller–Rabin primality test|Miller–Rabin primality test]]) with all prime bases ''p'' ≤ 61, however, all primes &lt; 10&lt;sup&gt;25000&lt;/sup&gt; for bases ''b'' = 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 18, 20, 22, 24, 26, 28, 30, 36 are definitely primes, most of them &gt; 10&lt;sup&gt;299&lt;/sup&gt; are proven primes with [[:w:Elliptic curve primality|ECPP proving]], others &gt; 10&lt;sup&gt;299&lt;/sup&gt; are proven primes with [[:w:Pocklington primality test#Extensions and variants|''N''−1 or ''N''+1 proving]])

To solve the Athena problem for a given base ''b'', we must [[:w:Computing|compute]] the element up to families of the form ''x''{''y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''y'' is a digit in base ''b'') (we call such families ''linear families''), and find the smallest prime &gt; ''b'' in all such families.

Shrinking the family ''x''{''Y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''Y'' is a set of digits in base ''b'')

* If ''y'' ∈ ''Y'' and the string ''xyyz'' represents a prime &gt; ''b'' in base ''b'' (in this case, add this prime to the list) or has a subsequence which represents a prime &gt; ''b'' in base ''b'', then ''x''{''Y''}''z'' can be replaced with ''x''{''Y'' \ ''y''}''z'' ∪ ''x''{''Y'' \ ''y''}''y''{''Y'' \ ''y''}''z''.
* If ''y''&lt;sub&gt;1&lt;/sub&gt; ∈ ''Y'' and ''y''&lt;sub&gt;2&lt;/sub&gt; ∈ ''Y'' and ''y''&lt;sub&gt;1&lt;/sub&gt; ≠ ''y''&lt;sub&gt;2&lt;/sub&gt; and the string ''xy''&lt;sub&gt;1&lt;/sub&gt;''y''&lt;sub&gt;2&lt;/sub&gt;''z'' represents a prime &gt; ''b'' in base ''b'' (in this case, add this prime to the list) or has a subsequence which represents a prime &gt; ''b'' in base ''b'', then ''x''{''Y''}''z'' can be replaced with ''x''{''Y'' \ ''y''&lt;sub&gt;1&lt;/sub&gt;}{''Y'' \ ''y''&lt;sub&gt;2&lt;/sub&gt;}''z''.
* If ''y''&lt;sub&gt;1&lt;/sub&gt; ∈ ''Y'' and ''y''&lt;sub&gt;2&lt;/sub&gt; ∈ ''Y'' and ''y''&lt;sub&gt;1&lt;/sub&gt; ≠ ''y''&lt;sub&gt;2&lt;/sub&gt; and both the strings ''xy''&lt;sub&gt;1&lt;/sub&gt;''y''&lt;sub&gt;2&lt;/sub&gt;''z'' and ''xy''&lt;sub&gt;2&lt;/sub&gt;''y''&lt;sub&gt;1&lt;/sub&gt;''z'' represent a prime &gt; ''b'' in base ''b'' (in this case, add this prime to the list) or have a subsequence which represents a prime &gt; ''b'' in base ''b'', then ''x''{''Y''}''z'' can be replaced with ''x''{''Y'' \ ''y''&lt;sub&gt;1&lt;/sub&gt;}''z'' ∪ ''x''{''Y'' \ ''y''&lt;sub&gt;2&lt;/sub&gt;}''z''.

e.g. in decimal (base ''b'' = 10):

* 2221 is a prime &gt; 10, thus the family 2{0,2}1 splits into the two families 2{0}1 and 2{0}2{0}1.
* 227 is a prime &gt; 10, and it is a subsequence of 5227, thus the family 5{0,2}7 splits into the two families 5{0}7 and 5{0}2{0}7.
* 449 is a prime &gt; 10, and it is a subsequence of 6449, thus the family 6{0,3,4,6,9}9 splits into the two families 6{0,3,6,9}9 and 6{0,3,6,9}4{0,3,6,9}9.
* Both 5051 and 5501 are primes &gt; 10, thus the family 5{0,5}1 splits into the two families 5{0}1 and 5{5}1 = {5}1.
* 8501 is a prime &gt; 10, thus the family 8{0,5}1 splits into the family 8{0}{5}1.
* 887 is a prime &gt; 10, and it is a subsequence of 2887, also 2087 is a prime &gt; 10, thus the family 2{0,8}7 splits into the two families 2{0}7 and 28{0}7.
* 349 and 449 are primes &gt; 10, and they are subsequences of 9349 and 9449, respectively, also 9049, 9649, 9949 are primes &gt; 10, thus the family 9{0,3,4,6,9}9 splits into the two families 9{0,3,6,9}9 and 94{0,3,6,9}9.
* 251, 281, 521, 821, 881 are primes &gt; 10, and they are subsequences of 9251, 9281, 9521, 9821, 9881, respectively, also 9001, 9221, 9551, 9851 are primes &gt; 10, thus the family 9{0,2,5,8}1 splits into the numbers {91, 901, 921, 951, 981, 9021, 9051, 9081, 9201, 9501, 9581, 9801, 90581, 95081, 95801}.

If the methods we have discussed cannot be used to rule out or shrink ''x''{''Y''}''z'' where ''Y'' = {''y''&lt;sub&gt;1&lt;/sub&gt;, ''y''&lt;sub&gt;2&lt;/sub&gt;, ..., ''y''&lt;sub&gt;''n''&lt;/sub&gt;}, then we can replace ''x''{''Y''}''z'' by ''xy''&lt;sub&gt;1&lt;/sub&gt;{''Y''}''z'' ∪ ''xy''&lt;sub&gt;2&lt;/sub&gt;{''Y''}''z'' ∪ ... ∪ ''xy''&lt;sub&gt;''n''&lt;/sub&gt;{''Y''}''z'' and re-run the methods on this new [[:w:Formal language|language]].

If all remain families are linear families (i.e. of the form ''x''{''y''}''z'', where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''y'' is a digit in base ''b''), then we search the smallest (probable) primes in these families and add these primes to the list.

e.g. in decimal (base ''b'' = 10):

* The smallest prime in the family 5{0}27 is 5000000000000000000000000000027.
* The smallest prime in the family {5}1 is 555555555551.
* The smallest prime in the family 8{5}1 is 8555555555555555555551, but 8555555555555555555551 is not a minimal element since 555555555551 is a subsequence of 8555555555555555555551.

There is no guarantee that the techniques discussed will ever terminate, but in practice they often do. They are able to determine the set of the minimal elements in base ''b'' for 2 ≤ ''b'' ≤ 16 and ''b'' = 18, 20, 22, 24, 30. The bases ''b'' = 17, 19, 21, 23, 25 ≤ ''b'' ≤ 29, 31 ≤ ''b'' ≤ 36 are solved with the exception of 771 families of the form ''x''{''y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''y'' is a digit in base ''b'').

The following is a &quot;[[:w:Semi-algorithm|semi-algorithm]]&quot; that is guaranteed to solve the Athena problem for a given base ''b'', but it is not so easy to implement:

# ''M'' = ''[[:w:Empty string|∅]]''
# while (''L'' ≠ ''∅'') do
# choose ''x'', a shortest string in ''L''
# ''M'' := ''M'' ∪ {''x''}
# ''L'' := ''L'' − ''sup''({''x''})

In practice, for arbitrary ''L'', we cannot feasibly carry out step 5. Instead, we work with ''L''&amp;#39;, some regular overapproximation to ''L'', until we can show ''L''&amp;#39; = ''∅'' (which implies ''L'' = ''∅''). In practice, ''L''&amp;#39; is usually chosen to be a finite [[:w:Union (set theory)|union]] of sets of the form ''L''&lt;sub&gt;1&lt;/sub&gt;{''L''&lt;sub&gt;2&lt;/sub&gt;}''L''&lt;sub&gt;3&lt;/sub&gt;, where each of ''L''&lt;sub&gt;1&lt;/sub&gt;, ''L''&lt;sub&gt;2&lt;/sub&gt;, ''L''&lt;sub&gt;3&lt;/sub&gt; is finite. In the case we consider in this project, we then have to determine whether such a family contains a prime or not.

Thus, Athena problem in bases ''b'' around 500 may be [[:w:NP-complete|NP-complete]] or [[:w:NP-hard|NP-hard]], or an [[:w:Undecidable problem|undecidable problem]], or an example of [[:w:Gödel's incompleteness theorems|Gödel's incompleteness theorems]] (like the [[:w:Continuum hypothesis|continuum hypothesis]] and the [[:w:Halting problem|halting problem]]).

To solve the Athena problem, we need to determine whether a given family contains a prime. In practice, if family ''x''{''Y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''Y'' is a set of digits in base ''b'') could not be ruled out as only containing composites and ''Y'' contains two or more digits, then a relatively small prime &gt; ''b'' could always be found in this family. Intuitively, this is because there are a large number of small strings in such a family, and at least one is likely to be prime (e.g. there are 2&lt;sup&gt;''n''−2&lt;/sup&gt; strings of length ''n'' in the family 1{3,7}9, and there are over a thousand strings of length 12 in the family 1{3,7}9, thus it is very impossible that these numbers are all composite). In the case ''Y'' contains only one digit, this family is of the form ''x''{''y''}''z'', and there is only a single string of each length &gt; (the length of ''x'' + the length of ''z''), and it is not known if the following [[:w:Decision problem|decision problem]] is recursively solvable (just like [[:w:Sierpiński number|Sierpiński problem]] and [[:w:Riesel number|Riesel problem]], Sierpiński problem and Riesel problem can be generalized to other bases ''b'', in fact, Athena problem in base ''b'' covers the Sierpiński problem in base ''b'' and the Riesel problem in base ''b'' with ''k'' &lt; ''b'', i.e. finding the smallest prime of the form ''k''×''b''&lt;sup&gt;''n''&lt;/sup&gt;+1 and ''k''×''b''&lt;sup&gt;''n''&lt;/sup&gt;−1 (or prove such prime does not exist) with ''k'' &lt; ''b'', since the smallest prime of the form ''k''×''b''&lt;sup&gt;''n''&lt;/sup&gt;+1 and ''k''×''b''&lt;sup&gt;''n''&lt;/sup&gt;−1 (if exists) must be a minimal element in base ''b''):

Problem: Given strings ''x'', ''z'' (may be empty), a digit ''y'', and a base ''b'' (''x'' does not [[:w:Leading zero|start with the digit 0]], ''z'' ends with a digit which [[:w:Coprime integers|coprime]] to ''b'', ''y'' is not 0 if ''x'' is empty, ''y'' is coprime to ''b'' if ''z'' is empty), does there exist a prime number whose base-''b'' expansion is of the form ''xy''&lt;sub&gt;''n''&lt;/sub&gt;''z'' for some ''n'' ≥ 0?

Some families can be ruled out to contain no prime &gt; ''b'' by [[:w:Covering set|covering congruence]], [[:w:Factorization of polynomials|algebraic factorization]] (e.g. [[:w:Difference of two squares|difference of two squares]], [[:w:Sum of two cubes|sum of two cubes]], [[:w:Sophie Germain's identity|Sophie Germain's identity of ''x''&lt;sup&gt;4&lt;/sup&gt;+4×''y''&lt;sup&gt;4&lt;/sup&gt;]]), or combine of them, e.g.

* The base 9 family 2{7}: Always divisible by 2 or 5
* The base 16 family {8}F: Always divisible by 3, 7, or 13
* The base 21 family {7}D: Always divisible by 2, 13, or 17
* The base 23 family {D}GA: Always divisible by 2, 5, 7, 37, or 79
* The base 9 family 3{8}: Can be written as 4×9&lt;sup&gt;''n''&lt;/sup&gt;−1 and can be factored as (2×3&lt;sup&gt;''n''&lt;/sup&gt;−1) × (2×3&lt;sup&gt;''n''&lt;/sup&gt;+1)
* The base 8 family 1{0}1: Can be written as 8&lt;sup&gt;''n''&lt;/sup&gt;+1 and can be factored as (2&lt;sup&gt;''n''&lt;/sup&gt;+1) × (4&lt;sup&gt;''n''&lt;/sup&gt;−2&lt;sup&gt;''n''&lt;/sup&gt;+1)
* The base 16 family {4}1: Can be written as (4×16&lt;sup&gt;''n''&lt;/sup&gt;−49)/15 and can be factored as (2×3&lt;sup&gt;''n''&lt;/sup&gt;−7) × (2×3&lt;sup&gt;''n''&lt;/sup&gt;+7) / 15
* The base 16 family {C}D: Can be written as (4×16&lt;sup&gt;''n''&lt;/sup&gt;+1)/5 and can be factored as (2×4&lt;sup&gt;''n''&lt;/sup&gt;−2×2&lt;sup&gt;''n''&lt;/sup&gt;+1) × (2×4&lt;sup&gt;''n''&lt;/sup&gt;+2×2&lt;sup&gt;''n''&lt;/sup&gt;+1) / 5
* The base 14 family 8{D}: Can be written as 9×14&lt;sup&gt;''n''&lt;/sup&gt;−1, it is divisible by 5 if ''n'' is odd and can be factored as (3×14&lt;sup&gt;''n''/2&lt;/sup&gt;−1) × (3×14&lt;sup&gt;''n''/2&lt;/sup&gt;+1) if ''n'' is even
* The base 12 family {B}9B: Can be written as 12&lt;sup&gt;''n''&lt;/sup&gt;−25, it is divisible by 13 if ''n'' is odd and can be factored as (12&lt;sup&gt;''n''/2&lt;/sup&gt;−5) × (12&lt;sup&gt;''n''/2&lt;/sup&gt;+5) if ''n'' is even
* The base 17 family 1{9}: Can be written as (25×17&lt;sup&gt;''n''&lt;/sup&gt;−9)/16, it is divisible by 2 if ''n'' is odd and can be factored as (5×17&lt;sup&gt;''n''/2&lt;/sup&gt;−3) × (5×17&lt;sup&gt;''n''/2&lt;/sup&gt;+3) / 16 if ''n'' is even
* The base 19 family 1{6}: Can be written as (4×19&lt;sup&gt;''n''&lt;/sup&gt;−1)/3, it is divisible by 5 if ''n'' is odd and can be factored as (2×19&lt;sup&gt;''n''/2&lt;/sup&gt;−1) × (2×19&lt;sup&gt;''n''/2&lt;/sup&gt;+1) / 3 if ''n'' is even

By the [[:w:Prime number theorem|prime number theorem]], the [[:w:Probability|chance]] that a [[:w:Random number|random]] ''n''-digit base ''b'' number is prime is [[:w:Asymptotic analysis|approximately]] 1/''n'' (more accurately, the chance is approximately 1/(''n''×''ln''(''b'')), where ''ln'' is the [[:w:Natural logarithm|natural logarithm]]). If one conjectures the numbers ''x''{''y''}''z'' behave similarly (i.e. the numbers ''x''{''y''}''z'' is a [[:w:Pseudorandomness|pseudorandom sequence]]) you would expect [[:w:Harmonic_series (mathematics)|1/1 + 1/2 + 1/3 + 1/4 + ... = ∞]] primes of the form ''x''{''y''}''z'' (of course, this does not always happen, since some ''x''{''y''}''z'' families can be ruled out to contain no prime &gt; ''b'' (by covering congruence, algebraic factorization, or combine of them), but it is at least a reasonable conjecture in the absence of evidence to the contrary. Hence, the [[:w:Heuristic argument|heuristic argument]] suggests there are always infinitely many primes in family ''x''{''y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''y'' is a digit in base ''b'') if it cannot be ruled out to contain no prime or only contain finitely many primes, by covering congruence, algebraic factorization, or combine of them. However, some families ''x''{''y''}''z'' could not be proven to contain no primes &gt; ''b'' (by covering congruence, algebraic factorization, or combine of them) but no primes &gt; ''b'' could be found in the family, even after searching through numbers with over 100000 digits. In such a case, the only way to proceed is to test the primality of larger and larger numbers of such form and hope a prime is eventually discovered. e.g. the smallest (probable) prime in the family A{3}A in base ''b'' = 13 is A3&lt;sub&gt;592197&lt;/sub&gt;A, which written in decimal contains 659677 digits (it is only probable prime, i.e. not definitely prime).

All numbers are written in base ''b'', [[:w:Senary#Base 36 as senary compression|using A to Z to represent digit values 10 to 35]], &quot;{}&quot; means repeating, e.g. family 12{3}45 means the sequence {1245, 12345, 123345, 1233345, 12333345, 123333345, ...} (where the members are expressed as base ''b'' strings), subscripts are used to indicate repetitions of digits, e.g. 123&lt;sub&gt;4&lt;/sub&gt;567 means 123333567 (all subscripts are written in decimal).

Base 2: 1 prime (the largest of which has 2 digits): {11}

Base 3: 3 primes (the largest of which has 3 digits): {12, 21, 111}

Base 4: 5 primes (the largest of which has 3 digits): {11, 13, 23, 31, 221}

Base 5: 22 primes (the largest of which has 96 digits): {12, 21, 23, 32, 34, 43, 104, 111, 131, 133, 313, 401, 414, 3101, 10103, 14444, 30301, 33001, 33331, 44441, 300031, 100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000013}

Base 6: 11 primes (the largest of which has 5 digits): {11, 15, 21, 25, 31, 35, 45, 51, 4401, 4441, 40041}

Base 7: 71 primes (the largest of which has 17 digits): {14, 16, 23, 25, 32, 41, 43, 52, 56, 61, 65, 113, 115, 131, 133, 155, 212, 221, 304, 313, 335, 344, 346, 364, 445, 515, 533, 535, 544, 551, 553, 1022, 1051, 1112, 1202, 1211, 1222, 2111, 3031, 3055, 3334, 3503, 3505, 3545, 4504, 4555, 5011, 5455, 5545, 5554, 6034, 6634, 11111, 11201, 30011, 30101, 31001, 31111, 33001, 33311, 35555, 40054, 100121, 150001, 300053, 351101, 531101, 1100021, 33333301, 5100000001, 33333333333333331}

Base 8: 75 primes (the largest of which has 221 digits): {13, 15, 21, 23, 27, 35, 37, 45, 51, 53, 57, 65, 73, 75, 107, 111, 117, 141, 147, 161, 177, 225, 255, 301, 343, 361, 401, 407, 417, 431, 433, 463, 467, 471, 631, 643, 661, 667, 701, 711, 717, 747, 767, 3331, 3411, 4043, 4443, 4611, 5205, 6007, 6101, 6441, 6477, 6707, 6777, 7461, 7641, 47777, 60171, 60411, 60741, 444641, 500025, 505525, 3344441, 4444477, 5500525, 5550525, 55555025, 444444441, 744444441, 77774444441, 7777777777771, 555555555555525, 44444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444447}

Base 9: 151 primes (the largest of which has 1161 digits): {12, 14, 18, 21, 25, 32, 34, 41, 45, 47, 52, 58, 65, 67, 74, 78, 81, 87, 117, 131, 135, 151, 155, 175, 177, 238, 272, 308, 315, 331, 337, 355, 371, 375, 377, 438, 504, 515, 517, 531, 537, 557, 564, 601, 638, 661, 702, 711, 722, 735, 737, 751, 755, 757, 771, 805, 838, 1011, 1015, 1101, 1701, 2027, 2207, 3017, 3057, 3101, 3501, 3561, 3611, 3688, 3868, 5035, 5051, 5071, 5101, 5501, 5554, 5705, 5707, 7017, 7075, 7105, 7301, 8535, 8544, 8555, 8854, 20777, 22227, 22777, 30161, 33388, 50161, 50611, 53335, 55111, 55535, 55551, 57061, 57775, 70631, 71007, 77207, 100037, 100071, 100761, 105007, 270707, 301111, 305111, 333035, 333385, 333835, 338885, 350007, 500075, 530005, 555611, 631111, 720707, 2770007, 3030335, 7776662, 30300005, 30333335, 38333335, 51116111, 70000361, 300030005, 300033305, 351111111, 1300000007, 5161111111, 8333333335, 300000000035, 311111111161, 544444444444, 2000000000007, 5700000000001, 7270000000007, 88888888833335, 100000000000507, 5111111111111161, 7277777777777777707, 8888888888888888888335, 30000000000000000000051, 1000000000000000000000000057, 56111111111111111111111111111111111111, 7666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666662, 27777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777707, 300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000011}

Base 10: 77 primes (the largest of which has 31 digits): {11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 227, 251, 257, 277, 281, 349, 409, 449, 499, 521, 557, 577, 587, 727, 757, 787, 821, 827, 857, 877, 881, 887, 991, 2087, 2221, 5051, 5081, 5501, 5581, 5801, 5851, 6469, 6949, 8501, 9001, 9049, 9221, 9551, 9649, 9851, 9949, 20021, 20201, 50207, 60649, 80051, 666649, 946669, 5200007, 22000001, 60000049, 66000049, 66600049, 80555551, 555555555551, 5000000000000000000000000000027}

Base 11: 1068 primes (including 1 unproven probable prime: 57&lt;sub&gt;62668&lt;/sub&gt;), the largest of which has 62669 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel11 Data of Athena problem base 11]

Base 12: 106 primes (the largest of which has 42 digits): {11, 15, 17, 1B, 25, 27, 31, 35, 37, 3B, 45, 4B, 51, 57, 5B, 61, 67, 6B, 75, 81, 85, 87, 8B, 91, 95, A7, AB, B5, B7, 221, 241, 2A1, 2B1, 2BB, 401, 421, 447, 471, 497, 565, 655, 665, 701, 70B, 721, 747, 771, 77B, 797, 7A1, 7BB, 907, 90B, 9BB, A41, B21, B2B, 2001, 200B, 202B, 222B, 229B, 292B, 299B, 4441, 4707, 4777, 6A05, 6AA5, 729B, 7441, 7B41, 929B, 9777, 992B, 9947, 997B, 9997, A0A1, A201, A605, A6A5, AA65, B001, B0B1, BB01, BB41, 600A5, 7999B, 9999B, AAAA1, B04A1, B0B9B, BAA01, BAAA1, BB09B, BBBB1, 44AAA1, A00065, BBBAA1, AAA0001, B00099B, AA000001, BBBBBB99B, B0000000000000000000000000009B, 400000000000000000000000000000000000000077}

Base 13: 3197 primes (including 4 unproven probable primes: C5&lt;sub&gt;23755&lt;/sub&gt;C, 80&lt;sub&gt;32017&lt;/sub&gt;111, 95&lt;sub&gt;197420&lt;/sub&gt;, A3&lt;sub&gt;592197&lt;/sub&gt;A), the largest of which has 592199 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel13 Data of Athena problem base 13]

Base 14: 650 primes, the largest of which has 19699 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel14 Data of Athena problem base 14]

Base 15: 1284 primes, the largest of which has 157 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel15 Data of Athena problem base 15]

Base 16: 2347 primes (including 3 unproven probable primes: DB&lt;sub&gt;32234&lt;/sub&gt;, 4&lt;sub&gt;72785&lt;/sub&gt;DD, 3&lt;sub&gt;116137&lt;/sub&gt;AF), the largest of which has 116139 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel16 Data of Athena problem base 16]

Base 17: 10415 known primes (including many unproven probable primes) and 12 unsolved families (1{7}, 1F{0}7, 4{7}A, 70F{0}D, 8{B}9, 9{5}9, A{D}F, B{0}B3, {B}E9, {B}EE, F1{9}, FD0{D}, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel17 Data of Athena problem base 17] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left17 Data of unsolved families for base 17]

Base 18: 549 primes, the largest of which has 6271 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel18 Data of Athena problem base 18]

Base 19: 31417 known primes (including many unproven probable primes) and 17 unsolved families (4B5{0}H, {5}3, 5{H}05, 5{H}0H, 5{H}5, 66{B}, 71{0}177, 7AF{0}H, 97{0}3, C{H}C, EE1{6}, F{7}5, F{B}G, F{D}F, H0F{0}7A, HB{0}5B5, II{D}, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel19 Data of Athena problem base 19] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left19 Data of unsolved families for base 19]

Base 20: 3314 primes, the largest of which has 6271 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel20 Data of Athena problem base 20]

Base 21: 13386 known primes (including many unproven probable primes) and 8 unsolved families (5{0}DJ, {9}D, B3{0}EB, B{H}6H, C{F}0K, {F}35, G{0}FK, H{0}7771, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel21 Data of Athena problem base 21] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left21 Data of unsolved families for base 21]

Base 22: 8003 primes (including 1 unproven probable prime: BK&lt;sub&gt;22001&lt;/sub&gt;5), the largest of which has 22003 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel22 Data of Athena problem base 22]

Base 23: 65178 known primes (including many unproven probable primes) and 87 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel23 Data of Athena problem base 23] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left23 Data of unsolved families for base 23]

Base 24: 3409 primes, the largest of which has 8134 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel24 Data of Athena problem base 24]

Base 25: 133639 known primes (including many unproven probable primes) and 85 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel25 Data of Athena problem base 25] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left25 Data of unsolved families for base 25]

Base 26: 25256 known primes (including 7 unproven probable primes: 5&lt;sub&gt;19391&lt;/sub&gt;6F, 7&lt;sub&gt;20279&lt;/sub&gt;OL, LD0&lt;sub&gt;20975&lt;/sub&gt;7, 6K&lt;sub&gt;23300&lt;/sub&gt;5, J0&lt;sub&gt;44303&lt;/sub&gt;KCB, M0&lt;sub&gt;61186&lt;/sub&gt;2BB, 85M&lt;sub&gt;197060&lt;/sub&gt;B) and 3 unsolved families ({A}6F, {H}MH, {I}GL, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel26 Data of Athena problem base 26]

Base 27: 102852 known primes (including many unproven probable primes) and 44 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel27 Data of Athena problem base 27] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left27 Data of unsolved families for base 27]

Base 28: 25528 known primes (including 3 unproven probable primes: N6&lt;sub&gt;24051&lt;/sub&gt;LR, 5OA&lt;sub&gt;31238&lt;/sub&gt;F, O4O&lt;sub&gt;94535&lt;/sub&gt;9) and 1 unsolved family (O{A}F, no primes or probable primes with length ≤ 709070, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel28 Data of Athena problem base 28]

Base 29: 355242 known primes (including many unproven probable primes) and 125 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel29 Data of Athena problem base 29] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left29 Data of unsolved families for base 29]

Base 30: 2619 primes (including 1 unproven probable prime: I0&lt;sub&gt;24608&lt;/sub&gt;D), the largest of which has 34206 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel30 Data of Athena problem base 30]

Base 31: 569323 known primes (including many unproven probable primes) and 77 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel31 Data of Athena problem base 31] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left31 Data of unsolved families for base 31]

Base 32: 168882 known primes (including many unproven probable primes) and 120 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel32 Data of Athena problem base 32] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left32 Data of unsolved families for base 32]

Base 33: 280012 known primes (including many unproven probable primes) and 81 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel33 Data of Athena problem base 33] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left33 Data of unsolved families for base 33]

Base 34: 184785 known primes (including many unproven probable primes) and 47 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel34 Data of Athena problem base 34] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left34 Data of unsolved families for base 34]

Base 35: 720002 known primes (including many unproven probable primes) and 60 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel35 Data of Athena problem base 35] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left35 Data of unsolved families for base 35]

Base 36: 35286 known primes (including 3 unproven probable primes: 7K&lt;sub&gt;26567&lt;/sub&gt;Z, S0&lt;sub&gt;75007&lt;/sub&gt;8H, P&lt;sub&gt;81993&lt;/sub&gt;SZ) and 4 unsolved families (B{0}EUV, HM{0}N, N{0}YYN, O{L}Z, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel36 Data of Athena problem base 36]

== The fully proof of Athena problem in decimal (base ''b'' = 10) ==

'''Bold''' for the minimal elements, ''x'' ◁ ''y'' means ''x'' is a subsequence of ''y''.

Assume ''p'' is a prime &gt; 10, and the last digit of ''p'' must lie in {1,3,7,9}.

Case 1: ''p'' ends with 1.

In this case we can write ''p'' = ''x''1. If ''x'' contains 1, 3, 4, 6, or 7, then (respectively) '''11''' ◁ ''p'', '''31''' ◁ ''p'', '''41''' ◁ ''p'', '''61''' ◁ ''p'', or '''71''' ◁ ''p''. Hence we may assume all digits of ''x'' are 0, 2, 5, 8, or 9.

Case 1.1: ''p'' begins with 2.

In this case we can write ''p'' = 2''y''1. If 5 ◁ ''y'', then '''251''' ◁ ''p''. If 8 ◁ ''y'', then '''281''' ◁ ''p''. If 9 ◁ ''y'', then 29 ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 2.

If 22 ◁ ''y'', then '''2221''' ◁ ''p''. Hence we may assume ''y'' contains zero or one 2's.

If ''y'' contains no 2's, then ''p'' ∈ 2{0}1. But then, since the sum of the digits of ''p'' is 3, ''p'' is divisible by 3, so ''p'' cannot be prime.

If ''y'' contains exactly one 2, then we can write ''p'' = 2''z''2''w''1, where ''z'',''w'' ∈ {0}. If 0 ◁ ''z'' and 0 ◁ ''w'', then '''20201''' ◁ ''p''. Hence we may assume either ''z'' or ''w'' is empty.

If ''z'' is empty, then ''p'' ∈ 22{0}1, and the smallest prime ''p'' ∈ 22{0}1 is '''22000001'''.

If ''w'' is empty, then ''p'' ∈ 2{0}21, and the smallest prime ''p'' ∈ 2{0}21 is '''20021'''.

Case 1.2: ''p'' begins with 5.

In this case we can write ''p'' = 5''y''1. If 2 ◁ ''y'', then '''521''' ◁ ''p''. If 9 ◁ ''y'', then 59 ◁ ''p''. Hence we may assume all digits of ''y'' are 0, 5, or 8.

If 05 ◁ ''y'', then '''5051''' ◁ ''p''. If 08 ◁ ''y'', then '''5081''' ◁ ''p''. If 50 ◁ ''y'', then '''5501''' ◁ ''p''. If 58 ◁ ''y'', then '''5581''' ◁ ''p''. If 80 ◁ ''y'', then '''5801''' ◁ ''p''. If 85 ◁ ''y'', then '''5851''' ◁ ''p''. Hence we may assume ''y'' ∈ {0} ∪ {5} ∪ {8}.

If ''y'' ∈ {0}, then ''p'' ∈ 5{0}1. But then, since the sum of the digits of ''p'' is 6, ''p'' is divisible by 3, so ''p'' cannot be prime.

If ''y'' ∈ {5}, then ''p'' ∈ 5{5}1, and the smallest prime ''p'' ∈ 5{5}1 is '''555555555551'''.

If ''y'' ∈ {8}, since if 88 ◁ ''y'', then 881 ◁ ''p'', hence we may assume ''y'' ∈ {''𝜆'',8}, and thus ''p'' ∈ {51,581}, but 51 and 581 are both composite.

Case 1.3: ''p'' begins with 8.

In this case we can write p = 8''y''1. If 2 ◁ ''y'', then '''821''' ◁ ''p''. If 8 ◁ ''y'', then '''881''' ◁ ''p''. If 9 ◁ ''y'', then 89 ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 5.

If 50 ◁ ''y'', then '''8501''' ◁ ''p''. Hence we may assume y ∈ {0}{5}.

If 005 ◁ ''y'', then '''80051''' ◁ p. Hence we may assume y ∈ {0} ∪ {5} ∪ 0{5}.

If y ∈ {0}, then ''p'' ∈ 8{0}1. But then, since the sum of the digits of ''p'' is 9, ''p'' is divisible by 3, so ''p'' cannot be prime.

If y ∈ {5}, since if 55555555555 ◁ ''y'', then 555555555551 ◁ ''p'', hence we may assume ''y'' ∈ {''𝜆'', 5, 55, 555, 5555, 55555, 555555, 5555555, 55555555, 555555555, 5555555555}, and thus ''p'' ∈ {81, 851, 8551, 85551, 855551, 8555551, 85555551, 855555551, 8555555551, 85555555551, 855555555551}, but all of these numbers are composite.

If y ∈ 0{5}, since if 55555555555 ◁ ''y'', then 555555555551 ◁ ''p'', hence we may assume ''y'' ∈ {0, 05, 055, 0555, 05555, 055555, 0555555, 05555555, 055555555, 0555555555, 05555555555}, and thus ''p'' ∈ {801, 8051, 80551, 805551, 8055551, 80555551, 805555551, 8055555551, 80555555551, 805555555551, 8055555555551}, and of these numbers only 80555551 and 8055555551 are primes, but 80555551 ◁ 8055555551, thus only '''80555551''' is a minimal element.

Case 1.4: ''p'' begins with 9.

In this case we can write p = 9''y''1. If 9 ◁ ''y'', then '''991''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0, 2, 5, or 8.

If 00 ◁ ''y'', then '''9001''' ◁ ''p''. If 22 ◁ ''y'', then '''9221''' ◁ ''p''. If 55 ◁ ''y'', then '''9551''' ◁ ''p''. If 88 ◁ ''y'', then 881 ◁ ''p''. Hence we may assume ''y'' contains at most one 0, at most one 2, at most one 5, and at most one 8.

If ''y'' only contains at most one 0 and does not contain any of {2,5,8}, then ''y'' ∈ {''𝜆'',0}, and thus ''p'' ∈ {91,901}, but 91 and 901 are both composite. If ''y'' only contains at most one 0 and only one of {2,5,8}, then the sum of the digits of ''p'' is divisible by 3, ''p'' is divisible by 3, so ''p'' cannot be prime. Hence we may assume ''y'' contains at least two of {2,5,8}.

If 25 ◁ ''y'', then 251 ◁ ''p''. If 28 ◁ ''y'', then 281 ◁ ''p''. If 52 ◁ ''y'', then 521 ◁ ''p''. If 82 ◁ ''y'', then 821 ◁ ''p''. Hence we may assume ''y'' contains no 2's (since if ''y'' contains 2, then ''y'' cannot contain either 5's or 8's, which is a contradiction).

If 85 ◁ ''y'', then '''9851''' ◁ ''p''. Hence we may assume ''y'' ∈ {58,580,508,058}, and thus ''p'' ∈ {9581,95801,95081,90581}, and of these numbers only 95801 is prime, but 95801 is not a minimal element since 5801 ◁ 95801.

Case 2: ''p'' ends with 3.

In this case we can write p = ''x''3. If ''x'' contains 1, 2, 4, 5, 7, or 8, then (respectively) '''13''' ◁ ''p'', '''23''' ◁ ''p'', '''43''' ◁ ''p'', '''53''' ◁ ''p'', '''73''' ◁ ''p'', or '''83''' ◁ ''p''. Hence we may assume all digits of ''x'' are 0, 3, 6, or 9, and thus all digits of ''p'' are 0, 3, 6, or 9. But then, since the digits of ''p'' all have a common factor 3, ''p'' is divisible by 3, so ''p'' cannot be prime.

Case 3: ''p'' ends with 7.

In this case we can write ''p'' = ''x''7. If ''x'' contains 1, 3, 4, 6, or 9, then (respectively) '''17''' ◁ ''p'', '''37''' ◁ ''p'', '''47''' ◁ ''p'', '''67''' ◁ ''p'', or '''97''' ◁ ''p''. Hence we may assume all digits of ''x'' are 0, 2, 5, 7, or 8.

Case 3.1: ''p'' begins with 2.

In this case we can write ''p'' = 2''y''7. If 2 ◁ ''y'', then '''227''' ◁ ''p''. If 5 ◁ ''y'', then '''257''' ◁ ''p''. If 7 ◁ ''y'', then '''277''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 8.

If 08 ◁ ''y'', then '''2087''' ◁ ''p''. If 88 ◁ ''y'', then 887 ◁ ''p''. Hence we may assume ''y'' ∈ {0} ∪ 8{0}.

If ''y'' ∈ {0}, then ''p'' ∈ 2{0}7. But then, since the sum of the digits of ''p'' is 9, ''p'' is divisible by 3, so ''p'' cannot be prime.

If y ∈ 8{0}, then ''p'' ∈ 28{0}7. But then ''p'' is divisible by 7, since for ''n'' ≥ 0 we have 7 × 40&lt;sub&gt;''n''&lt;/sub&gt;1 = 280&lt;sub&gt;''n''&lt;/sub&gt;7.

Case 3.2: ''p'' begins with 5.

In this case we can write ''p'' = 5''y''7. If 5 ◁ ''y'', then '''557''' ◁ ''p''. If 7 ◁ ''y'', then '''577''' ◁ ''p''. If 8 ◁ ''y'', then '''587''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 2.

If 22 ◁ ''y'', then 227 ◁ ''p''. Hence we may assume ''y'' contains zero or one 2's.

If ''y'' contains no 2's, then ''p'' ∈ 5{0}7. But then, since the sum of the digits of ''p'' is 12, ''p'' is divisible by 3, so ''p'' cannot be prime.

If ''y'' contains exactly one 2, then we can write ''p'' = 5''z''2''w''7, where ''z'',''w'' ∈ {0}. If 0 ◁ ''z'' and 0 ◁ ''w'', then '''50207''' ◁ ''p''. Hence we may assume either ''z'' or ''w'' is empty.

If ''z'' is empty, then ''p'' ∈ 52{0}7, and the smallest prime ''p'' ∈ 52{0}7 is '''5200007'''.

If ''w'' is empty, then ''p'' ∈ 5{0}27, and the smallest prime ''p'' ∈ 5{0}27 is '''5000000000000000000000000000027'''.

Case 3.3: ''p'' begins with 7.

In this case we can write ''p'' = 7''y''7. If 2 ◁ ''y'', then '''727''' ◁ ''p''. If 5 ◁ ''y'', then '''757''' ◁ ''p''. If 8 ◁ ''y'', then '''787''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 7, and thus all digits of ''p'' are 0 or 7. But then, since the digits of ''p'' all have a common factor 7, ''p'' is divisible by 7, so ''p'' cannot be prime.

Case 3.4: ''p'' begins with 8.

In this case we can write ''p'' = 8''y''7. If 2 ◁ ''y'', then '''827''' ◁ ''p''. If 5 ◁ ''y'', then '''857''' ◁ ''p''. If 7 ◁ ''y'', then '''877''' ◁ ''p''. If 8 ◁ ''y'', then '''887''' ◁ ''p''. Hence we may assume ''y'' ∈ {0}, and thus ''p'' ∈ 8{0}7. But then, since the sum of the digits of ''p'' is 15, ''p'' is divisible by 3, so ''p'' cannot be prime.

Case 4: ''p'' ends with 9.

In this case we can write ''p'' = ''x''9. If ''x'' contains 1, 2, 5, 7, or 8, then (respectively) '''19''' ◁ ''p'', '''29''' ◁ ''p'', '''59''' ◁ ''p'', '''79''' ◁ ''p'', or '''89''' ◁ ''p''. Hence we may assume all digits of ''x'' are 0, 3, 4, 6, or 9.

If 44 ◁ ''x'', then '''449''' ◁ ''p''. Hence we may assume ''x'' contains zero or one 4's.

If x contains no 4's, then all digits of ''x'' are 0, 3, 6, or 9, and thus all digits of ''p'' are 0, 3, 6, or 9. But then, since the digits of ''p'' all have a common factor 3, ''p'' is divisible by 3, so ''p'' cannot be prime. Hence we may assume that ''x'' contains exactly one 4.

Case 4.1: ''p'' begins with 3.

In this case we can write ''p'' = 3''y''4''z''9, where all digits of ''y'', ''z'' are 0, 3, 6, or 9. We must have '''349''' ◁ ''p''.

Case 4.2: ''p'' begins with 4.

In this case we can write ''p'' = 4''y''9, where all digits of ''y'' are 0, 3, 6, or 9. If 0 ◁ ''y'', then '''409''' ◁ ''p''. If 3 ◁ ''y'', then 43 ◁ ''p''. If 9 ◁ ''y'', then '''499''' ◁ ''p''. Hence we may assume ''y'' ∈ {6}, and thus ''p'' ∈ 4{6}9. But then ''p'' is divisible by 7, since for ''n'' ≥ 0 we have 7 × 6&lt;sub&gt;''n''&lt;/sub&gt;7 = 46&lt;sub&gt;''n''&lt;/sub&gt;9.

Case 4.3: ''p'' begins with 6.

In this case we can write p = 6''y''4''z''9, where all digits of ''y'', ''z'' are 0, 3, 6, or 9. If 0 ◁ ''z'', then 409 ◁ ''p''. If 3 ◁ ''z'', then 43 ◁ ''p''. If 6 ◁ ''z'', then '''6469''' ◁ ''p''. If 9 ◁ ''z'', then 499 ◁ ''p''. Hence we may assume ''z'' is empty.

If 3 ◁ ''y'', then 349 ◁ ''p''. If 9 ◁ ''y'', then '''6949''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 6.

If 06 ◁ ''y'', then '''60649''' ◁ ''p''. Hence we may assume ''y'' ∈ {6}{0}.

If 666 ◁ ''y'', then '''666649''' ◁ ''p''. If 00000 ◁ ''y'', then '''60000049''' ◁ ''p''. Hence we may assume ''y'' ∈ {''𝜆'', 0, 00, 000, 0000, 6, 60, 600, 6000, 60000, 66, 660, 6600, 66000, 660000}, and thus ''p'' ∈ {649, 6049, 60049, 600049, 6000049, 6649, 66049, 660049, 6600049, 66000049, 66649, 666049, 6660049, 66600049, 666000049}, and of these numbers only '''66000049''' and '''66600049''' are primes.

Case 4.4: ''p'' begins with 9.

In this case we can write p = 9''y''4''z''9, where all digits of ''y'', ''z'' are 0, 3, 6, or 9. If 0 ◁ ''y'', then '''9049''' ◁ ''p''. If 3 ◁ ''y'', then 349 ◁ ''p''. If 6 ◁ ''y'', then '''9649''' ◁ ''p''. If 9 ◁ ''y'', then '''9949''' ◁ ''p''. Hence we may assume ''y'' is empty.

If 0 ◁ ''z'', then 409 ◁ ''p''. If 3 ◁ ''z'', then 43 ◁ ''p''. If 9 ◁ ''z'', then 499 ◁ ''p''. Hence we may assume ''z'' ∈ {6}, and thus ''p'' ∈ 94{6}9, and the smallest prime ''p'' ∈ 94{6}9 is 946669.

[[Category:Number theory]]</text>
      <sha1>ctsh9tb57k3l69skxkc3dme3uhocduh</sha1>
    </revision>
    <revision>
      <id>2809762</id>
      <parentid>2809761</parentid>
      <timestamp>2026-05-16T22:09:10Z</timestamp>
      <contributor>
        <username>雅典娜241</username>
        <id>3071373</id>
      </contributor>
      <comment>/* Results */</comment>
      <origin>2809762</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="45242" sha1="d4nq451o5wq1m6chsmk97duhs5cr946" xml:space="preserve">'''Athena problem''' is an [[:w:List of unsolved problems in mathematics|unsolved problem]] in [[:w:Number theory|number theory]] and [[:w:Formal language theory|formal language theory]] and [[:w:Order theory|order theory]], this problem is named after the ancient Greek goddess [[:w:Athena|Athena]] (which is associated with [[:w:Wisdom|wisdom]]). Athena problem is: Give a [[:w:Natural number|natural number]] ''b'' &gt; 1, find the [[:w:Set (mathematics)|set]] of the [[:w:Minimal element|minimal element]]s of the set of the &quot;[[:w:Prime number|prime number]] [[:w:Greater than|&gt;]] ''b''&quot; [[:w:Numerical digit|digit]] [[:w:String (computer science)|string]]s in the [[:w:Positional numeral system|positional numeral system]] with [[:w:Radix|base]] ''b'' for the [[:w:Subsequence|subsequence]] [[:w:Partially ordered set|ordering]]. (A string ''x'' is a subsequence of another string ''y'', if ''x'' can be obtained from ''y'' by deleting zero or more of the [[:w:Character (computing)|character]]s in ''y''. For example, 514 is a subsequence of 352148, &quot;string&quot; is a subsequence of &quot;meistersinger&quot;. In contrast, 758 is not a subsequence of 378259, &quot;abc&quot; is not a subsequence of &quot;cbacacba&quot;, since the characters must be in the same order) (Unlike [[:w:Substring|substring]], subsequence is not required to occupy consecutive positions within the original sequences)

Using [[:w:Formal language theory|formal language theory]] terminology, Athena problem is finding the [[:w:Set (mathematics)|set]] of the [[:w:Minimal element|minimal element]]s of the [[:w:Formal language|language]] of base-''b'' [[:w:Representation (mathematics)|representation]]s of the [[:w:Prime number|prime number]]s [[:w:Greater than|&gt;]] ''b'' (which is a set of [[:w:String (computer science)|string]]s of [[:w:Symbol|symbol]]s over the [[:w:Alphabet (formal languages)|alphabet]] ''Σ''&lt;sub&gt;''b''&lt;/sub&gt; := {0, 1, ..., ''b''−1}), under the subsequence ordering (i.e. the [[:w:Binary relation|binary relation]] &quot;is a subsequence of&quot;, which is a [[:w:Partially ordered set|partial ordering]]), for a given natural number ''b'' &gt; 1. (You can draw this ordering as [[:w:Hasse diagram|Hasse diagram]] to find all [[:w:Minimal element|minimal element]]s)

By [[:w:Higman's lemma|Higman's lemma]], there are no [[:w:Infinite set|infinite]] [[:w:Antichain|antichain]]s for the subsequence ordering (i.e. the subsequence ordering is always a [[:w:Well-quasi-ordering|well quasi order]]) (i.e. under the subsequence ordering (i.e. the [[:w:Binary relation|binary relation]] &quot;is a subsequence of&quot;, which is a [[:w:Partially ordered set|partial ordering]]), every set of pairwise incomparable (i.e. not [[:w:Comparability|comparable]]) strings is finite), thus there must be only finitely many such minimal elements. In other words, the set of such minimal elements must be a [[:w:Finite set|finite set]], e.g. in [[:w:Decimal|decimal]] (base ''b'' = 10), this set has exactly 77 [[:w:Element of a set|element]]s: {11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 227, 251, 257, 277, 281, 349, 409, 449, 499, 521, 557, 577, 587, 727, 757, 787, 821, 827, 857, 877, 881, 887, 991, 2087, 2221, 5051, 5081, 5501, 5581, 5801, 5851, 6469, 6949, 8501, 9001, 9049, 9221, 9551, 9649, 9851, 9949, 20021, 20201, 50207, 60649, 80051, 666649, 946669, 5200007, 22000001, 60000049, 66000049, 66600049, 80555551, 555555555551, 5000000000000000000000000000027}.

For bases 2 ≤ ''b'' ≤ 36, Athena problem is fully solved in bases ''b'' = 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 18, 20, 24, and also solved in bases ''b'' = 11, 13, 16, 22, 30 if [[:w:Probable prime|probable prime]]s are allowed. For the unsolved bases ''b'' = 17, 19, 21, 23, 25, 26, 27, 28, 29, 31, 32, 34, 35, 36, Athena problem is solved (if probable primes are allowed) except 771 [[:w:Indexed family|families]] of the form ''x''{''y''}''z'' (where ''x'' and ''z'' are strings (may be [[:w:Empty string|empty]]) of digits in base ''b'', ''y'' is a digit in base ''b''), all of these 771 families contain no primes or probable primes with length ≤ 100000.

== Results ==

These are the results of the Athena problem in bases 2 ≤ ''b'' ≤ 36 (we stop at base 36 since this base is the maximum base for which it is possible to write the numbers with the [[:w:Symbol|symbol]]s 0, 1, 2, ..., 9 and A, B, C, ..., Z (i.e. the 10 [[:w:Arabic numerals|Arabic numerals]] and the 26 [[:w:Latin script|Latin letters]]): (some large primes are only probable primes, i.e. not definitely primes, since they are too large to be [[:w:Elliptic curve primality|ECPP proved]] and [[:w:Pocklington primality test#Extensions and variants|neither ''N''−1 nor ''N''+1 can be ≥ 1/3 factored]], all of them pass the [[:w:Baillie–PSW primality test|Baillie–PSW primality test]] and the [[:w:Strong pseudoprime|strong primality test]] (i.e. the [[:w:Miller–Rabin primality test|Miller–Rabin primality test]]) with all prime bases ''p'' ≤ 61, however, all primes &lt; 10&lt;sup&gt;25000&lt;/sup&gt; for bases ''b'' = 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 18, 20, 22, 24, 26, 28, 30, 36 are definitely primes, most of them &gt; 10&lt;sup&gt;299&lt;/sup&gt; are proven primes with [[:w:Elliptic curve primality|ECPP proving]], others &gt; 10&lt;sup&gt;299&lt;/sup&gt; are proven primes with [[:w:Pocklington primality test#Extensions and variants|''N''−1 or ''N''+1 proving]])

To solve the Athena problem for a given base ''b'', we must [[:w:Computing|compute]] the element up to families of the form ''x''{''y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''y'' is a digit in base ''b'') (we call such families ''linear families''), and find the smallest prime &gt; ''b'' in all such families.

Shrinking the family ''x''{''Y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''Y'' is a set of digits in base ''b'')

* If ''y'' ∈ ''Y'' and the string ''xyyz'' represents a prime &gt; ''b'' in base ''b'' (in this case, add this prime to the list) or has a subsequence which represents a prime &gt; ''b'' in base ''b'', then ''x''{''Y''}''z'' can be replaced with ''x''{''Y'' \ ''y''}''z'' ∪ ''x''{''Y'' \ ''y''}''y''{''Y'' \ ''y''}''z''.
* If ''y''&lt;sub&gt;1&lt;/sub&gt; ∈ ''Y'' and ''y''&lt;sub&gt;2&lt;/sub&gt; ∈ ''Y'' and ''y''&lt;sub&gt;1&lt;/sub&gt; ≠ ''y''&lt;sub&gt;2&lt;/sub&gt; and the string ''xy''&lt;sub&gt;1&lt;/sub&gt;''y''&lt;sub&gt;2&lt;/sub&gt;''z'' represents a prime &gt; ''b'' in base ''b'' (in this case, add this prime to the list) or has a subsequence which represents a prime &gt; ''b'' in base ''b'', then ''x''{''Y''}''z'' can be replaced with ''x''{''Y'' \ ''y''&lt;sub&gt;1&lt;/sub&gt;}{''Y'' \ ''y''&lt;sub&gt;2&lt;/sub&gt;}''z''.
* If ''y''&lt;sub&gt;1&lt;/sub&gt; ∈ ''Y'' and ''y''&lt;sub&gt;2&lt;/sub&gt; ∈ ''Y'' and ''y''&lt;sub&gt;1&lt;/sub&gt; ≠ ''y''&lt;sub&gt;2&lt;/sub&gt; and both the strings ''xy''&lt;sub&gt;1&lt;/sub&gt;''y''&lt;sub&gt;2&lt;/sub&gt;''z'' and ''xy''&lt;sub&gt;2&lt;/sub&gt;''y''&lt;sub&gt;1&lt;/sub&gt;''z'' represent a prime &gt; ''b'' in base ''b'' (in this case, add this prime to the list) or have a subsequence which represents a prime &gt; ''b'' in base ''b'', then ''x''{''Y''}''z'' can be replaced with ''x''{''Y'' \ ''y''&lt;sub&gt;1&lt;/sub&gt;}''z'' ∪ ''x''{''Y'' \ ''y''&lt;sub&gt;2&lt;/sub&gt;}''z''.

e.g. in decimal (base ''b'' = 10):

* 2221 is a prime &gt; 10, thus the family 2{0,2}1 splits into the two families 2{0}1 and 2{0}2{0}1.
* 227 is a prime &gt; 10, and it is a subsequence of 5227, thus the family 5{0,2}7 splits into the two families 5{0}7 and 5{0}2{0}7.
* 449 is a prime &gt; 10, and it is a subsequence of 6449, thus the family 6{0,3,4,6,9}9 splits into the two families 6{0,3,6,9}9 and 6{0,3,6,9}4{0,3,6,9}9.
* Both 5051 and 5501 are primes &gt; 10, thus the family 5{0,5}1 splits into the two families 5{0}1 and 5{5}1 = {5}1.
* 8501 is a prime &gt; 10, thus the family 8{0,5}1 splits into the family 8{0}{5}1.
* 887 is a prime &gt; 10, and it is a subsequence of 2887, also 2087 is a prime &gt; 10, thus the family 2{0,8}7 splits into the two families 2{0}7 and 28{0}7.
* 349 and 449 are primes &gt; 10, and they are subsequences of 9349 and 9449, respectively, also 9049, 9649, 9949 are primes &gt; 10, thus the family 9{0,3,4,6,9}9 splits into the two families 9{0,3,6,9}9 and 94{0,3,6,9}9.
* 251, 281, 521, 821, 881 are primes &gt; 10, and they are subsequences of 9251, 9281, 9521, 9821, 9881, respectively, also 9001, 9221, 9551, 9851 are primes &gt; 10, thus the family 9{0,2,5,8}1 splits into the numbers {91, 901, 921, 951, 981, 9021, 9051, 9081, 9201, 9501, 9581, 9801, 90581, 95081, 95801}.

If the methods we have discussed cannot be used to rule out or shrink ''x''{''Y''}''z'' where ''Y'' = {''y''&lt;sub&gt;1&lt;/sub&gt;, ''y''&lt;sub&gt;2&lt;/sub&gt;, ..., ''y''&lt;sub&gt;''n''&lt;/sub&gt;}, then we can replace ''x''{''Y''}''z'' by ''xy''&lt;sub&gt;1&lt;/sub&gt;{''Y''}''z'' ∪ ''xy''&lt;sub&gt;2&lt;/sub&gt;{''Y''}''z'' ∪ ... ∪ ''xy''&lt;sub&gt;''n''&lt;/sub&gt;{''Y''}''z'' and re-run the methods on this new [[:w:Formal language|language]].

If all remain families are linear families (i.e. of the form ''x''{''y''}''z'', where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''y'' is a digit in base ''b''), then we search the smallest (probable) primes in these families and add these primes to the list.

e.g. in decimal (base ''b'' = 10):

* The smallest prime in the family 5{0}27 is 5000000000000000000000000000027.
* The smallest prime in the family {5}1 is 555555555551.
* The smallest prime in the family 8{5}1 is 8555555555555555555551, but 8555555555555555555551 is not a minimal element since 555555555551 is a subsequence of 8555555555555555555551.

There is no guarantee that the techniques discussed will ever terminate, but in practice they often do. They are able to determine the set of the minimal elements in base ''b'' for 2 ≤ ''b'' ≤ 16 and ''b'' = 18, 20, 22, 24, 30. The bases ''b'' = 17, 19, 21, 23, 25 ≤ ''b'' ≤ 29, 31 ≤ ''b'' ≤ 36 are solved with the exception of 771 families of the form ''x''{''y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''y'' is a digit in base ''b'').

The following is a &quot;[[:w:Semi-algorithm|semi-algorithm]]&quot; that is guaranteed to solve the Athena problem for a given base ''b'', but it is not so easy to implement:

# ''M'' = ''[[:w:Empty string|∅]]''
# while (''L'' ≠ ''∅'') do
# choose ''x'', a shortest string in ''L''
# ''M'' := ''M'' ∪ {''x''}
# ''L'' := ''L'' − ''sup''({''x''})

In practice, for arbitrary ''L'', we cannot feasibly carry out step 5. Instead, we work with ''L''&amp;#39;, some regular overapproximation to ''L'', until we can show ''L''&amp;#39; = ''∅'' (which implies ''L'' = ''∅''). In practice, ''L''&amp;#39; is usually chosen to be a finite [[:w:Union (set theory)|union]] of sets of the form ''L''&lt;sub&gt;1&lt;/sub&gt;{''L''&lt;sub&gt;2&lt;/sub&gt;}''L''&lt;sub&gt;3&lt;/sub&gt;, where each of ''L''&lt;sub&gt;1&lt;/sub&gt;, ''L''&lt;sub&gt;2&lt;/sub&gt;, ''L''&lt;sub&gt;3&lt;/sub&gt; is finite. In the case we consider in this project, we then have to determine whether such a family contains a prime or not.

Thus, Athena problem in bases ''b'' around 500 may be [[:w:NP-complete|NP-complete]] or [[:w:NP-hard|NP-hard]], or an [[:w:Undecidable problem|undecidable problem]], or an example of [[:w:Gödel's incompleteness theorems|Gödel's incompleteness theorems]] (like the [[:w:Continuum hypothesis|continuum hypothesis]] and the [[:w:Halting problem|halting problem]]).

To solve the Athena problem, we need to determine whether a given family contains a prime. In practice, if family ''x''{''Y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''Y'' is a set of digits in base ''b'') could not be ruled out as only containing composites and ''Y'' contains two or more digits, then a relatively small prime &gt; ''b'' could always be found in this family. Intuitively, this is because there are a large number of small strings in such a family, and at least one is likely to be prime (e.g. there are 2&lt;sup&gt;''n''−2&lt;/sup&gt; strings of length ''n'' in the family 1{3,7}9, and there are over a thousand strings of length 12 in the family 1{3,7}9, thus it is very impossible that these numbers are all composite). In the case ''Y'' contains only one digit, this family is of the form ''x''{''y''}''z'', and there is only a single string of each length &gt; (the length of ''x'' + the length of ''z''), and it is not known if the following [[:w:Decision problem|decision problem]] is recursively solvable (just like [[:w:Sierpiński number|Sierpiński problem]] and [[:w:Riesel number|Riesel problem]], Sierpiński problem and Riesel problem can be generalized to other bases ''b'', in fact, Athena problem in base ''b'' covers the Sierpiński problem in base ''b'' and the Riesel problem in base ''b'' with ''k'' &lt; ''b'', i.e. finding the smallest prime of the form ''k''×''b''&lt;sup&gt;''n''&lt;/sup&gt;+1 and ''k''×''b''&lt;sup&gt;''n''&lt;/sup&gt;−1 (or prove such prime does not exist) with ''k'' &lt; ''b'', since the smallest prime of the form ''k''×''b''&lt;sup&gt;''n''&lt;/sup&gt;+1 and ''k''×''b''&lt;sup&gt;''n''&lt;/sup&gt;−1 (if exists) must be a minimal element in base ''b''):

Problem: Given strings ''x'', ''z'' (may be empty), a digit ''y'', and a base ''b'' (''x'' does not [[:w:Leading zero|start with the digit 0]], ''z'' ends with a digit which [[:w:Coprime integers|coprime]] to ''b'', ''y'' is not 0 if ''x'' is empty, ''y'' is coprime to ''b'' if ''z'' is empty), does there exist a prime number whose base-''b'' expansion is of the form ''xy''&lt;sub&gt;''n''&lt;/sub&gt;''z'' for some ''n'' ≥ 0?

Some families can be ruled out to contain no prime &gt; ''b'' by [[:w:Covering set|covering congruence]], [[:w:Factorization of polynomials|algebraic factorization]] (e.g. [[:w:Difference of two squares|difference of two squares]], [[:w:Sum of two cubes|sum of two cubes]], [[:w:Sophie Germain's identity|Sophie Germain's identity of ''x''&lt;sup&gt;4&lt;/sup&gt;+4×''y''&lt;sup&gt;4&lt;/sup&gt;]]), or combine of them, e.g.

* The base 9 family 2{7}: Always divisible by 2 or 5
* The base 16 family {8}F: Always divisible by 3, 7, or 13
* The base 21 family {7}D: Always divisible by 2, 13, or 17
* The base 23 family {D}GA: Always divisible by 2, 5, 7, 37, or 79
* The base 9 family 3{8}: Can be written as 4×9&lt;sup&gt;''n''&lt;/sup&gt;−1 and can be factored as (2×3&lt;sup&gt;''n''&lt;/sup&gt;−1) × (2×3&lt;sup&gt;''n''&lt;/sup&gt;+1)
* The base 8 family 1{0}1: Can be written as 8&lt;sup&gt;''n''&lt;/sup&gt;+1 and can be factored as (2&lt;sup&gt;''n''&lt;/sup&gt;+1) × (4&lt;sup&gt;''n''&lt;/sup&gt;−2&lt;sup&gt;''n''&lt;/sup&gt;+1)
* The base 16 family {4}1: Can be written as (4×16&lt;sup&gt;''n''&lt;/sup&gt;−49)/15 and can be factored as (2×3&lt;sup&gt;''n''&lt;/sup&gt;−7) × (2×3&lt;sup&gt;''n''&lt;/sup&gt;+7) / 15
* The base 16 family {C}D: Can be written as (4×16&lt;sup&gt;''n''&lt;/sup&gt;+1)/5 and can be factored as (2×4&lt;sup&gt;''n''&lt;/sup&gt;−2×2&lt;sup&gt;''n''&lt;/sup&gt;+1) × (2×4&lt;sup&gt;''n''&lt;/sup&gt;+2×2&lt;sup&gt;''n''&lt;/sup&gt;+1) / 5
* The base 14 family 8{D}: Can be written as 9×14&lt;sup&gt;''n''&lt;/sup&gt;−1, it is divisible by 5 if ''n'' is odd and can be factored as (3×14&lt;sup&gt;''n''/2&lt;/sup&gt;−1) × (3×14&lt;sup&gt;''n''/2&lt;/sup&gt;+1) if ''n'' is even
* The base 12 family {B}9B: Can be written as 12&lt;sup&gt;''n''&lt;/sup&gt;−25, it is divisible by 13 if ''n'' is odd and can be factored as (12&lt;sup&gt;''n''/2&lt;/sup&gt;−5) × (12&lt;sup&gt;''n''/2&lt;/sup&gt;+5) if ''n'' is even
* The base 17 family 1{9}: Can be written as (25×17&lt;sup&gt;''n''&lt;/sup&gt;−9)/16, it is divisible by 2 if ''n'' is odd and can be factored as (5×17&lt;sup&gt;''n''/2&lt;/sup&gt;−3) × (5×17&lt;sup&gt;''n''/2&lt;/sup&gt;+3) / 16 if ''n'' is even
* The base 19 family 1{6}: Can be written as (4×19&lt;sup&gt;''n''&lt;/sup&gt;−1)/3, it is divisible by 5 if ''n'' is odd and can be factored as (2×19&lt;sup&gt;''n''/2&lt;/sup&gt;−1) × (2×19&lt;sup&gt;''n''/2&lt;/sup&gt;+1) / 3 if ''n'' is even

By the [[:w:Prime number theorem|prime number theorem]], the [[:w:Probability|chance]] that a [[:w:Random number|random]] ''n''-digit base ''b'' number is prime is [[:w:Asymptotic analysis|approximately]] 1/''n'' (more accurately, the chance is approximately 1/(''n''×''ln''(''b'')), where ''ln'' is the [[:w:Natural logarithm|natural logarithm]]). If one conjectures the numbers ''x''{''y''}''z'' behave similarly (i.e. the numbers ''x''{''y''}''z'' is a [[:w:Pseudorandomness|pseudorandom sequence]]) you would expect [[:w:Harmonic_series (mathematics)|1/1 + 1/2 + 1/3 + 1/4 + ... = ∞]] primes of the form ''x''{''y''}''z'' (of course, this does not always happen, since some ''x''{''y''}''z'' families can be ruled out to contain no prime &gt; ''b'' (by covering congruence, algebraic factorization, or combine of them), but it is at least a reasonable conjecture in the absence of evidence to the contrary. Hence, the [[:w:Heuristic argument|heuristic argument]] suggests there are always infinitely many primes in family ''x''{''y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''y'' is a digit in base ''b'') if it cannot be ruled out to contain no prime or only contain finitely many primes, by covering congruence, algebraic factorization, or combine of them. However, some families ''x''{''y''}''z'' could not be proven to contain no primes &gt; ''b'' (by covering congruence, algebraic factorization, or combine of them) but no primes &gt; ''b'' could be found in the family, even after searching through numbers with over 100000 digits. In such a case, the only way to proceed is to [[:w:Primality test|test the primality]] of larger and larger numbers of such form and hope a prime is eventually discovered. e.g. the smallest (probable) prime in the family A{3}A in base ''b'' = 13 is A3&lt;sub&gt;592197&lt;/sub&gt;A, which written in decimal contains 659677 digits (it is only probable prime, i.e. not definitely prime).

All numbers are written in base ''b'', [[:w:Senary#Base 36 as senary compression|using A to Z to represent digit values 10 to 35]], &quot;{}&quot; means repeating, e.g. family 12{3}45 means the sequence {1245, 12345, 123345, 1233345, 12333345, 123333345, ...} (where the members are expressed as base ''b'' strings), subscripts are used to indicate repetitions of digits, e.g. 123&lt;sub&gt;4&lt;/sub&gt;567 means 123333567 (all subscripts are written in decimal).

Base 2: 1 prime (the largest of which has 2 digits): {11}

Base 3: 3 primes (the largest of which has 3 digits): {12, 21, 111}

Base 4: 5 primes (the largest of which has 3 digits): {11, 13, 23, 31, 221}

Base 5: 22 primes (the largest of which has 96 digits): {12, 21, 23, 32, 34, 43, 104, 111, 131, 133, 313, 401, 414, 3101, 10103, 14444, 30301, 33001, 33331, 44441, 300031, 100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000013}

Base 6: 11 primes (the largest of which has 5 digits): {11, 15, 21, 25, 31, 35, 45, 51, 4401, 4441, 40041}

Base 7: 71 primes (the largest of which has 17 digits): {14, 16, 23, 25, 32, 41, 43, 52, 56, 61, 65, 113, 115, 131, 133, 155, 212, 221, 304, 313, 335, 344, 346, 364, 445, 515, 533, 535, 544, 551, 553, 1022, 1051, 1112, 1202, 1211, 1222, 2111, 3031, 3055, 3334, 3503, 3505, 3545, 4504, 4555, 5011, 5455, 5545, 5554, 6034, 6634, 11111, 11201, 30011, 30101, 31001, 31111, 33001, 33311, 35555, 40054, 100121, 150001, 300053, 351101, 531101, 1100021, 33333301, 5100000001, 33333333333333331}

Base 8: 75 primes (the largest of which has 221 digits): {13, 15, 21, 23, 27, 35, 37, 45, 51, 53, 57, 65, 73, 75, 107, 111, 117, 141, 147, 161, 177, 225, 255, 301, 343, 361, 401, 407, 417, 431, 433, 463, 467, 471, 631, 643, 661, 667, 701, 711, 717, 747, 767, 3331, 3411, 4043, 4443, 4611, 5205, 6007, 6101, 6441, 6477, 6707, 6777, 7461, 7641, 47777, 60171, 60411, 60741, 444641, 500025, 505525, 3344441, 4444477, 5500525, 5550525, 55555025, 444444441, 744444441, 77774444441, 7777777777771, 555555555555525, 44444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444447}

Base 9: 151 primes (the largest of which has 1161 digits): {12, 14, 18, 21, 25, 32, 34, 41, 45, 47, 52, 58, 65, 67, 74, 78, 81, 87, 117, 131, 135, 151, 155, 175, 177, 238, 272, 308, 315, 331, 337, 355, 371, 375, 377, 438, 504, 515, 517, 531, 537, 557, 564, 601, 638, 661, 702, 711, 722, 735, 737, 751, 755, 757, 771, 805, 838, 1011, 1015, 1101, 1701, 2027, 2207, 3017, 3057, 3101, 3501, 3561, 3611, 3688, 3868, 5035, 5051, 5071, 5101, 5501, 5554, 5705, 5707, 7017, 7075, 7105, 7301, 8535, 8544, 8555, 8854, 20777, 22227, 22777, 30161, 33388, 50161, 50611, 53335, 55111, 55535, 55551, 57061, 57775, 70631, 71007, 77207, 100037, 100071, 100761, 105007, 270707, 301111, 305111, 333035, 333385, 333835, 338885, 350007, 500075, 530005, 555611, 631111, 720707, 2770007, 3030335, 7776662, 30300005, 30333335, 38333335, 51116111, 70000361, 300030005, 300033305, 351111111, 1300000007, 5161111111, 8333333335, 300000000035, 311111111161, 544444444444, 2000000000007, 5700000000001, 7270000000007, 88888888833335, 100000000000507, 5111111111111161, 7277777777777777707, 8888888888888888888335, 30000000000000000000051, 1000000000000000000000000057, 56111111111111111111111111111111111111, 7666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666662, 27777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777707, 300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000011}

Base 10: 77 primes (the largest of which has 31 digits): {11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 227, 251, 257, 277, 281, 349, 409, 449, 499, 521, 557, 577, 587, 727, 757, 787, 821, 827, 857, 877, 881, 887, 991, 2087, 2221, 5051, 5081, 5501, 5581, 5801, 5851, 6469, 6949, 8501, 9001, 9049, 9221, 9551, 9649, 9851, 9949, 20021, 20201, 50207, 60649, 80051, 666649, 946669, 5200007, 22000001, 60000049, 66000049, 66600049, 80555551, 555555555551, 5000000000000000000000000000027}

Base 11: 1068 primes (including 1 unproven probable prime: 57&lt;sub&gt;62668&lt;/sub&gt;), the largest of which has 62669 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel11 Data of Athena problem base 11]

Base 12: 106 primes (the largest of which has 42 digits): {11, 15, 17, 1B, 25, 27, 31, 35, 37, 3B, 45, 4B, 51, 57, 5B, 61, 67, 6B, 75, 81, 85, 87, 8B, 91, 95, A7, AB, B5, B7, 221, 241, 2A1, 2B1, 2BB, 401, 421, 447, 471, 497, 565, 655, 665, 701, 70B, 721, 747, 771, 77B, 797, 7A1, 7BB, 907, 90B, 9BB, A41, B21, B2B, 2001, 200B, 202B, 222B, 229B, 292B, 299B, 4441, 4707, 4777, 6A05, 6AA5, 729B, 7441, 7B41, 929B, 9777, 992B, 9947, 997B, 9997, A0A1, A201, A605, A6A5, AA65, B001, B0B1, BB01, BB41, 600A5, 7999B, 9999B, AAAA1, B04A1, B0B9B, BAA01, BAAA1, BB09B, BBBB1, 44AAA1, A00065, BBBAA1, AAA0001, B00099B, AA000001, BBBBBB99B, B0000000000000000000000000009B, 400000000000000000000000000000000000000077}

Base 13: 3197 primes (including 4 unproven probable primes: C5&lt;sub&gt;23755&lt;/sub&gt;C, 80&lt;sub&gt;32017&lt;/sub&gt;111, 95&lt;sub&gt;197420&lt;/sub&gt;, A3&lt;sub&gt;592197&lt;/sub&gt;A), the largest of which has 592199 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel13 Data of Athena problem base 13]

Base 14: 650 primes, the largest of which has 19699 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel14 Data of Athena problem base 14]

Base 15: 1284 primes, the largest of which has 157 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel15 Data of Athena problem base 15]

Base 16: 2347 primes (including 3 unproven probable primes: DB&lt;sub&gt;32234&lt;/sub&gt;, 4&lt;sub&gt;72785&lt;/sub&gt;DD, 3&lt;sub&gt;116137&lt;/sub&gt;AF), the largest of which has 116139 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel16 Data of Athena problem base 16]

Base 17: 10415 known primes (including many unproven probable primes) and 12 unsolved families (1{7}, 1F{0}7, 4{7}A, 70F{0}D, 8{B}9, 9{5}9, A{D}F, B{0}B3, {B}E9, {B}EE, F1{9}, FD0{D}, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel17 Data of Athena problem base 17] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left17 Data of unsolved families for base 17]

Base 18: 549 primes, the largest of which has 6271 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel18 Data of Athena problem base 18]

Base 19: 31417 known primes (including many unproven probable primes) and 17 unsolved families (4B5{0}H, {5}3, 5{H}05, 5{H}0H, 5{H}5, 66{B}, 71{0}177, 7AF{0}H, 97{0}3, C{H}C, EE1{6}, F{7}5, F{B}G, F{D}F, H0F{0}7A, HB{0}5B5, II{D}, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel19 Data of Athena problem base 19] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left19 Data of unsolved families for base 19]

Base 20: 3314 primes, the largest of which has 6271 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel20 Data of Athena problem base 20]

Base 21: 13386 known primes (including many unproven probable primes) and 8 unsolved families (5{0}DJ, {9}D, B3{0}EB, B{H}6H, C{F}0K, {F}35, G{0}FK, H{0}7771, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel21 Data of Athena problem base 21] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left21 Data of unsolved families for base 21]

Base 22: 8003 primes (including 1 unproven probable prime: BK&lt;sub&gt;22001&lt;/sub&gt;5), the largest of which has 22003 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel22 Data of Athena problem base 22]

Base 23: 65178 known primes (including many unproven probable primes) and 87 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel23 Data of Athena problem base 23] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left23 Data of unsolved families for base 23]

Base 24: 3409 primes, the largest of which has 8134 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel24 Data of Athena problem base 24]

Base 25: 133639 known primes (including many unproven probable primes) and 85 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel25 Data of Athena problem base 25] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left25 Data of unsolved families for base 25]

Base 26: 25256 known primes (including 7 unproven probable primes: 5&lt;sub&gt;19391&lt;/sub&gt;6F, 7&lt;sub&gt;20279&lt;/sub&gt;OL, LD0&lt;sub&gt;20975&lt;/sub&gt;7, 6K&lt;sub&gt;23300&lt;/sub&gt;5, J0&lt;sub&gt;44303&lt;/sub&gt;KCB, M0&lt;sub&gt;61186&lt;/sub&gt;2BB, 85M&lt;sub&gt;197060&lt;/sub&gt;B) and 3 unsolved families ({A}6F, {H}MH, {I}GL, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel26 Data of Athena problem base 26]

Base 27: 102852 known primes (including many unproven probable primes) and 44 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel27 Data of Athena problem base 27] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left27 Data of unsolved families for base 27]

Base 28: 25528 known primes (including 3 unproven probable primes: N6&lt;sub&gt;24051&lt;/sub&gt;LR, 5OA&lt;sub&gt;31238&lt;/sub&gt;F, O4O&lt;sub&gt;94535&lt;/sub&gt;9) and 1 unsolved family (O{A}F, no primes or probable primes with length ≤ 709070, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel28 Data of Athena problem base 28]

Base 29: 355242 known primes (including many unproven probable primes) and 125 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel29 Data of Athena problem base 29] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left29 Data of unsolved families for base 29]

Base 30: 2619 primes (including 1 unproven probable prime: I0&lt;sub&gt;24608&lt;/sub&gt;D), the largest of which has 34206 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel30 Data of Athena problem base 30]

Base 31: 569323 known primes (including many unproven probable primes) and 77 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel31 Data of Athena problem base 31] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left31 Data of unsolved families for base 31]

Base 32: 168882 known primes (including many unproven probable primes) and 120 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel32 Data of Athena problem base 32] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left32 Data of unsolved families for base 32]

Base 33: 280012 known primes (including many unproven probable primes) and 81 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel33 Data of Athena problem base 33] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left33 Data of unsolved families for base 33]

Base 34: 184785 known primes (including many unproven probable primes) and 47 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel34 Data of Athena problem base 34] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left34 Data of unsolved families for base 34]

Base 35: 720002 known primes (including many unproven probable primes) and 60 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel35 Data of Athena problem base 35] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left35 Data of unsolved families for base 35]

Base 36: 35286 known primes (including 3 unproven probable primes: 7K&lt;sub&gt;26567&lt;/sub&gt;Z, S0&lt;sub&gt;75007&lt;/sub&gt;8H, P&lt;sub&gt;81993&lt;/sub&gt;SZ) and 4 unsolved families (B{0}EUV, HM{0}N, N{0}YYN, O{L}Z, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel36 Data of Athena problem base 36]

== The fully proof of Athena problem in decimal (base ''b'' = 10) ==

'''Bold''' for the minimal elements, ''x'' ◁ ''y'' means ''x'' is a subsequence of ''y''.

Assume ''p'' is a prime &gt; 10, and the last digit of ''p'' must lie in {1,3,7,9}.

Case 1: ''p'' ends with 1.

In this case we can write ''p'' = ''x''1. If ''x'' contains 1, 3, 4, 6, or 7, then (respectively) '''11''' ◁ ''p'', '''31''' ◁ ''p'', '''41''' ◁ ''p'', '''61''' ◁ ''p'', or '''71''' ◁ ''p''. Hence we may assume all digits of ''x'' are 0, 2, 5, 8, or 9.

Case 1.1: ''p'' begins with 2.

In this case we can write ''p'' = 2''y''1. If 5 ◁ ''y'', then '''251''' ◁ ''p''. If 8 ◁ ''y'', then '''281''' ◁ ''p''. If 9 ◁ ''y'', then 29 ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 2.

If 22 ◁ ''y'', then '''2221''' ◁ ''p''. Hence we may assume ''y'' contains zero or one 2's.

If ''y'' contains no 2's, then ''p'' ∈ 2{0}1. But then, since the sum of the digits of ''p'' is 3, ''p'' is divisible by 3, so ''p'' cannot be prime.

If ''y'' contains exactly one 2, then we can write ''p'' = 2''z''2''w''1, where ''z'',''w'' ∈ {0}. If 0 ◁ ''z'' and 0 ◁ ''w'', then '''20201''' ◁ ''p''. Hence we may assume either ''z'' or ''w'' is empty.

If ''z'' is empty, then ''p'' ∈ 22{0}1, and the smallest prime ''p'' ∈ 22{0}1 is '''22000001'''.

If ''w'' is empty, then ''p'' ∈ 2{0}21, and the smallest prime ''p'' ∈ 2{0}21 is '''20021'''.

Case 1.2: ''p'' begins with 5.

In this case we can write ''p'' = 5''y''1. If 2 ◁ ''y'', then '''521''' ◁ ''p''. If 9 ◁ ''y'', then 59 ◁ ''p''. Hence we may assume all digits of ''y'' are 0, 5, or 8.

If 05 ◁ ''y'', then '''5051''' ◁ ''p''. If 08 ◁ ''y'', then '''5081''' ◁ ''p''. If 50 ◁ ''y'', then '''5501''' ◁ ''p''. If 58 ◁ ''y'', then '''5581''' ◁ ''p''. If 80 ◁ ''y'', then '''5801''' ◁ ''p''. If 85 ◁ ''y'', then '''5851''' ◁ ''p''. Hence we may assume ''y'' ∈ {0} ∪ {5} ∪ {8}.

If ''y'' ∈ {0}, then ''p'' ∈ 5{0}1. But then, since the sum of the digits of ''p'' is 6, ''p'' is divisible by 3, so ''p'' cannot be prime.

If ''y'' ∈ {5}, then ''p'' ∈ 5{5}1, and the smallest prime ''p'' ∈ 5{5}1 is '''555555555551'''.

If ''y'' ∈ {8}, since if 88 ◁ ''y'', then 881 ◁ ''p'', hence we may assume ''y'' ∈ {''𝜆'',8}, and thus ''p'' ∈ {51,581}, but 51 and 581 are both composite.

Case 1.3: ''p'' begins with 8.

In this case we can write p = 8''y''1. If 2 ◁ ''y'', then '''821''' ◁ ''p''. If 8 ◁ ''y'', then '''881''' ◁ ''p''. If 9 ◁ ''y'', then 89 ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 5.

If 50 ◁ ''y'', then '''8501''' ◁ ''p''. Hence we may assume y ∈ {0}{5}.

If 005 ◁ ''y'', then '''80051''' ◁ p. Hence we may assume y ∈ {0} ∪ {5} ∪ 0{5}.

If y ∈ {0}, then ''p'' ∈ 8{0}1. But then, since the sum of the digits of ''p'' is 9, ''p'' is divisible by 3, so ''p'' cannot be prime.

If y ∈ {5}, since if 55555555555 ◁ ''y'', then 555555555551 ◁ ''p'', hence we may assume ''y'' ∈ {''𝜆'', 5, 55, 555, 5555, 55555, 555555, 5555555, 55555555, 555555555, 5555555555}, and thus ''p'' ∈ {81, 851, 8551, 85551, 855551, 8555551, 85555551, 855555551, 8555555551, 85555555551, 855555555551}, but all of these numbers are composite.

If y ∈ 0{5}, since if 55555555555 ◁ ''y'', then 555555555551 ◁ ''p'', hence we may assume ''y'' ∈ {0, 05, 055, 0555, 05555, 055555, 0555555, 05555555, 055555555, 0555555555, 05555555555}, and thus ''p'' ∈ {801, 8051, 80551, 805551, 8055551, 80555551, 805555551, 8055555551, 80555555551, 805555555551, 8055555555551}, and of these numbers only 80555551 and 8055555551 are primes, but 80555551 ◁ 8055555551, thus only '''80555551''' is a minimal element.

Case 1.4: ''p'' begins with 9.

In this case we can write p = 9''y''1. If 9 ◁ ''y'', then '''991''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0, 2, 5, or 8.

If 00 ◁ ''y'', then '''9001''' ◁ ''p''. If 22 ◁ ''y'', then '''9221''' ◁ ''p''. If 55 ◁ ''y'', then '''9551''' ◁ ''p''. If 88 ◁ ''y'', then 881 ◁ ''p''. Hence we may assume ''y'' contains at most one 0, at most one 2, at most one 5, and at most one 8.

If ''y'' only contains at most one 0 and does not contain any of {2,5,8}, then ''y'' ∈ {''𝜆'',0}, and thus ''p'' ∈ {91,901}, but 91 and 901 are both composite. If ''y'' only contains at most one 0 and only one of {2,5,8}, then the sum of the digits of ''p'' is divisible by 3, ''p'' is divisible by 3, so ''p'' cannot be prime. Hence we may assume ''y'' contains at least two of {2,5,8}.

If 25 ◁ ''y'', then 251 ◁ ''p''. If 28 ◁ ''y'', then 281 ◁ ''p''. If 52 ◁ ''y'', then 521 ◁ ''p''. If 82 ◁ ''y'', then 821 ◁ ''p''. Hence we may assume ''y'' contains no 2's (since if ''y'' contains 2, then ''y'' cannot contain either 5's or 8's, which is a contradiction).

If 85 ◁ ''y'', then '''9851''' ◁ ''p''. Hence we may assume ''y'' ∈ {58,580,508,058}, and thus ''p'' ∈ {9581,95801,95081,90581}, and of these numbers only 95801 is prime, but 95801 is not a minimal element since 5801 ◁ 95801.

Case 2: ''p'' ends with 3.

In this case we can write p = ''x''3. If ''x'' contains 1, 2, 4, 5, 7, or 8, then (respectively) '''13''' ◁ ''p'', '''23''' ◁ ''p'', '''43''' ◁ ''p'', '''53''' ◁ ''p'', '''73''' ◁ ''p'', or '''83''' ◁ ''p''. Hence we may assume all digits of ''x'' are 0, 3, 6, or 9, and thus all digits of ''p'' are 0, 3, 6, or 9. But then, since the digits of ''p'' all have a common factor 3, ''p'' is divisible by 3, so ''p'' cannot be prime.

Case 3: ''p'' ends with 7.

In this case we can write ''p'' = ''x''7. If ''x'' contains 1, 3, 4, 6, or 9, then (respectively) '''17''' ◁ ''p'', '''37''' ◁ ''p'', '''47''' ◁ ''p'', '''67''' ◁ ''p'', or '''97''' ◁ ''p''. Hence we may assume all digits of ''x'' are 0, 2, 5, 7, or 8.

Case 3.1: ''p'' begins with 2.

In this case we can write ''p'' = 2''y''7. If 2 ◁ ''y'', then '''227''' ◁ ''p''. If 5 ◁ ''y'', then '''257''' ◁ ''p''. If 7 ◁ ''y'', then '''277''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 8.

If 08 ◁ ''y'', then '''2087''' ◁ ''p''. If 88 ◁ ''y'', then 887 ◁ ''p''. Hence we may assume ''y'' ∈ {0} ∪ 8{0}.

If ''y'' ∈ {0}, then ''p'' ∈ 2{0}7. But then, since the sum of the digits of ''p'' is 9, ''p'' is divisible by 3, so ''p'' cannot be prime.

If y ∈ 8{0}, then ''p'' ∈ 28{0}7. But then ''p'' is divisible by 7, since for ''n'' ≥ 0 we have 7 × 40&lt;sub&gt;''n''&lt;/sub&gt;1 = 280&lt;sub&gt;''n''&lt;/sub&gt;7.

Case 3.2: ''p'' begins with 5.

In this case we can write ''p'' = 5''y''7. If 5 ◁ ''y'', then '''557''' ◁ ''p''. If 7 ◁ ''y'', then '''577''' ◁ ''p''. If 8 ◁ ''y'', then '''587''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 2.

If 22 ◁ ''y'', then 227 ◁ ''p''. Hence we may assume ''y'' contains zero or one 2's.

If ''y'' contains no 2's, then ''p'' ∈ 5{0}7. But then, since the sum of the digits of ''p'' is 12, ''p'' is divisible by 3, so ''p'' cannot be prime.

If ''y'' contains exactly one 2, then we can write ''p'' = 5''z''2''w''7, where ''z'',''w'' ∈ {0}. If 0 ◁ ''z'' and 0 ◁ ''w'', then '''50207''' ◁ ''p''. Hence we may assume either ''z'' or ''w'' is empty.

If ''z'' is empty, then ''p'' ∈ 52{0}7, and the smallest prime ''p'' ∈ 52{0}7 is '''5200007'''.

If ''w'' is empty, then ''p'' ∈ 5{0}27, and the smallest prime ''p'' ∈ 5{0}27 is '''5000000000000000000000000000027'''.

Case 3.3: ''p'' begins with 7.

In this case we can write ''p'' = 7''y''7. If 2 ◁ ''y'', then '''727''' ◁ ''p''. If 5 ◁ ''y'', then '''757''' ◁ ''p''. If 8 ◁ ''y'', then '''787''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 7, and thus all digits of ''p'' are 0 or 7. But then, since the digits of ''p'' all have a common factor 7, ''p'' is divisible by 7, so ''p'' cannot be prime.

Case 3.4: ''p'' begins with 8.

In this case we can write ''p'' = 8''y''7. If 2 ◁ ''y'', then '''827''' ◁ ''p''. If 5 ◁ ''y'', then '''857''' ◁ ''p''. If 7 ◁ ''y'', then '''877''' ◁ ''p''. If 8 ◁ ''y'', then '''887''' ◁ ''p''. Hence we may assume ''y'' ∈ {0}, and thus ''p'' ∈ 8{0}7. But then, since the sum of the digits of ''p'' is 15, ''p'' is divisible by 3, so ''p'' cannot be prime.

Case 4: ''p'' ends with 9.

In this case we can write ''p'' = ''x''9. If ''x'' contains 1, 2, 5, 7, or 8, then (respectively) '''19''' ◁ ''p'', '''29''' ◁ ''p'', '''59''' ◁ ''p'', '''79''' ◁ ''p'', or '''89''' ◁ ''p''. Hence we may assume all digits of ''x'' are 0, 3, 4, 6, or 9.

If 44 ◁ ''x'', then '''449''' ◁ ''p''. Hence we may assume ''x'' contains zero or one 4's.

If x contains no 4's, then all digits of ''x'' are 0, 3, 6, or 9, and thus all digits of ''p'' are 0, 3, 6, or 9. But then, since the digits of ''p'' all have a common factor 3, ''p'' is divisible by 3, so ''p'' cannot be prime. Hence we may assume that ''x'' contains exactly one 4.

Case 4.1: ''p'' begins with 3.

In this case we can write ''p'' = 3''y''4''z''9, where all digits of ''y'', ''z'' are 0, 3, 6, or 9. We must have '''349''' ◁ ''p''.

Case 4.2: ''p'' begins with 4.

In this case we can write ''p'' = 4''y''9, where all digits of ''y'' are 0, 3, 6, or 9. If 0 ◁ ''y'', then '''409''' ◁ ''p''. If 3 ◁ ''y'', then 43 ◁ ''p''. If 9 ◁ ''y'', then '''499''' ◁ ''p''. Hence we may assume ''y'' ∈ {6}, and thus ''p'' ∈ 4{6}9. But then ''p'' is divisible by 7, since for ''n'' ≥ 0 we have 7 × 6&lt;sub&gt;''n''&lt;/sub&gt;7 = 46&lt;sub&gt;''n''&lt;/sub&gt;9.

Case 4.3: ''p'' begins with 6.

In this case we can write p = 6''y''4''z''9, where all digits of ''y'', ''z'' are 0, 3, 6, or 9. If 0 ◁ ''z'', then 409 ◁ ''p''. If 3 ◁ ''z'', then 43 ◁ ''p''. If 6 ◁ ''z'', then '''6469''' ◁ ''p''. If 9 ◁ ''z'', then 499 ◁ ''p''. Hence we may assume ''z'' is empty.

If 3 ◁ ''y'', then 349 ◁ ''p''. If 9 ◁ ''y'', then '''6949''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 6.

If 06 ◁ ''y'', then '''60649''' ◁ ''p''. Hence we may assume ''y'' ∈ {6}{0}.

If 666 ◁ ''y'', then '''666649''' ◁ ''p''. If 00000 ◁ ''y'', then '''60000049''' ◁ ''p''. Hence we may assume ''y'' ∈ {''𝜆'', 0, 00, 000, 0000, 6, 60, 600, 6000, 60000, 66, 660, 6600, 66000, 660000}, and thus ''p'' ∈ {649, 6049, 60049, 600049, 6000049, 6649, 66049, 660049, 6600049, 66000049, 66649, 666049, 6660049, 66600049, 666000049}, and of these numbers only '''66000049''' and '''66600049''' are primes.

Case 4.4: ''p'' begins with 9.

In this case we can write p = 9''y''4''z''9, where all digits of ''y'', ''z'' are 0, 3, 6, or 9. If 0 ◁ ''y'', then '''9049''' ◁ ''p''. If 3 ◁ ''y'', then 349 ◁ ''p''. If 6 ◁ ''y'', then '''9649''' ◁ ''p''. If 9 ◁ ''y'', then '''9949''' ◁ ''p''. Hence we may assume ''y'' is empty.

If 0 ◁ ''z'', then 409 ◁ ''p''. If 3 ◁ ''z'', then 43 ◁ ''p''. If 9 ◁ ''z'', then 499 ◁ ''p''. Hence we may assume ''z'' ∈ {6}, and thus ''p'' ∈ 94{6}9, and the smallest prime ''p'' ∈ 94{6}9 is 946669.

[[Category:Number theory]]</text>
      <sha1>d4nq451o5wq1m6chsmk97duhs5cr946</sha1>
    </revision>
    <revision>
      <id>2809764</id>
      <parentid>2809762</parentid>
      <timestamp>2026-05-16T22:11:59Z</timestamp>
      <contributor>
        <username>雅典娜241</username>
        <id>3071373</id>
      </contributor>
      <origin>2809764</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="45402" sha1="6phmr9xwjyofxdsytx8djpi948av90j" xml:space="preserve">'''Athena problem''' is an [[:w:List of unsolved problems in mathematics|unsolved problem]] in [[:w:Number theory|number theory]] and [[:w:Formal language theory|formal language theory]] and [[:w:Order theory|order theory]], this problem is named after the ancient Greek goddess [[:w:Athena|Athena]] (which is associated with [[:w:Wisdom|wisdom]]). Athena problem is: Give a [[:w:Natural number|natural number]] ''b'' &gt; 1, find the [[:w:Set (mathematics)|set]] of the [[:w:Minimal element|minimal element]]s of the set of the &quot;[[:w:Prime number|prime number]] [[:w:Greater than|&gt;]] ''b''&quot; [[:w:Numerical digit|digit]] [[:w:String (computer science)|string]]s in the [[:w:Positional numeral system|positional numeral system]] with [[:w:Radix|base]] ''b'' for the [[:w:Subsequence|subsequence]] [[:w:Partially ordered set|ordering]]. (A string ''x'' is a subsequence of another string ''y'', if ''x'' can be obtained from ''y'' by deleting zero or more of the [[:w:Character (computing)|character]]s in ''y''. For example, 514 is a subsequence of 352148, &quot;string&quot; is a subsequence of &quot;meistersinger&quot;. In contrast, 758 is not a subsequence of 378259, &quot;abc&quot; is not a subsequence of &quot;cbacacba&quot;, since the characters must be in the same order) (Unlike [[:w:Substring|substring]], subsequence is not required to occupy consecutive positions within the original sequences, e.g. the [[:w:Longest common subsequence|longest common subsequence problem]] is different from the [[:w:Longest common string|longest common string problem]])

Using [[:w:Formal language theory|formal language theory]] terminology, Athena problem is finding the [[:w:Set (mathematics)|set]] of the [[:w:Minimal element|minimal element]]s of the [[:w:Formal language|language]] of base-''b'' [[:w:Representation (mathematics)|representation]]s of the [[:w:Prime number|prime number]]s [[:w:Greater than|&gt;]] ''b'' (which is a set of [[:w:String (computer science)|string]]s of [[:w:Symbol|symbol]]s over the [[:w:Alphabet (formal languages)|alphabet]] ''Σ''&lt;sub&gt;''b''&lt;/sub&gt; := {0, 1, ..., ''b''−1}), under the subsequence ordering (i.e. the [[:w:Binary relation|binary relation]] &quot;is a subsequence of&quot;, which is a [[:w:Partially ordered set|partial ordering]]), for a given natural number ''b'' &gt; 1. (You can draw this ordering as [[:w:Hasse diagram|Hasse diagram]] to find all [[:w:Minimal element|minimal element]]s)

By [[:w:Higman's lemma|Higman's lemma]], there are no [[:w:Infinite set|infinite]] [[:w:Antichain|antichain]]s for the subsequence ordering (i.e. the subsequence ordering is always a [[:w:Well-quasi-ordering|well quasi order]]) (i.e. under the subsequence ordering (i.e. the [[:w:Binary relation|binary relation]] &quot;is a subsequence of&quot;, which is a [[:w:Partially ordered set|partial ordering]]), every set of pairwise incomparable (i.e. not [[:w:Comparability|comparable]]) strings is finite), thus there must be only finitely many such minimal elements. In other words, the set of such minimal elements must be a [[:w:Finite set|finite set]], e.g. in [[:w:Decimal|decimal]] (base ''b'' = 10), this set has exactly 77 [[:w:Element of a set|element]]s: {11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 227, 251, 257, 277, 281, 349, 409, 449, 499, 521, 557, 577, 587, 727, 757, 787, 821, 827, 857, 877, 881, 887, 991, 2087, 2221, 5051, 5081, 5501, 5581, 5801, 5851, 6469, 6949, 8501, 9001, 9049, 9221, 9551, 9649, 9851, 9949, 20021, 20201, 50207, 60649, 80051, 666649, 946669, 5200007, 22000001, 60000049, 66000049, 66600049, 80555551, 555555555551, 5000000000000000000000000000027}.

For bases 2 ≤ ''b'' ≤ 36, Athena problem is fully solved in bases ''b'' = 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 18, 20, 24, and also solved in bases ''b'' = 11, 13, 16, 22, 30 if [[:w:Probable prime|probable prime]]s are allowed. For the unsolved bases ''b'' = 17, 19, 21, 23, 25, 26, 27, 28, 29, 31, 32, 34, 35, 36, Athena problem is solved (if probable primes are allowed) except 771 [[:w:Indexed family|families]] of the form ''x''{''y''}''z'' (where ''x'' and ''z'' are strings (may be [[:w:Empty string|empty]]) of digits in base ''b'', ''y'' is a digit in base ''b''), all of these 771 families contain no primes or probable primes with length ≤ 100000.

== Results ==

These are the results of the Athena problem in bases 2 ≤ ''b'' ≤ 36 (we stop at base 36 since this base is the maximum base for which it is possible to write the numbers with the [[:w:Symbol|symbol]]s 0, 1, 2, ..., 9 and A, B, C, ..., Z (i.e. the 10 [[:w:Arabic numerals|Arabic numerals]] and the 26 [[:w:Latin script|Latin letters]]): (some large primes are only probable primes, i.e. not definitely primes, since they are too large to be [[:w:Elliptic curve primality|ECPP proved]] and [[:w:Pocklington primality test#Extensions and variants|neither ''N''−1 nor ''N''+1 can be ≥ 1/3 factored]], all of them pass the [[:w:Baillie–PSW primality test|Baillie–PSW primality test]] and the [[:w:Strong pseudoprime|strong primality test]] (i.e. the [[:w:Miller–Rabin primality test|Miller–Rabin primality test]]) with all prime bases ''p'' ≤ 61, however, all primes &lt; 10&lt;sup&gt;25000&lt;/sup&gt; for bases ''b'' = 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 18, 20, 22, 24, 26, 28, 30, 36 are definitely primes, most of them &gt; 10&lt;sup&gt;299&lt;/sup&gt; are proven primes with [[:w:Elliptic curve primality|ECPP proving]], others &gt; 10&lt;sup&gt;299&lt;/sup&gt; are proven primes with [[:w:Pocklington primality test#Extensions and variants|''N''−1 or ''N''+1 proving]])

To solve the Athena problem for a given base ''b'', we must [[:w:Computing|compute]] the element up to families of the form ''x''{''y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''y'' is a digit in base ''b'') (we call such families ''linear families''), and find the smallest prime &gt; ''b'' in all such families.

Shrinking the family ''x''{''Y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''Y'' is a set of digits in base ''b'')

* If ''y'' ∈ ''Y'' and the string ''xyyz'' represents a prime &gt; ''b'' in base ''b'' (in this case, add this prime to the list) or has a subsequence which represents a prime &gt; ''b'' in base ''b'', then ''x''{''Y''}''z'' can be replaced with ''x''{''Y'' \ ''y''}''z'' ∪ ''x''{''Y'' \ ''y''}''y''{''Y'' \ ''y''}''z''.
* If ''y''&lt;sub&gt;1&lt;/sub&gt; ∈ ''Y'' and ''y''&lt;sub&gt;2&lt;/sub&gt; ∈ ''Y'' and ''y''&lt;sub&gt;1&lt;/sub&gt; ≠ ''y''&lt;sub&gt;2&lt;/sub&gt; and the string ''xy''&lt;sub&gt;1&lt;/sub&gt;''y''&lt;sub&gt;2&lt;/sub&gt;''z'' represents a prime &gt; ''b'' in base ''b'' (in this case, add this prime to the list) or has a subsequence which represents a prime &gt; ''b'' in base ''b'', then ''x''{''Y''}''z'' can be replaced with ''x''{''Y'' \ ''y''&lt;sub&gt;1&lt;/sub&gt;}{''Y'' \ ''y''&lt;sub&gt;2&lt;/sub&gt;}''z''.
* If ''y''&lt;sub&gt;1&lt;/sub&gt; ∈ ''Y'' and ''y''&lt;sub&gt;2&lt;/sub&gt; ∈ ''Y'' and ''y''&lt;sub&gt;1&lt;/sub&gt; ≠ ''y''&lt;sub&gt;2&lt;/sub&gt; and both the strings ''xy''&lt;sub&gt;1&lt;/sub&gt;''y''&lt;sub&gt;2&lt;/sub&gt;''z'' and ''xy''&lt;sub&gt;2&lt;/sub&gt;''y''&lt;sub&gt;1&lt;/sub&gt;''z'' represent a prime &gt; ''b'' in base ''b'' (in this case, add this prime to the list) or have a subsequence which represents a prime &gt; ''b'' in base ''b'', then ''x''{''Y''}''z'' can be replaced with ''x''{''Y'' \ ''y''&lt;sub&gt;1&lt;/sub&gt;}''z'' ∪ ''x''{''Y'' \ ''y''&lt;sub&gt;2&lt;/sub&gt;}''z''.

e.g. in decimal (base ''b'' = 10):

* 2221 is a prime &gt; 10, thus the family 2{0,2}1 splits into the two families 2{0}1 and 2{0}2{0}1.
* 227 is a prime &gt; 10, and it is a subsequence of 5227, thus the family 5{0,2}7 splits into the two families 5{0}7 and 5{0}2{0}7.
* 449 is a prime &gt; 10, and it is a subsequence of 6449, thus the family 6{0,3,4,6,9}9 splits into the two families 6{0,3,6,9}9 and 6{0,3,6,9}4{0,3,6,9}9.
* Both 5051 and 5501 are primes &gt; 10, thus the family 5{0,5}1 splits into the two families 5{0}1 and 5{5}1 = {5}1.
* 8501 is a prime &gt; 10, thus the family 8{0,5}1 splits into the family 8{0}{5}1.
* 887 is a prime &gt; 10, and it is a subsequence of 2887, also 2087 is a prime &gt; 10, thus the family 2{0,8}7 splits into the two families 2{0}7 and 28{0}7.
* 349 and 449 are primes &gt; 10, and they are subsequences of 9349 and 9449, respectively, also 9049, 9649, 9949 are primes &gt; 10, thus the family 9{0,3,4,6,9}9 splits into the two families 9{0,3,6,9}9 and 94{0,3,6,9}9.
* 251, 281, 521, 821, 881 are primes &gt; 10, and they are subsequences of 9251, 9281, 9521, 9821, 9881, respectively, also 9001, 9221, 9551, 9851 are primes &gt; 10, thus the family 9{0,2,5,8}1 splits into the numbers {91, 901, 921, 951, 981, 9021, 9051, 9081, 9201, 9501, 9581, 9801, 90581, 95081, 95801}.

If the methods we have discussed cannot be used to rule out or shrink ''x''{''Y''}''z'' where ''Y'' = {''y''&lt;sub&gt;1&lt;/sub&gt;, ''y''&lt;sub&gt;2&lt;/sub&gt;, ..., ''y''&lt;sub&gt;''n''&lt;/sub&gt;}, then we can replace ''x''{''Y''}''z'' by ''xy''&lt;sub&gt;1&lt;/sub&gt;{''Y''}''z'' ∪ ''xy''&lt;sub&gt;2&lt;/sub&gt;{''Y''}''z'' ∪ ... ∪ ''xy''&lt;sub&gt;''n''&lt;/sub&gt;{''Y''}''z'' and re-run the methods on this new [[:w:Formal language|language]].

If all remain families are linear families (i.e. of the form ''x''{''y''}''z'', where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''y'' is a digit in base ''b''), then we search the smallest (probable) primes in these families and add these primes to the list.

e.g. in decimal (base ''b'' = 10):

* The smallest prime in the family 5{0}27 is 5000000000000000000000000000027.
* The smallest prime in the family {5}1 is 555555555551.
* The smallest prime in the family 8{5}1 is 8555555555555555555551, but 8555555555555555555551 is not a minimal element since 555555555551 is a subsequence of 8555555555555555555551.

There is no guarantee that the techniques discussed will ever terminate, but in practice they often do. They are able to determine the set of the minimal elements in base ''b'' for 2 ≤ ''b'' ≤ 16 and ''b'' = 18, 20, 22, 24, 30. The bases ''b'' = 17, 19, 21, 23, 25 ≤ ''b'' ≤ 29, 31 ≤ ''b'' ≤ 36 are solved with the exception of 771 families of the form ''x''{''y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''y'' is a digit in base ''b'').

The following is a &quot;[[:w:Semi-algorithm|semi-algorithm]]&quot; that is guaranteed to solve the Athena problem for a given base ''b'', but it is not so easy to implement:

# ''M'' = ''[[:w:Empty string|∅]]''
# while (''L'' ≠ ''∅'') do
# choose ''x'', a shortest string in ''L''
# ''M'' := ''M'' ∪ {''x''}
# ''L'' := ''L'' − ''sup''({''x''})

In practice, for arbitrary ''L'', we cannot feasibly carry out step 5. Instead, we work with ''L''&amp;#39;, some regular overapproximation to ''L'', until we can show ''L''&amp;#39; = ''∅'' (which implies ''L'' = ''∅''). In practice, ''L''&amp;#39; is usually chosen to be a finite [[:w:Union (set theory)|union]] of sets of the form ''L''&lt;sub&gt;1&lt;/sub&gt;{''L''&lt;sub&gt;2&lt;/sub&gt;}''L''&lt;sub&gt;3&lt;/sub&gt;, where each of ''L''&lt;sub&gt;1&lt;/sub&gt;, ''L''&lt;sub&gt;2&lt;/sub&gt;, ''L''&lt;sub&gt;3&lt;/sub&gt; is finite. In the case we consider in this project, we then have to determine whether such a family contains a prime or not.

Thus, Athena problem in bases ''b'' around 500 may be [[:w:NP-complete|NP-complete]] or [[:w:NP-hard|NP-hard]], or an [[:w:Undecidable problem|undecidable problem]], or an example of [[:w:Gödel's incompleteness theorems|Gödel's incompleteness theorems]] (like the [[:w:Continuum hypothesis|continuum hypothesis]] and the [[:w:Halting problem|halting problem]]).

To solve the Athena problem, we need to determine whether a given family contains a prime. In practice, if family ''x''{''Y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''Y'' is a set of digits in base ''b'') could not be ruled out as only containing composites and ''Y'' contains two or more digits, then a relatively small prime &gt; ''b'' could always be found in this family. Intuitively, this is because there are a large number of small strings in such a family, and at least one is likely to be prime (e.g. there are 2&lt;sup&gt;''n''−2&lt;/sup&gt; strings of length ''n'' in the family 1{3,7}9, and there are over a thousand strings of length 12 in the family 1{3,7}9, thus it is very impossible that these numbers are all composite). In the case ''Y'' contains only one digit, this family is of the form ''x''{''y''}''z'', and there is only a single string of each length &gt; (the length of ''x'' + the length of ''z''), and it is not known if the following [[:w:Decision problem|decision problem]] is recursively solvable (just like [[:w:Sierpiński number|Sierpiński problem]] and [[:w:Riesel number|Riesel problem]], Sierpiński problem and Riesel problem can be generalized to other bases ''b'', in fact, Athena problem in base ''b'' covers the Sierpiński problem in base ''b'' and the Riesel problem in base ''b'' with ''k'' &lt; ''b'', i.e. finding the smallest prime of the form ''k''×''b''&lt;sup&gt;''n''&lt;/sup&gt;+1 and ''k''×''b''&lt;sup&gt;''n''&lt;/sup&gt;−1 (or prove such prime does not exist) with ''k'' &lt; ''b'', since the smallest prime of the form ''k''×''b''&lt;sup&gt;''n''&lt;/sup&gt;+1 and ''k''×''b''&lt;sup&gt;''n''&lt;/sup&gt;−1 (if exists) must be a minimal element in base ''b''):

Problem: Given strings ''x'', ''z'' (may be empty), a digit ''y'', and a base ''b'' (''x'' does not [[:w:Leading zero|start with the digit 0]], ''z'' ends with a digit which [[:w:Coprime integers|coprime]] to ''b'', ''y'' is not 0 if ''x'' is empty, ''y'' is coprime to ''b'' if ''z'' is empty), does there exist a prime number whose base-''b'' expansion is of the form ''xy''&lt;sub&gt;''n''&lt;/sub&gt;''z'' for some ''n'' ≥ 0?

Some families can be ruled out to contain no prime &gt; ''b'' by [[:w:Covering set|covering congruence]], [[:w:Factorization of polynomials|algebraic factorization]] (e.g. [[:w:Difference of two squares|difference of two squares]], [[:w:Sum of two cubes|sum of two cubes]], [[:w:Sophie Germain's identity|Sophie Germain's identity of ''x''&lt;sup&gt;4&lt;/sup&gt;+4×''y''&lt;sup&gt;4&lt;/sup&gt;]]), or combine of them, e.g.

* The base 9 family 2{7}: Always divisible by 2 or 5
* The base 16 family {8}F: Always divisible by 3, 7, or 13
* The base 21 family {7}D: Always divisible by 2, 13, or 17
* The base 23 family {D}GA: Always divisible by 2, 5, 7, 37, or 79
* The base 9 family 3{8}: Can be written as 4×9&lt;sup&gt;''n''&lt;/sup&gt;−1 and can be factored as (2×3&lt;sup&gt;''n''&lt;/sup&gt;−1) × (2×3&lt;sup&gt;''n''&lt;/sup&gt;+1)
* The base 8 family 1{0}1: Can be written as 8&lt;sup&gt;''n''&lt;/sup&gt;+1 and can be factored as (2&lt;sup&gt;''n''&lt;/sup&gt;+1) × (4&lt;sup&gt;''n''&lt;/sup&gt;−2&lt;sup&gt;''n''&lt;/sup&gt;+1)
* The base 16 family {4}1: Can be written as (4×16&lt;sup&gt;''n''&lt;/sup&gt;−49)/15 and can be factored as (2×3&lt;sup&gt;''n''&lt;/sup&gt;−7) × (2×3&lt;sup&gt;''n''&lt;/sup&gt;+7) / 15
* The base 16 family {C}D: Can be written as (4×16&lt;sup&gt;''n''&lt;/sup&gt;+1)/5 and can be factored as (2×4&lt;sup&gt;''n''&lt;/sup&gt;−2×2&lt;sup&gt;''n''&lt;/sup&gt;+1) × (2×4&lt;sup&gt;''n''&lt;/sup&gt;+2×2&lt;sup&gt;''n''&lt;/sup&gt;+1) / 5
* The base 14 family 8{D}: Can be written as 9×14&lt;sup&gt;''n''&lt;/sup&gt;−1, it is divisible by 5 if ''n'' is odd and can be factored as (3×14&lt;sup&gt;''n''/2&lt;/sup&gt;−1) × (3×14&lt;sup&gt;''n''/2&lt;/sup&gt;+1) if ''n'' is even
* The base 12 family {B}9B: Can be written as 12&lt;sup&gt;''n''&lt;/sup&gt;−25, it is divisible by 13 if ''n'' is odd and can be factored as (12&lt;sup&gt;''n''/2&lt;/sup&gt;−5) × (12&lt;sup&gt;''n''/2&lt;/sup&gt;+5) if ''n'' is even
* The base 17 family 1{9}: Can be written as (25×17&lt;sup&gt;''n''&lt;/sup&gt;−9)/16, it is divisible by 2 if ''n'' is odd and can be factored as (5×17&lt;sup&gt;''n''/2&lt;/sup&gt;−3) × (5×17&lt;sup&gt;''n''/2&lt;/sup&gt;+3) / 16 if ''n'' is even
* The base 19 family 1{6}: Can be written as (4×19&lt;sup&gt;''n''&lt;/sup&gt;−1)/3, it is divisible by 5 if ''n'' is odd and can be factored as (2×19&lt;sup&gt;''n''/2&lt;/sup&gt;−1) × (2×19&lt;sup&gt;''n''/2&lt;/sup&gt;+1) / 3 if ''n'' is even

By the [[:w:Prime number theorem|prime number theorem]], the [[:w:Probability|chance]] that a [[:w:Random number|random]] ''n''-digit base ''b'' number is prime is [[:w:Asymptotic analysis|approximately]] 1/''n'' (more accurately, the chance is approximately 1/(''n''×''ln''(''b'')), where ''ln'' is the [[:w:Natural logarithm|natural logarithm]]). If one conjectures the numbers ''x''{''y''}''z'' behave similarly (i.e. the numbers ''x''{''y''}''z'' is a [[:w:Pseudorandomness|pseudorandom sequence]]) you would expect [[:w:Harmonic_series (mathematics)|1/1 + 1/2 + 1/3 + 1/4 + ... = ∞]] primes of the form ''x''{''y''}''z'' (of course, this does not always happen, since some ''x''{''y''}''z'' families can be ruled out to contain no prime &gt; ''b'' (by covering congruence, algebraic factorization, or combine of them), but it is at least a reasonable conjecture in the absence of evidence to the contrary. Hence, the [[:w:Heuristic argument|heuristic argument]] suggests there are always infinitely many primes in family ''x''{''y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''y'' is a digit in base ''b'') if it cannot be ruled out to contain no prime or only contain finitely many primes, by covering congruence, algebraic factorization, or combine of them. However, some families ''x''{''y''}''z'' could not be proven to contain no primes &gt; ''b'' (by covering congruence, algebraic factorization, or combine of them) but no primes &gt; ''b'' could be found in the family, even after searching through numbers with over 100000 digits. In such a case, the only way to proceed is to [[:w:Primality test|test the primality]] of larger and larger numbers of such form and hope a prime is eventually discovered. e.g. the smallest (probable) prime in the family A{3}A in base ''b'' = 13 is A3&lt;sub&gt;592197&lt;/sub&gt;A, which written in decimal contains 659677 digits (it is only probable prime, i.e. not definitely prime).

All numbers are written in base ''b'', [[:w:Senary#Base 36 as senary compression|using A to Z to represent digit values 10 to 35]], &quot;{}&quot; means repeating, e.g. family 12{3}45 means the sequence {1245, 12345, 123345, 1233345, 12333345, 123333345, ...} (where the members are expressed as base ''b'' strings), subscripts are used to indicate repetitions of digits, e.g. 123&lt;sub&gt;4&lt;/sub&gt;567 means 123333567 (all subscripts are written in decimal).

Base 2: 1 prime (the largest of which has 2 digits): {11}

Base 3: 3 primes (the largest of which has 3 digits): {12, 21, 111}

Base 4: 5 primes (the largest of which has 3 digits): {11, 13, 23, 31, 221}

Base 5: 22 primes (the largest of which has 96 digits): {12, 21, 23, 32, 34, 43, 104, 111, 131, 133, 313, 401, 414, 3101, 10103, 14444, 30301, 33001, 33331, 44441, 300031, 100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000013}

Base 6: 11 primes (the largest of which has 5 digits): {11, 15, 21, 25, 31, 35, 45, 51, 4401, 4441, 40041}

Base 7: 71 primes (the largest of which has 17 digits): {14, 16, 23, 25, 32, 41, 43, 52, 56, 61, 65, 113, 115, 131, 133, 155, 212, 221, 304, 313, 335, 344, 346, 364, 445, 515, 533, 535, 544, 551, 553, 1022, 1051, 1112, 1202, 1211, 1222, 2111, 3031, 3055, 3334, 3503, 3505, 3545, 4504, 4555, 5011, 5455, 5545, 5554, 6034, 6634, 11111, 11201, 30011, 30101, 31001, 31111, 33001, 33311, 35555, 40054, 100121, 150001, 300053, 351101, 531101, 1100021, 33333301, 5100000001, 33333333333333331}

Base 8: 75 primes (the largest of which has 221 digits): {13, 15, 21, 23, 27, 35, 37, 45, 51, 53, 57, 65, 73, 75, 107, 111, 117, 141, 147, 161, 177, 225, 255, 301, 343, 361, 401, 407, 417, 431, 433, 463, 467, 471, 631, 643, 661, 667, 701, 711, 717, 747, 767, 3331, 3411, 4043, 4443, 4611, 5205, 6007, 6101, 6441, 6477, 6707, 6777, 7461, 7641, 47777, 60171, 60411, 60741, 444641, 500025, 505525, 3344441, 4444477, 5500525, 5550525, 55555025, 444444441, 744444441, 77774444441, 7777777777771, 555555555555525, 44444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444447}

Base 9: 151 primes (the largest of which has 1161 digits): {12, 14, 18, 21, 25, 32, 34, 41, 45, 47, 52, 58, 65, 67, 74, 78, 81, 87, 117, 131, 135, 151, 155, 175, 177, 238, 272, 308, 315, 331, 337, 355, 371, 375, 377, 438, 504, 515, 517, 531, 537, 557, 564, 601, 638, 661, 702, 711, 722, 735, 737, 751, 755, 757, 771, 805, 838, 1011, 1015, 1101, 1701, 2027, 2207, 3017, 3057, 3101, 3501, 3561, 3611, 3688, 3868, 5035, 5051, 5071, 5101, 5501, 5554, 5705, 5707, 7017, 7075, 7105, 7301, 8535, 8544, 8555, 8854, 20777, 22227, 22777, 30161, 33388, 50161, 50611, 53335, 55111, 55535, 55551, 57061, 57775, 70631, 71007, 77207, 100037, 100071, 100761, 105007, 270707, 301111, 305111, 333035, 333385, 333835, 338885, 350007, 500075, 530005, 555611, 631111, 720707, 2770007, 3030335, 7776662, 30300005, 30333335, 38333335, 51116111, 70000361, 300030005, 300033305, 351111111, 1300000007, 5161111111, 8333333335, 300000000035, 311111111161, 544444444444, 2000000000007, 5700000000001, 7270000000007, 88888888833335, 100000000000507, 5111111111111161, 7277777777777777707, 8888888888888888888335, 30000000000000000000051, 1000000000000000000000000057, 56111111111111111111111111111111111111, 7666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666662, 27777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777707, 300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000011}

Base 10: 77 primes (the largest of which has 31 digits): {11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 227, 251, 257, 277, 281, 349, 409, 449, 499, 521, 557, 577, 587, 727, 757, 787, 821, 827, 857, 877, 881, 887, 991, 2087, 2221, 5051, 5081, 5501, 5581, 5801, 5851, 6469, 6949, 8501, 9001, 9049, 9221, 9551, 9649, 9851, 9949, 20021, 20201, 50207, 60649, 80051, 666649, 946669, 5200007, 22000001, 60000049, 66000049, 66600049, 80555551, 555555555551, 5000000000000000000000000000027}

Base 11: 1068 primes (including 1 unproven probable prime: 57&lt;sub&gt;62668&lt;/sub&gt;), the largest of which has 62669 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel11 Data of Athena problem base 11]

Base 12: 106 primes (the largest of which has 42 digits): {11, 15, 17, 1B, 25, 27, 31, 35, 37, 3B, 45, 4B, 51, 57, 5B, 61, 67, 6B, 75, 81, 85, 87, 8B, 91, 95, A7, AB, B5, B7, 221, 241, 2A1, 2B1, 2BB, 401, 421, 447, 471, 497, 565, 655, 665, 701, 70B, 721, 747, 771, 77B, 797, 7A1, 7BB, 907, 90B, 9BB, A41, B21, B2B, 2001, 200B, 202B, 222B, 229B, 292B, 299B, 4441, 4707, 4777, 6A05, 6AA5, 729B, 7441, 7B41, 929B, 9777, 992B, 9947, 997B, 9997, A0A1, A201, A605, A6A5, AA65, B001, B0B1, BB01, BB41, 600A5, 7999B, 9999B, AAAA1, B04A1, B0B9B, BAA01, BAAA1, BB09B, BBBB1, 44AAA1, A00065, BBBAA1, AAA0001, B00099B, AA000001, BBBBBB99B, B0000000000000000000000000009B, 400000000000000000000000000000000000000077}

Base 13: 3197 primes (including 4 unproven probable primes: C5&lt;sub&gt;23755&lt;/sub&gt;C, 80&lt;sub&gt;32017&lt;/sub&gt;111, 95&lt;sub&gt;197420&lt;/sub&gt;, A3&lt;sub&gt;592197&lt;/sub&gt;A), the largest of which has 592199 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel13 Data of Athena problem base 13]

Base 14: 650 primes, the largest of which has 19699 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel14 Data of Athena problem base 14]

Base 15: 1284 primes, the largest of which has 157 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel15 Data of Athena problem base 15]

Base 16: 2347 primes (including 3 unproven probable primes: DB&lt;sub&gt;32234&lt;/sub&gt;, 4&lt;sub&gt;72785&lt;/sub&gt;DD, 3&lt;sub&gt;116137&lt;/sub&gt;AF), the largest of which has 116139 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel16 Data of Athena problem base 16]

Base 17: 10415 known primes (including many unproven probable primes) and 12 unsolved families (1{7}, 1F{0}7, 4{7}A, 70F{0}D, 8{B}9, 9{5}9, A{D}F, B{0}B3, {B}E9, {B}EE, F1{9}, FD0{D}, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel17 Data of Athena problem base 17] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left17 Data of unsolved families for base 17]

Base 18: 549 primes, the largest of which has 6271 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel18 Data of Athena problem base 18]

Base 19: 31417 known primes (including many unproven probable primes) and 17 unsolved families (4B5{0}H, {5}3, 5{H}05, 5{H}0H, 5{H}5, 66{B}, 71{0}177, 7AF{0}H, 97{0}3, C{H}C, EE1{6}, F{7}5, F{B}G, F{D}F, H0F{0}7A, HB{0}5B5, II{D}, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel19 Data of Athena problem base 19] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left19 Data of unsolved families for base 19]

Base 20: 3314 primes, the largest of which has 6271 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel20 Data of Athena problem base 20]

Base 21: 13386 known primes (including many unproven probable primes) and 8 unsolved families (5{0}DJ, {9}D, B3{0}EB, B{H}6H, C{F}0K, {F}35, G{0}FK, H{0}7771, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel21 Data of Athena problem base 21] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left21 Data of unsolved families for base 21]

Base 22: 8003 primes (including 1 unproven probable prime: BK&lt;sub&gt;22001&lt;/sub&gt;5), the largest of which has 22003 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel22 Data of Athena problem base 22]

Base 23: 65178 known primes (including many unproven probable primes) and 87 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel23 Data of Athena problem base 23] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left23 Data of unsolved families for base 23]

Base 24: 3409 primes, the largest of which has 8134 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel24 Data of Athena problem base 24]

Base 25: 133639 known primes (including many unproven probable primes) and 85 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel25 Data of Athena problem base 25] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left25 Data of unsolved families for base 25]

Base 26: 25256 known primes (including 7 unproven probable primes: 5&lt;sub&gt;19391&lt;/sub&gt;6F, 7&lt;sub&gt;20279&lt;/sub&gt;OL, LD0&lt;sub&gt;20975&lt;/sub&gt;7, 6K&lt;sub&gt;23300&lt;/sub&gt;5, J0&lt;sub&gt;44303&lt;/sub&gt;KCB, M0&lt;sub&gt;61186&lt;/sub&gt;2BB, 85M&lt;sub&gt;197060&lt;/sub&gt;B) and 3 unsolved families ({A}6F, {H}MH, {I}GL, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel26 Data of Athena problem base 26]

Base 27: 102852 known primes (including many unproven probable primes) and 44 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel27 Data of Athena problem base 27] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left27 Data of unsolved families for base 27]

Base 28: 25528 known primes (including 3 unproven probable primes: N6&lt;sub&gt;24051&lt;/sub&gt;LR, 5OA&lt;sub&gt;31238&lt;/sub&gt;F, O4O&lt;sub&gt;94535&lt;/sub&gt;9) and 1 unsolved family (O{A}F, no primes or probable primes with length ≤ 709070, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel28 Data of Athena problem base 28]

Base 29: 355242 known primes (including many unproven probable primes) and 125 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel29 Data of Athena problem base 29] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left29 Data of unsolved families for base 29]

Base 30: 2619 primes (including 1 unproven probable prime: I0&lt;sub&gt;24608&lt;/sub&gt;D), the largest of which has 34206 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel30 Data of Athena problem base 30]

Base 31: 569323 known primes (including many unproven probable primes) and 77 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel31 Data of Athena problem base 31] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left31 Data of unsolved families for base 31]

Base 32: 168882 known primes (including many unproven probable primes) and 120 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel32 Data of Athena problem base 32] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left32 Data of unsolved families for base 32]

Base 33: 280012 known primes (including many unproven probable primes) and 81 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel33 Data of Athena problem base 33] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left33 Data of unsolved families for base 33]

Base 34: 184785 known primes (including many unproven probable primes) and 47 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel34 Data of Athena problem base 34] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left34 Data of unsolved families for base 34]

Base 35: 720002 known primes (including many unproven probable primes) and 60 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel35 Data of Athena problem base 35] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left35 Data of unsolved families for base 35]

Base 36: 35286 known primes (including 3 unproven probable primes: 7K&lt;sub&gt;26567&lt;/sub&gt;Z, S0&lt;sub&gt;75007&lt;/sub&gt;8H, P&lt;sub&gt;81993&lt;/sub&gt;SZ) and 4 unsolved families (B{0}EUV, HM{0}N, N{0}YYN, O{L}Z, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel36 Data of Athena problem base 36]

== The fully proof of Athena problem in decimal (base ''b'' = 10) ==

'''Bold''' for the minimal elements, ''x'' ◁ ''y'' means ''x'' is a subsequence of ''y''.

Assume ''p'' is a prime &gt; 10, and the last digit of ''p'' must lie in {1,3,7,9}.

Case 1: ''p'' ends with 1.

In this case we can write ''p'' = ''x''1. If ''x'' contains 1, 3, 4, 6, or 7, then (respectively) '''11''' ◁ ''p'', '''31''' ◁ ''p'', '''41''' ◁ ''p'', '''61''' ◁ ''p'', or '''71''' ◁ ''p''. Hence we may assume all digits of ''x'' are 0, 2, 5, 8, or 9.

Case 1.1: ''p'' begins with 2.

In this case we can write ''p'' = 2''y''1. If 5 ◁ ''y'', then '''251''' ◁ ''p''. If 8 ◁ ''y'', then '''281''' ◁ ''p''. If 9 ◁ ''y'', then 29 ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 2.

If 22 ◁ ''y'', then '''2221''' ◁ ''p''. Hence we may assume ''y'' contains zero or one 2's.

If ''y'' contains no 2's, then ''p'' ∈ 2{0}1. But then, since the sum of the digits of ''p'' is 3, ''p'' is divisible by 3, so ''p'' cannot be prime.

If ''y'' contains exactly one 2, then we can write ''p'' = 2''z''2''w''1, where ''z'',''w'' ∈ {0}. If 0 ◁ ''z'' and 0 ◁ ''w'', then '''20201''' ◁ ''p''. Hence we may assume either ''z'' or ''w'' is empty.

If ''z'' is empty, then ''p'' ∈ 22{0}1, and the smallest prime ''p'' ∈ 22{0}1 is '''22000001'''.

If ''w'' is empty, then ''p'' ∈ 2{0}21, and the smallest prime ''p'' ∈ 2{0}21 is '''20021'''.

Case 1.2: ''p'' begins with 5.

In this case we can write ''p'' = 5''y''1. If 2 ◁ ''y'', then '''521''' ◁ ''p''. If 9 ◁ ''y'', then 59 ◁ ''p''. Hence we may assume all digits of ''y'' are 0, 5, or 8.

If 05 ◁ ''y'', then '''5051''' ◁ ''p''. If 08 ◁ ''y'', then '''5081''' ◁ ''p''. If 50 ◁ ''y'', then '''5501''' ◁ ''p''. If 58 ◁ ''y'', then '''5581''' ◁ ''p''. If 80 ◁ ''y'', then '''5801''' ◁ ''p''. If 85 ◁ ''y'', then '''5851''' ◁ ''p''. Hence we may assume ''y'' ∈ {0} ∪ {5} ∪ {8}.

If ''y'' ∈ {0}, then ''p'' ∈ 5{0}1. But then, since the sum of the digits of ''p'' is 6, ''p'' is divisible by 3, so ''p'' cannot be prime.

If ''y'' ∈ {5}, then ''p'' ∈ 5{5}1, and the smallest prime ''p'' ∈ 5{5}1 is '''555555555551'''.

If ''y'' ∈ {8}, since if 88 ◁ ''y'', then 881 ◁ ''p'', hence we may assume ''y'' ∈ {''𝜆'',8}, and thus ''p'' ∈ {51,581}, but 51 and 581 are both composite.

Case 1.3: ''p'' begins with 8.

In this case we can write p = 8''y''1. If 2 ◁ ''y'', then '''821''' ◁ ''p''. If 8 ◁ ''y'', then '''881''' ◁ ''p''. If 9 ◁ ''y'', then 89 ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 5.

If 50 ◁ ''y'', then '''8501''' ◁ ''p''. Hence we may assume y ∈ {0}{5}.

If 005 ◁ ''y'', then '''80051''' ◁ p. Hence we may assume y ∈ {0} ∪ {5} ∪ 0{5}.

If y ∈ {0}, then ''p'' ∈ 8{0}1. But then, since the sum of the digits of ''p'' is 9, ''p'' is divisible by 3, so ''p'' cannot be prime.

If y ∈ {5}, since if 55555555555 ◁ ''y'', then 555555555551 ◁ ''p'', hence we may assume ''y'' ∈ {''𝜆'', 5, 55, 555, 5555, 55555, 555555, 5555555, 55555555, 555555555, 5555555555}, and thus ''p'' ∈ {81, 851, 8551, 85551, 855551, 8555551, 85555551, 855555551, 8555555551, 85555555551, 855555555551}, but all of these numbers are composite.

If y ∈ 0{5}, since if 55555555555 ◁ ''y'', then 555555555551 ◁ ''p'', hence we may assume ''y'' ∈ {0, 05, 055, 0555, 05555, 055555, 0555555, 05555555, 055555555, 0555555555, 05555555555}, and thus ''p'' ∈ {801, 8051, 80551, 805551, 8055551, 80555551, 805555551, 8055555551, 80555555551, 805555555551, 8055555555551}, and of these numbers only 80555551 and 8055555551 are primes, but 80555551 ◁ 8055555551, thus only '''80555551''' is a minimal element.

Case 1.4: ''p'' begins with 9.

In this case we can write p = 9''y''1. If 9 ◁ ''y'', then '''991''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0, 2, 5, or 8.

If 00 ◁ ''y'', then '''9001''' ◁ ''p''. If 22 ◁ ''y'', then '''9221''' ◁ ''p''. If 55 ◁ ''y'', then '''9551''' ◁ ''p''. If 88 ◁ ''y'', then 881 ◁ ''p''. Hence we may assume ''y'' contains at most one 0, at most one 2, at most one 5, and at most one 8.

If ''y'' only contains at most one 0 and does not contain any of {2,5,8}, then ''y'' ∈ {''𝜆'',0}, and thus ''p'' ∈ {91,901}, but 91 and 901 are both composite. If ''y'' only contains at most one 0 and only one of {2,5,8}, then the sum of the digits of ''p'' is divisible by 3, ''p'' is divisible by 3, so ''p'' cannot be prime. Hence we may assume ''y'' contains at least two of {2,5,8}.

If 25 ◁ ''y'', then 251 ◁ ''p''. If 28 ◁ ''y'', then 281 ◁ ''p''. If 52 ◁ ''y'', then 521 ◁ ''p''. If 82 ◁ ''y'', then 821 ◁ ''p''. Hence we may assume ''y'' contains no 2's (since if ''y'' contains 2, then ''y'' cannot contain either 5's or 8's, which is a contradiction).

If 85 ◁ ''y'', then '''9851''' ◁ ''p''. Hence we may assume ''y'' ∈ {58,580,508,058}, and thus ''p'' ∈ {9581,95801,95081,90581}, and of these numbers only 95801 is prime, but 95801 is not a minimal element since 5801 ◁ 95801.

Case 2: ''p'' ends with 3.

In this case we can write p = ''x''3. If ''x'' contains 1, 2, 4, 5, 7, or 8, then (respectively) '''13''' ◁ ''p'', '''23''' ◁ ''p'', '''43''' ◁ ''p'', '''53''' ◁ ''p'', '''73''' ◁ ''p'', or '''83''' ◁ ''p''. Hence we may assume all digits of ''x'' are 0, 3, 6, or 9, and thus all digits of ''p'' are 0, 3, 6, or 9. But then, since the digits of ''p'' all have a common factor 3, ''p'' is divisible by 3, so ''p'' cannot be prime.

Case 3: ''p'' ends with 7.

In this case we can write ''p'' = ''x''7. If ''x'' contains 1, 3, 4, 6, or 9, then (respectively) '''17''' ◁ ''p'', '''37''' ◁ ''p'', '''47''' ◁ ''p'', '''67''' ◁ ''p'', or '''97''' ◁ ''p''. Hence we may assume all digits of ''x'' are 0, 2, 5, 7, or 8.

Case 3.1: ''p'' begins with 2.

In this case we can write ''p'' = 2''y''7. If 2 ◁ ''y'', then '''227''' ◁ ''p''. If 5 ◁ ''y'', then '''257''' ◁ ''p''. If 7 ◁ ''y'', then '''277''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 8.

If 08 ◁ ''y'', then '''2087''' ◁ ''p''. If 88 ◁ ''y'', then 887 ◁ ''p''. Hence we may assume ''y'' ∈ {0} ∪ 8{0}.

If ''y'' ∈ {0}, then ''p'' ∈ 2{0}7. But then, since the sum of the digits of ''p'' is 9, ''p'' is divisible by 3, so ''p'' cannot be prime.

If y ∈ 8{0}, then ''p'' ∈ 28{0}7. But then ''p'' is divisible by 7, since for ''n'' ≥ 0 we have 7 × 40&lt;sub&gt;''n''&lt;/sub&gt;1 = 280&lt;sub&gt;''n''&lt;/sub&gt;7.

Case 3.2: ''p'' begins with 5.

In this case we can write ''p'' = 5''y''7. If 5 ◁ ''y'', then '''557''' ◁ ''p''. If 7 ◁ ''y'', then '''577''' ◁ ''p''. If 8 ◁ ''y'', then '''587''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 2.

If 22 ◁ ''y'', then 227 ◁ ''p''. Hence we may assume ''y'' contains zero or one 2's.

If ''y'' contains no 2's, then ''p'' ∈ 5{0}7. But then, since the sum of the digits of ''p'' is 12, ''p'' is divisible by 3, so ''p'' cannot be prime.

If ''y'' contains exactly one 2, then we can write ''p'' = 5''z''2''w''7, where ''z'',''w'' ∈ {0}. If 0 ◁ ''z'' and 0 ◁ ''w'', then '''50207''' ◁ ''p''. Hence we may assume either ''z'' or ''w'' is empty.

If ''z'' is empty, then ''p'' ∈ 52{0}7, and the smallest prime ''p'' ∈ 52{0}7 is '''5200007'''.

If ''w'' is empty, then ''p'' ∈ 5{0}27, and the smallest prime ''p'' ∈ 5{0}27 is '''5000000000000000000000000000027'''.

Case 3.3: ''p'' begins with 7.

In this case we can write ''p'' = 7''y''7. If 2 ◁ ''y'', then '''727''' ◁ ''p''. If 5 ◁ ''y'', then '''757''' ◁ ''p''. If 8 ◁ ''y'', then '''787''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 7, and thus all digits of ''p'' are 0 or 7. But then, since the digits of ''p'' all have a common factor 7, ''p'' is divisible by 7, so ''p'' cannot be prime.

Case 3.4: ''p'' begins with 8.

In this case we can write ''p'' = 8''y''7. If 2 ◁ ''y'', then '''827''' ◁ ''p''. If 5 ◁ ''y'', then '''857''' ◁ ''p''. If 7 ◁ ''y'', then '''877''' ◁ ''p''. If 8 ◁ ''y'', then '''887''' ◁ ''p''. Hence we may assume ''y'' ∈ {0}, and thus ''p'' ∈ 8{0}7. But then, since the sum of the digits of ''p'' is 15, ''p'' is divisible by 3, so ''p'' cannot be prime.

Case 4: ''p'' ends with 9.

In this case we can write ''p'' = ''x''9. If ''x'' contains 1, 2, 5, 7, or 8, then (respectively) '''19''' ◁ ''p'', '''29''' ◁ ''p'', '''59''' ◁ ''p'', '''79''' ◁ ''p'', or '''89''' ◁ ''p''. Hence we may assume all digits of ''x'' are 0, 3, 4, 6, or 9.

If 44 ◁ ''x'', then '''449''' ◁ ''p''. Hence we may assume ''x'' contains zero or one 4's.

If x contains no 4's, then all digits of ''x'' are 0, 3, 6, or 9, and thus all digits of ''p'' are 0, 3, 6, or 9. But then, since the digits of ''p'' all have a common factor 3, ''p'' is divisible by 3, so ''p'' cannot be prime. Hence we may assume that ''x'' contains exactly one 4.

Case 4.1: ''p'' begins with 3.

In this case we can write ''p'' = 3''y''4''z''9, where all digits of ''y'', ''z'' are 0, 3, 6, or 9. We must have '''349''' ◁ ''p''.

Case 4.2: ''p'' begins with 4.

In this case we can write ''p'' = 4''y''9, where all digits of ''y'' are 0, 3, 6, or 9. If 0 ◁ ''y'', then '''409''' ◁ ''p''. If 3 ◁ ''y'', then 43 ◁ ''p''. If 9 ◁ ''y'', then '''499''' ◁ ''p''. Hence we may assume ''y'' ∈ {6}, and thus ''p'' ∈ 4{6}9. But then ''p'' is divisible by 7, since for ''n'' ≥ 0 we have 7 × 6&lt;sub&gt;''n''&lt;/sub&gt;7 = 46&lt;sub&gt;''n''&lt;/sub&gt;9.

Case 4.3: ''p'' begins with 6.

In this case we can write p = 6''y''4''z''9, where all digits of ''y'', ''z'' are 0, 3, 6, or 9. If 0 ◁ ''z'', then 409 ◁ ''p''. If 3 ◁ ''z'', then 43 ◁ ''p''. If 6 ◁ ''z'', then '''6469''' ◁ ''p''. If 9 ◁ ''z'', then 499 ◁ ''p''. Hence we may assume ''z'' is empty.

If 3 ◁ ''y'', then 349 ◁ ''p''. If 9 ◁ ''y'', then '''6949''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 6.

If 06 ◁ ''y'', then '''60649''' ◁ ''p''. Hence we may assume ''y'' ∈ {6}{0}.

If 666 ◁ ''y'', then '''666649''' ◁ ''p''. If 00000 ◁ ''y'', then '''60000049''' ◁ ''p''. Hence we may assume ''y'' ∈ {''𝜆'', 0, 00, 000, 0000, 6, 60, 600, 6000, 60000, 66, 660, 6600, 66000, 660000}, and thus ''p'' ∈ {649, 6049, 60049, 600049, 6000049, 6649, 66049, 660049, 6600049, 66000049, 66649, 666049, 6660049, 66600049, 666000049}, and of these numbers only '''66000049''' and '''66600049''' are primes.

Case 4.4: ''p'' begins with 9.

In this case we can write p = 9''y''4''z''9, where all digits of ''y'', ''z'' are 0, 3, 6, or 9. If 0 ◁ ''y'', then '''9049''' ◁ ''p''. If 3 ◁ ''y'', then 349 ◁ ''p''. If 6 ◁ ''y'', then '''9649''' ◁ ''p''. If 9 ◁ ''y'', then '''9949''' ◁ ''p''. Hence we may assume ''y'' is empty.

If 0 ◁ ''z'', then 409 ◁ ''p''. If 3 ◁ ''z'', then 43 ◁ ''p''. If 9 ◁ ''z'', then 499 ◁ ''p''. Hence we may assume ''z'' ∈ {6}, and thus ''p'' ∈ 94{6}9, and the smallest prime ''p'' ∈ 94{6}9 is 946669.

[[Category:Number theory]]</text>
      <sha1>6phmr9xwjyofxdsytx8djpi948av90j</sha1>
    </revision>
    <revision>
      <id>2809765</id>
      <parentid>2809764</parentid>
      <timestamp>2026-05-16T22:12:16Z</timestamp>
      <contributor>
        <username>雅典娜241</username>
        <id>3071373</id>
      </contributor>
      <origin>2809765</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="45405" sha1="ejvtrhzt8al9tpa7pl9mbplamrsalr0" xml:space="preserve">'''Athena problem''' is an [[:w:List of unsolved problems in mathematics|unsolved problem]] in [[:w:Number theory|number theory]] and [[:w:Formal language theory|formal language theory]] and [[:w:Order theory|order theory]], this problem is named after the ancient Greek goddess [[:w:Athena|Athena]] (which is associated with [[:w:Wisdom|wisdom]]). Athena problem is: Give a [[:w:Natural number|natural number]] ''b'' &gt; 1, find the [[:w:Set (mathematics)|set]] of the [[:w:Minimal element|minimal element]]s of the set of the &quot;[[:w:Prime number|prime number]] [[:w:Greater than|&gt;]] ''b''&quot; [[:w:Numerical digit|digit]] [[:w:String (computer science)|string]]s in the [[:w:Positional numeral system|positional numeral system]] with [[:w:Radix|base]] ''b'' for the [[:w:Subsequence|subsequence]] [[:w:Partially ordered set|ordering]]. (A string ''x'' is a subsequence of another string ''y'', if ''x'' can be obtained from ''y'' by deleting zero or more of the [[:w:Character (computing)|character]]s in ''y''. For example, 514 is a subsequence of 352148, &quot;string&quot; is a subsequence of &quot;meistersinger&quot;. In contrast, 758 is not a subsequence of 378259, &quot;abc&quot; is not a subsequence of &quot;cbacacba&quot;, since the characters must be in the same order) (Unlike [[:w:Substring|substring]], subsequence is not required to occupy consecutive positions within the original sequences, e.g. the [[:w:Longest common subsequence|longest common subsequence problem]] is different from the [[:w:Longest common substring|longest common string problem]])

Using [[:w:Formal language theory|formal language theory]] terminology, Athena problem is finding the [[:w:Set (mathematics)|set]] of the [[:w:Minimal element|minimal element]]s of the [[:w:Formal language|language]] of base-''b'' [[:w:Representation (mathematics)|representation]]s of the [[:w:Prime number|prime number]]s [[:w:Greater than|&gt;]] ''b'' (which is a set of [[:w:String (computer science)|string]]s of [[:w:Symbol|symbol]]s over the [[:w:Alphabet (formal languages)|alphabet]] ''Σ''&lt;sub&gt;''b''&lt;/sub&gt; := {0, 1, ..., ''b''−1}), under the subsequence ordering (i.e. the [[:w:Binary relation|binary relation]] &quot;is a subsequence of&quot;, which is a [[:w:Partially ordered set|partial ordering]]), for a given natural number ''b'' &gt; 1. (You can draw this ordering as [[:w:Hasse diagram|Hasse diagram]] to find all [[:w:Minimal element|minimal element]]s)

By [[:w:Higman's lemma|Higman's lemma]], there are no [[:w:Infinite set|infinite]] [[:w:Antichain|antichain]]s for the subsequence ordering (i.e. the subsequence ordering is always a [[:w:Well-quasi-ordering|well quasi order]]) (i.e. under the subsequence ordering (i.e. the [[:w:Binary relation|binary relation]] &quot;is a subsequence of&quot;, which is a [[:w:Partially ordered set|partial ordering]]), every set of pairwise incomparable (i.e. not [[:w:Comparability|comparable]]) strings is finite), thus there must be only finitely many such minimal elements. In other words, the set of such minimal elements must be a [[:w:Finite set|finite set]], e.g. in [[:w:Decimal|decimal]] (base ''b'' = 10), this set has exactly 77 [[:w:Element of a set|element]]s: {11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 227, 251, 257, 277, 281, 349, 409, 449, 499, 521, 557, 577, 587, 727, 757, 787, 821, 827, 857, 877, 881, 887, 991, 2087, 2221, 5051, 5081, 5501, 5581, 5801, 5851, 6469, 6949, 8501, 9001, 9049, 9221, 9551, 9649, 9851, 9949, 20021, 20201, 50207, 60649, 80051, 666649, 946669, 5200007, 22000001, 60000049, 66000049, 66600049, 80555551, 555555555551, 5000000000000000000000000000027}.

For bases 2 ≤ ''b'' ≤ 36, Athena problem is fully solved in bases ''b'' = 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 18, 20, 24, and also solved in bases ''b'' = 11, 13, 16, 22, 30 if [[:w:Probable prime|probable prime]]s are allowed. For the unsolved bases ''b'' = 17, 19, 21, 23, 25, 26, 27, 28, 29, 31, 32, 34, 35, 36, Athena problem is solved (if probable primes are allowed) except 771 [[:w:Indexed family|families]] of the form ''x''{''y''}''z'' (where ''x'' and ''z'' are strings (may be [[:w:Empty string|empty]]) of digits in base ''b'', ''y'' is a digit in base ''b''), all of these 771 families contain no primes or probable primes with length ≤ 100000.

== Results ==

These are the results of the Athena problem in bases 2 ≤ ''b'' ≤ 36 (we stop at base 36 since this base is the maximum base for which it is possible to write the numbers with the [[:w:Symbol|symbol]]s 0, 1, 2, ..., 9 and A, B, C, ..., Z (i.e. the 10 [[:w:Arabic numerals|Arabic numerals]] and the 26 [[:w:Latin script|Latin letters]]): (some large primes are only probable primes, i.e. not definitely primes, since they are too large to be [[:w:Elliptic curve primality|ECPP proved]] and [[:w:Pocklington primality test#Extensions and variants|neither ''N''−1 nor ''N''+1 can be ≥ 1/3 factored]], all of them pass the [[:w:Baillie–PSW primality test|Baillie–PSW primality test]] and the [[:w:Strong pseudoprime|strong primality test]] (i.e. the [[:w:Miller–Rabin primality test|Miller–Rabin primality test]]) with all prime bases ''p'' ≤ 61, however, all primes &lt; 10&lt;sup&gt;25000&lt;/sup&gt; for bases ''b'' = 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 18, 20, 22, 24, 26, 28, 30, 36 are definitely primes, most of them &gt; 10&lt;sup&gt;299&lt;/sup&gt; are proven primes with [[:w:Elliptic curve primality|ECPP proving]], others &gt; 10&lt;sup&gt;299&lt;/sup&gt; are proven primes with [[:w:Pocklington primality test#Extensions and variants|''N''−1 or ''N''+1 proving]])

To solve the Athena problem for a given base ''b'', we must [[:w:Computing|compute]] the element up to families of the form ''x''{''y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''y'' is a digit in base ''b'') (we call such families ''linear families''), and find the smallest prime &gt; ''b'' in all such families.

Shrinking the family ''x''{''Y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''Y'' is a set of digits in base ''b'')

* If ''y'' ∈ ''Y'' and the string ''xyyz'' represents a prime &gt; ''b'' in base ''b'' (in this case, add this prime to the list) or has a subsequence which represents a prime &gt; ''b'' in base ''b'', then ''x''{''Y''}''z'' can be replaced with ''x''{''Y'' \ ''y''}''z'' ∪ ''x''{''Y'' \ ''y''}''y''{''Y'' \ ''y''}''z''.
* If ''y''&lt;sub&gt;1&lt;/sub&gt; ∈ ''Y'' and ''y''&lt;sub&gt;2&lt;/sub&gt; ∈ ''Y'' and ''y''&lt;sub&gt;1&lt;/sub&gt; ≠ ''y''&lt;sub&gt;2&lt;/sub&gt; and the string ''xy''&lt;sub&gt;1&lt;/sub&gt;''y''&lt;sub&gt;2&lt;/sub&gt;''z'' represents a prime &gt; ''b'' in base ''b'' (in this case, add this prime to the list) or has a subsequence which represents a prime &gt; ''b'' in base ''b'', then ''x''{''Y''}''z'' can be replaced with ''x''{''Y'' \ ''y''&lt;sub&gt;1&lt;/sub&gt;}{''Y'' \ ''y''&lt;sub&gt;2&lt;/sub&gt;}''z''.
* If ''y''&lt;sub&gt;1&lt;/sub&gt; ∈ ''Y'' and ''y''&lt;sub&gt;2&lt;/sub&gt; ∈ ''Y'' and ''y''&lt;sub&gt;1&lt;/sub&gt; ≠ ''y''&lt;sub&gt;2&lt;/sub&gt; and both the strings ''xy''&lt;sub&gt;1&lt;/sub&gt;''y''&lt;sub&gt;2&lt;/sub&gt;''z'' and ''xy''&lt;sub&gt;2&lt;/sub&gt;''y''&lt;sub&gt;1&lt;/sub&gt;''z'' represent a prime &gt; ''b'' in base ''b'' (in this case, add this prime to the list) or have a subsequence which represents a prime &gt; ''b'' in base ''b'', then ''x''{''Y''}''z'' can be replaced with ''x''{''Y'' \ ''y''&lt;sub&gt;1&lt;/sub&gt;}''z'' ∪ ''x''{''Y'' \ ''y''&lt;sub&gt;2&lt;/sub&gt;}''z''.

e.g. in decimal (base ''b'' = 10):

* 2221 is a prime &gt; 10, thus the family 2{0,2}1 splits into the two families 2{0}1 and 2{0}2{0}1.
* 227 is a prime &gt; 10, and it is a subsequence of 5227, thus the family 5{0,2}7 splits into the two families 5{0}7 and 5{0}2{0}7.
* 449 is a prime &gt; 10, and it is a subsequence of 6449, thus the family 6{0,3,4,6,9}9 splits into the two families 6{0,3,6,9}9 and 6{0,3,6,9}4{0,3,6,9}9.
* Both 5051 and 5501 are primes &gt; 10, thus the family 5{0,5}1 splits into the two families 5{0}1 and 5{5}1 = {5}1.
* 8501 is a prime &gt; 10, thus the family 8{0,5}1 splits into the family 8{0}{5}1.
* 887 is a prime &gt; 10, and it is a subsequence of 2887, also 2087 is a prime &gt; 10, thus the family 2{0,8}7 splits into the two families 2{0}7 and 28{0}7.
* 349 and 449 are primes &gt; 10, and they are subsequences of 9349 and 9449, respectively, also 9049, 9649, 9949 are primes &gt; 10, thus the family 9{0,3,4,6,9}9 splits into the two families 9{0,3,6,9}9 and 94{0,3,6,9}9.
* 251, 281, 521, 821, 881 are primes &gt; 10, and they are subsequences of 9251, 9281, 9521, 9821, 9881, respectively, also 9001, 9221, 9551, 9851 are primes &gt; 10, thus the family 9{0,2,5,8}1 splits into the numbers {91, 901, 921, 951, 981, 9021, 9051, 9081, 9201, 9501, 9581, 9801, 90581, 95081, 95801}.

If the methods we have discussed cannot be used to rule out or shrink ''x''{''Y''}''z'' where ''Y'' = {''y''&lt;sub&gt;1&lt;/sub&gt;, ''y''&lt;sub&gt;2&lt;/sub&gt;, ..., ''y''&lt;sub&gt;''n''&lt;/sub&gt;}, then we can replace ''x''{''Y''}''z'' by ''xy''&lt;sub&gt;1&lt;/sub&gt;{''Y''}''z'' ∪ ''xy''&lt;sub&gt;2&lt;/sub&gt;{''Y''}''z'' ∪ ... ∪ ''xy''&lt;sub&gt;''n''&lt;/sub&gt;{''Y''}''z'' and re-run the methods on this new [[:w:Formal language|language]].

If all remain families are linear families (i.e. of the form ''x''{''y''}''z'', where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''y'' is a digit in base ''b''), then we search the smallest (probable) primes in these families and add these primes to the list.

e.g. in decimal (base ''b'' = 10):

* The smallest prime in the family 5{0}27 is 5000000000000000000000000000027.
* The smallest prime in the family {5}1 is 555555555551.
* The smallest prime in the family 8{5}1 is 8555555555555555555551, but 8555555555555555555551 is not a minimal element since 555555555551 is a subsequence of 8555555555555555555551.

There is no guarantee that the techniques discussed will ever terminate, but in practice they often do. They are able to determine the set of the minimal elements in base ''b'' for 2 ≤ ''b'' ≤ 16 and ''b'' = 18, 20, 22, 24, 30. The bases ''b'' = 17, 19, 21, 23, 25 ≤ ''b'' ≤ 29, 31 ≤ ''b'' ≤ 36 are solved with the exception of 771 families of the form ''x''{''y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''y'' is a digit in base ''b'').

The following is a &quot;[[:w:Semi-algorithm|semi-algorithm]]&quot; that is guaranteed to solve the Athena problem for a given base ''b'', but it is not so easy to implement:

# ''M'' = ''[[:w:Empty string|∅]]''
# while (''L'' ≠ ''∅'') do
# choose ''x'', a shortest string in ''L''
# ''M'' := ''M'' ∪ {''x''}
# ''L'' := ''L'' − ''sup''({''x''})

In practice, for arbitrary ''L'', we cannot feasibly carry out step 5. Instead, we work with ''L''&amp;#39;, some regular overapproximation to ''L'', until we can show ''L''&amp;#39; = ''∅'' (which implies ''L'' = ''∅''). In practice, ''L''&amp;#39; is usually chosen to be a finite [[:w:Union (set theory)|union]] of sets of the form ''L''&lt;sub&gt;1&lt;/sub&gt;{''L''&lt;sub&gt;2&lt;/sub&gt;}''L''&lt;sub&gt;3&lt;/sub&gt;, where each of ''L''&lt;sub&gt;1&lt;/sub&gt;, ''L''&lt;sub&gt;2&lt;/sub&gt;, ''L''&lt;sub&gt;3&lt;/sub&gt; is finite. In the case we consider in this project, we then have to determine whether such a family contains a prime or not.

Thus, Athena problem in bases ''b'' around 500 may be [[:w:NP-complete|NP-complete]] or [[:w:NP-hard|NP-hard]], or an [[:w:Undecidable problem|undecidable problem]], or an example of [[:w:Gödel's incompleteness theorems|Gödel's incompleteness theorems]] (like the [[:w:Continuum hypothesis|continuum hypothesis]] and the [[:w:Halting problem|halting problem]]).

To solve the Athena problem, we need to determine whether a given family contains a prime. In practice, if family ''x''{''Y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''Y'' is a set of digits in base ''b'') could not be ruled out as only containing composites and ''Y'' contains two or more digits, then a relatively small prime &gt; ''b'' could always be found in this family. Intuitively, this is because there are a large number of small strings in such a family, and at least one is likely to be prime (e.g. there are 2&lt;sup&gt;''n''−2&lt;/sup&gt; strings of length ''n'' in the family 1{3,7}9, and there are over a thousand strings of length 12 in the family 1{3,7}9, thus it is very impossible that these numbers are all composite). In the case ''Y'' contains only one digit, this family is of the form ''x''{''y''}''z'', and there is only a single string of each length &gt; (the length of ''x'' + the length of ''z''), and it is not known if the following [[:w:Decision problem|decision problem]] is recursively solvable (just like [[:w:Sierpiński number|Sierpiński problem]] and [[:w:Riesel number|Riesel problem]], Sierpiński problem and Riesel problem can be generalized to other bases ''b'', in fact, Athena problem in base ''b'' covers the Sierpiński problem in base ''b'' and the Riesel problem in base ''b'' with ''k'' &lt; ''b'', i.e. finding the smallest prime of the form ''k''×''b''&lt;sup&gt;''n''&lt;/sup&gt;+1 and ''k''×''b''&lt;sup&gt;''n''&lt;/sup&gt;−1 (or prove such prime does not exist) with ''k'' &lt; ''b'', since the smallest prime of the form ''k''×''b''&lt;sup&gt;''n''&lt;/sup&gt;+1 and ''k''×''b''&lt;sup&gt;''n''&lt;/sup&gt;−1 (if exists) must be a minimal element in base ''b''):

Problem: Given strings ''x'', ''z'' (may be empty), a digit ''y'', and a base ''b'' (''x'' does not [[:w:Leading zero|start with the digit 0]], ''z'' ends with a digit which [[:w:Coprime integers|coprime]] to ''b'', ''y'' is not 0 if ''x'' is empty, ''y'' is coprime to ''b'' if ''z'' is empty), does there exist a prime number whose base-''b'' expansion is of the form ''xy''&lt;sub&gt;''n''&lt;/sub&gt;''z'' for some ''n'' ≥ 0?

Some families can be ruled out to contain no prime &gt; ''b'' by [[:w:Covering set|covering congruence]], [[:w:Factorization of polynomials|algebraic factorization]] (e.g. [[:w:Difference of two squares|difference of two squares]], [[:w:Sum of two cubes|sum of two cubes]], [[:w:Sophie Germain's identity|Sophie Germain's identity of ''x''&lt;sup&gt;4&lt;/sup&gt;+4×''y''&lt;sup&gt;4&lt;/sup&gt;]]), or combine of them, e.g.

* The base 9 family 2{7}: Always divisible by 2 or 5
* The base 16 family {8}F: Always divisible by 3, 7, or 13
* The base 21 family {7}D: Always divisible by 2, 13, or 17
* The base 23 family {D}GA: Always divisible by 2, 5, 7, 37, or 79
* The base 9 family 3{8}: Can be written as 4×9&lt;sup&gt;''n''&lt;/sup&gt;−1 and can be factored as (2×3&lt;sup&gt;''n''&lt;/sup&gt;−1) × (2×3&lt;sup&gt;''n''&lt;/sup&gt;+1)
* The base 8 family 1{0}1: Can be written as 8&lt;sup&gt;''n''&lt;/sup&gt;+1 and can be factored as (2&lt;sup&gt;''n''&lt;/sup&gt;+1) × (4&lt;sup&gt;''n''&lt;/sup&gt;−2&lt;sup&gt;''n''&lt;/sup&gt;+1)
* The base 16 family {4}1: Can be written as (4×16&lt;sup&gt;''n''&lt;/sup&gt;−49)/15 and can be factored as (2×3&lt;sup&gt;''n''&lt;/sup&gt;−7) × (2×3&lt;sup&gt;''n''&lt;/sup&gt;+7) / 15
* The base 16 family {C}D: Can be written as (4×16&lt;sup&gt;''n''&lt;/sup&gt;+1)/5 and can be factored as (2×4&lt;sup&gt;''n''&lt;/sup&gt;−2×2&lt;sup&gt;''n''&lt;/sup&gt;+1) × (2×4&lt;sup&gt;''n''&lt;/sup&gt;+2×2&lt;sup&gt;''n''&lt;/sup&gt;+1) / 5
* The base 14 family 8{D}: Can be written as 9×14&lt;sup&gt;''n''&lt;/sup&gt;−1, it is divisible by 5 if ''n'' is odd and can be factored as (3×14&lt;sup&gt;''n''/2&lt;/sup&gt;−1) × (3×14&lt;sup&gt;''n''/2&lt;/sup&gt;+1) if ''n'' is even
* The base 12 family {B}9B: Can be written as 12&lt;sup&gt;''n''&lt;/sup&gt;−25, it is divisible by 13 if ''n'' is odd and can be factored as (12&lt;sup&gt;''n''/2&lt;/sup&gt;−5) × (12&lt;sup&gt;''n''/2&lt;/sup&gt;+5) if ''n'' is even
* The base 17 family 1{9}: Can be written as (25×17&lt;sup&gt;''n''&lt;/sup&gt;−9)/16, it is divisible by 2 if ''n'' is odd and can be factored as (5×17&lt;sup&gt;''n''/2&lt;/sup&gt;−3) × (5×17&lt;sup&gt;''n''/2&lt;/sup&gt;+3) / 16 if ''n'' is even
* The base 19 family 1{6}: Can be written as (4×19&lt;sup&gt;''n''&lt;/sup&gt;−1)/3, it is divisible by 5 if ''n'' is odd and can be factored as (2×19&lt;sup&gt;''n''/2&lt;/sup&gt;−1) × (2×19&lt;sup&gt;''n''/2&lt;/sup&gt;+1) / 3 if ''n'' is even

By the [[:w:Prime number theorem|prime number theorem]], the [[:w:Probability|chance]] that a [[:w:Random number|random]] ''n''-digit base ''b'' number is prime is [[:w:Asymptotic analysis|approximately]] 1/''n'' (more accurately, the chance is approximately 1/(''n''×''ln''(''b'')), where ''ln'' is the [[:w:Natural logarithm|natural logarithm]]). If one conjectures the numbers ''x''{''y''}''z'' behave similarly (i.e. the numbers ''x''{''y''}''z'' is a [[:w:Pseudorandomness|pseudorandom sequence]]) you would expect [[:w:Harmonic_series (mathematics)|1/1 + 1/2 + 1/3 + 1/4 + ... = ∞]] primes of the form ''x''{''y''}''z'' (of course, this does not always happen, since some ''x''{''y''}''z'' families can be ruled out to contain no prime &gt; ''b'' (by covering congruence, algebraic factorization, or combine of them), but it is at least a reasonable conjecture in the absence of evidence to the contrary. Hence, the [[:w:Heuristic argument|heuristic argument]] suggests there are always infinitely many primes in family ''x''{''y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''y'' is a digit in base ''b'') if it cannot be ruled out to contain no prime or only contain finitely many primes, by covering congruence, algebraic factorization, or combine of them. However, some families ''x''{''y''}''z'' could not be proven to contain no primes &gt; ''b'' (by covering congruence, algebraic factorization, or combine of them) but no primes &gt; ''b'' could be found in the family, even after searching through numbers with over 100000 digits. In such a case, the only way to proceed is to [[:w:Primality test|test the primality]] of larger and larger numbers of such form and hope a prime is eventually discovered. e.g. the smallest (probable) prime in the family A{3}A in base ''b'' = 13 is A3&lt;sub&gt;592197&lt;/sub&gt;A, which written in decimal contains 659677 digits (it is only probable prime, i.e. not definitely prime).

All numbers are written in base ''b'', [[:w:Senary#Base 36 as senary compression|using A to Z to represent digit values 10 to 35]], &quot;{}&quot; means repeating, e.g. family 12{3}45 means the sequence {1245, 12345, 123345, 1233345, 12333345, 123333345, ...} (where the members are expressed as base ''b'' strings), subscripts are used to indicate repetitions of digits, e.g. 123&lt;sub&gt;4&lt;/sub&gt;567 means 123333567 (all subscripts are written in decimal).

Base 2: 1 prime (the largest of which has 2 digits): {11}

Base 3: 3 primes (the largest of which has 3 digits): {12, 21, 111}

Base 4: 5 primes (the largest of which has 3 digits): {11, 13, 23, 31, 221}

Base 5: 22 primes (the largest of which has 96 digits): {12, 21, 23, 32, 34, 43, 104, 111, 131, 133, 313, 401, 414, 3101, 10103, 14444, 30301, 33001, 33331, 44441, 300031, 100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000013}

Base 6: 11 primes (the largest of which has 5 digits): {11, 15, 21, 25, 31, 35, 45, 51, 4401, 4441, 40041}

Base 7: 71 primes (the largest of which has 17 digits): {14, 16, 23, 25, 32, 41, 43, 52, 56, 61, 65, 113, 115, 131, 133, 155, 212, 221, 304, 313, 335, 344, 346, 364, 445, 515, 533, 535, 544, 551, 553, 1022, 1051, 1112, 1202, 1211, 1222, 2111, 3031, 3055, 3334, 3503, 3505, 3545, 4504, 4555, 5011, 5455, 5545, 5554, 6034, 6634, 11111, 11201, 30011, 30101, 31001, 31111, 33001, 33311, 35555, 40054, 100121, 150001, 300053, 351101, 531101, 1100021, 33333301, 5100000001, 33333333333333331}

Base 8: 75 primes (the largest of which has 221 digits): {13, 15, 21, 23, 27, 35, 37, 45, 51, 53, 57, 65, 73, 75, 107, 111, 117, 141, 147, 161, 177, 225, 255, 301, 343, 361, 401, 407, 417, 431, 433, 463, 467, 471, 631, 643, 661, 667, 701, 711, 717, 747, 767, 3331, 3411, 4043, 4443, 4611, 5205, 6007, 6101, 6441, 6477, 6707, 6777, 7461, 7641, 47777, 60171, 60411, 60741, 444641, 500025, 505525, 3344441, 4444477, 5500525, 5550525, 55555025, 444444441, 744444441, 77774444441, 7777777777771, 555555555555525, 44444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444447}

Base 9: 151 primes (the largest of which has 1161 digits): {12, 14, 18, 21, 25, 32, 34, 41, 45, 47, 52, 58, 65, 67, 74, 78, 81, 87, 117, 131, 135, 151, 155, 175, 177, 238, 272, 308, 315, 331, 337, 355, 371, 375, 377, 438, 504, 515, 517, 531, 537, 557, 564, 601, 638, 661, 702, 711, 722, 735, 737, 751, 755, 757, 771, 805, 838, 1011, 1015, 1101, 1701, 2027, 2207, 3017, 3057, 3101, 3501, 3561, 3611, 3688, 3868, 5035, 5051, 5071, 5101, 5501, 5554, 5705, 5707, 7017, 7075, 7105, 7301, 8535, 8544, 8555, 8854, 20777, 22227, 22777, 30161, 33388, 50161, 50611, 53335, 55111, 55535, 55551, 57061, 57775, 70631, 71007, 77207, 100037, 100071, 100761, 105007, 270707, 301111, 305111, 333035, 333385, 333835, 338885, 350007, 500075, 530005, 555611, 631111, 720707, 2770007, 3030335, 7776662, 30300005, 30333335, 38333335, 51116111, 70000361, 300030005, 300033305, 351111111, 1300000007, 5161111111, 8333333335, 300000000035, 311111111161, 544444444444, 2000000000007, 5700000000001, 7270000000007, 88888888833335, 100000000000507, 5111111111111161, 7277777777777777707, 8888888888888888888335, 30000000000000000000051, 1000000000000000000000000057, 56111111111111111111111111111111111111, 7666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666662, 27777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777707, 300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000011}

Base 10: 77 primes (the largest of which has 31 digits): {11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 227, 251, 257, 277, 281, 349, 409, 449, 499, 521, 557, 577, 587, 727, 757, 787, 821, 827, 857, 877, 881, 887, 991, 2087, 2221, 5051, 5081, 5501, 5581, 5801, 5851, 6469, 6949, 8501, 9001, 9049, 9221, 9551, 9649, 9851, 9949, 20021, 20201, 50207, 60649, 80051, 666649, 946669, 5200007, 22000001, 60000049, 66000049, 66600049, 80555551, 555555555551, 5000000000000000000000000000027}

Base 11: 1068 primes (including 1 unproven probable prime: 57&lt;sub&gt;62668&lt;/sub&gt;), the largest of which has 62669 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel11 Data of Athena problem base 11]

Base 12: 106 primes (the largest of which has 42 digits): {11, 15, 17, 1B, 25, 27, 31, 35, 37, 3B, 45, 4B, 51, 57, 5B, 61, 67, 6B, 75, 81, 85, 87, 8B, 91, 95, A7, AB, B5, B7, 221, 241, 2A1, 2B1, 2BB, 401, 421, 447, 471, 497, 565, 655, 665, 701, 70B, 721, 747, 771, 77B, 797, 7A1, 7BB, 907, 90B, 9BB, A41, B21, B2B, 2001, 200B, 202B, 222B, 229B, 292B, 299B, 4441, 4707, 4777, 6A05, 6AA5, 729B, 7441, 7B41, 929B, 9777, 992B, 9947, 997B, 9997, A0A1, A201, A605, A6A5, AA65, B001, B0B1, BB01, BB41, 600A5, 7999B, 9999B, AAAA1, B04A1, B0B9B, BAA01, BAAA1, BB09B, BBBB1, 44AAA1, A00065, BBBAA1, AAA0001, B00099B, AA000001, BBBBBB99B, B0000000000000000000000000009B, 400000000000000000000000000000000000000077}

Base 13: 3197 primes (including 4 unproven probable primes: C5&lt;sub&gt;23755&lt;/sub&gt;C, 80&lt;sub&gt;32017&lt;/sub&gt;111, 95&lt;sub&gt;197420&lt;/sub&gt;, A3&lt;sub&gt;592197&lt;/sub&gt;A), the largest of which has 592199 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel13 Data of Athena problem base 13]

Base 14: 650 primes, the largest of which has 19699 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel14 Data of Athena problem base 14]

Base 15: 1284 primes, the largest of which has 157 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel15 Data of Athena problem base 15]

Base 16: 2347 primes (including 3 unproven probable primes: DB&lt;sub&gt;32234&lt;/sub&gt;, 4&lt;sub&gt;72785&lt;/sub&gt;DD, 3&lt;sub&gt;116137&lt;/sub&gt;AF), the largest of which has 116139 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel16 Data of Athena problem base 16]

Base 17: 10415 known primes (including many unproven probable primes) and 12 unsolved families (1{7}, 1F{0}7, 4{7}A, 70F{0}D, 8{B}9, 9{5}9, A{D}F, B{0}B3, {B}E9, {B}EE, F1{9}, FD0{D}, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel17 Data of Athena problem base 17] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left17 Data of unsolved families for base 17]

Base 18: 549 primes, the largest of which has 6271 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel18 Data of Athena problem base 18]

Base 19: 31417 known primes (including many unproven probable primes) and 17 unsolved families (4B5{0}H, {5}3, 5{H}05, 5{H}0H, 5{H}5, 66{B}, 71{0}177, 7AF{0}H, 97{0}3, C{H}C, EE1{6}, F{7}5, F{B}G, F{D}F, H0F{0}7A, HB{0}5B5, II{D}, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel19 Data of Athena problem base 19] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left19 Data of unsolved families for base 19]

Base 20: 3314 primes, the largest of which has 6271 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel20 Data of Athena problem base 20]

Base 21: 13386 known primes (including many unproven probable primes) and 8 unsolved families (5{0}DJ, {9}D, B3{0}EB, B{H}6H, C{F}0K, {F}35, G{0}FK, H{0}7771, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel21 Data of Athena problem base 21] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left21 Data of unsolved families for base 21]

Base 22: 8003 primes (including 1 unproven probable prime: BK&lt;sub&gt;22001&lt;/sub&gt;5), the largest of which has 22003 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel22 Data of Athena problem base 22]

Base 23: 65178 known primes (including many unproven probable primes) and 87 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel23 Data of Athena problem base 23] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left23 Data of unsolved families for base 23]

Base 24: 3409 primes, the largest of which has 8134 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel24 Data of Athena problem base 24]

Base 25: 133639 known primes (including many unproven probable primes) and 85 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel25 Data of Athena problem base 25] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left25 Data of unsolved families for base 25]

Base 26: 25256 known primes (including 7 unproven probable primes: 5&lt;sub&gt;19391&lt;/sub&gt;6F, 7&lt;sub&gt;20279&lt;/sub&gt;OL, LD0&lt;sub&gt;20975&lt;/sub&gt;7, 6K&lt;sub&gt;23300&lt;/sub&gt;5, J0&lt;sub&gt;44303&lt;/sub&gt;KCB, M0&lt;sub&gt;61186&lt;/sub&gt;2BB, 85M&lt;sub&gt;197060&lt;/sub&gt;B) and 3 unsolved families ({A}6F, {H}MH, {I}GL, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel26 Data of Athena problem base 26]

Base 27: 102852 known primes (including many unproven probable primes) and 44 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel27 Data of Athena problem base 27] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left27 Data of unsolved families for base 27]

Base 28: 25528 known primes (including 3 unproven probable primes: N6&lt;sub&gt;24051&lt;/sub&gt;LR, 5OA&lt;sub&gt;31238&lt;/sub&gt;F, O4O&lt;sub&gt;94535&lt;/sub&gt;9) and 1 unsolved family (O{A}F, no primes or probable primes with length ≤ 709070, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel28 Data of Athena problem base 28]

Base 29: 355242 known primes (including many unproven probable primes) and 125 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel29 Data of Athena problem base 29] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left29 Data of unsolved families for base 29]

Base 30: 2619 primes (including 1 unproven probable prime: I0&lt;sub&gt;24608&lt;/sub&gt;D), the largest of which has 34206 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel30 Data of Athena problem base 30]

Base 31: 569323 known primes (including many unproven probable primes) and 77 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel31 Data of Athena problem base 31] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left31 Data of unsolved families for base 31]

Base 32: 168882 known primes (including many unproven probable primes) and 120 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel32 Data of Athena problem base 32] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left32 Data of unsolved families for base 32]

Base 33: 280012 known primes (including many unproven probable primes) and 81 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel33 Data of Athena problem base 33] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left33 Data of unsolved families for base 33]

Base 34: 184785 known primes (including many unproven probable primes) and 47 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel34 Data of Athena problem base 34] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left34 Data of unsolved families for base 34]

Base 35: 720002 known primes (including many unproven probable primes) and 60 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel35 Data of Athena problem base 35] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left35 Data of unsolved families for base 35]

Base 36: 35286 known primes (including 3 unproven probable primes: 7K&lt;sub&gt;26567&lt;/sub&gt;Z, S0&lt;sub&gt;75007&lt;/sub&gt;8H, P&lt;sub&gt;81993&lt;/sub&gt;SZ) and 4 unsolved families (B{0}EUV, HM{0}N, N{0}YYN, O{L}Z, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel36 Data of Athena problem base 36]

== The fully proof of Athena problem in decimal (base ''b'' = 10) ==

'''Bold''' for the minimal elements, ''x'' ◁ ''y'' means ''x'' is a subsequence of ''y''.

Assume ''p'' is a prime &gt; 10, and the last digit of ''p'' must lie in {1,3,7,9}.

Case 1: ''p'' ends with 1.

In this case we can write ''p'' = ''x''1. If ''x'' contains 1, 3, 4, 6, or 7, then (respectively) '''11''' ◁ ''p'', '''31''' ◁ ''p'', '''41''' ◁ ''p'', '''61''' ◁ ''p'', or '''71''' ◁ ''p''. Hence we may assume all digits of ''x'' are 0, 2, 5, 8, or 9.

Case 1.1: ''p'' begins with 2.

In this case we can write ''p'' = 2''y''1. If 5 ◁ ''y'', then '''251''' ◁ ''p''. If 8 ◁ ''y'', then '''281''' ◁ ''p''. If 9 ◁ ''y'', then 29 ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 2.

If 22 ◁ ''y'', then '''2221''' ◁ ''p''. Hence we may assume ''y'' contains zero or one 2's.

If ''y'' contains no 2's, then ''p'' ∈ 2{0}1. But then, since the sum of the digits of ''p'' is 3, ''p'' is divisible by 3, so ''p'' cannot be prime.

If ''y'' contains exactly one 2, then we can write ''p'' = 2''z''2''w''1, where ''z'',''w'' ∈ {0}. If 0 ◁ ''z'' and 0 ◁ ''w'', then '''20201''' ◁ ''p''. Hence we may assume either ''z'' or ''w'' is empty.

If ''z'' is empty, then ''p'' ∈ 22{0}1, and the smallest prime ''p'' ∈ 22{0}1 is '''22000001'''.

If ''w'' is empty, then ''p'' ∈ 2{0}21, and the smallest prime ''p'' ∈ 2{0}21 is '''20021'''.

Case 1.2: ''p'' begins with 5.

In this case we can write ''p'' = 5''y''1. If 2 ◁ ''y'', then '''521''' ◁ ''p''. If 9 ◁ ''y'', then 59 ◁ ''p''. Hence we may assume all digits of ''y'' are 0, 5, or 8.

If 05 ◁ ''y'', then '''5051''' ◁ ''p''. If 08 ◁ ''y'', then '''5081''' ◁ ''p''. If 50 ◁ ''y'', then '''5501''' ◁ ''p''. If 58 ◁ ''y'', then '''5581''' ◁ ''p''. If 80 ◁ ''y'', then '''5801''' ◁ ''p''. If 85 ◁ ''y'', then '''5851''' ◁ ''p''. Hence we may assume ''y'' ∈ {0} ∪ {5} ∪ {8}.

If ''y'' ∈ {0}, then ''p'' ∈ 5{0}1. But then, since the sum of the digits of ''p'' is 6, ''p'' is divisible by 3, so ''p'' cannot be prime.

If ''y'' ∈ {5}, then ''p'' ∈ 5{5}1, and the smallest prime ''p'' ∈ 5{5}1 is '''555555555551'''.

If ''y'' ∈ {8}, since if 88 ◁ ''y'', then 881 ◁ ''p'', hence we may assume ''y'' ∈ {''𝜆'',8}, and thus ''p'' ∈ {51,581}, but 51 and 581 are both composite.

Case 1.3: ''p'' begins with 8.

In this case we can write p = 8''y''1. If 2 ◁ ''y'', then '''821''' ◁ ''p''. If 8 ◁ ''y'', then '''881''' ◁ ''p''. If 9 ◁ ''y'', then 89 ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 5.

If 50 ◁ ''y'', then '''8501''' ◁ ''p''. Hence we may assume y ∈ {0}{5}.

If 005 ◁ ''y'', then '''80051''' ◁ p. Hence we may assume y ∈ {0} ∪ {5} ∪ 0{5}.

If y ∈ {0}, then ''p'' ∈ 8{0}1. But then, since the sum of the digits of ''p'' is 9, ''p'' is divisible by 3, so ''p'' cannot be prime.

If y ∈ {5}, since if 55555555555 ◁ ''y'', then 555555555551 ◁ ''p'', hence we may assume ''y'' ∈ {''𝜆'', 5, 55, 555, 5555, 55555, 555555, 5555555, 55555555, 555555555, 5555555555}, and thus ''p'' ∈ {81, 851, 8551, 85551, 855551, 8555551, 85555551, 855555551, 8555555551, 85555555551, 855555555551}, but all of these numbers are composite.

If y ∈ 0{5}, since if 55555555555 ◁ ''y'', then 555555555551 ◁ ''p'', hence we may assume ''y'' ∈ {0, 05, 055, 0555, 05555, 055555, 0555555, 05555555, 055555555, 0555555555, 05555555555}, and thus ''p'' ∈ {801, 8051, 80551, 805551, 8055551, 80555551, 805555551, 8055555551, 80555555551, 805555555551, 8055555555551}, and of these numbers only 80555551 and 8055555551 are primes, but 80555551 ◁ 8055555551, thus only '''80555551''' is a minimal element.

Case 1.4: ''p'' begins with 9.

In this case we can write p = 9''y''1. If 9 ◁ ''y'', then '''991''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0, 2, 5, or 8.

If 00 ◁ ''y'', then '''9001''' ◁ ''p''. If 22 ◁ ''y'', then '''9221''' ◁ ''p''. If 55 ◁ ''y'', then '''9551''' ◁ ''p''. If 88 ◁ ''y'', then 881 ◁ ''p''. Hence we may assume ''y'' contains at most one 0, at most one 2, at most one 5, and at most one 8.

If ''y'' only contains at most one 0 and does not contain any of {2,5,8}, then ''y'' ∈ {''𝜆'',0}, and thus ''p'' ∈ {91,901}, but 91 and 901 are both composite. If ''y'' only contains at most one 0 and only one of {2,5,8}, then the sum of the digits of ''p'' is divisible by 3, ''p'' is divisible by 3, so ''p'' cannot be prime. Hence we may assume ''y'' contains at least two of {2,5,8}.

If 25 ◁ ''y'', then 251 ◁ ''p''. If 28 ◁ ''y'', then 281 ◁ ''p''. If 52 ◁ ''y'', then 521 ◁ ''p''. If 82 ◁ ''y'', then 821 ◁ ''p''. Hence we may assume ''y'' contains no 2's (since if ''y'' contains 2, then ''y'' cannot contain either 5's or 8's, which is a contradiction).

If 85 ◁ ''y'', then '''9851''' ◁ ''p''. Hence we may assume ''y'' ∈ {58,580,508,058}, and thus ''p'' ∈ {9581,95801,95081,90581}, and of these numbers only 95801 is prime, but 95801 is not a minimal element since 5801 ◁ 95801.

Case 2: ''p'' ends with 3.

In this case we can write p = ''x''3. If ''x'' contains 1, 2, 4, 5, 7, or 8, then (respectively) '''13''' ◁ ''p'', '''23''' ◁ ''p'', '''43''' ◁ ''p'', '''53''' ◁ ''p'', '''73''' ◁ ''p'', or '''83''' ◁ ''p''. Hence we may assume all digits of ''x'' are 0, 3, 6, or 9, and thus all digits of ''p'' are 0, 3, 6, or 9. But then, since the digits of ''p'' all have a common factor 3, ''p'' is divisible by 3, so ''p'' cannot be prime.

Case 3: ''p'' ends with 7.

In this case we can write ''p'' = ''x''7. If ''x'' contains 1, 3, 4, 6, or 9, then (respectively) '''17''' ◁ ''p'', '''37''' ◁ ''p'', '''47''' ◁ ''p'', '''67''' ◁ ''p'', or '''97''' ◁ ''p''. Hence we may assume all digits of ''x'' are 0, 2, 5, 7, or 8.

Case 3.1: ''p'' begins with 2.

In this case we can write ''p'' = 2''y''7. If 2 ◁ ''y'', then '''227''' ◁ ''p''. If 5 ◁ ''y'', then '''257''' ◁ ''p''. If 7 ◁ ''y'', then '''277''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 8.

If 08 ◁ ''y'', then '''2087''' ◁ ''p''. If 88 ◁ ''y'', then 887 ◁ ''p''. Hence we may assume ''y'' ∈ {0} ∪ 8{0}.

If ''y'' ∈ {0}, then ''p'' ∈ 2{0}7. But then, since the sum of the digits of ''p'' is 9, ''p'' is divisible by 3, so ''p'' cannot be prime.

If y ∈ 8{0}, then ''p'' ∈ 28{0}7. But then ''p'' is divisible by 7, since for ''n'' ≥ 0 we have 7 × 40&lt;sub&gt;''n''&lt;/sub&gt;1 = 280&lt;sub&gt;''n''&lt;/sub&gt;7.

Case 3.2: ''p'' begins with 5.

In this case we can write ''p'' = 5''y''7. If 5 ◁ ''y'', then '''557''' ◁ ''p''. If 7 ◁ ''y'', then '''577''' ◁ ''p''. If 8 ◁ ''y'', then '''587''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 2.

If 22 ◁ ''y'', then 227 ◁ ''p''. Hence we may assume ''y'' contains zero or one 2's.

If ''y'' contains no 2's, then ''p'' ∈ 5{0}7. But then, since the sum of the digits of ''p'' is 12, ''p'' is divisible by 3, so ''p'' cannot be prime.

If ''y'' contains exactly one 2, then we can write ''p'' = 5''z''2''w''7, where ''z'',''w'' ∈ {0}. If 0 ◁ ''z'' and 0 ◁ ''w'', then '''50207''' ◁ ''p''. Hence we may assume either ''z'' or ''w'' is empty.

If ''z'' is empty, then ''p'' ∈ 52{0}7, and the smallest prime ''p'' ∈ 52{0}7 is '''5200007'''.

If ''w'' is empty, then ''p'' ∈ 5{0}27, and the smallest prime ''p'' ∈ 5{0}27 is '''5000000000000000000000000000027'''.

Case 3.3: ''p'' begins with 7.

In this case we can write ''p'' = 7''y''7. If 2 ◁ ''y'', then '''727''' ◁ ''p''. If 5 ◁ ''y'', then '''757''' ◁ ''p''. If 8 ◁ ''y'', then '''787''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 7, and thus all digits of ''p'' are 0 or 7. But then, since the digits of ''p'' all have a common factor 7, ''p'' is divisible by 7, so ''p'' cannot be prime.

Case 3.4: ''p'' begins with 8.

In this case we can write ''p'' = 8''y''7. If 2 ◁ ''y'', then '''827''' ◁ ''p''. If 5 ◁ ''y'', then '''857''' ◁ ''p''. If 7 ◁ ''y'', then '''877''' ◁ ''p''. If 8 ◁ ''y'', then '''887''' ◁ ''p''. Hence we may assume ''y'' ∈ {0}, and thus ''p'' ∈ 8{0}7. But then, since the sum of the digits of ''p'' is 15, ''p'' is divisible by 3, so ''p'' cannot be prime.

Case 4: ''p'' ends with 9.

In this case we can write ''p'' = ''x''9. If ''x'' contains 1, 2, 5, 7, or 8, then (respectively) '''19''' ◁ ''p'', '''29''' ◁ ''p'', '''59''' ◁ ''p'', '''79''' ◁ ''p'', or '''89''' ◁ ''p''. Hence we may assume all digits of ''x'' are 0, 3, 4, 6, or 9.

If 44 ◁ ''x'', then '''449''' ◁ ''p''. Hence we may assume ''x'' contains zero or one 4's.

If x contains no 4's, then all digits of ''x'' are 0, 3, 6, or 9, and thus all digits of ''p'' are 0, 3, 6, or 9. But then, since the digits of ''p'' all have a common factor 3, ''p'' is divisible by 3, so ''p'' cannot be prime. Hence we may assume that ''x'' contains exactly one 4.

Case 4.1: ''p'' begins with 3.

In this case we can write ''p'' = 3''y''4''z''9, where all digits of ''y'', ''z'' are 0, 3, 6, or 9. We must have '''349''' ◁ ''p''.

Case 4.2: ''p'' begins with 4.

In this case we can write ''p'' = 4''y''9, where all digits of ''y'' are 0, 3, 6, or 9. If 0 ◁ ''y'', then '''409''' ◁ ''p''. If 3 ◁ ''y'', then 43 ◁ ''p''. If 9 ◁ ''y'', then '''499''' ◁ ''p''. Hence we may assume ''y'' ∈ {6}, and thus ''p'' ∈ 4{6}9. But then ''p'' is divisible by 7, since for ''n'' ≥ 0 we have 7 × 6&lt;sub&gt;''n''&lt;/sub&gt;7 = 46&lt;sub&gt;''n''&lt;/sub&gt;9.

Case 4.3: ''p'' begins with 6.

In this case we can write p = 6''y''4''z''9, where all digits of ''y'', ''z'' are 0, 3, 6, or 9. If 0 ◁ ''z'', then 409 ◁ ''p''. If 3 ◁ ''z'', then 43 ◁ ''p''. If 6 ◁ ''z'', then '''6469''' ◁ ''p''. If 9 ◁ ''z'', then 499 ◁ ''p''. Hence we may assume ''z'' is empty.

If 3 ◁ ''y'', then 349 ◁ ''p''. If 9 ◁ ''y'', then '''6949''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 6.

If 06 ◁ ''y'', then '''60649''' ◁ ''p''. Hence we may assume ''y'' ∈ {6}{0}.

If 666 ◁ ''y'', then '''666649''' ◁ ''p''. If 00000 ◁ ''y'', then '''60000049''' ◁ ''p''. Hence we may assume ''y'' ∈ {''𝜆'', 0, 00, 000, 0000, 6, 60, 600, 6000, 60000, 66, 660, 6600, 66000, 660000}, and thus ''p'' ∈ {649, 6049, 60049, 600049, 6000049, 6649, 66049, 660049, 6600049, 66000049, 66649, 666049, 6660049, 66600049, 666000049}, and of these numbers only '''66000049''' and '''66600049''' are primes.

Case 4.4: ''p'' begins with 9.

In this case we can write p = 9''y''4''z''9, where all digits of ''y'', ''z'' are 0, 3, 6, or 9. If 0 ◁ ''y'', then '''9049''' ◁ ''p''. If 3 ◁ ''y'', then 349 ◁ ''p''. If 6 ◁ ''y'', then '''9649''' ◁ ''p''. If 9 ◁ ''y'', then '''9949''' ◁ ''p''. Hence we may assume ''y'' is empty.

If 0 ◁ ''z'', then 409 ◁ ''p''. If 3 ◁ ''z'', then 43 ◁ ''p''. If 9 ◁ ''z'', then 499 ◁ ''p''. Hence we may assume ''z'' ∈ {6}, and thus ''p'' ∈ 94{6}9, and the smallest prime ''p'' ∈ 94{6}9 is 946669.

[[Category:Number theory]]</text>
      <sha1>ejvtrhzt8al9tpa7pl9mbplamrsalr0</sha1>
    </revision>
    <revision>
      <id>2809766</id>
      <parentid>2809765</parentid>
      <timestamp>2026-05-16T22:12:34Z</timestamp>
      <contributor>
        <username>雅典娜241</username>
        <id>3071373</id>
      </contributor>
      <origin>2809766</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="45408" sha1="qr6lwinwyrzn9x47x9hcog3cz0o216e" xml:space="preserve">'''Athena problem''' is an [[:w:List of unsolved problems in mathematics|unsolved problem]] in [[:w:Number theory|number theory]] and [[:w:Formal language theory|formal language theory]] and [[:w:Order theory|order theory]], this problem is named after the ancient Greek goddess [[:w:Athena|Athena]] (which is associated with [[:w:Wisdom|wisdom]]). Athena problem is: Give a [[:w:Natural number|natural number]] ''b'' &gt; 1, find the [[:w:Set (mathematics)|set]] of the [[:w:Minimal element|minimal element]]s of the set of the &quot;[[:w:Prime number|prime number]] [[:w:Greater than|&gt;]] ''b''&quot; [[:w:Numerical digit|digit]] [[:w:String (computer science)|string]]s in the [[:w:Positional numeral system|positional numeral system]] with [[:w:Radix|base]] ''b'' for the [[:w:Subsequence|subsequence]] [[:w:Partially ordered set|ordering]]. (A string ''x'' is a subsequence of another string ''y'', if ''x'' can be obtained from ''y'' by deleting zero or more of the [[:w:Character (computing)|character]]s in ''y''. For example, 514 is a subsequence of 352148, &quot;string&quot; is a subsequence of &quot;meistersinger&quot;. In contrast, 758 is not a subsequence of 378259, &quot;abc&quot; is not a subsequence of &quot;cbacacba&quot;, since the characters must be in the same order) (Unlike [[:w:Substring|substring]], subsequence is not required to occupy consecutive positions within the original sequences, e.g. the [[:w:Longest common subsequence|longest common subsequence problem]] is different from the [[:w:Longest common substring|longest common substring problem]])

Using [[:w:Formal language theory|formal language theory]] terminology, Athena problem is finding the [[:w:Set (mathematics)|set]] of the [[:w:Minimal element|minimal element]]s of the [[:w:Formal language|language]] of base-''b'' [[:w:Representation (mathematics)|representation]]s of the [[:w:Prime number|prime number]]s [[:w:Greater than|&gt;]] ''b'' (which is a set of [[:w:String (computer science)|string]]s of [[:w:Symbol|symbol]]s over the [[:w:Alphabet (formal languages)|alphabet]] ''Σ''&lt;sub&gt;''b''&lt;/sub&gt; := {0, 1, ..., ''b''−1}), under the subsequence ordering (i.e. the [[:w:Binary relation|binary relation]] &quot;is a subsequence of&quot;, which is a [[:w:Partially ordered set|partial ordering]]), for a given natural number ''b'' &gt; 1. (You can draw this ordering as [[:w:Hasse diagram|Hasse diagram]] to find all [[:w:Minimal element|minimal element]]s)

By [[:w:Higman's lemma|Higman's lemma]], there are no [[:w:Infinite set|infinite]] [[:w:Antichain|antichain]]s for the subsequence ordering (i.e. the subsequence ordering is always a [[:w:Well-quasi-ordering|well quasi order]]) (i.e. under the subsequence ordering (i.e. the [[:w:Binary relation|binary relation]] &quot;is a subsequence of&quot;, which is a [[:w:Partially ordered set|partial ordering]]), every set of pairwise incomparable (i.e. not [[:w:Comparability|comparable]]) strings is finite), thus there must be only finitely many such minimal elements. In other words, the set of such minimal elements must be a [[:w:Finite set|finite set]], e.g. in [[:w:Decimal|decimal]] (base ''b'' = 10), this set has exactly 77 [[:w:Element of a set|element]]s: {11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 227, 251, 257, 277, 281, 349, 409, 449, 499, 521, 557, 577, 587, 727, 757, 787, 821, 827, 857, 877, 881, 887, 991, 2087, 2221, 5051, 5081, 5501, 5581, 5801, 5851, 6469, 6949, 8501, 9001, 9049, 9221, 9551, 9649, 9851, 9949, 20021, 20201, 50207, 60649, 80051, 666649, 946669, 5200007, 22000001, 60000049, 66000049, 66600049, 80555551, 555555555551, 5000000000000000000000000000027}.

For bases 2 ≤ ''b'' ≤ 36, Athena problem is fully solved in bases ''b'' = 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 18, 20, 24, and also solved in bases ''b'' = 11, 13, 16, 22, 30 if [[:w:Probable prime|probable prime]]s are allowed. For the unsolved bases ''b'' = 17, 19, 21, 23, 25, 26, 27, 28, 29, 31, 32, 34, 35, 36, Athena problem is solved (if probable primes are allowed) except 771 [[:w:Indexed family|families]] of the form ''x''{''y''}''z'' (where ''x'' and ''z'' are strings (may be [[:w:Empty string|empty]]) of digits in base ''b'', ''y'' is a digit in base ''b''), all of these 771 families contain no primes or probable primes with length ≤ 100000.

== Results ==

These are the results of the Athena problem in bases 2 ≤ ''b'' ≤ 36 (we stop at base 36 since this base is the maximum base for which it is possible to write the numbers with the [[:w:Symbol|symbol]]s 0, 1, 2, ..., 9 and A, B, C, ..., Z (i.e. the 10 [[:w:Arabic numerals|Arabic numerals]] and the 26 [[:w:Latin script|Latin letters]]): (some large primes are only probable primes, i.e. not definitely primes, since they are too large to be [[:w:Elliptic curve primality|ECPP proved]] and [[:w:Pocklington primality test#Extensions and variants|neither ''N''−1 nor ''N''+1 can be ≥ 1/3 factored]], all of them pass the [[:w:Baillie–PSW primality test|Baillie–PSW primality test]] and the [[:w:Strong pseudoprime|strong primality test]] (i.e. the [[:w:Miller–Rabin primality test|Miller–Rabin primality test]]) with all prime bases ''p'' ≤ 61, however, all primes &lt; 10&lt;sup&gt;25000&lt;/sup&gt; for bases ''b'' = 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 18, 20, 22, 24, 26, 28, 30, 36 are definitely primes, most of them &gt; 10&lt;sup&gt;299&lt;/sup&gt; are proven primes with [[:w:Elliptic curve primality|ECPP proving]], others &gt; 10&lt;sup&gt;299&lt;/sup&gt; are proven primes with [[:w:Pocklington primality test#Extensions and variants|''N''−1 or ''N''+1 proving]])

To solve the Athena problem for a given base ''b'', we must [[:w:Computing|compute]] the element up to families of the form ''x''{''y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''y'' is a digit in base ''b'') (we call such families ''linear families''), and find the smallest prime &gt; ''b'' in all such families.

Shrinking the family ''x''{''Y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''Y'' is a set of digits in base ''b'')

* If ''y'' ∈ ''Y'' and the string ''xyyz'' represents a prime &gt; ''b'' in base ''b'' (in this case, add this prime to the list) or has a subsequence which represents a prime &gt; ''b'' in base ''b'', then ''x''{''Y''}''z'' can be replaced with ''x''{''Y'' \ ''y''}''z'' ∪ ''x''{''Y'' \ ''y''}''y''{''Y'' \ ''y''}''z''.
* If ''y''&lt;sub&gt;1&lt;/sub&gt; ∈ ''Y'' and ''y''&lt;sub&gt;2&lt;/sub&gt; ∈ ''Y'' and ''y''&lt;sub&gt;1&lt;/sub&gt; ≠ ''y''&lt;sub&gt;2&lt;/sub&gt; and the string ''xy''&lt;sub&gt;1&lt;/sub&gt;''y''&lt;sub&gt;2&lt;/sub&gt;''z'' represents a prime &gt; ''b'' in base ''b'' (in this case, add this prime to the list) or has a subsequence which represents a prime &gt; ''b'' in base ''b'', then ''x''{''Y''}''z'' can be replaced with ''x''{''Y'' \ ''y''&lt;sub&gt;1&lt;/sub&gt;}{''Y'' \ ''y''&lt;sub&gt;2&lt;/sub&gt;}''z''.
* If ''y''&lt;sub&gt;1&lt;/sub&gt; ∈ ''Y'' and ''y''&lt;sub&gt;2&lt;/sub&gt; ∈ ''Y'' and ''y''&lt;sub&gt;1&lt;/sub&gt; ≠ ''y''&lt;sub&gt;2&lt;/sub&gt; and both the strings ''xy''&lt;sub&gt;1&lt;/sub&gt;''y''&lt;sub&gt;2&lt;/sub&gt;''z'' and ''xy''&lt;sub&gt;2&lt;/sub&gt;''y''&lt;sub&gt;1&lt;/sub&gt;''z'' represent a prime &gt; ''b'' in base ''b'' (in this case, add this prime to the list) or have a subsequence which represents a prime &gt; ''b'' in base ''b'', then ''x''{''Y''}''z'' can be replaced with ''x''{''Y'' \ ''y''&lt;sub&gt;1&lt;/sub&gt;}''z'' ∪ ''x''{''Y'' \ ''y''&lt;sub&gt;2&lt;/sub&gt;}''z''.

e.g. in decimal (base ''b'' = 10):

* 2221 is a prime &gt; 10, thus the family 2{0,2}1 splits into the two families 2{0}1 and 2{0}2{0}1.
* 227 is a prime &gt; 10, and it is a subsequence of 5227, thus the family 5{0,2}7 splits into the two families 5{0}7 and 5{0}2{0}7.
* 449 is a prime &gt; 10, and it is a subsequence of 6449, thus the family 6{0,3,4,6,9}9 splits into the two families 6{0,3,6,9}9 and 6{0,3,6,9}4{0,3,6,9}9.
* Both 5051 and 5501 are primes &gt; 10, thus the family 5{0,5}1 splits into the two families 5{0}1 and 5{5}1 = {5}1.
* 8501 is a prime &gt; 10, thus the family 8{0,5}1 splits into the family 8{0}{5}1.
* 887 is a prime &gt; 10, and it is a subsequence of 2887, also 2087 is a prime &gt; 10, thus the family 2{0,8}7 splits into the two families 2{0}7 and 28{0}7.
* 349 and 449 are primes &gt; 10, and they are subsequences of 9349 and 9449, respectively, also 9049, 9649, 9949 are primes &gt; 10, thus the family 9{0,3,4,6,9}9 splits into the two families 9{0,3,6,9}9 and 94{0,3,6,9}9.
* 251, 281, 521, 821, 881 are primes &gt; 10, and they are subsequences of 9251, 9281, 9521, 9821, 9881, respectively, also 9001, 9221, 9551, 9851 are primes &gt; 10, thus the family 9{0,2,5,8}1 splits into the numbers {91, 901, 921, 951, 981, 9021, 9051, 9081, 9201, 9501, 9581, 9801, 90581, 95081, 95801}.

If the methods we have discussed cannot be used to rule out or shrink ''x''{''Y''}''z'' where ''Y'' = {''y''&lt;sub&gt;1&lt;/sub&gt;, ''y''&lt;sub&gt;2&lt;/sub&gt;, ..., ''y''&lt;sub&gt;''n''&lt;/sub&gt;}, then we can replace ''x''{''Y''}''z'' by ''xy''&lt;sub&gt;1&lt;/sub&gt;{''Y''}''z'' ∪ ''xy''&lt;sub&gt;2&lt;/sub&gt;{''Y''}''z'' ∪ ... ∪ ''xy''&lt;sub&gt;''n''&lt;/sub&gt;{''Y''}''z'' and re-run the methods on this new [[:w:Formal language|language]].

If all remain families are linear families (i.e. of the form ''x''{''y''}''z'', where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''y'' is a digit in base ''b''), then we search the smallest (probable) primes in these families and add these primes to the list.

e.g. in decimal (base ''b'' = 10):

* The smallest prime in the family 5{0}27 is 5000000000000000000000000000027.
* The smallest prime in the family {5}1 is 555555555551.
* The smallest prime in the family 8{5}1 is 8555555555555555555551, but 8555555555555555555551 is not a minimal element since 555555555551 is a subsequence of 8555555555555555555551.

There is no guarantee that the techniques discussed will ever terminate, but in practice they often do. They are able to determine the set of the minimal elements in base ''b'' for 2 ≤ ''b'' ≤ 16 and ''b'' = 18, 20, 22, 24, 30. The bases ''b'' = 17, 19, 21, 23, 25 ≤ ''b'' ≤ 29, 31 ≤ ''b'' ≤ 36 are solved with the exception of 771 families of the form ''x''{''y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''y'' is a digit in base ''b'').

The following is a &quot;[[:w:Semi-algorithm|semi-algorithm]]&quot; that is guaranteed to solve the Athena problem for a given base ''b'', but it is not so easy to implement:

# ''M'' = ''[[:w:Empty string|∅]]''
# while (''L'' ≠ ''∅'') do
# choose ''x'', a shortest string in ''L''
# ''M'' := ''M'' ∪ {''x''}
# ''L'' := ''L'' − ''sup''({''x''})

In practice, for arbitrary ''L'', we cannot feasibly carry out step 5. Instead, we work with ''L''&amp;#39;, some regular overapproximation to ''L'', until we can show ''L''&amp;#39; = ''∅'' (which implies ''L'' = ''∅''). In practice, ''L''&amp;#39; is usually chosen to be a finite [[:w:Union (set theory)|union]] of sets of the form ''L''&lt;sub&gt;1&lt;/sub&gt;{''L''&lt;sub&gt;2&lt;/sub&gt;}''L''&lt;sub&gt;3&lt;/sub&gt;, where each of ''L''&lt;sub&gt;1&lt;/sub&gt;, ''L''&lt;sub&gt;2&lt;/sub&gt;, ''L''&lt;sub&gt;3&lt;/sub&gt; is finite. In the case we consider in this project, we then have to determine whether such a family contains a prime or not.

Thus, Athena problem in bases ''b'' around 500 may be [[:w:NP-complete|NP-complete]] or [[:w:NP-hard|NP-hard]], or an [[:w:Undecidable problem|undecidable problem]], or an example of [[:w:Gödel's incompleteness theorems|Gödel's incompleteness theorems]] (like the [[:w:Continuum hypothesis|continuum hypothesis]] and the [[:w:Halting problem|halting problem]]).

To solve the Athena problem, we need to determine whether a given family contains a prime. In practice, if family ''x''{''Y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''Y'' is a set of digits in base ''b'') could not be ruled out as only containing composites and ''Y'' contains two or more digits, then a relatively small prime &gt; ''b'' could always be found in this family. Intuitively, this is because there are a large number of small strings in such a family, and at least one is likely to be prime (e.g. there are 2&lt;sup&gt;''n''−2&lt;/sup&gt; strings of length ''n'' in the family 1{3,7}9, and there are over a thousand strings of length 12 in the family 1{3,7}9, thus it is very impossible that these numbers are all composite). In the case ''Y'' contains only one digit, this family is of the form ''x''{''y''}''z'', and there is only a single string of each length &gt; (the length of ''x'' + the length of ''z''), and it is not known if the following [[:w:Decision problem|decision problem]] is recursively solvable (just like [[:w:Sierpiński number|Sierpiński problem]] and [[:w:Riesel number|Riesel problem]], Sierpiński problem and Riesel problem can be generalized to other bases ''b'', in fact, Athena problem in base ''b'' covers the Sierpiński problem in base ''b'' and the Riesel problem in base ''b'' with ''k'' &lt; ''b'', i.e. finding the smallest prime of the form ''k''×''b''&lt;sup&gt;''n''&lt;/sup&gt;+1 and ''k''×''b''&lt;sup&gt;''n''&lt;/sup&gt;−1 (or prove such prime does not exist) with ''k'' &lt; ''b'', since the smallest prime of the form ''k''×''b''&lt;sup&gt;''n''&lt;/sup&gt;+1 and ''k''×''b''&lt;sup&gt;''n''&lt;/sup&gt;−1 (if exists) must be a minimal element in base ''b''):

Problem: Given strings ''x'', ''z'' (may be empty), a digit ''y'', and a base ''b'' (''x'' does not [[:w:Leading zero|start with the digit 0]], ''z'' ends with a digit which [[:w:Coprime integers|coprime]] to ''b'', ''y'' is not 0 if ''x'' is empty, ''y'' is coprime to ''b'' if ''z'' is empty), does there exist a prime number whose base-''b'' expansion is of the form ''xy''&lt;sub&gt;''n''&lt;/sub&gt;''z'' for some ''n'' ≥ 0?

Some families can be ruled out to contain no prime &gt; ''b'' by [[:w:Covering set|covering congruence]], [[:w:Factorization of polynomials|algebraic factorization]] (e.g. [[:w:Difference of two squares|difference of two squares]], [[:w:Sum of two cubes|sum of two cubes]], [[:w:Sophie Germain's identity|Sophie Germain's identity of ''x''&lt;sup&gt;4&lt;/sup&gt;+4×''y''&lt;sup&gt;4&lt;/sup&gt;]]), or combine of them, e.g.

* The base 9 family 2{7}: Always divisible by 2 or 5
* The base 16 family {8}F: Always divisible by 3, 7, or 13
* The base 21 family {7}D: Always divisible by 2, 13, or 17
* The base 23 family {D}GA: Always divisible by 2, 5, 7, 37, or 79
* The base 9 family 3{8}: Can be written as 4×9&lt;sup&gt;''n''&lt;/sup&gt;−1 and can be factored as (2×3&lt;sup&gt;''n''&lt;/sup&gt;−1) × (2×3&lt;sup&gt;''n''&lt;/sup&gt;+1)
* The base 8 family 1{0}1: Can be written as 8&lt;sup&gt;''n''&lt;/sup&gt;+1 and can be factored as (2&lt;sup&gt;''n''&lt;/sup&gt;+1) × (4&lt;sup&gt;''n''&lt;/sup&gt;−2&lt;sup&gt;''n''&lt;/sup&gt;+1)
* The base 16 family {4}1: Can be written as (4×16&lt;sup&gt;''n''&lt;/sup&gt;−49)/15 and can be factored as (2×3&lt;sup&gt;''n''&lt;/sup&gt;−7) × (2×3&lt;sup&gt;''n''&lt;/sup&gt;+7) / 15
* The base 16 family {C}D: Can be written as (4×16&lt;sup&gt;''n''&lt;/sup&gt;+1)/5 and can be factored as (2×4&lt;sup&gt;''n''&lt;/sup&gt;−2×2&lt;sup&gt;''n''&lt;/sup&gt;+1) × (2×4&lt;sup&gt;''n''&lt;/sup&gt;+2×2&lt;sup&gt;''n''&lt;/sup&gt;+1) / 5
* The base 14 family 8{D}: Can be written as 9×14&lt;sup&gt;''n''&lt;/sup&gt;−1, it is divisible by 5 if ''n'' is odd and can be factored as (3×14&lt;sup&gt;''n''/2&lt;/sup&gt;−1) × (3×14&lt;sup&gt;''n''/2&lt;/sup&gt;+1) if ''n'' is even
* The base 12 family {B}9B: Can be written as 12&lt;sup&gt;''n''&lt;/sup&gt;−25, it is divisible by 13 if ''n'' is odd and can be factored as (12&lt;sup&gt;''n''/2&lt;/sup&gt;−5) × (12&lt;sup&gt;''n''/2&lt;/sup&gt;+5) if ''n'' is even
* The base 17 family 1{9}: Can be written as (25×17&lt;sup&gt;''n''&lt;/sup&gt;−9)/16, it is divisible by 2 if ''n'' is odd and can be factored as (5×17&lt;sup&gt;''n''/2&lt;/sup&gt;−3) × (5×17&lt;sup&gt;''n''/2&lt;/sup&gt;+3) / 16 if ''n'' is even
* The base 19 family 1{6}: Can be written as (4×19&lt;sup&gt;''n''&lt;/sup&gt;−1)/3, it is divisible by 5 if ''n'' is odd and can be factored as (2×19&lt;sup&gt;''n''/2&lt;/sup&gt;−1) × (2×19&lt;sup&gt;''n''/2&lt;/sup&gt;+1) / 3 if ''n'' is even

By the [[:w:Prime number theorem|prime number theorem]], the [[:w:Probability|chance]] that a [[:w:Random number|random]] ''n''-digit base ''b'' number is prime is [[:w:Asymptotic analysis|approximately]] 1/''n'' (more accurately, the chance is approximately 1/(''n''×''ln''(''b'')), where ''ln'' is the [[:w:Natural logarithm|natural logarithm]]). If one conjectures the numbers ''x''{''y''}''z'' behave similarly (i.e. the numbers ''x''{''y''}''z'' is a [[:w:Pseudorandomness|pseudorandom sequence]]) you would expect [[:w:Harmonic_series (mathematics)|1/1 + 1/2 + 1/3 + 1/4 + ... = ∞]] primes of the form ''x''{''y''}''z'' (of course, this does not always happen, since some ''x''{''y''}''z'' families can be ruled out to contain no prime &gt; ''b'' (by covering congruence, algebraic factorization, or combine of them), but it is at least a reasonable conjecture in the absence of evidence to the contrary. Hence, the [[:w:Heuristic argument|heuristic argument]] suggests there are always infinitely many primes in family ''x''{''y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''y'' is a digit in base ''b'') if it cannot be ruled out to contain no prime or only contain finitely many primes, by covering congruence, algebraic factorization, or combine of them. However, some families ''x''{''y''}''z'' could not be proven to contain no primes &gt; ''b'' (by covering congruence, algebraic factorization, or combine of them) but no primes &gt; ''b'' could be found in the family, even after searching through numbers with over 100000 digits. In such a case, the only way to proceed is to [[:w:Primality test|test the primality]] of larger and larger numbers of such form and hope a prime is eventually discovered. e.g. the smallest (probable) prime in the family A{3}A in base ''b'' = 13 is A3&lt;sub&gt;592197&lt;/sub&gt;A, which written in decimal contains 659677 digits (it is only probable prime, i.e. not definitely prime).

All numbers are written in base ''b'', [[:w:Senary#Base 36 as senary compression|using A to Z to represent digit values 10 to 35]], &quot;{}&quot; means repeating, e.g. family 12{3}45 means the sequence {1245, 12345, 123345, 1233345, 12333345, 123333345, ...} (where the members are expressed as base ''b'' strings), subscripts are used to indicate repetitions of digits, e.g. 123&lt;sub&gt;4&lt;/sub&gt;567 means 123333567 (all subscripts are written in decimal).

Base 2: 1 prime (the largest of which has 2 digits): {11}

Base 3: 3 primes (the largest of which has 3 digits): {12, 21, 111}

Base 4: 5 primes (the largest of which has 3 digits): {11, 13, 23, 31, 221}

Base 5: 22 primes (the largest of which has 96 digits): {12, 21, 23, 32, 34, 43, 104, 111, 131, 133, 313, 401, 414, 3101, 10103, 14444, 30301, 33001, 33331, 44441, 300031, 100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000013}

Base 6: 11 primes (the largest of which has 5 digits): {11, 15, 21, 25, 31, 35, 45, 51, 4401, 4441, 40041}

Base 7: 71 primes (the largest of which has 17 digits): {14, 16, 23, 25, 32, 41, 43, 52, 56, 61, 65, 113, 115, 131, 133, 155, 212, 221, 304, 313, 335, 344, 346, 364, 445, 515, 533, 535, 544, 551, 553, 1022, 1051, 1112, 1202, 1211, 1222, 2111, 3031, 3055, 3334, 3503, 3505, 3545, 4504, 4555, 5011, 5455, 5545, 5554, 6034, 6634, 11111, 11201, 30011, 30101, 31001, 31111, 33001, 33311, 35555, 40054, 100121, 150001, 300053, 351101, 531101, 1100021, 33333301, 5100000001, 33333333333333331}

Base 8: 75 primes (the largest of which has 221 digits): {13, 15, 21, 23, 27, 35, 37, 45, 51, 53, 57, 65, 73, 75, 107, 111, 117, 141, 147, 161, 177, 225, 255, 301, 343, 361, 401, 407, 417, 431, 433, 463, 467, 471, 631, 643, 661, 667, 701, 711, 717, 747, 767, 3331, 3411, 4043, 4443, 4611, 5205, 6007, 6101, 6441, 6477, 6707, 6777, 7461, 7641, 47777, 60171, 60411, 60741, 444641, 500025, 505525, 3344441, 4444477, 5500525, 5550525, 55555025, 444444441, 744444441, 77774444441, 7777777777771, 555555555555525, 44444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444447}

Base 9: 151 primes (the largest of which has 1161 digits): {12, 14, 18, 21, 25, 32, 34, 41, 45, 47, 52, 58, 65, 67, 74, 78, 81, 87, 117, 131, 135, 151, 155, 175, 177, 238, 272, 308, 315, 331, 337, 355, 371, 375, 377, 438, 504, 515, 517, 531, 537, 557, 564, 601, 638, 661, 702, 711, 722, 735, 737, 751, 755, 757, 771, 805, 838, 1011, 1015, 1101, 1701, 2027, 2207, 3017, 3057, 3101, 3501, 3561, 3611, 3688, 3868, 5035, 5051, 5071, 5101, 5501, 5554, 5705, 5707, 7017, 7075, 7105, 7301, 8535, 8544, 8555, 8854, 20777, 22227, 22777, 30161, 33388, 50161, 50611, 53335, 55111, 55535, 55551, 57061, 57775, 70631, 71007, 77207, 100037, 100071, 100761, 105007, 270707, 301111, 305111, 333035, 333385, 333835, 338885, 350007, 500075, 530005, 555611, 631111, 720707, 2770007, 3030335, 7776662, 30300005, 30333335, 38333335, 51116111, 70000361, 300030005, 300033305, 351111111, 1300000007, 5161111111, 8333333335, 300000000035, 311111111161, 544444444444, 2000000000007, 5700000000001, 7270000000007, 88888888833335, 100000000000507, 5111111111111161, 7277777777777777707, 8888888888888888888335, 30000000000000000000051, 1000000000000000000000000057, 56111111111111111111111111111111111111, 7666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666662, 27777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777707, 300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000011}

Base 10: 77 primes (the largest of which has 31 digits): {11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 227, 251, 257, 277, 281, 349, 409, 449, 499, 521, 557, 577, 587, 727, 757, 787, 821, 827, 857, 877, 881, 887, 991, 2087, 2221, 5051, 5081, 5501, 5581, 5801, 5851, 6469, 6949, 8501, 9001, 9049, 9221, 9551, 9649, 9851, 9949, 20021, 20201, 50207, 60649, 80051, 666649, 946669, 5200007, 22000001, 60000049, 66000049, 66600049, 80555551, 555555555551, 5000000000000000000000000000027}

Base 11: 1068 primes (including 1 unproven probable prime: 57&lt;sub&gt;62668&lt;/sub&gt;), the largest of which has 62669 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel11 Data of Athena problem base 11]

Base 12: 106 primes (the largest of which has 42 digits): {11, 15, 17, 1B, 25, 27, 31, 35, 37, 3B, 45, 4B, 51, 57, 5B, 61, 67, 6B, 75, 81, 85, 87, 8B, 91, 95, A7, AB, B5, B7, 221, 241, 2A1, 2B1, 2BB, 401, 421, 447, 471, 497, 565, 655, 665, 701, 70B, 721, 747, 771, 77B, 797, 7A1, 7BB, 907, 90B, 9BB, A41, B21, B2B, 2001, 200B, 202B, 222B, 229B, 292B, 299B, 4441, 4707, 4777, 6A05, 6AA5, 729B, 7441, 7B41, 929B, 9777, 992B, 9947, 997B, 9997, A0A1, A201, A605, A6A5, AA65, B001, B0B1, BB01, BB41, 600A5, 7999B, 9999B, AAAA1, B04A1, B0B9B, BAA01, BAAA1, BB09B, BBBB1, 44AAA1, A00065, BBBAA1, AAA0001, B00099B, AA000001, BBBBBB99B, B0000000000000000000000000009B, 400000000000000000000000000000000000000077}

Base 13: 3197 primes (including 4 unproven probable primes: C5&lt;sub&gt;23755&lt;/sub&gt;C, 80&lt;sub&gt;32017&lt;/sub&gt;111, 95&lt;sub&gt;197420&lt;/sub&gt;, A3&lt;sub&gt;592197&lt;/sub&gt;A), the largest of which has 592199 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel13 Data of Athena problem base 13]

Base 14: 650 primes, the largest of which has 19699 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel14 Data of Athena problem base 14]

Base 15: 1284 primes, the largest of which has 157 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel15 Data of Athena problem base 15]

Base 16: 2347 primes (including 3 unproven probable primes: DB&lt;sub&gt;32234&lt;/sub&gt;, 4&lt;sub&gt;72785&lt;/sub&gt;DD, 3&lt;sub&gt;116137&lt;/sub&gt;AF), the largest of which has 116139 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel16 Data of Athena problem base 16]

Base 17: 10415 known primes (including many unproven probable primes) and 12 unsolved families (1{7}, 1F{0}7, 4{7}A, 70F{0}D, 8{B}9, 9{5}9, A{D}F, B{0}B3, {B}E9, {B}EE, F1{9}, FD0{D}, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel17 Data of Athena problem base 17] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left17 Data of unsolved families for base 17]

Base 18: 549 primes, the largest of which has 6271 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel18 Data of Athena problem base 18]

Base 19: 31417 known primes (including many unproven probable primes) and 17 unsolved families (4B5{0}H, {5}3, 5{H}05, 5{H}0H, 5{H}5, 66{B}, 71{0}177, 7AF{0}H, 97{0}3, C{H}C, EE1{6}, F{7}5, F{B}G, F{D}F, H0F{0}7A, HB{0}5B5, II{D}, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel19 Data of Athena problem base 19] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left19 Data of unsolved families for base 19]

Base 20: 3314 primes, the largest of which has 6271 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel20 Data of Athena problem base 20]

Base 21: 13386 known primes (including many unproven probable primes) and 8 unsolved families (5{0}DJ, {9}D, B3{0}EB, B{H}6H, C{F}0K, {F}35, G{0}FK, H{0}7771, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel21 Data of Athena problem base 21] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left21 Data of unsolved families for base 21]

Base 22: 8003 primes (including 1 unproven probable prime: BK&lt;sub&gt;22001&lt;/sub&gt;5), the largest of which has 22003 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel22 Data of Athena problem base 22]

Base 23: 65178 known primes (including many unproven probable primes) and 87 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel23 Data of Athena problem base 23] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left23 Data of unsolved families for base 23]

Base 24: 3409 primes, the largest of which has 8134 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel24 Data of Athena problem base 24]

Base 25: 133639 known primes (including many unproven probable primes) and 85 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel25 Data of Athena problem base 25] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left25 Data of unsolved families for base 25]

Base 26: 25256 known primes (including 7 unproven probable primes: 5&lt;sub&gt;19391&lt;/sub&gt;6F, 7&lt;sub&gt;20279&lt;/sub&gt;OL, LD0&lt;sub&gt;20975&lt;/sub&gt;7, 6K&lt;sub&gt;23300&lt;/sub&gt;5, J0&lt;sub&gt;44303&lt;/sub&gt;KCB, M0&lt;sub&gt;61186&lt;/sub&gt;2BB, 85M&lt;sub&gt;197060&lt;/sub&gt;B) and 3 unsolved families ({A}6F, {H}MH, {I}GL, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel26 Data of Athena problem base 26]

Base 27: 102852 known primes (including many unproven probable primes) and 44 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel27 Data of Athena problem base 27] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left27 Data of unsolved families for base 27]

Base 28: 25528 known primes (including 3 unproven probable primes: N6&lt;sub&gt;24051&lt;/sub&gt;LR, 5OA&lt;sub&gt;31238&lt;/sub&gt;F, O4O&lt;sub&gt;94535&lt;/sub&gt;9) and 1 unsolved family (O{A}F, no primes or probable primes with length ≤ 709070, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel28 Data of Athena problem base 28]

Base 29: 355242 known primes (including many unproven probable primes) and 125 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel29 Data of Athena problem base 29] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left29 Data of unsolved families for base 29]

Base 30: 2619 primes (including 1 unproven probable prime: I0&lt;sub&gt;24608&lt;/sub&gt;D), the largest of which has 34206 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel30 Data of Athena problem base 30]

Base 31: 569323 known primes (including many unproven probable primes) and 77 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel31 Data of Athena problem base 31] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left31 Data of unsolved families for base 31]

Base 32: 168882 known primes (including many unproven probable primes) and 120 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel32 Data of Athena problem base 32] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left32 Data of unsolved families for base 32]

Base 33: 280012 known primes (including many unproven probable primes) and 81 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel33 Data of Athena problem base 33] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left33 Data of unsolved families for base 33]

Base 34: 184785 known primes (including many unproven probable primes) and 47 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel34 Data of Athena problem base 34] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left34 Data of unsolved families for base 34]

Base 35: 720002 known primes (including many unproven probable primes) and 60 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel35 Data of Athena problem base 35] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left35 Data of unsolved families for base 35]

Base 36: 35286 known primes (including 3 unproven probable primes: 7K&lt;sub&gt;26567&lt;/sub&gt;Z, S0&lt;sub&gt;75007&lt;/sub&gt;8H, P&lt;sub&gt;81993&lt;/sub&gt;SZ) and 4 unsolved families (B{0}EUV, HM{0}N, N{0}YYN, O{L}Z, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel36 Data of Athena problem base 36]

== The fully proof of Athena problem in decimal (base ''b'' = 10) ==

'''Bold''' for the minimal elements, ''x'' ◁ ''y'' means ''x'' is a subsequence of ''y''.

Assume ''p'' is a prime &gt; 10, and the last digit of ''p'' must lie in {1,3,7,9}.

Case 1: ''p'' ends with 1.

In this case we can write ''p'' = ''x''1. If ''x'' contains 1, 3, 4, 6, or 7, then (respectively) '''11''' ◁ ''p'', '''31''' ◁ ''p'', '''41''' ◁ ''p'', '''61''' ◁ ''p'', or '''71''' ◁ ''p''. Hence we may assume all digits of ''x'' are 0, 2, 5, 8, or 9.

Case 1.1: ''p'' begins with 2.

In this case we can write ''p'' = 2''y''1. If 5 ◁ ''y'', then '''251''' ◁ ''p''. If 8 ◁ ''y'', then '''281''' ◁ ''p''. If 9 ◁ ''y'', then 29 ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 2.

If 22 ◁ ''y'', then '''2221''' ◁ ''p''. Hence we may assume ''y'' contains zero or one 2's.

If ''y'' contains no 2's, then ''p'' ∈ 2{0}1. But then, since the sum of the digits of ''p'' is 3, ''p'' is divisible by 3, so ''p'' cannot be prime.

If ''y'' contains exactly one 2, then we can write ''p'' = 2''z''2''w''1, where ''z'',''w'' ∈ {0}. If 0 ◁ ''z'' and 0 ◁ ''w'', then '''20201''' ◁ ''p''. Hence we may assume either ''z'' or ''w'' is empty.

If ''z'' is empty, then ''p'' ∈ 22{0}1, and the smallest prime ''p'' ∈ 22{0}1 is '''22000001'''.

If ''w'' is empty, then ''p'' ∈ 2{0}21, and the smallest prime ''p'' ∈ 2{0}21 is '''20021'''.

Case 1.2: ''p'' begins with 5.

In this case we can write ''p'' = 5''y''1. If 2 ◁ ''y'', then '''521''' ◁ ''p''. If 9 ◁ ''y'', then 59 ◁ ''p''. Hence we may assume all digits of ''y'' are 0, 5, or 8.

If 05 ◁ ''y'', then '''5051''' ◁ ''p''. If 08 ◁ ''y'', then '''5081''' ◁ ''p''. If 50 ◁ ''y'', then '''5501''' ◁ ''p''. If 58 ◁ ''y'', then '''5581''' ◁ ''p''. If 80 ◁ ''y'', then '''5801''' ◁ ''p''. If 85 ◁ ''y'', then '''5851''' ◁ ''p''. Hence we may assume ''y'' ∈ {0} ∪ {5} ∪ {8}.

If ''y'' ∈ {0}, then ''p'' ∈ 5{0}1. But then, since the sum of the digits of ''p'' is 6, ''p'' is divisible by 3, so ''p'' cannot be prime.

If ''y'' ∈ {5}, then ''p'' ∈ 5{5}1, and the smallest prime ''p'' ∈ 5{5}1 is '''555555555551'''.

If ''y'' ∈ {8}, since if 88 ◁ ''y'', then 881 ◁ ''p'', hence we may assume ''y'' ∈ {''𝜆'',8}, and thus ''p'' ∈ {51,581}, but 51 and 581 are both composite.

Case 1.3: ''p'' begins with 8.

In this case we can write p = 8''y''1. If 2 ◁ ''y'', then '''821''' ◁ ''p''. If 8 ◁ ''y'', then '''881''' ◁ ''p''. If 9 ◁ ''y'', then 89 ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 5.

If 50 ◁ ''y'', then '''8501''' ◁ ''p''. Hence we may assume y ∈ {0}{5}.

If 005 ◁ ''y'', then '''80051''' ◁ p. Hence we may assume y ∈ {0} ∪ {5} ∪ 0{5}.

If y ∈ {0}, then ''p'' ∈ 8{0}1. But then, since the sum of the digits of ''p'' is 9, ''p'' is divisible by 3, so ''p'' cannot be prime.

If y ∈ {5}, since if 55555555555 ◁ ''y'', then 555555555551 ◁ ''p'', hence we may assume ''y'' ∈ {''𝜆'', 5, 55, 555, 5555, 55555, 555555, 5555555, 55555555, 555555555, 5555555555}, and thus ''p'' ∈ {81, 851, 8551, 85551, 855551, 8555551, 85555551, 855555551, 8555555551, 85555555551, 855555555551}, but all of these numbers are composite.

If y ∈ 0{5}, since if 55555555555 ◁ ''y'', then 555555555551 ◁ ''p'', hence we may assume ''y'' ∈ {0, 05, 055, 0555, 05555, 055555, 0555555, 05555555, 055555555, 0555555555, 05555555555}, and thus ''p'' ∈ {801, 8051, 80551, 805551, 8055551, 80555551, 805555551, 8055555551, 80555555551, 805555555551, 8055555555551}, and of these numbers only 80555551 and 8055555551 are primes, but 80555551 ◁ 8055555551, thus only '''80555551''' is a minimal element.

Case 1.4: ''p'' begins with 9.

In this case we can write p = 9''y''1. If 9 ◁ ''y'', then '''991''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0, 2, 5, or 8.

If 00 ◁ ''y'', then '''9001''' ◁ ''p''. If 22 ◁ ''y'', then '''9221''' ◁ ''p''. If 55 ◁ ''y'', then '''9551''' ◁ ''p''. If 88 ◁ ''y'', then 881 ◁ ''p''. Hence we may assume ''y'' contains at most one 0, at most one 2, at most one 5, and at most one 8.

If ''y'' only contains at most one 0 and does not contain any of {2,5,8}, then ''y'' ∈ {''𝜆'',0}, and thus ''p'' ∈ {91,901}, but 91 and 901 are both composite. If ''y'' only contains at most one 0 and only one of {2,5,8}, then the sum of the digits of ''p'' is divisible by 3, ''p'' is divisible by 3, so ''p'' cannot be prime. Hence we may assume ''y'' contains at least two of {2,5,8}.

If 25 ◁ ''y'', then 251 ◁ ''p''. If 28 ◁ ''y'', then 281 ◁ ''p''. If 52 ◁ ''y'', then 521 ◁ ''p''. If 82 ◁ ''y'', then 821 ◁ ''p''. Hence we may assume ''y'' contains no 2's (since if ''y'' contains 2, then ''y'' cannot contain either 5's or 8's, which is a contradiction).

If 85 ◁ ''y'', then '''9851''' ◁ ''p''. Hence we may assume ''y'' ∈ {58,580,508,058}, and thus ''p'' ∈ {9581,95801,95081,90581}, and of these numbers only 95801 is prime, but 95801 is not a minimal element since 5801 ◁ 95801.

Case 2: ''p'' ends with 3.

In this case we can write p = ''x''3. If ''x'' contains 1, 2, 4, 5, 7, or 8, then (respectively) '''13''' ◁ ''p'', '''23''' ◁ ''p'', '''43''' ◁ ''p'', '''53''' ◁ ''p'', '''73''' ◁ ''p'', or '''83''' ◁ ''p''. Hence we may assume all digits of ''x'' are 0, 3, 6, or 9, and thus all digits of ''p'' are 0, 3, 6, or 9. But then, since the digits of ''p'' all have a common factor 3, ''p'' is divisible by 3, so ''p'' cannot be prime.

Case 3: ''p'' ends with 7.

In this case we can write ''p'' = ''x''7. If ''x'' contains 1, 3, 4, 6, or 9, then (respectively) '''17''' ◁ ''p'', '''37''' ◁ ''p'', '''47''' ◁ ''p'', '''67''' ◁ ''p'', or '''97''' ◁ ''p''. Hence we may assume all digits of ''x'' are 0, 2, 5, 7, or 8.

Case 3.1: ''p'' begins with 2.

In this case we can write ''p'' = 2''y''7. If 2 ◁ ''y'', then '''227''' ◁ ''p''. If 5 ◁ ''y'', then '''257''' ◁ ''p''. If 7 ◁ ''y'', then '''277''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 8.

If 08 ◁ ''y'', then '''2087''' ◁ ''p''. If 88 ◁ ''y'', then 887 ◁ ''p''. Hence we may assume ''y'' ∈ {0} ∪ 8{0}.

If ''y'' ∈ {0}, then ''p'' ∈ 2{0}7. But then, since the sum of the digits of ''p'' is 9, ''p'' is divisible by 3, so ''p'' cannot be prime.

If y ∈ 8{0}, then ''p'' ∈ 28{0}7. But then ''p'' is divisible by 7, since for ''n'' ≥ 0 we have 7 × 40&lt;sub&gt;''n''&lt;/sub&gt;1 = 280&lt;sub&gt;''n''&lt;/sub&gt;7.

Case 3.2: ''p'' begins with 5.

In this case we can write ''p'' = 5''y''7. If 5 ◁ ''y'', then '''557''' ◁ ''p''. If 7 ◁ ''y'', then '''577''' ◁ ''p''. If 8 ◁ ''y'', then '''587''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 2.

If 22 ◁ ''y'', then 227 ◁ ''p''. Hence we may assume ''y'' contains zero or one 2's.

If ''y'' contains no 2's, then ''p'' ∈ 5{0}7. But then, since the sum of the digits of ''p'' is 12, ''p'' is divisible by 3, so ''p'' cannot be prime.

If ''y'' contains exactly one 2, then we can write ''p'' = 5''z''2''w''7, where ''z'',''w'' ∈ {0}. If 0 ◁ ''z'' and 0 ◁ ''w'', then '''50207''' ◁ ''p''. Hence we may assume either ''z'' or ''w'' is empty.

If ''z'' is empty, then ''p'' ∈ 52{0}7, and the smallest prime ''p'' ∈ 52{0}7 is '''5200007'''.

If ''w'' is empty, then ''p'' ∈ 5{0}27, and the smallest prime ''p'' ∈ 5{0}27 is '''5000000000000000000000000000027'''.

Case 3.3: ''p'' begins with 7.

In this case we can write ''p'' = 7''y''7. If 2 ◁ ''y'', then '''727''' ◁ ''p''. If 5 ◁ ''y'', then '''757''' ◁ ''p''. If 8 ◁ ''y'', then '''787''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 7, and thus all digits of ''p'' are 0 or 7. But then, since the digits of ''p'' all have a common factor 7, ''p'' is divisible by 7, so ''p'' cannot be prime.

Case 3.4: ''p'' begins with 8.

In this case we can write ''p'' = 8''y''7. If 2 ◁ ''y'', then '''827''' ◁ ''p''. If 5 ◁ ''y'', then '''857''' ◁ ''p''. If 7 ◁ ''y'', then '''877''' ◁ ''p''. If 8 ◁ ''y'', then '''887''' ◁ ''p''. Hence we may assume ''y'' ∈ {0}, and thus ''p'' ∈ 8{0}7. But then, since the sum of the digits of ''p'' is 15, ''p'' is divisible by 3, so ''p'' cannot be prime.

Case 4: ''p'' ends with 9.

In this case we can write ''p'' = ''x''9. If ''x'' contains 1, 2, 5, 7, or 8, then (respectively) '''19''' ◁ ''p'', '''29''' ◁ ''p'', '''59''' ◁ ''p'', '''79''' ◁ ''p'', or '''89''' ◁ ''p''. Hence we may assume all digits of ''x'' are 0, 3, 4, 6, or 9.

If 44 ◁ ''x'', then '''449''' ◁ ''p''. Hence we may assume ''x'' contains zero or one 4's.

If x contains no 4's, then all digits of ''x'' are 0, 3, 6, or 9, and thus all digits of ''p'' are 0, 3, 6, or 9. But then, since the digits of ''p'' all have a common factor 3, ''p'' is divisible by 3, so ''p'' cannot be prime. Hence we may assume that ''x'' contains exactly one 4.

Case 4.1: ''p'' begins with 3.

In this case we can write ''p'' = 3''y''4''z''9, where all digits of ''y'', ''z'' are 0, 3, 6, or 9. We must have '''349''' ◁ ''p''.

Case 4.2: ''p'' begins with 4.

In this case we can write ''p'' = 4''y''9, where all digits of ''y'' are 0, 3, 6, or 9. If 0 ◁ ''y'', then '''409''' ◁ ''p''. If 3 ◁ ''y'', then 43 ◁ ''p''. If 9 ◁ ''y'', then '''499''' ◁ ''p''. Hence we may assume ''y'' ∈ {6}, and thus ''p'' ∈ 4{6}9. But then ''p'' is divisible by 7, since for ''n'' ≥ 0 we have 7 × 6&lt;sub&gt;''n''&lt;/sub&gt;7 = 46&lt;sub&gt;''n''&lt;/sub&gt;9.

Case 4.3: ''p'' begins with 6.

In this case we can write p = 6''y''4''z''9, where all digits of ''y'', ''z'' are 0, 3, 6, or 9. If 0 ◁ ''z'', then 409 ◁ ''p''. If 3 ◁ ''z'', then 43 ◁ ''p''. If 6 ◁ ''z'', then '''6469''' ◁ ''p''. If 9 ◁ ''z'', then 499 ◁ ''p''. Hence we may assume ''z'' is empty.

If 3 ◁ ''y'', then 349 ◁ ''p''. If 9 ◁ ''y'', then '''6949''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 6.

If 06 ◁ ''y'', then '''60649''' ◁ ''p''. Hence we may assume ''y'' ∈ {6}{0}.

If 666 ◁ ''y'', then '''666649''' ◁ ''p''. If 00000 ◁ ''y'', then '''60000049''' ◁ ''p''. Hence we may assume ''y'' ∈ {''𝜆'', 0, 00, 000, 0000, 6, 60, 600, 6000, 60000, 66, 660, 6600, 66000, 660000}, and thus ''p'' ∈ {649, 6049, 60049, 600049, 6000049, 6649, 66049, 660049, 6600049, 66000049, 66649, 666049, 6660049, 66600049, 666000049}, and of these numbers only '''66000049''' and '''66600049''' are primes.

Case 4.4: ''p'' begins with 9.

In this case we can write p = 9''y''4''z''9, where all digits of ''y'', ''z'' are 0, 3, 6, or 9. If 0 ◁ ''y'', then '''9049''' ◁ ''p''. If 3 ◁ ''y'', then 349 ◁ ''p''. If 6 ◁ ''y'', then '''9649''' ◁ ''p''. If 9 ◁ ''y'', then '''9949''' ◁ ''p''. Hence we may assume ''y'' is empty.

If 0 ◁ ''z'', then 409 ◁ ''p''. If 3 ◁ ''z'', then 43 ◁ ''p''. If 9 ◁ ''z'', then 499 ◁ ''p''. Hence we may assume ''z'' ∈ {6}, and thus ''p'' ∈ 94{6}9, and the smallest prime ''p'' ∈ 94{6}9 is 946669.

[[Category:Number theory]]</text>
      <sha1>qr6lwinwyrzn9x47x9hcog3cz0o216e</sha1>
    </revision>
    <revision>
      <id>2809768</id>
      <parentid>2809766</parentid>
      <timestamp>2026-05-16T22:17:44Z</timestamp>
      <contributor>
        <username>雅典娜241</username>
        <id>3071373</id>
      </contributor>
      <origin>2809768</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="45569" sha1="jdw4wd5vfy6wl40ifkuawa6fddz2662" xml:space="preserve">'''Athena problem''' is an [[:w:List of unsolved problems in mathematics|unsolved problem]] in [[:w:Number theory|number theory]] and [[:w:Formal language theory|formal language theory]] and [[:w:Order theory|order theory]], this problem is named after the ancient Greek goddess [[:w:Athena|Athena]] (which is associated with [[:w:Wisdom|wisdom]]). Athena problem is: Give a [[:w:Natural number|natural number]] ''b'' &gt; 1, find the [[:w:Set (mathematics)|set]] of the [[:w:Minimal element|minimal element]]s of the set of the &quot;[[:w:Prime number|prime number]] [[:w:Greater than|&gt;]] ''b''&quot; [[:w:Numerical digit|digit]] [[:w:String (computer science)|string]]s in the [[:w:Positional numeral system|positional numeral system]] with [[:w:Radix|base]] ''b'' for the [[:w:Subsequence|subsequence]] [[:w:Partially ordered set|ordering]]. (A string ''x'' is a subsequence of another string ''y'', if ''x'' can be obtained from ''y'' by deleting zero or more of the [[:w:Character (computing)|character]]s in ''y''. For example, 514 is a subsequence of 352148, &quot;string&quot; is a subsequence of &quot;meistersinger&quot;. In contrast, 758 is not a subsequence of 378259, &quot;abc&quot; is not a subsequence of &quot;cbacacba&quot;, since the characters must be in the same order) (Unlike [[:w:Substring|substring]], subsequence is not required to occupy consecutive positions within the original sequences, e.g. the [[:w:Longest common subsequence|longest common subsequence problem]] is different from the [[:w:Longest common substring|longest common substring problem]])

Using [[:w:Formal language theory|formal language theory]] terminology, Athena problem is finding the [[:w:Set (mathematics)|set]] of the [[:w:Minimal element|minimal element]]s of the [[:w:Formal language|language]] of base-''b'' [[:w:Representation (mathematics)|representation]]s of the [[:w:Prime number|prime number]]s [[:w:Greater than|&gt;]] ''b'' (which is a set of [[:w:String (computer science)|string]]s of [[:w:Symbol|symbol]]s over the [[:w:Alphabet (formal languages)|alphabet]] ''Σ''&lt;sub&gt;''b''&lt;/sub&gt; := {0, 1, ..., ''b''−1}), under the subsequence ordering (i.e. the [[:w:Binary relation|binary relation]] &quot;is a subsequence of&quot;, which is a [[:w:Partially ordered set|partial ordering]]), for a given natural number ''b'' &gt; 1. (You can draw this ordering as [[:w:Hasse diagram|Hasse diagram]] to find all [[:w:Minimal element|minimal element]]s)

By [[:w:Higman's lemma|Higman's lemma]], there are no [[:w:Infinite set|infinite]] [[:w:Antichain|antichain]]s for the subsequence ordering (i.e. the subsequence ordering is always a [[:w:Well-quasi-ordering|well quasi order]]) (i.e. under the subsequence ordering (i.e. the [[:w:Binary relation|binary relation]] &quot;is a subsequence of&quot;, which is a [[:w:Partially ordered set|partial ordering]]), every set of pairwise incomparable (i.e. not [[:w:Comparability|comparable]]) strings is finite), thus there must be only finitely many such minimal elements. In other words, the set of such minimal elements must be a [[:w:Finite set|finite set]], e.g. in [[:w:Decimal|decimal]] (base ''b'' = 10), this set has exactly 77 [[:w:Element of a set|element]]s: {11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 227, 251, 257, 277, 281, 349, 409, 449, 499, 521, 557, 577, 587, 727, 757, 787, 821, 827, 857, 877, 881, 887, 991, 2087, 2221, 5051, 5081, 5501, 5581, 5801, 5851, 6469, 6949, 8501, 9001, 9049, 9221, 9551, 9649, 9851, 9949, 20021, 20201, 50207, 60649, 80051, 666649, 946669, 5200007, 22000001, 60000049, 66000049, 66600049, 80555551, 555555555551, 5000000000000000000000000000027}.

For bases 2 ≤ ''b'' ≤ 36, Athena problem is fully solved in bases ''b'' = 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 18, 20, 24, and also solved in bases ''b'' = 11, 13, 16, 22, 30 if [[:w:Probable prime|probable prime]]s are allowed. For the unsolved bases ''b'' = 17, 19, 21, 23, 25, 26, 27, 28, 29, 31, 32, 34, 35, 36, Athena problem is solved (if probable primes are allowed) except 771 [[:w:Indexed family|families]] of the form ''x''{''y''}''z'' (where ''x'' and ''z'' are strings (may be [[:w:Empty string|empty]]) of digits in base ''b'', ''y'' is a digit in base ''b'') = sequence {''xz'', ''xyz'', ''xyyz'', ''xyyyz'', ''xyyyyz'', ''xyyyyyz'', ...} (i.e. &quot;''xy''&lt;sup&gt;+&lt;/sup&gt;''z''&quot; in [[:w:Regular expression|regular expression]]), all of these 771 families contain no primes or probable primes with length ≤ 100000.

== Results ==

These are the results of the Athena problem in bases 2 ≤ ''b'' ≤ 36 (we stop at base 36 since this base is the maximum base for which it is possible to write the numbers with the [[:w:Symbol|symbol]]s 0, 1, 2, ..., 9 and A, B, C, ..., Z (i.e. the 10 [[:w:Arabic numerals|Arabic numerals]] and the 26 [[:w:Latin script|Latin letters]]): (some large primes are only probable primes, i.e. not definitely primes, since they are too large to be [[:w:Elliptic curve primality|ECPP proved]] and [[:w:Pocklington primality test#Extensions and variants|neither ''N''−1 nor ''N''+1 can be ≥ 1/3 factored]], all of them pass the [[:w:Baillie–PSW primality test|Baillie–PSW primality test]] and the [[:w:Strong pseudoprime|strong primality test]] (i.e. the [[:w:Miller–Rabin primality test|Miller–Rabin primality test]]) with all prime bases ''p'' ≤ 61, however, all primes &lt; 10&lt;sup&gt;25000&lt;/sup&gt; for bases ''b'' = 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 18, 20, 22, 24, 26, 28, 30, 36 are definitely primes, most of them &gt; 10&lt;sup&gt;299&lt;/sup&gt; are proven primes with [[:w:Elliptic curve primality|ECPP proving]], others &gt; 10&lt;sup&gt;299&lt;/sup&gt; are proven primes with [[:w:Pocklington primality test#Extensions and variants|''N''−1 or ''N''+1 proving]])

To solve the Athena problem for a given base ''b'', we must [[:w:Computing|compute]] the element up to families of the form ''x''{''y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''y'' is a digit in base ''b'') (we call such families ''linear families''), and find the smallest prime &gt; ''b'' in all such families.

Shrinking the family ''x''{''Y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''Y'' is a set of digits in base ''b'')

* If ''y'' ∈ ''Y'' and the string ''xyyz'' represents a prime &gt; ''b'' in base ''b'' (in this case, add this prime to the list) or has a subsequence which represents a prime &gt; ''b'' in base ''b'', then ''x''{''Y''}''z'' can be replaced with ''x''{''Y'' \ ''y''}''z'' ∪ ''x''{''Y'' \ ''y''}''y''{''Y'' \ ''y''}''z''.
* If ''y''&lt;sub&gt;1&lt;/sub&gt; ∈ ''Y'' and ''y''&lt;sub&gt;2&lt;/sub&gt; ∈ ''Y'' and ''y''&lt;sub&gt;1&lt;/sub&gt; ≠ ''y''&lt;sub&gt;2&lt;/sub&gt; and the string ''xy''&lt;sub&gt;1&lt;/sub&gt;''y''&lt;sub&gt;2&lt;/sub&gt;''z'' represents a prime &gt; ''b'' in base ''b'' (in this case, add this prime to the list) or has a subsequence which represents a prime &gt; ''b'' in base ''b'', then ''x''{''Y''}''z'' can be replaced with ''x''{''Y'' \ ''y''&lt;sub&gt;1&lt;/sub&gt;}{''Y'' \ ''y''&lt;sub&gt;2&lt;/sub&gt;}''z''.
* If ''y''&lt;sub&gt;1&lt;/sub&gt; ∈ ''Y'' and ''y''&lt;sub&gt;2&lt;/sub&gt; ∈ ''Y'' and ''y''&lt;sub&gt;1&lt;/sub&gt; ≠ ''y''&lt;sub&gt;2&lt;/sub&gt; and both the strings ''xy''&lt;sub&gt;1&lt;/sub&gt;''y''&lt;sub&gt;2&lt;/sub&gt;''z'' and ''xy''&lt;sub&gt;2&lt;/sub&gt;''y''&lt;sub&gt;1&lt;/sub&gt;''z'' represent a prime &gt; ''b'' in base ''b'' (in this case, add this prime to the list) or have a subsequence which represents a prime &gt; ''b'' in base ''b'', then ''x''{''Y''}''z'' can be replaced with ''x''{''Y'' \ ''y''&lt;sub&gt;1&lt;/sub&gt;}''z'' ∪ ''x''{''Y'' \ ''y''&lt;sub&gt;2&lt;/sub&gt;}''z''.

e.g. in decimal (base ''b'' = 10):

* 2221 is a prime &gt; 10, thus the family 2{0,2}1 splits into the two families 2{0}1 and 2{0}2{0}1.
* 227 is a prime &gt; 10, and it is a subsequence of 5227, thus the family 5{0,2}7 splits into the two families 5{0}7 and 5{0}2{0}7.
* 449 is a prime &gt; 10, and it is a subsequence of 6449, thus the family 6{0,3,4,6,9}9 splits into the two families 6{0,3,6,9}9 and 6{0,3,6,9}4{0,3,6,9}9.
* Both 5051 and 5501 are primes &gt; 10, thus the family 5{0,5}1 splits into the two families 5{0}1 and 5{5}1 = {5}1.
* 8501 is a prime &gt; 10, thus the family 8{0,5}1 splits into the family 8{0}{5}1.
* 887 is a prime &gt; 10, and it is a subsequence of 2887, also 2087 is a prime &gt; 10, thus the family 2{0,8}7 splits into the two families 2{0}7 and 28{0}7.
* 349 and 449 are primes &gt; 10, and they are subsequences of 9349 and 9449, respectively, also 9049, 9649, 9949 are primes &gt; 10, thus the family 9{0,3,4,6,9}9 splits into the two families 9{0,3,6,9}9 and 94{0,3,6,9}9.
* 251, 281, 521, 821, 881 are primes &gt; 10, and they are subsequences of 9251, 9281, 9521, 9821, 9881, respectively, also 9001, 9221, 9551, 9851 are primes &gt; 10, thus the family 9{0,2,5,8}1 splits into the numbers {91, 901, 921, 951, 981, 9021, 9051, 9081, 9201, 9501, 9581, 9801, 90581, 95081, 95801}.

If the methods we have discussed cannot be used to rule out or shrink ''x''{''Y''}''z'' where ''Y'' = {''y''&lt;sub&gt;1&lt;/sub&gt;, ''y''&lt;sub&gt;2&lt;/sub&gt;, ..., ''y''&lt;sub&gt;''n''&lt;/sub&gt;}, then we can replace ''x''{''Y''}''z'' by ''xy''&lt;sub&gt;1&lt;/sub&gt;{''Y''}''z'' ∪ ''xy''&lt;sub&gt;2&lt;/sub&gt;{''Y''}''z'' ∪ ... ∪ ''xy''&lt;sub&gt;''n''&lt;/sub&gt;{''Y''}''z'' and re-run the methods on this new [[:w:Formal language|language]].

If all remain families are linear families (i.e. of the form ''x''{''y''}''z'', where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''y'' is a digit in base ''b''), then we search the smallest (probable) primes in these families and add these primes to the list.

e.g. in decimal (base ''b'' = 10):

* The smallest prime in the family 5{0}27 is 5000000000000000000000000000027.
* The smallest prime in the family {5}1 is 555555555551.
* The smallest prime in the family 8{5}1 is 8555555555555555555551, but 8555555555555555555551 is not a minimal element since 555555555551 is a subsequence of 8555555555555555555551.

There is no guarantee that the techniques discussed will ever terminate, but in practice they often do. They are able to determine the set of the minimal elements in base ''b'' for 2 ≤ ''b'' ≤ 16 and ''b'' = 18, 20, 22, 24, 30. The bases ''b'' = 17, 19, 21, 23, 25 ≤ ''b'' ≤ 29, 31 ≤ ''b'' ≤ 36 are solved with the exception of 771 families of the form ''x''{''y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''y'' is a digit in base ''b'').

The following is a &quot;[[:w:Semi-algorithm|semi-algorithm]]&quot; that is guaranteed to solve the Athena problem for a given base ''b'', but it is not so easy to implement:

# ''M'' = ''[[:w:Empty string|∅]]''
# while (''L'' ≠ ''∅'') do
# choose ''x'', a shortest string in ''L''
# ''M'' := ''M'' ∪ {''x''}
# ''L'' := ''L'' − ''sup''({''x''})

In practice, for arbitrary ''L'', we cannot feasibly carry out step 5. Instead, we work with ''L''&amp;#39;, some regular overapproximation to ''L'', until we can show ''L''&amp;#39; = ''∅'' (which implies ''L'' = ''∅''). In practice, ''L''&amp;#39; is usually chosen to be a finite [[:w:Union (set theory)|union]] of sets of the form ''L''&lt;sub&gt;1&lt;/sub&gt;{''L''&lt;sub&gt;2&lt;/sub&gt;}''L''&lt;sub&gt;3&lt;/sub&gt;, where each of ''L''&lt;sub&gt;1&lt;/sub&gt;, ''L''&lt;sub&gt;2&lt;/sub&gt;, ''L''&lt;sub&gt;3&lt;/sub&gt; is finite. In the case we consider in this project, we then have to determine whether such a family contains a prime or not.

Thus, Athena problem in bases ''b'' around 500 may be [[:w:NP-complete|NP-complete]] or [[:w:NP-hard|NP-hard]], or an [[:w:Undecidable problem|undecidable problem]], or an example of [[:w:Gödel's incompleteness theorems|Gödel's incompleteness theorems]] (like the [[:w:Continuum hypothesis|continuum hypothesis]] and the [[:w:Halting problem|halting problem]]).

To solve the Athena problem, we need to determine whether a given family contains a prime. In practice, if family ''x''{''Y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''Y'' is a set of digits in base ''b'') could not be ruled out as only containing composites and ''Y'' contains two or more digits, then a relatively small prime &gt; ''b'' could always be found in this family. Intuitively, this is because there are a large number of small strings in such a family, and at least one is likely to be prime (e.g. there are 2&lt;sup&gt;''n''−2&lt;/sup&gt; strings of length ''n'' in the family 1{3,7}9, and there are over a thousand strings of length 12 in the family 1{3,7}9, thus it is very impossible that these numbers are all composite). In the case ''Y'' contains only one digit, this family is of the form ''x''{''y''}''z'', and there is only a single string of each length &gt; (the length of ''x'' + the length of ''z''), and it is not known if the following [[:w:Decision problem|decision problem]] is recursively solvable (just like [[:w:Sierpiński number|Sierpiński problem]] and [[:w:Riesel number|Riesel problem]], Sierpiński problem and Riesel problem can be generalized to other bases ''b'', in fact, Athena problem in base ''b'' covers the Sierpiński problem in base ''b'' and the Riesel problem in base ''b'' with ''k'' &lt; ''b'', i.e. finding the smallest prime of the form ''k''×''b''&lt;sup&gt;''n''&lt;/sup&gt;+1 and ''k''×''b''&lt;sup&gt;''n''&lt;/sup&gt;−1 (or prove such prime does not exist) with ''k'' &lt; ''b'', since the smallest prime of the form ''k''×''b''&lt;sup&gt;''n''&lt;/sup&gt;+1 and ''k''×''b''&lt;sup&gt;''n''&lt;/sup&gt;−1 (if exists) must be a minimal element in base ''b''):

Problem: Given strings ''x'', ''z'' (may be empty), a digit ''y'', and a base ''b'' (''x'' does not [[:w:Leading zero|start with the digit 0]], ''z'' ends with a digit which [[:w:Coprime integers|coprime]] to ''b'', ''y'' is not 0 if ''x'' is empty, ''y'' is coprime to ''b'' if ''z'' is empty), does there exist a prime number whose base-''b'' expansion is of the form ''xy''&lt;sub&gt;''n''&lt;/sub&gt;''z'' for some ''n'' ≥ 0?

Some families can be ruled out to contain no prime &gt; ''b'' by [[:w:Covering set|covering congruence]], [[:w:Factorization of polynomials|algebraic factorization]] (e.g. [[:w:Difference of two squares|difference of two squares]], [[:w:Sum of two cubes|sum of two cubes]], [[:w:Sophie Germain's identity|Sophie Germain's identity of ''x''&lt;sup&gt;4&lt;/sup&gt;+4×''y''&lt;sup&gt;4&lt;/sup&gt;]]), or combine of them, e.g.

* The base 9 family 2{7}: Always divisible by 2 or 5
* The base 16 family {8}F: Always divisible by 3, 7, or 13
* The base 21 family {7}D: Always divisible by 2, 13, or 17
* The base 23 family {D}GA: Always divisible by 2, 5, 7, 37, or 79
* The base 9 family 3{8}: Can be written as 4×9&lt;sup&gt;''n''&lt;/sup&gt;−1 and can be factored as (2×3&lt;sup&gt;''n''&lt;/sup&gt;−1) × (2×3&lt;sup&gt;''n''&lt;/sup&gt;+1)
* The base 8 family 1{0}1: Can be written as 8&lt;sup&gt;''n''&lt;/sup&gt;+1 and can be factored as (2&lt;sup&gt;''n''&lt;/sup&gt;+1) × (4&lt;sup&gt;''n''&lt;/sup&gt;−2&lt;sup&gt;''n''&lt;/sup&gt;+1)
* The base 16 family {4}1: Can be written as (4×16&lt;sup&gt;''n''&lt;/sup&gt;−49)/15 and can be factored as (2×3&lt;sup&gt;''n''&lt;/sup&gt;−7) × (2×3&lt;sup&gt;''n''&lt;/sup&gt;+7) / 15
* The base 16 family {C}D: Can be written as (4×16&lt;sup&gt;''n''&lt;/sup&gt;+1)/5 and can be factored as (2×4&lt;sup&gt;''n''&lt;/sup&gt;−2×2&lt;sup&gt;''n''&lt;/sup&gt;+1) × (2×4&lt;sup&gt;''n''&lt;/sup&gt;+2×2&lt;sup&gt;''n''&lt;/sup&gt;+1) / 5
* The base 14 family 8{D}: Can be written as 9×14&lt;sup&gt;''n''&lt;/sup&gt;−1, it is divisible by 5 if ''n'' is odd and can be factored as (3×14&lt;sup&gt;''n''/2&lt;/sup&gt;−1) × (3×14&lt;sup&gt;''n''/2&lt;/sup&gt;+1) if ''n'' is even
* The base 12 family {B}9B: Can be written as 12&lt;sup&gt;''n''&lt;/sup&gt;−25, it is divisible by 13 if ''n'' is odd and can be factored as (12&lt;sup&gt;''n''/2&lt;/sup&gt;−5) × (12&lt;sup&gt;''n''/2&lt;/sup&gt;+5) if ''n'' is even
* The base 17 family 1{9}: Can be written as (25×17&lt;sup&gt;''n''&lt;/sup&gt;−9)/16, it is divisible by 2 if ''n'' is odd and can be factored as (5×17&lt;sup&gt;''n''/2&lt;/sup&gt;−3) × (5×17&lt;sup&gt;''n''/2&lt;/sup&gt;+3) / 16 if ''n'' is even
* The base 19 family 1{6}: Can be written as (4×19&lt;sup&gt;''n''&lt;/sup&gt;−1)/3, it is divisible by 5 if ''n'' is odd and can be factored as (2×19&lt;sup&gt;''n''/2&lt;/sup&gt;−1) × (2×19&lt;sup&gt;''n''/2&lt;/sup&gt;+1) / 3 if ''n'' is even

By the [[:w:Prime number theorem|prime number theorem]], the [[:w:Probability|chance]] that a [[:w:Random number|random]] ''n''-digit base ''b'' number is prime is [[:w:Asymptotic analysis|approximately]] 1/''n'' (more accurately, the chance is approximately 1/(''n''×''ln''(''b'')), where ''ln'' is the [[:w:Natural logarithm|natural logarithm]]). If one conjectures the numbers ''x''{''y''}''z'' behave similarly (i.e. the numbers ''x''{''y''}''z'' is a [[:w:Pseudorandomness|pseudorandom sequence]]) you would expect [[:w:Harmonic_series (mathematics)|1/1 + 1/2 + 1/3 + 1/4 + ... = ∞]] primes of the form ''x''{''y''}''z'' (of course, this does not always happen, since some ''x''{''y''}''z'' families can be ruled out to contain no prime &gt; ''b'' (by covering congruence, algebraic factorization, or combine of them), but it is at least a reasonable conjecture in the absence of evidence to the contrary. Hence, the [[:w:Heuristic argument|heuristic argument]] suggests there are always infinitely many primes in family ''x''{''y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''y'' is a digit in base ''b'') if it cannot be ruled out to contain no prime or only contain finitely many primes, by covering congruence, algebraic factorization, or combine of them. However, some families ''x''{''y''}''z'' could not be proven to contain no primes &gt; ''b'' (by covering congruence, algebraic factorization, or combine of them) but no primes &gt; ''b'' could be found in the family, even after searching through numbers with over 100000 digits. In such a case, the only way to proceed is to [[:w:Primality test|test the primality]] of larger and larger numbers of such form and hope a prime is eventually discovered. e.g. the smallest (probable) prime in the family A{3}A in base ''b'' = 13 is A3&lt;sub&gt;592197&lt;/sub&gt;A, which written in decimal contains 659677 digits (it is only probable prime, i.e. not definitely prime).

All numbers are written in base ''b'', [[:w:Senary#Base 36 as senary compression|using A to Z to represent digit values 10 to 35]], &quot;{}&quot; means repeating, e.g. family 12{3}45 means the sequence {1245, 12345, 123345, 1233345, 12333345, 123333345, ...} (where the members are expressed as base ''b'' strings), subscripts are used to indicate repetitions of digits, e.g. 123&lt;sub&gt;4&lt;/sub&gt;567 means 123333567 (all subscripts are written in decimal).

Base 2: 1 prime (the largest of which has 2 digits): {11}

Base 3: 3 primes (the largest of which has 3 digits): {12, 21, 111}

Base 4: 5 primes (the largest of which has 3 digits): {11, 13, 23, 31, 221}

Base 5: 22 primes (the largest of which has 96 digits): {12, 21, 23, 32, 34, 43, 104, 111, 131, 133, 313, 401, 414, 3101, 10103, 14444, 30301, 33001, 33331, 44441, 300031, 100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000013}

Base 6: 11 primes (the largest of which has 5 digits): {11, 15, 21, 25, 31, 35, 45, 51, 4401, 4441, 40041}

Base 7: 71 primes (the largest of which has 17 digits): {14, 16, 23, 25, 32, 41, 43, 52, 56, 61, 65, 113, 115, 131, 133, 155, 212, 221, 304, 313, 335, 344, 346, 364, 445, 515, 533, 535, 544, 551, 553, 1022, 1051, 1112, 1202, 1211, 1222, 2111, 3031, 3055, 3334, 3503, 3505, 3545, 4504, 4555, 5011, 5455, 5545, 5554, 6034, 6634, 11111, 11201, 30011, 30101, 31001, 31111, 33001, 33311, 35555, 40054, 100121, 150001, 300053, 351101, 531101, 1100021, 33333301, 5100000001, 33333333333333331}

Base 8: 75 primes (the largest of which has 221 digits): {13, 15, 21, 23, 27, 35, 37, 45, 51, 53, 57, 65, 73, 75, 107, 111, 117, 141, 147, 161, 177, 225, 255, 301, 343, 361, 401, 407, 417, 431, 433, 463, 467, 471, 631, 643, 661, 667, 701, 711, 717, 747, 767, 3331, 3411, 4043, 4443, 4611, 5205, 6007, 6101, 6441, 6477, 6707, 6777, 7461, 7641, 47777, 60171, 60411, 60741, 444641, 500025, 505525, 3344441, 4444477, 5500525, 5550525, 55555025, 444444441, 744444441, 77774444441, 7777777777771, 555555555555525, 44444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444447}

Base 9: 151 primes (the largest of which has 1161 digits): {12, 14, 18, 21, 25, 32, 34, 41, 45, 47, 52, 58, 65, 67, 74, 78, 81, 87, 117, 131, 135, 151, 155, 175, 177, 238, 272, 308, 315, 331, 337, 355, 371, 375, 377, 438, 504, 515, 517, 531, 537, 557, 564, 601, 638, 661, 702, 711, 722, 735, 737, 751, 755, 757, 771, 805, 838, 1011, 1015, 1101, 1701, 2027, 2207, 3017, 3057, 3101, 3501, 3561, 3611, 3688, 3868, 5035, 5051, 5071, 5101, 5501, 5554, 5705, 5707, 7017, 7075, 7105, 7301, 8535, 8544, 8555, 8854, 20777, 22227, 22777, 30161, 33388, 50161, 50611, 53335, 55111, 55535, 55551, 57061, 57775, 70631, 71007, 77207, 100037, 100071, 100761, 105007, 270707, 301111, 305111, 333035, 333385, 333835, 338885, 350007, 500075, 530005, 555611, 631111, 720707, 2770007, 3030335, 7776662, 30300005, 30333335, 38333335, 51116111, 70000361, 300030005, 300033305, 351111111, 1300000007, 5161111111, 8333333335, 300000000035, 311111111161, 544444444444, 2000000000007, 5700000000001, 7270000000007, 88888888833335, 100000000000507, 5111111111111161, 7277777777777777707, 8888888888888888888335, 30000000000000000000051, 1000000000000000000000000057, 56111111111111111111111111111111111111, 7666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666662, 27777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777707, 300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000011}

Base 10: 77 primes (the largest of which has 31 digits): {11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 227, 251, 257, 277, 281, 349, 409, 449, 499, 521, 557, 577, 587, 727, 757, 787, 821, 827, 857, 877, 881, 887, 991, 2087, 2221, 5051, 5081, 5501, 5581, 5801, 5851, 6469, 6949, 8501, 9001, 9049, 9221, 9551, 9649, 9851, 9949, 20021, 20201, 50207, 60649, 80051, 666649, 946669, 5200007, 22000001, 60000049, 66000049, 66600049, 80555551, 555555555551, 5000000000000000000000000000027}

Base 11: 1068 primes (including 1 unproven probable prime: 57&lt;sub&gt;62668&lt;/sub&gt;), the largest of which has 62669 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel11 Data of Athena problem base 11]

Base 12: 106 primes (the largest of which has 42 digits): {11, 15, 17, 1B, 25, 27, 31, 35, 37, 3B, 45, 4B, 51, 57, 5B, 61, 67, 6B, 75, 81, 85, 87, 8B, 91, 95, A7, AB, B5, B7, 221, 241, 2A1, 2B1, 2BB, 401, 421, 447, 471, 497, 565, 655, 665, 701, 70B, 721, 747, 771, 77B, 797, 7A1, 7BB, 907, 90B, 9BB, A41, B21, B2B, 2001, 200B, 202B, 222B, 229B, 292B, 299B, 4441, 4707, 4777, 6A05, 6AA5, 729B, 7441, 7B41, 929B, 9777, 992B, 9947, 997B, 9997, A0A1, A201, A605, A6A5, AA65, B001, B0B1, BB01, BB41, 600A5, 7999B, 9999B, AAAA1, B04A1, B0B9B, BAA01, BAAA1, BB09B, BBBB1, 44AAA1, A00065, BBBAA1, AAA0001, B00099B, AA000001, BBBBBB99B, B0000000000000000000000000009B, 400000000000000000000000000000000000000077}

Base 13: 3197 primes (including 4 unproven probable primes: C5&lt;sub&gt;23755&lt;/sub&gt;C, 80&lt;sub&gt;32017&lt;/sub&gt;111, 95&lt;sub&gt;197420&lt;/sub&gt;, A3&lt;sub&gt;592197&lt;/sub&gt;A), the largest of which has 592199 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel13 Data of Athena problem base 13]

Base 14: 650 primes, the largest of which has 19699 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel14 Data of Athena problem base 14]

Base 15: 1284 primes, the largest of which has 157 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel15 Data of Athena problem base 15]

Base 16: 2347 primes (including 3 unproven probable primes: DB&lt;sub&gt;32234&lt;/sub&gt;, 4&lt;sub&gt;72785&lt;/sub&gt;DD, 3&lt;sub&gt;116137&lt;/sub&gt;AF), the largest of which has 116139 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel16 Data of Athena problem base 16]

Base 17: 10415 known primes (including many unproven probable primes) and 12 unsolved families (1{7}, 1F{0}7, 4{7}A, 70F{0}D, 8{B}9, 9{5}9, A{D}F, B{0}B3, {B}E9, {B}EE, F1{9}, FD0{D}, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel17 Data of Athena problem base 17] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left17 Data of unsolved families for base 17]

Base 18: 549 primes, the largest of which has 6271 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel18 Data of Athena problem base 18]

Base 19: 31417 known primes (including many unproven probable primes) and 17 unsolved families (4B5{0}H, {5}3, 5{H}05, 5{H}0H, 5{H}5, 66{B}, 71{0}177, 7AF{0}H, 97{0}3, C{H}C, EE1{6}, F{7}5, F{B}G, F{D}F, H0F{0}7A, HB{0}5B5, II{D}, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel19 Data of Athena problem base 19] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left19 Data of unsolved families for base 19]

Base 20: 3314 primes, the largest of which has 6271 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel20 Data of Athena problem base 20]

Base 21: 13386 known primes (including many unproven probable primes) and 8 unsolved families (5{0}DJ, {9}D, B3{0}EB, B{H}6H, C{F}0K, {F}35, G{0}FK, H{0}7771, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel21 Data of Athena problem base 21] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left21 Data of unsolved families for base 21]

Base 22: 8003 primes (including 1 unproven probable prime: BK&lt;sub&gt;22001&lt;/sub&gt;5), the largest of which has 22003 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel22 Data of Athena problem base 22]

Base 23: 65178 known primes (including many unproven probable primes) and 87 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel23 Data of Athena problem base 23] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left23 Data of unsolved families for base 23]

Base 24: 3409 primes, the largest of which has 8134 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel24 Data of Athena problem base 24]

Base 25: 133639 known primes (including many unproven probable primes) and 85 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel25 Data of Athena problem base 25] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left25 Data of unsolved families for base 25]

Base 26: 25256 known primes (including 7 unproven probable primes: 5&lt;sub&gt;19391&lt;/sub&gt;6F, 7&lt;sub&gt;20279&lt;/sub&gt;OL, LD0&lt;sub&gt;20975&lt;/sub&gt;7, 6K&lt;sub&gt;23300&lt;/sub&gt;5, J0&lt;sub&gt;44303&lt;/sub&gt;KCB, M0&lt;sub&gt;61186&lt;/sub&gt;2BB, 85M&lt;sub&gt;197060&lt;/sub&gt;B) and 3 unsolved families ({A}6F, {H}MH, {I}GL, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel26 Data of Athena problem base 26]

Base 27: 102852 known primes (including many unproven probable primes) and 44 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel27 Data of Athena problem base 27] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left27 Data of unsolved families for base 27]

Base 28: 25528 known primes (including 3 unproven probable primes: N6&lt;sub&gt;24051&lt;/sub&gt;LR, 5OA&lt;sub&gt;31238&lt;/sub&gt;F, O4O&lt;sub&gt;94535&lt;/sub&gt;9) and 1 unsolved family (O{A}F, no primes or probable primes with length ≤ 709070, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel28 Data of Athena problem base 28]

Base 29: 355242 known primes (including many unproven probable primes) and 125 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel29 Data of Athena problem base 29] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left29 Data of unsolved families for base 29]

Base 30: 2619 primes (including 1 unproven probable prime: I0&lt;sub&gt;24608&lt;/sub&gt;D), the largest of which has 34206 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel30 Data of Athena problem base 30]

Base 31: 569323 known primes (including many unproven probable primes) and 77 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel31 Data of Athena problem base 31] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left31 Data of unsolved families for base 31]

Base 32: 168882 known primes (including many unproven probable primes) and 120 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel32 Data of Athena problem base 32] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left32 Data of unsolved families for base 32]

Base 33: 280012 known primes (including many unproven probable primes) and 81 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel33 Data of Athena problem base 33] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left33 Data of unsolved families for base 33]

Base 34: 184785 known primes (including many unproven probable primes) and 47 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel34 Data of Athena problem base 34] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left34 Data of unsolved families for base 34]

Base 35: 720002 known primes (including many unproven probable primes) and 60 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel35 Data of Athena problem base 35] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left35 Data of unsolved families for base 35]

Base 36: 35286 known primes (including 3 unproven probable primes: 7K&lt;sub&gt;26567&lt;/sub&gt;Z, S0&lt;sub&gt;75007&lt;/sub&gt;8H, P&lt;sub&gt;81993&lt;/sub&gt;SZ) and 4 unsolved families (B{0}EUV, HM{0}N, N{0}YYN, O{L}Z, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel36 Data of Athena problem base 36]

== The fully proof of Athena problem in decimal (base ''b'' = 10) ==

'''Bold''' for the minimal elements, ''x'' ◁ ''y'' means ''x'' is a subsequence of ''y''.

Assume ''p'' is a prime &gt; 10, and the last digit of ''p'' must lie in {1,3,7,9}.

Case 1: ''p'' ends with 1.

In this case we can write ''p'' = ''x''1. If ''x'' contains 1, 3, 4, 6, or 7, then (respectively) '''11''' ◁ ''p'', '''31''' ◁ ''p'', '''41''' ◁ ''p'', '''61''' ◁ ''p'', or '''71''' ◁ ''p''. Hence we may assume all digits of ''x'' are 0, 2, 5, 8, or 9.

Case 1.1: ''p'' begins with 2.

In this case we can write ''p'' = 2''y''1. If 5 ◁ ''y'', then '''251''' ◁ ''p''. If 8 ◁ ''y'', then '''281''' ◁ ''p''. If 9 ◁ ''y'', then 29 ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 2.

If 22 ◁ ''y'', then '''2221''' ◁ ''p''. Hence we may assume ''y'' contains zero or one 2's.

If ''y'' contains no 2's, then ''p'' ∈ 2{0}1. But then, since the sum of the digits of ''p'' is 3, ''p'' is divisible by 3, so ''p'' cannot be prime.

If ''y'' contains exactly one 2, then we can write ''p'' = 2''z''2''w''1, where ''z'',''w'' ∈ {0}. If 0 ◁ ''z'' and 0 ◁ ''w'', then '''20201''' ◁ ''p''. Hence we may assume either ''z'' or ''w'' is empty.

If ''z'' is empty, then ''p'' ∈ 22{0}1, and the smallest prime ''p'' ∈ 22{0}1 is '''22000001'''.

If ''w'' is empty, then ''p'' ∈ 2{0}21, and the smallest prime ''p'' ∈ 2{0}21 is '''20021'''.

Case 1.2: ''p'' begins with 5.

In this case we can write ''p'' = 5''y''1. If 2 ◁ ''y'', then '''521''' ◁ ''p''. If 9 ◁ ''y'', then 59 ◁ ''p''. Hence we may assume all digits of ''y'' are 0, 5, or 8.

If 05 ◁ ''y'', then '''5051''' ◁ ''p''. If 08 ◁ ''y'', then '''5081''' ◁ ''p''. If 50 ◁ ''y'', then '''5501''' ◁ ''p''. If 58 ◁ ''y'', then '''5581''' ◁ ''p''. If 80 ◁ ''y'', then '''5801''' ◁ ''p''. If 85 ◁ ''y'', then '''5851''' ◁ ''p''. Hence we may assume ''y'' ∈ {0} ∪ {5} ∪ {8}.

If ''y'' ∈ {0}, then ''p'' ∈ 5{0}1. But then, since the sum of the digits of ''p'' is 6, ''p'' is divisible by 3, so ''p'' cannot be prime.

If ''y'' ∈ {5}, then ''p'' ∈ 5{5}1, and the smallest prime ''p'' ∈ 5{5}1 is '''555555555551'''.

If ''y'' ∈ {8}, since if 88 ◁ ''y'', then 881 ◁ ''p'', hence we may assume ''y'' ∈ {''𝜆'',8}, and thus ''p'' ∈ {51,581}, but 51 and 581 are both composite.

Case 1.3: ''p'' begins with 8.

In this case we can write p = 8''y''1. If 2 ◁ ''y'', then '''821''' ◁ ''p''. If 8 ◁ ''y'', then '''881''' ◁ ''p''. If 9 ◁ ''y'', then 89 ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 5.

If 50 ◁ ''y'', then '''8501''' ◁ ''p''. Hence we may assume y ∈ {0}{5}.

If 005 ◁ ''y'', then '''80051''' ◁ p. Hence we may assume y ∈ {0} ∪ {5} ∪ 0{5}.

If y ∈ {0}, then ''p'' ∈ 8{0}1. But then, since the sum of the digits of ''p'' is 9, ''p'' is divisible by 3, so ''p'' cannot be prime.

If y ∈ {5}, since if 55555555555 ◁ ''y'', then 555555555551 ◁ ''p'', hence we may assume ''y'' ∈ {''𝜆'', 5, 55, 555, 5555, 55555, 555555, 5555555, 55555555, 555555555, 5555555555}, and thus ''p'' ∈ {81, 851, 8551, 85551, 855551, 8555551, 85555551, 855555551, 8555555551, 85555555551, 855555555551}, but all of these numbers are composite.

If y ∈ 0{5}, since if 55555555555 ◁ ''y'', then 555555555551 ◁ ''p'', hence we may assume ''y'' ∈ {0, 05, 055, 0555, 05555, 055555, 0555555, 05555555, 055555555, 0555555555, 05555555555}, and thus ''p'' ∈ {801, 8051, 80551, 805551, 8055551, 80555551, 805555551, 8055555551, 80555555551, 805555555551, 8055555555551}, and of these numbers only 80555551 and 8055555551 are primes, but 80555551 ◁ 8055555551, thus only '''80555551''' is a minimal element.

Case 1.4: ''p'' begins with 9.

In this case we can write p = 9''y''1. If 9 ◁ ''y'', then '''991''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0, 2, 5, or 8.

If 00 ◁ ''y'', then '''9001''' ◁ ''p''. If 22 ◁ ''y'', then '''9221''' ◁ ''p''. If 55 ◁ ''y'', then '''9551''' ◁ ''p''. If 88 ◁ ''y'', then 881 ◁ ''p''. Hence we may assume ''y'' contains at most one 0, at most one 2, at most one 5, and at most one 8.

If ''y'' only contains at most one 0 and does not contain any of {2,5,8}, then ''y'' ∈ {''𝜆'',0}, and thus ''p'' ∈ {91,901}, but 91 and 901 are both composite. If ''y'' only contains at most one 0 and only one of {2,5,8}, then the sum of the digits of ''p'' is divisible by 3, ''p'' is divisible by 3, so ''p'' cannot be prime. Hence we may assume ''y'' contains at least two of {2,5,8}.

If 25 ◁ ''y'', then 251 ◁ ''p''. If 28 ◁ ''y'', then 281 ◁ ''p''. If 52 ◁ ''y'', then 521 ◁ ''p''. If 82 ◁ ''y'', then 821 ◁ ''p''. Hence we may assume ''y'' contains no 2's (since if ''y'' contains 2, then ''y'' cannot contain either 5's or 8's, which is a contradiction).

If 85 ◁ ''y'', then '''9851''' ◁ ''p''. Hence we may assume ''y'' ∈ {58,580,508,058}, and thus ''p'' ∈ {9581,95801,95081,90581}, and of these numbers only 95801 is prime, but 95801 is not a minimal element since 5801 ◁ 95801.

Case 2: ''p'' ends with 3.

In this case we can write p = ''x''3. If ''x'' contains 1, 2, 4, 5, 7, or 8, then (respectively) '''13''' ◁ ''p'', '''23''' ◁ ''p'', '''43''' ◁ ''p'', '''53''' ◁ ''p'', '''73''' ◁ ''p'', or '''83''' ◁ ''p''. Hence we may assume all digits of ''x'' are 0, 3, 6, or 9, and thus all digits of ''p'' are 0, 3, 6, or 9. But then, since the digits of ''p'' all have a common factor 3, ''p'' is divisible by 3, so ''p'' cannot be prime.

Case 3: ''p'' ends with 7.

In this case we can write ''p'' = ''x''7. If ''x'' contains 1, 3, 4, 6, or 9, then (respectively) '''17''' ◁ ''p'', '''37''' ◁ ''p'', '''47''' ◁ ''p'', '''67''' ◁ ''p'', or '''97''' ◁ ''p''. Hence we may assume all digits of ''x'' are 0, 2, 5, 7, or 8.

Case 3.1: ''p'' begins with 2.

In this case we can write ''p'' = 2''y''7. If 2 ◁ ''y'', then '''227''' ◁ ''p''. If 5 ◁ ''y'', then '''257''' ◁ ''p''. If 7 ◁ ''y'', then '''277''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 8.

If 08 ◁ ''y'', then '''2087''' ◁ ''p''. If 88 ◁ ''y'', then 887 ◁ ''p''. Hence we may assume ''y'' ∈ {0} ∪ 8{0}.

If ''y'' ∈ {0}, then ''p'' ∈ 2{0}7. But then, since the sum of the digits of ''p'' is 9, ''p'' is divisible by 3, so ''p'' cannot be prime.

If y ∈ 8{0}, then ''p'' ∈ 28{0}7. But then ''p'' is divisible by 7, since for ''n'' ≥ 0 we have 7 × 40&lt;sub&gt;''n''&lt;/sub&gt;1 = 280&lt;sub&gt;''n''&lt;/sub&gt;7.

Case 3.2: ''p'' begins with 5.

In this case we can write ''p'' = 5''y''7. If 5 ◁ ''y'', then '''557''' ◁ ''p''. If 7 ◁ ''y'', then '''577''' ◁ ''p''. If 8 ◁ ''y'', then '''587''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 2.

If 22 ◁ ''y'', then 227 ◁ ''p''. Hence we may assume ''y'' contains zero or one 2's.

If ''y'' contains no 2's, then ''p'' ∈ 5{0}7. But then, since the sum of the digits of ''p'' is 12, ''p'' is divisible by 3, so ''p'' cannot be prime.

If ''y'' contains exactly one 2, then we can write ''p'' = 5''z''2''w''7, where ''z'',''w'' ∈ {0}. If 0 ◁ ''z'' and 0 ◁ ''w'', then '''50207''' ◁ ''p''. Hence we may assume either ''z'' or ''w'' is empty.

If ''z'' is empty, then ''p'' ∈ 52{0}7, and the smallest prime ''p'' ∈ 52{0}7 is '''5200007'''.

If ''w'' is empty, then ''p'' ∈ 5{0}27, and the smallest prime ''p'' ∈ 5{0}27 is '''5000000000000000000000000000027'''.

Case 3.3: ''p'' begins with 7.

In this case we can write ''p'' = 7''y''7. If 2 ◁ ''y'', then '''727''' ◁ ''p''. If 5 ◁ ''y'', then '''757''' ◁ ''p''. If 8 ◁ ''y'', then '''787''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 7, and thus all digits of ''p'' are 0 or 7. But then, since the digits of ''p'' all have a common factor 7, ''p'' is divisible by 7, so ''p'' cannot be prime.

Case 3.4: ''p'' begins with 8.

In this case we can write ''p'' = 8''y''7. If 2 ◁ ''y'', then '''827''' ◁ ''p''. If 5 ◁ ''y'', then '''857''' ◁ ''p''. If 7 ◁ ''y'', then '''877''' ◁ ''p''. If 8 ◁ ''y'', then '''887''' ◁ ''p''. Hence we may assume ''y'' ∈ {0}, and thus ''p'' ∈ 8{0}7. But then, since the sum of the digits of ''p'' is 15, ''p'' is divisible by 3, so ''p'' cannot be prime.

Case 4: ''p'' ends with 9.

In this case we can write ''p'' = ''x''9. If ''x'' contains 1, 2, 5, 7, or 8, then (respectively) '''19''' ◁ ''p'', '''29''' ◁ ''p'', '''59''' ◁ ''p'', '''79''' ◁ ''p'', or '''89''' ◁ ''p''. Hence we may assume all digits of ''x'' are 0, 3, 4, 6, or 9.

If 44 ◁ ''x'', then '''449''' ◁ ''p''. Hence we may assume ''x'' contains zero or one 4's.

If x contains no 4's, then all digits of ''x'' are 0, 3, 6, or 9, and thus all digits of ''p'' are 0, 3, 6, or 9. But then, since the digits of ''p'' all have a common factor 3, ''p'' is divisible by 3, so ''p'' cannot be prime. Hence we may assume that ''x'' contains exactly one 4.

Case 4.1: ''p'' begins with 3.

In this case we can write ''p'' = 3''y''4''z''9, where all digits of ''y'', ''z'' are 0, 3, 6, or 9. We must have '''349''' ◁ ''p''.

Case 4.2: ''p'' begins with 4.

In this case we can write ''p'' = 4''y''9, where all digits of ''y'' are 0, 3, 6, or 9. If 0 ◁ ''y'', then '''409''' ◁ ''p''. If 3 ◁ ''y'', then 43 ◁ ''p''. If 9 ◁ ''y'', then '''499''' ◁ ''p''. Hence we may assume ''y'' ∈ {6}, and thus ''p'' ∈ 4{6}9. But then ''p'' is divisible by 7, since for ''n'' ≥ 0 we have 7 × 6&lt;sub&gt;''n''&lt;/sub&gt;7 = 46&lt;sub&gt;''n''&lt;/sub&gt;9.

Case 4.3: ''p'' begins with 6.

In this case we can write p = 6''y''4''z''9, where all digits of ''y'', ''z'' are 0, 3, 6, or 9. If 0 ◁ ''z'', then 409 ◁ ''p''. If 3 ◁ ''z'', then 43 ◁ ''p''. If 6 ◁ ''z'', then '''6469''' ◁ ''p''. If 9 ◁ ''z'', then 499 ◁ ''p''. Hence we may assume ''z'' is empty.

If 3 ◁ ''y'', then 349 ◁ ''p''. If 9 ◁ ''y'', then '''6949''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 6.

If 06 ◁ ''y'', then '''60649''' ◁ ''p''. Hence we may assume ''y'' ∈ {6}{0}.

If 666 ◁ ''y'', then '''666649''' ◁ ''p''. If 00000 ◁ ''y'', then '''60000049''' ◁ ''p''. Hence we may assume ''y'' ∈ {''𝜆'', 0, 00, 000, 0000, 6, 60, 600, 6000, 60000, 66, 660, 6600, 66000, 660000}, and thus ''p'' ∈ {649, 6049, 60049, 600049, 6000049, 6649, 66049, 660049, 6600049, 66000049, 66649, 666049, 6660049, 66600049, 666000049}, and of these numbers only '''66000049''' and '''66600049''' are primes.

Case 4.4: ''p'' begins with 9.

In this case we can write p = 9''y''4''z''9, where all digits of ''y'', ''z'' are 0, 3, 6, or 9. If 0 ◁ ''y'', then '''9049''' ◁ ''p''. If 3 ◁ ''y'', then 349 ◁ ''p''. If 6 ◁ ''y'', then '''9649''' ◁ ''p''. If 9 ◁ ''y'', then '''9949''' ◁ ''p''. Hence we may assume ''y'' is empty.

If 0 ◁ ''z'', then 409 ◁ ''p''. If 3 ◁ ''z'', then 43 ◁ ''p''. If 9 ◁ ''z'', then 499 ◁ ''p''. Hence we may assume ''z'' ∈ {6}, and thus ''p'' ∈ 94{6}9, and the smallest prime ''p'' ∈ 94{6}9 is 946669.

[[Category:Number theory]]</text>
      <sha1>jdw4wd5vfy6wl40ifkuawa6fddz2662</sha1>
    </revision>
    <revision>
      <id>2809769</id>
      <parentid>2809768</parentid>
      <timestamp>2026-05-16T22:19:02Z</timestamp>
      <contributor>
        <username>雅典娜241</username>
        <id>3071373</id>
      </contributor>
      <origin>2809769</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="45585" sha1="1voun2qskvi8rz68p16dmz9igpdbfg3" xml:space="preserve">'''Athena problem''' is an [[:w:List of unsolved problems in mathematics|unsolved problem]] in [[:w:Number theory|number theory]] and [[:w:Formal language theory|formal language theory]] and [[:w:Order theory|order theory]], this problem is named after the ancient Greek goddess [[:w:Athena|Athena]] (which is associated with [[:w:Wisdom|wisdom]]). Athena problem is: Give a [[:w:Natural number|natural number]] ''b'' &gt; 1, find the [[:w:Set (mathematics)|set]] of the [[:w:Minimal element|minimal element]]s of the set of the &quot;[[:w:Prime number|prime number]] [[:w:Greater than|&gt;]] ''b''&quot; [[:w:Numerical digit|digit]] [[:w:String (computer science)|string]]s in the [[:w:Positional numeral system|positional numeral system]] with [[:w:Radix|base]] ''b'' for the [[:w:Subsequence|subsequence]] [[:w:Partially ordered set|ordering]]. (A string ''x'' is a subsequence of another string ''y'', if ''x'' can be obtained from ''y'' by deleting zero or more of the [[:w:Character (computing)|character]]s in ''y''. For example, 514 is a subsequence of 352148, &quot;string&quot; is a subsequence of &quot;meistersinger&quot;. In contrast, 758 is not a subsequence of 378259, &quot;abc&quot; is not a subsequence of &quot;cbacacba&quot;, since the characters must be in the same order) (Unlike [[:w:Substring|substring]], subsequence is not required to occupy consecutive positions within the original sequences, e.g. the [[:w:Longest common subsequence|longest common subsequence problem]] is different from the [[:w:Longest common substring|longest common substring problem]])

Using [[:w:Formal language theory|formal language theory]] terminology, Athena problem is finding the [[:w:Set (mathematics)|set]] of the [[:w:Minimal element|minimal element]]s of the [[:w:Formal language|language]] of base-''b'' [[:w:Representation (mathematics)|representation]]s of the [[:w:Prime number|prime number]]s [[:w:Greater than|&gt;]] ''b'' (which is a set of [[:w:String (computer science)|string]]s of [[:w:Symbol|symbol]]s over the [[:w:Alphabet (formal languages)|alphabet]] ''Σ''&lt;sub&gt;''b''&lt;/sub&gt; := {0, 1, ..., ''b''−1}), under the subsequence ordering (i.e. the [[:w:Binary relation|binary relation]] &quot;is a subsequence of&quot;, which is a [[:w:Partially ordered set|partial ordering]]), for a given natural number ''b'' &gt; 1. (You can draw this ordering as [[:w:Hasse diagram|Hasse diagram]] to find all [[:w:Minimal element|minimal element]]s)

By [[:w:Higman's lemma|Higman's lemma]], there are no [[:w:Infinite set|infinite]] [[:w:Antichain|antichain]]s for the subsequence ordering (i.e. the subsequence ordering is always a [[:w:Well-quasi-ordering|well quasi order]]) (i.e. under the subsequence ordering (i.e. the [[:w:Binary relation|binary relation]] &quot;is a subsequence of&quot;, which is a [[:w:Partially ordered set|partial ordering]]), every set of pairwise incomparable (i.e. not [[:w:Comparability|comparable]]) strings is finite), thus there must be only finitely many such minimal elements. In other words, the set of such minimal elements must be a [[:w:Finite set|finite set]], e.g. in [[:w:Decimal|decimal]] (base ''b'' = 10), this set has exactly 77 [[:w:Element of a set|element]]s: {11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 227, 251, 257, 277, 281, 349, 409, 449, 499, 521, 557, 577, 587, 727, 757, 787, 821, 827, 857, 877, 881, 887, 991, 2087, 2221, 5051, 5081, 5501, 5581, 5801, 5851, 6469, 6949, 8501, 9001, 9049, 9221, 9551, 9649, 9851, 9949, 20021, 20201, 50207, 60649, 80051, 666649, 946669, 5200007, 22000001, 60000049, 66000049, 66600049, 80555551, 555555555551, 5000000000000000000000000000027}.

For bases 2 ≤ ''b'' ≤ 36, Athena problem is fully solved in bases ''b'' = 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 18, 20, 24, and also solved in bases ''b'' = 11, 13, 16, 22, 30 if [[:w:Probable prime|probable prime]]s are allowed. For the unsolved bases ''b'' = 17, 19, 21, 23, 25, 26, 27, 28, 29, 31, 32, 34, 35, 36, Athena problem is solved (if probable primes are allowed) except 771 [[:w:Indexed family|families]] of the form ''x''{''y''}''z'' (where ''x'' and ''z'' are strings (may be [[:w:Empty string|empty]]) of digits in base ''b'', ''y'' is a digit in base ''b'') = sequence {''xz'', ''xyz'', ''xyyz'', ''xyyyz'', ''xyyyyz'', ''xyyyyyz'', ...} (i.e. &quot;''xy''&lt;sup&gt;+&lt;/sup&gt;''z''&quot; in [[:w:Regular expression|regular expression]]), all of these 771 families contain no primes &gt; ''b'' or probable primes &gt; ''b'' with length ≤ 100000.

== Results ==

These are the results of the Athena problem in bases 2 ≤ ''b'' ≤ 36 (we stop at base 36 since this base is the maximum base for which it is possible to write the numbers with the [[:w:Symbol|symbol]]s 0, 1, 2, ..., 9 and A, B, C, ..., Z (i.e. the 10 [[:w:Arabic numerals|Arabic numerals]] and the 26 [[:w:Latin script|Latin letters]]): (some large primes are only probable primes, i.e. not definitely primes, since they are too large to be [[:w:Elliptic curve primality|ECPP proved]] and [[:w:Pocklington primality test#Extensions and variants|neither ''N''−1 nor ''N''+1 can be ≥ 1/3 factored]], all of them pass the [[:w:Baillie–PSW primality test|Baillie–PSW primality test]] and the [[:w:Strong pseudoprime|strong primality test]] (i.e. the [[:w:Miller–Rabin primality test|Miller–Rabin primality test]]) with all prime bases ''p'' ≤ 61, however, all primes &lt; 10&lt;sup&gt;25000&lt;/sup&gt; for bases ''b'' = 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 18, 20, 22, 24, 26, 28, 30, 36 are definitely primes, most of them &gt; 10&lt;sup&gt;299&lt;/sup&gt; are proven primes with [[:w:Elliptic curve primality|ECPP proving]], others &gt; 10&lt;sup&gt;299&lt;/sup&gt; are proven primes with [[:w:Pocklington primality test#Extensions and variants|''N''−1 or ''N''+1 proving]])

To solve the Athena problem for a given base ''b'', we must [[:w:Computing|compute]] the element up to families of the form ''x''{''y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''y'' is a digit in base ''b'') (we call such families ''linear families''), and find the smallest prime &gt; ''b'' in all such families.

Shrinking the family ''x''{''Y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''Y'' is a set of digits in base ''b'')

* If ''y'' ∈ ''Y'' and the string ''xyyz'' represents a prime &gt; ''b'' in base ''b'' (in this case, add this prime to the list) or has a subsequence which represents a prime &gt; ''b'' in base ''b'', then ''x''{''Y''}''z'' can be replaced with ''x''{''Y'' \ ''y''}''z'' ∪ ''x''{''Y'' \ ''y''}''y''{''Y'' \ ''y''}''z''.
* If ''y''&lt;sub&gt;1&lt;/sub&gt; ∈ ''Y'' and ''y''&lt;sub&gt;2&lt;/sub&gt; ∈ ''Y'' and ''y''&lt;sub&gt;1&lt;/sub&gt; ≠ ''y''&lt;sub&gt;2&lt;/sub&gt; and the string ''xy''&lt;sub&gt;1&lt;/sub&gt;''y''&lt;sub&gt;2&lt;/sub&gt;''z'' represents a prime &gt; ''b'' in base ''b'' (in this case, add this prime to the list) or has a subsequence which represents a prime &gt; ''b'' in base ''b'', then ''x''{''Y''}''z'' can be replaced with ''x''{''Y'' \ ''y''&lt;sub&gt;1&lt;/sub&gt;}{''Y'' \ ''y''&lt;sub&gt;2&lt;/sub&gt;}''z''.
* If ''y''&lt;sub&gt;1&lt;/sub&gt; ∈ ''Y'' and ''y''&lt;sub&gt;2&lt;/sub&gt; ∈ ''Y'' and ''y''&lt;sub&gt;1&lt;/sub&gt; ≠ ''y''&lt;sub&gt;2&lt;/sub&gt; and both the strings ''xy''&lt;sub&gt;1&lt;/sub&gt;''y''&lt;sub&gt;2&lt;/sub&gt;''z'' and ''xy''&lt;sub&gt;2&lt;/sub&gt;''y''&lt;sub&gt;1&lt;/sub&gt;''z'' represent a prime &gt; ''b'' in base ''b'' (in this case, add this prime to the list) or have a subsequence which represents a prime &gt; ''b'' in base ''b'', then ''x''{''Y''}''z'' can be replaced with ''x''{''Y'' \ ''y''&lt;sub&gt;1&lt;/sub&gt;}''z'' ∪ ''x''{''Y'' \ ''y''&lt;sub&gt;2&lt;/sub&gt;}''z''.

e.g. in decimal (base ''b'' = 10):

* 2221 is a prime &gt; 10, thus the family 2{0,2}1 splits into the two families 2{0}1 and 2{0}2{0}1.
* 227 is a prime &gt; 10, and it is a subsequence of 5227, thus the family 5{0,2}7 splits into the two families 5{0}7 and 5{0}2{0}7.
* 449 is a prime &gt; 10, and it is a subsequence of 6449, thus the family 6{0,3,4,6,9}9 splits into the two families 6{0,3,6,9}9 and 6{0,3,6,9}4{0,3,6,9}9.
* Both 5051 and 5501 are primes &gt; 10, thus the family 5{0,5}1 splits into the two families 5{0}1 and 5{5}1 = {5}1.
* 8501 is a prime &gt; 10, thus the family 8{0,5}1 splits into the family 8{0}{5}1.
* 887 is a prime &gt; 10, and it is a subsequence of 2887, also 2087 is a prime &gt; 10, thus the family 2{0,8}7 splits into the two families 2{0}7 and 28{0}7.
* 349 and 449 are primes &gt; 10, and they are subsequences of 9349 and 9449, respectively, also 9049, 9649, 9949 are primes &gt; 10, thus the family 9{0,3,4,6,9}9 splits into the two families 9{0,3,6,9}9 and 94{0,3,6,9}9.
* 251, 281, 521, 821, 881 are primes &gt; 10, and they are subsequences of 9251, 9281, 9521, 9821, 9881, respectively, also 9001, 9221, 9551, 9851 are primes &gt; 10, thus the family 9{0,2,5,8}1 splits into the numbers {91, 901, 921, 951, 981, 9021, 9051, 9081, 9201, 9501, 9581, 9801, 90581, 95081, 95801}.

If the methods we have discussed cannot be used to rule out or shrink ''x''{''Y''}''z'' where ''Y'' = {''y''&lt;sub&gt;1&lt;/sub&gt;, ''y''&lt;sub&gt;2&lt;/sub&gt;, ..., ''y''&lt;sub&gt;''n''&lt;/sub&gt;}, then we can replace ''x''{''Y''}''z'' by ''xy''&lt;sub&gt;1&lt;/sub&gt;{''Y''}''z'' ∪ ''xy''&lt;sub&gt;2&lt;/sub&gt;{''Y''}''z'' ∪ ... ∪ ''xy''&lt;sub&gt;''n''&lt;/sub&gt;{''Y''}''z'' and re-run the methods on this new [[:w:Formal language|language]].

If all remain families are linear families (i.e. of the form ''x''{''y''}''z'', where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''y'' is a digit in base ''b''), then we search the smallest (probable) primes in these families and add these primes to the list.

e.g. in decimal (base ''b'' = 10):

* The smallest prime in the family 5{0}27 is 5000000000000000000000000000027.
* The smallest prime in the family {5}1 is 555555555551.
* The smallest prime in the family 8{5}1 is 8555555555555555555551, but 8555555555555555555551 is not a minimal element since 555555555551 is a subsequence of 8555555555555555555551.

There is no guarantee that the techniques discussed will ever terminate, but in practice they often do. They are able to determine the set of the minimal elements in base ''b'' for 2 ≤ ''b'' ≤ 16 and ''b'' = 18, 20, 22, 24, 30. The bases ''b'' = 17, 19, 21, 23, 25 ≤ ''b'' ≤ 29, 31 ≤ ''b'' ≤ 36 are solved with the exception of 771 families of the form ''x''{''y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''y'' is a digit in base ''b'').

The following is a &quot;[[:w:Semi-algorithm|semi-algorithm]]&quot; that is guaranteed to solve the Athena problem for a given base ''b'', but it is not so easy to implement:

# ''M'' = ''[[:w:Empty string|∅]]''
# while (''L'' ≠ ''∅'') do
# choose ''x'', a shortest string in ''L''
# ''M'' := ''M'' ∪ {''x''}
# ''L'' := ''L'' − ''sup''({''x''})

In practice, for arbitrary ''L'', we cannot feasibly carry out step 5. Instead, we work with ''L''&amp;#39;, some regular overapproximation to ''L'', until we can show ''L''&amp;#39; = ''∅'' (which implies ''L'' = ''∅''). In practice, ''L''&amp;#39; is usually chosen to be a finite [[:w:Union (set theory)|union]] of sets of the form ''L''&lt;sub&gt;1&lt;/sub&gt;{''L''&lt;sub&gt;2&lt;/sub&gt;}''L''&lt;sub&gt;3&lt;/sub&gt;, where each of ''L''&lt;sub&gt;1&lt;/sub&gt;, ''L''&lt;sub&gt;2&lt;/sub&gt;, ''L''&lt;sub&gt;3&lt;/sub&gt; is finite. In the case we consider in this project, we then have to determine whether such a family contains a prime or not.

Thus, Athena problem in bases ''b'' around 500 may be [[:w:NP-complete|NP-complete]] or [[:w:NP-hard|NP-hard]], or an [[:w:Undecidable problem|undecidable problem]], or an example of [[:w:Gödel's incompleteness theorems|Gödel's incompleteness theorems]] (like the [[:w:Continuum hypothesis|continuum hypothesis]] and the [[:w:Halting problem|halting problem]]).

To solve the Athena problem, we need to determine whether a given family contains a prime. In practice, if family ''x''{''Y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''Y'' is a set of digits in base ''b'') could not be ruled out as only containing composites and ''Y'' contains two or more digits, then a relatively small prime &gt; ''b'' could always be found in this family. Intuitively, this is because there are a large number of small strings in such a family, and at least one is likely to be prime (e.g. there are 2&lt;sup&gt;''n''−2&lt;/sup&gt; strings of length ''n'' in the family 1{3,7}9, and there are over a thousand strings of length 12 in the family 1{3,7}9, thus it is very impossible that these numbers are all composite). In the case ''Y'' contains only one digit, this family is of the form ''x''{''y''}''z'', and there is only a single string of each length &gt; (the length of ''x'' + the length of ''z''), and it is not known if the following [[:w:Decision problem|decision problem]] is recursively solvable (just like [[:w:Sierpiński number|Sierpiński problem]] and [[:w:Riesel number|Riesel problem]], Sierpiński problem and Riesel problem can be generalized to other bases ''b'', in fact, Athena problem in base ''b'' covers the Sierpiński problem in base ''b'' and the Riesel problem in base ''b'' with ''k'' &lt; ''b'', i.e. finding the smallest prime of the form ''k''×''b''&lt;sup&gt;''n''&lt;/sup&gt;+1 and ''k''×''b''&lt;sup&gt;''n''&lt;/sup&gt;−1 (or prove such prime does not exist) with ''k'' &lt; ''b'', since the smallest prime of the form ''k''×''b''&lt;sup&gt;''n''&lt;/sup&gt;+1 and ''k''×''b''&lt;sup&gt;''n''&lt;/sup&gt;−1 (if exists) must be a minimal element in base ''b''):

Problem: Given strings ''x'', ''z'' (may be empty), a digit ''y'', and a base ''b'' (''x'' does not [[:w:Leading zero|start with the digit 0]], ''z'' ends with a digit which [[:w:Coprime integers|coprime]] to ''b'', ''y'' is not 0 if ''x'' is empty, ''y'' is coprime to ''b'' if ''z'' is empty), does there exist a prime number whose base-''b'' expansion is of the form ''xy''&lt;sub&gt;''n''&lt;/sub&gt;''z'' for some ''n'' ≥ 0?

Some families can be ruled out to contain no prime &gt; ''b'' by [[:w:Covering set|covering congruence]], [[:w:Factorization of polynomials|algebraic factorization]] (e.g. [[:w:Difference of two squares|difference of two squares]], [[:w:Sum of two cubes|sum of two cubes]], [[:w:Sophie Germain's identity|Sophie Germain's identity of ''x''&lt;sup&gt;4&lt;/sup&gt;+4×''y''&lt;sup&gt;4&lt;/sup&gt;]]), or combine of them, e.g.

* The base 9 family 2{7}: Always divisible by 2 or 5
* The base 16 family {8}F: Always divisible by 3, 7, or 13
* The base 21 family {7}D: Always divisible by 2, 13, or 17
* The base 23 family {D}GA: Always divisible by 2, 5, 7, 37, or 79
* The base 9 family 3{8}: Can be written as 4×9&lt;sup&gt;''n''&lt;/sup&gt;−1 and can be factored as (2×3&lt;sup&gt;''n''&lt;/sup&gt;−1) × (2×3&lt;sup&gt;''n''&lt;/sup&gt;+1)
* The base 8 family 1{0}1: Can be written as 8&lt;sup&gt;''n''&lt;/sup&gt;+1 and can be factored as (2&lt;sup&gt;''n''&lt;/sup&gt;+1) × (4&lt;sup&gt;''n''&lt;/sup&gt;−2&lt;sup&gt;''n''&lt;/sup&gt;+1)
* The base 16 family {4}1: Can be written as (4×16&lt;sup&gt;''n''&lt;/sup&gt;−49)/15 and can be factored as (2×3&lt;sup&gt;''n''&lt;/sup&gt;−7) × (2×3&lt;sup&gt;''n''&lt;/sup&gt;+7) / 15
* The base 16 family {C}D: Can be written as (4×16&lt;sup&gt;''n''&lt;/sup&gt;+1)/5 and can be factored as (2×4&lt;sup&gt;''n''&lt;/sup&gt;−2×2&lt;sup&gt;''n''&lt;/sup&gt;+1) × (2×4&lt;sup&gt;''n''&lt;/sup&gt;+2×2&lt;sup&gt;''n''&lt;/sup&gt;+1) / 5
* The base 14 family 8{D}: Can be written as 9×14&lt;sup&gt;''n''&lt;/sup&gt;−1, it is divisible by 5 if ''n'' is odd and can be factored as (3×14&lt;sup&gt;''n''/2&lt;/sup&gt;−1) × (3×14&lt;sup&gt;''n''/2&lt;/sup&gt;+1) if ''n'' is even
* The base 12 family {B}9B: Can be written as 12&lt;sup&gt;''n''&lt;/sup&gt;−25, it is divisible by 13 if ''n'' is odd and can be factored as (12&lt;sup&gt;''n''/2&lt;/sup&gt;−5) × (12&lt;sup&gt;''n''/2&lt;/sup&gt;+5) if ''n'' is even
* The base 17 family 1{9}: Can be written as (25×17&lt;sup&gt;''n''&lt;/sup&gt;−9)/16, it is divisible by 2 if ''n'' is odd and can be factored as (5×17&lt;sup&gt;''n''/2&lt;/sup&gt;−3) × (5×17&lt;sup&gt;''n''/2&lt;/sup&gt;+3) / 16 if ''n'' is even
* The base 19 family 1{6}: Can be written as (4×19&lt;sup&gt;''n''&lt;/sup&gt;−1)/3, it is divisible by 5 if ''n'' is odd and can be factored as (2×19&lt;sup&gt;''n''/2&lt;/sup&gt;−1) × (2×19&lt;sup&gt;''n''/2&lt;/sup&gt;+1) / 3 if ''n'' is even

By the [[:w:Prime number theorem|prime number theorem]], the [[:w:Probability|chance]] that a [[:w:Random number|random]] ''n''-digit base ''b'' number is prime is [[:w:Asymptotic analysis|approximately]] 1/''n'' (more accurately, the chance is approximately 1/(''n''×''ln''(''b'')), where ''ln'' is the [[:w:Natural logarithm|natural logarithm]]). If one conjectures the numbers ''x''{''y''}''z'' behave similarly (i.e. the numbers ''x''{''y''}''z'' is a [[:w:Pseudorandomness|pseudorandom sequence]]) you would expect [[:w:Harmonic_series (mathematics)|1/1 + 1/2 + 1/3 + 1/4 + ... = ∞]] primes of the form ''x''{''y''}''z'' (of course, this does not always happen, since some ''x''{''y''}''z'' families can be ruled out to contain no prime &gt; ''b'' (by covering congruence, algebraic factorization, or combine of them), but it is at least a reasonable conjecture in the absence of evidence to the contrary. Hence, the [[:w:Heuristic argument|heuristic argument]] suggests there are always infinitely many primes in family ''x''{''y''}''z'' (where ''x'' and ''z'' are strings (may be empty) of digits in base ''b'', ''y'' is a digit in base ''b'') if it cannot be ruled out to contain no prime or only contain finitely many primes, by covering congruence, algebraic factorization, or combine of them. However, some families ''x''{''y''}''z'' could not be proven to contain no primes &gt; ''b'' (by covering congruence, algebraic factorization, or combine of them) but no primes &gt; ''b'' could be found in the family, even after searching through numbers with over 100000 digits. In such a case, the only way to proceed is to [[:w:Primality test|test the primality]] of larger and larger numbers of such form and hope a prime is eventually discovered. e.g. the smallest (probable) prime in the family A{3}A in base ''b'' = 13 is A3&lt;sub&gt;592197&lt;/sub&gt;A, which written in decimal contains 659677 digits (it is only probable prime, i.e. not definitely prime).

All numbers are written in base ''b'', [[:w:Senary#Base 36 as senary compression|using A to Z to represent digit values 10 to 35]], &quot;{}&quot; means repeating, e.g. family 12{3}45 means the sequence {1245, 12345, 123345, 1233345, 12333345, 123333345, ...} (where the members are expressed as base ''b'' strings), subscripts are used to indicate repetitions of digits, e.g. 123&lt;sub&gt;4&lt;/sub&gt;567 means 123333567 (all subscripts are written in decimal).

Base 2: 1 prime (the largest of which has 2 digits): {11}

Base 3: 3 primes (the largest of which has 3 digits): {12, 21, 111}

Base 4: 5 primes (the largest of which has 3 digits): {11, 13, 23, 31, 221}

Base 5: 22 primes (the largest of which has 96 digits): {12, 21, 23, 32, 34, 43, 104, 111, 131, 133, 313, 401, 414, 3101, 10103, 14444, 30301, 33001, 33331, 44441, 300031, 100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000013}

Base 6: 11 primes (the largest of which has 5 digits): {11, 15, 21, 25, 31, 35, 45, 51, 4401, 4441, 40041}

Base 7: 71 primes (the largest of which has 17 digits): {14, 16, 23, 25, 32, 41, 43, 52, 56, 61, 65, 113, 115, 131, 133, 155, 212, 221, 304, 313, 335, 344, 346, 364, 445, 515, 533, 535, 544, 551, 553, 1022, 1051, 1112, 1202, 1211, 1222, 2111, 3031, 3055, 3334, 3503, 3505, 3545, 4504, 4555, 5011, 5455, 5545, 5554, 6034, 6634, 11111, 11201, 30011, 30101, 31001, 31111, 33001, 33311, 35555, 40054, 100121, 150001, 300053, 351101, 531101, 1100021, 33333301, 5100000001, 33333333333333331}

Base 8: 75 primes (the largest of which has 221 digits): {13, 15, 21, 23, 27, 35, 37, 45, 51, 53, 57, 65, 73, 75, 107, 111, 117, 141, 147, 161, 177, 225, 255, 301, 343, 361, 401, 407, 417, 431, 433, 463, 467, 471, 631, 643, 661, 667, 701, 711, 717, 747, 767, 3331, 3411, 4043, 4443, 4611, 5205, 6007, 6101, 6441, 6477, 6707, 6777, 7461, 7641, 47777, 60171, 60411, 60741, 444641, 500025, 505525, 3344441, 4444477, 5500525, 5550525, 55555025, 444444441, 744444441, 77774444441, 7777777777771, 555555555555525, 44444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444447}

Base 9: 151 primes (the largest of which has 1161 digits): {12, 14, 18, 21, 25, 32, 34, 41, 45, 47, 52, 58, 65, 67, 74, 78, 81, 87, 117, 131, 135, 151, 155, 175, 177, 238, 272, 308, 315, 331, 337, 355, 371, 375, 377, 438, 504, 515, 517, 531, 537, 557, 564, 601, 638, 661, 702, 711, 722, 735, 737, 751, 755, 757, 771, 805, 838, 1011, 1015, 1101, 1701, 2027, 2207, 3017, 3057, 3101, 3501, 3561, 3611, 3688, 3868, 5035, 5051, 5071, 5101, 5501, 5554, 5705, 5707, 7017, 7075, 7105, 7301, 8535, 8544, 8555, 8854, 20777, 22227, 22777, 30161, 33388, 50161, 50611, 53335, 55111, 55535, 55551, 57061, 57775, 70631, 71007, 77207, 100037, 100071, 100761, 105007, 270707, 301111, 305111, 333035, 333385, 333835, 338885, 350007, 500075, 530005, 555611, 631111, 720707, 2770007, 3030335, 7776662, 30300005, 30333335, 38333335, 51116111, 70000361, 300030005, 300033305, 351111111, 1300000007, 5161111111, 8333333335, 300000000035, 311111111161, 544444444444, 2000000000007, 5700000000001, 7270000000007, 88888888833335, 100000000000507, 5111111111111161, 7277777777777777707, 8888888888888888888335, 30000000000000000000051, 1000000000000000000000000057, 56111111111111111111111111111111111111, 7666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666662, 27777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777707, 300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000011}

Base 10: 77 primes (the largest of which has 31 digits): {11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 227, 251, 257, 277, 281, 349, 409, 449, 499, 521, 557, 577, 587, 727, 757, 787, 821, 827, 857, 877, 881, 887, 991, 2087, 2221, 5051, 5081, 5501, 5581, 5801, 5851, 6469, 6949, 8501, 9001, 9049, 9221, 9551, 9649, 9851, 9949, 20021, 20201, 50207, 60649, 80051, 666649, 946669, 5200007, 22000001, 60000049, 66000049, 66600049, 80555551, 555555555551, 5000000000000000000000000000027}

Base 11: 1068 primes (including 1 unproven probable prime: 57&lt;sub&gt;62668&lt;/sub&gt;), the largest of which has 62669 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel11 Data of Athena problem base 11]

Base 12: 106 primes (the largest of which has 42 digits): {11, 15, 17, 1B, 25, 27, 31, 35, 37, 3B, 45, 4B, 51, 57, 5B, 61, 67, 6B, 75, 81, 85, 87, 8B, 91, 95, A7, AB, B5, B7, 221, 241, 2A1, 2B1, 2BB, 401, 421, 447, 471, 497, 565, 655, 665, 701, 70B, 721, 747, 771, 77B, 797, 7A1, 7BB, 907, 90B, 9BB, A41, B21, B2B, 2001, 200B, 202B, 222B, 229B, 292B, 299B, 4441, 4707, 4777, 6A05, 6AA5, 729B, 7441, 7B41, 929B, 9777, 992B, 9947, 997B, 9997, A0A1, A201, A605, A6A5, AA65, B001, B0B1, BB01, BB41, 600A5, 7999B, 9999B, AAAA1, B04A1, B0B9B, BAA01, BAAA1, BB09B, BBBB1, 44AAA1, A00065, BBBAA1, AAA0001, B00099B, AA000001, BBBBBB99B, B0000000000000000000000000009B, 400000000000000000000000000000000000000077}

Base 13: 3197 primes (including 4 unproven probable primes: C5&lt;sub&gt;23755&lt;/sub&gt;C, 80&lt;sub&gt;32017&lt;/sub&gt;111, 95&lt;sub&gt;197420&lt;/sub&gt;, A3&lt;sub&gt;592197&lt;/sub&gt;A), the largest of which has 592199 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel13 Data of Athena problem base 13]

Base 14: 650 primes, the largest of which has 19699 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel14 Data of Athena problem base 14]

Base 15: 1284 primes, the largest of which has 157 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel15 Data of Athena problem base 15]

Base 16: 2347 primes (including 3 unproven probable primes: DB&lt;sub&gt;32234&lt;/sub&gt;, 4&lt;sub&gt;72785&lt;/sub&gt;DD, 3&lt;sub&gt;116137&lt;/sub&gt;AF), the largest of which has 116139 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel16 Data of Athena problem base 16]

Base 17: 10415 known primes (including many unproven probable primes) and 12 unsolved families (1{7}, 1F{0}7, 4{7}A, 70F{0}D, 8{B}9, 9{5}9, A{D}F, B{0}B3, {B}E9, {B}EE, F1{9}, FD0{D}, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel17 Data of Athena problem base 17] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left17 Data of unsolved families for base 17]

Base 18: 549 primes, the largest of which has 6271 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel18 Data of Athena problem base 18]

Base 19: 31417 known primes (including many unproven probable primes) and 17 unsolved families (4B5{0}H, {5}3, 5{H}05, 5{H}0H, 5{H}5, 66{B}, 71{0}177, 7AF{0}H, 97{0}3, C{H}C, EE1{6}, F{7}5, F{B}G, F{D}F, H0F{0}7A, HB{0}5B5, II{D}, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel19 Data of Athena problem base 19] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left19 Data of unsolved families for base 19]

Base 20: 3314 primes, the largest of which has 6271 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel20 Data of Athena problem base 20]

Base 21: 13386 known primes (including many unproven probable primes) and 8 unsolved families (5{0}DJ, {9}D, B3{0}EB, B{H}6H, C{F}0K, {F}35, G{0}FK, H{0}7771, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel21 Data of Athena problem base 21] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left21 Data of unsolved families for base 21]

Base 22: 8003 primes (including 1 unproven probable prime: BK&lt;sub&gt;22001&lt;/sub&gt;5), the largest of which has 22003 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel22 Data of Athena problem base 22]

Base 23: 65178 known primes (including many unproven probable primes) and 87 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel23 Data of Athena problem base 23] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left23 Data of unsolved families for base 23]

Base 24: 3409 primes, the largest of which has 8134 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel24 Data of Athena problem base 24]

Base 25: 133639 known primes (including many unproven probable primes) and 85 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel25 Data of Athena problem base 25] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left25 Data of unsolved families for base 25]

Base 26: 25256 known primes (including 7 unproven probable primes: 5&lt;sub&gt;19391&lt;/sub&gt;6F, 7&lt;sub&gt;20279&lt;/sub&gt;OL, LD0&lt;sub&gt;20975&lt;/sub&gt;7, 6K&lt;sub&gt;23300&lt;/sub&gt;5, J0&lt;sub&gt;44303&lt;/sub&gt;KCB, M0&lt;sub&gt;61186&lt;/sub&gt;2BB, 85M&lt;sub&gt;197060&lt;/sub&gt;B) and 3 unsolved families ({A}6F, {H}MH, {I}GL, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel26 Data of Athena problem base 26]

Base 27: 102852 known primes (including many unproven probable primes) and 44 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel27 Data of Athena problem base 27] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left27 Data of unsolved families for base 27]

Base 28: 25528 known primes (including 3 unproven probable primes: N6&lt;sub&gt;24051&lt;/sub&gt;LR, 5OA&lt;sub&gt;31238&lt;/sub&gt;F, O4O&lt;sub&gt;94535&lt;/sub&gt;9) and 1 unsolved family (O{A}F, no primes or probable primes with length ≤ 709070, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel28 Data of Athena problem base 28]

Base 29: 355242 known primes (including many unproven probable primes) and 125 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel29 Data of Athena problem base 29] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left29 Data of unsolved families for base 29]

Base 30: 2619 primes (including 1 unproven probable prime: I0&lt;sub&gt;24608&lt;/sub&gt;D), the largest of which has 34206 digits, see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel30 Data of Athena problem base 30]

Base 31: 569323 known primes (including many unproven probable primes) and 77 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel31 Data of Athena problem base 31] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left31 Data of unsolved families for base 31]

Base 32: 168882 known primes (including many unproven probable primes) and 120 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel32 Data of Athena problem base 32] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left32 Data of unsolved families for base 32]

Base 33: 280012 known primes (including many unproven probable primes) and 81 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel33 Data of Athena problem base 33] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left33 Data of unsolved families for base 33]

Base 34: 184785 known primes (including many unproven probable primes) and 47 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel34 Data of Athena problem base 34] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left34 Data of unsolved families for base 34]

Base 35: 720002 known primes (including many unproven probable primes) and 60 unsolved families (no primes or probable primes with length ≤ 100000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel35 Data of Athena problem base 35] and [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/left35 Data of unsolved families for base 35]

Base 36: 35286 known primes (including 3 unproven probable primes: 7K&lt;sub&gt;26567&lt;/sub&gt;Z, S0&lt;sub&gt;75007&lt;/sub&gt;8H, P&lt;sub&gt;81993&lt;/sub&gt;SZ) and 4 unsolved families (B{0}EUV, HM{0}N, N{0}YYN, O{L}Z, no primes or probable primes with length ≤ 200000, nor can be proven to only contain composites), see [https://raw.githubusercontent.com/xayahrainie4793/minimal-elements-of-the-prime-numbers/main/kernel36 Data of Athena problem base 36]

== The fully proof of Athena problem in decimal (base ''b'' = 10) ==

'''Bold''' for the minimal elements, ''x'' ◁ ''y'' means ''x'' is a subsequence of ''y''.

Assume ''p'' is a prime &gt; 10, and the last digit of ''p'' must lie in {1,3,7,9}.

Case 1: ''p'' ends with 1.

In this case we can write ''p'' = ''x''1. If ''x'' contains 1, 3, 4, 6, or 7, then (respectively) '''11''' ◁ ''p'', '''31''' ◁ ''p'', '''41''' ◁ ''p'', '''61''' ◁ ''p'', or '''71''' ◁ ''p''. Hence we may assume all digits of ''x'' are 0, 2, 5, 8, or 9.

Case 1.1: ''p'' begins with 2.

In this case we can write ''p'' = 2''y''1. If 5 ◁ ''y'', then '''251''' ◁ ''p''. If 8 ◁ ''y'', then '''281''' ◁ ''p''. If 9 ◁ ''y'', then 29 ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 2.

If 22 ◁ ''y'', then '''2221''' ◁ ''p''. Hence we may assume ''y'' contains zero or one 2's.

If ''y'' contains no 2's, then ''p'' ∈ 2{0}1. But then, since the sum of the digits of ''p'' is 3, ''p'' is divisible by 3, so ''p'' cannot be prime.

If ''y'' contains exactly one 2, then we can write ''p'' = 2''z''2''w''1, where ''z'',''w'' ∈ {0}. If 0 ◁ ''z'' and 0 ◁ ''w'', then '''20201''' ◁ ''p''. Hence we may assume either ''z'' or ''w'' is empty.

If ''z'' is empty, then ''p'' ∈ 22{0}1, and the smallest prime ''p'' ∈ 22{0}1 is '''22000001'''.

If ''w'' is empty, then ''p'' ∈ 2{0}21, and the smallest prime ''p'' ∈ 2{0}21 is '''20021'''.

Case 1.2: ''p'' begins with 5.

In this case we can write ''p'' = 5''y''1. If 2 ◁ ''y'', then '''521''' ◁ ''p''. If 9 ◁ ''y'', then 59 ◁ ''p''. Hence we may assume all digits of ''y'' are 0, 5, or 8.

If 05 ◁ ''y'', then '''5051''' ◁ ''p''. If 08 ◁ ''y'', then '''5081''' ◁ ''p''. If 50 ◁ ''y'', then '''5501''' ◁ ''p''. If 58 ◁ ''y'', then '''5581''' ◁ ''p''. If 80 ◁ ''y'', then '''5801''' ◁ ''p''. If 85 ◁ ''y'', then '''5851''' ◁ ''p''. Hence we may assume ''y'' ∈ {0} ∪ {5} ∪ {8}.

If ''y'' ∈ {0}, then ''p'' ∈ 5{0}1. But then, since the sum of the digits of ''p'' is 6, ''p'' is divisible by 3, so ''p'' cannot be prime.

If ''y'' ∈ {5}, then ''p'' ∈ 5{5}1, and the smallest prime ''p'' ∈ 5{5}1 is '''555555555551'''.

If ''y'' ∈ {8}, since if 88 ◁ ''y'', then 881 ◁ ''p'', hence we may assume ''y'' ∈ {''𝜆'',8}, and thus ''p'' ∈ {51,581}, but 51 and 581 are both composite.

Case 1.3: ''p'' begins with 8.

In this case we can write p = 8''y''1. If 2 ◁ ''y'', then '''821''' ◁ ''p''. If 8 ◁ ''y'', then '''881''' ◁ ''p''. If 9 ◁ ''y'', then 89 ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 5.

If 50 ◁ ''y'', then '''8501''' ◁ ''p''. Hence we may assume y ∈ {0}{5}.

If 005 ◁ ''y'', then '''80051''' ◁ p. Hence we may assume y ∈ {0} ∪ {5} ∪ 0{5}.

If y ∈ {0}, then ''p'' ∈ 8{0}1. But then, since the sum of the digits of ''p'' is 9, ''p'' is divisible by 3, so ''p'' cannot be prime.

If y ∈ {5}, since if 55555555555 ◁ ''y'', then 555555555551 ◁ ''p'', hence we may assume ''y'' ∈ {''𝜆'', 5, 55, 555, 5555, 55555, 555555, 5555555, 55555555, 555555555, 5555555555}, and thus ''p'' ∈ {81, 851, 8551, 85551, 855551, 8555551, 85555551, 855555551, 8555555551, 85555555551, 855555555551}, but all of these numbers are composite.

If y ∈ 0{5}, since if 55555555555 ◁ ''y'', then 555555555551 ◁ ''p'', hence we may assume ''y'' ∈ {0, 05, 055, 0555, 05555, 055555, 0555555, 05555555, 055555555, 0555555555, 05555555555}, and thus ''p'' ∈ {801, 8051, 80551, 805551, 8055551, 80555551, 805555551, 8055555551, 80555555551, 805555555551, 8055555555551}, and of these numbers only 80555551 and 8055555551 are primes, but 80555551 ◁ 8055555551, thus only '''80555551''' is a minimal element.

Case 1.4: ''p'' begins with 9.

In this case we can write p = 9''y''1. If 9 ◁ ''y'', then '''991''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0, 2, 5, or 8.

If 00 ◁ ''y'', then '''9001''' ◁ ''p''. If 22 ◁ ''y'', then '''9221''' ◁ ''p''. If 55 ◁ ''y'', then '''9551''' ◁ ''p''. If 88 ◁ ''y'', then 881 ◁ ''p''. Hence we may assume ''y'' contains at most one 0, at most one 2, at most one 5, and at most one 8.

If ''y'' only contains at most one 0 and does not contain any of {2,5,8}, then ''y'' ∈ {''𝜆'',0}, and thus ''p'' ∈ {91,901}, but 91 and 901 are both composite. If ''y'' only contains at most one 0 and only one of {2,5,8}, then the sum of the digits of ''p'' is divisible by 3, ''p'' is divisible by 3, so ''p'' cannot be prime. Hence we may assume ''y'' contains at least two of {2,5,8}.

If 25 ◁ ''y'', then 251 ◁ ''p''. If 28 ◁ ''y'', then 281 ◁ ''p''. If 52 ◁ ''y'', then 521 ◁ ''p''. If 82 ◁ ''y'', then 821 ◁ ''p''. Hence we may assume ''y'' contains no 2's (since if ''y'' contains 2, then ''y'' cannot contain either 5's or 8's, which is a contradiction).

If 85 ◁ ''y'', then '''9851''' ◁ ''p''. Hence we may assume ''y'' ∈ {58,580,508,058}, and thus ''p'' ∈ {9581,95801,95081,90581}, and of these numbers only 95801 is prime, but 95801 is not a minimal element since 5801 ◁ 95801.

Case 2: ''p'' ends with 3.

In this case we can write p = ''x''3. If ''x'' contains 1, 2, 4, 5, 7, or 8, then (respectively) '''13''' ◁ ''p'', '''23''' ◁ ''p'', '''43''' ◁ ''p'', '''53''' ◁ ''p'', '''73''' ◁ ''p'', or '''83''' ◁ ''p''. Hence we may assume all digits of ''x'' are 0, 3, 6, or 9, and thus all digits of ''p'' are 0, 3, 6, or 9. But then, since the digits of ''p'' all have a common factor 3, ''p'' is divisible by 3, so ''p'' cannot be prime.

Case 3: ''p'' ends with 7.

In this case we can write ''p'' = ''x''7. If ''x'' contains 1, 3, 4, 6, or 9, then (respectively) '''17''' ◁ ''p'', '''37''' ◁ ''p'', '''47''' ◁ ''p'', '''67''' ◁ ''p'', or '''97''' ◁ ''p''. Hence we may assume all digits of ''x'' are 0, 2, 5, 7, or 8.

Case 3.1: ''p'' begins with 2.

In this case we can write ''p'' = 2''y''7. If 2 ◁ ''y'', then '''227''' ◁ ''p''. If 5 ◁ ''y'', then '''257''' ◁ ''p''. If 7 ◁ ''y'', then '''277''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 8.

If 08 ◁ ''y'', then '''2087''' ◁ ''p''. If 88 ◁ ''y'', then 887 ◁ ''p''. Hence we may assume ''y'' ∈ {0} ∪ 8{0}.

If ''y'' ∈ {0}, then ''p'' ∈ 2{0}7. But then, since the sum of the digits of ''p'' is 9, ''p'' is divisible by 3, so ''p'' cannot be prime.

If y ∈ 8{0}, then ''p'' ∈ 28{0}7. But then ''p'' is divisible by 7, since for ''n'' ≥ 0 we have 7 × 40&lt;sub&gt;''n''&lt;/sub&gt;1 = 280&lt;sub&gt;''n''&lt;/sub&gt;7.

Case 3.2: ''p'' begins with 5.

In this case we can write ''p'' = 5''y''7. If 5 ◁ ''y'', then '''557''' ◁ ''p''. If 7 ◁ ''y'', then '''577''' ◁ ''p''. If 8 ◁ ''y'', then '''587''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 2.

If 22 ◁ ''y'', then 227 ◁ ''p''. Hence we may assume ''y'' contains zero or one 2's.

If ''y'' contains no 2's, then ''p'' ∈ 5{0}7. But then, since the sum of the digits of ''p'' is 12, ''p'' is divisible by 3, so ''p'' cannot be prime.

If ''y'' contains exactly one 2, then we can write ''p'' = 5''z''2''w''7, where ''z'',''w'' ∈ {0}. If 0 ◁ ''z'' and 0 ◁ ''w'', then '''50207''' ◁ ''p''. Hence we may assume either ''z'' or ''w'' is empty.

If ''z'' is empty, then ''p'' ∈ 52{0}7, and the smallest prime ''p'' ∈ 52{0}7 is '''5200007'''.

If ''w'' is empty, then ''p'' ∈ 5{0}27, and the smallest prime ''p'' ∈ 5{0}27 is '''5000000000000000000000000000027'''.

Case 3.3: ''p'' begins with 7.

In this case we can write ''p'' = 7''y''7. If 2 ◁ ''y'', then '''727''' ◁ ''p''. If 5 ◁ ''y'', then '''757''' ◁ ''p''. If 8 ◁ ''y'', then '''787''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 7, and thus all digits of ''p'' are 0 or 7. But then, since the digits of ''p'' all have a common factor 7, ''p'' is divisible by 7, so ''p'' cannot be prime.

Case 3.4: ''p'' begins with 8.

In this case we can write ''p'' = 8''y''7. If 2 ◁ ''y'', then '''827''' ◁ ''p''. If 5 ◁ ''y'', then '''857''' ◁ ''p''. If 7 ◁ ''y'', then '''877''' ◁ ''p''. If 8 ◁ ''y'', then '''887''' ◁ ''p''. Hence we may assume ''y'' ∈ {0}, and thus ''p'' ∈ 8{0}7. But then, since the sum of the digits of ''p'' is 15, ''p'' is divisible by 3, so ''p'' cannot be prime.

Case 4: ''p'' ends with 9.

In this case we can write ''p'' = ''x''9. If ''x'' contains 1, 2, 5, 7, or 8, then (respectively) '''19''' ◁ ''p'', '''29''' ◁ ''p'', '''59''' ◁ ''p'', '''79''' ◁ ''p'', or '''89''' ◁ ''p''. Hence we may assume all digits of ''x'' are 0, 3, 4, 6, or 9.

If 44 ◁ ''x'', then '''449''' ◁ ''p''. Hence we may assume ''x'' contains zero or one 4's.

If x contains no 4's, then all digits of ''x'' are 0, 3, 6, or 9, and thus all digits of ''p'' are 0, 3, 6, or 9. But then, since the digits of ''p'' all have a common factor 3, ''p'' is divisible by 3, so ''p'' cannot be prime. Hence we may assume that ''x'' contains exactly one 4.

Case 4.1: ''p'' begins with 3.

In this case we can write ''p'' = 3''y''4''z''9, where all digits of ''y'', ''z'' are 0, 3, 6, or 9. We must have '''349''' ◁ ''p''.

Case 4.2: ''p'' begins with 4.

In this case we can write ''p'' = 4''y''9, where all digits of ''y'' are 0, 3, 6, or 9. If 0 ◁ ''y'', then '''409''' ◁ ''p''. If 3 ◁ ''y'', then 43 ◁ ''p''. If 9 ◁ ''y'', then '''499''' ◁ ''p''. Hence we may assume ''y'' ∈ {6}, and thus ''p'' ∈ 4{6}9. But then ''p'' is divisible by 7, since for ''n'' ≥ 0 we have 7 × 6&lt;sub&gt;''n''&lt;/sub&gt;7 = 46&lt;sub&gt;''n''&lt;/sub&gt;9.

Case 4.3: ''p'' begins with 6.

In this case we can write p = 6''y''4''z''9, where all digits of ''y'', ''z'' are 0, 3, 6, or 9. If 0 ◁ ''z'', then 409 ◁ ''p''. If 3 ◁ ''z'', then 43 ◁ ''p''. If 6 ◁ ''z'', then '''6469''' ◁ ''p''. If 9 ◁ ''z'', then 499 ◁ ''p''. Hence we may assume ''z'' is empty.

If 3 ◁ ''y'', then 349 ◁ ''p''. If 9 ◁ ''y'', then '''6949''' ◁ ''p''. Hence we may assume all digits of ''y'' are 0 or 6.

If 06 ◁ ''y'', then '''60649''' ◁ ''p''. Hence we may assume ''y'' ∈ {6}{0}.

If 666 ◁ ''y'', then '''666649''' ◁ ''p''. If 00000 ◁ ''y'', then '''60000049''' ◁ ''p''. Hence we may assume ''y'' ∈ {''𝜆'', 0, 00, 000, 0000, 6, 60, 600, 6000, 60000, 66, 660, 6600, 66000, 660000}, and thus ''p'' ∈ {649, 6049, 60049, 600049, 6000049, 6649, 66049, 660049, 6600049, 66000049, 66649, 666049, 6660049, 66600049, 666000049}, and of these numbers only '''66000049''' and '''66600049''' are primes.

Case 4.4: ''p'' begins with 9.

In this case we can write p = 9''y''4''z''9, where all digits of ''y'', ''z'' are 0, 3, 6, or 9. If 0 ◁ ''y'', then '''9049''' ◁ ''p''. If 3 ◁ ''y'', then 349 ◁ ''p''. If 6 ◁ ''y'', then '''9649''' ◁ ''p''. If 9 ◁ ''y'', then '''9949''' ◁ ''p''. Hence we may assume ''y'' is empty.

If 0 ◁ ''z'', then 409 ◁ ''p''. If 3 ◁ ''z'', then 43 ◁ ''p''. If 9 ◁ ''z'', then 499 ◁ ''p''. Hence we may assume ''z'' ∈ {6}, and thus ''p'' ∈ 94{6}9, and the smallest prime ''p'' ∈ 94{6}9 is 946669.

[[Category:Number theory]]</text>
      <sha1>1voun2qskvi8rz68p16dmz9igpdbfg3</sha1>
    </revision>
  </page>
  <page>
    <title>Media Literacy and You/Deterrence without threat</title>
    <ns>0</ns>
    <id>329638</id>
    <revision>
      <id>2809813</id>
      <parentid>2809282</parentid>
      <timestamp>2026-05-17T02:01:23Z</timestamp>
      <contributor>
        <username>DavidMCEddy</username>
        <id>218607</id>
      </contributor>
      <comment>Secret codes &gt; Gold Codes</comment>
      <origin>2809813</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="57413" sha1="f53wmfgbd3dc07uhp9ygd9hp2dtfyhm" xml:space="preserve">[[File:Nukes or nonviolence.png|thumb|Nuclear war or nonviolent noncooperation?]]

:''Humanity is one misunderstanding, one miscalculation away from nuclear annihilation. ... This is madness. We must reverse course.''
:  -- [[w:António Guterres|UN Secretary General António Guterres]]  (2022)&lt;ref&gt;Jacobsen (2024), BBC (2022).&lt;/ref&gt;

:This book is a combination instruction manual on [[w:Media literacy|media literacy]] and an invitation to you to support collaborative / crowd-sourced research on how to improve the world's understanding of media literacy and how to accelerate its understanding and use globally for the betterment of humanity. 

Part I of this book on ''[[Media Literacy and You]]'' discusses &quot;The media and political economy&quot;. Except in times of terror, massive lawlessness or war, most humans place a high priority on their financial situation, the primary focus of Part I. Part II on &quot;The media and war&quot; focuses on security concerns starting with this chapter on &quot;Deterrence without threat&quot;. 

== Introduction ==

Every individual and group has a right and an obligation to defend itself. Unfortunately, when most humans&lt;ref&gt;We distinguish here between &quot;humans&quot; and &quot;people&quot; or &quot;persons&quot;, because under current US law, corporations are &quot;people&quot; and money is speech, per the US Supreme Court decision in ''[[w:Citizens United v. FEC|Citizens United v. FEC]]'' (2010) and many other judicial rulings and US law such as the [[w:Patriot Act|Patriot Act]] of 2001.&lt;/ref&gt; think of defense, they often think of violent responses to provocations. 

However, there is a growing body of research documenting 

:(a) how most uses of violence are counterproductive, and 
:(b) that there are usually nonviolent options to violence that would more effectively promote broadly shared peace and prosperity for the long term. 

This research is rarely discussed by major media outlets, because it would offend the &quot;people&quot;&lt;ref&gt;We put &quot;people&quot; in quotes in this essay, because that term includes corporations under current US law.&lt;/ref&gt; who control most of the money for the media: Nonviolence threatens their ability to get compliance from security forces. As a result, many elites prefer to use force to the detriment of the bottom 99 percent of humanity. As discussed below, a military posture that supports projecting force beyond one’s own borders may be as likely to ''provoke'' as ''prevent'' an attack.&lt;ref&gt;For example, Lebow (2025) cites some of his previous work with others to support the claim that large militaries have been &quot;more provocative than preventative in&quot; their effects. And Lebow (2024) insists that, &quot;Policymakers respond more instinctively than analytically in deciding that some policy is or is not in the national interest.&quot; See also Lebow et al. (2023).&lt;/ref&gt; 

This chapter outlines a 3-part strategy that research suggests would more likely lead to better outcomes for the vast majority of humans: 

# Citizen-directed subsidies for local news nonprofits with a firewall to prevent political interference in the content. 
# Training in nonviolent noncooperation for anyone willing to listen. 
# Forbid uses of force beyond one’s own borders and covert interference in foreign countries. 

We now discuss each of these briefly. 

== 1. Citizen-directed subsidies for local news nonprofits with a firewall to prevent political interference in the content. == 

It seems that

:''Primary drivers of every major conflict include differences between the media that the different parties find crecible.''

In a recent interview with [[w:Fordham University|Fordham University]] Professor Emerita of Communications Robin Andersen,&lt;ref name=Andersen&gt;&lt;!--Robin Andersen--&gt;{{cite Q|Q132982358}}&lt;/ref&gt; she agreed with this claim and added: 

:''We only have enemies of our very own making.''

The media are involved in this, because:  

:''The major media create the stage upon which politicians read their lines.''&lt;ref&gt;In 1791 James Madison, who represented part of Virginia in the US House of Representatives 1789-1801 and later became the 4th President of the US (1809-1819), said, &quot;Public opinion sets bounds to every government, and is the real sovereign in every free one.&quot; Quoted from the ''[[w:National Gazette|National Gazette]]'' (published 1791-1793) by Schmeller (2009, p. 36) and Sauer (2016, p. 5). Sauer described how the American Revolutionaries, especially the first four US presidents, planted stories in newspapers to build support for how they dealt with the [[w:Barbary corsairs|Barbary pirates]], who were seizing merchant ships, raiding European coastal towns and villages, and selling European captives into slavery. The first two US presidents, [[w:George Washington|Washington]] and [[w:John Adams|Adams]], used that support for protecting US shipping and citizens by paying tribute to government leaders in Morocco, Algeria, Tunisia, and Libya. The next two presidents, [[w:Thomas Jefferson|Jefferson]] and [[w:James Madison|Madison]], convinced Congress to fund a navy and marines to fight the [[w:Barbary Wars|Barbary Wars]]. This included the [[w:Battle of Derna (1805)|Battle of Derna]]  (April-May 1805), memorialized in the [[w:Marines' Hymn|Marines' Hymn]], which mentions actions &quot;to the shores of Tripoli&quot;. Sauer described how the policies were sold to the public via planted stories in the different partisan newspapers.&lt;/ref&gt; 

This works because (a) virtually everyone thinks they know more than they do ([[w:Overconfidence effect|overconfidence effect]]), and (b) virtually everyone prefers information and sources consistent with preconceptions ([[w:confirmation bias|confirmation bias]]). 

Also, in many, perhaps all, countries, the primary constituency for foreign and military policy is the people with foreign business interests. Many of these people also control substantial portions of the money for the media, which have too often encourage questionable and counterproductive uses of military force.&lt;ref&gt;If we [[w:follow the money|follow the money]], we might find that &quot;watchdogs generally protect the people who feed them&quot;, as discussed in the 2025-09-25 interview with British journalist and media reform activist Dan Hind discussing how the British [[Media Reform Coalition challenges anti-democratic media bias in the UK]].&lt;/ref&gt; 

=== Examples === 

A leader in documenting the role of the media in armed conflict is Robin Andersen,&lt;ref&gt;e.g., Andersen (2006, 2026).&lt;/ref&gt; but she is not alone. For example, [[w:University of Denver|University of Denver]] journalism professor Kareem El Damanhoury&lt;ref name=Daman&gt;&lt;!--Kareem El Damanhoury--&gt;{{cite Q|Q113752441}}&lt;/ref&gt; has compared how [[w:Gaza Strip|Gaza]] has been framed differently by [[w:Al Jazeera Media Network|Al Jazeera]], the [[w:BBC|BBC]]&lt;ref&gt;El Damanhoury et al. (2025).&lt;/ref&gt; and [[w:Fox News|Fox]].&lt;ref&gt;El Damanhoury and Saleh (2024).&lt;/ref&gt;&lt;ref&gt;Some of El Damanhoury's work in this regard [[Differences between media outlets including coverage of Gaza|is reviewed in a 2025-11-20 interview with him]].&lt;/ref&gt; 

==== World War I ====

Andersen's (2006) ''A Century of Media, A Century of War'' begins with a discussion of &quot;The birth of war propaganda&quot; in &quot;The Great War and the Fight between Good and Evil&quot;.&lt;ref&gt;Andersen (2006, ch. 1)&lt;/ref&gt; 

A more detailed but compatible discussion of the media and [[w:World War I|World War I]] is given by [[w:John Maxwell Hamilton|John Maxwell Hamilton]]. Among other things, he said: {{quote|

The first iron law of propaganda is that only the enemy does it.&lt;ref&gt;Hamilton (2020, p. 642). See also the [[John Maxwell Hamilton on American propaganda|2025-12-11 interview with Hamilton]].&lt;/ref&gt;}} 

[[File:MB Walker - German bayoneting children - Life - July 25, 1915.png|thumb|left|Stories of German soldiers impaling children on their bayonets were widely reported during the war. However, no credible evidence was found to support these claims when questions were raised after the war.&lt;ref&gt;{{cite web|title=Alleged German atrocities: Bryce report|url=http://www.nationalarchives.gov.uk/pathways/firstworldwar/spotlights/p_alleged_german.htm|publisher=The National Archives|access-date=13 July 2014}}&lt;/ref&gt;]]

Andersen (2006, pp. 8-9) said, {{quote|

James Bryce, the former British ambassador to the United States, ... helped prepare a sixty-one page ''Report on the Committee on alleged German Outrages'', which was translated into thirty languages and was said to be based on twelve hundred depositions ... included gruesome and titillating details of how German soldiers publicly raped Belgian girls in the marketplace at Liege and bayonetted a two-year-old child. ... [A]fter the war a Belgian commission of inquiry found no evidence for any major accusation in the report. ...

German propagandists, on the other hand, ... &quot;bungled, because they were naïve: they thought the success of the war depended almost solely on military strategy and therefore they tended to neglect propaganda.&quot; ... Thus, when German soldiers shot some Allied nurses who had carried weapons, they admitted it openly. The Allies reported the incident as an atrocity and featured it in press propaganda. When French troops shot German nurses under similar circumstances, the Germans failed to exploit it.}} 

==== Jonathan Swift 1710 ====

This is not limited to World War I. In 1710, [[w:Jonathan Swift|Jonathan Swift]] reportedly said, &quot;Falsehood flies, and truth comes limping after ... like a physician, who hath found out an infallible medicine, after the patient is dead.&quot;&lt;ref name=Swift&gt;Excerpted from a line in [[Wikiquote:Jonathan Swift]] consulted 2026-04-13.&lt;/ref&gt;  

==== The Marines' Hymn ====

The [[w:Marines' Hymn|Marine Corps Hymn]] begins, {{quote|

From the Halls of Montezuma

To the shores of Tripoli;

We fight our country's battles

In the air, on land, and sea.}}

The &quot;[[w:Battle of Chapultepec|Halls of Montezuma]]&quot; refer to the [[w:Mexican–American War|Mexican–American War]], which was fought to expand slavery first into [[w:Texas|Texas]]  -- and supporters of slavery hoped that would help expand slavery further west. The &quot;[[w:Battle of Derna (1805)|shores of Tripoli]]&quot; were part of the [[w:Barbary Wars|Barbary Wars]], which were fought to reduce the need to pay (a) tribute to the [[w:Barbary Coast|Barbary or Berber]] states of [[w:Morocco|Morocco]], [[w:Algeria|Algeria]], [[w:Tunisia|Tunisia]], and [[w:Libya|Libya]] or (b) ransom to [[w:Barbary corsairs|Barbary pirates]], who were otherwise capturing Christians and selling them into slavery. 

Did the bottom 99 percent of the US population of that time benefit? Or did these wars (and any tribute and ransom paid by the US government before the Barbary wars) constitute a hidden transfer of wealth from the poor to the wealthy? Research is needed on these questions. 

==== Gulf of Tonkin Resolution: &quot;Betray the nation or do not get elected.&quot; ====

Regarding the [[w:Vietnam War|Vietnam War]], former president [[w:Dwight D. Eisenhower|Eisenhower]] wrote in his autobiography, which appeared in 1963 (he left the presidency 1961-01-20), that he had never communicated {{quote|

with a person knowledgeable in Indochinese affairs [including Vietnam] who did not agree that had elections been held as of the time of the fighting [leading to the defeat of the French in 1954], possibly 80 per cent of the population would have voted for the Communist [[w:Ho Chi Minh|Ho Chi Minh]].&lt;ref&gt;Eisenhower (1963, p. 372).&lt;/ref&gt;}}

[[w:Joseph McCarthy|Joseph McCarthy]], who had been elected to the US Senate in 1946 and &quot;experienced a meteoric rise in national profile beginning on February 9, 1950, when he gave a&quot; speech during which he said something like, &quot;The [[w:United States Secretary of State|State Department]] is infested with communists. I have here in my hand a list of 205—a list of names that were made known to the Secretary of State as being members of the Communist Party and who nevertheless are still working and shaping policy in the State Department.&quot; McCarthy's mostly baseless claims went largely unchallenged in the media, including accusing the Democrats of &quot;twenty years of treason&quot; for having been allied with the Soviet Union, which took the bulk of casualties during World War II. 

By the end of 1953 with (Republican) Eisenhower as president roughly 11 months, McCarthy was complaining about &quot;''21'' years of treason&quot;, complaining that Eisenhower was not sufficiently aggressive in rooting out the communists who McCarthy claimed were in the government.&lt;ref&gt;Fried (1997, p. 179).&lt;/ref&gt; 

Then the French were defeated by Vietnamese communists 1954-05-07 in the [[w:Battle of Dien Bien Phu|Battle of Dien Bien Phu]]. The [[w:1954 Geneva Conference|1954 Geneva Conference]], which had begun eleven days earlier, 1954-04-26, concluded 1954-07-21 with the &quot;Geneva Accords of 1954&quot;.&lt;ref&gt;The [[w:Battle of Dien Bien Phu|Battle of Dien Bien Phu]], 1954-05-07, effectively ended the [[w:First Indochina War|French Indochina War]]. This led to the [[w:1954 Geneva Conference|Geneva accords of 1954]], officially dated 1954-07-20 but actually signed the following morning. Those accords took effect on three different dates, July 27 and August 1 and 11 in three different sectors of Vietnam. See &lt;!--Agreement on the Cessation of Hostilities in Vietnam--&gt;{{cite Q|Q139676410}}&lt;/ref&gt; Those accords called for UN-supervised elections for July of 1956, when Eisenhower would presumably be campaigning for reelection. Eisenhower doubtless knew that he might lose his bid for re-election in 1956, if the Communist Ho Chi Minh won elections in July of that year. 

:''The consistent suppression of honest portrayal in the major media of that day of the perspective of anyone whom Eisenhower considered &quot;knowledgeable in Indochinese affairs&quot; gave him -- and his successors [[w:John F. Kennedy|Kennedy]], [[w:Lyndon B. Johnson|Johnson]], and [[w:Richard Nixon|Nixon]] -- the choice between betraying the nation or not getting elected.'' 

In this environment, the [[w:Operation 34A|US initiated a series of clandestine operations against North Vietnam]] including infiltrating CIA-recruited spies and supporting attacks against North Vietnam by South Vietnamese commandos.&lt;ref&gt;Paterson (2008).&lt;/ref&gt; This included a raid 1964-07-30 by South Vietnamese commandos on the island of Hòn Mê, roughly 300 km (180 miles) north of the [[w:Vietnamese Demilitarized Zone|Vietnamese Demilitarized Zone]] in the [[w:Gulf of Tonkin|Gulf of Tonkin]], covered by [[w:DESOTO patrol|US naval vessels]] patrolling in that area. Then during a dark and stormy night six days later, US naval vessels opened fire on radar snow, and President Johnson requested and received Congressional approval of the [[w:Gulf of Tonkin Resolution|Gulf of Tonkin Resolution]]; then-[[w:United States Secretary of Defense|US Secretary of Defense]] [[w:Robert McNamara|McNamara]] claimed those attacks were &quot;unprovoked&quot;.&lt;ref&gt;Karnow (1983, p. 375). See also the section on [[w:Gulf of Tonkin Resolution#Congress votes|Congress votes]]&quot; in the Wikipedia article on [[w:Gulf of Tonkin Resolution|Gulf of Tonkin Resolution]], accessed 2026-05-14.&lt;/ref&gt;

In this media environment, only two officials in the US Congress voted against the Gulf of Tonkin Resolution: [[w:Ernest Gruening|Ernest Gruening]] (D-AK) and [[w:Wayne Morse|Wayne Morse]] (D-OR). Gruening lost in his next primary campaign to [[w:Mike Gravel|Mike Gravel]], and Morse lost in his next general election campaign to [[w:Bob Packwood|Bob Packwood]]. These results support the previous claim that the major media give politicians the choice: 

:''Betray the nation, or do not get elected.''

That resolution became the primary authorization for the US war in Vietnam until Congress ended the funding. 

==== Was the Vietnam War lost in Washington or by media biases? ====

[[w:John Mueller|John Mueller]], prolific author, Professor Emeritus of international relations at [[w:Ohio State University|Ohio State University]] and Senior Fellow at the [[w:Cato Institute|Cato Institute]], said that the most effective thing the US did to win the [[w:Cold War|Cold War]] was —

:''nothing'': 

Between the [[w:Fall of Saigon|Fall of Saigon]] in 1975 and the inauguration of [[w:Ronald Reagan|Ronald Reagan]] as President of the US, the US &quot;went into a sort of containment funk: it effectively adopted a policy of complacency (or perhaps of appeasement) as it watched from the sidelines as the Soviet Union … opportunistically gathered a set of Third World countries into its imperial embrace: Angola in 1976, Mozambique and Ethiopia in 1977, South Yemen and Afghanistan in 1978, Grenada and Nicaragua in 1979.&quot;&lt;ref&gt;Mueller (2021,  p. 59).&lt;/ref&gt; Nearly all became major economic and political drains on the Soviets with Afghanistan being the worst. And their Warsaw Pact allies in Eastern Europe became a severe economic drain and psychic problem.&lt;ref&gt;Mueller and Graves (2023).&lt;/ref&gt; 

President Reagan, inaugurated 1981-01-20, had a very different vision of the role of the US in foreign relations from his predecessor, [[w:Jimmy Carter|Jimmy Carter]]. In 1983-06-21 Reagan insisted, &quot;We cannot permit the Soviet-Cuban-Nicaraguan axis to take over Central America&quot;, because the consequences would include &quot;a tidal wave of refugees ... 'feet people' ... swarming into our country.&quot;&lt;ref&gt;Clines (1983).&lt;/ref&gt; 

Other sources&lt;ref&gt;e.g., Andersen (2006, Part II).&lt;/ref&gt; insist the opposite, that the vast majority of deaths in Central America during the Reagan years were poor humans petitioning nonviolently for a redress of grievances, suppressed by terrorist / death squads supported by the Reagan administration largely in violation of laws passed by Congress and signed by President Reagan. On 1986-10-05 [[w:Corporate Air Services HPF821|a Nicaraguan soldier with a surface to air missile shot down a C-123]] cargo aircraft carrying supplies to the Contra roughly 35 miles (56 km) north of Costa Rica. Documents found in the wreckage and a confession by the sole survivor led to the [[w:Iran–Contra affair|Iran-Contra hearings]] the following year, during which Lt. Col. [[w:Oliver North|Oliver North]] insisted, &quot;We didn't lose the war in Vietnam ..., we lost it in this city.&quot;&lt;ref&gt;Andersen (2006, p. 137). See also, Wikipedia, &quot;[[w:Stab-in-the-back myth|Stab-in-the-back myth]]&quot;, accessed 2026-05-13.&lt;/ref&gt; 

The previous section on the &quot;Gulf of Tonkin Resolution&quot; provides an alternative narrative of the Vietnam War: If as Eisenhower claimed, &quot;possibly 80 per cent of the [Vietnamese] population would have voted for the Communist [[w:Ho Chi Minh|Ho Chi Minh]]&quot; if elections had been held there, it's hard to imagine how anyone else could have won without aggressive action that actually ''improved'' the lives of Vietnamese peasants in the South. US-led efforts there were officially designed to win &quot;[[w:Hearts and Minds (Vietnam War)|Hearts and Minds]]&quot; but were implemented with such coercion that the result was the opposite. A cynic might say that it is hard to win people's hearts and minds by killing them. 

====Richard Barlow and nuclear proliferation====

There is also documentation that the US helped Pakistan get nuclear weapons and destroyed the career of an intelligence analyst, [[w:Richard Barlow (intelligence analyst)|Richard Barlow]], for telling his managers they should not lie to Congress about it. Barlow has insisted that neither Pakistan nor North Korea would have nuclear weapons and Iran would not have a nuclear weapons program today, if the US had followed its own laws. Barlow’s claims, including his punishment by administration officials, have been reported in major media outlets&lt;ref&gt;e.g., Stein (2013). See also Wikipedia, &quot;[[w:Richard Barlow (intelligence analyst)|Richard Barlow (intelligence analyst)]]&quot;, accessed 2026-05-06.&lt;/ref&gt; but not in a way that would seriously limit the ability — and need — for administration officials to lie to Congress. 

==== Nayirah testimony and the 1990-1991 Gulf War ====

A more recent example is the 1990-10-10 testimony by [[w:Nayirah testimony|Nayirah al-Ṣabaḥ to the US Congressional Human Rights Caucus]], two months after the Iraqi invasion of Kuwait. She claimed to have seen Iraqi soldiers taking premature babies out of incubators in a maternity ward before looting the incubators and leaving the babies to die on the floor after the Iraqi invasion of Kuweit; she said she had been a volunteer nurse in the hospital at that time. Her statements were widely publicized and cited numerous times in the United States Senate and by American president George H. W. Bush to contribute to the rationale for pursuing military action against Iraq. It was later revealed that she was the daughter of Kuwaiti ambassador Saud Nasser al-Saud al-Sabah and that her testimony was false.&lt;ref&gt;Andersen (2006, ch. 12).&lt;/ref&gt; 

==== 1998 Embassy bombings and September 11 ====

As another example, there is substantial documentation available today that [[1998 Embassy bombings and September 11|the suicide mass murders of September 11, 2001]], likely would not have occurred if the US had treated the 1998 bombings of the US embassies in Kenya and Tanzania as law enforcement issues. Muslim clerics all over the world initially condemned those acts. Al-Qaeda was dead. Their funding had largely dried up. And bin Laden was scheduled to be extradited the following month to Saudi Arabia to be prosecuted for treason, where he would likely have been convicted and executed.&lt;ref&gt;Those 1998 attacks on US embassies in Kenya and Tanzania were reportedly motivated as retaliation for US support for torture, transferring a colleague of bin Laden to Egypt for torture, according to Mayer (2008, p. 114). The major media in the US has provided ample coverage of, e.g., promises by Donald Trump supporting torture (McCarthy 2016), while largely suppressing honest discussion of the research on it. For example, around 1629 the Duke of Brunswick was discussing torture with two leading Jesuit scholars, who supported it. They insisted that torture had been used only with individuals identified by other &quot;witches&quot;, who had &quot;confessed&quot; after torture. The Duke then led the Jesuits to a woman being stretched on the rack and asked her, “You are a confessed witch. I suspect these two men of being warlocks. What do you say? Another turn of the rack, executioners.” “No, no!” screamed the woman. “You are quite right. I have often seen .. . They can turn themselves into goats, wolves, and other animals. … Several witches have had children by them. … The children had heads like toads and legs like spiders.” The Duke then asked the Jesuits. “Shall I put you to the torture until you confess, my friends?” One of the Jesuits was [[w:Friedrich Spee|Friedrich Spee]], who thanked God he had been led to this insight by a friend and then wrote a book against torture. See Pinker (2011, pp. 138-139). Similar comments about the counterproductive nature of torture were made by General Stanley McChrystal (2013), who held several command positions in Iraq and Afghanistan.&lt;/ref&gt; 

But it seemed questionable at best whether major media executives in the US would have given favorable coverage to such a diplomatic solution. Instead, the US bombed a pharmaceutical plant in Sudan and al-Qaeda training camps in Afghanistan. Then Muslim public opinion turned 180 degrees to conclude, &quot;Bin Laden is right: The US ''is'' an evil empire.&quot; The US became bin Laden’s only indispensable ally, according to the CIA agent responsible for tracking bin Laden at that time.&lt;ref&gt;Scheuer (2004, p. xv).&lt;/ref&gt; Leading Saudis started supporting al-Qaeda, including some working for the Saudi embassy and consulates in the US. Only one country seems to have been involved in the preparations for the September 11 attacks, and that was Saudi Arabia. But Saudis were friends of the Bush family, and a crisis is a terrible thing to waste.&lt;ref&gt;Romer (2009).&lt;/ref&gt; 

:''Did the US invade Afghanistan and Iraq on grounds that senior journalists and leading media executives should have known at the time were questionable and likely fraudulent — to the detriment of nearly everyone except the &quot;people&quot; who control most of the money for the media?'' 

Similarly, on 2003-05-29 [[w:BBC|BBC]] journalist [[w:Andrew Gilligan|Andrew Gilligan]] reported that the [[w:Tony Blaire|Blair government]] had &quot;sexed up&quot; [[w:September Dossier|intelligence reports]] issued the previous September to justify supporting the 2003-03-20 [[w:Iraq War|US-led invasion of Iraq]], two months before Gilligan's report. This led to the [[w:Hutton Inquiry|Hutton Inquiry]], which led to the resignations of Gilligan and the BBC's chairman and the firing of the BBC's director-general. However, the British public expressed so many reservations about the Hutton Inquiry that a follow-up investigation was ordered in 2009. This became the &quot;[[w:Iraq Inquiry|Iraq Inquiry]]&quot;, whose 2016-07-06 report essentially validated what Gilligan had said just over 13 years earlier. This provides one more example of the 1710 maxim of Jonathan Swift that, &quot;Falsehood flies, and truth comes limping after ... like a physician, who hath found out an infallible medicine, after the patient is dead.&quot;&lt;ref name=Swift/&gt;

====Ukraine war====

Page 1 of the 2023-05-04 edition of ''[[w:Le Monde Diplomatique|Le Monde Diplomatique]] carried a headline: 

:One year after the invasion of Ukraine: The media, vanguard of the war party,&lt;ref&gt;Halimi and Rimbert (2023) in the French-language original.&lt;/ref&gt;

consistent with Andersen (2006).

=== in sum ===

You, dear reader, can help overcome these problems by talking, as suggested in the exercises below and the rest of this book. If you can help others become less angry and more willing to agree to disagree agreeably with others, that should reduce the risk of war and improve the prospects for progress on all the other major problems facing humanity today. 

==2. Training in nonviolent noncooperation for anyone willing to listen == 

A major driver of the current conflict between India and Pakistan is mistreatment of Muslims in India. Simulations of a nuclear war between India and Pakistan suggest that such a war would likely produce a nuclear autumn lasting years during which 40 percent of humanity would starve to death if they did not die of something else sooner. Over 90 percent of those would be in countries not involved in the nuclear exchange.&lt;ref&gt;Xia et al. (2022). See also Wikiversity, &quot;[[Responding to a nuclear attack]]&quot;, accessed 2026-05-05.&lt;/ref&gt;

The recent &quot;[[w:2025 India–Pakistan conflict|2025 India–Pakistan conflict]]&quot; was a response by India to violence in Indian-administered [[w:Kashmir|Kashmir]] by terrorists allegedly supported by Pakistan. India would have had much more difficulty justifying violent repression of ''nonviolent'' protests, especially if a more diverse media ecology gave such protests more and more sympathetic coverage. 

During the [[w:Great Depression|Great Depression]], ethnic Germans in the [[w:Sudetenland|Sudetenland]] region of [[w:Czechoslovakia|Czechoslovakia]] were harder hit by increasing trade barriers than their non-German neighbors. They were therefore more open to populist and extremist movements such as fascism, communism and German irredentism.&lt;ref&gt;Wikipedia, &quot;[[w:Sudetenland|Sudetenland]]&quot;, esp. the section on &quot;[[w: Sudetenland#Within the Czechoslovak Republic (1918–1938)|Within the Czechoslovak Republic (1918–1938)]]&quot;, accessed 2026-05-05.&lt;/ref&gt; If those ethnic Germans had used nonviolent noncooperation to highlight their grievances, and if Czechoslovakia at that time had had a substantially more diverse media system, it seems likely that they could have gotten reasonable redress of grievances. If so, it would have been harder for Hitler to use that as an excuse to invade Czechoslovakia, as he did in 1938.&lt;ref&gt;Wikipedia, &quot;[[w:Occupation of Czechoslovakia (1938–1945)|Occupation of Czechoslovakia (1938–1945)]]&quot;, accessed 2026-05-05.&lt;/ref&gt; 

An ideal settlement of the current Russo-Ukraine war might include training in nonviolent noncooperation made more effective through a more diverse media culture as suggested above. A substantial portion of the Ukrainian population, especially the Ukrainian military, are reported to be vicious anti-Russian Nazis, and the Ukrainian government has outlawed many uses of non-Ukrainian languages, especially Russian.&lt;ref&gt;Horton (2024).&lt;/ref&gt; A campaign of nonviolent noncooperation with a vigorous, diverse adversarial press would likely make it harder for Ukraine to continue any persecution of Russian speakers. It would also make it harder for major media in the US and Western Europe to suppress honest discussion of anti-Russian racism in Ukraine. Swanson (2022) said that the [[w:Baltic states|Baltic states]] have implemented such training in preparations for a possible Russian invasion; they might be asked to support such training in Ukraine (and elsewhere).&lt;ref&gt;Swanson (2022).&lt;/ref&gt; 

=== Life in prison for teaching nonviolence ===

Per the US Supreme Court decision in ''[[w:Holder v. Humanitarian Law Project|Holder v. Humanitarian Law Project]]'' (2010), teaching nonviolence to anyone whom the US State Department claims supports a foreign terrorist organization is &quot;[[w:Providing material support for terrorism|providing material support for terrorism]]&quot;, which is a felony under the USA [[w:Patriot Act|Patriot Act]] of 2001. Moreover, if the State Department claims that the death of any &quot;person&quot; resulted from the activities of the designated foreign terrorist organization, the penalty can be life in prison, where &quot;person&quot; is defined in the Patriot Act as &quot;any individual or entity capable of holding a legal or beneficial interest in property&quot;.&lt;ref&gt;The treatment of [[w:Sami Al-Arian|Sami Al-Arian]] is worth noting in discussing the Patriot Act. Al-Arian is a Kuwaiti-born political activist of Palestinian origin, who earned a doctorate in Electrical Sciences and Systems Engineering at [[w:North Carolina State University|North Carolina State]] in 1985 and taught computer engineering at [[w:University of South Florida|University of South Florida]] (USF) beginning in 1986. He was granted permanent resident status in 1989. In 1993 he earned a Distinguished Teacher Award as a tenured associate professor at USF. He was an [[w:imam|imam]] in a local [[w:mosque|mosque]] and led in other initiatives to promote dialogue and public policy initiatives between the West and Middle East. On September 26, 2001, he appeared on ''[[w:The O'Reilly Factor|The O'Reilly Factor]]'' where he was confronted with a 1988 recording of him shouting &quot;death to Israel&quot;. Al-Arian replied that &quot;Death to Israel&quot; meant &quot;death to occupation, ... apartheid, ...oppression,&quot; whereupon O'Reilly cut him off and called for the [[w:Central Intelligence Agency|Central Intelligence Agency]] to investigate him. Al-Arian spent most of the next 14 years between that 2001 interview and 2015 in detention, much of it in solitary confinement. This period included a 2005 trial that ended with acquittal on 8 counts and a hung jury on another 9. In 2015 he was deported to Turkey. In 2017, he founded the Center for Islam and Global Affairs at [[w:Istanbul Sabahattin Zaim University|Istanbul Sabahattin Zaim University]] in Istanbul, Turkey, which he directs. What has been the impact of treatment of Al-Arian on the well-being of the bottom 99 percent of the US and world population?&lt;/ref&gt; 

How did these provisions get written into the Patriot Act? 

That's a question that deserves research, perhaps by asking elected officials in the US Congress and lobbying for their repeal. A speculation consistent with the thesis of this book is that nonviolence terrifies those who control most of they money for the media, because it threatens their ability to get their security forces to follow orders. 

==3. Forbid uses of force beyond one’s own borders and covert interference in foreign countries ==

:''[[w:Si vis pacem, para bellum|If you want peace, prepare for war.]]''
:  -- ''[[w:De Re Militari|De Re Militari]]'' by [[w:Publius Flavius Vegetius Renatus|Publius Flavius Vegetius Renatus]] (fourth or fifth century AD)

The record of history is now clear: Those who prepared for war often got war initiated when one party claimed they were being attacked or about to be attacked and believed they would fare better by attacking. Sometimes this occurred when the media environment convinced leaders that their political futures required them to clandestinely provoke foreign entities to do things that could then be denounced as unprovoked to justify military escalation, as mentioned in the previous section.  

===Deterrence theory and nuclear Armageddon=== 

Standard [[w:Deterrence theory|deterrence theory]] assumes that one's opponents are rational and do not want [[w:Armageddon|Armageddon]]. At least some portions of the [[w:Islamic State|Islamic State]] reportedly violates this assumption, because it &quot;not only believes in the literal meaning of the coming Armageddon – it sees itself as its chief protagonist.&quot;&lt;ref&gt;Misra (2015).&lt;/ref&gt; Some [[w:Christian nationalism|Christian nationalists]] promoted to command positions by [[w:United States Secretary of Defense|US Secretary of Defense]] [[w:Pete Hegseth|Hegseth]] and President Trump also seem to believe that Armageddon might be desirable. On 2026-03-03 the [[w:Military Religious Freedom Foundation|Military Religious Freedom Foundation]] said they had received over 200 complaints from over 50 different US military installations with comments like, &quot;President Trump has been anointed by Jesus to light the signal fire in Iran to cause Armageddon and mark his return to Earth&quot;, per an email from one [[w:Non-commissioned officer|NCO]].&lt;ref&gt;Nick Mordowanec (2026).&lt;/ref&gt; With Hegseth holding monthly Christian worship services in the Pentagon during business hours,&lt;ref&gt;Black (2025), Mayes-Osterman (2025). See also the section on &quot;[[w:Pete Hegseth#Pentagon Christian worship services and &quot;biblically sanctioned war&quot;|Pentagon Christian worship services and &quot;biblically sanctioned war&quot;]] in the Wikipedia article on [[w:Pete Hegseth|Pete Hegseth]], accessed 2026-05-14.&lt;/ref&gt; this suggests that Hegseth could have appointed enough Christian nationalists to key positions to initiate nuclear attacks on Iran or Russia, claiming that President Trump had ordered such whether he had or not.&lt;ref&gt;The [[w:Gold Codes|Gold Codes]] carried in the &quot;[[w:nuclear football|nuclear football]]&quot; required by the [[w:Permissive action link|permissive action link]]s would ''not'' prevent Hegseth and a few others appointed by him from initiating nuclear Armageddon, according to Ellsberg, who had been a nuclear war planner for presidents Eisenhower, Kennedy, Johnson, and Nixon, before releasing the ''[[w:Pentagon Papers|Pentagon Papers]]''. Ellsberg (2017, p. 69) insisted that the security provided by those Gold Codes were a hoax, because otherwise a single nuclear detonation on Washington, DC, when both the president and vice president were in town &quot;would would definitively block any authorized, coordinated nuclear response to that or any subsequent nuclear attack.&quot;&lt;/ref&gt; 

The biggest risk today may be the risk of [[w:Nuclear holocaust|nuclear Armageddon]], which seems on average to grow over time consistent with experience with &quot;[[w:system accidents|system accidents]]&quot; in other fields: Managers of complex systems subject to rare, catastrophic failures &quot;learn&quot; from experience that they can take ever greater risks, because they have &quot;safely&quot; done so in the past — until there is a catastrophe:&lt;ref&gt;Kahneman and Klein (2009) found that expert intuition, when it exists, is learned from frequent, rapid, high quality feedback. With anything nuclear, mishaps are so rare that managers develop &quot;expert intuition&quot; that they can &quot;safely&quot; ignore safety concerns -- until there is a catastrophe. See also Sagan (1993).&lt;/ref&gt; 

See also the chapter below on [[/Media Literacy and You/Responding to a nuclear attack/|Responding to a nuclear attack]]. 

===Research on the effectiveness of deterrence and implications=== 

Lebow and others have provided substantial documentation of case studies claiming that leaders are often not rational, and deterrence based on threatening use of military force beyond one’s own borders has been ''as likely to provoke as prevent'' undesired behavior.&lt;ref&gt;Lebow (2025, 2024), Lebow et al. (2023).&lt;/ref&gt; The most obvious portions of this threat can be entirely eliminated by policies clearly and effectively forbidding use of force beyond one’s own borders. This can be signaled in at least three ways: 

* Eliminate all weapon systems like missiles and aircraft with a range of more than, e.g., a hundred miles or 200 kilometers with the possible exception of surveillance only aircraft that cannot be easily configured to carry [[w:Materiel#Military|ordnance]], e.g., explosives. Similarly eliminate nuclear weapons, which few if any countries would want to use for military defense inside their own borders. 

* Supply a national guard and reserves with weapons, training, and rules of engagement that prohibit projecting force beyond one’s own borders. Train them also in development and use of improvised explosive devices and other tactics and devices like low cost military drones. 

:Afghanistan is said to be the &quot;[[w:Graveyard of empires|Graveyard of empires]]&quot;. They defeated the British three times (1839–1842, 1878–1880, 1919), the Soviet Union (1979–1989), and the US (2001–2021). Each victory came with foreign supplies, but any foreign troops helping Afghanis were primarily under the command of local leaders. 
:The [[w:2003 invasion of Iraq|2003 invasion of Iraq]] might have produced [[w:Nation-building|nation-building]] more like the experience of [[w:Nation-building#Germany and Japan after World War II|Germany and Japan after World War II]] if the US had mandated a vigorous adversarial press instead of strict censorship, according to McChesney and Nichols.&lt;ref&gt;McChesney and Nichols (2010, Appendix II. Ike, MacArthur and the Forging of Free and Independent Press, pp. 241-254).&lt;/ref&gt; This claim by McChesney and Nichols was not endorsed by [[News from Germany 1900-1945 and implications for today#After the war in Germany vs. Iraq|University of British Columbia History professor Heidi Tworek]], who said the democratization efforts in Germany and Japan after World War II were more complicated than that implied by that brief discussion by McChesney and Nichols.&lt;ref&gt;The 2025-07-03 interview with Tworek is available at &quot;[[News from Germany 1900-1945 and implications for today]]&quot;, accessed 2026-05-14.&lt;/ref&gt; However, the research by Usher and Kim-Leffingwell (2022) and the related research on news deserts summarized in the preface to this ''[[Media Literacy and You]]'' book largely supports those claims by McChesney and Nichols.
:[[w:Defense industry of Ukraine|Ukraine has become a world leader in military drones]], many of which are dramatically cheaper than alternatives. Most of those have limited range but have been useful for reconnaissance and delivery of ordnance and improving targeting of, e.g., surface to air missiles. 
:[[w:Eliot A. Cohen|Eliot Cohen]], who served as a special advisor to [[w:United States Secretary of State|US Secretary of State]] [[w:Condoleezza Rice|Condoleezza Rice]] from 2007 to 2009, wrote, &quot;As the United States discovered in Iraq and Afghanistan, no matter how large, technologically advanced, and proficient an army is, motivated insurgents can still inflict casualties in the tens of thousands.&quot;&lt;ref&gt;Cohen (2022), cited from Horton (2024, p. 1026).&lt;/ref&gt; Cohen recommended we &quot;Arm the Ukranians now&quot;. Horton said that the neoconservatives learned from Iraq War II and Afghanistan that the US &quot;should fight like those who defeated them.&quot;&lt;ref&gt;Horton (2024, p. 1026).&lt;/ref&gt; 
:Leading economist [[w:Jeffrey Sachs|Jeffrey Sachs]] addressed the European Parliament 2025-02-19, claiming that the tragedy that befell Serbia in 1999 and subsequent US uses of force in Iraq and Syria, plus wars in Africa including Syria, Somalia and Libya and the current wars in Ukraine and the Israel-Hamas war, &quot;are to a very significant extent the result of deeply misguided US policies.&quot;&lt;ref&gt;Sachs (2025-02).&lt;/ref&gt; He said that Europe should craft its own foreign and military policies, independent of the US. ''[[w:Le Monde Diplomatique|Le Monde Diplomatique]]'' noted that Sachs' speech has circulated among social media since ''but has yet to be seriously discussed by major European media.''&lt;ref&gt;Sachs (2025-04; emphasis added).&lt;/ref&gt; 

* Change the laws of government secrecy so government officials cannot secretly interfere in the internal affairs of foreign countries or otherwise project force outside their own borders. This might be achieved in the US in part by requiring anyone with information about questionable actions by government officials to provide such documentation to one or more congressional oversight bodies while also allowing any current or former government employee or contractor to file suit in any US federal jurisdiction if they feel they have been punished for refusing to support questionable activities. In addition, federal judges should be authorized to subpoena classified government documents that may be relevant to any case in their jurisdiction and declassify them subject to appellate review if they believe the national interest would be better served by declassification. 

:If the law is changed without a substantive [[#1. Citizen-directed subsidies for local news nonprofits with a firewall to prevent political interference in the content.|citizen-directed subsidies for local news nonprofits with a firewall to prevent political interference]], as discussed above, the change could be merely cosmetic and unconvincing to local public officials and potential adversaries. 
:Connelly (2023) noted that US government secrecy has in the past encouraged administration officials to do things to provoke actions by foreign entities that can then be denounced as “unprovoked” to stampede the US Congress and the public into supporting counterproductive uses of military force, as discussed above.&lt;ref&gt;See also Connelly et al. (2023).&lt;/ref&gt; A more diverse media culture should make it harder for administration officials to lie to the public and to Congress — and harder to punish government employees who tell their managers that they should not lie to Congress, as they reportedly did to [[#Richard Barlow and nuclear proliferation|Richard Barlow]], mentioned above. 
:The Barlow case and many others explain why the US should, e.g., give federal judges the authority to subpoena classified documents and declassify them if they believe the public good is better served from declassification than continued secrecy.&lt;ref&gt;See, e.g., the 2025-05-08 interview with Seth Stern and Lauren Harper discussing what the &quot;[[Freedom of the Press Foundation says...]]&quot;, Graves (2014), and [[w:Moynihan Commission on Government Secrecy|Moynihan Commission on Government Secrecy]], accessed 2026-05-06. Graves (2021) recommends &quot;Congressional Gold Medals for&quot; Barlow and whistleblowers.&lt;/ref&gt; 

These policies would make it hard for any foreign leader to justify an attack for multiple reasons: First, it would be difficult to convince their supporters that such an attack is necessary. Second, a rational foreign leader might be hesitant to invade a country that is prepared to fight a guerrilla war. Germany reportedly considered invading [[w:Switzerland during World War I and World War II|Switzerland during both World Wars I and II]] and decided against it in part because Switzerland had large, well-trained ready reserves, who were ready to fight. Belgium seemed to be an easier route.&lt;ref&gt;Documented in Wikipedia, &quot;[[w:Switzerland during World War I and World War II|Switzerland during World War I and World War II]]&quot;, accessed 2026-05-06. Switzerland also has many mountains, which make it easier to defend, but the capabilities of the Swiss military also influenced the German decision to avoid Switzerland.&lt;/ref&gt; Third, even if foreign invaders defeat the guerrillas, they should not assume that their invading forces would continue to follow orders. [[w:Rescue of the Danish Jews|Ninety-nine percent of Danish Jews reportedly survived World War II]] because of Danish noncooperation ''supported by a German diplomat''.&lt;ref&gt;Wikipedia, &quot;[[w:Rescue of the Danish Jews|Rescue of the Danish Jews]]&quot;, accessed 2026-05-06.&lt;/ref&gt; 

With policies like these in place, it would be hard for foreign leaders to convince their supporters of a need to attack, as [[w:2022 Russian invasion of Ukraine|Putin did when invading Ukraine in 2022]],&lt;ref&gt;The Wikipedia article on &quot;[[w:2022 Russian invasion of Ukraine|2022 Russian invasion of Ukraine]]&quot;, accessed 2026-05-06, includes a paragraph saying, 'In July 2021, Putin published an essay &quot;On the Historical Unity of Russians and Ukrainians&quot;, in which he called Ukraine &quot;historically Russian lands&quot; and claimed there is &quot;no historical basis&quot; for the &quot;idea of Ukrainian people as a nation separate from the Russians&quot;'. Putin was accused of promoting Russian imperialism, historical revisionism and disinformation. Writing in 2024, Michael McFaul and Robert Person described this essay as representing not only &quot;cynical propaganda&quot; but also Putin's &quot;deeply held and internalized beliefs&quot;. See the Wikipedia article for references supporting those claims.&lt;/ref&gt; as [[w:2025 India–Pakistan crisis|India did when attacking Pakistan in 2025]], and as [[w:Invasion of Poland|Hitler did when invading Poland in 1939]], to name only three examples. 

=== If we continue to base deterrence on threats === 

There are now calls for Europe to get their own nuclear weapons,&lt;ref&gt;Burgard (2025).&lt;/ref&gt; while Iran, Saudi Arabia, Turkey, South Korea and Taiwan have been suggested as other candidates for acquiring nuclear weapons should they feel a sufficient need.&lt;ref&gt;Ruehl (2024).&lt;/ref&gt; 

It is difficult to imagine how the number of nuclear weapon states could be increased without increasing the risks of a nuclear war, consistent with the discussion of &quot;[[w:system accident|system accident]]s&quot; earlier in this chapter.

Secondarily, intelligence services with information on political corruption including attempts to intimidate and murder journalists should not be allowed to keep that information secret: They should be required to find ways to leak that information to journalists. Such attacks on journalists in their own country should be exposed and prosecuted if the evidence seems likely to obtain a conviction. Intelligence services with information about such attacks in other countries should be required to find ways to leak it to competent journalists without identifying their sources and methods: Doing so would likely reduce political corruption worldwide and with that the risks of war. 

=== Call for help === 

Do you, dear reader, know other serious research not cited herein that might improve this analysis? If yes, you can help improve this discussion by adding comments with citations -- or by adding such citation(s) to the &quot;Discuss&quot; page associated with this chapter, suggesting someone else revise the chapter appropriately. 

There are plenty of contrary claims in the major media, but the lead author of this chapter is not aware of any that are based on serious research. 

In the absence of such research, the current author finds it difficult to imagine any national defense policies that carry a greater risk of nuclear Armageddon than our current policies, as discussed in the next chapter of this book on ''[[Media Literacy and You]]'' on &quot;[[Media Literacy and You/Responding to a nuclear attack|Responding to a nuclear attack]]&quot;. That chapter, in sum, claims that the ''worst'' response to a nuclear attack would be nuclear response, because it would escalate a catastrophe killing millions of humans to one killing ''billions'', possibly 80 percent of humanity in a war between the US and Russia that lofts so much smoke from burning cities to the stratosphere where it covers the globe depressing crop yields for years during with 99 percent of the humans in the US, Europe and Russia would starve to death if they did not die of something else sooner. Moreover, the record of &quot;[[w:System accident|system accident]]s&quot; suggests that the chances of such a war before the end of this century is substantially greater than the 40 percent median estimate based on history mentioned in a presentation on &quot;[[Time to nuclear Armageddon]]&quot; delivered to the 2019 Joint Statistical Meetings. 

This chapter is being written in the hopes of inspiring action to improve the prospects for broadly shared peace and prosperity for the long term. 

== Exercises ==

1. Disconfirmation bias: Brainstorm your biggest concerns about a current or possible future war. 
:1.1. Select the one that is of greatest concern to you currently. 
::One issue that may not be a major concern for many but might elicit a broad consensus for action would be a campaign to ask elected officials in the US Congress to explain how we benefit from the provisions of the USA Patriot Act of 2001 that authorize life in prison for teaching nonviolence. 
:1.2. Who are your designated enemies? 
:1.3. Research what your designated enemies are saying about your biggest concern.  
:1.4. Under what circumstances would you support what you see your designated enemies advocating or doing? 
::If you cannot see such circumstances, expand your research: Look for more sources that support your designated enemies. 

2. Interacting: Ask others if you can share what you've learned about that conflict. If they say, &quot;No&quot;, don't push it. If they agree, share what you've learned in a friendly supportive manner without saying that anything is &quot;true&quot;. 

::''Show me someone who knows the truth, and I will show you someone who is dangerous.''

:2.1. The primary goal in this is ''not'' to convince anyone that you are right and they are wrong but to lower the level of anger and increase the level of tolerance for dissenting views. 
:2.2. Another goal is to comfortably enjoy civil conversations of this nature, agreeing to disagree agreeably and building trusting relationships that support collaboration on issues of common concern. 
:2.3. After becoming adept at building collaborations on issues of common concern, you might consider teaching this important skill and approach to issues.  

3. Teaching: Each one teach two, as discussed in the section on &quot;[[Media Literacy and You#Text and self-help book and point of discuss|Text and self-help book and point of discuss]]&quot; in the preface to this book. 
&lt;!--== See also ==--&gt;

== Notes == 
{{reflist}}

== Bibliography == 

* &lt;!--BBC (2022-08-01) &quot;Nuclear annihilation just one miscalculation away, UN chief warns&quot;--&gt;{{cite Q|Q139596165|author=BBC}}
* &lt;!--Elizabeth Black (2026-05-22) &quot;Hegseth hosts first monthly Christian service in Pentagon&quot;--&gt;{{cite Q|Q139791642}}
* &lt;!--Hans Günter Brauch, ed, Towards Rethinking Politics, Policy and Polity in the Anthropocene: Multidisciplinary Perspectives (Springer, pp. 225-234).--&gt;{{cite Q|Q134488491|author= Hans Günter Brauch, ed.}}
* &lt;!--Jan Philipp Burgard (2025-04-08) “Opinion | Europe Needs Its Own Nukes”, Politico--&gt;{{cite Q|Q134465922}}
* &lt;!--Francis X. Clines (1983-06-21) &quot;Reagan says his opponents risk Central American influx&quot;--&gt;{{cite Q|Q139790146}}
* &lt;!--Eliot Cohen (2022-02-23) “Arm the Ukrainians Now”, The Atlantic--&gt;{{cite Q|Q139679796}}
* &lt;!--Albert Fried (1997) McCarthyism: the great American Red scare: a documentary history--&gt;{{cite Q|Q106659308}}
* &lt;!--Matthew Connelly (2023) The Declassification Engine: What History Reveals About America’s Top Secrets (Pantheon).-&gt;{{cite Q|Q116786691}}
* &lt;!--Matthew Connelly, Douglas A. Samuelson, and Spencer Graves (2023-03-14) “Does US government secrecy threaten national security?”, Radio Active Magazine on KKFI--&gt;{{cite Q|Q125582094}}
* &lt;!--Dwight D. Eisenhower (1063)  Mandate for Change--&gt;{{cite Q|Q61945939}}
* &lt;!--Daniel Ellsberg (2017) The Doomsday Machine:  Confessions of a nuclear war planner (Bloomsbury)--&gt;{{cite Q|Q64226035}}
* &lt;!--Spencer Graves (2014-07-18) “Restrict secrecy more than data collection”, San José Peace &amp; Justice Center--&gt;{{cite Q|Q106512569}}
* &lt;!--Spencer Graves (2021-10-28) &quot; Congressional Gold Medals for Assange, Hale, Barlow, Winner, Manning, Edmonds, Sterling, Drake, Snowden, Ellsberg&quot;--&gt;{{cite Q|Q125570226}}
* &lt;!-- Serge Halimi and Serge Halimi (2023-03) &quot;Un an après l'invasion de l'Ukraine, une débâcle du journalisme: Les médias, avant-guarde du parti de la guerre&quot;--&gt;{{cite Q|Q118225389}}
* &lt;!--Scott Horton (2024) Provoked: How Washington Started the New Cold War with Russia and the Catastrophe in Ukraine (Libertarian Inst.)00&gt;{{cite Q|Q139565338}}
* &lt;!--Annie Jacobsen (2024-04-10) &quot;'Nuclear war happens in seconds and minutes, not days and weeks': How I researched the end of the world&quot;--&gt;{{cite Q|Q139596142}}
* &lt;!-- Kahneman and Klein (2009) Conditions for intuitive expertise: a failure to disagree--&gt;{{cite Q|Q35001791}}
* &lt;!--Stanley Karnow (1983)  Vietnam: A History--&gt;{{cite Q|Q108903453}}
* &lt;!--Richard Ned Lebow (2024) “Are Leaders Rational?”, Critical Review, 36:4, 465-482.--&gt;{{cite Q|Q134487607}} 
* &lt;!--Richard Ned Lebow (2025) “Thinking Politically About the Anthropocene”, ch. 5 in Hans Günter Brauch, ed, Towards Rethinking Politics, Policy and Polity in the Anthropocene: Multidisciplinary Perspectives (Springer, pp. 225-234).--&gt;{{cite Q|Q134488569|Author=Richard Ned Lebow}}
* &lt;!--Richard Ned Lebow, Douglas A. Samuelson, and Spencer Graves (2023-11-28), “Richard Ned Lebow on national defense including deterrence”, Radio Active Magazine--&gt;{{cite Q|Q124351846}}
* &lt;!--Jane Mayer (2008) Dark side : the inside story of how the war on terror turned into a war on American ideals (Doubleday)--&gt;{{cite Q|Q1681286}}
* &lt;!--Cybele Mayes-Osterman (2025-12-18) Pete Hegseth pushes his Christian faith in Pentagon prayer services--&gt;{{cite Q|Q139791710}}
* &lt;!--Tom McCarthy (2016-02-07) “Donald Trump: I’d bring back ‘a hell of a lot worse than waterboarding'”, The Guardian--&gt;{{cite Q|Q134462630}}
* &lt;!-- McChesney and Nichols (2010) The Death and Life of American Journalism--&gt;{{cite Q|Q104888067}}
* &lt;!--Stanley A. McChrystal (2013). My share of the task: A memoir (Penguin)--&gt;{{cite Q|Q135406522}}
* &lt;!--Amalendu Misra (2015-11-19) “What does Islamic State actually want?”, The Conversation--&gt;{{cite Q|Q134487571}}
* &lt;!--Nick Mordowanec  (2026-03-03) &quot; Commanders Accused of Framing Iran War as Biblical Mandate, Jesus' 'Return'&quot;--&gt;{{cite Q|Q138840951}}
* &lt;!--John Mueller (2021) The Stupidity of War: American Foreign Policy and the Case for Complacency (Cambridge U. Pr.,)--&gt;{{cite Q|Q113702723}}
* &lt;!--Mueller and Graves (2023-04-06) &quot;The Stupidity of War and the Exaggeration of Threat&quot;--&gt;{{cite Q|Q139789709}}
* &lt;!--Pat Paterson (2008-02) &quot;The Truth About Tonkin&quot;--&gt;{{cite Q|Q133449570}}
* &lt;!--Steven Pinker (2011) The Better Angels of Our Nature: Why Violence Has Declined (Viking Press, pp. 138-139)--&gt;{{cite Q|Q60412312}}
* &lt;!--Paul Romer (2009-07-31) &quot; A Terrible Thing to Waste--&gt;{{cite Q|Q139676537}}
* &lt;!--John P. Ruehl (2025-11-01) “Which Countries Are on the Brink of Going Nuclear?”, Peninsula Peace &amp; Justice Center--&gt;{{cite Q|Q134465827}}
* &lt;!--Jeffrey Sachs (2025-02) “Jeffrey Sachs: Speech at European Parliament on February 19, 2025”: Edited transcript and YouTube video (https://newkontinent.org/jeffrey-sachs-speech-at-european-parliament-on-february-19-2025/)--&gt;{{cite Q|Q134463038}}
* &lt;!--Jeffrey Sachs (2025-04) “File: The trap of major rearmament: Geopolitics of peace (in French: “Dossier : Le piège du grand réarmement: Géopolitique de la paix”), Le Monde Diplomatique (https://www.monde-diplomatique.fr/2025/04/SACHS/68242).--&gt;{{cite Q|Q134463099}}
* &lt;!--Scott Sagan (1993) The limits of safety: Organizations, Accidents, and Nuclear Weapons (Princeton U. Pr.)--&gt;{{cite Q|Q136765429}}
* &lt;!--Amanda Sauer (2016-05-09) &quot;Political Agenda Setting in Early America: The Barbary Wars&quot;--&gt;{{cite Q|Q139589295}}
* &lt;!--Michael Scheuer (2004) Imperial Hubris: Why the West is Losing the War on Terror (Brassey’s).--&gt;{{cite Q|Q6006645}}
* &lt;!--Mark Schmeller (2009) &quot;The Political Economy of Opinion: Public Credit and Concepts of Public Opinion in the Age of Federalism&quot;--&gt;{{cite Q|Q139589348}}
* &lt;!--Jeff Stein (2013-12-04) “The Perils of Whistle-Blowing”, Newsweek--&gt;{{cite Q|Q63257553}}
* &lt;!--David Swanson (2022-03-15) &quot; 30 Nonviolent Things Russia Could Have Done and 30 Nonviolent Things Ukraine Could Do&quot;--&gt;{{cite Q|Q134465808}}
* &lt;!-- Xia et al. (2022) Global food insecurity and famine ... from a nuclear war ...--&gt;{{cite Q| Q113732668}}

[[Category:Media literacy]]
[[Category:Communication]]
[[Category:Political science]]
[[Category:Law]]
[[Category:Psychology]]
[[Category:Sociology]]
[[Category:Armed forces and combat]]
[[Category:Self improvement]]
[[Category:Media Literacy and You]]
&lt;!--
https://en.wikiversity.org/wiki/Category_Review
--&gt;</text>
      <sha1>f53wmfgbd3dc07uhp9ygd9hp2dtfyhm</sha1>
    </revision>
  </page>
  <page>
    <title>Template:Editprotected/doc</title>
    <ns>10</ns>
    <id>329645</id>
    <redirect title="Template:Edit interface-protected/doc" />
    <revision>
      <id>2809848</id>
      <parentid>2809367</parentid>
      <timestamp>2026-05-17T04:01:16Z</timestamp>
      <contributor>
        <username>JackBot</username>
        <id>238563</id>
      </contributor>
      <minor />
      <comment>Bot: Fixing double redirect to [[Template:Edit interface-protected/doc]]</comment>
      <origin>2809848</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="51" sha1="ayc3mrjzs9b64vkj7mjr92og4io4p3u" xml:space="preserve">#REDIRECT [[Template:Edit interface-protected/doc]]</text>
      <sha1>ayc3mrjzs9b64vkj7mjr92og4io4p3u</sha1>
    </revision>
  </page>
  <page>
    <title>File:LCal.9A.Recursion.20260511.pdf</title>
    <ns>6</ns>
    <id>329660</id>
    <revision>
      <id>2809655</id>
      <parentid>2809607</parentid>
      <timestamp>2026-05-16T15:50:48Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>/* Summary */</comment>
      <origin>2809655</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="263" sha1="k019bq1au87cr36zvzv2axf2sr0k4fn" xml:space="preserve">== Summary ==
{{Information
|Description=LCal.9A: Recursion (20260511 - 20260505)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}

== Licensing ==
{{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}</text>
      <sha1>k019bq1au87cr36zvzv2axf2sr0k4fn</sha1>
    </revision>
  </page>
  <page>
    <title>File:VLSI.Arith.2A.CLA.20260516.pdf</title>
    <ns>6</ns>
    <id>329664</id>
    <revision>
      <id>2809645</id>
      <timestamp>2026-05-16T13:47:43Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>{{Information
|Description=Carry Lookahead Adders 2A traditional (20260516- 20260515)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}</comment>
      <origin>2809645</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="281" sha1="4ohhc2yofpzi87ypsh55suix2b7lz5j" xml:space="preserve">== Summary ==
{{Information
|Description=Carry Lookahead Adders 2A traditional (20260516- 20260515)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}

== Licensing ==
{{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}</text>
      <sha1>4ohhc2yofpzi87ypsh55suix2b7lz5j</sha1>
    </revision>
  </page>
  <page>
    <title>File:VLSI.Arith.2B.CLA.20260516.pdf</title>
    <ns>6</ns>
    <id>329665</id>
    <revision>
      <id>2809646</id>
      <timestamp>2026-05-16T13:48:26Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>{{Information
|Description=Carry Lookahead Adders 2B simplified (20260516 - 20260515)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}</comment>
      <origin>2809646</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="281" sha1="9f47vva7qfal5eiqx5cz1hjdhw23pks" xml:space="preserve">== Summary ==
{{Information
|Description=Carry Lookahead Adders 2B simplified (20260516 - 20260515)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}

== Licensing ==
{{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}</text>
      <sha1>9f47vva7qfal5eiqx5cz1hjdhw23pks</sha1>
    </revision>
  </page>
  <page>
    <title>File:C04.SA0.PtrOperator.1A.20260516.pdf</title>
    <ns>6</ns>
    <id>329666</id>
    <revision>
      <id>2809648</id>
      <timestamp>2026-05-16T14:05:33Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>{{Information
|Description=C04.SA0: Address and Dereference Operators (20260516 - 20260515)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}</comment>
      <origin>2809648</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="287" sha1="6xlwpyjipzjep063eus7pxqnjln5imb" xml:space="preserve">== Summary ==
{{Information
|Description=C04.SA0: Address and Dereference Operators (20260516 - 20260515)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}

== Licensing ==
{{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}</text>
      <sha1>6xlwpyjipzjep063eus7pxqnjln5imb</sha1>
    </revision>
  </page>
  <page>
    <title>File:Laurent.5.Permutation.6C.20260516.pdf</title>
    <ns>6</ns>
    <id>329667</id>
    <revision>
      <id>2809650</id>
      <timestamp>2026-05-16T14:06:55Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>{{Information
|Description=Laurent.5: Permutation 6C (2026516 - 20260515)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}</comment>
      <origin>2809650</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="269" sha1="lio4gyb9gfxa0sw0wdpw9rp7vebm39w" xml:space="preserve">== Summary ==
{{Information
|Description=Laurent.5: Permutation 6C (2026516 - 20260515)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}

== Licensing ==
{{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}</text>
      <sha1>lio4gyb9gfxa0sw0wdpw9rp7vebm39w</sha1>
    </revision>
  </page>
  <page>
    <title>File:LCal.9A.Recursion.20260512.pdf</title>
    <ns>6</ns>
    <id>329668</id>
    <revision>
      <id>2809654</id>
      <timestamp>2026-05-16T15:50:12Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>{{Information
|Description=LCal.9A: Recursion (20260512 - 20260511)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}</comment>
      <origin>2809654</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="263" sha1="j5onmvvfo6j54mu9cy1arhmwl9ungs1" xml:space="preserve">== Summary ==
{{Information
|Description=LCal.9A: Recursion (20260512 - 20260511)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}

== Licensing ==
{{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}</text>
      <sha1>j5onmvvfo6j54mu9cy1arhmwl9ungs1</sha1>
    </revision>
  </page>
  <page>
    <title>File:Data.Object.1B.20260511.pdf</title>
    <ns>6</ns>
    <id>329669</id>
    <revision>
      <id>2809657</id>
      <timestamp>2026-05-16T16:12:54Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>{{Information
|Description=Data.1B: Data Object (20260511 - 20260505)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}</comment>
      <origin>2809657</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="264" sha1="0xfn77fq14hc5witcixhsd48vwohliu" xml:space="preserve">== Summary ==
{{Information
|Description=Data.1B: Data Object (20260511 - 20260505)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}
== Licensing ==
{{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}</text>
      <sha1>0xfn77fq14hc5witcixhsd48vwohliu</sha1>
    </revision>
  </page>
  <page>
    <title>File:Data.Object.1B.20260512.pdf</title>
    <ns>6</ns>
    <id>329670</id>
    <revision>
      <id>2809659</id>
      <timestamp>2026-05-16T16:13:44Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>{{Information
|Description=Data.1B: Data Object (20260512 - 20260511)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}</comment>
      <origin>2809659</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="264" sha1="rkereseo6f63wwpuofxhh94g50bu273" xml:space="preserve">== Summary ==
{{Information
|Description=Data.1B: Data Object (20260512 - 20260511)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}
== Licensing ==
{{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}</text>
      <sha1>rkereseo6f63wwpuofxhh94g50bu273</sha1>
    </revision>
  </page>
  <page>
    <title>File:Data.Type.2A.20260511.pdf</title>
    <ns>6</ns>
    <id>329671</id>
    <revision>
      <id>2809661</id>
      <timestamp>2026-05-16T16:37:57Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>{{Information
|Description=Data.2A: Data Type (20260511 - 20260505)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}</comment>
      <origin>2809661</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="263" sha1="h4ucko03r06p04nd6jkb5z4a6pn3wkn" xml:space="preserve">== Summary ==
{{Information
|Description=Data.2A: Data Type (20260511 - 20260505)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}

== Licensing ==
{{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}</text>
      <sha1>h4ucko03r06p04nd6jkb5z4a6pn3wkn</sha1>
    </revision>
  </page>
  <page>
    <title>File:Data.Type.2A.20260512.pdf</title>
    <ns>6</ns>
    <id>329672</id>
    <revision>
      <id>2809663</id>
      <timestamp>2026-05-16T16:39:14Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>{{Information
|Description=Data.2A: Data Type (20260512 - 20260511)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}</comment>
      <origin>2809663</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="263" sha1="8ehq9pna6lbag8rr835yxkrmpjaunb3" xml:space="preserve">== Summary ==
{{Information
|Description=Data.2A: Data Type (20260512 - 20260511)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}

== Licensing ==
{{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}</text>
      <sha1>8ehq9pna6lbag8rr835yxkrmpjaunb3</sha1>
    </revision>
  </page>
  <page>
    <title>File:Data.Type.2B.20260511.pdf</title>
    <ns>6</ns>
    <id>329673</id>
    <revision>
      <id>2809665</id>
      <timestamp>2026-05-16T17:20:28Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>{{Information
|Description=Data.2B: Data Type (20260511 - 20260505)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}</comment>
      <origin>2809665</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="263" sha1="n3bpi9v4d9rs6uc1zpxit387i5dptw1" xml:space="preserve">== Summary ==
{{Information
|Description=Data.2B: Data Type (20260511 - 20260505)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}

== Licensing ==
{{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}</text>
      <sha1>n3bpi9v4d9rs6uc1zpxit387i5dptw1</sha1>
    </revision>
  </page>
  <page>
    <title>File:Data.Type.2B.20260512.pdf</title>
    <ns>6</ns>
    <id>329674</id>
    <revision>
      <id>2809667</id>
      <timestamp>2026-05-16T17:21:45Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>{{Information
|Description=Data.2B: Data Type (20260512 - 20260511)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}</comment>
      <origin>2809667</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="263" sha1="o9srry12j6vijka7ktw5b5vtgjwm9yr" xml:space="preserve">== Summary ==
{{Information
|Description=Data.2B: Data Type (20260512 - 20260511)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}

== Licensing ==
{{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}</text>
      <sha1>o9srry12j6vijka7ktw5b5vtgjwm9yr</sha1>
    </revision>
  </page>
  <page>
    <title>File:Python.Work2.Library.1A.20260511.pdf</title>
    <ns>6</ns>
    <id>329675</id>
    <revision>
      <id>2809669</id>
      <timestamp>2026-05-16T17:48:04Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>{{Information
|Description=Work2.1A: Libraries (20260511 - 20260505)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}</comment>
      <origin>2809669</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="264" sha1="t8lfumdikc0ei9vvgkjfcztrck6ur77" xml:space="preserve">== Summary ==
{{Information
|Description=Work2.1A: Libraries (20260511 - 20260505)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}

== Licensing ==
{{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}</text>
      <sha1>t8lfumdikc0ei9vvgkjfcztrck6ur77</sha1>
    </revision>
  </page>
  <page>
    <title>File:Python.Work2.Library.1A.20260512.pdf</title>
    <ns>6</ns>
    <id>329676</id>
    <revision>
      <id>2809671</id>
      <timestamp>2026-05-16T17:48:58Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>{{Information
|Description=Work2.1A: Libraries (20260512 - 20260511)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}</comment>
      <origin>2809671</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="264" sha1="7d7mwf4rq40z93ee6mzg57x81g8enqs" xml:space="preserve">== Summary ==
{{Information
|Description=Work2.1A: Libraries (20260512 - 20260511)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}

== Licensing ==
{{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}</text>
      <sha1>7d7mwf4rq40z93ee6mzg57x81g8enqs</sha1>
    </revision>
  </page>
  <page>
    <title>Wikiversity:Request custodian action/Archive/30</title>
    <ns>4</ns>
    <id>329678</id>
    <revision>
      <id>2809683</id>
      <timestamp>2026-05-16T19:15:27Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>+</comment>
      <origin>2809683</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="48" sha1="3acejh6h7jut7c0ldccyfz7lexxvhly" xml:space="preserve">{{Archive|Wikiversity:Request custodian action}}</text>
      <sha1>3acejh6h7jut7c0ldccyfz7lexxvhly</sha1>
    </revision>
    <revision>
      <id>2809684</id>
      <parentid>2809683</parentid>
      <timestamp>2026-05-16T19:16:24Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Sidewide count.js */ archive from [[Wikiversity:Request custodian action]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809684</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="522" sha1="1xy1i1y9ntkhaiez8wj5qguebwkuxjc" xml:space="preserve">{{Archive|Wikiversity:Request custodian action}}

== Sidewide count.js ==

i would like something like: [[Template:User contrib count/count.js]]. i created [[Template:User contrib count]] and a user/common.js. {{User contrib count}}.&lt;br&gt;&lt;br&gt; so a &quot;count.js&quot; would complete it. See [[User:Harold Foppele/common.js]].
If an Administrator could help please. Cheers [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 19:22, 18 January 2026 (UTC)</text>
      <sha1>1xy1i1y9ntkhaiez8wj5qguebwkuxjc</sha1>
    </revision>
    <revision>
      <id>2809686</id>
      <parentid>2809684</parentid>
      <timestamp>2026-05-16T19:16:41Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* need to add my profile */ archive from [[Wikiversity:Request custodian action]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809686</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="1656" sha1="t5ppk17dsl7ry2d1le8d860fftmmh2p" xml:space="preserve">{{Archive|Wikiversity:Request custodian action}}

== Sidewide count.js ==

i would like something like: [[Template:User contrib count/count.js]]. i created [[Template:User contrib count]] and a user/common.js. {{User contrib count}}.&lt;br&gt;&lt;br&gt; so a &quot;count.js&quot; would complete it. See [[User:Harold Foppele/common.js]].
If an Administrator could help please. Cheers [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 19:22, 18 January 2026 (UTC)

== need to add my profile ==

im trying to add new profile content  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:03, 4 February 2026 (UTC)

:You can edit it now. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:05, 4 February 2026 (UTC)
::where can create a new one [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)
:::i have created and its in sandbox. i would like to know when it will be approved  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 19:38, 4 February 2026 (UTC)
::::Please don’t create [[wv:spam|spam]] pages as it will be deleted. Please also read [[WV:Scope]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 04:01, 5 February 2026 (UTC)</text>
      <sha1>t5ppk17dsl7ry2d1le8d860fftmmh2p</sha1>
    </revision>
    <revision>
      <id>2809688</id>
      <parentid>2809686</parentid>
      <timestamp>2026-05-16T19:16:54Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Im trying to add new profile while add content its shows not alowed */ archive from [[Wikiversity:Request custodian action]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809688</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="2584" sha1="1b4jov7n5zd73cj1j0qzquqqh2ncm9y" xml:space="preserve">{{Archive|Wikiversity:Request custodian action}}

== Sidewide count.js ==

i would like something like: [[Template:User contrib count/count.js]]. i created [[Template:User contrib count]] and a user/common.js. {{User contrib count}}.&lt;br&gt;&lt;br&gt; so a &quot;count.js&quot; would complete it. See [[User:Harold Foppele/common.js]].
If an Administrator could help please. Cheers [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 19:22, 18 January 2026 (UTC)

== need to add my profile ==

im trying to add new profile content  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:03, 4 February 2026 (UTC)

:You can edit it now. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:05, 4 February 2026 (UTC)
::where can create a new one [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)
:::i have created and its in sandbox. i would like to know when it will be approved  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 19:38, 4 February 2026 (UTC)
::::Please don’t create [[wv:spam|spam]] pages as it will be deleted. Please also read [[WV:Scope]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 04:01, 5 February 2026 (UTC)

== Im trying to add new profile while add content its shows not alowed ==

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Exceeded New Page Limit

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)</text>
      <sha1>1b4jov7n5zd73cj1j0qzquqqh2ncm9y</sha1>
    </revision>
    <revision>
      <id>2809690</id>
      <parentid>2809688</parentid>
      <timestamp>2026-05-16T19:18:59Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* New User: cannot create talk page */ archive from [[Wikiversity:Request custodian action]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809690</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="5045" sha1="9uyway4unegi6wmtnfqndh5vbzkrbgz" xml:space="preserve">{{Archive|Wikiversity:Request custodian action}}

== Sidewide count.js ==

i would like something like: [[Template:User contrib count/count.js]]. i created [[Template:User contrib count]] and a user/common.js. {{User contrib count}}.&lt;br&gt;&lt;br&gt; so a &quot;count.js&quot; would complete it. See [[User:Harold Foppele/common.js]].
If an Administrator could help please. Cheers [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 19:22, 18 January 2026 (UTC)

== need to add my profile ==

im trying to add new profile content  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:03, 4 February 2026 (UTC)

:You can edit it now. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:05, 4 February 2026 (UTC)
::where can create a new one [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)
:::i have created and its in sandbox. i would like to know when it will be approved  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 19:38, 4 February 2026 (UTC)
::::Please don’t create [[wv:spam|spam]] pages as it will be deleted. Please also read [[WV:Scope]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 04:01, 5 February 2026 (UTC)

== Im trying to add new profile while add content its shows not alowed ==

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Exceeded New Page Limit

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)

== New User: cannot create talk page ==

Hi, I am a new user of Wikiversity and I wanted to create a talk page for the article [[ChatGPT's Essay on Kohlberg's Theory: AI's Use in Academic Writing]]. As a new user, I was barred from performing this action. The text that I wanted to add to the talk page is:

&lt;blockquote&gt;
I have doubts as to to the reliability of this essay. Take for rexample the sentence:

&lt;blockquote&gt;
Due to its efficiency, AI has saved 380,000-403,000 lives per year in European healthcare as reported in a recent Deloitte and MedTech Europe report&lt;ref&gt;Dantas, C., Mackiewicz, K., Tageo, V., Jacucci, G., Guardado, D., Ortet, S., Varlamis, I., Maniadakis, M., De Lera, E., Quintas, J., Kocsis, O., &amp; Vassiliou, C. (2021). Benefits and hurdles of AI in the workplace – what comes next? ''International Journal of Artificial Intelligence and Expert Systems, 10'', 9-17. https://www.researchgate.net/publication/351993615_Benefits_and_Hurdles_of_AI_In_The_Workplace_-What_Comes_Next&lt;/ref&gt;.
&lt;/blockquote&gt;

Reading the reference (freely available on ResearchGate), one notes:

# that the reference is from 2021 (predating the widespread use of LLMs such as ChatGPT and the associated 'AI' boom), and
# that the reference factually contradicts this essay.

Quoting from the reference:

&lt;blockquote&gt;
There are enormous benefits of applying AI-based solutions to monitor workers’ health and prevent accidents or, currently, COVID-19 infections, and those benefits are reported with enormous potential. According to the recent Deloitte and MedTech Europe report [11], implementing AI in European healthcare systems could save up 380,000 to 403,000 lives annually or €170.9 to 212.4 billion per year.
&lt;/blockquote&gt;

Not that the reference says ''could save'', not ''saves'' as in the essay.

This calls into question the reliability of the essay.

&lt;/blockquote&gt;

Could an administrator make this addition for me? Thank you! 
{{reflist}}
[[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 06:53, 5 February 2026 (UTC)

:@[[User:Æolus|Æolus]] I have added it for you, you can change the header and sign it now. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 08:05, 5 February 2026 (UTC)
::Thank you! [[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 12:43, 5 February 2026 (UTC)</text>
      <sha1>9uyway4unegi6wmtnfqndh5vbzkrbgz</sha1>
    </revision>
    <revision>
      <id>2809692</id>
      <parentid>2809690</parentid>
      <timestamp>2026-05-16T19:19:25Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Disallowed to add a page on a course */ archive from [[Wikiversity:Request custodian action]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809692</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="5659" sha1="gs03x3uxhqmysxz38n32z8q3gt7h7jx" xml:space="preserve">{{Archive|Wikiversity:Request custodian action}}

== Sidewide count.js ==

i would like something like: [[Template:User contrib count/count.js]]. i created [[Template:User contrib count]] and a user/common.js. {{User contrib count}}.&lt;br&gt;&lt;br&gt; so a &quot;count.js&quot; would complete it. See [[User:Harold Foppele/common.js]].
If an Administrator could help please. Cheers [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 19:22, 18 January 2026 (UTC)

== need to add my profile ==

im trying to add new profile content  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:03, 4 February 2026 (UTC)

:You can edit it now. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:05, 4 February 2026 (UTC)
::where can create a new one [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)
:::i have created and its in sandbox. i would like to know when it will be approved  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 19:38, 4 February 2026 (UTC)
::::Please don’t create [[wv:spam|spam]] pages as it will be deleted. Please also read [[WV:Scope]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 04:01, 5 February 2026 (UTC)

== Im trying to add new profile while add content its shows not alowed ==

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Exceeded New Page Limit

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)

== New User: cannot create talk page ==

Hi, I am a new user of Wikiversity and I wanted to create a talk page for the article [[ChatGPT's Essay on Kohlberg's Theory: AI's Use in Academic Writing]]. As a new user, I was barred from performing this action. The text that I wanted to add to the talk page is:

&lt;blockquote&gt;
I have doubts as to to the reliability of this essay. Take for rexample the sentence:

&lt;blockquote&gt;
Due to its efficiency, AI has saved 380,000-403,000 lives per year in European healthcare as reported in a recent Deloitte and MedTech Europe report&lt;ref&gt;Dantas, C., Mackiewicz, K., Tageo, V., Jacucci, G., Guardado, D., Ortet, S., Varlamis, I., Maniadakis, M., De Lera, E., Quintas, J., Kocsis, O., &amp; Vassiliou, C. (2021). Benefits and hurdles of AI in the workplace – what comes next? ''International Journal of Artificial Intelligence and Expert Systems, 10'', 9-17. https://www.researchgate.net/publication/351993615_Benefits_and_Hurdles_of_AI_In_The_Workplace_-What_Comes_Next&lt;/ref&gt;.
&lt;/blockquote&gt;

Reading the reference (freely available on ResearchGate), one notes:

# that the reference is from 2021 (predating the widespread use of LLMs such as ChatGPT and the associated 'AI' boom), and
# that the reference factually contradicts this essay.

Quoting from the reference:

&lt;blockquote&gt;
There are enormous benefits of applying AI-based solutions to monitor workers’ health and prevent accidents or, currently, COVID-19 infections, and those benefits are reported with enormous potential. According to the recent Deloitte and MedTech Europe report [11], implementing AI in European healthcare systems could save up 380,000 to 403,000 lives annually or €170.9 to 212.4 billion per year.
&lt;/blockquote&gt;

Not that the reference says ''could save'', not ''saves'' as in the essay.

This calls into question the reliability of the essay.

&lt;/blockquote&gt;

Could an administrator make this addition for me? Thank you! 
{{reflist}}
[[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 06:53, 5 February 2026 (UTC)

:@[[User:Æolus|Æolus]] I have added it for you, you can change the header and sign it now. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 08:05, 5 February 2026 (UTC)
::Thank you! [[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 12:43, 5 February 2026 (UTC)

== Disallowed to add a page on a course ==

I'm trying to populate a newly created course on Wikiversity, but it blocks me from creating more pages with &quot;New User Exceeded New Page Limit&quot;. Could this be lifted please? [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 13:21, 15 February 2026 (UTC)

:Sorry! Never mind. I was trying to create a new article instead of a new page. All good now. [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 14:03, 15 February 2026 (UTC)</text>
      <sha1>gs03x3uxhqmysxz38n32z8q3gt7h7jx</sha1>
    </revision>
    <revision>
      <id>2809694</id>
      <parentid>2809692</parentid>
      <timestamp>2026-05-16T19:20:55Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Harold Foppele adding LLM-generated nonsense and personal fiction */ archive from [[Wikiversity:Request custodian action]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809694</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="7645" sha1="mpk4r8corh0b6qddtx2q7kuhyd65o7x" xml:space="preserve">{{Archive|Wikiversity:Request custodian action}}

== Sidewide count.js ==

i would like something like: [[Template:User contrib count/count.js]]. i created [[Template:User contrib count]] and a user/common.js. {{User contrib count}}.&lt;br&gt;&lt;br&gt; so a &quot;count.js&quot; would complete it. See [[User:Harold Foppele/common.js]].
If an Administrator could help please. Cheers [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 19:22, 18 January 2026 (UTC)

== need to add my profile ==

im trying to add new profile content  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:03, 4 February 2026 (UTC)

:You can edit it now. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:05, 4 February 2026 (UTC)
::where can create a new one [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)
:::i have created and its in sandbox. i would like to know when it will be approved  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 19:38, 4 February 2026 (UTC)
::::Please don’t create [[wv:spam|spam]] pages as it will be deleted. Please also read [[WV:Scope]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 04:01, 5 February 2026 (UTC)

== Im trying to add new profile while add content its shows not alowed ==

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Exceeded New Page Limit

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)

== New User: cannot create talk page ==

Hi, I am a new user of Wikiversity and I wanted to create a talk page for the article [[ChatGPT's Essay on Kohlberg's Theory: AI's Use in Academic Writing]]. As a new user, I was barred from performing this action. The text that I wanted to add to the talk page is:

&lt;blockquote&gt;
I have doubts as to to the reliability of this essay. Take for rexample the sentence:

&lt;blockquote&gt;
Due to its efficiency, AI has saved 380,000-403,000 lives per year in European healthcare as reported in a recent Deloitte and MedTech Europe report&lt;ref&gt;Dantas, C., Mackiewicz, K., Tageo, V., Jacucci, G., Guardado, D., Ortet, S., Varlamis, I., Maniadakis, M., De Lera, E., Quintas, J., Kocsis, O., &amp; Vassiliou, C. (2021). Benefits and hurdles of AI in the workplace – what comes next? ''International Journal of Artificial Intelligence and Expert Systems, 10'', 9-17. https://www.researchgate.net/publication/351993615_Benefits_and_Hurdles_of_AI_In_The_Workplace_-What_Comes_Next&lt;/ref&gt;.
&lt;/blockquote&gt;

Reading the reference (freely available on ResearchGate), one notes:

# that the reference is from 2021 (predating the widespread use of LLMs such as ChatGPT and the associated 'AI' boom), and
# that the reference factually contradicts this essay.

Quoting from the reference:

&lt;blockquote&gt;
There are enormous benefits of applying AI-based solutions to monitor workers’ health and prevent accidents or, currently, COVID-19 infections, and those benefits are reported with enormous potential. According to the recent Deloitte and MedTech Europe report [11], implementing AI in European healthcare systems could save up 380,000 to 403,000 lives annually or €170.9 to 212.4 billion per year.
&lt;/blockquote&gt;

Not that the reference says ''could save'', not ''saves'' as in the essay.

This calls into question the reliability of the essay.

&lt;/blockquote&gt;

Could an administrator make this addition for me? Thank you! 
{{reflist}}
[[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 06:53, 5 February 2026 (UTC)

:@[[User:Æolus|Æolus]] I have added it for you, you can change the header and sign it now. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 08:05, 5 February 2026 (UTC)
::Thank you! [[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 12:43, 5 February 2026 (UTC)

== Disallowed to add a page on a course ==

I'm trying to populate a newly created course on Wikiversity, but it blocks me from creating more pages with &quot;New User Exceeded New Page Limit&quot;. Could this be lifted please? [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 13:21, 15 February 2026 (UTC)

:Sorry! Never mind. I was trying to create a new article instead of a new page. All good now. [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 14:03, 15 February 2026 (UTC)

== Harold Foppele adding LLM-generated nonsense and personal fiction ==

I became aware of [[User:Harold Foppele]]'s editing after I deleted some of his uploads on Commons. He appears to be adding a large amount of text and images that are some combination of personal fiction and LLM-generated nonsense. This includes:
*[[Quantum Ultra fast lasers#Future thought experiment|Personal speculative fiction]] in an otherwise &quot;nonfiction&quot; article
*Uploading nonsense LLM-created [[:File:Rontosecond pulse laser (Schematic).jpg|diagrams]] and [[:File:Rontosecond pulse laser (Futuristic).jpg|renders]] for nonexistent lab equipment, with fake source (on Commons, he indicated these files as having been created by him using an LLM)
*Uploading nonsense LLM-created images of equations with obvious artifacts. These images, such as [[:File:Redfield equation (non-Markovian).png]] and [[:File:Lindblad equation (Markovian).png]], don't even match the text he puts them with.
Much of his writing is also of extremely poor quality, to the point where it's not clear whether it's written by him or an LLM. I'm not an active editor on this project, so I'm not as familiar with the standards here, but I believe this is worth custodian attention. [[User:Pi.1415926535|Pi.1415926535]] ([[User talk:Pi.1415926535|discuss]] • [[Special:Contributions/Pi.1415926535|contribs]]) 03:06, 23 February 2026 (UTC)

:Fake source ''and'' contradictory copyright info, claiming both public domain and CC license. Moreover, if they are indeed nearly-direct LLM output, depending on jurisdiction they may not even be eligible for copyright.
:I've put speedy deletion marks for the equations, because they're obviously not coherent mathematical equations (the parentheses don't match, the symbols merge into each other the way text in image models often do, etc) [[User:Sesquilinear|Sesquilinear]] ([[User talk:Sesquilinear|discuss]] • [[Special:Contributions/Sesquilinear|contribs]]) 21:50, 7 March 2026 (UTC)</text>
      <sha1>mpk4r8corh0b6qddtx2q7kuhyd65o7x</sha1>
    </revision>
    <revision>
      <id>2809696</id>
      <parentid>2809694</parentid>
      <timestamp>2026-05-16T19:21:37Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Repeated removal of RFD notices by Harold Foppele */ archive from [[Wikiversity:Request custodian action]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809696</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="8956" sha1="f8cdd74280te08y7wq7sk0xe1l3ej2f" xml:space="preserve">{{Archive|Wikiversity:Request custodian action}}

== Sidewide count.js ==

i would like something like: [[Template:User contrib count/count.js]]. i created [[Template:User contrib count]] and a user/common.js. {{User contrib count}}.&lt;br&gt;&lt;br&gt; so a &quot;count.js&quot; would complete it. See [[User:Harold Foppele/common.js]].
If an Administrator could help please. Cheers [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 19:22, 18 January 2026 (UTC)

== need to add my profile ==

im trying to add new profile content  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:03, 4 February 2026 (UTC)

:You can edit it now. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:05, 4 February 2026 (UTC)
::where can create a new one [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)
:::i have created and its in sandbox. i would like to know when it will be approved  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 19:38, 4 February 2026 (UTC)
::::Please don’t create [[wv:spam|spam]] pages as it will be deleted. Please also read [[WV:Scope]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 04:01, 5 February 2026 (UTC)

== Im trying to add new profile while add content its shows not alowed ==

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Exceeded New Page Limit

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)

== New User: cannot create talk page ==

Hi, I am a new user of Wikiversity and I wanted to create a talk page for the article [[ChatGPT's Essay on Kohlberg's Theory: AI's Use in Academic Writing]]. As a new user, I was barred from performing this action. The text that I wanted to add to the talk page is:

&lt;blockquote&gt;
I have doubts as to to the reliability of this essay. Take for rexample the sentence:

&lt;blockquote&gt;
Due to its efficiency, AI has saved 380,000-403,000 lives per year in European healthcare as reported in a recent Deloitte and MedTech Europe report&lt;ref&gt;Dantas, C., Mackiewicz, K., Tageo, V., Jacucci, G., Guardado, D., Ortet, S., Varlamis, I., Maniadakis, M., De Lera, E., Quintas, J., Kocsis, O., &amp; Vassiliou, C. (2021). Benefits and hurdles of AI in the workplace – what comes next? ''International Journal of Artificial Intelligence and Expert Systems, 10'', 9-17. https://www.researchgate.net/publication/351993615_Benefits_and_Hurdles_of_AI_In_The_Workplace_-What_Comes_Next&lt;/ref&gt;.
&lt;/blockquote&gt;

Reading the reference (freely available on ResearchGate), one notes:

# that the reference is from 2021 (predating the widespread use of LLMs such as ChatGPT and the associated 'AI' boom), and
# that the reference factually contradicts this essay.

Quoting from the reference:

&lt;blockquote&gt;
There are enormous benefits of applying AI-based solutions to monitor workers’ health and prevent accidents or, currently, COVID-19 infections, and those benefits are reported with enormous potential. According to the recent Deloitte and MedTech Europe report [11], implementing AI in European healthcare systems could save up 380,000 to 403,000 lives annually or €170.9 to 212.4 billion per year.
&lt;/blockquote&gt;

Not that the reference says ''could save'', not ''saves'' as in the essay.

This calls into question the reliability of the essay.

&lt;/blockquote&gt;

Could an administrator make this addition for me? Thank you! 
{{reflist}}
[[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 06:53, 5 February 2026 (UTC)

:@[[User:Æolus|Æolus]] I have added it for you, you can change the header and sign it now. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 08:05, 5 February 2026 (UTC)
::Thank you! [[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 12:43, 5 February 2026 (UTC)

== Disallowed to add a page on a course ==

I'm trying to populate a newly created course on Wikiversity, but it blocks me from creating more pages with &quot;New User Exceeded New Page Limit&quot;. Could this be lifted please? [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 13:21, 15 February 2026 (UTC)

:Sorry! Never mind. I was trying to create a new article instead of a new page. All good now. [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 14:03, 15 February 2026 (UTC)

== Harold Foppele adding LLM-generated nonsense and personal fiction ==

I became aware of [[User:Harold Foppele]]'s editing after I deleted some of his uploads on Commons. He appears to be adding a large amount of text and images that are some combination of personal fiction and LLM-generated nonsense. This includes:
*[[Quantum Ultra fast lasers#Future thought experiment|Personal speculative fiction]] in an otherwise &quot;nonfiction&quot; article
*Uploading nonsense LLM-created [[:File:Rontosecond pulse laser (Schematic).jpg|diagrams]] and [[:File:Rontosecond pulse laser (Futuristic).jpg|renders]] for nonexistent lab equipment, with fake source (on Commons, he indicated these files as having been created by him using an LLM)
*Uploading nonsense LLM-created images of equations with obvious artifacts. These images, such as [[:File:Redfield equation (non-Markovian).png]] and [[:File:Lindblad equation (Markovian).png]], don't even match the text he puts them with.
Much of his writing is also of extremely poor quality, to the point where it's not clear whether it's written by him or an LLM. I'm not an active editor on this project, so I'm not as familiar with the standards here, but I believe this is worth custodian attention. [[User:Pi.1415926535|Pi.1415926535]] ([[User talk:Pi.1415926535|discuss]] • [[Special:Contributions/Pi.1415926535|contribs]]) 03:06, 23 February 2026 (UTC)

:Fake source ''and'' contradictory copyright info, claiming both public domain and CC license. Moreover, if they are indeed nearly-direct LLM output, depending on jurisdiction they may not even be eligible for copyright.
:I've put speedy deletion marks for the equations, because they're obviously not coherent mathematical equations (the parentheses don't match, the symbols merge into each other the way text in image models often do, etc) [[User:Sesquilinear|Sesquilinear]] ([[User talk:Sesquilinear|discuss]] • [[Special:Contributions/Sesquilinear|contribs]]) 21:50, 7 March 2026 (UTC)

== Repeated removal of RFD notices by Harold Foppele ==

{{User|Harold Foppele }}

This editor is appearing in multiple noticeboards for behaviour which is contentious. Ther latest adventure is the repeated removal of tye RFD notice at [[Quantum/Henry C. Kapteyn]]. You will see from their contributions record the number of times. I have warned Tham on their user tag page that this is tantaomunt to volunteering to be blocked here. They have a track record of achieving blocks on enWiki and Commons already.

They have all the appearance of shooting not to understand when given direct information about their behaviour, whichever project they are editing, and are fast becoming a time sink. Their behaviour across multiple WMF sites may well lead to a Global Lock, but I do not believe they have quite reached the threshold for that.

I believe that what is required is a preventative block to seek to ensure thatchy understand the seriousness of their behaviour, and the need to be collegial. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 23:03, 4 March 2026 (UTC)
: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:45, 8 March 2026 (UTC)</text>
      <sha1>f8cdd74280te08y7wq7sk0xe1l3ej2f</sha1>
    </revision>
    <revision>
      <id>2809698</id>
      <parentid>2809696</parentid>
      <timestamp>2026-05-16T19:23:41Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Blocks for sockpuppet */ archive from [[Wikiversity:Request custodian action]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809698</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="10352" sha1="8pq5fcmf3wlsafa0n96az0xo551wgk3" xml:space="preserve">{{Archive|Wikiversity:Request custodian action}}

== Sidewide count.js ==

i would like something like: [[Template:User contrib count/count.js]]. i created [[Template:User contrib count]] and a user/common.js. {{User contrib count}}.&lt;br&gt;&lt;br&gt; so a &quot;count.js&quot; would complete it. See [[User:Harold Foppele/common.js]].
If an Administrator could help please. Cheers [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 19:22, 18 January 2026 (UTC)

== need to add my profile ==

im trying to add new profile content  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:03, 4 February 2026 (UTC)

:You can edit it now. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:05, 4 February 2026 (UTC)
::where can create a new one [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)
:::i have created and its in sandbox. i would like to know when it will be approved  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 19:38, 4 February 2026 (UTC)
::::Please don’t create [[wv:spam|spam]] pages as it will be deleted. Please also read [[WV:Scope]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 04:01, 5 February 2026 (UTC)

== Im trying to add new profile while add content its shows not alowed ==

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Exceeded New Page Limit

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)

== New User: cannot create talk page ==

Hi, I am a new user of Wikiversity and I wanted to create a talk page for the article [[ChatGPT's Essay on Kohlberg's Theory: AI's Use in Academic Writing]]. As a new user, I was barred from performing this action. The text that I wanted to add to the talk page is:

&lt;blockquote&gt;
I have doubts as to to the reliability of this essay. Take for rexample the sentence:

&lt;blockquote&gt;
Due to its efficiency, AI has saved 380,000-403,000 lives per year in European healthcare as reported in a recent Deloitte and MedTech Europe report&lt;ref&gt;Dantas, C., Mackiewicz, K., Tageo, V., Jacucci, G., Guardado, D., Ortet, S., Varlamis, I., Maniadakis, M., De Lera, E., Quintas, J., Kocsis, O., &amp; Vassiliou, C. (2021). Benefits and hurdles of AI in the workplace – what comes next? ''International Journal of Artificial Intelligence and Expert Systems, 10'', 9-17. https://www.researchgate.net/publication/351993615_Benefits_and_Hurdles_of_AI_In_The_Workplace_-What_Comes_Next&lt;/ref&gt;.
&lt;/blockquote&gt;

Reading the reference (freely available on ResearchGate), one notes:

# that the reference is from 2021 (predating the widespread use of LLMs such as ChatGPT and the associated 'AI' boom), and
# that the reference factually contradicts this essay.

Quoting from the reference:

&lt;blockquote&gt;
There are enormous benefits of applying AI-based solutions to monitor workers’ health and prevent accidents or, currently, COVID-19 infections, and those benefits are reported with enormous potential. According to the recent Deloitte and MedTech Europe report [11], implementing AI in European healthcare systems could save up 380,000 to 403,000 lives annually or €170.9 to 212.4 billion per year.
&lt;/blockquote&gt;

Not that the reference says ''could save'', not ''saves'' as in the essay.

This calls into question the reliability of the essay.

&lt;/blockquote&gt;

Could an administrator make this addition for me? Thank you! 
{{reflist}}
[[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 06:53, 5 February 2026 (UTC)

:@[[User:Æolus|Æolus]] I have added it for you, you can change the header and sign it now. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 08:05, 5 February 2026 (UTC)
::Thank you! [[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 12:43, 5 February 2026 (UTC)

== Disallowed to add a page on a course ==

I'm trying to populate a newly created course on Wikiversity, but it blocks me from creating more pages with &quot;New User Exceeded New Page Limit&quot;. Could this be lifted please? [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 13:21, 15 February 2026 (UTC)

:Sorry! Never mind. I was trying to create a new article instead of a new page. All good now. [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 14:03, 15 February 2026 (UTC)

== Harold Foppele adding LLM-generated nonsense and personal fiction ==

I became aware of [[User:Harold Foppele]]'s editing after I deleted some of his uploads on Commons. He appears to be adding a large amount of text and images that are some combination of personal fiction and LLM-generated nonsense. This includes:
*[[Quantum Ultra fast lasers#Future thought experiment|Personal speculative fiction]] in an otherwise &quot;nonfiction&quot; article
*Uploading nonsense LLM-created [[:File:Rontosecond pulse laser (Schematic).jpg|diagrams]] and [[:File:Rontosecond pulse laser (Futuristic).jpg|renders]] for nonexistent lab equipment, with fake source (on Commons, he indicated these files as having been created by him using an LLM)
*Uploading nonsense LLM-created images of equations with obvious artifacts. These images, such as [[:File:Redfield equation (non-Markovian).png]] and [[:File:Lindblad equation (Markovian).png]], don't even match the text he puts them with.
Much of his writing is also of extremely poor quality, to the point where it's not clear whether it's written by him or an LLM. I'm not an active editor on this project, so I'm not as familiar with the standards here, but I believe this is worth custodian attention. [[User:Pi.1415926535|Pi.1415926535]] ([[User talk:Pi.1415926535|discuss]] • [[Special:Contributions/Pi.1415926535|contribs]]) 03:06, 23 February 2026 (UTC)

:Fake source ''and'' contradictory copyright info, claiming both public domain and CC license. Moreover, if they are indeed nearly-direct LLM output, depending on jurisdiction they may not even be eligible for copyright.
:I've put speedy deletion marks for the equations, because they're obviously not coherent mathematical equations (the parentheses don't match, the symbols merge into each other the way text in image models often do, etc) [[User:Sesquilinear|Sesquilinear]] ([[User talk:Sesquilinear|discuss]] • [[Special:Contributions/Sesquilinear|contribs]]) 21:50, 7 March 2026 (UTC)

== Repeated removal of RFD notices by Harold Foppele ==

{{User|Harold Foppele }}

This editor is appearing in multiple noticeboards for behaviour which is contentious. Ther latest adventure is the repeated removal of tye RFD notice at [[Quantum/Henry C. Kapteyn]]. You will see from their contributions record the number of times. I have warned Tham on their user tag page that this is tantaomunt to volunteering to be blocked here. They have a track record of achieving blocks on enWiki and Commons already.

They have all the appearance of shooting not to understand when given direct information about their behaviour, whichever project they are editing, and are fast becoming a time sink. Their behaviour across multiple WMF sites may well lead to a Global Lock, but I do not believe they have quite reached the threshold for that.

I believe that what is required is a preventative block to seek to ensure thatchy understand the seriousness of their behaviour, and the need to be collegial. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 23:03, 4 March 2026 (UTC)
: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:45, 8 March 2026 (UTC)

== Blocks for sockpuppet ==

Please block [[User:Harold Foppele]] and [[User:Johnwilliamsiii]] for sockpuppetry based on [https://en.wikipedia.org/wiki/Wikipedia:Sockpuppet_investigations/Harold_Foppele en wiki] CU and [https://commons.wikimedia.org/w/index.php?diff=1177465640 commons] CU investigations. The user has also violated copyright, see the above discussion. A block is necessary to prevent further abuse. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:30, 8 March 2026 (UTC)

:&lt;small&gt;@[[User:MathXplore|MathXplore]]&lt;/small&gt; [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:31, 8 March 2026 (UTC)
:: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:44, 8 March 2026 (UTC)
:CC. @[[User:Timtrent|Timtrent]], @[[User:Sesquilinear|Sesquilinear]], @[[User:Pi.1415926535|Pi.1415926535]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:33, 8 March 2026 (UTC)
::Thank you for the ping. I concur based on [[w:en:WP:DUCK|behaviour]]. CUs appear divided. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 11:41, 8 March 2026 (UTC)</text>
      <sha1>8pq5fcmf3wlsafa0n96az0xo551wgk3</sha1>
    </revision>
    <revision>
      <id>2809700</id>
      <parentid>2809698</parentid>
      <timestamp>2026-05-16T19:23:49Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Problem when trying to start a discussion with authors of the Plurilingual education portal */ archive from [[Wikiversity:Request custodian action]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809700</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="11070" sha1="7cakxnye2rf6aeackue9geq6f2rr0wm" xml:space="preserve">{{Archive|Wikiversity:Request custodian action}}

== Sidewide count.js ==

i would like something like: [[Template:User contrib count/count.js]]. i created [[Template:User contrib count]] and a user/common.js. {{User contrib count}}.&lt;br&gt;&lt;br&gt; so a &quot;count.js&quot; would complete it. See [[User:Harold Foppele/common.js]].
If an Administrator could help please. Cheers [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 19:22, 18 January 2026 (UTC)

== need to add my profile ==

im trying to add new profile content  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:03, 4 February 2026 (UTC)

:You can edit it now. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:05, 4 February 2026 (UTC)
::where can create a new one [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)
:::i have created and its in sandbox. i would like to know when it will be approved  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 19:38, 4 February 2026 (UTC)
::::Please don’t create [[wv:spam|spam]] pages as it will be deleted. Please also read [[WV:Scope]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 04:01, 5 February 2026 (UTC)

== Im trying to add new profile while add content its shows not alowed ==

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Exceeded New Page Limit

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)

== New User: cannot create talk page ==

Hi, I am a new user of Wikiversity and I wanted to create a talk page for the article [[ChatGPT's Essay on Kohlberg's Theory: AI's Use in Academic Writing]]. As a new user, I was barred from performing this action. The text that I wanted to add to the talk page is:

&lt;blockquote&gt;
I have doubts as to to the reliability of this essay. Take for rexample the sentence:

&lt;blockquote&gt;
Due to its efficiency, AI has saved 380,000-403,000 lives per year in European healthcare as reported in a recent Deloitte and MedTech Europe report&lt;ref&gt;Dantas, C., Mackiewicz, K., Tageo, V., Jacucci, G., Guardado, D., Ortet, S., Varlamis, I., Maniadakis, M., De Lera, E., Quintas, J., Kocsis, O., &amp; Vassiliou, C. (2021). Benefits and hurdles of AI in the workplace – what comes next? ''International Journal of Artificial Intelligence and Expert Systems, 10'', 9-17. https://www.researchgate.net/publication/351993615_Benefits_and_Hurdles_of_AI_In_The_Workplace_-What_Comes_Next&lt;/ref&gt;.
&lt;/blockquote&gt;

Reading the reference (freely available on ResearchGate), one notes:

# that the reference is from 2021 (predating the widespread use of LLMs such as ChatGPT and the associated 'AI' boom), and
# that the reference factually contradicts this essay.

Quoting from the reference:

&lt;blockquote&gt;
There are enormous benefits of applying AI-based solutions to monitor workers’ health and prevent accidents or, currently, COVID-19 infections, and those benefits are reported with enormous potential. According to the recent Deloitte and MedTech Europe report [11], implementing AI in European healthcare systems could save up 380,000 to 403,000 lives annually or €170.9 to 212.4 billion per year.
&lt;/blockquote&gt;

Not that the reference says ''could save'', not ''saves'' as in the essay.

This calls into question the reliability of the essay.

&lt;/blockquote&gt;

Could an administrator make this addition for me? Thank you! 
{{reflist}}
[[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 06:53, 5 February 2026 (UTC)

:@[[User:Æolus|Æolus]] I have added it for you, you can change the header and sign it now. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 08:05, 5 February 2026 (UTC)
::Thank you! [[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 12:43, 5 February 2026 (UTC)

== Disallowed to add a page on a course ==

I'm trying to populate a newly created course on Wikiversity, but it blocks me from creating more pages with &quot;New User Exceeded New Page Limit&quot;. Could this be lifted please? [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 13:21, 15 February 2026 (UTC)

:Sorry! Never mind. I was trying to create a new article instead of a new page. All good now. [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 14:03, 15 February 2026 (UTC)

== Harold Foppele adding LLM-generated nonsense and personal fiction ==

I became aware of [[User:Harold Foppele]]'s editing after I deleted some of his uploads on Commons. He appears to be adding a large amount of text and images that are some combination of personal fiction and LLM-generated nonsense. This includes:
*[[Quantum Ultra fast lasers#Future thought experiment|Personal speculative fiction]] in an otherwise &quot;nonfiction&quot; article
*Uploading nonsense LLM-created [[:File:Rontosecond pulse laser (Schematic).jpg|diagrams]] and [[:File:Rontosecond pulse laser (Futuristic).jpg|renders]] for nonexistent lab equipment, with fake source (on Commons, he indicated these files as having been created by him using an LLM)
*Uploading nonsense LLM-created images of equations with obvious artifacts. These images, such as [[:File:Redfield equation (non-Markovian).png]] and [[:File:Lindblad equation (Markovian).png]], don't even match the text he puts them with.
Much of his writing is also of extremely poor quality, to the point where it's not clear whether it's written by him or an LLM. I'm not an active editor on this project, so I'm not as familiar with the standards here, but I believe this is worth custodian attention. [[User:Pi.1415926535|Pi.1415926535]] ([[User talk:Pi.1415926535|discuss]] • [[Special:Contributions/Pi.1415926535|contribs]]) 03:06, 23 February 2026 (UTC)

:Fake source ''and'' contradictory copyright info, claiming both public domain and CC license. Moreover, if they are indeed nearly-direct LLM output, depending on jurisdiction they may not even be eligible for copyright.
:I've put speedy deletion marks for the equations, because they're obviously not coherent mathematical equations (the parentheses don't match, the symbols merge into each other the way text in image models often do, etc) [[User:Sesquilinear|Sesquilinear]] ([[User talk:Sesquilinear|discuss]] • [[Special:Contributions/Sesquilinear|contribs]]) 21:50, 7 March 2026 (UTC)

== Repeated removal of RFD notices by Harold Foppele ==

{{User|Harold Foppele }}

This editor is appearing in multiple noticeboards for behaviour which is contentious. Ther latest adventure is the repeated removal of tye RFD notice at [[Quantum/Henry C. Kapteyn]]. You will see from their contributions record the number of times. I have warned Tham on their user tag page that this is tantaomunt to volunteering to be blocked here. They have a track record of achieving blocks on enWiki and Commons already.

They have all the appearance of shooting not to understand when given direct information about their behaviour, whichever project they are editing, and are fast becoming a time sink. Their behaviour across multiple WMF sites may well lead to a Global Lock, but I do not believe they have quite reached the threshold for that.

I believe that what is required is a preventative block to seek to ensure thatchy understand the seriousness of their behaviour, and the need to be collegial. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 23:03, 4 March 2026 (UTC)
: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:45, 8 March 2026 (UTC)

== Blocks for sockpuppet ==

Please block [[User:Harold Foppele]] and [[User:Johnwilliamsiii]] for sockpuppetry based on [https://en.wikipedia.org/wiki/Wikipedia:Sockpuppet_investigations/Harold_Foppele en wiki] CU and [https://commons.wikimedia.org/w/index.php?diff=1177465640 commons] CU investigations. The user has also violated copyright, see the above discussion. A block is necessary to prevent further abuse. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:30, 8 March 2026 (UTC)

:&lt;small&gt;@[[User:MathXplore|MathXplore]]&lt;/small&gt; [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:31, 8 March 2026 (UTC)
:: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:44, 8 March 2026 (UTC)
:CC. @[[User:Timtrent|Timtrent]], @[[User:Sesquilinear|Sesquilinear]], @[[User:Pi.1415926535|Pi.1415926535]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:33, 8 March 2026 (UTC)
::Thank you for the ping. I concur based on [[w:en:WP:DUCK|behaviour]]. CUs appear divided. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 11:41, 8 March 2026 (UTC)

== Problem when trying to start a discussion with authors of the Plurilingual education portal ==

The authors I wanted to discuss with are called &quot;Project PEP&quot; and my name is Franch Chandler. How can I be allowed to do so ? [[User:French Chandler|French Chandler]] ([[User talk:French Chandler|discuss]] • [[Special:Contributions/French Chandler|contribs]]) 18:25, 16 March 2026 (UTC)

:@[[User:French Chandler|French Chandler]] place your qestion [https://en.wikiversity.org/w/index.php?title=User_talk:Projet_PEP&amp;action=edit into the dialog box] on this link and hit Publish page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:22, 16 March 2026 (UTC)</text>
      <sha1>7cakxnye2rf6aeackue9geq6f2rr0wm</sha1>
    </revision>
    <revision>
      <id>2809702</id>
      <parentid>2809700</parentid>
      <timestamp>2026-05-16T19:24:05Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Please publish my post */ archive from [[Wikiversity:Request custodian action]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809702</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="13164" sha1="iiqoalw5ywdcsd49jvoxltk0k3u3xhh" xml:space="preserve">{{Archive|Wikiversity:Request custodian action}}

== Sidewide count.js ==

i would like something like: [[Template:User contrib count/count.js]]. i created [[Template:User contrib count]] and a user/common.js. {{User contrib count}}.&lt;br&gt;&lt;br&gt; so a &quot;count.js&quot; would complete it. See [[User:Harold Foppele/common.js]].
If an Administrator could help please. Cheers [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 19:22, 18 January 2026 (UTC)

== need to add my profile ==

im trying to add new profile content  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:03, 4 February 2026 (UTC)

:You can edit it now. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:05, 4 February 2026 (UTC)
::where can create a new one [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)
:::i have created and its in sandbox. i would like to know when it will be approved  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 19:38, 4 February 2026 (UTC)
::::Please don’t create [[wv:spam|spam]] pages as it will be deleted. Please also read [[WV:Scope]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 04:01, 5 February 2026 (UTC)

== Im trying to add new profile while add content its shows not alowed ==

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Exceeded New Page Limit

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)

== New User: cannot create talk page ==

Hi, I am a new user of Wikiversity and I wanted to create a talk page for the article [[ChatGPT's Essay on Kohlberg's Theory: AI's Use in Academic Writing]]. As a new user, I was barred from performing this action. The text that I wanted to add to the talk page is:

&lt;blockquote&gt;
I have doubts as to to the reliability of this essay. Take for rexample the sentence:

&lt;blockquote&gt;
Due to its efficiency, AI has saved 380,000-403,000 lives per year in European healthcare as reported in a recent Deloitte and MedTech Europe report&lt;ref&gt;Dantas, C., Mackiewicz, K., Tageo, V., Jacucci, G., Guardado, D., Ortet, S., Varlamis, I., Maniadakis, M., De Lera, E., Quintas, J., Kocsis, O., &amp; Vassiliou, C. (2021). Benefits and hurdles of AI in the workplace – what comes next? ''International Journal of Artificial Intelligence and Expert Systems, 10'', 9-17. https://www.researchgate.net/publication/351993615_Benefits_and_Hurdles_of_AI_In_The_Workplace_-What_Comes_Next&lt;/ref&gt;.
&lt;/blockquote&gt;

Reading the reference (freely available on ResearchGate), one notes:

# that the reference is from 2021 (predating the widespread use of LLMs such as ChatGPT and the associated 'AI' boom), and
# that the reference factually contradicts this essay.

Quoting from the reference:

&lt;blockquote&gt;
There are enormous benefits of applying AI-based solutions to monitor workers’ health and prevent accidents or, currently, COVID-19 infections, and those benefits are reported with enormous potential. According to the recent Deloitte and MedTech Europe report [11], implementing AI in European healthcare systems could save up 380,000 to 403,000 lives annually or €170.9 to 212.4 billion per year.
&lt;/blockquote&gt;

Not that the reference says ''could save'', not ''saves'' as in the essay.

This calls into question the reliability of the essay.

&lt;/blockquote&gt;

Could an administrator make this addition for me? Thank you! 
{{reflist}}
[[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 06:53, 5 February 2026 (UTC)

:@[[User:Æolus|Æolus]] I have added it for you, you can change the header and sign it now. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 08:05, 5 February 2026 (UTC)
::Thank you! [[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 12:43, 5 February 2026 (UTC)

== Disallowed to add a page on a course ==

I'm trying to populate a newly created course on Wikiversity, but it blocks me from creating more pages with &quot;New User Exceeded New Page Limit&quot;. Could this be lifted please? [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 13:21, 15 February 2026 (UTC)

:Sorry! Never mind. I was trying to create a new article instead of a new page. All good now. [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 14:03, 15 February 2026 (UTC)

== Harold Foppele adding LLM-generated nonsense and personal fiction ==

I became aware of [[User:Harold Foppele]]'s editing after I deleted some of his uploads on Commons. He appears to be adding a large amount of text and images that are some combination of personal fiction and LLM-generated nonsense. This includes:
*[[Quantum Ultra fast lasers#Future thought experiment|Personal speculative fiction]] in an otherwise &quot;nonfiction&quot; article
*Uploading nonsense LLM-created [[:File:Rontosecond pulse laser (Schematic).jpg|diagrams]] and [[:File:Rontosecond pulse laser (Futuristic).jpg|renders]] for nonexistent lab equipment, with fake source (on Commons, he indicated these files as having been created by him using an LLM)
*Uploading nonsense LLM-created images of equations with obvious artifacts. These images, such as [[:File:Redfield equation (non-Markovian).png]] and [[:File:Lindblad equation (Markovian).png]], don't even match the text he puts them with.
Much of his writing is also of extremely poor quality, to the point where it's not clear whether it's written by him or an LLM. I'm not an active editor on this project, so I'm not as familiar with the standards here, but I believe this is worth custodian attention. [[User:Pi.1415926535|Pi.1415926535]] ([[User talk:Pi.1415926535|discuss]] • [[Special:Contributions/Pi.1415926535|contribs]]) 03:06, 23 February 2026 (UTC)

:Fake source ''and'' contradictory copyright info, claiming both public domain and CC license. Moreover, if they are indeed nearly-direct LLM output, depending on jurisdiction they may not even be eligible for copyright.
:I've put speedy deletion marks for the equations, because they're obviously not coherent mathematical equations (the parentheses don't match, the symbols merge into each other the way text in image models often do, etc) [[User:Sesquilinear|Sesquilinear]] ([[User talk:Sesquilinear|discuss]] • [[Special:Contributions/Sesquilinear|contribs]]) 21:50, 7 March 2026 (UTC)

== Repeated removal of RFD notices by Harold Foppele ==

{{User|Harold Foppele }}

This editor is appearing in multiple noticeboards for behaviour which is contentious. Ther latest adventure is the repeated removal of tye RFD notice at [[Quantum/Henry C. Kapteyn]]. You will see from their contributions record the number of times. I have warned Tham on their user tag page that this is tantaomunt to volunteering to be blocked here. They have a track record of achieving blocks on enWiki and Commons already.

They have all the appearance of shooting not to understand when given direct information about their behaviour, whichever project they are editing, and are fast becoming a time sink. Their behaviour across multiple WMF sites may well lead to a Global Lock, but I do not believe they have quite reached the threshold for that.

I believe that what is required is a preventative block to seek to ensure thatchy understand the seriousness of their behaviour, and the need to be collegial. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 23:03, 4 March 2026 (UTC)
: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:45, 8 March 2026 (UTC)

== Blocks for sockpuppet ==

Please block [[User:Harold Foppele]] and [[User:Johnwilliamsiii]] for sockpuppetry based on [https://en.wikipedia.org/wiki/Wikipedia:Sockpuppet_investigations/Harold_Foppele en wiki] CU and [https://commons.wikimedia.org/w/index.php?diff=1177465640 commons] CU investigations. The user has also violated copyright, see the above discussion. A block is necessary to prevent further abuse. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:30, 8 March 2026 (UTC)

:&lt;small&gt;@[[User:MathXplore|MathXplore]]&lt;/small&gt; [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:31, 8 March 2026 (UTC)
:: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:44, 8 March 2026 (UTC)
:CC. @[[User:Timtrent|Timtrent]], @[[User:Sesquilinear|Sesquilinear]], @[[User:Pi.1415926535|Pi.1415926535]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:33, 8 March 2026 (UTC)
::Thank you for the ping. I concur based on [[w:en:WP:DUCK|behaviour]]. CUs appear divided. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 11:41, 8 March 2026 (UTC)

== Problem when trying to start a discussion with authors of the Plurilingual education portal ==

The authors I wanted to discuss with are called &quot;Project PEP&quot; and my name is Franch Chandler. How can I be allowed to do so ? [[User:French Chandler|French Chandler]] ([[User talk:French Chandler|discuss]] • [[Special:Contributions/French Chandler|contribs]]) 18:25, 16 March 2026 (UTC)

:@[[User:French Chandler|French Chandler]] place your qestion [https://en.wikiversity.org/w/index.php?title=User_talk:Projet_PEP&amp;action=edit into the dialog box] on this link and hit Publish page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:22, 16 March 2026 (UTC)

== Please publish my post ==

My post is about &quot;Every child grows and develops at their own pace, but some may experience challenges that affect their ability to perform everyday tasks. These challenges can include difficulties with fine motor skills, sensory processing, handwriting, feeding, and self-regulation. When these issues are not addressed early, they can impact a child’s confidence, academic performance, and independence.

With the rise of digital healthcare services, '''online physical therapy''' has emerged as a powerful and accessible solution for parents seeking support for their children. This modern approach provides structured, personalized therapy programs that can be accessed from the comfort of home, making it easier for families to ensure consistent care.&quot; [[User:Skyabovetherapy|Skyabovetherapy]] ([[User talk:Skyabovetherapy|discuss]] • [[Special:Contributions/Skyabovetherapy|contribs]]) 12:28, 28 March 2026 (UTC)

:@[[User:Skyabovetherapy|Skyabovetherapy]] Well, you can publish it yourself, Wikiversity is a free environement, where everybody can create educational resources. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 14:11, 29 March 2026 (UTC)
::They actually triggered some abuse filters. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 16:24, 29 March 2026 (UTC)
:I looked at your attempts to add this text and I see a link to one website repeated many times, which reminds me of the misuse of Wikiversity for self-promotion or to increase the importance of the website. It is necessary to remind you here that Wikiversity is not a place for promotion, but a place for education. So if you want to educate, it will not be a problem to create the page without external links with a clearly defined procedure for how people should use it and what to expect from it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:07, 1 April 2026 (UTC)</text>
      <sha1>iiqoalw5ywdcsd49jvoxltk0k3u3xhh</sha1>
    </revision>
    <revision>
      <id>2809704</id>
      <parentid>2809702</parentid>
      <timestamp>2026-05-16T19:24:19Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* New user limit */ archive from [[Wikiversity:Request custodian action]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809704</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="19967" sha1="qwygbck7t5gn0ce7995w2tuv19wcz59" xml:space="preserve">{{Archive|Wikiversity:Request custodian action}}

== Sidewide count.js ==

i would like something like: [[Template:User contrib count/count.js]]. i created [[Template:User contrib count]] and a user/common.js. {{User contrib count}}.&lt;br&gt;&lt;br&gt; so a &quot;count.js&quot; would complete it. See [[User:Harold Foppele/common.js]].
If an Administrator could help please. Cheers [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 19:22, 18 January 2026 (UTC)

== need to add my profile ==

im trying to add new profile content  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:03, 4 February 2026 (UTC)

:You can edit it now. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:05, 4 February 2026 (UTC)
::where can create a new one [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)
:::i have created and its in sandbox. i would like to know when it will be approved  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 19:38, 4 February 2026 (UTC)
::::Please don’t create [[wv:spam|spam]] pages as it will be deleted. Please also read [[WV:Scope]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 04:01, 5 February 2026 (UTC)

== Im trying to add new profile while add content its shows not alowed ==

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Exceeded New Page Limit

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)

== New User: cannot create talk page ==

Hi, I am a new user of Wikiversity and I wanted to create a talk page for the article [[ChatGPT's Essay on Kohlberg's Theory: AI's Use in Academic Writing]]. As a new user, I was barred from performing this action. The text that I wanted to add to the talk page is:

&lt;blockquote&gt;
I have doubts as to to the reliability of this essay. Take for rexample the sentence:

&lt;blockquote&gt;
Due to its efficiency, AI has saved 380,000-403,000 lives per year in European healthcare as reported in a recent Deloitte and MedTech Europe report&lt;ref&gt;Dantas, C., Mackiewicz, K., Tageo, V., Jacucci, G., Guardado, D., Ortet, S., Varlamis, I., Maniadakis, M., De Lera, E., Quintas, J., Kocsis, O., &amp; Vassiliou, C. (2021). Benefits and hurdles of AI in the workplace – what comes next? ''International Journal of Artificial Intelligence and Expert Systems, 10'', 9-17. https://www.researchgate.net/publication/351993615_Benefits_and_Hurdles_of_AI_In_The_Workplace_-What_Comes_Next&lt;/ref&gt;.
&lt;/blockquote&gt;

Reading the reference (freely available on ResearchGate), one notes:

# that the reference is from 2021 (predating the widespread use of LLMs such as ChatGPT and the associated 'AI' boom), and
# that the reference factually contradicts this essay.

Quoting from the reference:

&lt;blockquote&gt;
There are enormous benefits of applying AI-based solutions to monitor workers’ health and prevent accidents or, currently, COVID-19 infections, and those benefits are reported with enormous potential. According to the recent Deloitte and MedTech Europe report [11], implementing AI in European healthcare systems could save up 380,000 to 403,000 lives annually or €170.9 to 212.4 billion per year.
&lt;/blockquote&gt;

Not that the reference says ''could save'', not ''saves'' as in the essay.

This calls into question the reliability of the essay.

&lt;/blockquote&gt;

Could an administrator make this addition for me? Thank you! 
{{reflist}}
[[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 06:53, 5 February 2026 (UTC)

:@[[User:Æolus|Æolus]] I have added it for you, you can change the header and sign it now. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 08:05, 5 February 2026 (UTC)
::Thank you! [[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 12:43, 5 February 2026 (UTC)

== Disallowed to add a page on a course ==

I'm trying to populate a newly created course on Wikiversity, but it blocks me from creating more pages with &quot;New User Exceeded New Page Limit&quot;. Could this be lifted please? [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 13:21, 15 February 2026 (UTC)

:Sorry! Never mind. I was trying to create a new article instead of a new page. All good now. [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 14:03, 15 February 2026 (UTC)

== Harold Foppele adding LLM-generated nonsense and personal fiction ==

I became aware of [[User:Harold Foppele]]'s editing after I deleted some of his uploads on Commons. He appears to be adding a large amount of text and images that are some combination of personal fiction and LLM-generated nonsense. This includes:
*[[Quantum Ultra fast lasers#Future thought experiment|Personal speculative fiction]] in an otherwise &quot;nonfiction&quot; article
*Uploading nonsense LLM-created [[:File:Rontosecond pulse laser (Schematic).jpg|diagrams]] and [[:File:Rontosecond pulse laser (Futuristic).jpg|renders]] for nonexistent lab equipment, with fake source (on Commons, he indicated these files as having been created by him using an LLM)
*Uploading nonsense LLM-created images of equations with obvious artifacts. These images, such as [[:File:Redfield equation (non-Markovian).png]] and [[:File:Lindblad equation (Markovian).png]], don't even match the text he puts them with.
Much of his writing is also of extremely poor quality, to the point where it's not clear whether it's written by him or an LLM. I'm not an active editor on this project, so I'm not as familiar with the standards here, but I believe this is worth custodian attention. [[User:Pi.1415926535|Pi.1415926535]] ([[User talk:Pi.1415926535|discuss]] • [[Special:Contributions/Pi.1415926535|contribs]]) 03:06, 23 February 2026 (UTC)

:Fake source ''and'' contradictory copyright info, claiming both public domain and CC license. Moreover, if they are indeed nearly-direct LLM output, depending on jurisdiction they may not even be eligible for copyright.
:I've put speedy deletion marks for the equations, because they're obviously not coherent mathematical equations (the parentheses don't match, the symbols merge into each other the way text in image models often do, etc) [[User:Sesquilinear|Sesquilinear]] ([[User talk:Sesquilinear|discuss]] • [[Special:Contributions/Sesquilinear|contribs]]) 21:50, 7 March 2026 (UTC)

== Repeated removal of RFD notices by Harold Foppele ==

{{User|Harold Foppele }}

This editor is appearing in multiple noticeboards for behaviour which is contentious. Ther latest adventure is the repeated removal of tye RFD notice at [[Quantum/Henry C. Kapteyn]]. You will see from their contributions record the number of times. I have warned Tham on their user tag page that this is tantaomunt to volunteering to be blocked here. They have a track record of achieving blocks on enWiki and Commons already.

They have all the appearance of shooting not to understand when given direct information about their behaviour, whichever project they are editing, and are fast becoming a time sink. Their behaviour across multiple WMF sites may well lead to a Global Lock, but I do not believe they have quite reached the threshold for that.

I believe that what is required is a preventative block to seek to ensure thatchy understand the seriousness of their behaviour, and the need to be collegial. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 23:03, 4 March 2026 (UTC)
: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:45, 8 March 2026 (UTC)

== Blocks for sockpuppet ==

Please block [[User:Harold Foppele]] and [[User:Johnwilliamsiii]] for sockpuppetry based on [https://en.wikipedia.org/wiki/Wikipedia:Sockpuppet_investigations/Harold_Foppele en wiki] CU and [https://commons.wikimedia.org/w/index.php?diff=1177465640 commons] CU investigations. The user has also violated copyright, see the above discussion. A block is necessary to prevent further abuse. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:30, 8 March 2026 (UTC)

:&lt;small&gt;@[[User:MathXplore|MathXplore]]&lt;/small&gt; [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:31, 8 March 2026 (UTC)
:: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:44, 8 March 2026 (UTC)
:CC. @[[User:Timtrent|Timtrent]], @[[User:Sesquilinear|Sesquilinear]], @[[User:Pi.1415926535|Pi.1415926535]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:33, 8 March 2026 (UTC)
::Thank you for the ping. I concur based on [[w:en:WP:DUCK|behaviour]]. CUs appear divided. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 11:41, 8 March 2026 (UTC)

== Problem when trying to start a discussion with authors of the Plurilingual education portal ==

The authors I wanted to discuss with are called &quot;Project PEP&quot; and my name is Franch Chandler. How can I be allowed to do so ? [[User:French Chandler|French Chandler]] ([[User talk:French Chandler|discuss]] • [[Special:Contributions/French Chandler|contribs]]) 18:25, 16 March 2026 (UTC)

:@[[User:French Chandler|French Chandler]] place your qestion [https://en.wikiversity.org/w/index.php?title=User_talk:Projet_PEP&amp;action=edit into the dialog box] on this link and hit Publish page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:22, 16 March 2026 (UTC)

== Please publish my post ==

My post is about &quot;Every child grows and develops at their own pace, but some may experience challenges that affect their ability to perform everyday tasks. These challenges can include difficulties with fine motor skills, sensory processing, handwriting, feeding, and self-regulation. When these issues are not addressed early, they can impact a child’s confidence, academic performance, and independence.

With the rise of digital healthcare services, '''online physical therapy''' has emerged as a powerful and accessible solution for parents seeking support for their children. This modern approach provides structured, personalized therapy programs that can be accessed from the comfort of home, making it easier for families to ensure consistent care.&quot; [[User:Skyabovetherapy|Skyabovetherapy]] ([[User talk:Skyabovetherapy|discuss]] • [[Special:Contributions/Skyabovetherapy|contribs]]) 12:28, 28 March 2026 (UTC)

:@[[User:Skyabovetherapy|Skyabovetherapy]] Well, you can publish it yourself, Wikiversity is a free environement, where everybody can create educational resources. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 14:11, 29 March 2026 (UTC)
::They actually triggered some abuse filters. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 16:24, 29 March 2026 (UTC)
:I looked at your attempts to add this text and I see a link to one website repeated many times, which reminds me of the misuse of Wikiversity for self-promotion or to increase the importance of the website. It is necessary to remind you here that Wikiversity is not a place for promotion, but a place for education. So if you want to educate, it will not be a problem to create the page without external links with a clearly defined procedure for how people should use it and what to expect from it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:07, 1 April 2026 (UTC)

== New user limit ==

Hi, I am creating an AIPA Method learning resource page. 

I am the author of the linked research, and I hit the “new user limit” and “new page with external link” filters while publishing. 

Here is the link to the page in creation: [https://en.wikiversity.org/w/index.php?title=AIPA_Method&amp;veaction=edit] 

Thank you for your help. 

Best regards, 

Senad Dizdarević [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:19, 30 March 2026 (UTC)

:@[[User:Senad Dizdarević|Senad Dizdarević]] I should admit I dont know, what is &quot;new user limit&quot;, but if filter blocks your page because of certain external link, you may force to save anyway and sometimes it works. It should not work, when the website is blacklisted. As of now, I am not seeing you to save page in main namespace, so try to save it without external links first. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:30, 30 March 2026 (UTC)
::Thank you, you are very kind. 
::I will wait a day, and try again (without links, too). 
::Today, I already created About Me info page, and maybe that is enough for the filters for one day.  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:53, 30 March 2026 (UTC)
:::Well, I have analyzed your contribution to Wikiversity and I should point out here, that this project is not a place for advertising, so there is no way of promoting your books and authority this way. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:56, 1 April 2026 (UTC)
::::Hi, my About Me page is just an info page with the neutral as possible presentation of my work. 
::::There is a big difference between informing and advertising. Informing is neutrally stating that something exists and requiring no action, while advertising is a special communication form with intent to cause certain action from readers. For example, click here, click there, order this, buy that. 
::::There is no such intention, form, or terms on my info page. Just neutral information. I don't hide and I am not ashamed that I am write and author, and that is a part of the usual bio, including works. I checked your user page: &quot;I graduated from the Czech University of Life Sciences in Prague and studied information science at the Faculty of Arts of Charles University.&quot; I think that if you had written a book on Life Science, you would have mentioned that as well.
::::Most of the Info page is about my research and AIPA Method which is a valid contribution to psychology, consciousness studies, identity theory, and personality development. Actually, my paper '''AIPA Method: A Cognitive-Phenomenological Model for Identity Reconstruction and Stabilization in Pure Awareness''' is now in the peer review procedure at Journal of Consciousness Studies. 
::::Here is a part from the Wikiversity AIPA Method page in creation (waiting for the end of the time limit for new users):    [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:47, 2 April 2026 (UTC)
:::::For the unknown reasons, the form didn't publish my second part of the message: 
:::::I believe this is a valid contribution to Wikiversity. 
:::::Best Regards, 
:::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:52, 2 April 2026 (UTC)
::::::And the third try: 
:::::: == Introduction ==
::::::The AIPA Method addresses a gap in contemporary personal development and consciousness science: most evidence‑based approaches (CBT, MBSR, MBCT, standard meditation) operate at the level of mental content—reframing thoughts, observing them, or reducing their impact—rather than at the level of identity structure. In contrast, AIPA targets the structural relationship between the self and the mind, aiming at durable identity reconstruction rooted in Pure Awareness rather than symptom management.
::::::The central research question of the primary AIPA preprint is whether a structured, sequentially staged method can produce permanent identity reconstruction rooted in Pure Awareness, and how such a method compares to established approaches in scope, mechanism, and outcome.
:::::: == Theoretical foundations ==
::::::The AIPA framework is grounded in the cognitive‑phenomenological tradition (e.g., McAdams, Varela, Metzinger, Erikson), contemporary consciousness science on minimal phenomenal experience, and qualitative methods advocacy in psychology. It builds directly on:
::::::* Empirical work on pure awareness and Minimal Phenomenal Experience (MPE), especially Gamma &amp; Metzinger’s large‑scale study of content‑reduced awareness states.
::::::* Metzinger’s proposal of minimal phenomenal experience as an entry point for a minimal unifying model of consciousness.
::::::* Narrative identity and partial‑self models within personality and identity theory.
::::::Within this backdrop, AIPA proposes Pure Awareness as a distinct, operationally specified state that can become a structural ground of identity rather than a transient meditative experience.
:::::: == Experiential empiricism ==
::::::The empirical foundation of the AIPA Method is explicitly first‑person and experiential, combining:
::::::* A 22‑year longitudinal autoethnographic self‑study (2003–2025) documenting partial personality episodes, protocol use, and outcomes.
::::::* A 13‑year prospective verification period with zero self‑reported recurrence of targeted harmful behaviors after a dated stabilization point (1 January 2006).
::::::* A high‑ecological‑validity “stress test” during acute bereavement, used to examine whether non‑reactive awareness remains stable under maximal provocation.
::::::* Two independent practitioner cases (an Amazon‑verified report and a structured questionnaire case) providing preliminary convergent signals across cognitive, emotional, behavioral, and identity dimensions.
::::::All central constructs (Pure Awareness, partial personalities, the Switch, identity stabilization) are operationalized with explicit phenomenological and behavioral criteria intended to enable replication and future third‑person measurement.
::::::I believe this is a valid contribution to Wikiversity. 
::::::Best regards, 
::::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:54, 2 April 2026 (UTC)</text>
      <sha1>qwygbck7t5gn0ce7995w2tuv19wcz59</sha1>
    </revision>
    <revision>
      <id>2809706</id>
      <parentid>2809704</parentid>
      <timestamp>2026-05-16T19:24:30Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Unable to publish pages */ archive from [[Wikiversity:Request custodian action]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809706</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="20704" sha1="n07jo6uvpic35ligrntcerfrni2akzp" xml:space="preserve">{{Archive|Wikiversity:Request custodian action}}

== Sidewide count.js ==

i would like something like: [[Template:User contrib count/count.js]]. i created [[Template:User contrib count]] and a user/common.js. {{User contrib count}}.&lt;br&gt;&lt;br&gt; so a &quot;count.js&quot; would complete it. See [[User:Harold Foppele/common.js]].
If an Administrator could help please. Cheers [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 19:22, 18 January 2026 (UTC)

== need to add my profile ==

im trying to add new profile content  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:03, 4 February 2026 (UTC)

:You can edit it now. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:05, 4 February 2026 (UTC)
::where can create a new one [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)
:::i have created and its in sandbox. i would like to know when it will be approved  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 19:38, 4 February 2026 (UTC)
::::Please don’t create [[wv:spam|spam]] pages as it will be deleted. Please also read [[WV:Scope]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 04:01, 5 February 2026 (UTC)

== Im trying to add new profile while add content its shows not alowed ==

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Exceeded New Page Limit

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)

== New User: cannot create talk page ==

Hi, I am a new user of Wikiversity and I wanted to create a talk page for the article [[ChatGPT's Essay on Kohlberg's Theory: AI's Use in Academic Writing]]. As a new user, I was barred from performing this action. The text that I wanted to add to the talk page is:

&lt;blockquote&gt;
I have doubts as to to the reliability of this essay. Take for rexample the sentence:

&lt;blockquote&gt;
Due to its efficiency, AI has saved 380,000-403,000 lives per year in European healthcare as reported in a recent Deloitte and MedTech Europe report&lt;ref&gt;Dantas, C., Mackiewicz, K., Tageo, V., Jacucci, G., Guardado, D., Ortet, S., Varlamis, I., Maniadakis, M., De Lera, E., Quintas, J., Kocsis, O., &amp; Vassiliou, C. (2021). Benefits and hurdles of AI in the workplace – what comes next? ''International Journal of Artificial Intelligence and Expert Systems, 10'', 9-17. https://www.researchgate.net/publication/351993615_Benefits_and_Hurdles_of_AI_In_The_Workplace_-What_Comes_Next&lt;/ref&gt;.
&lt;/blockquote&gt;

Reading the reference (freely available on ResearchGate), one notes:

# that the reference is from 2021 (predating the widespread use of LLMs such as ChatGPT and the associated 'AI' boom), and
# that the reference factually contradicts this essay.

Quoting from the reference:

&lt;blockquote&gt;
There are enormous benefits of applying AI-based solutions to monitor workers’ health and prevent accidents or, currently, COVID-19 infections, and those benefits are reported with enormous potential. According to the recent Deloitte and MedTech Europe report [11], implementing AI in European healthcare systems could save up 380,000 to 403,000 lives annually or €170.9 to 212.4 billion per year.
&lt;/blockquote&gt;

Not that the reference says ''could save'', not ''saves'' as in the essay.

This calls into question the reliability of the essay.

&lt;/blockquote&gt;

Could an administrator make this addition for me? Thank you! 
{{reflist}}
[[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 06:53, 5 February 2026 (UTC)

:@[[User:Æolus|Æolus]] I have added it for you, you can change the header and sign it now. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 08:05, 5 February 2026 (UTC)
::Thank you! [[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 12:43, 5 February 2026 (UTC)

== Disallowed to add a page on a course ==

I'm trying to populate a newly created course on Wikiversity, but it blocks me from creating more pages with &quot;New User Exceeded New Page Limit&quot;. Could this be lifted please? [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 13:21, 15 February 2026 (UTC)

:Sorry! Never mind. I was trying to create a new article instead of a new page. All good now. [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 14:03, 15 February 2026 (UTC)

== Harold Foppele adding LLM-generated nonsense and personal fiction ==

I became aware of [[User:Harold Foppele]]'s editing after I deleted some of his uploads on Commons. He appears to be adding a large amount of text and images that are some combination of personal fiction and LLM-generated nonsense. This includes:
*[[Quantum Ultra fast lasers#Future thought experiment|Personal speculative fiction]] in an otherwise &quot;nonfiction&quot; article
*Uploading nonsense LLM-created [[:File:Rontosecond pulse laser (Schematic).jpg|diagrams]] and [[:File:Rontosecond pulse laser (Futuristic).jpg|renders]] for nonexistent lab equipment, with fake source (on Commons, he indicated these files as having been created by him using an LLM)
*Uploading nonsense LLM-created images of equations with obvious artifacts. These images, such as [[:File:Redfield equation (non-Markovian).png]] and [[:File:Lindblad equation (Markovian).png]], don't even match the text he puts them with.
Much of his writing is also of extremely poor quality, to the point where it's not clear whether it's written by him or an LLM. I'm not an active editor on this project, so I'm not as familiar with the standards here, but I believe this is worth custodian attention. [[User:Pi.1415926535|Pi.1415926535]] ([[User talk:Pi.1415926535|discuss]] • [[Special:Contributions/Pi.1415926535|contribs]]) 03:06, 23 February 2026 (UTC)

:Fake source ''and'' contradictory copyright info, claiming both public domain and CC license. Moreover, if they are indeed nearly-direct LLM output, depending on jurisdiction they may not even be eligible for copyright.
:I've put speedy deletion marks for the equations, because they're obviously not coherent mathematical equations (the parentheses don't match, the symbols merge into each other the way text in image models often do, etc) [[User:Sesquilinear|Sesquilinear]] ([[User talk:Sesquilinear|discuss]] • [[Special:Contributions/Sesquilinear|contribs]]) 21:50, 7 March 2026 (UTC)

== Repeated removal of RFD notices by Harold Foppele ==

{{User|Harold Foppele }}

This editor is appearing in multiple noticeboards for behaviour which is contentious. Ther latest adventure is the repeated removal of tye RFD notice at [[Quantum/Henry C. Kapteyn]]. You will see from their contributions record the number of times. I have warned Tham on their user tag page that this is tantaomunt to volunteering to be blocked here. They have a track record of achieving blocks on enWiki and Commons already.

They have all the appearance of shooting not to understand when given direct information about their behaviour, whichever project they are editing, and are fast becoming a time sink. Their behaviour across multiple WMF sites may well lead to a Global Lock, but I do not believe they have quite reached the threshold for that.

I believe that what is required is a preventative block to seek to ensure thatchy understand the seriousness of their behaviour, and the need to be collegial. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 23:03, 4 March 2026 (UTC)
: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:45, 8 March 2026 (UTC)

== Blocks for sockpuppet ==

Please block [[User:Harold Foppele]] and [[User:Johnwilliamsiii]] for sockpuppetry based on [https://en.wikipedia.org/wiki/Wikipedia:Sockpuppet_investigations/Harold_Foppele en wiki] CU and [https://commons.wikimedia.org/w/index.php?diff=1177465640 commons] CU investigations. The user has also violated copyright, see the above discussion. A block is necessary to prevent further abuse. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:30, 8 March 2026 (UTC)

:&lt;small&gt;@[[User:MathXplore|MathXplore]]&lt;/small&gt; [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:31, 8 March 2026 (UTC)
:: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:44, 8 March 2026 (UTC)
:CC. @[[User:Timtrent|Timtrent]], @[[User:Sesquilinear|Sesquilinear]], @[[User:Pi.1415926535|Pi.1415926535]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:33, 8 March 2026 (UTC)
::Thank you for the ping. I concur based on [[w:en:WP:DUCK|behaviour]]. CUs appear divided. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 11:41, 8 March 2026 (UTC)

== Problem when trying to start a discussion with authors of the Plurilingual education portal ==

The authors I wanted to discuss with are called &quot;Project PEP&quot; and my name is Franch Chandler. How can I be allowed to do so ? [[User:French Chandler|French Chandler]] ([[User talk:French Chandler|discuss]] • [[Special:Contributions/French Chandler|contribs]]) 18:25, 16 March 2026 (UTC)

:@[[User:French Chandler|French Chandler]] place your qestion [https://en.wikiversity.org/w/index.php?title=User_talk:Projet_PEP&amp;action=edit into the dialog box] on this link and hit Publish page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:22, 16 March 2026 (UTC)

== Please publish my post ==

My post is about &quot;Every child grows and develops at their own pace, but some may experience challenges that affect their ability to perform everyday tasks. These challenges can include difficulties with fine motor skills, sensory processing, handwriting, feeding, and self-regulation. When these issues are not addressed early, they can impact a child’s confidence, academic performance, and independence.

With the rise of digital healthcare services, '''online physical therapy''' has emerged as a powerful and accessible solution for parents seeking support for their children. This modern approach provides structured, personalized therapy programs that can be accessed from the comfort of home, making it easier for families to ensure consistent care.&quot; [[User:Skyabovetherapy|Skyabovetherapy]] ([[User talk:Skyabovetherapy|discuss]] • [[Special:Contributions/Skyabovetherapy|contribs]]) 12:28, 28 March 2026 (UTC)

:@[[User:Skyabovetherapy|Skyabovetherapy]] Well, you can publish it yourself, Wikiversity is a free environement, where everybody can create educational resources. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 14:11, 29 March 2026 (UTC)
::They actually triggered some abuse filters. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 16:24, 29 March 2026 (UTC)
:I looked at your attempts to add this text and I see a link to one website repeated many times, which reminds me of the misuse of Wikiversity for self-promotion or to increase the importance of the website. It is necessary to remind you here that Wikiversity is not a place for promotion, but a place for education. So if you want to educate, it will not be a problem to create the page without external links with a clearly defined procedure for how people should use it and what to expect from it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:07, 1 April 2026 (UTC)

== New user limit ==

Hi, I am creating an AIPA Method learning resource page. 

I am the author of the linked research, and I hit the “new user limit” and “new page with external link” filters while publishing. 

Here is the link to the page in creation: [https://en.wikiversity.org/w/index.php?title=AIPA_Method&amp;veaction=edit] 

Thank you for your help. 

Best regards, 

Senad Dizdarević [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:19, 30 March 2026 (UTC)

:@[[User:Senad Dizdarević|Senad Dizdarević]] I should admit I dont know, what is &quot;new user limit&quot;, but if filter blocks your page because of certain external link, you may force to save anyway and sometimes it works. It should not work, when the website is blacklisted. As of now, I am not seeing you to save page in main namespace, so try to save it without external links first. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:30, 30 March 2026 (UTC)
::Thank you, you are very kind. 
::I will wait a day, and try again (without links, too). 
::Today, I already created About Me info page, and maybe that is enough for the filters for one day.  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:53, 30 March 2026 (UTC)
:::Well, I have analyzed your contribution to Wikiversity and I should point out here, that this project is not a place for advertising, so there is no way of promoting your books and authority this way. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:56, 1 April 2026 (UTC)
::::Hi, my About Me page is just an info page with the neutral as possible presentation of my work. 
::::There is a big difference between informing and advertising. Informing is neutrally stating that something exists and requiring no action, while advertising is a special communication form with intent to cause certain action from readers. For example, click here, click there, order this, buy that. 
::::There is no such intention, form, or terms on my info page. Just neutral information. I don't hide and I am not ashamed that I am write and author, and that is a part of the usual bio, including works. I checked your user page: &quot;I graduated from the Czech University of Life Sciences in Prague and studied information science at the Faculty of Arts of Charles University.&quot; I think that if you had written a book on Life Science, you would have mentioned that as well.
::::Most of the Info page is about my research and AIPA Method which is a valid contribution to psychology, consciousness studies, identity theory, and personality development. Actually, my paper '''AIPA Method: A Cognitive-Phenomenological Model for Identity Reconstruction and Stabilization in Pure Awareness''' is now in the peer review procedure at Journal of Consciousness Studies. 
::::Here is a part from the Wikiversity AIPA Method page in creation (waiting for the end of the time limit for new users):    [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:47, 2 April 2026 (UTC)
:::::For the unknown reasons, the form didn't publish my second part of the message: 
:::::I believe this is a valid contribution to Wikiversity. 
:::::Best Regards, 
:::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:52, 2 April 2026 (UTC)
::::::And the third try: 
:::::: == Introduction ==
::::::The AIPA Method addresses a gap in contemporary personal development and consciousness science: most evidence‑based approaches (CBT, MBSR, MBCT, standard meditation) operate at the level of mental content—reframing thoughts, observing them, or reducing their impact—rather than at the level of identity structure. In contrast, AIPA targets the structural relationship between the self and the mind, aiming at durable identity reconstruction rooted in Pure Awareness rather than symptom management.
::::::The central research question of the primary AIPA preprint is whether a structured, sequentially staged method can produce permanent identity reconstruction rooted in Pure Awareness, and how such a method compares to established approaches in scope, mechanism, and outcome.
:::::: == Theoretical foundations ==
::::::The AIPA framework is grounded in the cognitive‑phenomenological tradition (e.g., McAdams, Varela, Metzinger, Erikson), contemporary consciousness science on minimal phenomenal experience, and qualitative methods advocacy in psychology. It builds directly on:
::::::* Empirical work on pure awareness and Minimal Phenomenal Experience (MPE), especially Gamma &amp; Metzinger’s large‑scale study of content‑reduced awareness states.
::::::* Metzinger’s proposal of minimal phenomenal experience as an entry point for a minimal unifying model of consciousness.
::::::* Narrative identity and partial‑self models within personality and identity theory.
::::::Within this backdrop, AIPA proposes Pure Awareness as a distinct, operationally specified state that can become a structural ground of identity rather than a transient meditative experience.
:::::: == Experiential empiricism ==
::::::The empirical foundation of the AIPA Method is explicitly first‑person and experiential, combining:
::::::* A 22‑year longitudinal autoethnographic self‑study (2003–2025) documenting partial personality episodes, protocol use, and outcomes.
::::::* A 13‑year prospective verification period with zero self‑reported recurrence of targeted harmful behaviors after a dated stabilization point (1 January 2006).
::::::* A high‑ecological‑validity “stress test” during acute bereavement, used to examine whether non‑reactive awareness remains stable under maximal provocation.
::::::* Two independent practitioner cases (an Amazon‑verified report and a structured questionnaire case) providing preliminary convergent signals across cognitive, emotional, behavioral, and identity dimensions.
::::::All central constructs (Pure Awareness, partial personalities, the Switch, identity stabilization) are operationalized with explicit phenomenological and behavioral criteria intended to enable replication and future third‑person measurement.
::::::I believe this is a valid contribution to Wikiversity. 
::::::Best regards, 
::::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:54, 2 April 2026 (UTC)

== Unable to publish pages  ==

Whenever I try to publish a page with linked sources it gets flagged and says I'm a new user attempting to publish content with outside links. Those outside links are my sources. [[User:Soboyed|Soboyed]] ([[User talk:Soboyed|discuss]] • [[Special:Contributions/Soboyed|contribs]]) 04:52, 2 April 2026 (UTC)

:This restriction is automatically lifted after you have edited for a certain time (I don't recall that time off-hand, but it is not long). This is designed to stop spam. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 04:53, 2 April 2026 (UTC)</text>
      <sha1>n07jo6uvpic35ligrntcerfrni2akzp</sha1>
    </revision>
    <revision>
      <id>2809708</id>
      <parentid>2809706</parentid>
      <timestamp>2026-05-16T19:24:53Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Showing error to publish a Post */ archive from [[Wikiversity:Request custodian action]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809708</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="21854" sha1="o9ds0epi7k3l1nmn9nh5871yezm50kw" xml:space="preserve">{{Archive|Wikiversity:Request custodian action}}

== Sidewide count.js ==

i would like something like: [[Template:User contrib count/count.js]]. i created [[Template:User contrib count]] and a user/common.js. {{User contrib count}}.&lt;br&gt;&lt;br&gt; so a &quot;count.js&quot; would complete it. See [[User:Harold Foppele/common.js]].
If an Administrator could help please. Cheers [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 19:22, 18 January 2026 (UTC)

== need to add my profile ==

im trying to add new profile content  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:03, 4 February 2026 (UTC)

:You can edit it now. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:05, 4 February 2026 (UTC)
::where can create a new one [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)
:::i have created and its in sandbox. i would like to know when it will be approved  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 19:38, 4 February 2026 (UTC)
::::Please don’t create [[wv:spam|spam]] pages as it will be deleted. Please also read [[WV:Scope]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 04:01, 5 February 2026 (UTC)

== Im trying to add new profile while add content its shows not alowed ==

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Exceeded New Page Limit

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)

== New User: cannot create talk page ==

Hi, I am a new user of Wikiversity and I wanted to create a talk page for the article [[ChatGPT's Essay on Kohlberg's Theory: AI's Use in Academic Writing]]. As a new user, I was barred from performing this action. The text that I wanted to add to the talk page is:

&lt;blockquote&gt;
I have doubts as to to the reliability of this essay. Take for rexample the sentence:

&lt;blockquote&gt;
Due to its efficiency, AI has saved 380,000-403,000 lives per year in European healthcare as reported in a recent Deloitte and MedTech Europe report&lt;ref&gt;Dantas, C., Mackiewicz, K., Tageo, V., Jacucci, G., Guardado, D., Ortet, S., Varlamis, I., Maniadakis, M., De Lera, E., Quintas, J., Kocsis, O., &amp; Vassiliou, C. (2021). Benefits and hurdles of AI in the workplace – what comes next? ''International Journal of Artificial Intelligence and Expert Systems, 10'', 9-17. https://www.researchgate.net/publication/351993615_Benefits_and_Hurdles_of_AI_In_The_Workplace_-What_Comes_Next&lt;/ref&gt;.
&lt;/blockquote&gt;

Reading the reference (freely available on ResearchGate), one notes:

# that the reference is from 2021 (predating the widespread use of LLMs such as ChatGPT and the associated 'AI' boom), and
# that the reference factually contradicts this essay.

Quoting from the reference:

&lt;blockquote&gt;
There are enormous benefits of applying AI-based solutions to monitor workers’ health and prevent accidents or, currently, COVID-19 infections, and those benefits are reported with enormous potential. According to the recent Deloitte and MedTech Europe report [11], implementing AI in European healthcare systems could save up 380,000 to 403,000 lives annually or €170.9 to 212.4 billion per year.
&lt;/blockquote&gt;

Not that the reference says ''could save'', not ''saves'' as in the essay.

This calls into question the reliability of the essay.

&lt;/blockquote&gt;

Could an administrator make this addition for me? Thank you! 
{{reflist}}
[[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 06:53, 5 February 2026 (UTC)

:@[[User:Æolus|Æolus]] I have added it for you, you can change the header and sign it now. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 08:05, 5 February 2026 (UTC)
::Thank you! [[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 12:43, 5 February 2026 (UTC)

== Disallowed to add a page on a course ==

I'm trying to populate a newly created course on Wikiversity, but it blocks me from creating more pages with &quot;New User Exceeded New Page Limit&quot;. Could this be lifted please? [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 13:21, 15 February 2026 (UTC)

:Sorry! Never mind. I was trying to create a new article instead of a new page. All good now. [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 14:03, 15 February 2026 (UTC)

== Harold Foppele adding LLM-generated nonsense and personal fiction ==

I became aware of [[User:Harold Foppele]]'s editing after I deleted some of his uploads on Commons. He appears to be adding a large amount of text and images that are some combination of personal fiction and LLM-generated nonsense. This includes:
*[[Quantum Ultra fast lasers#Future thought experiment|Personal speculative fiction]] in an otherwise &quot;nonfiction&quot; article
*Uploading nonsense LLM-created [[:File:Rontosecond pulse laser (Schematic).jpg|diagrams]] and [[:File:Rontosecond pulse laser (Futuristic).jpg|renders]] for nonexistent lab equipment, with fake source (on Commons, he indicated these files as having been created by him using an LLM)
*Uploading nonsense LLM-created images of equations with obvious artifacts. These images, such as [[:File:Redfield equation (non-Markovian).png]] and [[:File:Lindblad equation (Markovian).png]], don't even match the text he puts them with.
Much of his writing is also of extremely poor quality, to the point where it's not clear whether it's written by him or an LLM. I'm not an active editor on this project, so I'm not as familiar with the standards here, but I believe this is worth custodian attention. [[User:Pi.1415926535|Pi.1415926535]] ([[User talk:Pi.1415926535|discuss]] • [[Special:Contributions/Pi.1415926535|contribs]]) 03:06, 23 February 2026 (UTC)

:Fake source ''and'' contradictory copyright info, claiming both public domain and CC license. Moreover, if they are indeed nearly-direct LLM output, depending on jurisdiction they may not even be eligible for copyright.
:I've put speedy deletion marks for the equations, because they're obviously not coherent mathematical equations (the parentheses don't match, the symbols merge into each other the way text in image models often do, etc) [[User:Sesquilinear|Sesquilinear]] ([[User talk:Sesquilinear|discuss]] • [[Special:Contributions/Sesquilinear|contribs]]) 21:50, 7 March 2026 (UTC)

== Repeated removal of RFD notices by Harold Foppele ==

{{User|Harold Foppele }}

This editor is appearing in multiple noticeboards for behaviour which is contentious. Ther latest adventure is the repeated removal of tye RFD notice at [[Quantum/Henry C. Kapteyn]]. You will see from their contributions record the number of times. I have warned Tham on their user tag page that this is tantaomunt to volunteering to be blocked here. They have a track record of achieving blocks on enWiki and Commons already.

They have all the appearance of shooting not to understand when given direct information about their behaviour, whichever project they are editing, and are fast becoming a time sink. Their behaviour across multiple WMF sites may well lead to a Global Lock, but I do not believe they have quite reached the threshold for that.

I believe that what is required is a preventative block to seek to ensure thatchy understand the seriousness of their behaviour, and the need to be collegial. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 23:03, 4 March 2026 (UTC)
: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:45, 8 March 2026 (UTC)

== Blocks for sockpuppet ==

Please block [[User:Harold Foppele]] and [[User:Johnwilliamsiii]] for sockpuppetry based on [https://en.wikipedia.org/wiki/Wikipedia:Sockpuppet_investigations/Harold_Foppele en wiki] CU and [https://commons.wikimedia.org/w/index.php?diff=1177465640 commons] CU investigations. The user has also violated copyright, see the above discussion. A block is necessary to prevent further abuse. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:30, 8 March 2026 (UTC)

:&lt;small&gt;@[[User:MathXplore|MathXplore]]&lt;/small&gt; [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:31, 8 March 2026 (UTC)
:: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:44, 8 March 2026 (UTC)
:CC. @[[User:Timtrent|Timtrent]], @[[User:Sesquilinear|Sesquilinear]], @[[User:Pi.1415926535|Pi.1415926535]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:33, 8 March 2026 (UTC)
::Thank you for the ping. I concur based on [[w:en:WP:DUCK|behaviour]]. CUs appear divided. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 11:41, 8 March 2026 (UTC)

== Problem when trying to start a discussion with authors of the Plurilingual education portal ==

The authors I wanted to discuss with are called &quot;Project PEP&quot; and my name is Franch Chandler. How can I be allowed to do so ? [[User:French Chandler|French Chandler]] ([[User talk:French Chandler|discuss]] • [[Special:Contributions/French Chandler|contribs]]) 18:25, 16 March 2026 (UTC)

:@[[User:French Chandler|French Chandler]] place your qestion [https://en.wikiversity.org/w/index.php?title=User_talk:Projet_PEP&amp;action=edit into the dialog box] on this link and hit Publish page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:22, 16 March 2026 (UTC)

== Please publish my post ==

My post is about &quot;Every child grows and develops at their own pace, but some may experience challenges that affect their ability to perform everyday tasks. These challenges can include difficulties with fine motor skills, sensory processing, handwriting, feeding, and self-regulation. When these issues are not addressed early, they can impact a child’s confidence, academic performance, and independence.

With the rise of digital healthcare services, '''online physical therapy''' has emerged as a powerful and accessible solution for parents seeking support for their children. This modern approach provides structured, personalized therapy programs that can be accessed from the comfort of home, making it easier for families to ensure consistent care.&quot; [[User:Skyabovetherapy|Skyabovetherapy]] ([[User talk:Skyabovetherapy|discuss]] • [[Special:Contributions/Skyabovetherapy|contribs]]) 12:28, 28 March 2026 (UTC)

:@[[User:Skyabovetherapy|Skyabovetherapy]] Well, you can publish it yourself, Wikiversity is a free environement, where everybody can create educational resources. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 14:11, 29 March 2026 (UTC)
::They actually triggered some abuse filters. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 16:24, 29 March 2026 (UTC)
:I looked at your attempts to add this text and I see a link to one website repeated many times, which reminds me of the misuse of Wikiversity for self-promotion or to increase the importance of the website. It is necessary to remind you here that Wikiversity is not a place for promotion, but a place for education. So if you want to educate, it will not be a problem to create the page without external links with a clearly defined procedure for how people should use it and what to expect from it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:07, 1 April 2026 (UTC)

== New user limit ==

Hi, I am creating an AIPA Method learning resource page. 

I am the author of the linked research, and I hit the “new user limit” and “new page with external link” filters while publishing. 

Here is the link to the page in creation: [https://en.wikiversity.org/w/index.php?title=AIPA_Method&amp;veaction=edit] 

Thank you for your help. 

Best regards, 

Senad Dizdarević [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:19, 30 March 2026 (UTC)

:@[[User:Senad Dizdarević|Senad Dizdarević]] I should admit I dont know, what is &quot;new user limit&quot;, but if filter blocks your page because of certain external link, you may force to save anyway and sometimes it works. It should not work, when the website is blacklisted. As of now, I am not seeing you to save page in main namespace, so try to save it without external links first. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:30, 30 March 2026 (UTC)
::Thank you, you are very kind. 
::I will wait a day, and try again (without links, too). 
::Today, I already created About Me info page, and maybe that is enough for the filters for one day.  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:53, 30 March 2026 (UTC)
:::Well, I have analyzed your contribution to Wikiversity and I should point out here, that this project is not a place for advertising, so there is no way of promoting your books and authority this way. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:56, 1 April 2026 (UTC)
::::Hi, my About Me page is just an info page with the neutral as possible presentation of my work. 
::::There is a big difference between informing and advertising. Informing is neutrally stating that something exists and requiring no action, while advertising is a special communication form with intent to cause certain action from readers. For example, click here, click there, order this, buy that. 
::::There is no such intention, form, or terms on my info page. Just neutral information. I don't hide and I am not ashamed that I am write and author, and that is a part of the usual bio, including works. I checked your user page: &quot;I graduated from the Czech University of Life Sciences in Prague and studied information science at the Faculty of Arts of Charles University.&quot; I think that if you had written a book on Life Science, you would have mentioned that as well.
::::Most of the Info page is about my research and AIPA Method which is a valid contribution to psychology, consciousness studies, identity theory, and personality development. Actually, my paper '''AIPA Method: A Cognitive-Phenomenological Model for Identity Reconstruction and Stabilization in Pure Awareness''' is now in the peer review procedure at Journal of Consciousness Studies. 
::::Here is a part from the Wikiversity AIPA Method page in creation (waiting for the end of the time limit for new users):    [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:47, 2 April 2026 (UTC)
:::::For the unknown reasons, the form didn't publish my second part of the message: 
:::::I believe this is a valid contribution to Wikiversity. 
:::::Best Regards, 
:::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:52, 2 April 2026 (UTC)
::::::And the third try: 
:::::: == Introduction ==
::::::The AIPA Method addresses a gap in contemporary personal development and consciousness science: most evidence‑based approaches (CBT, MBSR, MBCT, standard meditation) operate at the level of mental content—reframing thoughts, observing them, or reducing their impact—rather than at the level of identity structure. In contrast, AIPA targets the structural relationship between the self and the mind, aiming at durable identity reconstruction rooted in Pure Awareness rather than symptom management.
::::::The central research question of the primary AIPA preprint is whether a structured, sequentially staged method can produce permanent identity reconstruction rooted in Pure Awareness, and how such a method compares to established approaches in scope, mechanism, and outcome.
:::::: == Theoretical foundations ==
::::::The AIPA framework is grounded in the cognitive‑phenomenological tradition (e.g., McAdams, Varela, Metzinger, Erikson), contemporary consciousness science on minimal phenomenal experience, and qualitative methods advocacy in psychology. It builds directly on:
::::::* Empirical work on pure awareness and Minimal Phenomenal Experience (MPE), especially Gamma &amp; Metzinger’s large‑scale study of content‑reduced awareness states.
::::::* Metzinger’s proposal of minimal phenomenal experience as an entry point for a minimal unifying model of consciousness.
::::::* Narrative identity and partial‑self models within personality and identity theory.
::::::Within this backdrop, AIPA proposes Pure Awareness as a distinct, operationally specified state that can become a structural ground of identity rather than a transient meditative experience.
:::::: == Experiential empiricism ==
::::::The empirical foundation of the AIPA Method is explicitly first‑person and experiential, combining:
::::::* A 22‑year longitudinal autoethnographic self‑study (2003–2025) documenting partial personality episodes, protocol use, and outcomes.
::::::* A 13‑year prospective verification period with zero self‑reported recurrence of targeted harmful behaviors after a dated stabilization point (1 January 2006).
::::::* A high‑ecological‑validity “stress test” during acute bereavement, used to examine whether non‑reactive awareness remains stable under maximal provocation.
::::::* Two independent practitioner cases (an Amazon‑verified report and a structured questionnaire case) providing preliminary convergent signals across cognitive, emotional, behavioral, and identity dimensions.
::::::All central constructs (Pure Awareness, partial personalities, the Switch, identity stabilization) are operationalized with explicit phenomenological and behavioral criteria intended to enable replication and future third‑person measurement.
::::::I believe this is a valid contribution to Wikiversity. 
::::::Best regards, 
::::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:54, 2 April 2026 (UTC)

== Unable to publish pages  ==

Whenever I try to publish a page with linked sources it gets flagged and says I'm a new user attempting to publish content with outside links. Those outside links are my sources. [[User:Soboyed|Soboyed]] ([[User talk:Soboyed|discuss]] • [[Special:Contributions/Soboyed|contribs]]) 04:52, 2 April 2026 (UTC)

:This restriction is automatically lifted after you have edited for a certain time (I don't recall that time off-hand, but it is not long). This is designed to stop spam. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 04:53, 2 April 2026 (UTC)

== Showing error to publish a Post ==

My  action was constructive, not destructive, please allow to publish it. [[Special:Contributions/&amp;#126;2026-20906-18|&amp;#126;2026-20906-18]] ([[User talk:&amp;#126;2026-20906-18|talk]]) 08:06, 4 April 2026 (UTC)

:Maybe you got caught in a filter. Consider [[Special:CreateAccount|creating an account]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:06, 4 April 2026 (UTC)
:Your edits, [https://en.wikiversity.org/w/index.php?title=Special:AbuseLog&amp;wpSearchUser=%7E2026-20906-18 these ones], seems to have tripped a filter when you tried to create a page on [[Create]] which external links. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 23:58, 4 April 2026 (UTC)
:Have you read my [https://en.wikiversity.org/w/index.php?title=Wikiversity:Request_custodian_action&amp;diff=prev&amp;oldid=2802219 previous reply] to you @[[User:~2026-20906-18|~2026-20906-18]]? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:02, 6 April 2026 (UTC)</text>
      <sha1>o9ds0epi7k3l1nmn9nh5871yezm50kw</sha1>
    </revision>
    <revision>
      <id>2809710</id>
      <parentid>2809708</parentid>
      <timestamp>2026-05-16T19:25:01Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Abuse filters which should be deleted */ archive from [[Wikiversity:Request custodian action]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809710</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="27494" sha1="kljmsp5rfndxxtskbigjymwsb8f9kx1" xml:space="preserve">{{Archive|Wikiversity:Request custodian action}}

== Sidewide count.js ==

i would like something like: [[Template:User contrib count/count.js]]. i created [[Template:User contrib count]] and a user/common.js. {{User contrib count}}.&lt;br&gt;&lt;br&gt; so a &quot;count.js&quot; would complete it. See [[User:Harold Foppele/common.js]].
If an Administrator could help please. Cheers [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 19:22, 18 January 2026 (UTC)

== need to add my profile ==

im trying to add new profile content  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:03, 4 February 2026 (UTC)

:You can edit it now. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:05, 4 February 2026 (UTC)
::where can create a new one [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)
:::i have created and its in sandbox. i would like to know when it will be approved  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 19:38, 4 February 2026 (UTC)
::::Please don’t create [[wv:spam|spam]] pages as it will be deleted. Please also read [[WV:Scope]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 04:01, 5 February 2026 (UTC)

== Im trying to add new profile while add content its shows not alowed ==

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Exceeded New Page Limit

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)

== New User: cannot create talk page ==

Hi, I am a new user of Wikiversity and I wanted to create a talk page for the article [[ChatGPT's Essay on Kohlberg's Theory: AI's Use in Academic Writing]]. As a new user, I was barred from performing this action. The text that I wanted to add to the talk page is:

&lt;blockquote&gt;
I have doubts as to to the reliability of this essay. Take for rexample the sentence:

&lt;blockquote&gt;
Due to its efficiency, AI has saved 380,000-403,000 lives per year in European healthcare as reported in a recent Deloitte and MedTech Europe report&lt;ref&gt;Dantas, C., Mackiewicz, K., Tageo, V., Jacucci, G., Guardado, D., Ortet, S., Varlamis, I., Maniadakis, M., De Lera, E., Quintas, J., Kocsis, O., &amp; Vassiliou, C. (2021). Benefits and hurdles of AI in the workplace – what comes next? ''International Journal of Artificial Intelligence and Expert Systems, 10'', 9-17. https://www.researchgate.net/publication/351993615_Benefits_and_Hurdles_of_AI_In_The_Workplace_-What_Comes_Next&lt;/ref&gt;.
&lt;/blockquote&gt;

Reading the reference (freely available on ResearchGate), one notes:

# that the reference is from 2021 (predating the widespread use of LLMs such as ChatGPT and the associated 'AI' boom), and
# that the reference factually contradicts this essay.

Quoting from the reference:

&lt;blockquote&gt;
There are enormous benefits of applying AI-based solutions to monitor workers’ health and prevent accidents or, currently, COVID-19 infections, and those benefits are reported with enormous potential. According to the recent Deloitte and MedTech Europe report [11], implementing AI in European healthcare systems could save up 380,000 to 403,000 lives annually or €170.9 to 212.4 billion per year.
&lt;/blockquote&gt;

Not that the reference says ''could save'', not ''saves'' as in the essay.

This calls into question the reliability of the essay.

&lt;/blockquote&gt;

Could an administrator make this addition for me? Thank you! 
{{reflist}}
[[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 06:53, 5 February 2026 (UTC)

:@[[User:Æolus|Æolus]] I have added it for you, you can change the header and sign it now. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 08:05, 5 February 2026 (UTC)
::Thank you! [[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 12:43, 5 February 2026 (UTC)

== Disallowed to add a page on a course ==

I'm trying to populate a newly created course on Wikiversity, but it blocks me from creating more pages with &quot;New User Exceeded New Page Limit&quot;. Could this be lifted please? [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 13:21, 15 February 2026 (UTC)

:Sorry! Never mind. I was trying to create a new article instead of a new page. All good now. [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 14:03, 15 February 2026 (UTC)

== Harold Foppele adding LLM-generated nonsense and personal fiction ==

I became aware of [[User:Harold Foppele]]'s editing after I deleted some of his uploads on Commons. He appears to be adding a large amount of text and images that are some combination of personal fiction and LLM-generated nonsense. This includes:
*[[Quantum Ultra fast lasers#Future thought experiment|Personal speculative fiction]] in an otherwise &quot;nonfiction&quot; article
*Uploading nonsense LLM-created [[:File:Rontosecond pulse laser (Schematic).jpg|diagrams]] and [[:File:Rontosecond pulse laser (Futuristic).jpg|renders]] for nonexistent lab equipment, with fake source (on Commons, he indicated these files as having been created by him using an LLM)
*Uploading nonsense LLM-created images of equations with obvious artifacts. These images, such as [[:File:Redfield equation (non-Markovian).png]] and [[:File:Lindblad equation (Markovian).png]], don't even match the text he puts them with.
Much of his writing is also of extremely poor quality, to the point where it's not clear whether it's written by him or an LLM. I'm not an active editor on this project, so I'm not as familiar with the standards here, but I believe this is worth custodian attention. [[User:Pi.1415926535|Pi.1415926535]] ([[User talk:Pi.1415926535|discuss]] • [[Special:Contributions/Pi.1415926535|contribs]]) 03:06, 23 February 2026 (UTC)

:Fake source ''and'' contradictory copyright info, claiming both public domain and CC license. Moreover, if they are indeed nearly-direct LLM output, depending on jurisdiction they may not even be eligible for copyright.
:I've put speedy deletion marks for the equations, because they're obviously not coherent mathematical equations (the parentheses don't match, the symbols merge into each other the way text in image models often do, etc) [[User:Sesquilinear|Sesquilinear]] ([[User talk:Sesquilinear|discuss]] • [[Special:Contributions/Sesquilinear|contribs]]) 21:50, 7 March 2026 (UTC)

== Repeated removal of RFD notices by Harold Foppele ==

{{User|Harold Foppele }}

This editor is appearing in multiple noticeboards for behaviour which is contentious. Ther latest adventure is the repeated removal of tye RFD notice at [[Quantum/Henry C. Kapteyn]]. You will see from their contributions record the number of times. I have warned Tham on their user tag page that this is tantaomunt to volunteering to be blocked here. They have a track record of achieving blocks on enWiki and Commons already.

They have all the appearance of shooting not to understand when given direct information about their behaviour, whichever project they are editing, and are fast becoming a time sink. Their behaviour across multiple WMF sites may well lead to a Global Lock, but I do not believe they have quite reached the threshold for that.

I believe that what is required is a preventative block to seek to ensure thatchy understand the seriousness of their behaviour, and the need to be collegial. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 23:03, 4 March 2026 (UTC)
: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:45, 8 March 2026 (UTC)

== Blocks for sockpuppet ==

Please block [[User:Harold Foppele]] and [[User:Johnwilliamsiii]] for sockpuppetry based on [https://en.wikipedia.org/wiki/Wikipedia:Sockpuppet_investigations/Harold_Foppele en wiki] CU and [https://commons.wikimedia.org/w/index.php?diff=1177465640 commons] CU investigations. The user has also violated copyright, see the above discussion. A block is necessary to prevent further abuse. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:30, 8 March 2026 (UTC)

:&lt;small&gt;@[[User:MathXplore|MathXplore]]&lt;/small&gt; [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:31, 8 March 2026 (UTC)
:: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:44, 8 March 2026 (UTC)
:CC. @[[User:Timtrent|Timtrent]], @[[User:Sesquilinear|Sesquilinear]], @[[User:Pi.1415926535|Pi.1415926535]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:33, 8 March 2026 (UTC)
::Thank you for the ping. I concur based on [[w:en:WP:DUCK|behaviour]]. CUs appear divided. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 11:41, 8 March 2026 (UTC)

== Problem when trying to start a discussion with authors of the Plurilingual education portal ==

The authors I wanted to discuss with are called &quot;Project PEP&quot; and my name is Franch Chandler. How can I be allowed to do so ? [[User:French Chandler|French Chandler]] ([[User talk:French Chandler|discuss]] • [[Special:Contributions/French Chandler|contribs]]) 18:25, 16 March 2026 (UTC)

:@[[User:French Chandler|French Chandler]] place your qestion [https://en.wikiversity.org/w/index.php?title=User_talk:Projet_PEP&amp;action=edit into the dialog box] on this link and hit Publish page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:22, 16 March 2026 (UTC)

== Please publish my post ==

My post is about &quot;Every child grows and develops at their own pace, but some may experience challenges that affect their ability to perform everyday tasks. These challenges can include difficulties with fine motor skills, sensory processing, handwriting, feeding, and self-regulation. When these issues are not addressed early, they can impact a child’s confidence, academic performance, and independence.

With the rise of digital healthcare services, '''online physical therapy''' has emerged as a powerful and accessible solution for parents seeking support for their children. This modern approach provides structured, personalized therapy programs that can be accessed from the comfort of home, making it easier for families to ensure consistent care.&quot; [[User:Skyabovetherapy|Skyabovetherapy]] ([[User talk:Skyabovetherapy|discuss]] • [[Special:Contributions/Skyabovetherapy|contribs]]) 12:28, 28 March 2026 (UTC)

:@[[User:Skyabovetherapy|Skyabovetherapy]] Well, you can publish it yourself, Wikiversity is a free environement, where everybody can create educational resources. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 14:11, 29 March 2026 (UTC)
::They actually triggered some abuse filters. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 16:24, 29 March 2026 (UTC)
:I looked at your attempts to add this text and I see a link to one website repeated many times, which reminds me of the misuse of Wikiversity for self-promotion or to increase the importance of the website. It is necessary to remind you here that Wikiversity is not a place for promotion, but a place for education. So if you want to educate, it will not be a problem to create the page without external links with a clearly defined procedure for how people should use it and what to expect from it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:07, 1 April 2026 (UTC)

== New user limit ==

Hi, I am creating an AIPA Method learning resource page. 

I am the author of the linked research, and I hit the “new user limit” and “new page with external link” filters while publishing. 

Here is the link to the page in creation: [https://en.wikiversity.org/w/index.php?title=AIPA_Method&amp;veaction=edit] 

Thank you for your help. 

Best regards, 

Senad Dizdarević [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:19, 30 March 2026 (UTC)

:@[[User:Senad Dizdarević|Senad Dizdarević]] I should admit I dont know, what is &quot;new user limit&quot;, but if filter blocks your page because of certain external link, you may force to save anyway and sometimes it works. It should not work, when the website is blacklisted. As of now, I am not seeing you to save page in main namespace, so try to save it without external links first. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:30, 30 March 2026 (UTC)
::Thank you, you are very kind. 
::I will wait a day, and try again (without links, too). 
::Today, I already created About Me info page, and maybe that is enough for the filters for one day.  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:53, 30 March 2026 (UTC)
:::Well, I have analyzed your contribution to Wikiversity and I should point out here, that this project is not a place for advertising, so there is no way of promoting your books and authority this way. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:56, 1 April 2026 (UTC)
::::Hi, my About Me page is just an info page with the neutral as possible presentation of my work. 
::::There is a big difference between informing and advertising. Informing is neutrally stating that something exists and requiring no action, while advertising is a special communication form with intent to cause certain action from readers. For example, click here, click there, order this, buy that. 
::::There is no such intention, form, or terms on my info page. Just neutral information. I don't hide and I am not ashamed that I am write and author, and that is a part of the usual bio, including works. I checked your user page: &quot;I graduated from the Czech University of Life Sciences in Prague and studied information science at the Faculty of Arts of Charles University.&quot; I think that if you had written a book on Life Science, you would have mentioned that as well.
::::Most of the Info page is about my research and AIPA Method which is a valid contribution to psychology, consciousness studies, identity theory, and personality development. Actually, my paper '''AIPA Method: A Cognitive-Phenomenological Model for Identity Reconstruction and Stabilization in Pure Awareness''' is now in the peer review procedure at Journal of Consciousness Studies. 
::::Here is a part from the Wikiversity AIPA Method page in creation (waiting for the end of the time limit for new users):    [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:47, 2 April 2026 (UTC)
:::::For the unknown reasons, the form didn't publish my second part of the message: 
:::::I believe this is a valid contribution to Wikiversity. 
:::::Best Regards, 
:::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:52, 2 April 2026 (UTC)
::::::And the third try: 
:::::: == Introduction ==
::::::The AIPA Method addresses a gap in contemporary personal development and consciousness science: most evidence‑based approaches (CBT, MBSR, MBCT, standard meditation) operate at the level of mental content—reframing thoughts, observing them, or reducing their impact—rather than at the level of identity structure. In contrast, AIPA targets the structural relationship between the self and the mind, aiming at durable identity reconstruction rooted in Pure Awareness rather than symptom management.
::::::The central research question of the primary AIPA preprint is whether a structured, sequentially staged method can produce permanent identity reconstruction rooted in Pure Awareness, and how such a method compares to established approaches in scope, mechanism, and outcome.
:::::: == Theoretical foundations ==
::::::The AIPA framework is grounded in the cognitive‑phenomenological tradition (e.g., McAdams, Varela, Metzinger, Erikson), contemporary consciousness science on minimal phenomenal experience, and qualitative methods advocacy in psychology. It builds directly on:
::::::* Empirical work on pure awareness and Minimal Phenomenal Experience (MPE), especially Gamma &amp; Metzinger’s large‑scale study of content‑reduced awareness states.
::::::* Metzinger’s proposal of minimal phenomenal experience as an entry point for a minimal unifying model of consciousness.
::::::* Narrative identity and partial‑self models within personality and identity theory.
::::::Within this backdrop, AIPA proposes Pure Awareness as a distinct, operationally specified state that can become a structural ground of identity rather than a transient meditative experience.
:::::: == Experiential empiricism ==
::::::The empirical foundation of the AIPA Method is explicitly first‑person and experiential, combining:
::::::* A 22‑year longitudinal autoethnographic self‑study (2003–2025) documenting partial personality episodes, protocol use, and outcomes.
::::::* A 13‑year prospective verification period with zero self‑reported recurrence of targeted harmful behaviors after a dated stabilization point (1 January 2006).
::::::* A high‑ecological‑validity “stress test” during acute bereavement, used to examine whether non‑reactive awareness remains stable under maximal provocation.
::::::* Two independent practitioner cases (an Amazon‑verified report and a structured questionnaire case) providing preliminary convergent signals across cognitive, emotional, behavioral, and identity dimensions.
::::::All central constructs (Pure Awareness, partial personalities, the Switch, identity stabilization) are operationalized with explicit phenomenological and behavioral criteria intended to enable replication and future third‑person measurement.
::::::I believe this is a valid contribution to Wikiversity. 
::::::Best regards, 
::::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:54, 2 April 2026 (UTC)

== Unable to publish pages  ==

Whenever I try to publish a page with linked sources it gets flagged and says I'm a new user attempting to publish content with outside links. Those outside links are my sources. [[User:Soboyed|Soboyed]] ([[User talk:Soboyed|discuss]] • [[Special:Contributions/Soboyed|contribs]]) 04:52, 2 April 2026 (UTC)

:This restriction is automatically lifted after you have edited for a certain time (I don't recall that time off-hand, but it is not long). This is designed to stop spam. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 04:53, 2 April 2026 (UTC)

== Showing error to publish a Post ==

My  action was constructive, not destructive, please allow to publish it. [[Special:Contributions/&amp;#126;2026-20906-18|&amp;#126;2026-20906-18]] ([[User talk:&amp;#126;2026-20906-18|talk]]) 08:06, 4 April 2026 (UTC)

:Maybe you got caught in a filter. Consider [[Special:CreateAccount|creating an account]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:06, 4 April 2026 (UTC)
:Your edits, [https://en.wikiversity.org/w/index.php?title=Special:AbuseLog&amp;wpSearchUser=%7E2026-20906-18 these ones], seems to have tripped a filter when you tried to create a page on [[Create]] which external links. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 23:58, 4 April 2026 (UTC)
:Have you read my [https://en.wikiversity.org/w/index.php?title=Wikiversity:Request_custodian_action&amp;diff=prev&amp;oldid=2802219 previous reply] to you @[[User:~2026-20906-18|~2026-20906-18]]? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:02, 6 April 2026 (UTC)

== Abuse filters which should be deleted ==

Hi, there are some abuse filters which should probably be deleted.
* [[Special:AbuseFilter/1]] (not needed anymore)
* [[Special:AbuseFilter/2]] (no hits since 2018)
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched)
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives)
* [[Special:AbuseFilter/5]] (no hits since 2023)
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore)
* [[Special:AbuseFilter/17]] (no hits since 2022)
* [[Special:AbuseFilter/19]] (no hits since 2019)
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive)
Thanks. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 03:51, 5 April 2026 (UTC)

:Why do these need to be deleted rather than inactivated? Do inactive abuse filters cause a server strain? —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:39, 5 April 2026 (UTC)
:: Deleted filters do not cause strain to the servers. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:28, 5 April 2026 (UTC)
:These sounds like sensible suggestions but, yes, would inactivation perhaps make more sense than deletion for at least some  filters? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:35, 5 April 2026 (UTC)
:I would keep them @[[User:Codename Noreste|Codename Noreste]]. Alternatively, I would turn off the ones that haven't caught anything for a long time, but I would leave them enabled in case they need to be turned on or improved. If someone has already written the code and we don't have hundreds of free man-hours of programmers on Wikiversity, the server load seems secondary to me, and is negligible compared to other things. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:11, 6 April 2026 (UTC)
:: I know how to write abuse filter code and regex, but I would recommend disabling filters that have never caught anything in a long time ''and'' those who made lots of false positives. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:09, 6 April 2026 (UTC)
:::Of course @[[User:Codename Noreste|Codename Noreste]], there are people here today who are capable of changing the code. But the question is what it will be like in a few years, the question is what will happen if those two are busy for a long time, etc. That's why I would leave it so that those who don't know much about code can be inspired by it and will need to do something with it someday - plus, more code for different types of filtering is actually great educational material on how those filters work. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:41, 17 April 2026 (UTC)

Here's the updated list of abuse filters under review with actions I've taken (several disabled, one basic code improvement, and some actions changed) - none have been deleted so they can all be edited and reactivayed - please suggest any further changes:
* [[Special:AbuseFilter/1]] (not needed anymore) - One time account spam bot - 4 hits over 10 years ago - Disabled in 2024 - May be useful in future
* [[Special:AbuseFilter/2]] (no hits since 2018) - Userspace spamming - 778 hits; none since 2018 likely due to global filters - Now disabled
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched) - Specific user page spam - 1,101 hits most recent 7 March 2026 - Still active - Kept enabled
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives) - Questionable Language (profanity) - 6,055 hits including very recently - However it was logging hits without taking any actions - Edited to reduce likelihood of false positives by only applying filter to users with low (&lt; 20) edit count and applied weak actions to tag and warn but not prevent publishing the content
* [[Special:AbuseFilter/5]] (no hits since 2023) - Blocked Solicitation Links - 95 hits; none since 2023 - blocks specific historical spam sites - Non-active - Now disabled
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore) - Not reviewed - They are currently disabled
* [[Special:AbuseFilter/17]] (no hits since 2022) - Fundamental Physics Edits - 347 hits; none since 2022 - Non-active and very specific for a historical issue - Now disabled 
* [[Special:AbuseFilter/19]] (no hits since 2019) - Page Creation - 20 hits; none since 2019 - Retained for historical reference and possible future updates - Now disabled
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive) - Globally Banned Editor (renamed to Low-edit Spam Monitor) - 2,829 hits including very recent - Only applies to users with less than 5 edits and takes no actions / monitoring only - Reviewing the details of the hits I don't see many false positives and have strengthened its actions to add a tag and warning

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:57, 9 April 2026 (UTC)</text>
      <sha1>kljmsp5rfndxxtskbigjymwsb8f9kx1</sha1>
    </revision>
    <revision>
      <id>2809713</id>
      <parentid>2809710</parentid>
      <timestamp>2026-05-16T19:25:08Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Block request */ archive from [[Wikiversity:Request custodian action]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809713</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="27928" sha1="mlx7d5e55i2fsnee7cfguvd02gl5po8" xml:space="preserve">{{Archive|Wikiversity:Request custodian action}}

== Sidewide count.js ==

i would like something like: [[Template:User contrib count/count.js]]. i created [[Template:User contrib count]] and a user/common.js. {{User contrib count}}.&lt;br&gt;&lt;br&gt; so a &quot;count.js&quot; would complete it. See [[User:Harold Foppele/common.js]].
If an Administrator could help please. Cheers [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 19:22, 18 January 2026 (UTC)

== need to add my profile ==

im trying to add new profile content  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:03, 4 February 2026 (UTC)

:You can edit it now. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:05, 4 February 2026 (UTC)
::where can create a new one [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)
:::i have created and its in sandbox. i would like to know when it will be approved  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 19:38, 4 February 2026 (UTC)
::::Please don’t create [[wv:spam|spam]] pages as it will be deleted. Please also read [[WV:Scope]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 04:01, 5 February 2026 (UTC)

== Im trying to add new profile while add content its shows not alowed ==

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Exceeded New Page Limit

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)

== New User: cannot create talk page ==

Hi, I am a new user of Wikiversity and I wanted to create a talk page for the article [[ChatGPT's Essay on Kohlberg's Theory: AI's Use in Academic Writing]]. As a new user, I was barred from performing this action. The text that I wanted to add to the talk page is:

&lt;blockquote&gt;
I have doubts as to to the reliability of this essay. Take for rexample the sentence:

&lt;blockquote&gt;
Due to its efficiency, AI has saved 380,000-403,000 lives per year in European healthcare as reported in a recent Deloitte and MedTech Europe report&lt;ref&gt;Dantas, C., Mackiewicz, K., Tageo, V., Jacucci, G., Guardado, D., Ortet, S., Varlamis, I., Maniadakis, M., De Lera, E., Quintas, J., Kocsis, O., &amp; Vassiliou, C. (2021). Benefits and hurdles of AI in the workplace – what comes next? ''International Journal of Artificial Intelligence and Expert Systems, 10'', 9-17. https://www.researchgate.net/publication/351993615_Benefits_and_Hurdles_of_AI_In_The_Workplace_-What_Comes_Next&lt;/ref&gt;.
&lt;/blockquote&gt;

Reading the reference (freely available on ResearchGate), one notes:

# that the reference is from 2021 (predating the widespread use of LLMs such as ChatGPT and the associated 'AI' boom), and
# that the reference factually contradicts this essay.

Quoting from the reference:

&lt;blockquote&gt;
There are enormous benefits of applying AI-based solutions to monitor workers’ health and prevent accidents or, currently, COVID-19 infections, and those benefits are reported with enormous potential. According to the recent Deloitte and MedTech Europe report [11], implementing AI in European healthcare systems could save up 380,000 to 403,000 lives annually or €170.9 to 212.4 billion per year.
&lt;/blockquote&gt;

Not that the reference says ''could save'', not ''saves'' as in the essay.

This calls into question the reliability of the essay.

&lt;/blockquote&gt;

Could an administrator make this addition for me? Thank you! 
{{reflist}}
[[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 06:53, 5 February 2026 (UTC)

:@[[User:Æolus|Æolus]] I have added it for you, you can change the header and sign it now. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 08:05, 5 February 2026 (UTC)
::Thank you! [[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 12:43, 5 February 2026 (UTC)

== Disallowed to add a page on a course ==

I'm trying to populate a newly created course on Wikiversity, but it blocks me from creating more pages with &quot;New User Exceeded New Page Limit&quot;. Could this be lifted please? [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 13:21, 15 February 2026 (UTC)

:Sorry! Never mind. I was trying to create a new article instead of a new page. All good now. [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 14:03, 15 February 2026 (UTC)

== Harold Foppele adding LLM-generated nonsense and personal fiction ==

I became aware of [[User:Harold Foppele]]'s editing after I deleted some of his uploads on Commons. He appears to be adding a large amount of text and images that are some combination of personal fiction and LLM-generated nonsense. This includes:
*[[Quantum Ultra fast lasers#Future thought experiment|Personal speculative fiction]] in an otherwise &quot;nonfiction&quot; article
*Uploading nonsense LLM-created [[:File:Rontosecond pulse laser (Schematic).jpg|diagrams]] and [[:File:Rontosecond pulse laser (Futuristic).jpg|renders]] for nonexistent lab equipment, with fake source (on Commons, he indicated these files as having been created by him using an LLM)
*Uploading nonsense LLM-created images of equations with obvious artifacts. These images, such as [[:File:Redfield equation (non-Markovian).png]] and [[:File:Lindblad equation (Markovian).png]], don't even match the text he puts them with.
Much of his writing is also of extremely poor quality, to the point where it's not clear whether it's written by him or an LLM. I'm not an active editor on this project, so I'm not as familiar with the standards here, but I believe this is worth custodian attention. [[User:Pi.1415926535|Pi.1415926535]] ([[User talk:Pi.1415926535|discuss]] • [[Special:Contributions/Pi.1415926535|contribs]]) 03:06, 23 February 2026 (UTC)

:Fake source ''and'' contradictory copyright info, claiming both public domain and CC license. Moreover, if they are indeed nearly-direct LLM output, depending on jurisdiction they may not even be eligible for copyright.
:I've put speedy deletion marks for the equations, because they're obviously not coherent mathematical equations (the parentheses don't match, the symbols merge into each other the way text in image models often do, etc) [[User:Sesquilinear|Sesquilinear]] ([[User talk:Sesquilinear|discuss]] • [[Special:Contributions/Sesquilinear|contribs]]) 21:50, 7 March 2026 (UTC)

== Repeated removal of RFD notices by Harold Foppele ==

{{User|Harold Foppele }}

This editor is appearing in multiple noticeboards for behaviour which is contentious. Ther latest adventure is the repeated removal of tye RFD notice at [[Quantum/Henry C. Kapteyn]]. You will see from their contributions record the number of times. I have warned Tham on their user tag page that this is tantaomunt to volunteering to be blocked here. They have a track record of achieving blocks on enWiki and Commons already.

They have all the appearance of shooting not to understand when given direct information about their behaviour, whichever project they are editing, and are fast becoming a time sink. Their behaviour across multiple WMF sites may well lead to a Global Lock, but I do not believe they have quite reached the threshold for that.

I believe that what is required is a preventative block to seek to ensure thatchy understand the seriousness of their behaviour, and the need to be collegial. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 23:03, 4 March 2026 (UTC)
: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:45, 8 March 2026 (UTC)

== Blocks for sockpuppet ==

Please block [[User:Harold Foppele]] and [[User:Johnwilliamsiii]] for sockpuppetry based on [https://en.wikipedia.org/wiki/Wikipedia:Sockpuppet_investigations/Harold_Foppele en wiki] CU and [https://commons.wikimedia.org/w/index.php?diff=1177465640 commons] CU investigations. The user has also violated copyright, see the above discussion. A block is necessary to prevent further abuse. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:30, 8 March 2026 (UTC)

:&lt;small&gt;@[[User:MathXplore|MathXplore]]&lt;/small&gt; [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:31, 8 March 2026 (UTC)
:: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:44, 8 March 2026 (UTC)
:CC. @[[User:Timtrent|Timtrent]], @[[User:Sesquilinear|Sesquilinear]], @[[User:Pi.1415926535|Pi.1415926535]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:33, 8 March 2026 (UTC)
::Thank you for the ping. I concur based on [[w:en:WP:DUCK|behaviour]]. CUs appear divided. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 11:41, 8 March 2026 (UTC)

== Problem when trying to start a discussion with authors of the Plurilingual education portal ==

The authors I wanted to discuss with are called &quot;Project PEP&quot; and my name is Franch Chandler. How can I be allowed to do so ? [[User:French Chandler|French Chandler]] ([[User talk:French Chandler|discuss]] • [[Special:Contributions/French Chandler|contribs]]) 18:25, 16 March 2026 (UTC)

:@[[User:French Chandler|French Chandler]] place your qestion [https://en.wikiversity.org/w/index.php?title=User_talk:Projet_PEP&amp;action=edit into the dialog box] on this link and hit Publish page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:22, 16 March 2026 (UTC)

== Please publish my post ==

My post is about &quot;Every child grows and develops at their own pace, but some may experience challenges that affect their ability to perform everyday tasks. These challenges can include difficulties with fine motor skills, sensory processing, handwriting, feeding, and self-regulation. When these issues are not addressed early, they can impact a child’s confidence, academic performance, and independence.

With the rise of digital healthcare services, '''online physical therapy''' has emerged as a powerful and accessible solution for parents seeking support for their children. This modern approach provides structured, personalized therapy programs that can be accessed from the comfort of home, making it easier for families to ensure consistent care.&quot; [[User:Skyabovetherapy|Skyabovetherapy]] ([[User talk:Skyabovetherapy|discuss]] • [[Special:Contributions/Skyabovetherapy|contribs]]) 12:28, 28 March 2026 (UTC)

:@[[User:Skyabovetherapy|Skyabovetherapy]] Well, you can publish it yourself, Wikiversity is a free environement, where everybody can create educational resources. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 14:11, 29 March 2026 (UTC)
::They actually triggered some abuse filters. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 16:24, 29 March 2026 (UTC)
:I looked at your attempts to add this text and I see a link to one website repeated many times, which reminds me of the misuse of Wikiversity for self-promotion or to increase the importance of the website. It is necessary to remind you here that Wikiversity is not a place for promotion, but a place for education. So if you want to educate, it will not be a problem to create the page without external links with a clearly defined procedure for how people should use it and what to expect from it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:07, 1 April 2026 (UTC)

== New user limit ==

Hi, I am creating an AIPA Method learning resource page. 

I am the author of the linked research, and I hit the “new user limit” and “new page with external link” filters while publishing. 

Here is the link to the page in creation: [https://en.wikiversity.org/w/index.php?title=AIPA_Method&amp;veaction=edit] 

Thank you for your help. 

Best regards, 

Senad Dizdarević [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:19, 30 March 2026 (UTC)

:@[[User:Senad Dizdarević|Senad Dizdarević]] I should admit I dont know, what is &quot;new user limit&quot;, but if filter blocks your page because of certain external link, you may force to save anyway and sometimes it works. It should not work, when the website is blacklisted. As of now, I am not seeing you to save page in main namespace, so try to save it without external links first. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:30, 30 March 2026 (UTC)
::Thank you, you are very kind. 
::I will wait a day, and try again (without links, too). 
::Today, I already created About Me info page, and maybe that is enough for the filters for one day.  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:53, 30 March 2026 (UTC)
:::Well, I have analyzed your contribution to Wikiversity and I should point out here, that this project is not a place for advertising, so there is no way of promoting your books and authority this way. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:56, 1 April 2026 (UTC)
::::Hi, my About Me page is just an info page with the neutral as possible presentation of my work. 
::::There is a big difference between informing and advertising. Informing is neutrally stating that something exists and requiring no action, while advertising is a special communication form with intent to cause certain action from readers. For example, click here, click there, order this, buy that. 
::::There is no such intention, form, or terms on my info page. Just neutral information. I don't hide and I am not ashamed that I am write and author, and that is a part of the usual bio, including works. I checked your user page: &quot;I graduated from the Czech University of Life Sciences in Prague and studied information science at the Faculty of Arts of Charles University.&quot; I think that if you had written a book on Life Science, you would have mentioned that as well.
::::Most of the Info page is about my research and AIPA Method which is a valid contribution to psychology, consciousness studies, identity theory, and personality development. Actually, my paper '''AIPA Method: A Cognitive-Phenomenological Model for Identity Reconstruction and Stabilization in Pure Awareness''' is now in the peer review procedure at Journal of Consciousness Studies. 
::::Here is a part from the Wikiversity AIPA Method page in creation (waiting for the end of the time limit for new users):    [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:47, 2 April 2026 (UTC)
:::::For the unknown reasons, the form didn't publish my second part of the message: 
:::::I believe this is a valid contribution to Wikiversity. 
:::::Best Regards, 
:::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:52, 2 April 2026 (UTC)
::::::And the third try: 
:::::: == Introduction ==
::::::The AIPA Method addresses a gap in contemporary personal development and consciousness science: most evidence‑based approaches (CBT, MBSR, MBCT, standard meditation) operate at the level of mental content—reframing thoughts, observing them, or reducing their impact—rather than at the level of identity structure. In contrast, AIPA targets the structural relationship between the self and the mind, aiming at durable identity reconstruction rooted in Pure Awareness rather than symptom management.
::::::The central research question of the primary AIPA preprint is whether a structured, sequentially staged method can produce permanent identity reconstruction rooted in Pure Awareness, and how such a method compares to established approaches in scope, mechanism, and outcome.
:::::: == Theoretical foundations ==
::::::The AIPA framework is grounded in the cognitive‑phenomenological tradition (e.g., McAdams, Varela, Metzinger, Erikson), contemporary consciousness science on minimal phenomenal experience, and qualitative methods advocacy in psychology. It builds directly on:
::::::* Empirical work on pure awareness and Minimal Phenomenal Experience (MPE), especially Gamma &amp; Metzinger’s large‑scale study of content‑reduced awareness states.
::::::* Metzinger’s proposal of minimal phenomenal experience as an entry point for a minimal unifying model of consciousness.
::::::* Narrative identity and partial‑self models within personality and identity theory.
::::::Within this backdrop, AIPA proposes Pure Awareness as a distinct, operationally specified state that can become a structural ground of identity rather than a transient meditative experience.
:::::: == Experiential empiricism ==
::::::The empirical foundation of the AIPA Method is explicitly first‑person and experiential, combining:
::::::* A 22‑year longitudinal autoethnographic self‑study (2003–2025) documenting partial personality episodes, protocol use, and outcomes.
::::::* A 13‑year prospective verification period with zero self‑reported recurrence of targeted harmful behaviors after a dated stabilization point (1 January 2006).
::::::* A high‑ecological‑validity “stress test” during acute bereavement, used to examine whether non‑reactive awareness remains stable under maximal provocation.
::::::* Two independent practitioner cases (an Amazon‑verified report and a structured questionnaire case) providing preliminary convergent signals across cognitive, emotional, behavioral, and identity dimensions.
::::::All central constructs (Pure Awareness, partial personalities, the Switch, identity stabilization) are operationalized with explicit phenomenological and behavioral criteria intended to enable replication and future third‑person measurement.
::::::I believe this is a valid contribution to Wikiversity. 
::::::Best regards, 
::::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:54, 2 April 2026 (UTC)

== Unable to publish pages  ==

Whenever I try to publish a page with linked sources it gets flagged and says I'm a new user attempting to publish content with outside links. Those outside links are my sources. [[User:Soboyed|Soboyed]] ([[User talk:Soboyed|discuss]] • [[Special:Contributions/Soboyed|contribs]]) 04:52, 2 April 2026 (UTC)

:This restriction is automatically lifted after you have edited for a certain time (I don't recall that time off-hand, but it is not long). This is designed to stop spam. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 04:53, 2 April 2026 (UTC)

== Showing error to publish a Post ==

My  action was constructive, not destructive, please allow to publish it. [[Special:Contributions/&amp;#126;2026-20906-18|&amp;#126;2026-20906-18]] ([[User talk:&amp;#126;2026-20906-18|talk]]) 08:06, 4 April 2026 (UTC)

:Maybe you got caught in a filter. Consider [[Special:CreateAccount|creating an account]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:06, 4 April 2026 (UTC)
:Your edits, [https://en.wikiversity.org/w/index.php?title=Special:AbuseLog&amp;wpSearchUser=%7E2026-20906-18 these ones], seems to have tripped a filter when you tried to create a page on [[Create]] which external links. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 23:58, 4 April 2026 (UTC)
:Have you read my [https://en.wikiversity.org/w/index.php?title=Wikiversity:Request_custodian_action&amp;diff=prev&amp;oldid=2802219 previous reply] to you @[[User:~2026-20906-18|~2026-20906-18]]? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:02, 6 April 2026 (UTC)

== Abuse filters which should be deleted ==

Hi, there are some abuse filters which should probably be deleted.
* [[Special:AbuseFilter/1]] (not needed anymore)
* [[Special:AbuseFilter/2]] (no hits since 2018)
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched)
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives)
* [[Special:AbuseFilter/5]] (no hits since 2023)
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore)
* [[Special:AbuseFilter/17]] (no hits since 2022)
* [[Special:AbuseFilter/19]] (no hits since 2019)
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive)
Thanks. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 03:51, 5 April 2026 (UTC)

:Why do these need to be deleted rather than inactivated? Do inactive abuse filters cause a server strain? —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:39, 5 April 2026 (UTC)
:: Deleted filters do not cause strain to the servers. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:28, 5 April 2026 (UTC)
:These sounds like sensible suggestions but, yes, would inactivation perhaps make more sense than deletion for at least some  filters? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:35, 5 April 2026 (UTC)
:I would keep them @[[User:Codename Noreste|Codename Noreste]]. Alternatively, I would turn off the ones that haven't caught anything for a long time, but I would leave them enabled in case they need to be turned on or improved. If someone has already written the code and we don't have hundreds of free man-hours of programmers on Wikiversity, the server load seems secondary to me, and is negligible compared to other things. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:11, 6 April 2026 (UTC)
:: I know how to write abuse filter code and regex, but I would recommend disabling filters that have never caught anything in a long time ''and'' those who made lots of false positives. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:09, 6 April 2026 (UTC)
:::Of course @[[User:Codename Noreste|Codename Noreste]], there are people here today who are capable of changing the code. But the question is what it will be like in a few years, the question is what will happen if those two are busy for a long time, etc. That's why I would leave it so that those who don't know much about code can be inspired by it and will need to do something with it someday - plus, more code for different types of filtering is actually great educational material on how those filters work. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:41, 17 April 2026 (UTC)

Here's the updated list of abuse filters under review with actions I've taken (several disabled, one basic code improvement, and some actions changed) - none have been deleted so they can all be edited and reactivayed - please suggest any further changes:
* [[Special:AbuseFilter/1]] (not needed anymore) - One time account spam bot - 4 hits over 10 years ago - Disabled in 2024 - May be useful in future
* [[Special:AbuseFilter/2]] (no hits since 2018) - Userspace spamming - 778 hits; none since 2018 likely due to global filters - Now disabled
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched) - Specific user page spam - 1,101 hits most recent 7 March 2026 - Still active - Kept enabled
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives) - Questionable Language (profanity) - 6,055 hits including very recently - However it was logging hits without taking any actions - Edited to reduce likelihood of false positives by only applying filter to users with low (&lt; 20) edit count and applied weak actions to tag and warn but not prevent publishing the content
* [[Special:AbuseFilter/5]] (no hits since 2023) - Blocked Solicitation Links - 95 hits; none since 2023 - blocks specific historical spam sites - Non-active - Now disabled
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore) - Not reviewed - They are currently disabled
* [[Special:AbuseFilter/17]] (no hits since 2022) - Fundamental Physics Edits - 347 hits; none since 2022 - Non-active and very specific for a historical issue - Now disabled 
* [[Special:AbuseFilter/19]] (no hits since 2019) - Page Creation - 20 hits; none since 2019 - Retained for historical reference and possible future updates - Now disabled
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive) - Globally Banned Editor (renamed to Low-edit Spam Monitor) - 2,829 hits including very recent - Only applies to users with less than 5 edits and takes no actions / monitoring only - Reviewing the details of the hits I don't see many false positives and have strengthened its actions to add a tag and warning

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:57, 9 April 2026 (UTC)

== Block request ==

Please block ~2026-20985-80/~2026-21079-90/~2026-21223-88. Reason: Vandalism. [[User:Àncilu|Àncilu]] ([[User talk:Àncilu|discuss]] • [[Special:Contributions/Àncilu|contribs]]) 23:24, 5 April 2026 (UTC)

:All edits should be deleted and the first is blocked by Atcovi. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:33, 6 April 2026 (UTC)</text>
      <sha1>mlx7d5e55i2fsnee7cfguvd02gl5po8</sha1>
    </revision>
    <revision>
      <id>2809715</id>
      <parentid>2809713</parentid>
      <timestamp>2026-05-16T19:25:16Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Antispam - Filter 12 */ archive from [[Wikiversity:Request custodian action]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809715</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="29172" sha1="mzyqqg97z8l34lsvktb4ftm8x5llgd4" xml:space="preserve">{{Archive|Wikiversity:Request custodian action}}

== Sidewide count.js ==

i would like something like: [[Template:User contrib count/count.js]]. i created [[Template:User contrib count]] and a user/common.js. {{User contrib count}}.&lt;br&gt;&lt;br&gt; so a &quot;count.js&quot; would complete it. See [[User:Harold Foppele/common.js]].
If an Administrator could help please. Cheers [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 19:22, 18 January 2026 (UTC)

== need to add my profile ==

im trying to add new profile content  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:03, 4 February 2026 (UTC)

:You can edit it now. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:05, 4 February 2026 (UTC)
::where can create a new one [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)
:::i have created and its in sandbox. i would like to know when it will be approved  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 19:38, 4 February 2026 (UTC)
::::Please don’t create [[wv:spam|spam]] pages as it will be deleted. Please also read [[WV:Scope]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 04:01, 5 February 2026 (UTC)

== Im trying to add new profile while add content its shows not alowed ==

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Exceeded New Page Limit

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)

== New User: cannot create talk page ==

Hi, I am a new user of Wikiversity and I wanted to create a talk page for the article [[ChatGPT's Essay on Kohlberg's Theory: AI's Use in Academic Writing]]. As a new user, I was barred from performing this action. The text that I wanted to add to the talk page is:

&lt;blockquote&gt;
I have doubts as to to the reliability of this essay. Take for rexample the sentence:

&lt;blockquote&gt;
Due to its efficiency, AI has saved 380,000-403,000 lives per year in European healthcare as reported in a recent Deloitte and MedTech Europe report&lt;ref&gt;Dantas, C., Mackiewicz, K., Tageo, V., Jacucci, G., Guardado, D., Ortet, S., Varlamis, I., Maniadakis, M., De Lera, E., Quintas, J., Kocsis, O., &amp; Vassiliou, C. (2021). Benefits and hurdles of AI in the workplace – what comes next? ''International Journal of Artificial Intelligence and Expert Systems, 10'', 9-17. https://www.researchgate.net/publication/351993615_Benefits_and_Hurdles_of_AI_In_The_Workplace_-What_Comes_Next&lt;/ref&gt;.
&lt;/blockquote&gt;

Reading the reference (freely available on ResearchGate), one notes:

# that the reference is from 2021 (predating the widespread use of LLMs such as ChatGPT and the associated 'AI' boom), and
# that the reference factually contradicts this essay.

Quoting from the reference:

&lt;blockquote&gt;
There are enormous benefits of applying AI-based solutions to monitor workers’ health and prevent accidents or, currently, COVID-19 infections, and those benefits are reported with enormous potential. According to the recent Deloitte and MedTech Europe report [11], implementing AI in European healthcare systems could save up 380,000 to 403,000 lives annually or €170.9 to 212.4 billion per year.
&lt;/blockquote&gt;

Not that the reference says ''could save'', not ''saves'' as in the essay.

This calls into question the reliability of the essay.

&lt;/blockquote&gt;

Could an administrator make this addition for me? Thank you! 
{{reflist}}
[[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 06:53, 5 February 2026 (UTC)

:@[[User:Æolus|Æolus]] I have added it for you, you can change the header and sign it now. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 08:05, 5 February 2026 (UTC)
::Thank you! [[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 12:43, 5 February 2026 (UTC)

== Disallowed to add a page on a course ==

I'm trying to populate a newly created course on Wikiversity, but it blocks me from creating more pages with &quot;New User Exceeded New Page Limit&quot;. Could this be lifted please? [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 13:21, 15 February 2026 (UTC)

:Sorry! Never mind. I was trying to create a new article instead of a new page. All good now. [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 14:03, 15 February 2026 (UTC)

== Harold Foppele adding LLM-generated nonsense and personal fiction ==

I became aware of [[User:Harold Foppele]]'s editing after I deleted some of his uploads on Commons. He appears to be adding a large amount of text and images that are some combination of personal fiction and LLM-generated nonsense. This includes:
*[[Quantum Ultra fast lasers#Future thought experiment|Personal speculative fiction]] in an otherwise &quot;nonfiction&quot; article
*Uploading nonsense LLM-created [[:File:Rontosecond pulse laser (Schematic).jpg|diagrams]] and [[:File:Rontosecond pulse laser (Futuristic).jpg|renders]] for nonexistent lab equipment, with fake source (on Commons, he indicated these files as having been created by him using an LLM)
*Uploading nonsense LLM-created images of equations with obvious artifacts. These images, such as [[:File:Redfield equation (non-Markovian).png]] and [[:File:Lindblad equation (Markovian).png]], don't even match the text he puts them with.
Much of his writing is also of extremely poor quality, to the point where it's not clear whether it's written by him or an LLM. I'm not an active editor on this project, so I'm not as familiar with the standards here, but I believe this is worth custodian attention. [[User:Pi.1415926535|Pi.1415926535]] ([[User talk:Pi.1415926535|discuss]] • [[Special:Contributions/Pi.1415926535|contribs]]) 03:06, 23 February 2026 (UTC)

:Fake source ''and'' contradictory copyright info, claiming both public domain and CC license. Moreover, if they are indeed nearly-direct LLM output, depending on jurisdiction they may not even be eligible for copyright.
:I've put speedy deletion marks for the equations, because they're obviously not coherent mathematical equations (the parentheses don't match, the symbols merge into each other the way text in image models often do, etc) [[User:Sesquilinear|Sesquilinear]] ([[User talk:Sesquilinear|discuss]] • [[Special:Contributions/Sesquilinear|contribs]]) 21:50, 7 March 2026 (UTC)

== Repeated removal of RFD notices by Harold Foppele ==

{{User|Harold Foppele }}

This editor is appearing in multiple noticeboards for behaviour which is contentious. Ther latest adventure is the repeated removal of tye RFD notice at [[Quantum/Henry C. Kapteyn]]. You will see from their contributions record the number of times. I have warned Tham on their user tag page that this is tantaomunt to volunteering to be blocked here. They have a track record of achieving blocks on enWiki and Commons already.

They have all the appearance of shooting not to understand when given direct information about their behaviour, whichever project they are editing, and are fast becoming a time sink. Their behaviour across multiple WMF sites may well lead to a Global Lock, but I do not believe they have quite reached the threshold for that.

I believe that what is required is a preventative block to seek to ensure thatchy understand the seriousness of their behaviour, and the need to be collegial. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 23:03, 4 March 2026 (UTC)
: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:45, 8 March 2026 (UTC)

== Blocks for sockpuppet ==

Please block [[User:Harold Foppele]] and [[User:Johnwilliamsiii]] for sockpuppetry based on [https://en.wikipedia.org/wiki/Wikipedia:Sockpuppet_investigations/Harold_Foppele en wiki] CU and [https://commons.wikimedia.org/w/index.php?diff=1177465640 commons] CU investigations. The user has also violated copyright, see the above discussion. A block is necessary to prevent further abuse. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:30, 8 March 2026 (UTC)

:&lt;small&gt;@[[User:MathXplore|MathXplore]]&lt;/small&gt; [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:31, 8 March 2026 (UTC)
:: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:44, 8 March 2026 (UTC)
:CC. @[[User:Timtrent|Timtrent]], @[[User:Sesquilinear|Sesquilinear]], @[[User:Pi.1415926535|Pi.1415926535]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:33, 8 March 2026 (UTC)
::Thank you for the ping. I concur based on [[w:en:WP:DUCK|behaviour]]. CUs appear divided. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 11:41, 8 March 2026 (UTC)

== Problem when trying to start a discussion with authors of the Plurilingual education portal ==

The authors I wanted to discuss with are called &quot;Project PEP&quot; and my name is Franch Chandler. How can I be allowed to do so ? [[User:French Chandler|French Chandler]] ([[User talk:French Chandler|discuss]] • [[Special:Contributions/French Chandler|contribs]]) 18:25, 16 March 2026 (UTC)

:@[[User:French Chandler|French Chandler]] place your qestion [https://en.wikiversity.org/w/index.php?title=User_talk:Projet_PEP&amp;action=edit into the dialog box] on this link and hit Publish page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:22, 16 March 2026 (UTC)

== Please publish my post ==

My post is about &quot;Every child grows and develops at their own pace, but some may experience challenges that affect their ability to perform everyday tasks. These challenges can include difficulties with fine motor skills, sensory processing, handwriting, feeding, and self-regulation. When these issues are not addressed early, they can impact a child’s confidence, academic performance, and independence.

With the rise of digital healthcare services, '''online physical therapy''' has emerged as a powerful and accessible solution for parents seeking support for their children. This modern approach provides structured, personalized therapy programs that can be accessed from the comfort of home, making it easier for families to ensure consistent care.&quot; [[User:Skyabovetherapy|Skyabovetherapy]] ([[User talk:Skyabovetherapy|discuss]] • [[Special:Contributions/Skyabovetherapy|contribs]]) 12:28, 28 March 2026 (UTC)

:@[[User:Skyabovetherapy|Skyabovetherapy]] Well, you can publish it yourself, Wikiversity is a free environement, where everybody can create educational resources. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 14:11, 29 March 2026 (UTC)
::They actually triggered some abuse filters. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 16:24, 29 March 2026 (UTC)
:I looked at your attempts to add this text and I see a link to one website repeated many times, which reminds me of the misuse of Wikiversity for self-promotion or to increase the importance of the website. It is necessary to remind you here that Wikiversity is not a place for promotion, but a place for education. So if you want to educate, it will not be a problem to create the page without external links with a clearly defined procedure for how people should use it and what to expect from it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:07, 1 April 2026 (UTC)

== New user limit ==

Hi, I am creating an AIPA Method learning resource page. 

I am the author of the linked research, and I hit the “new user limit” and “new page with external link” filters while publishing. 

Here is the link to the page in creation: [https://en.wikiversity.org/w/index.php?title=AIPA_Method&amp;veaction=edit] 

Thank you for your help. 

Best regards, 

Senad Dizdarević [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:19, 30 March 2026 (UTC)

:@[[User:Senad Dizdarević|Senad Dizdarević]] I should admit I dont know, what is &quot;new user limit&quot;, but if filter blocks your page because of certain external link, you may force to save anyway and sometimes it works. It should not work, when the website is blacklisted. As of now, I am not seeing you to save page in main namespace, so try to save it without external links first. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:30, 30 March 2026 (UTC)
::Thank you, you are very kind. 
::I will wait a day, and try again (without links, too). 
::Today, I already created About Me info page, and maybe that is enough for the filters for one day.  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:53, 30 March 2026 (UTC)
:::Well, I have analyzed your contribution to Wikiversity and I should point out here, that this project is not a place for advertising, so there is no way of promoting your books and authority this way. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:56, 1 April 2026 (UTC)
::::Hi, my About Me page is just an info page with the neutral as possible presentation of my work. 
::::There is a big difference between informing and advertising. Informing is neutrally stating that something exists and requiring no action, while advertising is a special communication form with intent to cause certain action from readers. For example, click here, click there, order this, buy that. 
::::There is no such intention, form, or terms on my info page. Just neutral information. I don't hide and I am not ashamed that I am write and author, and that is a part of the usual bio, including works. I checked your user page: &quot;I graduated from the Czech University of Life Sciences in Prague and studied information science at the Faculty of Arts of Charles University.&quot; I think that if you had written a book on Life Science, you would have mentioned that as well.
::::Most of the Info page is about my research and AIPA Method which is a valid contribution to psychology, consciousness studies, identity theory, and personality development. Actually, my paper '''AIPA Method: A Cognitive-Phenomenological Model for Identity Reconstruction and Stabilization in Pure Awareness''' is now in the peer review procedure at Journal of Consciousness Studies. 
::::Here is a part from the Wikiversity AIPA Method page in creation (waiting for the end of the time limit for new users):    [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:47, 2 April 2026 (UTC)
:::::For the unknown reasons, the form didn't publish my second part of the message: 
:::::I believe this is a valid contribution to Wikiversity. 
:::::Best Regards, 
:::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:52, 2 April 2026 (UTC)
::::::And the third try: 
:::::: == Introduction ==
::::::The AIPA Method addresses a gap in contemporary personal development and consciousness science: most evidence‑based approaches (CBT, MBSR, MBCT, standard meditation) operate at the level of mental content—reframing thoughts, observing them, or reducing their impact—rather than at the level of identity structure. In contrast, AIPA targets the structural relationship between the self and the mind, aiming at durable identity reconstruction rooted in Pure Awareness rather than symptom management.
::::::The central research question of the primary AIPA preprint is whether a structured, sequentially staged method can produce permanent identity reconstruction rooted in Pure Awareness, and how such a method compares to established approaches in scope, mechanism, and outcome.
:::::: == Theoretical foundations ==
::::::The AIPA framework is grounded in the cognitive‑phenomenological tradition (e.g., McAdams, Varela, Metzinger, Erikson), contemporary consciousness science on minimal phenomenal experience, and qualitative methods advocacy in psychology. It builds directly on:
::::::* Empirical work on pure awareness and Minimal Phenomenal Experience (MPE), especially Gamma &amp; Metzinger’s large‑scale study of content‑reduced awareness states.
::::::* Metzinger’s proposal of minimal phenomenal experience as an entry point for a minimal unifying model of consciousness.
::::::* Narrative identity and partial‑self models within personality and identity theory.
::::::Within this backdrop, AIPA proposes Pure Awareness as a distinct, operationally specified state that can become a structural ground of identity rather than a transient meditative experience.
:::::: == Experiential empiricism ==
::::::The empirical foundation of the AIPA Method is explicitly first‑person and experiential, combining:
::::::* A 22‑year longitudinal autoethnographic self‑study (2003–2025) documenting partial personality episodes, protocol use, and outcomes.
::::::* A 13‑year prospective verification period with zero self‑reported recurrence of targeted harmful behaviors after a dated stabilization point (1 January 2006).
::::::* A high‑ecological‑validity “stress test” during acute bereavement, used to examine whether non‑reactive awareness remains stable under maximal provocation.
::::::* Two independent practitioner cases (an Amazon‑verified report and a structured questionnaire case) providing preliminary convergent signals across cognitive, emotional, behavioral, and identity dimensions.
::::::All central constructs (Pure Awareness, partial personalities, the Switch, identity stabilization) are operationalized with explicit phenomenological and behavioral criteria intended to enable replication and future third‑person measurement.
::::::I believe this is a valid contribution to Wikiversity. 
::::::Best regards, 
::::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:54, 2 April 2026 (UTC)

== Unable to publish pages  ==

Whenever I try to publish a page with linked sources it gets flagged and says I'm a new user attempting to publish content with outside links. Those outside links are my sources. [[User:Soboyed|Soboyed]] ([[User talk:Soboyed|discuss]] • [[Special:Contributions/Soboyed|contribs]]) 04:52, 2 April 2026 (UTC)

:This restriction is automatically lifted after you have edited for a certain time (I don't recall that time off-hand, but it is not long). This is designed to stop spam. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 04:53, 2 April 2026 (UTC)

== Showing error to publish a Post ==

My  action was constructive, not destructive, please allow to publish it. [[Special:Contributions/&amp;#126;2026-20906-18|&amp;#126;2026-20906-18]] ([[User talk:&amp;#126;2026-20906-18|talk]]) 08:06, 4 April 2026 (UTC)

:Maybe you got caught in a filter. Consider [[Special:CreateAccount|creating an account]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:06, 4 April 2026 (UTC)
:Your edits, [https://en.wikiversity.org/w/index.php?title=Special:AbuseLog&amp;wpSearchUser=%7E2026-20906-18 these ones], seems to have tripped a filter when you tried to create a page on [[Create]] which external links. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 23:58, 4 April 2026 (UTC)
:Have you read my [https://en.wikiversity.org/w/index.php?title=Wikiversity:Request_custodian_action&amp;diff=prev&amp;oldid=2802219 previous reply] to you @[[User:~2026-20906-18|~2026-20906-18]]? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:02, 6 April 2026 (UTC)

== Abuse filters which should be deleted ==

Hi, there are some abuse filters which should probably be deleted.
* [[Special:AbuseFilter/1]] (not needed anymore)
* [[Special:AbuseFilter/2]] (no hits since 2018)
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched)
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives)
* [[Special:AbuseFilter/5]] (no hits since 2023)
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore)
* [[Special:AbuseFilter/17]] (no hits since 2022)
* [[Special:AbuseFilter/19]] (no hits since 2019)
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive)
Thanks. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 03:51, 5 April 2026 (UTC)

:Why do these need to be deleted rather than inactivated? Do inactive abuse filters cause a server strain? —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:39, 5 April 2026 (UTC)
:: Deleted filters do not cause strain to the servers. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:28, 5 April 2026 (UTC)
:These sounds like sensible suggestions but, yes, would inactivation perhaps make more sense than deletion for at least some  filters? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:35, 5 April 2026 (UTC)
:I would keep them @[[User:Codename Noreste|Codename Noreste]]. Alternatively, I would turn off the ones that haven't caught anything for a long time, but I would leave them enabled in case they need to be turned on or improved. If someone has already written the code and we don't have hundreds of free man-hours of programmers on Wikiversity, the server load seems secondary to me, and is negligible compared to other things. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:11, 6 April 2026 (UTC)
:: I know how to write abuse filter code and regex, but I would recommend disabling filters that have never caught anything in a long time ''and'' those who made lots of false positives. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:09, 6 April 2026 (UTC)
:::Of course @[[User:Codename Noreste|Codename Noreste]], there are people here today who are capable of changing the code. But the question is what it will be like in a few years, the question is what will happen if those two are busy for a long time, etc. That's why I would leave it so that those who don't know much about code can be inspired by it and will need to do something with it someday - plus, more code for different types of filtering is actually great educational material on how those filters work. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:41, 17 April 2026 (UTC)

Here's the updated list of abuse filters under review with actions I've taken (several disabled, one basic code improvement, and some actions changed) - none have been deleted so they can all be edited and reactivayed - please suggest any further changes:
* [[Special:AbuseFilter/1]] (not needed anymore) - One time account spam bot - 4 hits over 10 years ago - Disabled in 2024 - May be useful in future
* [[Special:AbuseFilter/2]] (no hits since 2018) - Userspace spamming - 778 hits; none since 2018 likely due to global filters - Now disabled
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched) - Specific user page spam - 1,101 hits most recent 7 March 2026 - Still active - Kept enabled
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives) - Questionable Language (profanity) - 6,055 hits including very recently - However it was logging hits without taking any actions - Edited to reduce likelihood of false positives by only applying filter to users with low (&lt; 20) edit count and applied weak actions to tag and warn but not prevent publishing the content
* [[Special:AbuseFilter/5]] (no hits since 2023) - Blocked Solicitation Links - 95 hits; none since 2023 - blocks specific historical spam sites - Non-active - Now disabled
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore) - Not reviewed - They are currently disabled
* [[Special:AbuseFilter/17]] (no hits since 2022) - Fundamental Physics Edits - 347 hits; none since 2022 - Non-active and very specific for a historical issue - Now disabled 
* [[Special:AbuseFilter/19]] (no hits since 2019) - Page Creation - 20 hits; none since 2019 - Retained for historical reference and possible future updates - Now disabled
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive) - Globally Banned Editor (renamed to Low-edit Spam Monitor) - 2,829 hits including very recent - Only applies to users with less than 5 edits and takes no actions / monitoring only - Reviewing the details of the hits I don't see many false positives and have strengthened its actions to add a tag and warning

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:57, 9 April 2026 (UTC)

== Block request ==

Please block ~2026-20985-80/~2026-21079-90/~2026-21223-88. Reason: Vandalism. [[User:Àncilu|Àncilu]] ([[User talk:Àncilu|discuss]] • [[Special:Contributions/Àncilu|contribs]]) 23:24, 5 April 2026 (UTC)

:All edits should be deleted and the first is blocked by Atcovi. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:33, 6 April 2026 (UTC)

== Antispam - Filter 12 ==
{{ping|Codename Noreste}} Thanks for contacting me with a suggested [[Special:AbuseFilter|abuse filter]] for the coupon spam we've been getting. A very much appreciated time saver. Per your suggestion, abuse filter 12 has been reactivated with your updated regex. It should tag and prevent page creation actions for coupon promo etc. Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:33, 15 April 2026 (UTC)
: @[[User:Jtneill|Jtneill]] Please do the following to filter 12:
:# Enable the block action (temporary for unregistered users, indefinite for registered users)
:# Disable both the disallow and tag actions, since that filter will be set to block
: Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:42, 5 May 2026 (UTC)
::Excellent. Done:
::* Block duration for non-registered users = 1 week
::* Block duration for registered users = indefinite
::* Disallow and tagging disabled
::Thankyou. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:24, 9 May 2026 (UTC)</text>
      <sha1>mzyqqg97z8l34lsvktb4ftm8x5llgd4</sha1>
    </revision>
    <revision>
      <id>2809717</id>
      <parentid>2809715</parentid>
      <timestamp>2026-05-16T19:25:25Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Urgent! error message This action has been automatically identified as potentially harmful, and therefore disallowed */ archive from [[Wikiversity:Request custodian action]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809717</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="33849" sha1="jspk54wp14rqbcgql7v0gzw9ra10kb4" xml:space="preserve">{{Archive|Wikiversity:Request custodian action}}

== Sidewide count.js ==

i would like something like: [[Template:User contrib count/count.js]]. i created [[Template:User contrib count]] and a user/common.js. {{User contrib count}}.&lt;br&gt;&lt;br&gt; so a &quot;count.js&quot; would complete it. See [[User:Harold Foppele/common.js]].
If an Administrator could help please. Cheers [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 19:22, 18 January 2026 (UTC)

== need to add my profile ==

im trying to add new profile content  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:03, 4 February 2026 (UTC)

:You can edit it now. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:05, 4 February 2026 (UTC)
::where can create a new one [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)
:::i have created and its in sandbox. i would like to know when it will be approved  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 19:38, 4 February 2026 (UTC)
::::Please don’t create [[wv:spam|spam]] pages as it will be deleted. Please also read [[WV:Scope]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 04:01, 5 February 2026 (UTC)

== Im trying to add new profile while add content its shows not alowed ==

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Exceeded New Page Limit

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)

== New User: cannot create talk page ==

Hi, I am a new user of Wikiversity and I wanted to create a talk page for the article [[ChatGPT's Essay on Kohlberg's Theory: AI's Use in Academic Writing]]. As a new user, I was barred from performing this action. The text that I wanted to add to the talk page is:

&lt;blockquote&gt;
I have doubts as to to the reliability of this essay. Take for rexample the sentence:

&lt;blockquote&gt;
Due to its efficiency, AI has saved 380,000-403,000 lives per year in European healthcare as reported in a recent Deloitte and MedTech Europe report&lt;ref&gt;Dantas, C., Mackiewicz, K., Tageo, V., Jacucci, G., Guardado, D., Ortet, S., Varlamis, I., Maniadakis, M., De Lera, E., Quintas, J., Kocsis, O., &amp; Vassiliou, C. (2021). Benefits and hurdles of AI in the workplace – what comes next? ''International Journal of Artificial Intelligence and Expert Systems, 10'', 9-17. https://www.researchgate.net/publication/351993615_Benefits_and_Hurdles_of_AI_In_The_Workplace_-What_Comes_Next&lt;/ref&gt;.
&lt;/blockquote&gt;

Reading the reference (freely available on ResearchGate), one notes:

# that the reference is from 2021 (predating the widespread use of LLMs such as ChatGPT and the associated 'AI' boom), and
# that the reference factually contradicts this essay.

Quoting from the reference:

&lt;blockquote&gt;
There are enormous benefits of applying AI-based solutions to monitor workers’ health and prevent accidents or, currently, COVID-19 infections, and those benefits are reported with enormous potential. According to the recent Deloitte and MedTech Europe report [11], implementing AI in European healthcare systems could save up 380,000 to 403,000 lives annually or €170.9 to 212.4 billion per year.
&lt;/blockquote&gt;

Not that the reference says ''could save'', not ''saves'' as in the essay.

This calls into question the reliability of the essay.

&lt;/blockquote&gt;

Could an administrator make this addition for me? Thank you! 
{{reflist}}
[[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 06:53, 5 February 2026 (UTC)

:@[[User:Æolus|Æolus]] I have added it for you, you can change the header and sign it now. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 08:05, 5 February 2026 (UTC)
::Thank you! [[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 12:43, 5 February 2026 (UTC)

== Disallowed to add a page on a course ==

I'm trying to populate a newly created course on Wikiversity, but it blocks me from creating more pages with &quot;New User Exceeded New Page Limit&quot;. Could this be lifted please? [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 13:21, 15 February 2026 (UTC)

:Sorry! Never mind. I was trying to create a new article instead of a new page. All good now. [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 14:03, 15 February 2026 (UTC)

== Harold Foppele adding LLM-generated nonsense and personal fiction ==

I became aware of [[User:Harold Foppele]]'s editing after I deleted some of his uploads on Commons. He appears to be adding a large amount of text and images that are some combination of personal fiction and LLM-generated nonsense. This includes:
*[[Quantum Ultra fast lasers#Future thought experiment|Personal speculative fiction]] in an otherwise &quot;nonfiction&quot; article
*Uploading nonsense LLM-created [[:File:Rontosecond pulse laser (Schematic).jpg|diagrams]] and [[:File:Rontosecond pulse laser (Futuristic).jpg|renders]] for nonexistent lab equipment, with fake source (on Commons, he indicated these files as having been created by him using an LLM)
*Uploading nonsense LLM-created images of equations with obvious artifacts. These images, such as [[:File:Redfield equation (non-Markovian).png]] and [[:File:Lindblad equation (Markovian).png]], don't even match the text he puts them with.
Much of his writing is also of extremely poor quality, to the point where it's not clear whether it's written by him or an LLM. I'm not an active editor on this project, so I'm not as familiar with the standards here, but I believe this is worth custodian attention. [[User:Pi.1415926535|Pi.1415926535]] ([[User talk:Pi.1415926535|discuss]] • [[Special:Contributions/Pi.1415926535|contribs]]) 03:06, 23 February 2026 (UTC)

:Fake source ''and'' contradictory copyright info, claiming both public domain and CC license. Moreover, if they are indeed nearly-direct LLM output, depending on jurisdiction they may not even be eligible for copyright.
:I've put speedy deletion marks for the equations, because they're obviously not coherent mathematical equations (the parentheses don't match, the symbols merge into each other the way text in image models often do, etc) [[User:Sesquilinear|Sesquilinear]] ([[User talk:Sesquilinear|discuss]] • [[Special:Contributions/Sesquilinear|contribs]]) 21:50, 7 March 2026 (UTC)

== Repeated removal of RFD notices by Harold Foppele ==

{{User|Harold Foppele }}

This editor is appearing in multiple noticeboards for behaviour which is contentious. Ther latest adventure is the repeated removal of tye RFD notice at [[Quantum/Henry C. Kapteyn]]. You will see from their contributions record the number of times. I have warned Tham on their user tag page that this is tantaomunt to volunteering to be blocked here. They have a track record of achieving blocks on enWiki and Commons already.

They have all the appearance of shooting not to understand when given direct information about their behaviour, whichever project they are editing, and are fast becoming a time sink. Their behaviour across multiple WMF sites may well lead to a Global Lock, but I do not believe they have quite reached the threshold for that.

I believe that what is required is a preventative block to seek to ensure thatchy understand the seriousness of their behaviour, and the need to be collegial. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 23:03, 4 March 2026 (UTC)
: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:45, 8 March 2026 (UTC)

== Blocks for sockpuppet ==

Please block [[User:Harold Foppele]] and [[User:Johnwilliamsiii]] for sockpuppetry based on [https://en.wikipedia.org/wiki/Wikipedia:Sockpuppet_investigations/Harold_Foppele en wiki] CU and [https://commons.wikimedia.org/w/index.php?diff=1177465640 commons] CU investigations. The user has also violated copyright, see the above discussion. A block is necessary to prevent further abuse. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:30, 8 March 2026 (UTC)

:&lt;small&gt;@[[User:MathXplore|MathXplore]]&lt;/small&gt; [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:31, 8 March 2026 (UTC)
:: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:44, 8 March 2026 (UTC)
:CC. @[[User:Timtrent|Timtrent]], @[[User:Sesquilinear|Sesquilinear]], @[[User:Pi.1415926535|Pi.1415926535]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:33, 8 March 2026 (UTC)
::Thank you for the ping. I concur based on [[w:en:WP:DUCK|behaviour]]. CUs appear divided. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 11:41, 8 March 2026 (UTC)

== Problem when trying to start a discussion with authors of the Plurilingual education portal ==

The authors I wanted to discuss with are called &quot;Project PEP&quot; and my name is Franch Chandler. How can I be allowed to do so ? [[User:French Chandler|French Chandler]] ([[User talk:French Chandler|discuss]] • [[Special:Contributions/French Chandler|contribs]]) 18:25, 16 March 2026 (UTC)

:@[[User:French Chandler|French Chandler]] place your qestion [https://en.wikiversity.org/w/index.php?title=User_talk:Projet_PEP&amp;action=edit into the dialog box] on this link and hit Publish page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:22, 16 March 2026 (UTC)

== Please publish my post ==

My post is about &quot;Every child grows and develops at their own pace, but some may experience challenges that affect their ability to perform everyday tasks. These challenges can include difficulties with fine motor skills, sensory processing, handwriting, feeding, and self-regulation. When these issues are not addressed early, they can impact a child’s confidence, academic performance, and independence.

With the rise of digital healthcare services, '''online physical therapy''' has emerged as a powerful and accessible solution for parents seeking support for their children. This modern approach provides structured, personalized therapy programs that can be accessed from the comfort of home, making it easier for families to ensure consistent care.&quot; [[User:Skyabovetherapy|Skyabovetherapy]] ([[User talk:Skyabovetherapy|discuss]] • [[Special:Contributions/Skyabovetherapy|contribs]]) 12:28, 28 March 2026 (UTC)

:@[[User:Skyabovetherapy|Skyabovetherapy]] Well, you can publish it yourself, Wikiversity is a free environement, where everybody can create educational resources. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 14:11, 29 March 2026 (UTC)
::They actually triggered some abuse filters. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 16:24, 29 March 2026 (UTC)
:I looked at your attempts to add this text and I see a link to one website repeated many times, which reminds me of the misuse of Wikiversity for self-promotion or to increase the importance of the website. It is necessary to remind you here that Wikiversity is not a place for promotion, but a place for education. So if you want to educate, it will not be a problem to create the page without external links with a clearly defined procedure for how people should use it and what to expect from it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:07, 1 April 2026 (UTC)

== New user limit ==

Hi, I am creating an AIPA Method learning resource page. 

I am the author of the linked research, and I hit the “new user limit” and “new page with external link” filters while publishing. 

Here is the link to the page in creation: [https://en.wikiversity.org/w/index.php?title=AIPA_Method&amp;veaction=edit] 

Thank you for your help. 

Best regards, 

Senad Dizdarević [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:19, 30 March 2026 (UTC)

:@[[User:Senad Dizdarević|Senad Dizdarević]] I should admit I dont know, what is &quot;new user limit&quot;, but if filter blocks your page because of certain external link, you may force to save anyway and sometimes it works. It should not work, when the website is blacklisted. As of now, I am not seeing you to save page in main namespace, so try to save it without external links first. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:30, 30 March 2026 (UTC)
::Thank you, you are very kind. 
::I will wait a day, and try again (without links, too). 
::Today, I already created About Me info page, and maybe that is enough for the filters for one day.  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:53, 30 March 2026 (UTC)
:::Well, I have analyzed your contribution to Wikiversity and I should point out here, that this project is not a place for advertising, so there is no way of promoting your books and authority this way. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:56, 1 April 2026 (UTC)
::::Hi, my About Me page is just an info page with the neutral as possible presentation of my work. 
::::There is a big difference between informing and advertising. Informing is neutrally stating that something exists and requiring no action, while advertising is a special communication form with intent to cause certain action from readers. For example, click here, click there, order this, buy that. 
::::There is no such intention, form, or terms on my info page. Just neutral information. I don't hide and I am not ashamed that I am write and author, and that is a part of the usual bio, including works. I checked your user page: &quot;I graduated from the Czech University of Life Sciences in Prague and studied information science at the Faculty of Arts of Charles University.&quot; I think that if you had written a book on Life Science, you would have mentioned that as well.
::::Most of the Info page is about my research and AIPA Method which is a valid contribution to psychology, consciousness studies, identity theory, and personality development. Actually, my paper '''AIPA Method: A Cognitive-Phenomenological Model for Identity Reconstruction and Stabilization in Pure Awareness''' is now in the peer review procedure at Journal of Consciousness Studies. 
::::Here is a part from the Wikiversity AIPA Method page in creation (waiting for the end of the time limit for new users):    [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:47, 2 April 2026 (UTC)
:::::For the unknown reasons, the form didn't publish my second part of the message: 
:::::I believe this is a valid contribution to Wikiversity. 
:::::Best Regards, 
:::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:52, 2 April 2026 (UTC)
::::::And the third try: 
:::::: == Introduction ==
::::::The AIPA Method addresses a gap in contemporary personal development and consciousness science: most evidence‑based approaches (CBT, MBSR, MBCT, standard meditation) operate at the level of mental content—reframing thoughts, observing them, or reducing their impact—rather than at the level of identity structure. In contrast, AIPA targets the structural relationship between the self and the mind, aiming at durable identity reconstruction rooted in Pure Awareness rather than symptom management.
::::::The central research question of the primary AIPA preprint is whether a structured, sequentially staged method can produce permanent identity reconstruction rooted in Pure Awareness, and how such a method compares to established approaches in scope, mechanism, and outcome.
:::::: == Theoretical foundations ==
::::::The AIPA framework is grounded in the cognitive‑phenomenological tradition (e.g., McAdams, Varela, Metzinger, Erikson), contemporary consciousness science on minimal phenomenal experience, and qualitative methods advocacy in psychology. It builds directly on:
::::::* Empirical work on pure awareness and Minimal Phenomenal Experience (MPE), especially Gamma &amp; Metzinger’s large‑scale study of content‑reduced awareness states.
::::::* Metzinger’s proposal of minimal phenomenal experience as an entry point for a minimal unifying model of consciousness.
::::::* Narrative identity and partial‑self models within personality and identity theory.
::::::Within this backdrop, AIPA proposes Pure Awareness as a distinct, operationally specified state that can become a structural ground of identity rather than a transient meditative experience.
:::::: == Experiential empiricism ==
::::::The empirical foundation of the AIPA Method is explicitly first‑person and experiential, combining:
::::::* A 22‑year longitudinal autoethnographic self‑study (2003–2025) documenting partial personality episodes, protocol use, and outcomes.
::::::* A 13‑year prospective verification period with zero self‑reported recurrence of targeted harmful behaviors after a dated stabilization point (1 January 2006).
::::::* A high‑ecological‑validity “stress test” during acute bereavement, used to examine whether non‑reactive awareness remains stable under maximal provocation.
::::::* Two independent practitioner cases (an Amazon‑verified report and a structured questionnaire case) providing preliminary convergent signals across cognitive, emotional, behavioral, and identity dimensions.
::::::All central constructs (Pure Awareness, partial personalities, the Switch, identity stabilization) are operationalized with explicit phenomenological and behavioral criteria intended to enable replication and future third‑person measurement.
::::::I believe this is a valid contribution to Wikiversity. 
::::::Best regards, 
::::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:54, 2 April 2026 (UTC)

== Unable to publish pages  ==

Whenever I try to publish a page with linked sources it gets flagged and says I'm a new user attempting to publish content with outside links. Those outside links are my sources. [[User:Soboyed|Soboyed]] ([[User talk:Soboyed|discuss]] • [[Special:Contributions/Soboyed|contribs]]) 04:52, 2 April 2026 (UTC)

:This restriction is automatically lifted after you have edited for a certain time (I don't recall that time off-hand, but it is not long). This is designed to stop spam. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 04:53, 2 April 2026 (UTC)

== Showing error to publish a Post ==

My  action was constructive, not destructive, please allow to publish it. [[Special:Contributions/&amp;#126;2026-20906-18|&amp;#126;2026-20906-18]] ([[User talk:&amp;#126;2026-20906-18|talk]]) 08:06, 4 April 2026 (UTC)

:Maybe you got caught in a filter. Consider [[Special:CreateAccount|creating an account]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:06, 4 April 2026 (UTC)
:Your edits, [https://en.wikiversity.org/w/index.php?title=Special:AbuseLog&amp;wpSearchUser=%7E2026-20906-18 these ones], seems to have tripped a filter when you tried to create a page on [[Create]] which external links. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 23:58, 4 April 2026 (UTC)
:Have you read my [https://en.wikiversity.org/w/index.php?title=Wikiversity:Request_custodian_action&amp;diff=prev&amp;oldid=2802219 previous reply] to you @[[User:~2026-20906-18|~2026-20906-18]]? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:02, 6 April 2026 (UTC)

== Abuse filters which should be deleted ==

Hi, there are some abuse filters which should probably be deleted.
* [[Special:AbuseFilter/1]] (not needed anymore)
* [[Special:AbuseFilter/2]] (no hits since 2018)
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched)
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives)
* [[Special:AbuseFilter/5]] (no hits since 2023)
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore)
* [[Special:AbuseFilter/17]] (no hits since 2022)
* [[Special:AbuseFilter/19]] (no hits since 2019)
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive)
Thanks. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 03:51, 5 April 2026 (UTC)

:Why do these need to be deleted rather than inactivated? Do inactive abuse filters cause a server strain? —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:39, 5 April 2026 (UTC)
:: Deleted filters do not cause strain to the servers. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:28, 5 April 2026 (UTC)
:These sounds like sensible suggestions but, yes, would inactivation perhaps make more sense than deletion for at least some  filters? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:35, 5 April 2026 (UTC)
:I would keep them @[[User:Codename Noreste|Codename Noreste]]. Alternatively, I would turn off the ones that haven't caught anything for a long time, but I would leave them enabled in case they need to be turned on or improved. If someone has already written the code and we don't have hundreds of free man-hours of programmers on Wikiversity, the server load seems secondary to me, and is negligible compared to other things. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:11, 6 April 2026 (UTC)
:: I know how to write abuse filter code and regex, but I would recommend disabling filters that have never caught anything in a long time ''and'' those who made lots of false positives. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:09, 6 April 2026 (UTC)
:::Of course @[[User:Codename Noreste|Codename Noreste]], there are people here today who are capable of changing the code. But the question is what it will be like in a few years, the question is what will happen if those two are busy for a long time, etc. That's why I would leave it so that those who don't know much about code can be inspired by it and will need to do something with it someday - plus, more code for different types of filtering is actually great educational material on how those filters work. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:41, 17 April 2026 (UTC)

Here's the updated list of abuse filters under review with actions I've taken (several disabled, one basic code improvement, and some actions changed) - none have been deleted so they can all be edited and reactivayed - please suggest any further changes:
* [[Special:AbuseFilter/1]] (not needed anymore) - One time account spam bot - 4 hits over 10 years ago - Disabled in 2024 - May be useful in future
* [[Special:AbuseFilter/2]] (no hits since 2018) - Userspace spamming - 778 hits; none since 2018 likely due to global filters - Now disabled
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched) - Specific user page spam - 1,101 hits most recent 7 March 2026 - Still active - Kept enabled
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives) - Questionable Language (profanity) - 6,055 hits including very recently - However it was logging hits without taking any actions - Edited to reduce likelihood of false positives by only applying filter to users with low (&lt; 20) edit count and applied weak actions to tag and warn but not prevent publishing the content
* [[Special:AbuseFilter/5]] (no hits since 2023) - Blocked Solicitation Links - 95 hits; none since 2023 - blocks specific historical spam sites - Non-active - Now disabled
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore) - Not reviewed - They are currently disabled
* [[Special:AbuseFilter/17]] (no hits since 2022) - Fundamental Physics Edits - 347 hits; none since 2022 - Non-active and very specific for a historical issue - Now disabled 
* [[Special:AbuseFilter/19]] (no hits since 2019) - Page Creation - 20 hits; none since 2019 - Retained for historical reference and possible future updates - Now disabled
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive) - Globally Banned Editor (renamed to Low-edit Spam Monitor) - 2,829 hits including very recent - Only applies to users with less than 5 edits and takes no actions / monitoring only - Reviewing the details of the hits I don't see many false positives and have strengthened its actions to add a tag and warning

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:57, 9 April 2026 (UTC)

== Block request ==

Please block ~2026-20985-80/~2026-21079-90/~2026-21223-88. Reason: Vandalism. [[User:Àncilu|Àncilu]] ([[User talk:Àncilu|discuss]] • [[Special:Contributions/Àncilu|contribs]]) 23:24, 5 April 2026 (UTC)

:All edits should be deleted and the first is blocked by Atcovi. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:33, 6 April 2026 (UTC)

== Antispam - Filter 12 ==
{{ping|Codename Noreste}} Thanks for contacting me with a suggested [[Special:AbuseFilter|abuse filter]] for the coupon spam we've been getting. A very much appreciated time saver. Per your suggestion, abuse filter 12 has been reactivated with your updated regex. It should tag and prevent page creation actions for coupon promo etc. Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:33, 15 April 2026 (UTC)
: @[[User:Jtneill|Jtneill]] Please do the following to filter 12:
:# Enable the block action (temporary for unregistered users, indefinite for registered users)
:# Disable both the disallow and tag actions, since that filter will be set to block
: Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:42, 5 May 2026 (UTC)
::Excellent. Done:
::* Block duration for non-registered users = 1 week
::* Block duration for registered users = indefinite
::* Disallow and tagging disabled
::Thankyou. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:24, 9 May 2026 (UTC)

== Urgent! error message This action has been automatically identified as potentially harmful, and therefore disallowed ==

While submitting the post this error was coming &quot;This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please inform an administrator of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link&quot; How to resolve it?

Here is the content:

{{note|marketing material removed}}

[[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:14, 17 April 2026 (UTC)
: That's because Wikiversity doesn't accept advertising. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 05:20, 17 April 2026 (UTC)
::So this is fine
::'''Online Internship and Digital Learning for Students'''
::Online learning has become an important part of modern education. With the help of the internet and digital tools, students can now study, practice, and gain experience without being physically present in a classroom. One key part of this system is the online internship, which helps students learn real-world skills along with their studies.
::An online internship allows students to work on tasks and projects through digital platforms. This makes learning more practical and useful, especially for those who want to understand how real work environments function.
::'''Background'''
::The concept of online learning developed from distance education, where students learned from remote locations. Over time, with the growth of digital technology, learning has become more interactive and flexible.
::The introduction of the online internship has added another important layer to digital education. It combines theoretical learning with practical experience, helping students prepare for future careers.
::During global events such as the COVID-19 pandemic, online education and online internship programs became essential. They helped students continue learning and gaining experience despite restrictions on physical movement.
::'''Importance of Online Internship'''
::An online internship plays an important role in student development. It helps bridge the gap between academic knowledge and practical skills.
::'''Some key points include:'''
::Students understand how real work is done
::They develop basic professional skills
::It supports career readiness
::It allows learning without location limits
::By participating in an online internship, students can improve their confidence and gain early exposure to different fields.
::'''Features of Online Internship-Based Learning'''
::Modern education platforms often include online internship opportunities as part of their learning system. These usually offer:
::Flexible schedules for students
::Access to learning from home
::Beginner-friendly tasks and projects
::A combination of theory and practice
::Such features make online internship programs suitable for a wide range of learners, including beginners.
::'''Learning Tasks'''
::Explore how online internship programs support student learning in digital environments.
::Identify how students can gain practical experience through an online internship
::Analyze the role of flexible learning in improving student engagement
::Understand how online education and internships work together
::'''References'''
::[https://ijpsl.in/wp-content/uploads/2020/09/E-Learning_Hanaaya-Navaneeth.pdf The Past, Present and Future of E-Learning: Hanaaya Varyani and Navaneeth M S]
::[https://ieeexplore.ieee.org/document/9788102 Current Trends and Future Perspectives of e-Learning in India]
::'''See Also'''
::[https://easyshiksha.com/online_courses/internship Online Internship]
::[https://easyshiksha.com/online_courses/ Online Courses]
::[https://easyshiksha.com/online_courses/kids-learning Kids Learning]
::[https://easyshiksha.com/career_helper/ Career Guidance] [[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:27, 17 April 2026 (UTC)
:::@[[User:EasyshikshaMarketing|EasyshikshaMarketing]] Wikiversity is a resource for education, or a space for education. However, your intention to link to another website is obvious, and such content does not belong here, as it contradicts the purpose of Wikiversity. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:38, 17 April 2026 (UTC)</text>
      <sha1>jspk54wp14rqbcgql7v0gzw9ra10kb4</sha1>
    </revision>
    <revision>
      <id>2809719</id>
      <parentid>2809717</parentid>
      <timestamp>2026-05-16T19:25:51Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* AI-generated images */ archive from [[Wikiversity:Request custodian action]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809719</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="35851" sha1="ffz6yl38dbpvckfhjsrgn166hdsevle" xml:space="preserve">{{Archive|Wikiversity:Request custodian action}}

== Sidewide count.js ==

i would like something like: [[Template:User contrib count/count.js]]. i created [[Template:User contrib count]] and a user/common.js. {{User contrib count}}.&lt;br&gt;&lt;br&gt; so a &quot;count.js&quot; would complete it. See [[User:Harold Foppele/common.js]].
If an Administrator could help please. Cheers [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 19:22, 18 January 2026 (UTC)

== need to add my profile ==

im trying to add new profile content  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:03, 4 February 2026 (UTC)

:You can edit it now. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:05, 4 February 2026 (UTC)
::where can create a new one [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)
:::i have created and its in sandbox. i would like to know when it will be approved  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 19:38, 4 February 2026 (UTC)
::::Please don’t create [[wv:spam|spam]] pages as it will be deleted. Please also read [[WV:Scope]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 04:01, 5 February 2026 (UTC)

== Im trying to add new profile while add content its shows not alowed ==

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Exceeded New Page Limit

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)

== New User: cannot create talk page ==

Hi, I am a new user of Wikiversity and I wanted to create a talk page for the article [[ChatGPT's Essay on Kohlberg's Theory: AI's Use in Academic Writing]]. As a new user, I was barred from performing this action. The text that I wanted to add to the talk page is:

&lt;blockquote&gt;
I have doubts as to to the reliability of this essay. Take for rexample the sentence:

&lt;blockquote&gt;
Due to its efficiency, AI has saved 380,000-403,000 lives per year in European healthcare as reported in a recent Deloitte and MedTech Europe report&lt;ref&gt;Dantas, C., Mackiewicz, K., Tageo, V., Jacucci, G., Guardado, D., Ortet, S., Varlamis, I., Maniadakis, M., De Lera, E., Quintas, J., Kocsis, O., &amp; Vassiliou, C. (2021). Benefits and hurdles of AI in the workplace – what comes next? ''International Journal of Artificial Intelligence and Expert Systems, 10'', 9-17. https://www.researchgate.net/publication/351993615_Benefits_and_Hurdles_of_AI_In_The_Workplace_-What_Comes_Next&lt;/ref&gt;.
&lt;/blockquote&gt;

Reading the reference (freely available on ResearchGate), one notes:

# that the reference is from 2021 (predating the widespread use of LLMs such as ChatGPT and the associated 'AI' boom), and
# that the reference factually contradicts this essay.

Quoting from the reference:

&lt;blockquote&gt;
There are enormous benefits of applying AI-based solutions to monitor workers’ health and prevent accidents or, currently, COVID-19 infections, and those benefits are reported with enormous potential. According to the recent Deloitte and MedTech Europe report [11], implementing AI in European healthcare systems could save up 380,000 to 403,000 lives annually or €170.9 to 212.4 billion per year.
&lt;/blockquote&gt;

Not that the reference says ''could save'', not ''saves'' as in the essay.

This calls into question the reliability of the essay.

&lt;/blockquote&gt;

Could an administrator make this addition for me? Thank you! 
{{reflist}}
[[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 06:53, 5 February 2026 (UTC)

:@[[User:Æolus|Æolus]] I have added it for you, you can change the header and sign it now. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 08:05, 5 February 2026 (UTC)
::Thank you! [[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 12:43, 5 February 2026 (UTC)

== Disallowed to add a page on a course ==

I'm trying to populate a newly created course on Wikiversity, but it blocks me from creating more pages with &quot;New User Exceeded New Page Limit&quot;. Could this be lifted please? [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 13:21, 15 February 2026 (UTC)

:Sorry! Never mind. I was trying to create a new article instead of a new page. All good now. [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 14:03, 15 February 2026 (UTC)

== Harold Foppele adding LLM-generated nonsense and personal fiction ==

I became aware of [[User:Harold Foppele]]'s editing after I deleted some of his uploads on Commons. He appears to be adding a large amount of text and images that are some combination of personal fiction and LLM-generated nonsense. This includes:
*[[Quantum Ultra fast lasers#Future thought experiment|Personal speculative fiction]] in an otherwise &quot;nonfiction&quot; article
*Uploading nonsense LLM-created [[:File:Rontosecond pulse laser (Schematic).jpg|diagrams]] and [[:File:Rontosecond pulse laser (Futuristic).jpg|renders]] for nonexistent lab equipment, with fake source (on Commons, he indicated these files as having been created by him using an LLM)
*Uploading nonsense LLM-created images of equations with obvious artifacts. These images, such as [[:File:Redfield equation (non-Markovian).png]] and [[:File:Lindblad equation (Markovian).png]], don't even match the text he puts them with.
Much of his writing is also of extremely poor quality, to the point where it's not clear whether it's written by him or an LLM. I'm not an active editor on this project, so I'm not as familiar with the standards here, but I believe this is worth custodian attention. [[User:Pi.1415926535|Pi.1415926535]] ([[User talk:Pi.1415926535|discuss]] • [[Special:Contributions/Pi.1415926535|contribs]]) 03:06, 23 February 2026 (UTC)

:Fake source ''and'' contradictory copyright info, claiming both public domain and CC license. Moreover, if they are indeed nearly-direct LLM output, depending on jurisdiction they may not even be eligible for copyright.
:I've put speedy deletion marks for the equations, because they're obviously not coherent mathematical equations (the parentheses don't match, the symbols merge into each other the way text in image models often do, etc) [[User:Sesquilinear|Sesquilinear]] ([[User talk:Sesquilinear|discuss]] • [[Special:Contributions/Sesquilinear|contribs]]) 21:50, 7 March 2026 (UTC)

== Repeated removal of RFD notices by Harold Foppele ==

{{User|Harold Foppele }}

This editor is appearing in multiple noticeboards for behaviour which is contentious. Ther latest adventure is the repeated removal of tye RFD notice at [[Quantum/Henry C. Kapteyn]]. You will see from their contributions record the number of times. I have warned Tham on their user tag page that this is tantaomunt to volunteering to be blocked here. They have a track record of achieving blocks on enWiki and Commons already.

They have all the appearance of shooting not to understand when given direct information about their behaviour, whichever project they are editing, and are fast becoming a time sink. Their behaviour across multiple WMF sites may well lead to a Global Lock, but I do not believe they have quite reached the threshold for that.

I believe that what is required is a preventative block to seek to ensure thatchy understand the seriousness of their behaviour, and the need to be collegial. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 23:03, 4 March 2026 (UTC)
: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:45, 8 March 2026 (UTC)

== Blocks for sockpuppet ==

Please block [[User:Harold Foppele]] and [[User:Johnwilliamsiii]] for sockpuppetry based on [https://en.wikipedia.org/wiki/Wikipedia:Sockpuppet_investigations/Harold_Foppele en wiki] CU and [https://commons.wikimedia.org/w/index.php?diff=1177465640 commons] CU investigations. The user has also violated copyright, see the above discussion. A block is necessary to prevent further abuse. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:30, 8 March 2026 (UTC)

:&lt;small&gt;@[[User:MathXplore|MathXplore]]&lt;/small&gt; [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:31, 8 March 2026 (UTC)
:: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:44, 8 March 2026 (UTC)
:CC. @[[User:Timtrent|Timtrent]], @[[User:Sesquilinear|Sesquilinear]], @[[User:Pi.1415926535|Pi.1415926535]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:33, 8 March 2026 (UTC)
::Thank you for the ping. I concur based on [[w:en:WP:DUCK|behaviour]]. CUs appear divided. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 11:41, 8 March 2026 (UTC)

== Problem when trying to start a discussion with authors of the Plurilingual education portal ==

The authors I wanted to discuss with are called &quot;Project PEP&quot; and my name is Franch Chandler. How can I be allowed to do so ? [[User:French Chandler|French Chandler]] ([[User talk:French Chandler|discuss]] • [[Special:Contributions/French Chandler|contribs]]) 18:25, 16 March 2026 (UTC)

:@[[User:French Chandler|French Chandler]] place your qestion [https://en.wikiversity.org/w/index.php?title=User_talk:Projet_PEP&amp;action=edit into the dialog box] on this link and hit Publish page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:22, 16 March 2026 (UTC)

== Please publish my post ==

My post is about &quot;Every child grows and develops at their own pace, but some may experience challenges that affect their ability to perform everyday tasks. These challenges can include difficulties with fine motor skills, sensory processing, handwriting, feeding, and self-regulation. When these issues are not addressed early, they can impact a child’s confidence, academic performance, and independence.

With the rise of digital healthcare services, '''online physical therapy''' has emerged as a powerful and accessible solution for parents seeking support for their children. This modern approach provides structured, personalized therapy programs that can be accessed from the comfort of home, making it easier for families to ensure consistent care.&quot; [[User:Skyabovetherapy|Skyabovetherapy]] ([[User talk:Skyabovetherapy|discuss]] • [[Special:Contributions/Skyabovetherapy|contribs]]) 12:28, 28 March 2026 (UTC)

:@[[User:Skyabovetherapy|Skyabovetherapy]] Well, you can publish it yourself, Wikiversity is a free environement, where everybody can create educational resources. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 14:11, 29 March 2026 (UTC)
::They actually triggered some abuse filters. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 16:24, 29 March 2026 (UTC)
:I looked at your attempts to add this text and I see a link to one website repeated many times, which reminds me of the misuse of Wikiversity for self-promotion or to increase the importance of the website. It is necessary to remind you here that Wikiversity is not a place for promotion, but a place for education. So if you want to educate, it will not be a problem to create the page without external links with a clearly defined procedure for how people should use it and what to expect from it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:07, 1 April 2026 (UTC)

== New user limit ==

Hi, I am creating an AIPA Method learning resource page. 

I am the author of the linked research, and I hit the “new user limit” and “new page with external link” filters while publishing. 

Here is the link to the page in creation: [https://en.wikiversity.org/w/index.php?title=AIPA_Method&amp;veaction=edit] 

Thank you for your help. 

Best regards, 

Senad Dizdarević [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:19, 30 March 2026 (UTC)

:@[[User:Senad Dizdarević|Senad Dizdarević]] I should admit I dont know, what is &quot;new user limit&quot;, but if filter blocks your page because of certain external link, you may force to save anyway and sometimes it works. It should not work, when the website is blacklisted. As of now, I am not seeing you to save page in main namespace, so try to save it without external links first. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:30, 30 March 2026 (UTC)
::Thank you, you are very kind. 
::I will wait a day, and try again (without links, too). 
::Today, I already created About Me info page, and maybe that is enough for the filters for one day.  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:53, 30 March 2026 (UTC)
:::Well, I have analyzed your contribution to Wikiversity and I should point out here, that this project is not a place for advertising, so there is no way of promoting your books and authority this way. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:56, 1 April 2026 (UTC)
::::Hi, my About Me page is just an info page with the neutral as possible presentation of my work. 
::::There is a big difference between informing and advertising. Informing is neutrally stating that something exists and requiring no action, while advertising is a special communication form with intent to cause certain action from readers. For example, click here, click there, order this, buy that. 
::::There is no such intention, form, or terms on my info page. Just neutral information. I don't hide and I am not ashamed that I am write and author, and that is a part of the usual bio, including works. I checked your user page: &quot;I graduated from the Czech University of Life Sciences in Prague and studied information science at the Faculty of Arts of Charles University.&quot; I think that if you had written a book on Life Science, you would have mentioned that as well.
::::Most of the Info page is about my research and AIPA Method which is a valid contribution to psychology, consciousness studies, identity theory, and personality development. Actually, my paper '''AIPA Method: A Cognitive-Phenomenological Model for Identity Reconstruction and Stabilization in Pure Awareness''' is now in the peer review procedure at Journal of Consciousness Studies. 
::::Here is a part from the Wikiversity AIPA Method page in creation (waiting for the end of the time limit for new users):    [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:47, 2 April 2026 (UTC)
:::::For the unknown reasons, the form didn't publish my second part of the message: 
:::::I believe this is a valid contribution to Wikiversity. 
:::::Best Regards, 
:::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:52, 2 April 2026 (UTC)
::::::And the third try: 
:::::: == Introduction ==
::::::The AIPA Method addresses a gap in contemporary personal development and consciousness science: most evidence‑based approaches (CBT, MBSR, MBCT, standard meditation) operate at the level of mental content—reframing thoughts, observing them, or reducing their impact—rather than at the level of identity structure. In contrast, AIPA targets the structural relationship between the self and the mind, aiming at durable identity reconstruction rooted in Pure Awareness rather than symptom management.
::::::The central research question of the primary AIPA preprint is whether a structured, sequentially staged method can produce permanent identity reconstruction rooted in Pure Awareness, and how such a method compares to established approaches in scope, mechanism, and outcome.
:::::: == Theoretical foundations ==
::::::The AIPA framework is grounded in the cognitive‑phenomenological tradition (e.g., McAdams, Varela, Metzinger, Erikson), contemporary consciousness science on minimal phenomenal experience, and qualitative methods advocacy in psychology. It builds directly on:
::::::* Empirical work on pure awareness and Minimal Phenomenal Experience (MPE), especially Gamma &amp; Metzinger’s large‑scale study of content‑reduced awareness states.
::::::* Metzinger’s proposal of minimal phenomenal experience as an entry point for a minimal unifying model of consciousness.
::::::* Narrative identity and partial‑self models within personality and identity theory.
::::::Within this backdrop, AIPA proposes Pure Awareness as a distinct, operationally specified state that can become a structural ground of identity rather than a transient meditative experience.
:::::: == Experiential empiricism ==
::::::The empirical foundation of the AIPA Method is explicitly first‑person and experiential, combining:
::::::* A 22‑year longitudinal autoethnographic self‑study (2003–2025) documenting partial personality episodes, protocol use, and outcomes.
::::::* A 13‑year prospective verification period with zero self‑reported recurrence of targeted harmful behaviors after a dated stabilization point (1 January 2006).
::::::* A high‑ecological‑validity “stress test” during acute bereavement, used to examine whether non‑reactive awareness remains stable under maximal provocation.
::::::* Two independent practitioner cases (an Amazon‑verified report and a structured questionnaire case) providing preliminary convergent signals across cognitive, emotional, behavioral, and identity dimensions.
::::::All central constructs (Pure Awareness, partial personalities, the Switch, identity stabilization) are operationalized with explicit phenomenological and behavioral criteria intended to enable replication and future third‑person measurement.
::::::I believe this is a valid contribution to Wikiversity. 
::::::Best regards, 
::::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:54, 2 April 2026 (UTC)

== Unable to publish pages  ==

Whenever I try to publish a page with linked sources it gets flagged and says I'm a new user attempting to publish content with outside links. Those outside links are my sources. [[User:Soboyed|Soboyed]] ([[User talk:Soboyed|discuss]] • [[Special:Contributions/Soboyed|contribs]]) 04:52, 2 April 2026 (UTC)

:This restriction is automatically lifted after you have edited for a certain time (I don't recall that time off-hand, but it is not long). This is designed to stop spam. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 04:53, 2 April 2026 (UTC)

== Showing error to publish a Post ==

My  action was constructive, not destructive, please allow to publish it. [[Special:Contributions/&amp;#126;2026-20906-18|&amp;#126;2026-20906-18]] ([[User talk:&amp;#126;2026-20906-18|talk]]) 08:06, 4 April 2026 (UTC)

:Maybe you got caught in a filter. Consider [[Special:CreateAccount|creating an account]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:06, 4 April 2026 (UTC)
:Your edits, [https://en.wikiversity.org/w/index.php?title=Special:AbuseLog&amp;wpSearchUser=%7E2026-20906-18 these ones], seems to have tripped a filter when you tried to create a page on [[Create]] which external links. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 23:58, 4 April 2026 (UTC)
:Have you read my [https://en.wikiversity.org/w/index.php?title=Wikiversity:Request_custodian_action&amp;diff=prev&amp;oldid=2802219 previous reply] to you @[[User:~2026-20906-18|~2026-20906-18]]? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:02, 6 April 2026 (UTC)

== Abuse filters which should be deleted ==

Hi, there are some abuse filters which should probably be deleted.
* [[Special:AbuseFilter/1]] (not needed anymore)
* [[Special:AbuseFilter/2]] (no hits since 2018)
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched)
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives)
* [[Special:AbuseFilter/5]] (no hits since 2023)
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore)
* [[Special:AbuseFilter/17]] (no hits since 2022)
* [[Special:AbuseFilter/19]] (no hits since 2019)
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive)
Thanks. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 03:51, 5 April 2026 (UTC)

:Why do these need to be deleted rather than inactivated? Do inactive abuse filters cause a server strain? —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:39, 5 April 2026 (UTC)
:: Deleted filters do not cause strain to the servers. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:28, 5 April 2026 (UTC)
:These sounds like sensible suggestions but, yes, would inactivation perhaps make more sense than deletion for at least some  filters? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:35, 5 April 2026 (UTC)
:I would keep them @[[User:Codename Noreste|Codename Noreste]]. Alternatively, I would turn off the ones that haven't caught anything for a long time, but I would leave them enabled in case they need to be turned on or improved. If someone has already written the code and we don't have hundreds of free man-hours of programmers on Wikiversity, the server load seems secondary to me, and is negligible compared to other things. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:11, 6 April 2026 (UTC)
:: I know how to write abuse filter code and regex, but I would recommend disabling filters that have never caught anything in a long time ''and'' those who made lots of false positives. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:09, 6 April 2026 (UTC)
:::Of course @[[User:Codename Noreste|Codename Noreste]], there are people here today who are capable of changing the code. But the question is what it will be like in a few years, the question is what will happen if those two are busy for a long time, etc. That's why I would leave it so that those who don't know much about code can be inspired by it and will need to do something with it someday - plus, more code for different types of filtering is actually great educational material on how those filters work. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:41, 17 April 2026 (UTC)

Here's the updated list of abuse filters under review with actions I've taken (several disabled, one basic code improvement, and some actions changed) - none have been deleted so they can all be edited and reactivayed - please suggest any further changes:
* [[Special:AbuseFilter/1]] (not needed anymore) - One time account spam bot - 4 hits over 10 years ago - Disabled in 2024 - May be useful in future
* [[Special:AbuseFilter/2]] (no hits since 2018) - Userspace spamming - 778 hits; none since 2018 likely due to global filters - Now disabled
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched) - Specific user page spam - 1,101 hits most recent 7 March 2026 - Still active - Kept enabled
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives) - Questionable Language (profanity) - 6,055 hits including very recently - However it was logging hits without taking any actions - Edited to reduce likelihood of false positives by only applying filter to users with low (&lt; 20) edit count and applied weak actions to tag and warn but not prevent publishing the content
* [[Special:AbuseFilter/5]] (no hits since 2023) - Blocked Solicitation Links - 95 hits; none since 2023 - blocks specific historical spam sites - Non-active - Now disabled
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore) - Not reviewed - They are currently disabled
* [[Special:AbuseFilter/17]] (no hits since 2022) - Fundamental Physics Edits - 347 hits; none since 2022 - Non-active and very specific for a historical issue - Now disabled 
* [[Special:AbuseFilter/19]] (no hits since 2019) - Page Creation - 20 hits; none since 2019 - Retained for historical reference and possible future updates - Now disabled
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive) - Globally Banned Editor (renamed to Low-edit Spam Monitor) - 2,829 hits including very recent - Only applies to users with less than 5 edits and takes no actions / monitoring only - Reviewing the details of the hits I don't see many false positives and have strengthened its actions to add a tag and warning

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:57, 9 April 2026 (UTC)

== Block request ==

Please block ~2026-20985-80/~2026-21079-90/~2026-21223-88. Reason: Vandalism. [[User:Àncilu|Àncilu]] ([[User talk:Àncilu|discuss]] • [[Special:Contributions/Àncilu|contribs]]) 23:24, 5 April 2026 (UTC)

:All edits should be deleted and the first is blocked by Atcovi. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:33, 6 April 2026 (UTC)

== Antispam - Filter 12 ==
{{ping|Codename Noreste}} Thanks for contacting me with a suggested [[Special:AbuseFilter|abuse filter]] for the coupon spam we've been getting. A very much appreciated time saver. Per your suggestion, abuse filter 12 has been reactivated with your updated regex. It should tag and prevent page creation actions for coupon promo etc. Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:33, 15 April 2026 (UTC)
: @[[User:Jtneill|Jtneill]] Please do the following to filter 12:
:# Enable the block action (temporary for unregistered users, indefinite for registered users)
:# Disable both the disallow and tag actions, since that filter will be set to block
: Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:42, 5 May 2026 (UTC)
::Excellent. Done:
::* Block duration for non-registered users = 1 week
::* Block duration for registered users = indefinite
::* Disallow and tagging disabled
::Thankyou. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:24, 9 May 2026 (UTC)

== Urgent! error message This action has been automatically identified as potentially harmful, and therefore disallowed ==

While submitting the post this error was coming &quot;This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please inform an administrator of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link&quot; How to resolve it?

Here is the content:

{{note|marketing material removed}}

[[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:14, 17 April 2026 (UTC)
: That's because Wikiversity doesn't accept advertising. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 05:20, 17 April 2026 (UTC)
::So this is fine
::'''Online Internship and Digital Learning for Students'''
::Online learning has become an important part of modern education. With the help of the internet and digital tools, students can now study, practice, and gain experience without being physically present in a classroom. One key part of this system is the online internship, which helps students learn real-world skills along with their studies.
::An online internship allows students to work on tasks and projects through digital platforms. This makes learning more practical and useful, especially for those who want to understand how real work environments function.
::'''Background'''
::The concept of online learning developed from distance education, where students learned from remote locations. Over time, with the growth of digital technology, learning has become more interactive and flexible.
::The introduction of the online internship has added another important layer to digital education. It combines theoretical learning with practical experience, helping students prepare for future careers.
::During global events such as the COVID-19 pandemic, online education and online internship programs became essential. They helped students continue learning and gaining experience despite restrictions on physical movement.
::'''Importance of Online Internship'''
::An online internship plays an important role in student development. It helps bridge the gap between academic knowledge and practical skills.
::'''Some key points include:'''
::Students understand how real work is done
::They develop basic professional skills
::It supports career readiness
::It allows learning without location limits
::By participating in an online internship, students can improve their confidence and gain early exposure to different fields.
::'''Features of Online Internship-Based Learning'''
::Modern education platforms often include online internship opportunities as part of their learning system. These usually offer:
::Flexible schedules for students
::Access to learning from home
::Beginner-friendly tasks and projects
::A combination of theory and practice
::Such features make online internship programs suitable for a wide range of learners, including beginners.
::'''Learning Tasks'''
::Explore how online internship programs support student learning in digital environments.
::Identify how students can gain practical experience through an online internship
::Analyze the role of flexible learning in improving student engagement
::Understand how online education and internships work together
::'''References'''
::[https://ijpsl.in/wp-content/uploads/2020/09/E-Learning_Hanaaya-Navaneeth.pdf The Past, Present and Future of E-Learning: Hanaaya Varyani and Navaneeth M S]
::[https://ieeexplore.ieee.org/document/9788102 Current Trends and Future Perspectives of e-Learning in India]
::'''See Also'''
::[https://easyshiksha.com/online_courses/internship Online Internship]
::[https://easyshiksha.com/online_courses/ Online Courses]
::[https://easyshiksha.com/online_courses/kids-learning Kids Learning]
::[https://easyshiksha.com/career_helper/ Career Guidance] [[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:27, 17 April 2026 (UTC)
:::@[[User:EasyshikshaMarketing|EasyshikshaMarketing]] Wikiversity is a resource for education, or a space for education. However, your intention to link to another website is obvious, and such content does not belong here, as it contradicts the purpose of Wikiversity. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:38, 17 April 2026 (UTC)

==AI-generated images==
Seeking your advice.

Myself and students use some AI-generated images in the [[Motivation and emotion]] project.

[[User:Dronebogus]] has been removing some of these images from Wikiversity pages and nominating them for deletion at Commons. As a result, some have been deleted and some have been kept.

Dronebogus has made some useful edits and image suggestions for [[Motivation and emotion]] which I've appreciated and  incorporated. However, there are other edits to remove an AI image by Dronebogus that I've reverted where I think the image is more educational than no image or an alternative image suggested by Dronebogus.

There are a couple of pages where Dronebogus has reverted my reversion, so we are at risk of edit warring. We have briefly discussed and warned each other on our user talk pages, but it seems to come down to a difference in perception about the educational usefulness of the AI images.

So, I'm asking here for others to please review the recent edit histories for these pages:
* [[Motivation and emotion/Lectures/Brain and physiological needs]]
* [[Motivation and emotion/Book/2025/Stockholm syndrome emotion]]

and let us know what you think about the AI image suitability vs. using no image or alternative images suggested by Dronebogus.

Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:45, 26 April 2026 (UTC)

:I think Jtneill needs to try harder to find non-AI alternatives both on Commons and the web. I’m not reiterating the well known problems with generative AI— you can read about those on Wikipedia and the broader Internet. Needless to say it’s kind of just inherently toxic. If you use it, it should be the last resort of last resorts. Just my stance, which I consider perfectly valid and reasonable. [[User:Dronebogus|Dronebogus]] ([[User talk:Dronebogus|discuss]] • [[Special:Contributions/Dronebogus|contribs]]) 04:10, 27 April 2026 (UTC)</text>
      <sha1>ffz6yl38dbpvckfhjsrgn166hdsevle</sha1>
    </revision>
    <revision>
      <id>2809721</id>
      <parentid>2809719</parentid>
      <timestamp>2026-05-16T19:25:58Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Request for Page Creation Approval - Research on Dr. Ian Stevenson */ archive from [[Wikiversity:Request custodian action]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809721</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="38322" sha1="lr9f9otr4prr216xnl129cdx9dmcrmg" xml:space="preserve">{{Archive|Wikiversity:Request custodian action}}

== Sidewide count.js ==

i would like something like: [[Template:User contrib count/count.js]]. i created [[Template:User contrib count]] and a user/common.js. {{User contrib count}}.&lt;br&gt;&lt;br&gt; so a &quot;count.js&quot; would complete it. See [[User:Harold Foppele/common.js]].
If an Administrator could help please. Cheers [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 19:22, 18 January 2026 (UTC)

== need to add my profile ==

im trying to add new profile content  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:03, 4 February 2026 (UTC)

:You can edit it now. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:05, 4 February 2026 (UTC)
::where can create a new one [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)
:::i have created and its in sandbox. i would like to know when it will be approved  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 19:38, 4 February 2026 (UTC)
::::Please don’t create [[wv:spam|spam]] pages as it will be deleted. Please also read [[WV:Scope]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 04:01, 5 February 2026 (UTC)

== Im trying to add new profile while add content its shows not alowed ==

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Exceeded New Page Limit

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)

== New User: cannot create talk page ==

Hi, I am a new user of Wikiversity and I wanted to create a talk page for the article [[ChatGPT's Essay on Kohlberg's Theory: AI's Use in Academic Writing]]. As a new user, I was barred from performing this action. The text that I wanted to add to the talk page is:

&lt;blockquote&gt;
I have doubts as to to the reliability of this essay. Take for rexample the sentence:

&lt;blockquote&gt;
Due to its efficiency, AI has saved 380,000-403,000 lives per year in European healthcare as reported in a recent Deloitte and MedTech Europe report&lt;ref&gt;Dantas, C., Mackiewicz, K., Tageo, V., Jacucci, G., Guardado, D., Ortet, S., Varlamis, I., Maniadakis, M., De Lera, E., Quintas, J., Kocsis, O., &amp; Vassiliou, C. (2021). Benefits and hurdles of AI in the workplace – what comes next? ''International Journal of Artificial Intelligence and Expert Systems, 10'', 9-17. https://www.researchgate.net/publication/351993615_Benefits_and_Hurdles_of_AI_In_The_Workplace_-What_Comes_Next&lt;/ref&gt;.
&lt;/blockquote&gt;

Reading the reference (freely available on ResearchGate), one notes:

# that the reference is from 2021 (predating the widespread use of LLMs such as ChatGPT and the associated 'AI' boom), and
# that the reference factually contradicts this essay.

Quoting from the reference:

&lt;blockquote&gt;
There are enormous benefits of applying AI-based solutions to monitor workers’ health and prevent accidents or, currently, COVID-19 infections, and those benefits are reported with enormous potential. According to the recent Deloitte and MedTech Europe report [11], implementing AI in European healthcare systems could save up 380,000 to 403,000 lives annually or €170.9 to 212.4 billion per year.
&lt;/blockquote&gt;

Not that the reference says ''could save'', not ''saves'' as in the essay.

This calls into question the reliability of the essay.

&lt;/blockquote&gt;

Could an administrator make this addition for me? Thank you! 
{{reflist}}
[[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 06:53, 5 February 2026 (UTC)

:@[[User:Æolus|Æolus]] I have added it for you, you can change the header and sign it now. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 08:05, 5 February 2026 (UTC)
::Thank you! [[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 12:43, 5 February 2026 (UTC)

== Disallowed to add a page on a course ==

I'm trying to populate a newly created course on Wikiversity, but it blocks me from creating more pages with &quot;New User Exceeded New Page Limit&quot;. Could this be lifted please? [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 13:21, 15 February 2026 (UTC)

:Sorry! Never mind. I was trying to create a new article instead of a new page. All good now. [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 14:03, 15 February 2026 (UTC)

== Harold Foppele adding LLM-generated nonsense and personal fiction ==

I became aware of [[User:Harold Foppele]]'s editing after I deleted some of his uploads on Commons. He appears to be adding a large amount of text and images that are some combination of personal fiction and LLM-generated nonsense. This includes:
*[[Quantum Ultra fast lasers#Future thought experiment|Personal speculative fiction]] in an otherwise &quot;nonfiction&quot; article
*Uploading nonsense LLM-created [[:File:Rontosecond pulse laser (Schematic).jpg|diagrams]] and [[:File:Rontosecond pulse laser (Futuristic).jpg|renders]] for nonexistent lab equipment, with fake source (on Commons, he indicated these files as having been created by him using an LLM)
*Uploading nonsense LLM-created images of equations with obvious artifacts. These images, such as [[:File:Redfield equation (non-Markovian).png]] and [[:File:Lindblad equation (Markovian).png]], don't even match the text he puts them with.
Much of his writing is also of extremely poor quality, to the point where it's not clear whether it's written by him or an LLM. I'm not an active editor on this project, so I'm not as familiar with the standards here, but I believe this is worth custodian attention. [[User:Pi.1415926535|Pi.1415926535]] ([[User talk:Pi.1415926535|discuss]] • [[Special:Contributions/Pi.1415926535|contribs]]) 03:06, 23 February 2026 (UTC)

:Fake source ''and'' contradictory copyright info, claiming both public domain and CC license. Moreover, if they are indeed nearly-direct LLM output, depending on jurisdiction they may not even be eligible for copyright.
:I've put speedy deletion marks for the equations, because they're obviously not coherent mathematical equations (the parentheses don't match, the symbols merge into each other the way text in image models often do, etc) [[User:Sesquilinear|Sesquilinear]] ([[User talk:Sesquilinear|discuss]] • [[Special:Contributions/Sesquilinear|contribs]]) 21:50, 7 March 2026 (UTC)

== Repeated removal of RFD notices by Harold Foppele ==

{{User|Harold Foppele }}

This editor is appearing in multiple noticeboards for behaviour which is contentious. Ther latest adventure is the repeated removal of tye RFD notice at [[Quantum/Henry C. Kapteyn]]. You will see from their contributions record the number of times. I have warned Tham on their user tag page that this is tantaomunt to volunteering to be blocked here. They have a track record of achieving blocks on enWiki and Commons already.

They have all the appearance of shooting not to understand when given direct information about their behaviour, whichever project they are editing, and are fast becoming a time sink. Their behaviour across multiple WMF sites may well lead to a Global Lock, but I do not believe they have quite reached the threshold for that.

I believe that what is required is a preventative block to seek to ensure thatchy understand the seriousness of their behaviour, and the need to be collegial. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 23:03, 4 March 2026 (UTC)
: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:45, 8 March 2026 (UTC)

== Blocks for sockpuppet ==

Please block [[User:Harold Foppele]] and [[User:Johnwilliamsiii]] for sockpuppetry based on [https://en.wikipedia.org/wiki/Wikipedia:Sockpuppet_investigations/Harold_Foppele en wiki] CU and [https://commons.wikimedia.org/w/index.php?diff=1177465640 commons] CU investigations. The user has also violated copyright, see the above discussion. A block is necessary to prevent further abuse. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:30, 8 March 2026 (UTC)

:&lt;small&gt;@[[User:MathXplore|MathXplore]]&lt;/small&gt; [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:31, 8 March 2026 (UTC)
:: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:44, 8 March 2026 (UTC)
:CC. @[[User:Timtrent|Timtrent]], @[[User:Sesquilinear|Sesquilinear]], @[[User:Pi.1415926535|Pi.1415926535]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:33, 8 March 2026 (UTC)
::Thank you for the ping. I concur based on [[w:en:WP:DUCK|behaviour]]. CUs appear divided. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 11:41, 8 March 2026 (UTC)

== Problem when trying to start a discussion with authors of the Plurilingual education portal ==

The authors I wanted to discuss with are called &quot;Project PEP&quot; and my name is Franch Chandler. How can I be allowed to do so ? [[User:French Chandler|French Chandler]] ([[User talk:French Chandler|discuss]] • [[Special:Contributions/French Chandler|contribs]]) 18:25, 16 March 2026 (UTC)

:@[[User:French Chandler|French Chandler]] place your qestion [https://en.wikiversity.org/w/index.php?title=User_talk:Projet_PEP&amp;action=edit into the dialog box] on this link and hit Publish page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:22, 16 March 2026 (UTC)

== Please publish my post ==

My post is about &quot;Every child grows and develops at their own pace, but some may experience challenges that affect their ability to perform everyday tasks. These challenges can include difficulties with fine motor skills, sensory processing, handwriting, feeding, and self-regulation. When these issues are not addressed early, they can impact a child’s confidence, academic performance, and independence.

With the rise of digital healthcare services, '''online physical therapy''' has emerged as a powerful and accessible solution for parents seeking support for their children. This modern approach provides structured, personalized therapy programs that can be accessed from the comfort of home, making it easier for families to ensure consistent care.&quot; [[User:Skyabovetherapy|Skyabovetherapy]] ([[User talk:Skyabovetherapy|discuss]] • [[Special:Contributions/Skyabovetherapy|contribs]]) 12:28, 28 March 2026 (UTC)

:@[[User:Skyabovetherapy|Skyabovetherapy]] Well, you can publish it yourself, Wikiversity is a free environement, where everybody can create educational resources. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 14:11, 29 March 2026 (UTC)
::They actually triggered some abuse filters. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 16:24, 29 March 2026 (UTC)
:I looked at your attempts to add this text and I see a link to one website repeated many times, which reminds me of the misuse of Wikiversity for self-promotion or to increase the importance of the website. It is necessary to remind you here that Wikiversity is not a place for promotion, but a place for education. So if you want to educate, it will not be a problem to create the page without external links with a clearly defined procedure for how people should use it and what to expect from it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:07, 1 April 2026 (UTC)

== New user limit ==

Hi, I am creating an AIPA Method learning resource page. 

I am the author of the linked research, and I hit the “new user limit” and “new page with external link” filters while publishing. 

Here is the link to the page in creation: [https://en.wikiversity.org/w/index.php?title=AIPA_Method&amp;veaction=edit] 

Thank you for your help. 

Best regards, 

Senad Dizdarević [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:19, 30 March 2026 (UTC)

:@[[User:Senad Dizdarević|Senad Dizdarević]] I should admit I dont know, what is &quot;new user limit&quot;, but if filter blocks your page because of certain external link, you may force to save anyway and sometimes it works. It should not work, when the website is blacklisted. As of now, I am not seeing you to save page in main namespace, so try to save it without external links first. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:30, 30 March 2026 (UTC)
::Thank you, you are very kind. 
::I will wait a day, and try again (without links, too). 
::Today, I already created About Me info page, and maybe that is enough for the filters for one day.  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:53, 30 March 2026 (UTC)
:::Well, I have analyzed your contribution to Wikiversity and I should point out here, that this project is not a place for advertising, so there is no way of promoting your books and authority this way. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:56, 1 April 2026 (UTC)
::::Hi, my About Me page is just an info page with the neutral as possible presentation of my work. 
::::There is a big difference between informing and advertising. Informing is neutrally stating that something exists and requiring no action, while advertising is a special communication form with intent to cause certain action from readers. For example, click here, click there, order this, buy that. 
::::There is no such intention, form, or terms on my info page. Just neutral information. I don't hide and I am not ashamed that I am write and author, and that is a part of the usual bio, including works. I checked your user page: &quot;I graduated from the Czech University of Life Sciences in Prague and studied information science at the Faculty of Arts of Charles University.&quot; I think that if you had written a book on Life Science, you would have mentioned that as well.
::::Most of the Info page is about my research and AIPA Method which is a valid contribution to psychology, consciousness studies, identity theory, and personality development. Actually, my paper '''AIPA Method: A Cognitive-Phenomenological Model for Identity Reconstruction and Stabilization in Pure Awareness''' is now in the peer review procedure at Journal of Consciousness Studies. 
::::Here is a part from the Wikiversity AIPA Method page in creation (waiting for the end of the time limit for new users):    [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:47, 2 April 2026 (UTC)
:::::For the unknown reasons, the form didn't publish my second part of the message: 
:::::I believe this is a valid contribution to Wikiversity. 
:::::Best Regards, 
:::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:52, 2 April 2026 (UTC)
::::::And the third try: 
:::::: == Introduction ==
::::::The AIPA Method addresses a gap in contemporary personal development and consciousness science: most evidence‑based approaches (CBT, MBSR, MBCT, standard meditation) operate at the level of mental content—reframing thoughts, observing them, or reducing their impact—rather than at the level of identity structure. In contrast, AIPA targets the structural relationship between the self and the mind, aiming at durable identity reconstruction rooted in Pure Awareness rather than symptom management.
::::::The central research question of the primary AIPA preprint is whether a structured, sequentially staged method can produce permanent identity reconstruction rooted in Pure Awareness, and how such a method compares to established approaches in scope, mechanism, and outcome.
:::::: == Theoretical foundations ==
::::::The AIPA framework is grounded in the cognitive‑phenomenological tradition (e.g., McAdams, Varela, Metzinger, Erikson), contemporary consciousness science on minimal phenomenal experience, and qualitative methods advocacy in psychology. It builds directly on:
::::::* Empirical work on pure awareness and Minimal Phenomenal Experience (MPE), especially Gamma &amp; Metzinger’s large‑scale study of content‑reduced awareness states.
::::::* Metzinger’s proposal of minimal phenomenal experience as an entry point for a minimal unifying model of consciousness.
::::::* Narrative identity and partial‑self models within personality and identity theory.
::::::Within this backdrop, AIPA proposes Pure Awareness as a distinct, operationally specified state that can become a structural ground of identity rather than a transient meditative experience.
:::::: == Experiential empiricism ==
::::::The empirical foundation of the AIPA Method is explicitly first‑person and experiential, combining:
::::::* A 22‑year longitudinal autoethnographic self‑study (2003–2025) documenting partial personality episodes, protocol use, and outcomes.
::::::* A 13‑year prospective verification period with zero self‑reported recurrence of targeted harmful behaviors after a dated stabilization point (1 January 2006).
::::::* A high‑ecological‑validity “stress test” during acute bereavement, used to examine whether non‑reactive awareness remains stable under maximal provocation.
::::::* Two independent practitioner cases (an Amazon‑verified report and a structured questionnaire case) providing preliminary convergent signals across cognitive, emotional, behavioral, and identity dimensions.
::::::All central constructs (Pure Awareness, partial personalities, the Switch, identity stabilization) are operationalized with explicit phenomenological and behavioral criteria intended to enable replication and future third‑person measurement.
::::::I believe this is a valid contribution to Wikiversity. 
::::::Best regards, 
::::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:54, 2 April 2026 (UTC)

== Unable to publish pages  ==

Whenever I try to publish a page with linked sources it gets flagged and says I'm a new user attempting to publish content with outside links. Those outside links are my sources. [[User:Soboyed|Soboyed]] ([[User talk:Soboyed|discuss]] • [[Special:Contributions/Soboyed|contribs]]) 04:52, 2 April 2026 (UTC)

:This restriction is automatically lifted after you have edited for a certain time (I don't recall that time off-hand, but it is not long). This is designed to stop spam. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 04:53, 2 April 2026 (UTC)

== Showing error to publish a Post ==

My  action was constructive, not destructive, please allow to publish it. [[Special:Contributions/&amp;#126;2026-20906-18|&amp;#126;2026-20906-18]] ([[User talk:&amp;#126;2026-20906-18|talk]]) 08:06, 4 April 2026 (UTC)

:Maybe you got caught in a filter. Consider [[Special:CreateAccount|creating an account]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:06, 4 April 2026 (UTC)
:Your edits, [https://en.wikiversity.org/w/index.php?title=Special:AbuseLog&amp;wpSearchUser=%7E2026-20906-18 these ones], seems to have tripped a filter when you tried to create a page on [[Create]] which external links. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 23:58, 4 April 2026 (UTC)
:Have you read my [https://en.wikiversity.org/w/index.php?title=Wikiversity:Request_custodian_action&amp;diff=prev&amp;oldid=2802219 previous reply] to you @[[User:~2026-20906-18|~2026-20906-18]]? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:02, 6 April 2026 (UTC)

== Abuse filters which should be deleted ==

Hi, there are some abuse filters which should probably be deleted.
* [[Special:AbuseFilter/1]] (not needed anymore)
* [[Special:AbuseFilter/2]] (no hits since 2018)
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched)
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives)
* [[Special:AbuseFilter/5]] (no hits since 2023)
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore)
* [[Special:AbuseFilter/17]] (no hits since 2022)
* [[Special:AbuseFilter/19]] (no hits since 2019)
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive)
Thanks. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 03:51, 5 April 2026 (UTC)

:Why do these need to be deleted rather than inactivated? Do inactive abuse filters cause a server strain? —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:39, 5 April 2026 (UTC)
:: Deleted filters do not cause strain to the servers. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:28, 5 April 2026 (UTC)
:These sounds like sensible suggestions but, yes, would inactivation perhaps make more sense than deletion for at least some  filters? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:35, 5 April 2026 (UTC)
:I would keep them @[[User:Codename Noreste|Codename Noreste]]. Alternatively, I would turn off the ones that haven't caught anything for a long time, but I would leave them enabled in case they need to be turned on or improved. If someone has already written the code and we don't have hundreds of free man-hours of programmers on Wikiversity, the server load seems secondary to me, and is negligible compared to other things. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:11, 6 April 2026 (UTC)
:: I know how to write abuse filter code and regex, but I would recommend disabling filters that have never caught anything in a long time ''and'' those who made lots of false positives. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:09, 6 April 2026 (UTC)
:::Of course @[[User:Codename Noreste|Codename Noreste]], there are people here today who are capable of changing the code. But the question is what it will be like in a few years, the question is what will happen if those two are busy for a long time, etc. That's why I would leave it so that those who don't know much about code can be inspired by it and will need to do something with it someday - plus, more code for different types of filtering is actually great educational material on how those filters work. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:41, 17 April 2026 (UTC)

Here's the updated list of abuse filters under review with actions I've taken (several disabled, one basic code improvement, and some actions changed) - none have been deleted so they can all be edited and reactivayed - please suggest any further changes:
* [[Special:AbuseFilter/1]] (not needed anymore) - One time account spam bot - 4 hits over 10 years ago - Disabled in 2024 - May be useful in future
* [[Special:AbuseFilter/2]] (no hits since 2018) - Userspace spamming - 778 hits; none since 2018 likely due to global filters - Now disabled
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched) - Specific user page spam - 1,101 hits most recent 7 March 2026 - Still active - Kept enabled
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives) - Questionable Language (profanity) - 6,055 hits including very recently - However it was logging hits without taking any actions - Edited to reduce likelihood of false positives by only applying filter to users with low (&lt; 20) edit count and applied weak actions to tag and warn but not prevent publishing the content
* [[Special:AbuseFilter/5]] (no hits since 2023) - Blocked Solicitation Links - 95 hits; none since 2023 - blocks specific historical spam sites - Non-active - Now disabled
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore) - Not reviewed - They are currently disabled
* [[Special:AbuseFilter/17]] (no hits since 2022) - Fundamental Physics Edits - 347 hits; none since 2022 - Non-active and very specific for a historical issue - Now disabled 
* [[Special:AbuseFilter/19]] (no hits since 2019) - Page Creation - 20 hits; none since 2019 - Retained for historical reference and possible future updates - Now disabled
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive) - Globally Banned Editor (renamed to Low-edit Spam Monitor) - 2,829 hits including very recent - Only applies to users with less than 5 edits and takes no actions / monitoring only - Reviewing the details of the hits I don't see many false positives and have strengthened its actions to add a tag and warning

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:57, 9 April 2026 (UTC)

== Block request ==

Please block ~2026-20985-80/~2026-21079-90/~2026-21223-88. Reason: Vandalism. [[User:Àncilu|Àncilu]] ([[User talk:Àncilu|discuss]] • [[Special:Contributions/Àncilu|contribs]]) 23:24, 5 April 2026 (UTC)

:All edits should be deleted and the first is blocked by Atcovi. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:33, 6 April 2026 (UTC)

== Antispam - Filter 12 ==
{{ping|Codename Noreste}} Thanks for contacting me with a suggested [[Special:AbuseFilter|abuse filter]] for the coupon spam we've been getting. A very much appreciated time saver. Per your suggestion, abuse filter 12 has been reactivated with your updated regex. It should tag and prevent page creation actions for coupon promo etc. Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:33, 15 April 2026 (UTC)
: @[[User:Jtneill|Jtneill]] Please do the following to filter 12:
:# Enable the block action (temporary for unregistered users, indefinite for registered users)
:# Disable both the disallow and tag actions, since that filter will be set to block
: Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:42, 5 May 2026 (UTC)
::Excellent. Done:
::* Block duration for non-registered users = 1 week
::* Block duration for registered users = indefinite
::* Disallow and tagging disabled
::Thankyou. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:24, 9 May 2026 (UTC)

== Urgent! error message This action has been automatically identified as potentially harmful, and therefore disallowed ==

While submitting the post this error was coming &quot;This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please inform an administrator of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link&quot; How to resolve it?

Here is the content:

{{note|marketing material removed}}

[[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:14, 17 April 2026 (UTC)
: That's because Wikiversity doesn't accept advertising. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 05:20, 17 April 2026 (UTC)
::So this is fine
::'''Online Internship and Digital Learning for Students'''
::Online learning has become an important part of modern education. With the help of the internet and digital tools, students can now study, practice, and gain experience without being physically present in a classroom. One key part of this system is the online internship, which helps students learn real-world skills along with their studies.
::An online internship allows students to work on tasks and projects through digital platforms. This makes learning more practical and useful, especially for those who want to understand how real work environments function.
::'''Background'''
::The concept of online learning developed from distance education, where students learned from remote locations. Over time, with the growth of digital technology, learning has become more interactive and flexible.
::The introduction of the online internship has added another important layer to digital education. It combines theoretical learning with practical experience, helping students prepare for future careers.
::During global events such as the COVID-19 pandemic, online education and online internship programs became essential. They helped students continue learning and gaining experience despite restrictions on physical movement.
::'''Importance of Online Internship'''
::An online internship plays an important role in student development. It helps bridge the gap between academic knowledge and practical skills.
::'''Some key points include:'''
::Students understand how real work is done
::They develop basic professional skills
::It supports career readiness
::It allows learning without location limits
::By participating in an online internship, students can improve their confidence and gain early exposure to different fields.
::'''Features of Online Internship-Based Learning'''
::Modern education platforms often include online internship opportunities as part of their learning system. These usually offer:
::Flexible schedules for students
::Access to learning from home
::Beginner-friendly tasks and projects
::A combination of theory and practice
::Such features make online internship programs suitable for a wide range of learners, including beginners.
::'''Learning Tasks'''
::Explore how online internship programs support student learning in digital environments.
::Identify how students can gain practical experience through an online internship
::Analyze the role of flexible learning in improving student engagement
::Understand how online education and internships work together
::'''References'''
::[https://ijpsl.in/wp-content/uploads/2020/09/E-Learning_Hanaaya-Navaneeth.pdf The Past, Present and Future of E-Learning: Hanaaya Varyani and Navaneeth M S]
::[https://ieeexplore.ieee.org/document/9788102 Current Trends and Future Perspectives of e-Learning in India]
::'''See Also'''
::[https://easyshiksha.com/online_courses/internship Online Internship]
::[https://easyshiksha.com/online_courses/ Online Courses]
::[https://easyshiksha.com/online_courses/kids-learning Kids Learning]
::[https://easyshiksha.com/career_helper/ Career Guidance] [[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:27, 17 April 2026 (UTC)
:::@[[User:EasyshikshaMarketing|EasyshikshaMarketing]] Wikiversity is a resource for education, or a space for education. However, your intention to link to another website is obvious, and such content does not belong here, as it contradicts the purpose of Wikiversity. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:38, 17 April 2026 (UTC)

==AI-generated images==
Seeking your advice.

Myself and students use some AI-generated images in the [[Motivation and emotion]] project.

[[User:Dronebogus]] has been removing some of these images from Wikiversity pages and nominating them for deletion at Commons. As a result, some have been deleted and some have been kept.

Dronebogus has made some useful edits and image suggestions for [[Motivation and emotion]] which I've appreciated and  incorporated. However, there are other edits to remove an AI image by Dronebogus that I've reverted where I think the image is more educational than no image or an alternative image suggested by Dronebogus.

There are a couple of pages where Dronebogus has reverted my reversion, so we are at risk of edit warring. We have briefly discussed and warned each other on our user talk pages, but it seems to come down to a difference in perception about the educational usefulness of the AI images.

So, I'm asking here for others to please review the recent edit histories for these pages:
* [[Motivation and emotion/Lectures/Brain and physiological needs]]
* [[Motivation and emotion/Book/2025/Stockholm syndrome emotion]]

and let us know what you think about the AI image suitability vs. using no image or alternative images suggested by Dronebogus.

Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:45, 26 April 2026 (UTC)

:I think Jtneill needs to try harder to find non-AI alternatives both on Commons and the web. I’m not reiterating the well known problems with generative AI— you can read about those on Wikipedia and the broader Internet. Needless to say it’s kind of just inherently toxic. If you use it, it should be the last resort of last resorts. Just my stance, which I consider perfectly valid and reasonable. [[User:Dronebogus|Dronebogus]] ([[User talk:Dronebogus|discuss]] • [[Special:Contributions/Dronebogus|contribs]]) 04:10, 27 April 2026 (UTC)

== Request for Page Creation Approval - Research on Dr. Ian Stevenson ==


'''Hello Administrators,'''

I am a digital archivist and researcher attempting to create an educational page regarding Dr. Ian Stevenson's scientific work, specifically titled &quot;Where Reincarnation and Biology Intersect&quot; and its official Vietnamese edition.

My edits are purely constructive, aimed at integrating local research context with global structured data (including '''Wikidata Q139548587'''). The automated filter is currently preventing publication due to &quot;new user external link limits.&quot;

I have ensured that all citations, references, and images (sourced from Wikimedia Commons) are strictly academic and non-promotional. Could you please review my contributions and consider whitelisting my account or approving this specific page creation?

Thank you for your assistance in preserving this research '''legacy''' within the open knowledge ecosystem.

'''Best regards,''' [[User:Ian Stevenson777|Ian Stevenson777]] ([[User talk:Ian Stevenson777|discuss]] • [[Special:Contributions/Ian Stevenson777|contribs]]) 07:26, 28 April 2026 (UTC)
: The page title should probably be in English, as this is English Wikiversity. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:19, 28 April 2026 (UTC)
:@[[User:Ian Stevenson777|Ian Stevenson777]] I looked at the text and it seems to me that it is informative, but the user cannot learn anything from it because they would have to buy the book. In this regard, it seems to me that it is enough [[:w:Where Reincarnation and Biology Intersect|to have that article on Wikipedia]] and there is no need to duplicate it here on Wikiversity. If you are particularly interested with its Vietnamese translation, I would focus on Vietnamese Wikipedia, but it seems to me, that the article there [https://vi.wikipedia.org/w/index.php?title=N%C6%A1i_lu%C3%A2n_h%E1%BB%93i_v%C3%A0_sinh_h%E1%BB%8Dc_giao_nhau&amp;oldid=75029095 have some problems at the moment]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:51, 5 May 2026 (UTC)
:This request is AI-generated and was made by a lock evading LTA. Please ignore it. [[User:NguoiDungKhongDinhDanh|NguoiDungKhongDinhDanh]] ([[User talk:NguoiDungKhongDinhDanh|discuss]] • [[Special:Contributions/NguoiDungKhongDinhDanh|contribs]]) 23:58, 13 May 2026 (UTC)</text>
      <sha1>lr9f9otr4prr216xnl129cdx9dmcrmg</sha1>
    </revision>
    <revision>
      <id>2809723</id>
      <parentid>2809721</parentid>
      <timestamp>2026-05-16T19:26:06Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Call for custodians and bureaucrats */ archive from [[Wikiversity:Request custodian action]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809723</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="38651" sha1="b21ihwg9fi83eic3m5h3thxo8k7s0sq" xml:space="preserve">{{Archive|Wikiversity:Request custodian action}}

== Sidewide count.js ==

i would like something like: [[Template:User contrib count/count.js]]. i created [[Template:User contrib count]] and a user/common.js. {{User contrib count}}.&lt;br&gt;&lt;br&gt; so a &quot;count.js&quot; would complete it. See [[User:Harold Foppele/common.js]].
If an Administrator could help please. Cheers [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 19:22, 18 January 2026 (UTC)

== need to add my profile ==

im trying to add new profile content  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:03, 4 February 2026 (UTC)

:You can edit it now. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:05, 4 February 2026 (UTC)
::where can create a new one [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)
:::i have created and its in sandbox. i would like to know when it will be approved  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 19:38, 4 February 2026 (UTC)
::::Please don’t create [[wv:spam|spam]] pages as it will be deleted. Please also read [[WV:Scope]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 04:01, 5 February 2026 (UTC)

== Im trying to add new profile while add content its shows not alowed ==

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Exceeded New Page Limit

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)

== New User: cannot create talk page ==

Hi, I am a new user of Wikiversity and I wanted to create a talk page for the article [[ChatGPT's Essay on Kohlberg's Theory: AI's Use in Academic Writing]]. As a new user, I was barred from performing this action. The text that I wanted to add to the talk page is:

&lt;blockquote&gt;
I have doubts as to to the reliability of this essay. Take for rexample the sentence:

&lt;blockquote&gt;
Due to its efficiency, AI has saved 380,000-403,000 lives per year in European healthcare as reported in a recent Deloitte and MedTech Europe report&lt;ref&gt;Dantas, C., Mackiewicz, K., Tageo, V., Jacucci, G., Guardado, D., Ortet, S., Varlamis, I., Maniadakis, M., De Lera, E., Quintas, J., Kocsis, O., &amp; Vassiliou, C. (2021). Benefits and hurdles of AI in the workplace – what comes next? ''International Journal of Artificial Intelligence and Expert Systems, 10'', 9-17. https://www.researchgate.net/publication/351993615_Benefits_and_Hurdles_of_AI_In_The_Workplace_-What_Comes_Next&lt;/ref&gt;.
&lt;/blockquote&gt;

Reading the reference (freely available on ResearchGate), one notes:

# that the reference is from 2021 (predating the widespread use of LLMs such as ChatGPT and the associated 'AI' boom), and
# that the reference factually contradicts this essay.

Quoting from the reference:

&lt;blockquote&gt;
There are enormous benefits of applying AI-based solutions to monitor workers’ health and prevent accidents or, currently, COVID-19 infections, and those benefits are reported with enormous potential. According to the recent Deloitte and MedTech Europe report [11], implementing AI in European healthcare systems could save up 380,000 to 403,000 lives annually or €170.9 to 212.4 billion per year.
&lt;/blockquote&gt;

Not that the reference says ''could save'', not ''saves'' as in the essay.

This calls into question the reliability of the essay.

&lt;/blockquote&gt;

Could an administrator make this addition for me? Thank you! 
{{reflist}}
[[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 06:53, 5 February 2026 (UTC)

:@[[User:Æolus|Æolus]] I have added it for you, you can change the header and sign it now. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 08:05, 5 February 2026 (UTC)
::Thank you! [[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 12:43, 5 February 2026 (UTC)

== Disallowed to add a page on a course ==

I'm trying to populate a newly created course on Wikiversity, but it blocks me from creating more pages with &quot;New User Exceeded New Page Limit&quot;. Could this be lifted please? [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 13:21, 15 February 2026 (UTC)

:Sorry! Never mind. I was trying to create a new article instead of a new page. All good now. [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 14:03, 15 February 2026 (UTC)

== Harold Foppele adding LLM-generated nonsense and personal fiction ==

I became aware of [[User:Harold Foppele]]'s editing after I deleted some of his uploads on Commons. He appears to be adding a large amount of text and images that are some combination of personal fiction and LLM-generated nonsense. This includes:
*[[Quantum Ultra fast lasers#Future thought experiment|Personal speculative fiction]] in an otherwise &quot;nonfiction&quot; article
*Uploading nonsense LLM-created [[:File:Rontosecond pulse laser (Schematic).jpg|diagrams]] and [[:File:Rontosecond pulse laser (Futuristic).jpg|renders]] for nonexistent lab equipment, with fake source (on Commons, he indicated these files as having been created by him using an LLM)
*Uploading nonsense LLM-created images of equations with obvious artifacts. These images, such as [[:File:Redfield equation (non-Markovian).png]] and [[:File:Lindblad equation (Markovian).png]], don't even match the text he puts them with.
Much of his writing is also of extremely poor quality, to the point where it's not clear whether it's written by him or an LLM. I'm not an active editor on this project, so I'm not as familiar with the standards here, but I believe this is worth custodian attention. [[User:Pi.1415926535|Pi.1415926535]] ([[User talk:Pi.1415926535|discuss]] • [[Special:Contributions/Pi.1415926535|contribs]]) 03:06, 23 February 2026 (UTC)

:Fake source ''and'' contradictory copyright info, claiming both public domain and CC license. Moreover, if they are indeed nearly-direct LLM output, depending on jurisdiction they may not even be eligible for copyright.
:I've put speedy deletion marks for the equations, because they're obviously not coherent mathematical equations (the parentheses don't match, the symbols merge into each other the way text in image models often do, etc) [[User:Sesquilinear|Sesquilinear]] ([[User talk:Sesquilinear|discuss]] • [[Special:Contributions/Sesquilinear|contribs]]) 21:50, 7 March 2026 (UTC)

== Repeated removal of RFD notices by Harold Foppele ==

{{User|Harold Foppele }}

This editor is appearing in multiple noticeboards for behaviour which is contentious. Ther latest adventure is the repeated removal of tye RFD notice at [[Quantum/Henry C. Kapteyn]]. You will see from their contributions record the number of times. I have warned Tham on their user tag page that this is tantaomunt to volunteering to be blocked here. They have a track record of achieving blocks on enWiki and Commons already.

They have all the appearance of shooting not to understand when given direct information about their behaviour, whichever project they are editing, and are fast becoming a time sink. Their behaviour across multiple WMF sites may well lead to a Global Lock, but I do not believe they have quite reached the threshold for that.

I believe that what is required is a preventative block to seek to ensure thatchy understand the seriousness of their behaviour, and the need to be collegial. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 23:03, 4 March 2026 (UTC)
: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:45, 8 March 2026 (UTC)

== Blocks for sockpuppet ==

Please block [[User:Harold Foppele]] and [[User:Johnwilliamsiii]] for sockpuppetry based on [https://en.wikipedia.org/wiki/Wikipedia:Sockpuppet_investigations/Harold_Foppele en wiki] CU and [https://commons.wikimedia.org/w/index.php?diff=1177465640 commons] CU investigations. The user has also violated copyright, see the above discussion. A block is necessary to prevent further abuse. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:30, 8 March 2026 (UTC)

:&lt;small&gt;@[[User:MathXplore|MathXplore]]&lt;/small&gt; [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:31, 8 March 2026 (UTC)
:: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:44, 8 March 2026 (UTC)
:CC. @[[User:Timtrent|Timtrent]], @[[User:Sesquilinear|Sesquilinear]], @[[User:Pi.1415926535|Pi.1415926535]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:33, 8 March 2026 (UTC)
::Thank you for the ping. I concur based on [[w:en:WP:DUCK|behaviour]]. CUs appear divided. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 11:41, 8 March 2026 (UTC)

== Problem when trying to start a discussion with authors of the Plurilingual education portal ==

The authors I wanted to discuss with are called &quot;Project PEP&quot; and my name is Franch Chandler. How can I be allowed to do so ? [[User:French Chandler|French Chandler]] ([[User talk:French Chandler|discuss]] • [[Special:Contributions/French Chandler|contribs]]) 18:25, 16 March 2026 (UTC)

:@[[User:French Chandler|French Chandler]] place your qestion [https://en.wikiversity.org/w/index.php?title=User_talk:Projet_PEP&amp;action=edit into the dialog box] on this link and hit Publish page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:22, 16 March 2026 (UTC)

== Please publish my post ==

My post is about &quot;Every child grows and develops at their own pace, but some may experience challenges that affect their ability to perform everyday tasks. These challenges can include difficulties with fine motor skills, sensory processing, handwriting, feeding, and self-regulation. When these issues are not addressed early, they can impact a child’s confidence, academic performance, and independence.

With the rise of digital healthcare services, '''online physical therapy''' has emerged as a powerful and accessible solution for parents seeking support for their children. This modern approach provides structured, personalized therapy programs that can be accessed from the comfort of home, making it easier for families to ensure consistent care.&quot; [[User:Skyabovetherapy|Skyabovetherapy]] ([[User talk:Skyabovetherapy|discuss]] • [[Special:Contributions/Skyabovetherapy|contribs]]) 12:28, 28 March 2026 (UTC)

:@[[User:Skyabovetherapy|Skyabovetherapy]] Well, you can publish it yourself, Wikiversity is a free environement, where everybody can create educational resources. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 14:11, 29 March 2026 (UTC)
::They actually triggered some abuse filters. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 16:24, 29 March 2026 (UTC)
:I looked at your attempts to add this text and I see a link to one website repeated many times, which reminds me of the misuse of Wikiversity for self-promotion or to increase the importance of the website. It is necessary to remind you here that Wikiversity is not a place for promotion, but a place for education. So if you want to educate, it will not be a problem to create the page without external links with a clearly defined procedure for how people should use it and what to expect from it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:07, 1 April 2026 (UTC)

== New user limit ==

Hi, I am creating an AIPA Method learning resource page. 

I am the author of the linked research, and I hit the “new user limit” and “new page with external link” filters while publishing. 

Here is the link to the page in creation: [https://en.wikiversity.org/w/index.php?title=AIPA_Method&amp;veaction=edit] 

Thank you for your help. 

Best regards, 

Senad Dizdarević [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:19, 30 March 2026 (UTC)

:@[[User:Senad Dizdarević|Senad Dizdarević]] I should admit I dont know, what is &quot;new user limit&quot;, but if filter blocks your page because of certain external link, you may force to save anyway and sometimes it works. It should not work, when the website is blacklisted. As of now, I am not seeing you to save page in main namespace, so try to save it without external links first. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:30, 30 March 2026 (UTC)
::Thank you, you are very kind. 
::I will wait a day, and try again (without links, too). 
::Today, I already created About Me info page, and maybe that is enough for the filters for one day.  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:53, 30 March 2026 (UTC)
:::Well, I have analyzed your contribution to Wikiversity and I should point out here, that this project is not a place for advertising, so there is no way of promoting your books and authority this way. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:56, 1 April 2026 (UTC)
::::Hi, my About Me page is just an info page with the neutral as possible presentation of my work. 
::::There is a big difference between informing and advertising. Informing is neutrally stating that something exists and requiring no action, while advertising is a special communication form with intent to cause certain action from readers. For example, click here, click there, order this, buy that. 
::::There is no such intention, form, or terms on my info page. Just neutral information. I don't hide and I am not ashamed that I am write and author, and that is a part of the usual bio, including works. I checked your user page: &quot;I graduated from the Czech University of Life Sciences in Prague and studied information science at the Faculty of Arts of Charles University.&quot; I think that if you had written a book on Life Science, you would have mentioned that as well.
::::Most of the Info page is about my research and AIPA Method which is a valid contribution to psychology, consciousness studies, identity theory, and personality development. Actually, my paper '''AIPA Method: A Cognitive-Phenomenological Model for Identity Reconstruction and Stabilization in Pure Awareness''' is now in the peer review procedure at Journal of Consciousness Studies. 
::::Here is a part from the Wikiversity AIPA Method page in creation (waiting for the end of the time limit for new users):    [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:47, 2 April 2026 (UTC)
:::::For the unknown reasons, the form didn't publish my second part of the message: 
:::::I believe this is a valid contribution to Wikiversity. 
:::::Best Regards, 
:::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:52, 2 April 2026 (UTC)
::::::And the third try: 
:::::: == Introduction ==
::::::The AIPA Method addresses a gap in contemporary personal development and consciousness science: most evidence‑based approaches (CBT, MBSR, MBCT, standard meditation) operate at the level of mental content—reframing thoughts, observing them, or reducing their impact—rather than at the level of identity structure. In contrast, AIPA targets the structural relationship between the self and the mind, aiming at durable identity reconstruction rooted in Pure Awareness rather than symptom management.
::::::The central research question of the primary AIPA preprint is whether a structured, sequentially staged method can produce permanent identity reconstruction rooted in Pure Awareness, and how such a method compares to established approaches in scope, mechanism, and outcome.
:::::: == Theoretical foundations ==
::::::The AIPA framework is grounded in the cognitive‑phenomenological tradition (e.g., McAdams, Varela, Metzinger, Erikson), contemporary consciousness science on minimal phenomenal experience, and qualitative methods advocacy in psychology. It builds directly on:
::::::* Empirical work on pure awareness and Minimal Phenomenal Experience (MPE), especially Gamma &amp; Metzinger’s large‑scale study of content‑reduced awareness states.
::::::* Metzinger’s proposal of minimal phenomenal experience as an entry point for a minimal unifying model of consciousness.
::::::* Narrative identity and partial‑self models within personality and identity theory.
::::::Within this backdrop, AIPA proposes Pure Awareness as a distinct, operationally specified state that can become a structural ground of identity rather than a transient meditative experience.
:::::: == Experiential empiricism ==
::::::The empirical foundation of the AIPA Method is explicitly first‑person and experiential, combining:
::::::* A 22‑year longitudinal autoethnographic self‑study (2003–2025) documenting partial personality episodes, protocol use, and outcomes.
::::::* A 13‑year prospective verification period with zero self‑reported recurrence of targeted harmful behaviors after a dated stabilization point (1 January 2006).
::::::* A high‑ecological‑validity “stress test” during acute bereavement, used to examine whether non‑reactive awareness remains stable under maximal provocation.
::::::* Two independent practitioner cases (an Amazon‑verified report and a structured questionnaire case) providing preliminary convergent signals across cognitive, emotional, behavioral, and identity dimensions.
::::::All central constructs (Pure Awareness, partial personalities, the Switch, identity stabilization) are operationalized with explicit phenomenological and behavioral criteria intended to enable replication and future third‑person measurement.
::::::I believe this is a valid contribution to Wikiversity. 
::::::Best regards, 
::::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:54, 2 April 2026 (UTC)

== Unable to publish pages  ==

Whenever I try to publish a page with linked sources it gets flagged and says I'm a new user attempting to publish content with outside links. Those outside links are my sources. [[User:Soboyed|Soboyed]] ([[User talk:Soboyed|discuss]] • [[Special:Contributions/Soboyed|contribs]]) 04:52, 2 April 2026 (UTC)

:This restriction is automatically lifted after you have edited for a certain time (I don't recall that time off-hand, but it is not long). This is designed to stop spam. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 04:53, 2 April 2026 (UTC)

== Showing error to publish a Post ==

My  action was constructive, not destructive, please allow to publish it. [[Special:Contributions/&amp;#126;2026-20906-18|&amp;#126;2026-20906-18]] ([[User talk:&amp;#126;2026-20906-18|talk]]) 08:06, 4 April 2026 (UTC)

:Maybe you got caught in a filter. Consider [[Special:CreateAccount|creating an account]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:06, 4 April 2026 (UTC)
:Your edits, [https://en.wikiversity.org/w/index.php?title=Special:AbuseLog&amp;wpSearchUser=%7E2026-20906-18 these ones], seems to have tripped a filter when you tried to create a page on [[Create]] which external links. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 23:58, 4 April 2026 (UTC)
:Have you read my [https://en.wikiversity.org/w/index.php?title=Wikiversity:Request_custodian_action&amp;diff=prev&amp;oldid=2802219 previous reply] to you @[[User:~2026-20906-18|~2026-20906-18]]? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:02, 6 April 2026 (UTC)

== Abuse filters which should be deleted ==

Hi, there are some abuse filters which should probably be deleted.
* [[Special:AbuseFilter/1]] (not needed anymore)
* [[Special:AbuseFilter/2]] (no hits since 2018)
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched)
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives)
* [[Special:AbuseFilter/5]] (no hits since 2023)
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore)
* [[Special:AbuseFilter/17]] (no hits since 2022)
* [[Special:AbuseFilter/19]] (no hits since 2019)
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive)
Thanks. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 03:51, 5 April 2026 (UTC)

:Why do these need to be deleted rather than inactivated? Do inactive abuse filters cause a server strain? —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:39, 5 April 2026 (UTC)
:: Deleted filters do not cause strain to the servers. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:28, 5 April 2026 (UTC)
:These sounds like sensible suggestions but, yes, would inactivation perhaps make more sense than deletion for at least some  filters? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:35, 5 April 2026 (UTC)
:I would keep them @[[User:Codename Noreste|Codename Noreste]]. Alternatively, I would turn off the ones that haven't caught anything for a long time, but I would leave them enabled in case they need to be turned on or improved. If someone has already written the code and we don't have hundreds of free man-hours of programmers on Wikiversity, the server load seems secondary to me, and is negligible compared to other things. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:11, 6 April 2026 (UTC)
:: I know how to write abuse filter code and regex, but I would recommend disabling filters that have never caught anything in a long time ''and'' those who made lots of false positives. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:09, 6 April 2026 (UTC)
:::Of course @[[User:Codename Noreste|Codename Noreste]], there are people here today who are capable of changing the code. But the question is what it will be like in a few years, the question is what will happen if those two are busy for a long time, etc. That's why I would leave it so that those who don't know much about code can be inspired by it and will need to do something with it someday - plus, more code for different types of filtering is actually great educational material on how those filters work. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:41, 17 April 2026 (UTC)

Here's the updated list of abuse filters under review with actions I've taken (several disabled, one basic code improvement, and some actions changed) - none have been deleted so they can all be edited and reactivayed - please suggest any further changes:
* [[Special:AbuseFilter/1]] (not needed anymore) - One time account spam bot - 4 hits over 10 years ago - Disabled in 2024 - May be useful in future
* [[Special:AbuseFilter/2]] (no hits since 2018) - Userspace spamming - 778 hits; none since 2018 likely due to global filters - Now disabled
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched) - Specific user page spam - 1,101 hits most recent 7 March 2026 - Still active - Kept enabled
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives) - Questionable Language (profanity) - 6,055 hits including very recently - However it was logging hits without taking any actions - Edited to reduce likelihood of false positives by only applying filter to users with low (&lt; 20) edit count and applied weak actions to tag and warn but not prevent publishing the content
* [[Special:AbuseFilter/5]] (no hits since 2023) - Blocked Solicitation Links - 95 hits; none since 2023 - blocks specific historical spam sites - Non-active - Now disabled
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore) - Not reviewed - They are currently disabled
* [[Special:AbuseFilter/17]] (no hits since 2022) - Fundamental Physics Edits - 347 hits; none since 2022 - Non-active and very specific for a historical issue - Now disabled 
* [[Special:AbuseFilter/19]] (no hits since 2019) - Page Creation - 20 hits; none since 2019 - Retained for historical reference and possible future updates - Now disabled
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive) - Globally Banned Editor (renamed to Low-edit Spam Monitor) - 2,829 hits including very recent - Only applies to users with less than 5 edits and takes no actions / monitoring only - Reviewing the details of the hits I don't see many false positives and have strengthened its actions to add a tag and warning

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:57, 9 April 2026 (UTC)

== Block request ==

Please block ~2026-20985-80/~2026-21079-90/~2026-21223-88. Reason: Vandalism. [[User:Àncilu|Àncilu]] ([[User talk:Àncilu|discuss]] • [[Special:Contributions/Àncilu|contribs]]) 23:24, 5 April 2026 (UTC)

:All edits should be deleted and the first is blocked by Atcovi. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:33, 6 April 2026 (UTC)

== Antispam - Filter 12 ==
{{ping|Codename Noreste}} Thanks for contacting me with a suggested [[Special:AbuseFilter|abuse filter]] for the coupon spam we've been getting. A very much appreciated time saver. Per your suggestion, abuse filter 12 has been reactivated with your updated regex. It should tag and prevent page creation actions for coupon promo etc. Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:33, 15 April 2026 (UTC)
: @[[User:Jtneill|Jtneill]] Please do the following to filter 12:
:# Enable the block action (temporary for unregistered users, indefinite for registered users)
:# Disable both the disallow and tag actions, since that filter will be set to block
: Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:42, 5 May 2026 (UTC)
::Excellent. Done:
::* Block duration for non-registered users = 1 week
::* Block duration for registered users = indefinite
::* Disallow and tagging disabled
::Thankyou. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:24, 9 May 2026 (UTC)

== Urgent! error message This action has been automatically identified as potentially harmful, and therefore disallowed ==

While submitting the post this error was coming &quot;This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please inform an administrator of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link&quot; How to resolve it?

Here is the content:

{{note|marketing material removed}}

[[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:14, 17 April 2026 (UTC)
: That's because Wikiversity doesn't accept advertising. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 05:20, 17 April 2026 (UTC)
::So this is fine
::'''Online Internship and Digital Learning for Students'''
::Online learning has become an important part of modern education. With the help of the internet and digital tools, students can now study, practice, and gain experience without being physically present in a classroom. One key part of this system is the online internship, which helps students learn real-world skills along with their studies.
::An online internship allows students to work on tasks and projects through digital platforms. This makes learning more practical and useful, especially for those who want to understand how real work environments function.
::'''Background'''
::The concept of online learning developed from distance education, where students learned from remote locations. Over time, with the growth of digital technology, learning has become more interactive and flexible.
::The introduction of the online internship has added another important layer to digital education. It combines theoretical learning with practical experience, helping students prepare for future careers.
::During global events such as the COVID-19 pandemic, online education and online internship programs became essential. They helped students continue learning and gaining experience despite restrictions on physical movement.
::'''Importance of Online Internship'''
::An online internship plays an important role in student development. It helps bridge the gap between academic knowledge and practical skills.
::'''Some key points include:'''
::Students understand how real work is done
::They develop basic professional skills
::It supports career readiness
::It allows learning without location limits
::By participating in an online internship, students can improve their confidence and gain early exposure to different fields.
::'''Features of Online Internship-Based Learning'''
::Modern education platforms often include online internship opportunities as part of their learning system. These usually offer:
::Flexible schedules for students
::Access to learning from home
::Beginner-friendly tasks and projects
::A combination of theory and practice
::Such features make online internship programs suitable for a wide range of learners, including beginners.
::'''Learning Tasks'''
::Explore how online internship programs support student learning in digital environments.
::Identify how students can gain practical experience through an online internship
::Analyze the role of flexible learning in improving student engagement
::Understand how online education and internships work together
::'''References'''
::[https://ijpsl.in/wp-content/uploads/2020/09/E-Learning_Hanaaya-Navaneeth.pdf The Past, Present and Future of E-Learning: Hanaaya Varyani and Navaneeth M S]
::[https://ieeexplore.ieee.org/document/9788102 Current Trends and Future Perspectives of e-Learning in India]
::'''See Also'''
::[https://easyshiksha.com/online_courses/internship Online Internship]
::[https://easyshiksha.com/online_courses/ Online Courses]
::[https://easyshiksha.com/online_courses/kids-learning Kids Learning]
::[https://easyshiksha.com/career_helper/ Career Guidance] [[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:27, 17 April 2026 (UTC)
:::@[[User:EasyshikshaMarketing|EasyshikshaMarketing]] Wikiversity is a resource for education, or a space for education. However, your intention to link to another website is obvious, and such content does not belong here, as it contradicts the purpose of Wikiversity. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:38, 17 April 2026 (UTC)

==AI-generated images==
Seeking your advice.

Myself and students use some AI-generated images in the [[Motivation and emotion]] project.

[[User:Dronebogus]] has been removing some of these images from Wikiversity pages and nominating them for deletion at Commons. As a result, some have been deleted and some have been kept.

Dronebogus has made some useful edits and image suggestions for [[Motivation and emotion]] which I've appreciated and  incorporated. However, there are other edits to remove an AI image by Dronebogus that I've reverted where I think the image is more educational than no image or an alternative image suggested by Dronebogus.

There are a couple of pages where Dronebogus has reverted my reversion, so we are at risk of edit warring. We have briefly discussed and warned each other on our user talk pages, but it seems to come down to a difference in perception about the educational usefulness of the AI images.

So, I'm asking here for others to please review the recent edit histories for these pages:
* [[Motivation and emotion/Lectures/Brain and physiological needs]]
* [[Motivation and emotion/Book/2025/Stockholm syndrome emotion]]

and let us know what you think about the AI image suitability vs. using no image or alternative images suggested by Dronebogus.

Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:45, 26 April 2026 (UTC)

:I think Jtneill needs to try harder to find non-AI alternatives both on Commons and the web. I’m not reiterating the well known problems with generative AI— you can read about those on Wikipedia and the broader Internet. Needless to say it’s kind of just inherently toxic. If you use it, it should be the last resort of last resorts. Just my stance, which I consider perfectly valid and reasonable. [[User:Dronebogus|Dronebogus]] ([[User talk:Dronebogus|discuss]] • [[Special:Contributions/Dronebogus|contribs]]) 04:10, 27 April 2026 (UTC)

== Request for Page Creation Approval - Research on Dr. Ian Stevenson ==


'''Hello Administrators,'''

I am a digital archivist and researcher attempting to create an educational page regarding Dr. Ian Stevenson's scientific work, specifically titled &quot;Where Reincarnation and Biology Intersect&quot; and its official Vietnamese edition.

My edits are purely constructive, aimed at integrating local research context with global structured data (including '''Wikidata Q139548587'''). The automated filter is currently preventing publication due to &quot;new user external link limits.&quot;

I have ensured that all citations, references, and images (sourced from Wikimedia Commons) are strictly academic and non-promotional. Could you please review my contributions and consider whitelisting my account or approving this specific page creation?

Thank you for your assistance in preserving this research '''legacy''' within the open knowledge ecosystem.

'''Best regards,''' [[User:Ian Stevenson777|Ian Stevenson777]] ([[User talk:Ian Stevenson777|discuss]] • [[Special:Contributions/Ian Stevenson777|contribs]]) 07:26, 28 April 2026 (UTC)
: The page title should probably be in English, as this is English Wikiversity. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:19, 28 April 2026 (UTC)
:@[[User:Ian Stevenson777|Ian Stevenson777]] I looked at the text and it seems to me that it is informative, but the user cannot learn anything from it because they would have to buy the book. In this regard, it seems to me that it is enough [[:w:Where Reincarnation and Biology Intersect|to have that article on Wikipedia]] and there is no need to duplicate it here on Wikiversity. If you are particularly interested with its Vietnamese translation, I would focus on Vietnamese Wikipedia, but it seems to me, that the article there [https://vi.wikipedia.org/w/index.php?title=N%C6%A1i_lu%C3%A2n_h%E1%BB%93i_v%C3%A0_sinh_h%E1%BB%8Dc_giao_nhau&amp;oldid=75029095 have some problems at the moment]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:51, 5 May 2026 (UTC)
:This request is AI-generated and was made by a lock evading LTA. Please ignore it. [[User:NguoiDungKhongDinhDanh|NguoiDungKhongDinhDanh]] ([[User talk:NguoiDungKhongDinhDanh|discuss]] • [[Special:Contributions/NguoiDungKhongDinhDanh|contribs]]) 23:58, 13 May 2026 (UTC)

== Call for custodians and bureaucrats ==
&lt;div class=&quot;cd-moveMark&quot;&gt;''Moved to [[Wikiversity:Notices for custodians#Call for custodians and bureaucrats]].  [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 18:46, 12 May 2026 (UTC)''&lt;/div&gt;</text>
      <sha1>b21ihwg9fi83eic3m5h3thxo8k7s0sq</sha1>
    </revision>
    <revision>
      <id>2809725</id>
      <parentid>2809723</parentid>
      <timestamp>2026-05-16T19:26:21Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Interface administrator flag request */ archive from [[Wikiversity:Request custodian action]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809725</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="39880" sha1="bzxsmv098nrl2hdh04cr3496meqwjoc" xml:space="preserve">{{Archive|Wikiversity:Request custodian action}}

== Sidewide count.js ==

i would like something like: [[Template:User contrib count/count.js]]. i created [[Template:User contrib count]] and a user/common.js. {{User contrib count}}.&lt;br&gt;&lt;br&gt; so a &quot;count.js&quot; would complete it. See [[User:Harold Foppele/common.js]].
If an Administrator could help please. Cheers [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 19:22, 18 January 2026 (UTC)

== need to add my profile ==

im trying to add new profile content  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:03, 4 February 2026 (UTC)

:You can edit it now. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:05, 4 February 2026 (UTC)
::where can create a new one [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)
:::i have created and its in sandbox. i would like to know when it will be approved  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 19:38, 4 February 2026 (UTC)
::::Please don’t create [[wv:spam|spam]] pages as it will be deleted. Please also read [[WV:Scope]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 04:01, 5 February 2026 (UTC)

== Im trying to add new profile while add content its shows not alowed ==

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Exceeded New Page Limit

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)

== New User: cannot create talk page ==

Hi, I am a new user of Wikiversity and I wanted to create a talk page for the article [[ChatGPT's Essay on Kohlberg's Theory: AI's Use in Academic Writing]]. As a new user, I was barred from performing this action. The text that I wanted to add to the talk page is:

&lt;blockquote&gt;
I have doubts as to to the reliability of this essay. Take for rexample the sentence:

&lt;blockquote&gt;
Due to its efficiency, AI has saved 380,000-403,000 lives per year in European healthcare as reported in a recent Deloitte and MedTech Europe report&lt;ref&gt;Dantas, C., Mackiewicz, K., Tageo, V., Jacucci, G., Guardado, D., Ortet, S., Varlamis, I., Maniadakis, M., De Lera, E., Quintas, J., Kocsis, O., &amp; Vassiliou, C. (2021). Benefits and hurdles of AI in the workplace – what comes next? ''International Journal of Artificial Intelligence and Expert Systems, 10'', 9-17. https://www.researchgate.net/publication/351993615_Benefits_and_Hurdles_of_AI_In_The_Workplace_-What_Comes_Next&lt;/ref&gt;.
&lt;/blockquote&gt;

Reading the reference (freely available on ResearchGate), one notes:

# that the reference is from 2021 (predating the widespread use of LLMs such as ChatGPT and the associated 'AI' boom), and
# that the reference factually contradicts this essay.

Quoting from the reference:

&lt;blockquote&gt;
There are enormous benefits of applying AI-based solutions to monitor workers’ health and prevent accidents or, currently, COVID-19 infections, and those benefits are reported with enormous potential. According to the recent Deloitte and MedTech Europe report [11], implementing AI in European healthcare systems could save up 380,000 to 403,000 lives annually or €170.9 to 212.4 billion per year.
&lt;/blockquote&gt;

Not that the reference says ''could save'', not ''saves'' as in the essay.

This calls into question the reliability of the essay.

&lt;/blockquote&gt;

Could an administrator make this addition for me? Thank you! 
{{reflist}}
[[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 06:53, 5 February 2026 (UTC)

:@[[User:Æolus|Æolus]] I have added it for you, you can change the header and sign it now. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 08:05, 5 February 2026 (UTC)
::Thank you! [[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 12:43, 5 February 2026 (UTC)

== Disallowed to add a page on a course ==

I'm trying to populate a newly created course on Wikiversity, but it blocks me from creating more pages with &quot;New User Exceeded New Page Limit&quot;. Could this be lifted please? [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 13:21, 15 February 2026 (UTC)

:Sorry! Never mind. I was trying to create a new article instead of a new page. All good now. [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 14:03, 15 February 2026 (UTC)

== Harold Foppele adding LLM-generated nonsense and personal fiction ==

I became aware of [[User:Harold Foppele]]'s editing after I deleted some of his uploads on Commons. He appears to be adding a large amount of text and images that are some combination of personal fiction and LLM-generated nonsense. This includes:
*[[Quantum Ultra fast lasers#Future thought experiment|Personal speculative fiction]] in an otherwise &quot;nonfiction&quot; article
*Uploading nonsense LLM-created [[:File:Rontosecond pulse laser (Schematic).jpg|diagrams]] and [[:File:Rontosecond pulse laser (Futuristic).jpg|renders]] for nonexistent lab equipment, with fake source (on Commons, he indicated these files as having been created by him using an LLM)
*Uploading nonsense LLM-created images of equations with obvious artifacts. These images, such as [[:File:Redfield equation (non-Markovian).png]] and [[:File:Lindblad equation (Markovian).png]], don't even match the text he puts them with.
Much of his writing is also of extremely poor quality, to the point where it's not clear whether it's written by him or an LLM. I'm not an active editor on this project, so I'm not as familiar with the standards here, but I believe this is worth custodian attention. [[User:Pi.1415926535|Pi.1415926535]] ([[User talk:Pi.1415926535|discuss]] • [[Special:Contributions/Pi.1415926535|contribs]]) 03:06, 23 February 2026 (UTC)

:Fake source ''and'' contradictory copyright info, claiming both public domain and CC license. Moreover, if they are indeed nearly-direct LLM output, depending on jurisdiction they may not even be eligible for copyright.
:I've put speedy deletion marks for the equations, because they're obviously not coherent mathematical equations (the parentheses don't match, the symbols merge into each other the way text in image models often do, etc) [[User:Sesquilinear|Sesquilinear]] ([[User talk:Sesquilinear|discuss]] • [[Special:Contributions/Sesquilinear|contribs]]) 21:50, 7 March 2026 (UTC)

== Repeated removal of RFD notices by Harold Foppele ==

{{User|Harold Foppele }}

This editor is appearing in multiple noticeboards for behaviour which is contentious. Ther latest adventure is the repeated removal of tye RFD notice at [[Quantum/Henry C. Kapteyn]]. You will see from their contributions record the number of times. I have warned Tham on their user tag page that this is tantaomunt to volunteering to be blocked here. They have a track record of achieving blocks on enWiki and Commons already.

They have all the appearance of shooting not to understand when given direct information about their behaviour, whichever project they are editing, and are fast becoming a time sink. Their behaviour across multiple WMF sites may well lead to a Global Lock, but I do not believe they have quite reached the threshold for that.

I believe that what is required is a preventative block to seek to ensure thatchy understand the seriousness of their behaviour, and the need to be collegial. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 23:03, 4 March 2026 (UTC)
: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:45, 8 March 2026 (UTC)

== Blocks for sockpuppet ==

Please block [[User:Harold Foppele]] and [[User:Johnwilliamsiii]] for sockpuppetry based on [https://en.wikipedia.org/wiki/Wikipedia:Sockpuppet_investigations/Harold_Foppele en wiki] CU and [https://commons.wikimedia.org/w/index.php?diff=1177465640 commons] CU investigations. The user has also violated copyright, see the above discussion. A block is necessary to prevent further abuse. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:30, 8 March 2026 (UTC)

:&lt;small&gt;@[[User:MathXplore|MathXplore]]&lt;/small&gt; [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:31, 8 March 2026 (UTC)
:: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:44, 8 March 2026 (UTC)
:CC. @[[User:Timtrent|Timtrent]], @[[User:Sesquilinear|Sesquilinear]], @[[User:Pi.1415926535|Pi.1415926535]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:33, 8 March 2026 (UTC)
::Thank you for the ping. I concur based on [[w:en:WP:DUCK|behaviour]]. CUs appear divided. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 11:41, 8 March 2026 (UTC)

== Problem when trying to start a discussion with authors of the Plurilingual education portal ==

The authors I wanted to discuss with are called &quot;Project PEP&quot; and my name is Franch Chandler. How can I be allowed to do so ? [[User:French Chandler|French Chandler]] ([[User talk:French Chandler|discuss]] • [[Special:Contributions/French Chandler|contribs]]) 18:25, 16 March 2026 (UTC)

:@[[User:French Chandler|French Chandler]] place your qestion [https://en.wikiversity.org/w/index.php?title=User_talk:Projet_PEP&amp;action=edit into the dialog box] on this link and hit Publish page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:22, 16 March 2026 (UTC)

== Please publish my post ==

My post is about &quot;Every child grows and develops at their own pace, but some may experience challenges that affect their ability to perform everyday tasks. These challenges can include difficulties with fine motor skills, sensory processing, handwriting, feeding, and self-regulation. When these issues are not addressed early, they can impact a child’s confidence, academic performance, and independence.

With the rise of digital healthcare services, '''online physical therapy''' has emerged as a powerful and accessible solution for parents seeking support for their children. This modern approach provides structured, personalized therapy programs that can be accessed from the comfort of home, making it easier for families to ensure consistent care.&quot; [[User:Skyabovetherapy|Skyabovetherapy]] ([[User talk:Skyabovetherapy|discuss]] • [[Special:Contributions/Skyabovetherapy|contribs]]) 12:28, 28 March 2026 (UTC)

:@[[User:Skyabovetherapy|Skyabovetherapy]] Well, you can publish it yourself, Wikiversity is a free environement, where everybody can create educational resources. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 14:11, 29 March 2026 (UTC)
::They actually triggered some abuse filters. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 16:24, 29 March 2026 (UTC)
:I looked at your attempts to add this text and I see a link to one website repeated many times, which reminds me of the misuse of Wikiversity for self-promotion or to increase the importance of the website. It is necessary to remind you here that Wikiversity is not a place for promotion, but a place for education. So if you want to educate, it will not be a problem to create the page without external links with a clearly defined procedure for how people should use it and what to expect from it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:07, 1 April 2026 (UTC)

== New user limit ==

Hi, I am creating an AIPA Method learning resource page. 

I am the author of the linked research, and I hit the “new user limit” and “new page with external link” filters while publishing. 

Here is the link to the page in creation: [https://en.wikiversity.org/w/index.php?title=AIPA_Method&amp;veaction=edit] 

Thank you for your help. 

Best regards, 

Senad Dizdarević [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:19, 30 March 2026 (UTC)

:@[[User:Senad Dizdarević|Senad Dizdarević]] I should admit I dont know, what is &quot;new user limit&quot;, but if filter blocks your page because of certain external link, you may force to save anyway and sometimes it works. It should not work, when the website is blacklisted. As of now, I am not seeing you to save page in main namespace, so try to save it without external links first. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:30, 30 March 2026 (UTC)
::Thank you, you are very kind. 
::I will wait a day, and try again (without links, too). 
::Today, I already created About Me info page, and maybe that is enough for the filters for one day.  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:53, 30 March 2026 (UTC)
:::Well, I have analyzed your contribution to Wikiversity and I should point out here, that this project is not a place for advertising, so there is no way of promoting your books and authority this way. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:56, 1 April 2026 (UTC)
::::Hi, my About Me page is just an info page with the neutral as possible presentation of my work. 
::::There is a big difference between informing and advertising. Informing is neutrally stating that something exists and requiring no action, while advertising is a special communication form with intent to cause certain action from readers. For example, click here, click there, order this, buy that. 
::::There is no such intention, form, or terms on my info page. Just neutral information. I don't hide and I am not ashamed that I am write and author, and that is a part of the usual bio, including works. I checked your user page: &quot;I graduated from the Czech University of Life Sciences in Prague and studied information science at the Faculty of Arts of Charles University.&quot; I think that if you had written a book on Life Science, you would have mentioned that as well.
::::Most of the Info page is about my research and AIPA Method which is a valid contribution to psychology, consciousness studies, identity theory, and personality development. Actually, my paper '''AIPA Method: A Cognitive-Phenomenological Model for Identity Reconstruction and Stabilization in Pure Awareness''' is now in the peer review procedure at Journal of Consciousness Studies. 
::::Here is a part from the Wikiversity AIPA Method page in creation (waiting for the end of the time limit for new users):    [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:47, 2 April 2026 (UTC)
:::::For the unknown reasons, the form didn't publish my second part of the message: 
:::::I believe this is a valid contribution to Wikiversity. 
:::::Best Regards, 
:::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:52, 2 April 2026 (UTC)
::::::And the third try: 
:::::: == Introduction ==
::::::The AIPA Method addresses a gap in contemporary personal development and consciousness science: most evidence‑based approaches (CBT, MBSR, MBCT, standard meditation) operate at the level of mental content—reframing thoughts, observing them, or reducing their impact—rather than at the level of identity structure. In contrast, AIPA targets the structural relationship between the self and the mind, aiming at durable identity reconstruction rooted in Pure Awareness rather than symptom management.
::::::The central research question of the primary AIPA preprint is whether a structured, sequentially staged method can produce permanent identity reconstruction rooted in Pure Awareness, and how such a method compares to established approaches in scope, mechanism, and outcome.
:::::: == Theoretical foundations ==
::::::The AIPA framework is grounded in the cognitive‑phenomenological tradition (e.g., McAdams, Varela, Metzinger, Erikson), contemporary consciousness science on minimal phenomenal experience, and qualitative methods advocacy in psychology. It builds directly on:
::::::* Empirical work on pure awareness and Minimal Phenomenal Experience (MPE), especially Gamma &amp; Metzinger’s large‑scale study of content‑reduced awareness states.
::::::* Metzinger’s proposal of minimal phenomenal experience as an entry point for a minimal unifying model of consciousness.
::::::* Narrative identity and partial‑self models within personality and identity theory.
::::::Within this backdrop, AIPA proposes Pure Awareness as a distinct, operationally specified state that can become a structural ground of identity rather than a transient meditative experience.
:::::: == Experiential empiricism ==
::::::The empirical foundation of the AIPA Method is explicitly first‑person and experiential, combining:
::::::* A 22‑year longitudinal autoethnographic self‑study (2003–2025) documenting partial personality episodes, protocol use, and outcomes.
::::::* A 13‑year prospective verification period with zero self‑reported recurrence of targeted harmful behaviors after a dated stabilization point (1 January 2006).
::::::* A high‑ecological‑validity “stress test” during acute bereavement, used to examine whether non‑reactive awareness remains stable under maximal provocation.
::::::* Two independent practitioner cases (an Amazon‑verified report and a structured questionnaire case) providing preliminary convergent signals across cognitive, emotional, behavioral, and identity dimensions.
::::::All central constructs (Pure Awareness, partial personalities, the Switch, identity stabilization) are operationalized with explicit phenomenological and behavioral criteria intended to enable replication and future third‑person measurement.
::::::I believe this is a valid contribution to Wikiversity. 
::::::Best regards, 
::::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:54, 2 April 2026 (UTC)

== Unable to publish pages  ==

Whenever I try to publish a page with linked sources it gets flagged and says I'm a new user attempting to publish content with outside links. Those outside links are my sources. [[User:Soboyed|Soboyed]] ([[User talk:Soboyed|discuss]] • [[Special:Contributions/Soboyed|contribs]]) 04:52, 2 April 2026 (UTC)

:This restriction is automatically lifted after you have edited for a certain time (I don't recall that time off-hand, but it is not long). This is designed to stop spam. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 04:53, 2 April 2026 (UTC)

== Showing error to publish a Post ==

My  action was constructive, not destructive, please allow to publish it. [[Special:Contributions/&amp;#126;2026-20906-18|&amp;#126;2026-20906-18]] ([[User talk:&amp;#126;2026-20906-18|talk]]) 08:06, 4 April 2026 (UTC)

:Maybe you got caught in a filter. Consider [[Special:CreateAccount|creating an account]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:06, 4 April 2026 (UTC)
:Your edits, [https://en.wikiversity.org/w/index.php?title=Special:AbuseLog&amp;wpSearchUser=%7E2026-20906-18 these ones], seems to have tripped a filter when you tried to create a page on [[Create]] which external links. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 23:58, 4 April 2026 (UTC)
:Have you read my [https://en.wikiversity.org/w/index.php?title=Wikiversity:Request_custodian_action&amp;diff=prev&amp;oldid=2802219 previous reply] to you @[[User:~2026-20906-18|~2026-20906-18]]? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:02, 6 April 2026 (UTC)

== Abuse filters which should be deleted ==

Hi, there are some abuse filters which should probably be deleted.
* [[Special:AbuseFilter/1]] (not needed anymore)
* [[Special:AbuseFilter/2]] (no hits since 2018)
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched)
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives)
* [[Special:AbuseFilter/5]] (no hits since 2023)
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore)
* [[Special:AbuseFilter/17]] (no hits since 2022)
* [[Special:AbuseFilter/19]] (no hits since 2019)
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive)
Thanks. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 03:51, 5 April 2026 (UTC)

:Why do these need to be deleted rather than inactivated? Do inactive abuse filters cause a server strain? —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:39, 5 April 2026 (UTC)
:: Deleted filters do not cause strain to the servers. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:28, 5 April 2026 (UTC)
:These sounds like sensible suggestions but, yes, would inactivation perhaps make more sense than deletion for at least some  filters? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:35, 5 April 2026 (UTC)
:I would keep them @[[User:Codename Noreste|Codename Noreste]]. Alternatively, I would turn off the ones that haven't caught anything for a long time, but I would leave them enabled in case they need to be turned on or improved. If someone has already written the code and we don't have hundreds of free man-hours of programmers on Wikiversity, the server load seems secondary to me, and is negligible compared to other things. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:11, 6 April 2026 (UTC)
:: I know how to write abuse filter code and regex, but I would recommend disabling filters that have never caught anything in a long time ''and'' those who made lots of false positives. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:09, 6 April 2026 (UTC)
:::Of course @[[User:Codename Noreste|Codename Noreste]], there are people here today who are capable of changing the code. But the question is what it will be like in a few years, the question is what will happen if those two are busy for a long time, etc. That's why I would leave it so that those who don't know much about code can be inspired by it and will need to do something with it someday - plus, more code for different types of filtering is actually great educational material on how those filters work. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:41, 17 April 2026 (UTC)

Here's the updated list of abuse filters under review with actions I've taken (several disabled, one basic code improvement, and some actions changed) - none have been deleted so they can all be edited and reactivayed - please suggest any further changes:
* [[Special:AbuseFilter/1]] (not needed anymore) - One time account spam bot - 4 hits over 10 years ago - Disabled in 2024 - May be useful in future
* [[Special:AbuseFilter/2]] (no hits since 2018) - Userspace spamming - 778 hits; none since 2018 likely due to global filters - Now disabled
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched) - Specific user page spam - 1,101 hits most recent 7 March 2026 - Still active - Kept enabled
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives) - Questionable Language (profanity) - 6,055 hits including very recently - However it was logging hits without taking any actions - Edited to reduce likelihood of false positives by only applying filter to users with low (&lt; 20) edit count and applied weak actions to tag and warn but not prevent publishing the content
* [[Special:AbuseFilter/5]] (no hits since 2023) - Blocked Solicitation Links - 95 hits; none since 2023 - blocks specific historical spam sites - Non-active - Now disabled
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore) - Not reviewed - They are currently disabled
* [[Special:AbuseFilter/17]] (no hits since 2022) - Fundamental Physics Edits - 347 hits; none since 2022 - Non-active and very specific for a historical issue - Now disabled 
* [[Special:AbuseFilter/19]] (no hits since 2019) - Page Creation - 20 hits; none since 2019 - Retained for historical reference and possible future updates - Now disabled
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive) - Globally Banned Editor (renamed to Low-edit Spam Monitor) - 2,829 hits including very recent - Only applies to users with less than 5 edits and takes no actions / monitoring only - Reviewing the details of the hits I don't see many false positives and have strengthened its actions to add a tag and warning

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:57, 9 April 2026 (UTC)

== Block request ==

Please block ~2026-20985-80/~2026-21079-90/~2026-21223-88. Reason: Vandalism. [[User:Àncilu|Àncilu]] ([[User talk:Àncilu|discuss]] • [[Special:Contributions/Àncilu|contribs]]) 23:24, 5 April 2026 (UTC)

:All edits should be deleted and the first is blocked by Atcovi. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:33, 6 April 2026 (UTC)

== Antispam - Filter 12 ==
{{ping|Codename Noreste}} Thanks for contacting me with a suggested [[Special:AbuseFilter|abuse filter]] for the coupon spam we've been getting. A very much appreciated time saver. Per your suggestion, abuse filter 12 has been reactivated with your updated regex. It should tag and prevent page creation actions for coupon promo etc. Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:33, 15 April 2026 (UTC)
: @[[User:Jtneill|Jtneill]] Please do the following to filter 12:
:# Enable the block action (temporary for unregistered users, indefinite for registered users)
:# Disable both the disallow and tag actions, since that filter will be set to block
: Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:42, 5 May 2026 (UTC)
::Excellent. Done:
::* Block duration for non-registered users = 1 week
::* Block duration for registered users = indefinite
::* Disallow and tagging disabled
::Thankyou. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:24, 9 May 2026 (UTC)

== Urgent! error message This action has been automatically identified as potentially harmful, and therefore disallowed ==

While submitting the post this error was coming &quot;This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please inform an administrator of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link&quot; How to resolve it?

Here is the content:

{{note|marketing material removed}}

[[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:14, 17 April 2026 (UTC)
: That's because Wikiversity doesn't accept advertising. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 05:20, 17 April 2026 (UTC)
::So this is fine
::'''Online Internship and Digital Learning for Students'''
::Online learning has become an important part of modern education. With the help of the internet and digital tools, students can now study, practice, and gain experience without being physically present in a classroom. One key part of this system is the online internship, which helps students learn real-world skills along with their studies.
::An online internship allows students to work on tasks and projects through digital platforms. This makes learning more practical and useful, especially for those who want to understand how real work environments function.
::'''Background'''
::The concept of online learning developed from distance education, where students learned from remote locations. Over time, with the growth of digital technology, learning has become more interactive and flexible.
::The introduction of the online internship has added another important layer to digital education. It combines theoretical learning with practical experience, helping students prepare for future careers.
::During global events such as the COVID-19 pandemic, online education and online internship programs became essential. They helped students continue learning and gaining experience despite restrictions on physical movement.
::'''Importance of Online Internship'''
::An online internship plays an important role in student development. It helps bridge the gap between academic knowledge and practical skills.
::'''Some key points include:'''
::Students understand how real work is done
::They develop basic professional skills
::It supports career readiness
::It allows learning without location limits
::By participating in an online internship, students can improve their confidence and gain early exposure to different fields.
::'''Features of Online Internship-Based Learning'''
::Modern education platforms often include online internship opportunities as part of their learning system. These usually offer:
::Flexible schedules for students
::Access to learning from home
::Beginner-friendly tasks and projects
::A combination of theory and practice
::Such features make online internship programs suitable for a wide range of learners, including beginners.
::'''Learning Tasks'''
::Explore how online internship programs support student learning in digital environments.
::Identify how students can gain practical experience through an online internship
::Analyze the role of flexible learning in improving student engagement
::Understand how online education and internships work together
::'''References'''
::[https://ijpsl.in/wp-content/uploads/2020/09/E-Learning_Hanaaya-Navaneeth.pdf The Past, Present and Future of E-Learning: Hanaaya Varyani and Navaneeth M S]
::[https://ieeexplore.ieee.org/document/9788102 Current Trends and Future Perspectives of e-Learning in India]
::'''See Also'''
::[https://easyshiksha.com/online_courses/internship Online Internship]
::[https://easyshiksha.com/online_courses/ Online Courses]
::[https://easyshiksha.com/online_courses/kids-learning Kids Learning]
::[https://easyshiksha.com/career_helper/ Career Guidance] [[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:27, 17 April 2026 (UTC)
:::@[[User:EasyshikshaMarketing|EasyshikshaMarketing]] Wikiversity is a resource for education, or a space for education. However, your intention to link to another website is obvious, and such content does not belong here, as it contradicts the purpose of Wikiversity. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:38, 17 April 2026 (UTC)

==AI-generated images==
Seeking your advice.

Myself and students use some AI-generated images in the [[Motivation and emotion]] project.

[[User:Dronebogus]] has been removing some of these images from Wikiversity pages and nominating them for deletion at Commons. As a result, some have been deleted and some have been kept.

Dronebogus has made some useful edits and image suggestions for [[Motivation and emotion]] which I've appreciated and  incorporated. However, there are other edits to remove an AI image by Dronebogus that I've reverted where I think the image is more educational than no image or an alternative image suggested by Dronebogus.

There are a couple of pages where Dronebogus has reverted my reversion, so we are at risk of edit warring. We have briefly discussed and warned each other on our user talk pages, but it seems to come down to a difference in perception about the educational usefulness of the AI images.

So, I'm asking here for others to please review the recent edit histories for these pages:
* [[Motivation and emotion/Lectures/Brain and physiological needs]]
* [[Motivation and emotion/Book/2025/Stockholm syndrome emotion]]

and let us know what you think about the AI image suitability vs. using no image or alternative images suggested by Dronebogus.

Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:45, 26 April 2026 (UTC)

:I think Jtneill needs to try harder to find non-AI alternatives both on Commons and the web. I’m not reiterating the well known problems with generative AI— you can read about those on Wikipedia and the broader Internet. Needless to say it’s kind of just inherently toxic. If you use it, it should be the last resort of last resorts. Just my stance, which I consider perfectly valid and reasonable. [[User:Dronebogus|Dronebogus]] ([[User talk:Dronebogus|discuss]] • [[Special:Contributions/Dronebogus|contribs]]) 04:10, 27 April 2026 (UTC)

== Request for Page Creation Approval - Research on Dr. Ian Stevenson ==


'''Hello Administrators,'''

I am a digital archivist and researcher attempting to create an educational page regarding Dr. Ian Stevenson's scientific work, specifically titled &quot;Where Reincarnation and Biology Intersect&quot; and its official Vietnamese edition.

My edits are purely constructive, aimed at integrating local research context with global structured data (including '''Wikidata Q139548587'''). The automated filter is currently preventing publication due to &quot;new user external link limits.&quot;

I have ensured that all citations, references, and images (sourced from Wikimedia Commons) are strictly academic and non-promotional. Could you please review my contributions and consider whitelisting my account or approving this specific page creation?

Thank you for your assistance in preserving this research '''legacy''' within the open knowledge ecosystem.

'''Best regards,''' [[User:Ian Stevenson777|Ian Stevenson777]] ([[User talk:Ian Stevenson777|discuss]] • [[Special:Contributions/Ian Stevenson777|contribs]]) 07:26, 28 April 2026 (UTC)
: The page title should probably be in English, as this is English Wikiversity. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:19, 28 April 2026 (UTC)
:@[[User:Ian Stevenson777|Ian Stevenson777]] I looked at the text and it seems to me that it is informative, but the user cannot learn anything from it because they would have to buy the book. In this regard, it seems to me that it is enough [[:w:Where Reincarnation and Biology Intersect|to have that article on Wikipedia]] and there is no need to duplicate it here on Wikiversity. If you are particularly interested with its Vietnamese translation, I would focus on Vietnamese Wikipedia, but it seems to me, that the article there [https://vi.wikipedia.org/w/index.php?title=N%C6%A1i_lu%C3%A2n_h%E1%BB%93i_v%C3%A0_sinh_h%E1%BB%8Dc_giao_nhau&amp;oldid=75029095 have some problems at the moment]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:51, 5 May 2026 (UTC)
:This request is AI-generated and was made by a lock evading LTA. Please ignore it. [[User:NguoiDungKhongDinhDanh|NguoiDungKhongDinhDanh]] ([[User talk:NguoiDungKhongDinhDanh|discuss]] • [[Special:Contributions/NguoiDungKhongDinhDanh|contribs]]) 23:58, 13 May 2026 (UTC)

== Call for custodians and bureaucrats ==
&lt;div class=&quot;cd-moveMark&quot;&gt;''Moved to [[Wikiversity:Notices for custodians#Call for custodians and bureaucrats]].  [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 18:46, 12 May 2026 (UTC)''&lt;/div&gt;

== Interface administrator flag request ==

@[[User:Jtneill|Jtneill]], @[[User:Mu301|Mu301]] I am requesting IA flag to delete [[MediaWiki:Gadget-WikiSign.js]]. It was requested for deletion by [[User:Sophivorus|a trusted user]] and I think it can be deleted. Once I delete it, I will notify you and you can remove the flag. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:24, 10 May 2026 (UTC)

:Can you enable two-factor authentication? 
:Policy: [[Wikiversity:Interface administrators]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:27, 10 May 2026 (UTC)
::Done @[[User:Jtneill|Jtneill]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:20, 11 May 2026 (UTC)
:::You are an interface administrator for 24 hours. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:57, 11 May 2026 (UTC)
::::Thx @[[User:Jtneill|Jtneill]], I have just deleted the page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:59, 11 May 2026 (UTC)</text>
      <sha1>bzxsmv098nrl2hdh04cr3496meqwjoc</sha1>
    </revision>
    <revision>
      <id>2809728</id>
      <parentid>2809725</parentid>
      <timestamp>2026-05-16T19:26:57Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* Block request */ archive from [[Wikiversity:Request custodian action]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809728</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="40273" sha1="o6ym5wj3qpi6kp8sl9zgcxhlisu14iz" xml:space="preserve">{{Archive|Wikiversity:Request custodian action}}

== Sidewide count.js ==

i would like something like: [[Template:User contrib count/count.js]]. i created [[Template:User contrib count]] and a user/common.js. {{User contrib count}}.&lt;br&gt;&lt;br&gt; so a &quot;count.js&quot; would complete it. See [[User:Harold Foppele/common.js]].
If an Administrator could help please. Cheers [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 19:22, 18 January 2026 (UTC)

== need to add my profile ==

im trying to add new profile content  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:03, 4 February 2026 (UTC)

:You can edit it now. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:05, 4 February 2026 (UTC)
::where can create a new one [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)
:::i have created and its in sandbox. i would like to know when it will be approved  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 19:38, 4 February 2026 (UTC)
::::Please don’t create [[wv:spam|spam]] pages as it will be deleted. Please also read [[WV:Scope]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 04:01, 5 February 2026 (UTC)

== Im trying to add new profile while add content its shows not alowed ==

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Exceeded New Page Limit

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)

== New User: cannot create talk page ==

Hi, I am a new user of Wikiversity and I wanted to create a talk page for the article [[ChatGPT's Essay on Kohlberg's Theory: AI's Use in Academic Writing]]. As a new user, I was barred from performing this action. The text that I wanted to add to the talk page is:

&lt;blockquote&gt;
I have doubts as to to the reliability of this essay. Take for rexample the sentence:

&lt;blockquote&gt;
Due to its efficiency, AI has saved 380,000-403,000 lives per year in European healthcare as reported in a recent Deloitte and MedTech Europe report&lt;ref&gt;Dantas, C., Mackiewicz, K., Tageo, V., Jacucci, G., Guardado, D., Ortet, S., Varlamis, I., Maniadakis, M., De Lera, E., Quintas, J., Kocsis, O., &amp; Vassiliou, C. (2021). Benefits and hurdles of AI in the workplace – what comes next? ''International Journal of Artificial Intelligence and Expert Systems, 10'', 9-17. https://www.researchgate.net/publication/351993615_Benefits_and_Hurdles_of_AI_In_The_Workplace_-What_Comes_Next&lt;/ref&gt;.
&lt;/blockquote&gt;

Reading the reference (freely available on ResearchGate), one notes:

# that the reference is from 2021 (predating the widespread use of LLMs such as ChatGPT and the associated 'AI' boom), and
# that the reference factually contradicts this essay.

Quoting from the reference:

&lt;blockquote&gt;
There are enormous benefits of applying AI-based solutions to monitor workers’ health and prevent accidents or, currently, COVID-19 infections, and those benefits are reported with enormous potential. According to the recent Deloitte and MedTech Europe report [11], implementing AI in European healthcare systems could save up 380,000 to 403,000 lives annually or €170.9 to 212.4 billion per year.
&lt;/blockquote&gt;

Not that the reference says ''could save'', not ''saves'' as in the essay.

This calls into question the reliability of the essay.

&lt;/blockquote&gt;

Could an administrator make this addition for me? Thank you! 
{{reflist}}
[[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 06:53, 5 February 2026 (UTC)

:@[[User:Æolus|Æolus]] I have added it for you, you can change the header and sign it now. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 08:05, 5 February 2026 (UTC)
::Thank you! [[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 12:43, 5 February 2026 (UTC)

== Disallowed to add a page on a course ==

I'm trying to populate a newly created course on Wikiversity, but it blocks me from creating more pages with &quot;New User Exceeded New Page Limit&quot;. Could this be lifted please? [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 13:21, 15 February 2026 (UTC)

:Sorry! Never mind. I was trying to create a new article instead of a new page. All good now. [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 14:03, 15 February 2026 (UTC)

== Harold Foppele adding LLM-generated nonsense and personal fiction ==

I became aware of [[User:Harold Foppele]]'s editing after I deleted some of his uploads on Commons. He appears to be adding a large amount of text and images that are some combination of personal fiction and LLM-generated nonsense. This includes:
*[[Quantum Ultra fast lasers#Future thought experiment|Personal speculative fiction]] in an otherwise &quot;nonfiction&quot; article
*Uploading nonsense LLM-created [[:File:Rontosecond pulse laser (Schematic).jpg|diagrams]] and [[:File:Rontosecond pulse laser (Futuristic).jpg|renders]] for nonexistent lab equipment, with fake source (on Commons, he indicated these files as having been created by him using an LLM)
*Uploading nonsense LLM-created images of equations with obvious artifacts. These images, such as [[:File:Redfield equation (non-Markovian).png]] and [[:File:Lindblad equation (Markovian).png]], don't even match the text he puts them with.
Much of his writing is also of extremely poor quality, to the point where it's not clear whether it's written by him or an LLM. I'm not an active editor on this project, so I'm not as familiar with the standards here, but I believe this is worth custodian attention. [[User:Pi.1415926535|Pi.1415926535]] ([[User talk:Pi.1415926535|discuss]] • [[Special:Contributions/Pi.1415926535|contribs]]) 03:06, 23 February 2026 (UTC)

:Fake source ''and'' contradictory copyright info, claiming both public domain and CC license. Moreover, if they are indeed nearly-direct LLM output, depending on jurisdiction they may not even be eligible for copyright.
:I've put speedy deletion marks for the equations, because they're obviously not coherent mathematical equations (the parentheses don't match, the symbols merge into each other the way text in image models often do, etc) [[User:Sesquilinear|Sesquilinear]] ([[User talk:Sesquilinear|discuss]] • [[Special:Contributions/Sesquilinear|contribs]]) 21:50, 7 March 2026 (UTC)

== Repeated removal of RFD notices by Harold Foppele ==

{{User|Harold Foppele }}

This editor is appearing in multiple noticeboards for behaviour which is contentious. Ther latest adventure is the repeated removal of tye RFD notice at [[Quantum/Henry C. Kapteyn]]. You will see from their contributions record the number of times. I have warned Tham on their user tag page that this is tantaomunt to volunteering to be blocked here. They have a track record of achieving blocks on enWiki and Commons already.

They have all the appearance of shooting not to understand when given direct information about their behaviour, whichever project they are editing, and are fast becoming a time sink. Their behaviour across multiple WMF sites may well lead to a Global Lock, but I do not believe they have quite reached the threshold for that.

I believe that what is required is a preventative block to seek to ensure thatchy understand the seriousness of their behaviour, and the need to be collegial. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 23:03, 4 March 2026 (UTC)
: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:45, 8 March 2026 (UTC)

== Blocks for sockpuppet ==

Please block [[User:Harold Foppele]] and [[User:Johnwilliamsiii]] for sockpuppetry based on [https://en.wikipedia.org/wiki/Wikipedia:Sockpuppet_investigations/Harold_Foppele en wiki] CU and [https://commons.wikimedia.org/w/index.php?diff=1177465640 commons] CU investigations. The user has also violated copyright, see the above discussion. A block is necessary to prevent further abuse. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:30, 8 March 2026 (UTC)

:&lt;small&gt;@[[User:MathXplore|MathXplore]]&lt;/small&gt; [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:31, 8 March 2026 (UTC)
:: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:44, 8 March 2026 (UTC)
:CC. @[[User:Timtrent|Timtrent]], @[[User:Sesquilinear|Sesquilinear]], @[[User:Pi.1415926535|Pi.1415926535]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:33, 8 March 2026 (UTC)
::Thank you for the ping. I concur based on [[w:en:WP:DUCK|behaviour]]. CUs appear divided. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 11:41, 8 March 2026 (UTC)

== Problem when trying to start a discussion with authors of the Plurilingual education portal ==

The authors I wanted to discuss with are called &quot;Project PEP&quot; and my name is Franch Chandler. How can I be allowed to do so ? [[User:French Chandler|French Chandler]] ([[User talk:French Chandler|discuss]] • [[Special:Contributions/French Chandler|contribs]]) 18:25, 16 March 2026 (UTC)

:@[[User:French Chandler|French Chandler]] place your qestion [https://en.wikiversity.org/w/index.php?title=User_talk:Projet_PEP&amp;action=edit into the dialog box] on this link and hit Publish page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:22, 16 March 2026 (UTC)

== Please publish my post ==

My post is about &quot;Every child grows and develops at their own pace, but some may experience challenges that affect their ability to perform everyday tasks. These challenges can include difficulties with fine motor skills, sensory processing, handwriting, feeding, and self-regulation. When these issues are not addressed early, they can impact a child’s confidence, academic performance, and independence.

With the rise of digital healthcare services, '''online physical therapy''' has emerged as a powerful and accessible solution for parents seeking support for their children. This modern approach provides structured, personalized therapy programs that can be accessed from the comfort of home, making it easier for families to ensure consistent care.&quot; [[User:Skyabovetherapy|Skyabovetherapy]] ([[User talk:Skyabovetherapy|discuss]] • [[Special:Contributions/Skyabovetherapy|contribs]]) 12:28, 28 March 2026 (UTC)

:@[[User:Skyabovetherapy|Skyabovetherapy]] Well, you can publish it yourself, Wikiversity is a free environement, where everybody can create educational resources. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 14:11, 29 March 2026 (UTC)
::They actually triggered some abuse filters. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 16:24, 29 March 2026 (UTC)
:I looked at your attempts to add this text and I see a link to one website repeated many times, which reminds me of the misuse of Wikiversity for self-promotion or to increase the importance of the website. It is necessary to remind you here that Wikiversity is not a place for promotion, but a place for education. So if you want to educate, it will not be a problem to create the page without external links with a clearly defined procedure for how people should use it and what to expect from it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:07, 1 April 2026 (UTC)

== New user limit ==

Hi, I am creating an AIPA Method learning resource page. 

I am the author of the linked research, and I hit the “new user limit” and “new page with external link” filters while publishing. 

Here is the link to the page in creation: [https://en.wikiversity.org/w/index.php?title=AIPA_Method&amp;veaction=edit] 

Thank you for your help. 

Best regards, 

Senad Dizdarević [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:19, 30 March 2026 (UTC)

:@[[User:Senad Dizdarević|Senad Dizdarević]] I should admit I dont know, what is &quot;new user limit&quot;, but if filter blocks your page because of certain external link, you may force to save anyway and sometimes it works. It should not work, when the website is blacklisted. As of now, I am not seeing you to save page in main namespace, so try to save it without external links first. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:30, 30 March 2026 (UTC)
::Thank you, you are very kind. 
::I will wait a day, and try again (without links, too). 
::Today, I already created About Me info page, and maybe that is enough for the filters for one day.  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:53, 30 March 2026 (UTC)
:::Well, I have analyzed your contribution to Wikiversity and I should point out here, that this project is not a place for advertising, so there is no way of promoting your books and authority this way. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:56, 1 April 2026 (UTC)
::::Hi, my About Me page is just an info page with the neutral as possible presentation of my work. 
::::There is a big difference between informing and advertising. Informing is neutrally stating that something exists and requiring no action, while advertising is a special communication form with intent to cause certain action from readers. For example, click here, click there, order this, buy that. 
::::There is no such intention, form, or terms on my info page. Just neutral information. I don't hide and I am not ashamed that I am write and author, and that is a part of the usual bio, including works. I checked your user page: &quot;I graduated from the Czech University of Life Sciences in Prague and studied information science at the Faculty of Arts of Charles University.&quot; I think that if you had written a book on Life Science, you would have mentioned that as well.
::::Most of the Info page is about my research and AIPA Method which is a valid contribution to psychology, consciousness studies, identity theory, and personality development. Actually, my paper '''AIPA Method: A Cognitive-Phenomenological Model for Identity Reconstruction and Stabilization in Pure Awareness''' is now in the peer review procedure at Journal of Consciousness Studies. 
::::Here is a part from the Wikiversity AIPA Method page in creation (waiting for the end of the time limit for new users):    [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:47, 2 April 2026 (UTC)
:::::For the unknown reasons, the form didn't publish my second part of the message: 
:::::I believe this is a valid contribution to Wikiversity. 
:::::Best Regards, 
:::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:52, 2 April 2026 (UTC)
::::::And the third try: 
:::::: == Introduction ==
::::::The AIPA Method addresses a gap in contemporary personal development and consciousness science: most evidence‑based approaches (CBT, MBSR, MBCT, standard meditation) operate at the level of mental content—reframing thoughts, observing them, or reducing their impact—rather than at the level of identity structure. In contrast, AIPA targets the structural relationship between the self and the mind, aiming at durable identity reconstruction rooted in Pure Awareness rather than symptom management.
::::::The central research question of the primary AIPA preprint is whether a structured, sequentially staged method can produce permanent identity reconstruction rooted in Pure Awareness, and how such a method compares to established approaches in scope, mechanism, and outcome.
:::::: == Theoretical foundations ==
::::::The AIPA framework is grounded in the cognitive‑phenomenological tradition (e.g., McAdams, Varela, Metzinger, Erikson), contemporary consciousness science on minimal phenomenal experience, and qualitative methods advocacy in psychology. It builds directly on:
::::::* Empirical work on pure awareness and Minimal Phenomenal Experience (MPE), especially Gamma &amp; Metzinger’s large‑scale study of content‑reduced awareness states.
::::::* Metzinger’s proposal of minimal phenomenal experience as an entry point for a minimal unifying model of consciousness.
::::::* Narrative identity and partial‑self models within personality and identity theory.
::::::Within this backdrop, AIPA proposes Pure Awareness as a distinct, operationally specified state that can become a structural ground of identity rather than a transient meditative experience.
:::::: == Experiential empiricism ==
::::::The empirical foundation of the AIPA Method is explicitly first‑person and experiential, combining:
::::::* A 22‑year longitudinal autoethnographic self‑study (2003–2025) documenting partial personality episodes, protocol use, and outcomes.
::::::* A 13‑year prospective verification period with zero self‑reported recurrence of targeted harmful behaviors after a dated stabilization point (1 January 2006).
::::::* A high‑ecological‑validity “stress test” during acute bereavement, used to examine whether non‑reactive awareness remains stable under maximal provocation.
::::::* Two independent practitioner cases (an Amazon‑verified report and a structured questionnaire case) providing preliminary convergent signals across cognitive, emotional, behavioral, and identity dimensions.
::::::All central constructs (Pure Awareness, partial personalities, the Switch, identity stabilization) are operationalized with explicit phenomenological and behavioral criteria intended to enable replication and future third‑person measurement.
::::::I believe this is a valid contribution to Wikiversity. 
::::::Best regards, 
::::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:54, 2 April 2026 (UTC)

== Unable to publish pages  ==

Whenever I try to publish a page with linked sources it gets flagged and says I'm a new user attempting to publish content with outside links. Those outside links are my sources. [[User:Soboyed|Soboyed]] ([[User talk:Soboyed|discuss]] • [[Special:Contributions/Soboyed|contribs]]) 04:52, 2 April 2026 (UTC)

:This restriction is automatically lifted after you have edited for a certain time (I don't recall that time off-hand, but it is not long). This is designed to stop spam. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 04:53, 2 April 2026 (UTC)

== Showing error to publish a Post ==

My  action was constructive, not destructive, please allow to publish it. [[Special:Contributions/&amp;#126;2026-20906-18|&amp;#126;2026-20906-18]] ([[User talk:&amp;#126;2026-20906-18|talk]]) 08:06, 4 April 2026 (UTC)

:Maybe you got caught in a filter. Consider [[Special:CreateAccount|creating an account]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:06, 4 April 2026 (UTC)
:Your edits, [https://en.wikiversity.org/w/index.php?title=Special:AbuseLog&amp;wpSearchUser=%7E2026-20906-18 these ones], seems to have tripped a filter when you tried to create a page on [[Create]] which external links. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 23:58, 4 April 2026 (UTC)
:Have you read my [https://en.wikiversity.org/w/index.php?title=Wikiversity:Request_custodian_action&amp;diff=prev&amp;oldid=2802219 previous reply] to you @[[User:~2026-20906-18|~2026-20906-18]]? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:02, 6 April 2026 (UTC)

== Abuse filters which should be deleted ==

Hi, there are some abuse filters which should probably be deleted.
* [[Special:AbuseFilter/1]] (not needed anymore)
* [[Special:AbuseFilter/2]] (no hits since 2018)
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched)
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives)
* [[Special:AbuseFilter/5]] (no hits since 2023)
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore)
* [[Special:AbuseFilter/17]] (no hits since 2022)
* [[Special:AbuseFilter/19]] (no hits since 2019)
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive)
Thanks. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 03:51, 5 April 2026 (UTC)

:Why do these need to be deleted rather than inactivated? Do inactive abuse filters cause a server strain? —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:39, 5 April 2026 (UTC)
:: Deleted filters do not cause strain to the servers. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:28, 5 April 2026 (UTC)
:These sounds like sensible suggestions but, yes, would inactivation perhaps make more sense than deletion for at least some  filters? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:35, 5 April 2026 (UTC)
:I would keep them @[[User:Codename Noreste|Codename Noreste]]. Alternatively, I would turn off the ones that haven't caught anything for a long time, but I would leave them enabled in case they need to be turned on or improved. If someone has already written the code and we don't have hundreds of free man-hours of programmers on Wikiversity, the server load seems secondary to me, and is negligible compared to other things. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:11, 6 April 2026 (UTC)
:: I know how to write abuse filter code and regex, but I would recommend disabling filters that have never caught anything in a long time ''and'' those who made lots of false positives. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:09, 6 April 2026 (UTC)
:::Of course @[[User:Codename Noreste|Codename Noreste]], there are people here today who are capable of changing the code. But the question is what it will be like in a few years, the question is what will happen if those two are busy for a long time, etc. That's why I would leave it so that those who don't know much about code can be inspired by it and will need to do something with it someday - plus, more code for different types of filtering is actually great educational material on how those filters work. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:41, 17 April 2026 (UTC)

Here's the updated list of abuse filters under review with actions I've taken (several disabled, one basic code improvement, and some actions changed) - none have been deleted so they can all be edited and reactivayed - please suggest any further changes:
* [[Special:AbuseFilter/1]] (not needed anymore) - One time account spam bot - 4 hits over 10 years ago - Disabled in 2024 - May be useful in future
* [[Special:AbuseFilter/2]] (no hits since 2018) - Userspace spamming - 778 hits; none since 2018 likely due to global filters - Now disabled
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched) - Specific user page spam - 1,101 hits most recent 7 March 2026 - Still active - Kept enabled
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives) - Questionable Language (profanity) - 6,055 hits including very recently - However it was logging hits without taking any actions - Edited to reduce likelihood of false positives by only applying filter to users with low (&lt; 20) edit count and applied weak actions to tag and warn but not prevent publishing the content
* [[Special:AbuseFilter/5]] (no hits since 2023) - Blocked Solicitation Links - 95 hits; none since 2023 - blocks specific historical spam sites - Non-active - Now disabled
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore) - Not reviewed - They are currently disabled
* [[Special:AbuseFilter/17]] (no hits since 2022) - Fundamental Physics Edits - 347 hits; none since 2022 - Non-active and very specific for a historical issue - Now disabled 
* [[Special:AbuseFilter/19]] (no hits since 2019) - Page Creation - 20 hits; none since 2019 - Retained for historical reference and possible future updates - Now disabled
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive) - Globally Banned Editor (renamed to Low-edit Spam Monitor) - 2,829 hits including very recent - Only applies to users with less than 5 edits and takes no actions / monitoring only - Reviewing the details of the hits I don't see many false positives and have strengthened its actions to add a tag and warning

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:57, 9 April 2026 (UTC)

== Block request ==

Please block ~2026-20985-80/~2026-21079-90/~2026-21223-88. Reason: Vandalism. [[User:Àncilu|Àncilu]] ([[User talk:Àncilu|discuss]] • [[Special:Contributions/Àncilu|contribs]]) 23:24, 5 April 2026 (UTC)

:All edits should be deleted and the first is blocked by Atcovi. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:33, 6 April 2026 (UTC)

== Antispam - Filter 12 ==
{{ping|Codename Noreste}} Thanks for contacting me with a suggested [[Special:AbuseFilter|abuse filter]] for the coupon spam we've been getting. A very much appreciated time saver. Per your suggestion, abuse filter 12 has been reactivated with your updated regex. It should tag and prevent page creation actions for coupon promo etc. Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:33, 15 April 2026 (UTC)
: @[[User:Jtneill|Jtneill]] Please do the following to filter 12:
:# Enable the block action (temporary for unregistered users, indefinite for registered users)
:# Disable both the disallow and tag actions, since that filter will be set to block
: Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:42, 5 May 2026 (UTC)
::Excellent. Done:
::* Block duration for non-registered users = 1 week
::* Block duration for registered users = indefinite
::* Disallow and tagging disabled
::Thankyou. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:24, 9 May 2026 (UTC)

== Urgent! error message This action has been automatically identified as potentially harmful, and therefore disallowed ==

While submitting the post this error was coming &quot;This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please inform an administrator of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link&quot; How to resolve it?

Here is the content:

{{note|marketing material removed}}

[[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:14, 17 April 2026 (UTC)
: That's because Wikiversity doesn't accept advertising. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 05:20, 17 April 2026 (UTC)
::So this is fine
::'''Online Internship and Digital Learning for Students'''
::Online learning has become an important part of modern education. With the help of the internet and digital tools, students can now study, practice, and gain experience without being physically present in a classroom. One key part of this system is the online internship, which helps students learn real-world skills along with their studies.
::An online internship allows students to work on tasks and projects through digital platforms. This makes learning more practical and useful, especially for those who want to understand how real work environments function.
::'''Background'''
::The concept of online learning developed from distance education, where students learned from remote locations. Over time, with the growth of digital technology, learning has become more interactive and flexible.
::The introduction of the online internship has added another important layer to digital education. It combines theoretical learning with practical experience, helping students prepare for future careers.
::During global events such as the COVID-19 pandemic, online education and online internship programs became essential. They helped students continue learning and gaining experience despite restrictions on physical movement.
::'''Importance of Online Internship'''
::An online internship plays an important role in student development. It helps bridge the gap between academic knowledge and practical skills.
::'''Some key points include:'''
::Students understand how real work is done
::They develop basic professional skills
::It supports career readiness
::It allows learning without location limits
::By participating in an online internship, students can improve their confidence and gain early exposure to different fields.
::'''Features of Online Internship-Based Learning'''
::Modern education platforms often include online internship opportunities as part of their learning system. These usually offer:
::Flexible schedules for students
::Access to learning from home
::Beginner-friendly tasks and projects
::A combination of theory and practice
::Such features make online internship programs suitable for a wide range of learners, including beginners.
::'''Learning Tasks'''
::Explore how online internship programs support student learning in digital environments.
::Identify how students can gain practical experience through an online internship
::Analyze the role of flexible learning in improving student engagement
::Understand how online education and internships work together
::'''References'''
::[https://ijpsl.in/wp-content/uploads/2020/09/E-Learning_Hanaaya-Navaneeth.pdf The Past, Present and Future of E-Learning: Hanaaya Varyani and Navaneeth M S]
::[https://ieeexplore.ieee.org/document/9788102 Current Trends and Future Perspectives of e-Learning in India]
::'''See Also'''
::[https://easyshiksha.com/online_courses/internship Online Internship]
::[https://easyshiksha.com/online_courses/ Online Courses]
::[https://easyshiksha.com/online_courses/kids-learning Kids Learning]
::[https://easyshiksha.com/career_helper/ Career Guidance] [[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:27, 17 April 2026 (UTC)
:::@[[User:EasyshikshaMarketing|EasyshikshaMarketing]] Wikiversity is a resource for education, or a space for education. However, your intention to link to another website is obvious, and such content does not belong here, as it contradicts the purpose of Wikiversity. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:38, 17 April 2026 (UTC)

==AI-generated images==
Seeking your advice.

Myself and students use some AI-generated images in the [[Motivation and emotion]] project.

[[User:Dronebogus]] has been removing some of these images from Wikiversity pages and nominating them for deletion at Commons. As a result, some have been deleted and some have been kept.

Dronebogus has made some useful edits and image suggestions for [[Motivation and emotion]] which I've appreciated and  incorporated. However, there are other edits to remove an AI image by Dronebogus that I've reverted where I think the image is more educational than no image or an alternative image suggested by Dronebogus.

There are a couple of pages where Dronebogus has reverted my reversion, so we are at risk of edit warring. We have briefly discussed and warned each other on our user talk pages, but it seems to come down to a difference in perception about the educational usefulness of the AI images.

So, I'm asking here for others to please review the recent edit histories for these pages:
* [[Motivation and emotion/Lectures/Brain and physiological needs]]
* [[Motivation and emotion/Book/2025/Stockholm syndrome emotion]]

and let us know what you think about the AI image suitability vs. using no image or alternative images suggested by Dronebogus.

Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:45, 26 April 2026 (UTC)

:I think Jtneill needs to try harder to find non-AI alternatives both on Commons and the web. I’m not reiterating the well known problems with generative AI— you can read about those on Wikipedia and the broader Internet. Needless to say it’s kind of just inherently toxic. If you use it, it should be the last resort of last resorts. Just my stance, which I consider perfectly valid and reasonable. [[User:Dronebogus|Dronebogus]] ([[User talk:Dronebogus|discuss]] • [[Special:Contributions/Dronebogus|contribs]]) 04:10, 27 April 2026 (UTC)

== Request for Page Creation Approval - Research on Dr. Ian Stevenson ==


'''Hello Administrators,'''

I am a digital archivist and researcher attempting to create an educational page regarding Dr. Ian Stevenson's scientific work, specifically titled &quot;Where Reincarnation and Biology Intersect&quot; and its official Vietnamese edition.

My edits are purely constructive, aimed at integrating local research context with global structured data (including '''Wikidata Q139548587'''). The automated filter is currently preventing publication due to &quot;new user external link limits.&quot;

I have ensured that all citations, references, and images (sourced from Wikimedia Commons) are strictly academic and non-promotional. Could you please review my contributions and consider whitelisting my account or approving this specific page creation?

Thank you for your assistance in preserving this research '''legacy''' within the open knowledge ecosystem.

'''Best regards,''' [[User:Ian Stevenson777|Ian Stevenson777]] ([[User talk:Ian Stevenson777|discuss]] • [[Special:Contributions/Ian Stevenson777|contribs]]) 07:26, 28 April 2026 (UTC)
: The page title should probably be in English, as this is English Wikiversity. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:19, 28 April 2026 (UTC)
:@[[User:Ian Stevenson777|Ian Stevenson777]] I looked at the text and it seems to me that it is informative, but the user cannot learn anything from it because they would have to buy the book. In this regard, it seems to me that it is enough [[:w:Where Reincarnation and Biology Intersect|to have that article on Wikipedia]] and there is no need to duplicate it here on Wikiversity. If you are particularly interested with its Vietnamese translation, I would focus on Vietnamese Wikipedia, but it seems to me, that the article there [https://vi.wikipedia.org/w/index.php?title=N%C6%A1i_lu%C3%A2n_h%E1%BB%93i_v%C3%A0_sinh_h%E1%BB%8Dc_giao_nhau&amp;oldid=75029095 have some problems at the moment]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:51, 5 May 2026 (UTC)
:This request is AI-generated and was made by a lock evading LTA. Please ignore it. [[User:NguoiDungKhongDinhDanh|NguoiDungKhongDinhDanh]] ([[User talk:NguoiDungKhongDinhDanh|discuss]] • [[Special:Contributions/NguoiDungKhongDinhDanh|contribs]]) 23:58, 13 May 2026 (UTC)

== Call for custodians and bureaucrats ==
&lt;div class=&quot;cd-moveMark&quot;&gt;''Moved to [[Wikiversity:Notices for custodians#Call for custodians and bureaucrats]].  [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 18:46, 12 May 2026 (UTC)''&lt;/div&gt;

== Interface administrator flag request ==

@[[User:Jtneill|Jtneill]], @[[User:Mu301|Mu301]] I am requesting IA flag to delete [[MediaWiki:Gadget-WikiSign.js]]. It was requested for deletion by [[User:Sophivorus|a trusted user]] and I think it can be deleted. Once I delete it, I will notify you and you can remove the flag. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:24, 10 May 2026 (UTC)

:Can you enable two-factor authentication? 
:Policy: [[Wikiversity:Interface administrators]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:27, 10 May 2026 (UTC)
::Done @[[User:Jtneill|Jtneill]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:20, 11 May 2026 (UTC)
:::You are an interface administrator for 24 hours. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:57, 11 May 2026 (UTC)
::::Thx @[[User:Jtneill|Jtneill]], I have just deleted the page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:59, 11 May 2026 (UTC)

== Block request ==

Hi. Please block @[[User:Skibidi Titan 5.0|Skibidi Titan 5.0]]. Reason : Vandalism.

Thanks, [[User:Locpac|Locpac]] ([[User talk:Locpac|discuss]] • [[Special:Contributions/Locpac|contribs]]) 15:10, 10 May 2026 (UTC)

:Thankyou. Done. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 15:25, 10 May 2026 (UTC)</text>
      <sha1>o6ym5wj3qpi6kp8sl9zgcxhlisu14iz</sha1>
    </revision>
    <revision>
      <id>2809730</id>
      <parentid>2809728</parentid>
      <timestamp>2026-05-16T19:27:07Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>/* ~2026-28496-53 */ archive from [[Wikiversity:Request custodian action]] ([[mw:c:Special:MyLanguage/User:JWBTH/CD|CD]])</comment>
      <origin>2809730</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="40669" sha1="ioocsjkrw20ehvomrcl8kw0c63xa91k" xml:space="preserve">{{Archive|Wikiversity:Request custodian action}}

== Sidewide count.js ==

i would like something like: [[Template:User contrib count/count.js]]. i created [[Template:User contrib count]] and a user/common.js. {{User contrib count}}.&lt;br&gt;&lt;br&gt; so a &quot;count.js&quot; would complete it. See [[User:Harold Foppele/common.js]].
If an Administrator could help please. Cheers [[User:Harold Foppele|Harold Foppele]] ([[User talk:Harold Foppele|discuss]] • [[Special:Contributions/Harold Foppele|contribs]]) 19:22, 18 January 2026 (UTC)

== need to add my profile ==

im trying to add new profile content  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:03, 4 February 2026 (UTC)

:You can edit it now. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 18:05, 4 February 2026 (UTC)
::where can create a new one [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)
:::i have created and its in sandbox. i would like to know when it will be approved  [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 19:38, 4 February 2026 (UTC)
::::Please don’t create [[wv:spam|spam]] pages as it will be deleted. Please also read [[WV:Scope]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 04:01, 5 February 2026 (UTC)

== Im trying to add new profile while add content its shows not alowed ==

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Exceeded New Page Limit

This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please [[Wikiversity:Request custodian action|inform an administrator]] of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link [[User:PAGURUMURTHY|PAGURUMURTHY]] ([[User talk:PAGURUMURTHY|discuss]] • [[Special:Contributions/PAGURUMURTHY|contribs]]) 18:51, 4 February 2026 (UTC)

== New User: cannot create talk page ==

Hi, I am a new user of Wikiversity and I wanted to create a talk page for the article [[ChatGPT's Essay on Kohlberg's Theory: AI's Use in Academic Writing]]. As a new user, I was barred from performing this action. The text that I wanted to add to the talk page is:

&lt;blockquote&gt;
I have doubts as to to the reliability of this essay. Take for rexample the sentence:

&lt;blockquote&gt;
Due to its efficiency, AI has saved 380,000-403,000 lives per year in European healthcare as reported in a recent Deloitte and MedTech Europe report&lt;ref&gt;Dantas, C., Mackiewicz, K., Tageo, V., Jacucci, G., Guardado, D., Ortet, S., Varlamis, I., Maniadakis, M., De Lera, E., Quintas, J., Kocsis, O., &amp; Vassiliou, C. (2021). Benefits and hurdles of AI in the workplace – what comes next? ''International Journal of Artificial Intelligence and Expert Systems, 10'', 9-17. https://www.researchgate.net/publication/351993615_Benefits_and_Hurdles_of_AI_In_The_Workplace_-What_Comes_Next&lt;/ref&gt;.
&lt;/blockquote&gt;

Reading the reference (freely available on ResearchGate), one notes:

# that the reference is from 2021 (predating the widespread use of LLMs such as ChatGPT and the associated 'AI' boom), and
# that the reference factually contradicts this essay.

Quoting from the reference:

&lt;blockquote&gt;
There are enormous benefits of applying AI-based solutions to monitor workers’ health and prevent accidents or, currently, COVID-19 infections, and those benefits are reported with enormous potential. According to the recent Deloitte and MedTech Europe report [11], implementing AI in European healthcare systems could save up 380,000 to 403,000 lives annually or €170.9 to 212.4 billion per year.
&lt;/blockquote&gt;

Not that the reference says ''could save'', not ''saves'' as in the essay.

This calls into question the reliability of the essay.

&lt;/blockquote&gt;

Could an administrator make this addition for me? Thank you! 
{{reflist}}
[[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 06:53, 5 February 2026 (UTC)

:@[[User:Æolus|Æolus]] I have added it for you, you can change the header and sign it now. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 08:05, 5 February 2026 (UTC)
::Thank you! [[User:Æolus|Æolus]] ([[User talk:Æolus|discuss]] • [[Special:Contributions/Æolus|contribs]]) 12:43, 5 February 2026 (UTC)

== Disallowed to add a page on a course ==

I'm trying to populate a newly created course on Wikiversity, but it blocks me from creating more pages with &quot;New User Exceeded New Page Limit&quot;. Could this be lifted please? [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 13:21, 15 February 2026 (UTC)

:Sorry! Never mind. I was trying to create a new article instead of a new page. All good now. [[User:Berkeleywho|Berkeleywho]] ([[User talk:Berkeleywho|discuss]] • [[Special:Contributions/Berkeleywho|contribs]]) 14:03, 15 February 2026 (UTC)

== Harold Foppele adding LLM-generated nonsense and personal fiction ==

I became aware of [[User:Harold Foppele]]'s editing after I deleted some of his uploads on Commons. He appears to be adding a large amount of text and images that are some combination of personal fiction and LLM-generated nonsense. This includes:
*[[Quantum Ultra fast lasers#Future thought experiment|Personal speculative fiction]] in an otherwise &quot;nonfiction&quot; article
*Uploading nonsense LLM-created [[:File:Rontosecond pulse laser (Schematic).jpg|diagrams]] and [[:File:Rontosecond pulse laser (Futuristic).jpg|renders]] for nonexistent lab equipment, with fake source (on Commons, he indicated these files as having been created by him using an LLM)
*Uploading nonsense LLM-created images of equations with obvious artifacts. These images, such as [[:File:Redfield equation (non-Markovian).png]] and [[:File:Lindblad equation (Markovian).png]], don't even match the text he puts them with.
Much of his writing is also of extremely poor quality, to the point where it's not clear whether it's written by him or an LLM. I'm not an active editor on this project, so I'm not as familiar with the standards here, but I believe this is worth custodian attention. [[User:Pi.1415926535|Pi.1415926535]] ([[User talk:Pi.1415926535|discuss]] • [[Special:Contributions/Pi.1415926535|contribs]]) 03:06, 23 February 2026 (UTC)

:Fake source ''and'' contradictory copyright info, claiming both public domain and CC license. Moreover, if they are indeed nearly-direct LLM output, depending on jurisdiction they may not even be eligible for copyright.
:I've put speedy deletion marks for the equations, because they're obviously not coherent mathematical equations (the parentheses don't match, the symbols merge into each other the way text in image models often do, etc) [[User:Sesquilinear|Sesquilinear]] ([[User talk:Sesquilinear|discuss]] • [[Special:Contributions/Sesquilinear|contribs]]) 21:50, 7 March 2026 (UTC)

== Repeated removal of RFD notices by Harold Foppele ==

{{User|Harold Foppele }}

This editor is appearing in multiple noticeboards for behaviour which is contentious. Ther latest adventure is the repeated removal of tye RFD notice at [[Quantum/Henry C. Kapteyn]]. You will see from their contributions record the number of times. I have warned Tham on their user tag page that this is tantaomunt to volunteering to be blocked here. They have a track record of achieving blocks on enWiki and Commons already.

They have all the appearance of shooting not to understand when given direct information about their behaviour, whichever project they are editing, and are fast becoming a time sink. Their behaviour across multiple WMF sites may well lead to a Global Lock, but I do not believe they have quite reached the threshold for that.

I believe that what is required is a preventative block to seek to ensure thatchy understand the seriousness of their behaviour, and the need to be collegial. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 23:03, 4 March 2026 (UTC)
: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:45, 8 March 2026 (UTC)

== Blocks for sockpuppet ==

Please block [[User:Harold Foppele]] and [[User:Johnwilliamsiii]] for sockpuppetry based on [https://en.wikipedia.org/wiki/Wikipedia:Sockpuppet_investigations/Harold_Foppele en wiki] CU and [https://commons.wikimedia.org/w/index.php?diff=1177465640 commons] CU investigations. The user has also violated copyright, see the above discussion. A block is necessary to prevent further abuse. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:30, 8 March 2026 (UTC)

:&lt;small&gt;@[[User:MathXplore|MathXplore]]&lt;/small&gt; [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:31, 8 March 2026 (UTC)
:: {{Done}} [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 11:44, 8 March 2026 (UTC)
:CC. @[[User:Timtrent|Timtrent]], @[[User:Sesquilinear|Sesquilinear]], @[[User:Pi.1415926535|Pi.1415926535]] [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 11:33, 8 March 2026 (UTC)
::Thank you for the ping. I concur based on [[w:en:WP:DUCK|behaviour]]. CUs appear divided. 🇵🇸&amp;zwj;🇺🇦&amp;nbsp;[[User:Timtrent|Timtrent]]&amp;nbsp;🇺🇦&amp;nbsp;[[User talk:Timtrent|talk to me]]&amp;nbsp;🇺🇦&amp;zwj;🇵🇸 11:41, 8 March 2026 (UTC)

== Problem when trying to start a discussion with authors of the Plurilingual education portal ==

The authors I wanted to discuss with are called &quot;Project PEP&quot; and my name is Franch Chandler. How can I be allowed to do so ? [[User:French Chandler|French Chandler]] ([[User talk:French Chandler|discuss]] • [[Special:Contributions/French Chandler|contribs]]) 18:25, 16 March 2026 (UTC)

:@[[User:French Chandler|French Chandler]] place your qestion [https://en.wikiversity.org/w/index.php?title=User_talk:Projet_PEP&amp;action=edit into the dialog box] on this link and hit Publish page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 20:22, 16 March 2026 (UTC)

== Please publish my post ==

My post is about &quot;Every child grows and develops at their own pace, but some may experience challenges that affect their ability to perform everyday tasks. These challenges can include difficulties with fine motor skills, sensory processing, handwriting, feeding, and self-regulation. When these issues are not addressed early, they can impact a child’s confidence, academic performance, and independence.

With the rise of digital healthcare services, '''online physical therapy''' has emerged as a powerful and accessible solution for parents seeking support for their children. This modern approach provides structured, personalized therapy programs that can be accessed from the comfort of home, making it easier for families to ensure consistent care.&quot; [[User:Skyabovetherapy|Skyabovetherapy]] ([[User talk:Skyabovetherapy|discuss]] • [[Special:Contributions/Skyabovetherapy|contribs]]) 12:28, 28 March 2026 (UTC)

:@[[User:Skyabovetherapy|Skyabovetherapy]] Well, you can publish it yourself, Wikiversity is a free environement, where everybody can create educational resources. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 14:11, 29 March 2026 (UTC)
::They actually triggered some abuse filters. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 16:24, 29 March 2026 (UTC)
:I looked at your attempts to add this text and I see a link to one website repeated many times, which reminds me of the misuse of Wikiversity for self-promotion or to increase the importance of the website. It is necessary to remind you here that Wikiversity is not a place for promotion, but a place for education. So if you want to educate, it will not be a problem to create the page without external links with a clearly defined procedure for how people should use it and what to expect from it. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 18:07, 1 April 2026 (UTC)

== New user limit ==

Hi, I am creating an AIPA Method learning resource page. 

I am the author of the linked research, and I hit the “new user limit” and “new page with external link” filters while publishing. 

Here is the link to the page in creation: [https://en.wikiversity.org/w/index.php?title=AIPA_Method&amp;veaction=edit] 

Thank you for your help. 

Best regards, 

Senad Dizdarević [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:19, 30 March 2026 (UTC)

:@[[User:Senad Dizdarević|Senad Dizdarević]] I should admit I dont know, what is &quot;new user limit&quot;, but if filter blocks your page because of certain external link, you may force to save anyway and sometimes it works. It should not work, when the website is blacklisted. As of now, I am not seeing you to save page in main namespace, so try to save it without external links first. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 07:30, 30 March 2026 (UTC)
::Thank you, you are very kind. 
::I will wait a day, and try again (without links, too). 
::Today, I already created About Me info page, and maybe that is enough for the filters for one day.  [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 07:53, 30 March 2026 (UTC)
:::Well, I have analyzed your contribution to Wikiversity and I should point out here, that this project is not a place for advertising, so there is no way of promoting your books and authority this way. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 17:56, 1 April 2026 (UTC)
::::Hi, my About Me page is just an info page with the neutral as possible presentation of my work. 
::::There is a big difference between informing and advertising. Informing is neutrally stating that something exists and requiring no action, while advertising is a special communication form with intent to cause certain action from readers. For example, click here, click there, order this, buy that. 
::::There is no such intention, form, or terms on my info page. Just neutral information. I don't hide and I am not ashamed that I am write and author, and that is a part of the usual bio, including works. I checked your user page: &quot;I graduated from the Czech University of Life Sciences in Prague and studied information science at the Faculty of Arts of Charles University.&quot; I think that if you had written a book on Life Science, you would have mentioned that as well.
::::Most of the Info page is about my research and AIPA Method which is a valid contribution to psychology, consciousness studies, identity theory, and personality development. Actually, my paper '''AIPA Method: A Cognitive-Phenomenological Model for Identity Reconstruction and Stabilization in Pure Awareness''' is now in the peer review procedure at Journal of Consciousness Studies. 
::::Here is a part from the Wikiversity AIPA Method page in creation (waiting for the end of the time limit for new users):    [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:47, 2 April 2026 (UTC)
:::::For the unknown reasons, the form didn't publish my second part of the message: 
:::::I believe this is a valid contribution to Wikiversity. 
:::::Best Regards, 
:::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:52, 2 April 2026 (UTC)
::::::And the third try: 
:::::: == Introduction ==
::::::The AIPA Method addresses a gap in contemporary personal development and consciousness science: most evidence‑based approaches (CBT, MBSR, MBCT, standard meditation) operate at the level of mental content—reframing thoughts, observing them, or reducing their impact—rather than at the level of identity structure. In contrast, AIPA targets the structural relationship between the self and the mind, aiming at durable identity reconstruction rooted in Pure Awareness rather than symptom management.
::::::The central research question of the primary AIPA preprint is whether a structured, sequentially staged method can produce permanent identity reconstruction rooted in Pure Awareness, and how such a method compares to established approaches in scope, mechanism, and outcome.
:::::: == Theoretical foundations ==
::::::The AIPA framework is grounded in the cognitive‑phenomenological tradition (e.g., McAdams, Varela, Metzinger, Erikson), contemporary consciousness science on minimal phenomenal experience, and qualitative methods advocacy in psychology. It builds directly on:
::::::* Empirical work on pure awareness and Minimal Phenomenal Experience (MPE), especially Gamma &amp; Metzinger’s large‑scale study of content‑reduced awareness states.
::::::* Metzinger’s proposal of minimal phenomenal experience as an entry point for a minimal unifying model of consciousness.
::::::* Narrative identity and partial‑self models within personality and identity theory.
::::::Within this backdrop, AIPA proposes Pure Awareness as a distinct, operationally specified state that can become a structural ground of identity rather than a transient meditative experience.
:::::: == Experiential empiricism ==
::::::The empirical foundation of the AIPA Method is explicitly first‑person and experiential, combining:
::::::* A 22‑year longitudinal autoethnographic self‑study (2003–2025) documenting partial personality episodes, protocol use, and outcomes.
::::::* A 13‑year prospective verification period with zero self‑reported recurrence of targeted harmful behaviors after a dated stabilization point (1 January 2006).
::::::* A high‑ecological‑validity “stress test” during acute bereavement, used to examine whether non‑reactive awareness remains stable under maximal provocation.
::::::* Two independent practitioner cases (an Amazon‑verified report and a structured questionnaire case) providing preliminary convergent signals across cognitive, emotional, behavioral, and identity dimensions.
::::::All central constructs (Pure Awareness, partial personalities, the Switch, identity stabilization) are operationalized with explicit phenomenological and behavioral criteria intended to enable replication and future third‑person measurement.
::::::I believe this is a valid contribution to Wikiversity. 
::::::Best regards, 
::::::Senad [[User:Senad Dizdarević|Senad Dizdarević]] ([[User talk:Senad Dizdarević|discuss]] • [[Special:Contributions/Senad Dizdarević|contribs]]) 06:54, 2 April 2026 (UTC)

== Unable to publish pages  ==

Whenever I try to publish a page with linked sources it gets flagged and says I'm a new user attempting to publish content with outside links. Those outside links are my sources. [[User:Soboyed|Soboyed]] ([[User talk:Soboyed|discuss]] • [[Special:Contributions/Soboyed|contribs]]) 04:52, 2 April 2026 (UTC)

:This restriction is automatically lifted after you have edited for a certain time (I don't recall that time off-hand, but it is not long). This is designed to stop spam. —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 04:53, 2 April 2026 (UTC)

== Showing error to publish a Post ==

My  action was constructive, not destructive, please allow to publish it. [[Special:Contributions/&amp;#126;2026-20906-18|&amp;#126;2026-20906-18]] ([[User talk:&amp;#126;2026-20906-18|talk]]) 08:06, 4 April 2026 (UTC)

:Maybe you got caught in a filter. Consider [[Special:CreateAccount|creating an account]]. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:06, 4 April 2026 (UTC)
:Your edits, [https://en.wikiversity.org/w/index.php?title=Special:AbuseLog&amp;wpSearchUser=%7E2026-20906-18 these ones], seems to have tripped a filter when you tried to create a page on [[Create]] which external links. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 23:58, 4 April 2026 (UTC)
:Have you read my [https://en.wikiversity.org/w/index.php?title=Wikiversity:Request_custodian_action&amp;diff=prev&amp;oldid=2802219 previous reply] to you @[[User:~2026-20906-18|~2026-20906-18]]? [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:02, 6 April 2026 (UTC)

== Abuse filters which should be deleted ==

Hi, there are some abuse filters which should probably be deleted.
* [[Special:AbuseFilter/1]] (not needed anymore)
* [[Special:AbuseFilter/2]] (no hits since 2018)
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched)
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives)
* [[Special:AbuseFilter/5]] (no hits since 2023)
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore)
* [[Special:AbuseFilter/17]] (no hits since 2022)
* [[Special:AbuseFilter/19]] (no hits since 2019)
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive)
Thanks. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 03:51, 5 April 2026 (UTC)

:Why do these need to be deleted rather than inactivated? Do inactive abuse filters cause a server strain? —[[User:Koavf|Justin (&lt;span style=&quot;color:grey&quot;&gt;ko'''a'''vf&lt;/span&gt;)]]&lt;span style=&quot;color:red&quot;&gt;❤[[User talk:Koavf|T]]☮[[Special:Contributions/Koavf|C]]☺[[Special:Emailuser/Koavf|M]]☯&lt;/span&gt; 05:39, 5 April 2026 (UTC)
:: Deleted filters do not cause strain to the servers. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:28, 5 April 2026 (UTC)
:These sounds like sensible suggestions but, yes, would inactivation perhaps make more sense than deletion for at least some  filters? -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:35, 5 April 2026 (UTC)
:I would keep them @[[User:Codename Noreste|Codename Noreste]]. Alternatively, I would turn off the ones that haven't caught anything for a long time, but I would leave them enabled in case they need to be turned on or improved. If someone has already written the code and we don't have hundreds of free man-hours of programmers on Wikiversity, the server load seems secondary to me, and is negligible compared to other things. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:11, 6 April 2026 (UTC)
:: I know how to write abuse filter code and regex, but I would recommend disabling filters that have never caught anything in a long time ''and'' those who made lots of false positives. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 15:09, 6 April 2026 (UTC)
:::Of course @[[User:Codename Noreste|Codename Noreste]], there are people here today who are capable of changing the code. But the question is what it will be like in a few years, the question is what will happen if those two are busy for a long time, etc. That's why I would leave it so that those who don't know much about code can be inspired by it and will need to do something with it someday - plus, more code for different types of filtering is actually great educational material on how those filters work. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:41, 17 April 2026 (UTC)

Here's the updated list of abuse filters under review with actions I've taken (several disabled, one basic code improvement, and some actions changed) - none have been deleted so they can all be edited and reactivayed - please suggest any further changes:
* [[Special:AbuseFilter/1]] (not needed anymore) - One time account spam bot - 4 hits over 10 years ago - Disabled in 2024 - May be useful in future
* [[Special:AbuseFilter/2]] (no hits since 2018) - Userspace spamming - 778 hits; none since 2018 likely due to global filters - Now disabled
* [[Special:AbuseFilter/3]] (not needed since there are global filters that disallow this specific type of spam filter 3 would have catched) - Specific user page spam - 1,101 hits most recent 7 March 2026 - Still active - Kept enabled
* [[Special:AbuseFilter/4]] (looking at the logs, there are too many false positives) - Questionable Language (profanity) - 6,055 hits including very recently - However it was logging hits without taking any actions - Edited to reduce likelihood of false positives by only applying filter to users with low (&lt; 20) edit count and applied weak actions to tag and warn but not prevent publishing the content
* [[Special:AbuseFilter/5]] (no hits since 2023) - Blocked Solicitation Links - 95 hits; none since 2023 - blocks specific historical spam sites - Non-active - Now disabled
* Abuse filters 7, 8, 9, 10, 11, 12 (these filters are not needed anymore) - Not reviewed - They are currently disabled
* [[Special:AbuseFilter/17]] (no hits since 2022) - Fundamental Physics Edits - 347 hits; none since 2022 - Non-active and very specific for a historical issue - Now disabled 
* [[Special:AbuseFilter/19]] (no hits since 2019) - Page Creation - 20 hits; none since 2019 - Retained for historical reference and possible future updates - Now disabled
* [[Special:AbuseFilter/21]] (false positives, vandal currently inactive) - Globally Banned Editor (renamed to Low-edit Spam Monitor) - 2,829 hits including very recent - Only applies to users with less than 5 edits and takes no actions / monitoring only - Reviewing the details of the hits I don't see many false positives and have strengthened its actions to add a tag and warning

-- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:57, 9 April 2026 (UTC)

== Block request ==

Please block ~2026-20985-80/~2026-21079-90/~2026-21223-88. Reason: Vandalism. [[User:Àncilu|Àncilu]] ([[User talk:Àncilu|discuss]] • [[Special:Contributions/Àncilu|contribs]]) 23:24, 5 April 2026 (UTC)

:All edits should be deleted and the first is blocked by Atcovi. [[User:PieWriter|PieWriter]] ([[User talk:PieWriter|discuss]] • [[Special:Contributions/PieWriter|contribs]]) 00:33, 6 April 2026 (UTC)

== Antispam - Filter 12 ==
{{ping|Codename Noreste}} Thanks for contacting me with a suggested [[Special:AbuseFilter|abuse filter]] for the coupon spam we've been getting. A very much appreciated time saver. Per your suggestion, abuse filter 12 has been reactivated with your updated regex. It should tag and prevent page creation actions for coupon promo etc. Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:33, 15 April 2026 (UTC)
: @[[User:Jtneill|Jtneill]] Please do the following to filter 12:
:# Enable the block action (temporary for unregistered users, indefinite for registered users)
:# Disable both the disallow and tag actions, since that filter will be set to block
: Thank you. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 13:42, 5 May 2026 (UTC)
::Excellent. Done:
::* Block duration for non-registered users = 1 week
::* Block duration for registered users = indefinite
::* Disallow and tagging disabled
::Thankyou. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:24, 9 May 2026 (UTC)

== Urgent! error message This action has been automatically identified as potentially harmful, and therefore disallowed ==

While submitting the post this error was coming &quot;This action has been automatically identified as potentially harmful, and therefore disallowed. If you believe your action was constructive, please inform an administrator of what you were trying to do. A brief description of the abuse rule which your action matched is: New User Created Page with External Link&quot; How to resolve it?

Here is the content:

{{note|marketing material removed}}

[[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:14, 17 April 2026 (UTC)
: That's because Wikiversity doesn't accept advertising. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 05:20, 17 April 2026 (UTC)
::So this is fine
::'''Online Internship and Digital Learning for Students'''
::Online learning has become an important part of modern education. With the help of the internet and digital tools, students can now study, practice, and gain experience without being physically present in a classroom. One key part of this system is the online internship, which helps students learn real-world skills along with their studies.
::An online internship allows students to work on tasks and projects through digital platforms. This makes learning more practical and useful, especially for those who want to understand how real work environments function.
::'''Background'''
::The concept of online learning developed from distance education, where students learned from remote locations. Over time, with the growth of digital technology, learning has become more interactive and flexible.
::The introduction of the online internship has added another important layer to digital education. It combines theoretical learning with practical experience, helping students prepare for future careers.
::During global events such as the COVID-19 pandemic, online education and online internship programs became essential. They helped students continue learning and gaining experience despite restrictions on physical movement.
::'''Importance of Online Internship'''
::An online internship plays an important role in student development. It helps bridge the gap between academic knowledge and practical skills.
::'''Some key points include:'''
::Students understand how real work is done
::They develop basic professional skills
::It supports career readiness
::It allows learning without location limits
::By participating in an online internship, students can improve their confidence and gain early exposure to different fields.
::'''Features of Online Internship-Based Learning'''
::Modern education platforms often include online internship opportunities as part of their learning system. These usually offer:
::Flexible schedules for students
::Access to learning from home
::Beginner-friendly tasks and projects
::A combination of theory and practice
::Such features make online internship programs suitable for a wide range of learners, including beginners.
::'''Learning Tasks'''
::Explore how online internship programs support student learning in digital environments.
::Identify how students can gain practical experience through an online internship
::Analyze the role of flexible learning in improving student engagement
::Understand how online education and internships work together
::'''References'''
::[https://ijpsl.in/wp-content/uploads/2020/09/E-Learning_Hanaaya-Navaneeth.pdf The Past, Present and Future of E-Learning: Hanaaya Varyani and Navaneeth M S]
::[https://ieeexplore.ieee.org/document/9788102 Current Trends and Future Perspectives of e-Learning in India]
::'''See Also'''
::[https://easyshiksha.com/online_courses/internship Online Internship]
::[https://easyshiksha.com/online_courses/ Online Courses]
::[https://easyshiksha.com/online_courses/kids-learning Kids Learning]
::[https://easyshiksha.com/career_helper/ Career Guidance] [[User:EasyshikshaMarketing|EasyshikshaMarketing]] ([[User talk:EasyshikshaMarketing|discuss]] • [[Special:Contributions/EasyshikshaMarketing|contribs]]) 05:27, 17 April 2026 (UTC)
:::@[[User:EasyshikshaMarketing|EasyshikshaMarketing]] Wikiversity is a resource for education, or a space for education. However, your intention to link to another website is obvious, and such content does not belong here, as it contradicts the purpose of Wikiversity. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 11:38, 17 April 2026 (UTC)

==AI-generated images==
Seeking your advice.

Myself and students use some AI-generated images in the [[Motivation and emotion]] project.

[[User:Dronebogus]] has been removing some of these images from Wikiversity pages and nominating them for deletion at Commons. As a result, some have been deleted and some have been kept.

Dronebogus has made some useful edits and image suggestions for [[Motivation and emotion]] which I've appreciated and  incorporated. However, there are other edits to remove an AI image by Dronebogus that I've reverted where I think the image is more educational than no image or an alternative image suggested by Dronebogus.

There are a couple of pages where Dronebogus has reverted my reversion, so we are at risk of edit warring. We have briefly discussed and warned each other on our user talk pages, but it seems to come down to a difference in perception about the educational usefulness of the AI images.

So, I'm asking here for others to please review the recent edit histories for these pages:
* [[Motivation and emotion/Lectures/Brain and physiological needs]]
* [[Motivation and emotion/Book/2025/Stockholm syndrome emotion]]

and let us know what you think about the AI image suitability vs. using no image or alternative images suggested by Dronebogus.

Sincerely, James -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 11:45, 26 April 2026 (UTC)

:I think Jtneill needs to try harder to find non-AI alternatives both on Commons and the web. I’m not reiterating the well known problems with generative AI— you can read about those on Wikipedia and the broader Internet. Needless to say it’s kind of just inherently toxic. If you use it, it should be the last resort of last resorts. Just my stance, which I consider perfectly valid and reasonable. [[User:Dronebogus|Dronebogus]] ([[User talk:Dronebogus|discuss]] • [[Special:Contributions/Dronebogus|contribs]]) 04:10, 27 April 2026 (UTC)

== Request for Page Creation Approval - Research on Dr. Ian Stevenson ==


'''Hello Administrators,'''

I am a digital archivist and researcher attempting to create an educational page regarding Dr. Ian Stevenson's scientific work, specifically titled &quot;Where Reincarnation and Biology Intersect&quot; and its official Vietnamese edition.

My edits are purely constructive, aimed at integrating local research context with global structured data (including '''Wikidata Q139548587'''). The automated filter is currently preventing publication due to &quot;new user external link limits.&quot;

I have ensured that all citations, references, and images (sourced from Wikimedia Commons) are strictly academic and non-promotional. Could you please review my contributions and consider whitelisting my account or approving this specific page creation?

Thank you for your assistance in preserving this research '''legacy''' within the open knowledge ecosystem.

'''Best regards,''' [[User:Ian Stevenson777|Ian Stevenson777]] ([[User talk:Ian Stevenson777|discuss]] • [[Special:Contributions/Ian Stevenson777|contribs]]) 07:26, 28 April 2026 (UTC)
: The page title should probably be in English, as this is English Wikiversity. [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 14:19, 28 April 2026 (UTC)
:@[[User:Ian Stevenson777|Ian Stevenson777]] I looked at the text and it seems to me that it is informative, but the user cannot learn anything from it because they would have to buy the book. In this regard, it seems to me that it is enough [[:w:Where Reincarnation and Biology Intersect|to have that article on Wikipedia]] and there is no need to duplicate it here on Wikiversity. If you are particularly interested with its Vietnamese translation, I would focus on Vietnamese Wikipedia, but it seems to me, that the article there [https://vi.wikipedia.org/w/index.php?title=N%C6%A1i_lu%C3%A2n_h%E1%BB%93i_v%C3%A0_sinh_h%E1%BB%8Dc_giao_nhau&amp;oldid=75029095 have some problems at the moment]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 12:51, 5 May 2026 (UTC)
:This request is AI-generated and was made by a lock evading LTA. Please ignore it. [[User:NguoiDungKhongDinhDanh|NguoiDungKhongDinhDanh]] ([[User talk:NguoiDungKhongDinhDanh|discuss]] • [[Special:Contributions/NguoiDungKhongDinhDanh|contribs]]) 23:58, 13 May 2026 (UTC)

== Call for custodians and bureaucrats ==
&lt;div class=&quot;cd-moveMark&quot;&gt;''Moved to [[Wikiversity:Notices for custodians#Call for custodians and bureaucrats]].  [[User:Codename Noreste|Codename Noreste]] ([[User talk:Codename Noreste|discuss]] • [[Special:Contributions/Codename Noreste|contribs]]) 18:46, 12 May 2026 (UTC)''&lt;/div&gt;

== Interface administrator flag request ==

@[[User:Jtneill|Jtneill]], @[[User:Mu301|Mu301]] I am requesting IA flag to delete [[MediaWiki:Gadget-WikiSign.js]]. It was requested for deletion by [[User:Sophivorus|a trusted user]] and I think it can be deleted. Once I delete it, I will notify you and you can remove the flag. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:24, 10 May 2026 (UTC)

:Can you enable two-factor authentication? 
:Policy: [[Wikiversity:Interface administrators]] -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 10:27, 10 May 2026 (UTC)
::Done @[[User:Jtneill|Jtneill]]. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 08:20, 11 May 2026 (UTC)
:::You are an interface administrator for 24 hours. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 09:57, 11 May 2026 (UTC)
::::Thx @[[User:Jtneill|Jtneill]], I have just deleted the page. [[User:Juandev|Juandev]] ([[User talk:Juandev|discuss]] • [[Special:Contributions/Juandev|contribs]]) 09:59, 11 May 2026 (UTC)

== Block request ==

Hi. Please block @[[User:Skibidi Titan 5.0|Skibidi Titan 5.0]]. Reason : Vandalism.

Thanks, [[User:Locpac|Locpac]] ([[User talk:Locpac|discuss]] • [[Special:Contributions/Locpac|contribs]]) 15:10, 10 May 2026 (UTC)

:Thankyou. Done. -- [[User:Jtneill|Jtneill]] - &lt;small&gt;[[User talk:Jtneill|Talk]] - [[Special:Contributions/Jtneill|c]]&lt;/small&gt; 15:25, 10 May 2026 (UTC)

== ~2026-28496-53 ==

Please block [[Special:Contribs/~2026-28496-53]], vandalism. [[User:Tenshi Hinanawi|Tenshi Hinanawi]] ([[User talk:Tenshi Hinanawi|トーク]] • [[Special:Contributions/Tenshi Hinanawi|投稿記録]]) 17:02, 11 May 2026 (UTC)

:{{done}} Thank you! —[[User:Atcovi|Atcovi]] [[User talk:Atcovi|(Talk]] - [[Special:Contributions/Atcovi|Contribs)]] 17:14, 11 May 2026 (UTC)</text>
      <sha1>ioocsjkrw20ehvomrcl8kw0c63xa91k</sha1>
    </revision>
  </page>
  <page>
    <title>Banjo</title>
    <ns>0</ns>
    <id>329679</id>
    <revision>
      <id>2809712</id>
      <timestamp>2026-05-16T19:25:07Z</timestamp>
      <contributor>
        <username>Kirby - Electrotechnics</username>
        <id>3074947</id>
      </contributor>
      <comment>Created base page for Banjo learning. Included generic information on types of banjos and created a heading for overviews of banjo styles.</comment>
      <origin>2809712</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="3298" sha1="tq0ntrw9qtb86q251b9a14t86yng5fq" xml:space="preserve">The '''Banjo''' is a stringed musical instrument with a long neck (commonly fretted) and a circular drum-like body covered by a tensioned membrane, played by plucking or striking the strings with fingers, picks, or a plectrum.&lt;ref&gt;''Collins English Dictionary: Complete &amp; Unabridged''. 2012 digital ed., HarperCollins Publishers, 2012.&lt;/ref&gt; Banjo playing is associated with a fast arpeggiated plucking, though many different playing styles are popular.

The most common of them is the 5-string banjo, usually for playing bluegrass, folk, or old-time music. The next most common is the 4-string tenor banjo, usually for playing Irish traditional music or jazz. Many other hybrid and modified versions of the banjo exist including banjitar, gourd banjo, long neck banjo, and more.

''To read more on the etymology, history, and types of banjos, I recommend the &quot;Banjo - Wikipedia&quot;[https://en.wikipedia.org/wiki/Banjo] website.''

== Types of Banjos ==

=== 5-String Banjo ===
The standard 5-string banjo is defined by four strings tuned at the headstock, and a fifth string that is the same gauge as the first, but starts from the fifth fret, three-quarters the length of the other strings. It would have 22 frets along a length of between 25.5-27 inches. This often will come with a removable resonator allowing the instrument to be configured either as a resonator banjo or as an open-back banjo.

The most common playing styles include clawhammer, three-finger bluegrass, melodic (keith) style, and chromatic style.

==== Long neck banjos ====
The long-neck banjo is a variant of the standard 5-string banjo having an extended neck with three additional frets, allowing the instrument to be played in lower pitch ranges while retaining standard banjo tuning relationships. The scale length can range from 28-32 inches.

This instrument was invented by Pete Seeger in 1944 when he had a luthier, John D'Angelico, modify his banjo to add two extra frets. That banjo would be stolen a five years later and he would commission one with three extra frets which he would popularize throughout the 1950's and 60's folk scene.&lt;ref&gt;{{Cite web|url=https://banjonews.com/2014-03/the_seeger_long_neck_americas_third_banjo.html|title=Banjo Newsletter|website=banjonews.com|access-date=2026-05-16}}&lt;/ref&gt;

=== 4-String Tenor Banjo ===
The four-string plectrum banjo is a standard banjo without the short drone string, consisting of the same number of frets and neck size. This banjo is usually played with a guitar-like pick.

=== Banjo Hybrids and Variations ===
Most banjo hybrids combine the acoustic drum-head of a banjo with the playing and tuning style of the different instrument. These include the guitar banjo (banjitar), mandolin banjo (banjolin), ukelele banjo (banjolele), dobro banjo (dojo), cello banjo (celljo), bass banjo (bassjo), lute banjo, the electric banjo, and even a violin banjo. Bands and orchestras consisting of banjo-like instruments were at it's peak in the 1920's.

A canjo is a single string musical instrument that can be easily made at home. It typically consists of a simple wooden dowel or board with a single string, a tuner at the top, and an empty can mounted at the bottom.

The gourd banjo and mountain banjos are also considered variations

== Techniques and Styles ==</text>
      <sha1>tq0ntrw9qtb86q251b9a14t86yng5fq</sha1>
    </revision>
    <revision>
      <id>2809734</id>
      <parentid>2809712</parentid>
      <timestamp>2026-05-16T19:31:29Z</timestamp>
      <contributor>
        <username>Kirby - Electrotechnics</username>
        <id>3074947</id>
      </contributor>
      <minor />
      <comment>Sources, Grammar, Headings</comment>
      <origin>2809734</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="3418" sha1="nqchdjcxbmxdqy8pf32z416y9ybho7t" xml:space="preserve">The '''Banjo''' is a stringed musical instrument with a long neck (commonly fretted) and a circular drum-like body covered by a tensioned membrane, played by plucking or striking the strings with fingers, picks, or a plectrum.&lt;ref&gt;''Collins English Dictionary: Complete &amp; Unabridged''. 2012 digital ed., HarperCollins Publishers, 2012.&lt;/ref&gt; Banjo playing is associated with a fast arpeggiated plucking, though many different playing styles are popular.

The most common of them is the 5-string banjo, usually for playing bluegrass, folk, or old-time music. The next most common is the 4-string tenor banjo, usually for playing Irish traditional music or jazz. Many other hybrid and modified versions of the banjo exist including banjitar, gourd banjo, long neck banjo, and more.

''To read more on the etymology, history, and types of banjos, I recommend the &quot;Banjo - Wikipedia&quot;[https://en.wikipedia.org/wiki/Banjo] website.''

== Types of Banjos ==

=== 5-String Banjo ===
The standard 5-string banjo is defined by four strings tuned at the headstock, and a fifth string that is the same gauge as the first, but starts from the fifth fret, three-quarters the length of the other strings. It would have 22 frets along a length of between 25.5-27 inches. This often will come with a removable resonator allowing the instrument to be configured either as a resonator banjo or as an open-back banjo.

The most common playing styles include clawhammer, three-finger bluegrass, melodic (keith) style, and chromatic style.

==== Long neck banjos ====
The long-neck banjo is a variant of the standard 5-string banjo having an extended neck with three additional frets, allowing the instrument to be played in lower pitch ranges while retaining standard banjo tuning relationships. The scale length can range from 28-32 inches.

This instrument was invented by Pete Seeger in 1944 when he had a luthier, John D'Angelico, modify his banjo to add two extra frets. That banjo would be stolen a five years later and he would commission one with three extra frets which he would popularize throughout the 1950's and 60's folk scene.&lt;ref&gt;{{Cite web|url=https://banjonews.com/2014-03/the_seeger_long_neck_americas_third_banjo.html|title=Banjo Newsletter|website=banjonews.com|access-date=2026-05-16}}&lt;/ref&gt;

=== 4-String Tenor Banjo ===
The four-string plectrum banjo is a standard banjo without the short drone string, consisting of the same number of frets and neck size. This banjo is usually played with a guitar-like pick.

=== Banjo Hybrids and Variations ===
Most banjo hybrids combine the acoustic drum-head of a banjo with the playing and tuning style of the different instrument. These include the guitar banjo (banjitar), mandolin banjo (banjolin), ukelele banjo (banjolele), dobro banjo (dojo), cello banjo (celljo), bass banjo (bassjo), lute banjo, the electric banjo, and even a violin banjo. Bands and orchestras consisting of banjo-like instruments were at it's peak in the 1920's.

A canjo is a single string musical instrument that can be easily made at home. It typically consists of a simple wooden dowel or board with a single string, a tuner at the top, and an empty can mounted at the bottom.

The gourd banjo and mountain banjos are also considered variations.

== Techniques ==

* Frailing (Clawhammer, Round Peak)
* Fingerpicking (Scruggs Style, Two-finger, Melodic (Keith) Style, Chromatic)

== Sources ==</text>
      <sha1>nqchdjcxbmxdqy8pf32z416y9ybho7t</sha1>
    </revision>
    <revision>
      <id>2809826</id>
      <parentid>2809734</parentid>
      <timestamp>2026-05-17T03:35:24Z</timestamp>
      <contributor>
        <username>Koavf</username>
        <id>147</id>
      </contributor>
      <minor />
      <comment>added [[Category:Music instruments]] using [[Help:Gadget-HotCat|HotCat]]</comment>
      <origin>2809826</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="3450" sha1="78ti9j77qfox48qwm66ssr1dg2nfazq" xml:space="preserve">The '''Banjo''' is a stringed musical instrument with a long neck (commonly fretted) and a circular drum-like body covered by a tensioned membrane, played by plucking or striking the strings with fingers, picks, or a plectrum.&lt;ref&gt;''Collins English Dictionary: Complete &amp; Unabridged''. 2012 digital ed., HarperCollins Publishers, 2012.&lt;/ref&gt; Banjo playing is associated with a fast arpeggiated plucking, though many different playing styles are popular.

The most common of them is the 5-string banjo, usually for playing bluegrass, folk, or old-time music. The next most common is the 4-string tenor banjo, usually for playing Irish traditional music or jazz. Many other hybrid and modified versions of the banjo exist including banjitar, gourd banjo, long neck banjo, and more.

''To read more on the etymology, history, and types of banjos, I recommend the &quot;Banjo - Wikipedia&quot;[https://en.wikipedia.org/wiki/Banjo] website.''

== Types of Banjos ==

=== 5-String Banjo ===
The standard 5-string banjo is defined by four strings tuned at the headstock, and a fifth string that is the same gauge as the first, but starts from the fifth fret, three-quarters the length of the other strings. It would have 22 frets along a length of between 25.5-27 inches. This often will come with a removable resonator allowing the instrument to be configured either as a resonator banjo or as an open-back banjo.

The most common playing styles include clawhammer, three-finger bluegrass, melodic (keith) style, and chromatic style.

==== Long neck banjos ====
The long-neck banjo is a variant of the standard 5-string banjo having an extended neck with three additional frets, allowing the instrument to be played in lower pitch ranges while retaining standard banjo tuning relationships. The scale length can range from 28-32 inches.

This instrument was invented by Pete Seeger in 1944 when he had a luthier, John D'Angelico, modify his banjo to add two extra frets. That banjo would be stolen a five years later and he would commission one with three extra frets which he would popularize throughout the 1950's and 60's folk scene.&lt;ref&gt;{{Cite web|url=https://banjonews.com/2014-03/the_seeger_long_neck_americas_third_banjo.html|title=Banjo Newsletter|website=banjonews.com|access-date=2026-05-16}}&lt;/ref&gt;

=== 4-String Tenor Banjo ===
The four-string plectrum banjo is a standard banjo without the short drone string, consisting of the same number of frets and neck size. This banjo is usually played with a guitar-like pick.

=== Banjo Hybrids and Variations ===
Most banjo hybrids combine the acoustic drum-head of a banjo with the playing and tuning style of the different instrument. These include the guitar banjo (banjitar), mandolin banjo (banjolin), ukelele banjo (banjolele), dobro banjo (dojo), cello banjo (celljo), bass banjo (bassjo), lute banjo, the electric banjo, and even a violin banjo. Bands and orchestras consisting of banjo-like instruments were at it's peak in the 1920's.

A canjo is a single string musical instrument that can be easily made at home. It typically consists of a simple wooden dowel or board with a single string, a tuner at the top, and an empty can mounted at the bottom.

The gourd banjo and mountain banjos are also considered variations.

== Techniques ==

* Frailing (Clawhammer, Round Peak)
* Fingerpicking (Scruggs Style, Two-finger, Melodic (Keith) Style, Chromatic)

== Sources ==

[[Category:Music instruments]]</text>
      <sha1>78ti9j77qfox48qwm66ssr1dg2nfazq</sha1>
    </revision>
  </page>
  <page>
    <title>Talk:Amazon Web Services</title>
    <ns>1</ns>
    <id>329680</id>
    <revision>
      <id>2809735</id>
      <timestamp>2026-05-16T19:34:54Z</timestamp>
      <contributor>
        <username>~2026-29534-16</username>
        <id>3076751</id>
      </contributor>
      <comment>/* Amar samson */ new section</comment>
      <origin>2809735</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="155" sha1="afj4ep0solstxfjaw2v9wmnaa0y3032" xml:space="preserve">== Amar samson ==

amar [[Special:Contributions/&amp;#126;2026-29534-16|&amp;#126;2026-29534-16]] ([[User talk:&amp;#126;2026-29534-16|talk]]) 19:34, 16 May 2026 (UTC)</text>
      <sha1>afj4ep0solstxfjaw2v9wmnaa0y3032</sha1>
    </revision>
    <revision>
      <id>2809737</id>
      <parentid>2809735</parentid>
      <timestamp>2026-05-16T19:56:55Z</timestamp>
      <contributor>
        <username>Atcovi</username>
        <id>276019</id>
      </contributor>
      <minor />
      <comment>{{Talk header}}</comment>
      <origin>2809737</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="15" sha1="6ujz0t3lkt6jsf7d1r360l6l7wj3njb" xml:space="preserve">{{Talk header}}</text>
      <sha1>6ujz0t3lkt6jsf7d1r360l6l7wj3njb</sha1>
    </revision>
  </page>
  <page>
    <title>Template:Talk header/styles.css</title>
    <ns>10</ns>
    <id>329681</id>
    <revision>
      <id>2809738</id>
      <timestamp>2026-03-30T20:01:58Z</timestamp>
      <contributor>
        <username>w&gt;Mathglot</username>
        <id>0</id>
      </contributor>
      <comment>Restore .talkheader-newtopic.</comment>
      <origin>2809738</origin>
      <model>sanitized-css</model>
      <format>text/css</format>
      <text bytes="951" sha1="d77t4objkm94z3gfuz70k5u5u19vweu" xml:space="preserve">/* {{pp-template}} */
/* Talk header styles */
.talkheader {
	text-align: center;
}

.talkheader-body {
	display: flex;
}

.talkheader-help,
.talkheader-policies,
.talkheader-shortcuts {
	display: flex;
	align-items: center;
	padding: 0.1em;
}

.talkheader-help {
	flex: 2 1 auto;
	border: 1px solid #c0c090;
	background-color: var(--background-color-base, #ffffff);
	color: inherit;
}

.talkheader-policies {
	flex: 1 1 auto;
}

.talkheader-policies + .talkheader-policies {
	border-left: 1px solid #c0c090;
}

.talkheader-shortcuts {
	flex: 0 1 auto;
}

.talkheader-help &gt; *,
.talkheader-policies &gt; *,
.talkheader-shortcuts &gt; * {
	flex: 1 1 auto;
}

.talkheader-help ul,
.talkheader-policies ul {
	margin: 0.1em 0.8em 0 1.6em;
	text-align: left;
}

.talkheader-newtopic {
	text-align: center;
	font-weight: bold;
	list-style: none;
	list-style-position: outside; /* the default */
}

@media (min-width: 720px) {
	.talkheader {
		min-width: 80%;
	}
}</text>
      <sha1>d77t4objkm94z3gfuz70k5u5u19vweu</sha1>
    </revision>
    <revision>
      <id>2809739</id>
      <parentid>2809738</parentid>
      <timestamp>2026-05-16T20:10:11Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <minor />
      <comment>1 revision imported from [[:w:Template:Talk_header/styles.css]]: Required to implement dark mode support on [[Template:Talk header]].</comment>
      <origin>2809738</origin>
      <model>sanitized-css</model>
      <format>text/css</format>
      <text bytes="951" sha1="d77t4objkm94z3gfuz70k5u5u19vweu" xml:space="preserve">/* {{pp-template}} */
/* Talk header styles */
.talkheader {
	text-align: center;
}

.talkheader-body {
	display: flex;
}

.talkheader-help,
.talkheader-policies,
.talkheader-shortcuts {
	display: flex;
	align-items: center;
	padding: 0.1em;
}

.talkheader-help {
	flex: 2 1 auto;
	border: 1px solid #c0c090;
	background-color: var(--background-color-base, #ffffff);
	color: inherit;
}

.talkheader-policies {
	flex: 1 1 auto;
}

.talkheader-policies + .talkheader-policies {
	border-left: 1px solid #c0c090;
}

.talkheader-shortcuts {
	flex: 0 1 auto;
}

.talkheader-help &gt; *,
.talkheader-policies &gt; *,
.talkheader-shortcuts &gt; * {
	flex: 1 1 auto;
}

.talkheader-help ul,
.talkheader-policies ul {
	margin: 0.1em 0.8em 0 1.6em;
	text-align: left;
}

.talkheader-newtopic {
	text-align: center;
	font-weight: bold;
	list-style: none;
	list-style-position: outside; /* the default */
}

@media (min-width: 720px) {
	.talkheader {
		min-width: 80%;
	}
}</text>
      <sha1>d77t4objkm94z3gfuz70k5u5u19vweu</sha1>
    </revision>
    <revision>
      <id>2809741</id>
      <parentid>2809739</parentid>
      <timestamp>2026-05-16T20:15:30Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <minor />
      <comment>Protected &quot;[[Template:Talk header/styles.css]]&quot;: Matching the parent protection as the template. ([Edit=Allow only autoconfirmed users] (indefinite) [Move=Allow only autoconfirmed users] (indefinite))</comment>
      <origin>2809738</origin>
      <model>sanitized-css</model>
      <format>text/css</format>
      <text bytes="951" sha1="d77t4objkm94z3gfuz70k5u5u19vweu" xml:space="preserve">/* {{pp-template}} */
/* Talk header styles */
.talkheader {
	text-align: center;
}

.talkheader-body {
	display: flex;
}

.talkheader-help,
.talkheader-policies,
.talkheader-shortcuts {
	display: flex;
	align-items: center;
	padding: 0.1em;
}

.talkheader-help {
	flex: 2 1 auto;
	border: 1px solid #c0c090;
	background-color: var(--background-color-base, #ffffff);
	color: inherit;
}

.talkheader-policies {
	flex: 1 1 auto;
}

.talkheader-policies + .talkheader-policies {
	border-left: 1px solid #c0c090;
}

.talkheader-shortcuts {
	flex: 0 1 auto;
}

.talkheader-help &gt; *,
.talkheader-policies &gt; *,
.talkheader-shortcuts &gt; * {
	flex: 1 1 auto;
}

.talkheader-help ul,
.talkheader-policies ul {
	margin: 0.1em 0.8em 0 1.6em;
	text-align: left;
}

.talkheader-newtopic {
	text-align: center;
	font-weight: bold;
	list-style: none;
	list-style-position: outside; /* the default */
}

@media (min-width: 720px) {
	.talkheader {
		min-width: 80%;
	}
}</text>
      <sha1>d77t4objkm94z3gfuz70k5u5u19vweu</sha1>
    </revision>
  </page>
  <page>
    <title>Main Page/News</title>
    <ns>0</ns>
    <id>329682</id>
    <redirect title="Wikiversity:Main Page/News" />
    <revision>
      <id>2809744</id>
      <timestamp>2026-05-16T20:17:42Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>Codename Noreste moved page [[Main Page/News]] to [[Wikiversity:Main Page/News]]: To maintain consistency with the other Main Page templates.</comment>
      <origin>2809744</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="40" sha1="c9yogyhkbvo5kslboz4z45or9n5knxq" xml:space="preserve">#REDIRECT [[Wikiversity:Main Page/News]]</text>
      <sha1>c9yogyhkbvo5kslboz4z45or9n5knxq</sha1>
    </revision>
  </page>
  <page>
    <title>Talk:Main Page/News</title>
    <ns>1</ns>
    <id>329683</id>
    <redirect title="Wikiversity talk:Main Page/News" />
    <revision>
      <id>2809746</id>
      <timestamp>2026-05-16T20:17:42Z</timestamp>
      <contributor>
        <username>Codename Noreste</username>
        <id>2969951</id>
      </contributor>
      <comment>Codename Noreste moved page [[Talk:Main Page/News]] to [[Wikiversity talk:Main Page/News]]: To maintain consistency with the other Main Page templates.</comment>
      <origin>2809746</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="45" sha1="7cxf3gzn41blk8e36r82ma3rlhvd2hh" xml:space="preserve">#REDIRECT [[Wikiversity talk:Main Page/News]]</text>
      <sha1>7cxf3gzn41blk8e36r82ma3rlhvd2hh</sha1>
    </revision>
  </page>
  <page>
    <title>User:Kirby - Electrotechnics</title>
    <ns>2</ns>
    <id>329684</id>
    <revision>
      <id>2809754</id>
      <timestamp>2026-05-16T21:40:36Z</timestamp>
      <contributor>
        <username>Kirby - Electrotechnics</username>
        <id>3074947</id>
      </contributor>
      <comment>Self Biography</comment>
      <origin>2809754</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="368" sha1="f2pqau3ruhvnbtikcq6rkoh7lv9ys88" xml:space="preserve">Hello, I am a student motivated by making self-learning easier for others. My interests are split between the electrical engineering disciplines of electronics repair &amp; design, and American folk/historical music. I play and am studying the banjo and mandolin, and hope to share well-organized pages for people to learn from and know what they want to research further.</text>
      <sha1>f2pqau3ruhvnbtikcq6rkoh7lv9ys88</sha1>
    </revision>
  </page>
  <page>
    <title>Talk:Digital Media Concepts/Roblox Tower Defense Genre</title>
    <ns>1</ns>
    <id>329685</id>
    <revision>
      <id>2809773</id>
      <timestamp>2026-05-16T23:07:56Z</timestamp>
      <contributor>
        <username>~2026-29541-24</username>
        <id>3076822</id>
      </contributor>
      <comment>/* Liminal rooms roblox */ new section</comment>
      <origin>2809773</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="166" sha1="djsgduufirn6mf0e60rbwxdq0gftqsj" xml:space="preserve">== Liminal rooms roblox ==

roblox [[Special:Contributions/&amp;#126;2026-29541-24|&amp;#126;2026-29541-24]] ([[User talk:&amp;#126;2026-29541-24|talk]]) 23:07, 16 May 2026 (UTC)</text>
      <sha1>djsgduufirn6mf0e60rbwxdq0gftqsj</sha1>
    </revision>
    <revision>
      <id>2809775</id>
      <parentid>2809773</parentid>
      <timestamp>2026-05-16T23:09:42Z</timestamp>
      <contributor>
        <username>~2026-29541-24</username>
        <id>3076822</id>
      </contributor>
      <comment>/* Liminal rooms */ new section</comment>
      <origin>2809775</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="335" sha1="qfvgvnangdak8hj2wbrs867u1szrwvf" xml:space="preserve">== Liminal rooms roblox ==

roblox [[Special:Contributions/&amp;#126;2026-29541-24|&amp;#126;2026-29541-24]] ([[User talk:&amp;#126;2026-29541-24|talk]]) 23:07, 16 May 2026 (UTC)

== Liminal rooms ==

@liminal_rooms [[Special:Contributions/&amp;#126;2026-29541-24|&amp;#126;2026-29541-24]] ([[User talk:&amp;#126;2026-29541-24|talk]]) 23:09, 16 May 2026 (UTC)</text>
      <sha1>qfvgvnangdak8hj2wbrs867u1szrwvf</sha1>
    </revision>
    <revision>
      <id>2809814</id>
      <parentid>2809775</parentid>
      <timestamp>2026-05-17T02:20:33Z</timestamp>
      <contributor>
        <username>MathXplore</username>
        <id>2888076</id>
      </contributor>
      <comment>Reset talk page with [[:w:simple:User:DannyS712/Reset talk|reset talk]] (version 1.1)</comment>
      <origin>2809814</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="15" sha1="6ujz0t3lkt6jsf7d1r360l6l7wj3njb" xml:space="preserve">{{Talk header}}</text>
      <sha1>6ujz0t3lkt6jsf7d1r360l6l7wj3njb</sha1>
    </revision>
  </page>
  <page>
    <title>Motivation and emotion/Book/2027</title>
    <ns>0</ns>
    <id>329686</id>
    <revision>
      <id>2809778</id>
      <timestamp>2026-05-16T23:38:35Z</timestamp>
      <contributor>
        <username>Jtneill</username>
        <id>10242</id>
      </contributor>
      <comment>Created page with &quot;{{In progress}} ==Motivation== # [[/Veteran identity reconstruction and motivation/]] - How does identity reconstruction influence motivation during military-to-civilian transition? {{ME-By|User Name}}  ==Emotion==  ==Motivation and emotion==  [[Category:Motivation and emotion/Book]]&quot;</comment>
      <origin>2809778</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="284" sha1="2dnibn5n665byizxinyenebhjxeilgn" xml:space="preserve">{{In progress}}
==Motivation==
# [[/Veteran identity reconstruction and motivation/]] - How does identity reconstruction influence motivation during military-to-civilian transition? {{ME-By|User Name}}

==Emotion==

==Motivation and emotion==

[[Category:Motivation and emotion/Book]]</text>
      <sha1>2dnibn5n665byizxinyenebhjxeilgn</sha1>
    </revision>
  </page>
  <page>
    <title>File:CP.FileCntl.A.20260511.pdf</title>
    <ns>6</ns>
    <id>329687</id>
    <revision>
      <id>2809782</id>
      <timestamp>2026-05-17T01:01:14Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>{{Information
|Description=Copilot: File Control A. Overview (20260511 - 20260506)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}</comment>
      <origin>2809782</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="278" sha1="gcdg2o9gih2jwdr4aac90tuw6cdt9bz" xml:space="preserve">== Summary ==
{{Information
|Description=Copilot: File Control A. Overview (20260511 - 20260506)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}

== Licensing ==
{{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}</text>
      <sha1>gcdg2o9gih2jwdr4aac90tuw6cdt9bz</sha1>
    </revision>
  </page>
  <page>
    <title>File:CP.FileCntl.A.20260512.pdf</title>
    <ns>6</ns>
    <id>329688</id>
    <revision>
      <id>2809784</id>
      <timestamp>2026-05-17T01:02:07Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>{{Information
|Description=Copilot: File Control A. Overview (20260512 - 20260511)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}</comment>
      <origin>2809784</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="278" sha1="gv0pecjh0d8wqisc5bzmzpwponq4b25" xml:space="preserve">== Summary ==
{{Information
|Description=Copilot: File Control A. Overview (20260512 - 20260511)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}

== Licensing ==
{{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}</text>
      <sha1>gv0pecjh0d8wqisc5bzmzpwponq4b25</sha1>
    </revision>
    <revision>
      <id>2809794</id>
      <parentid>2809784</parentid>
      <timestamp>2026-05-17T01:07:59Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>/* Summary */</comment>
      <origin>2809794</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="254" sha1="855vlrbxivagkf67e6kjs6y0rjzz1s5" xml:space="preserve">== Summary ==
{{Information
|Description=FF Timing (20260512 - 20260511)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}

== Licensing ==
{{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}</text>
      <sha1>855vlrbxivagkf67e6kjs6y0rjzz1s5</sha1>
    </revision>
    <revision>
      <id>2809796</id>
      <parentid>2809794</parentid>
      <timestamp>2026-05-17T01:09:04Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>/* Summary */</comment>
      <origin>2809796</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="265" sha1="i8aaeynq8nduy2t21iq22apu3km64vm" xml:space="preserve">== Summary ==
{{Information
|Description=FF Timing (20260512 - 20260511) Wrong file
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}

== Licensing ==
{{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}</text>
      <sha1>i8aaeynq8nduy2t21iq22apu3km64vm</sha1>
    </revision>
  </page>
  <page>
    <title>File:Sample.TappedDelay.20260511.pdf</title>
    <ns>6</ns>
    <id>329689</id>
    <revision>
      <id>2809786</id>
      <timestamp>2026-05-17T01:03:51Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>{{Information
|Description=Sample: Tapped Delay (20260511 - 20260506)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}</comment>
      <origin>2809786</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="265" sha1="6pl25zr7uc5aqdixgy72c923964u1hq" xml:space="preserve">== Summary ==
{{Information
|Description=Sample: Tapped Delay (20260511 - 20260506)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}

== Licensing ==
{{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}</text>
      <sha1>6pl25zr7uc5aqdixgy72c923964u1hq</sha1>
    </revision>
  </page>
  <page>
    <title>File:Sample.TappedDelay.20260512.pdf</title>
    <ns>6</ns>
    <id>329690</id>
    <revision>
      <id>2809789</id>
      <timestamp>2026-05-17T01:04:56Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>{{Information
|Description=Sample: Tapped Delay (20260512 - 20260511)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}</comment>
      <origin>2809789</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="265" sha1="ibispobnj502bovucd6y7396wq43hu2" xml:space="preserve">== Summary ==
{{Information
|Description=Sample: Tapped Delay (20260512 - 20260511)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}

== Licensing ==
{{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}</text>
      <sha1>ibispobnj502bovucd6y7396wq43hu2</sha1>
    </revision>
  </page>
  <page>
    <title>File:DD3.A5.FFTiming.20260511.pdf</title>
    <ns>6</ns>
    <id>329691</id>
    <revision>
      <id>2809792</id>
      <timestamp>2026-05-17T01:06:30Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>{{Information
|Description=FF Timing (20260511 - 20260506)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}</comment>
      <origin>2809792</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="254" sha1="tef3gd1ojq2mckgw8czpuun87cd4hin" xml:space="preserve">== Summary ==
{{Information
|Description=FF Timing (20260511 - 20260506)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}

== Licensing ==
{{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}</text>
      <sha1>tef3gd1ojq2mckgw8czpuun87cd4hin</sha1>
    </revision>
  </page>
  <page>
    <title>File:DD3.A5.FFTiming.20260512.pdf</title>
    <ns>6</ns>
    <id>329692</id>
    <revision>
      <id>2809798</id>
      <timestamp>2026-05-17T01:13:55Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>{{Information
|Description=FF Timing (20260512 - 20260511)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}</comment>
      <origin>2809798</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="254" sha1="855vlrbxivagkf67e6kjs6y0rjzz1s5" xml:space="preserve">== Summary ==
{{Information
|Description=FF Timing (20260512 - 20260511)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}

== Licensing ==
{{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}</text>
      <sha1>855vlrbxivagkf67e6kjs6y0rjzz1s5</sha1>
    </revision>
  </page>
  <page>
    <title>File:CP.FileCntl.A.20260511-1.pdf</title>
    <ns>6</ns>
    <id>329693</id>
    <revision>
      <id>2809800</id>
      <timestamp>2026-05-17T01:15:55Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>{{Information
|Description=Copilot: File Control A. Overview (20260511 - 20260506)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}</comment>
      <origin>2809800</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="278" sha1="gcdg2o9gih2jwdr4aac90tuw6cdt9bz" xml:space="preserve">== Summary ==
{{Information
|Description=Copilot: File Control A. Overview (20260511 - 20260506)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}

== Licensing ==
{{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}</text>
      <sha1>gcdg2o9gih2jwdr4aac90tuw6cdt9bz</sha1>
    </revision>
  </page>
  <page>
    <title>File:CP.FileCntl.A.20260512-1.pdf</title>
    <ns>6</ns>
    <id>329694</id>
    <revision>
      <id>2809802</id>
      <timestamp>2026-05-17T01:16:54Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>{{Information
|Description=Copilot: File Control A. Overview (20260512 - 20260511)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}</comment>
      <origin>2809802</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="278" sha1="gv0pecjh0d8wqisc5bzmzpwponq4b25" xml:space="preserve">== Summary ==
{{Information
|Description=Copilot: File Control A. Overview (20260512 - 20260511)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}
}}

== Licensing ==
{{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}</text>
      <sha1>gv0pecjh0d8wqisc5bzmzpwponq4b25</sha1>
    </revision>
  </page>
  <page>
    <title>File:NM.NLE.2Newton.20260511.pdf</title>
    <ns>6</ns>
    <id>329695</id>
    <revision>
      <id>2809804</id>
      <timestamp>2026-05-17T01:27:50Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>{{Information
|Description=2. Newton-Raphson Method (20260511 - 20260430)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-3.0,2.5,2.0,1.0}}
}}</comment>
      <origin>2809804</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="265" sha1="6j5zb3fzpmg2bu2m8pqd1i61uf5qkhm" xml:space="preserve">== Summary ==
{{Information
|Description=2. Newton-Raphson Method (20260511 - 20260430)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-3.0,2.5,2.0,1.0}}
}}

== Licensing ==
{{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}</text>
      <sha1>6j5zb3fzpmg2bu2m8pqd1i61uf5qkhm</sha1>
    </revision>
  </page>
  <page>
    <title>File:NM.NLE.2Newton.20260512.pdf</title>
    <ns>6</ns>
    <id>329696</id>
    <revision>
      <id>2809806</id>
      <timestamp>2026-05-17T01:28:35Z</timestamp>
      <contributor>
        <username>Young1lim</username>
        <id>21186</id>
      </contributor>
      <comment>{{Information
|Description=2. Newton-Raphson Method (20260512 - 20260511)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-3.0,2.5,2.0,1.0}}
}}</comment>
      <origin>2809806</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="265" sha1="pr1hmhc0wmo9ksllwvbjnqys8518mxj" xml:space="preserve">== Summary ==
{{Information
|Description=2. Newton-Raphson Method (20260512 - 20260511)
|Source={{own|Young1lim}}
|Date=2026-05-16
|Author=Young W. Lim
|Permission={{self|GFDL|cc-by-sa-3.0,2.5,2.0,1.0}}
}}

== Licensing ==
{{self|GFDL|cc-by-sa-4.0,3.0,2.5,2.0,1.0}}</text>
      <sha1>pr1hmhc0wmo9ksllwvbjnqys8518mxj</sha1>
    </revision>
  </page>
  <page>
    <title>User talk:~2026-29541-24</title>
    <ns>3</ns>
    <id>329697</id>
    <revision>
      <id>2809816</id>
      <timestamp>2026-05-17T02:21:09Z</timestamp>
      <contributor>
        <username>MathXplore</username>
        <id>2888076</id>
      </contributor>
      <comment>vandalism1 ([[m:User:ZbVl/VD|Vandoom]])</comment>
      <origin>2809816</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="566" sha1="lgjkgrrkjc8gh4emq3xd5ea09slfpgc" xml:space="preserve">

== 2026-05-17 ==
[[File:Information.svg|25px|alt=Information icon]] Hello, I’m letting you know that one or more of your recent contributions have been reverted because they did not appear constructive. If you would like to experiment, please use the [[Wikiversity:Sandbox|sandbox]] or ask for assistance at the [[Wikiversity:Colloquium|Colloquium]]. Thank you.&lt;!-- Glow-vandalism1 @ 1778984470638.7s --&gt;&lt;nowiki&gt;&lt;/nowiki&gt; [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 02:21, 17 May 2026 (UTC)</text>
      <sha1>lgjkgrrkjc8gh4emq3xd5ea09slfpgc</sha1>
    </revision>
  </page>
  <page>
    <title>User:HenriPittier</title>
    <ns>2</ns>
    <id>329698</id>
    <revision>
      <id>2809830</id>
      <timestamp>2026-05-17T03:43:24Z</timestamp>
      <contributor>
        <username>HenriPittier</username>
        <id>3076895</id>
      </contributor>
      <comment>Created page with &quot;HenriPitter&quot;</comment>
      <origin>2809830</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="11" sha1="c7fx9nncio5c0nsz5lrpdzqkk9m6d1b" xml:space="preserve">HenriPitter</text>
      <sha1>c7fx9nncio5c0nsz5lrpdzqkk9m6d1b</sha1>
    </revision>
  </page>
  <page>
    <title>User talk:HenriPittier</title>
    <ns>3</ns>
    <id>329699</id>
    <revision>
      <id>2809831</id>
      <timestamp>2026-05-17T03:43:58Z</timestamp>
      <contributor>
        <username>HenriPittier</username>
        <id>3076895</id>
      </contributor>
      <comment>Created page with &quot;HenriPitter&quot;</comment>
      <origin>2809831</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="11" sha1="c7fx9nncio5c0nsz5lrpdzqkk9m6d1b" xml:space="preserve">HenriPitter</text>
      <sha1>c7fx9nncio5c0nsz5lrpdzqkk9m6d1b</sha1>
    </revision>
  </page>
  <page>
    <title>User:HenriPittier/sandbox</title>
    <ns>2</ns>
    <id>329700</id>
    <revision>
      <id>2809836</id>
      <timestamp>2026-05-17T03:52:45Z</timestamp>
      <contributor>
        <username>HenriPittier</username>
        <id>3076895</id>
      </contributor>
      <comment>Created page with &quot;Sandbox&quot;</comment>
      <origin>2809836</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="7" sha1="180b4o8webax01hgcc2r1q2f1sv2rus" xml:space="preserve">Sandbox</text>
      <sha1>180b4o8webax01hgcc2r1q2f1sv2rus</sha1>
    </revision>
  </page>
  <page>
    <title>User:MichaellaaRubio/sandbox</title>
    <ns>2</ns>
    <id>329701</id>
    <revision>
      <id>2809868</id>
      <timestamp>2026-05-17T04:42:19Z</timestamp>
      <contributor>
        <username>MichaellaaRubio</username>
        <id>3076903</id>
      </contributor>
      <comment>Added the steps for the business plan</comment>
      <origin>2809868</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="2186" sha1="e1yw1y2s1jcmal7zmpebroqgex81iie" xml:space="preserve">= Hiraya Pilipina Maintenance Plan by: Michaella Rubio =

=== Introduction: ===
Hiraya Pilipina is an advocacy-driven brand established in 2019, founded by Ms Cleo Loque at the age of 15 years old. Ever since this brand was launched, it continues to become a go to fashion and advocacy brand that consistently supports women. As the company continues to grow in the competitive e-commerce industry, maintaining a stable and protected information system becomes one of the most important responsibilities of the organization.

This maintenance and continuity plan is made to ensure that the business remains secured and prepared for unexpected technical problems. Ultimately, this document is not only created to prevent system failures but also to provide clear recovery procedures in case emergencies happen.
----

==== ''Step 1: Regular System Maintenance'' ====
The website, application used, and transaction system shall be monitored daily to prevent delays and technical errors. Every software updates and security patches shall also be installed regularly to keep the platform stable and protected from cyber threats.

==== ''Step 2: Data Backup and Recovery'' ====
Every important records such as customer orders, payment records, and inventory data shall be backed up every 6 hours and a full-blown backup shall also be performed weekly so that the company is assured that important information can still be recovered during system failures.

==== ''Step 3: Security Protection'' ====
Every employee accounts that are used to communicate with company details must use strong passwords and Two-Factor Authentication (2FA). Confidential and sensitive information shall only be accessed by authorized staff.

==== ''Step 4: Emergency Response Plan'' ====
If the system crashes, the IT Support Team shall immediately activate the backup server and begin data recovery procedures. Customers shall also be informed about service interruptions. For example, during large online sales like Shopee’s 11.11 or 12.12 events, sudden traffic overloads can cause temporary outages, which is why having a fast recovery and backup system is important to avoid losing sales and customer trust.</text>
      <sha1>e1yw1y2s1jcmal7zmpebroqgex81iie</sha1>
    </revision>
  </page>
  <page>
    <title>User:IgnorantObserver/sandbox</title>
    <ns>2</ns>
    <id>329702</id>
    <revision>
      <id>2809879</id>
      <timestamp>2026-05-17T09:21:44Z</timestamp>
      <contributor>
        <username>IgnorantObserver</username>
        <id>3076980</id>
      </contributor>
      <comment>Step 1/2: initial page creation in sandbox (external links to be added in follow-up edit). Authored by Aernoud Dekker.</comment>
      <origin>2809879</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="25635" sha1="iwru9fvd8i1tzqzgmf27wlm720la4sp" xml:space="preserve">&lt;!-- Step 1 of 2: page being created without external links to satisfy new-user AbuseFilter rule. Links will be added in a follow-up edit. --&gt;
&lt;!-- SANDBOX DRAFT — under review by author before main-namespace publication. --&gt;
{{User sandbox}}
{{Research project}}

= The Ignorant Observer Framework =

''This research page is authored and maintained by [[User:IgnorantObserver|Aernoud Dekker]], an independent researcher and the originator of the framework described below. Page text is offered for review, critique, and collaborative refinement under [[Wikiversity:Copyrights|Wikiversity's standard licence]].''

== Status ==

Research project under active development. The framework consists of an interlinked set of technical and interpretive documents published at ignorantobserver.xyz and archived on the Open Science Framework. The technical module ''Bandwidth-Limited Quantum Control'' (BLQC) sets out the framework's falsifiable experimental discriminator. The broader ''Ignorant Observer Framework'' (IOF) connects this technical core to questions in the foundations of quantum mechanics and the philosophy of mind. All work is single-authored.

== Summary ==

The Ignorant Observer Framework proposes that the conventional treatment of quantum measurement idealizes the measurement basis as stably available to the observer. The framework removes that idealization. It treats the measurement basis θ as a physical dynamical variable inside the apparatus, with its own causal history and its own information-production rate. Whether the apparatus can stably track θ is then a control-theoretic question, governed by an inequality between effective information-channel capacity and the basis-defining dynamics' entropy rate.

''Bandwidth-Limited Quantum Control'' (BLQC), the framework's technical module, derives — under the assumptions catalogued in the [[#Open objections|Open objections]] section below — a distinctive ''double-exponential'' visibility decay law and a corresponding falsifiable experimental signature: under variation of controller input power at clamped environmental temperature, the framework predicts that coherence time should ''lengthen'' with increasing power, the opposite of standard thermal decoherence. This sign-reversal is the central testable claim.

The framework as a whole also offers an interpretive extension that connects the technical proposal to existing positions in quantum foundations (Brukner, Rovelli's relational quantum mechanics) and to non-dual philosophy of mind (Advaita Vedānta). These interpretive elements are clearly fenced from the empirical core in [[#Philosophical interpretation|the relevant section below]]. What stands or falls with the experimental discriminator is the framework's specific physical mapping into these positions, not the positions themselves.

== Core question ==

''Can quantum visibility depend on finite observer or apparatus basis-tracking capacity, independently of, and distinguishably from, ordinary environmental decoherence?''

Phrased positively: if the classical degrees of freedom that define and maintain a measurement basis exhibit chaotic dynamics with positive Kolmogorov–Sinai entropy rate ''h''&lt;sub&gt;KS&lt;/sub&gt;, and if the effective information channel that constrains those degrees of freedom has capacity ''C''&lt;sub&gt;eff&lt;/sub&gt; insufficient to track them, does interference visibility decay in a functional form distinguishable from standard exponential or Gaussian dephasing — and does this decay respond to controller input power in a direction opposite to thermal decoherence?

== Technical proposal ==

The framework introduces the following quantities.

'''Effective channel capacity ''C''&lt;sub&gt;eff&lt;/sub&gt;''' (bits/s): the information rate available to the basis-tracking control loop, operationalised as
:''C''&lt;sub&gt;eff&lt;/sub&gt; = ''r'' · ''b'' · ''f''
with ''r'' the update rate (Hz), ''b'' the effective number of bits per update that constrain the basis variable θ, and ''f'' ∈ (0,1] the fraction of updates that genuinely constrain θ after overhead and latency. ''C''&lt;sub&gt;eff&lt;/sub&gt; is bounded above by the Landauer limit on the controller's actuation:
:''C''&lt;sub&gt;eff&lt;/sub&gt; ≤ ''P'' / (''k''&lt;sub&gt;B&lt;/sub&gt; ''T'' ln 2)
where ''P'' is controller input power and ''T'' is the temperature at which the controller operates.

'''Kolmogorov–Sinai entropy rate ''h''&lt;sub&gt;KS&lt;/sub&gt;''' (nats/s): the information-production rate of the classical degrees of freedom (voltage references, timing circuits, feedback loops) that define and maintain the measurement basis. For chaotic systems, ''h''&lt;sub&gt;KS&lt;/sub&gt; equals the sum of positive Lyapunov exponents (Pesin identity). It is estimated operationally from the exponential growth of one-step prediction error on logged controller states. The nats/s convention is used so that the deficit κ below combines ''h''&lt;sub&gt;KS&lt;/sub&gt; (nats/s) and ''C''&lt;sub&gt;eff&lt;/sub&gt; ln 2 (bits/s converted to nats/s) in consistent units; an equivalent all-bits form would be κ&lt;sub&gt;bits&lt;/sub&gt; = ''h''&lt;sub&gt;KS,bits&lt;/sub&gt; − ''C''&lt;sub&gt;eff&lt;/sub&gt;.

'''Ignorance rate κ''' (s&lt;sup&gt;−1&lt;/sup&gt;):
:κ = ''h''&lt;sub&gt;KS&lt;/sub&gt; − ''C''&lt;sub&gt;eff&lt;/sub&gt; · ln 2
The framework distinguishes two regimes. When κ &lt; 0 (''capacity-wins''), basis-tracking error stays bounded and standard quantum mechanics is recovered. When κ &gt; 0 (''chaos-wins''), the variance of the basis-tracking error grows exponentially in time as σ&lt;sub&gt;θ&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt;(''t'') = σ&lt;sub&gt;0&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt; e&lt;sup&gt;2κ''t''&lt;/sup&gt;.

'''Measured visibility ''V''(''t'')'''. Averaging the interference term cos(φ − θ) over a Gaussian distribution of basis-tracking error δθ ∼ ''N''(0, σ&lt;sub&gt;θ&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt;(''t'')) yields, in the small-angle regime,
:''V''(''t'') = exp(−½ σ&lt;sub&gt;0&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt; e&lt;sup&gt;2κ''t''&lt;/sup&gt;)
i.e. a ''double-exponential'' decay of visibility once the chaos-wins regime is entered.

'''Breakdown time ''t''&lt;sub&gt;break&lt;/sub&gt;'''. For a chosen visibility threshold ''V''*,
:''t''&lt;sub&gt;break&lt;/sub&gt; = (1 / 2κ) · ln(−2 ln ''V''* / σ&lt;sub&gt;0&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt;) for κ &gt; 0.
''t''&lt;sub&gt;break&lt;/sub&gt; is the framework's primary observable.

The technical derivation extends the Data-Rate Theorem of Nair &amp; Evans (2004) and Tatikonda &amp; Mitter (2004) from linear plants to nonlinear, chaotic systems by substituting ''h''&lt;sub&gt;KS&lt;/sub&gt; for the sum-of-positive-eigenvalues bound. This extension is an explicit assumption of the framework rather than a proven theorem (see [[#Open objections|Open objections]]).

== Experimental discriminator ==

The framework prescribes the following experimental protocol as its central falsifiable test.

'''Independent variable''': controller input power ''P''. The controller is the physical system whose state defines and maintains the measurement basis (e.g. an interferometer phase-locking loop, a qubit readout chain, the active feedback in a precision interferometer).

'''Held constant''': the environmental temperature ''T'' at which the controller operates, by independent active thermal feedback. Holding ''T'' constant while varying ''P'' is what distinguishes the framework's prediction from standard thermal decoherence (which depends on ''T'' and ignores ''P'').

'''Dependent variable''': the visibility-decay breakdown time ''t''&lt;sub&gt;break&lt;/sub&gt;, fitted to interference data at a chosen visibility threshold (e.g. ''V''* = 0.5).

'''Prediction''': ∂''t''&lt;sub&gt;break&lt;/sub&gt;/∂''P'' &gt; 0 at clamped ''T'', with the visibility curve ''V''(''t'') fitting the double-exponential form exp(−½ σ&lt;sub&gt;0&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt; e&lt;sup&gt;2κ''t''&lt;/sup&gt;) better than a standard exponential ''e''&lt;sup&gt;−Γ''t''&lt;/sup&gt; or Gaussian ''e''&lt;sup&gt;−γ''t''²&lt;/sup&gt;.

'''What would count as falsification'''. Any of the following null findings counts against the framework:
* ∂''t''&lt;sub&gt;break&lt;/sub&gt;/∂''P'' ≤ 0 at clamped ''T'' (i.e. increasing controller power does not extend, or shortens, coherence time);
* ''V''(''t'') fits a single-exponential or Gaussian dephasing law significantly better than the double-exponential form, in the regime where the framework predicts the double-exponential should dominate;
* ''t''&lt;sub&gt;break&lt;/sub&gt; scales with the gravitational self-energy timescale ''t''&lt;sub&gt;OR&lt;/sub&gt; ∝ ''s'' / ''m''&lt;sup&gt;2&lt;/sup&gt; (the [[Penrose interpretation of quantum mechanics|Penrose Objective Reduction]] prediction) rather than with ''C''&lt;sub&gt;eff&lt;/sub&gt;;
* ''C''&lt;sub&gt;eff&lt;/sub&gt; cannot be calibrated independently of ''t''&lt;sub&gt;break&lt;/sub&gt; (in which case the prediction would be unfalsifiable, which would itself count against the framework's experimental status).

The QGEM pathfinder is cited in the BLQC manuscript as one candidate testbed; superconducting-qubit readout chains and precision interferometer phase-locking loops are others.

== Relation to quantum foundations ==

The framework is connected to, and partly draws from, several existing positions in the foundations of quantum mechanics.

* '''Brukner's information-theoretic reconstructions''' provide a precedent for treating information limits as structural constraints in quantum theory.
* '''Relational Quantum Mechanics''' (Rovelli) takes measurement outcomes to be relative to an observer-system; the framework provides one possible mechanism (finite ''C''&lt;sub&gt;eff&lt;/sub&gt;) for what makes one observer's frame physically inequivalent to another's.
* '''Decoherence theory''' is not opposed by the framework. The framework's prediction sits beside ordinary environmental decoherence and is intended to be ''distinguishable'' from it by the sign-reversal under power variation; in the capacity-wins regime (κ &lt; 0) standard decoherence theory is recovered.
* '''Measurement-independence'''. Because the framework treats the measurement basis as a dynamical variable with its own causal history, if extended to Bell-type set-ups it appears to imply a structural violation of statistical measurement-independence. The framework's response to the conventional &quot;conspiracy&quot; objection against superdeterminism is to attribute the correlation to common causal past plus a global consistency constraint rather than to fine-tuned initial conditions. This response is philosophical rather than mathematical and the formal extension (including a no-signalling treatment) is itself an open question (see [[#Open objections|Open objections]]).
* '''Penrose Objective Reduction''' is treated as an ''orthogonal'' competing mechanism whose predicted ''t''&lt;sub&gt;OR&lt;/sub&gt; ∝ ''s'' / ''m''&lt;sup&gt;2&lt;/sup&gt; scaling can be experimentally distinguished from the framework's ''C''&lt;sub&gt;eff&lt;/sub&gt;-driven ''t''&lt;sub&gt;break&lt;/sub&gt;. The numerical proximity of the two timescales in the mesoscopic regime motivates the protocol described in the next section but is treated as a coincidence pending experimental evidence.

== Philosophical interpretation ==

''This section describes interpretive extensions of the framework that go beyond the empirical core. Nothing in this section is a load-bearing element of the experimental claim. If the experimental discriminator returns a null result, the claimed physical realization of these interpretive readings within the framework would fall. The interpretive positions themselves — Advaita Vedānta, relational quantum mechanics — do not stand or fall on an interferometry experiment; what stands or falls is the framework's specific physical mapping into them.''

A direct statement of the framework's interpretive position appears in ''The Hard Problem Dissolved — But Into What? A Critical Response to Carlo Rovelli's &quot;There Is No 'Hard Problem of Consciousness'&quot;'' (Dekker, May 2026). The response engages Rovelli's recent Noema essay, marks the substantial ground it shares with the framework, and identifies where the framework presses beyond Rovelli's deflationary physicalism toward a non-dual reading. Readers approaching the framework from philosophy of mind may find that essay the most accessible entry point.

The framework's interpretive layer is developed in dialogue with two existing positions.

The first is Carlo Rovelli's relational quantum mechanics. The framework can be read as supplying a candidate physical mechanism — the ''C''&lt;sub&gt;eff&lt;/sub&gt; versus ''h''&lt;sub&gt;KS&lt;/sub&gt; inequality — for what makes a measurement outcome relative to an observer rather than absolute. On this reading, the framework is a mechanistic specification of an idea that RQM leaves at the level of principle.

The second is the Advaita Vedānta tradition (Śaṅkara, Ramaṇa Mahaṛṣi), in which the apparent independence of the experiencing subject from the perceived world is treated as a structural feature of ignorance (''avidyā'') rather than a metaphysical fact. The framework's σ&lt;sub&gt;θ&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt;(''t'') — the growing basis-tracking error of an observer whose capacity is insufficient to track its own apparatus — admits a structural analogy with avidyā as the phenomenological self-opacity of an embodied subject. The framework neither asserts that this analogy is more than structural nor that any experimental result could confirm or refute Advaita as a philosophical position; it offers the analogy as a way of locating the framework within a non-dual reading of the measurement problem for readers who find that reading useful.

Readers who prefer to ignore both interpretive readings should be able to evaluate the framework's empirical content from the [[#Technical proposal|Technical proposal]] and [[#Experimental discriminator|Experimental discriminator]] sections alone.

A further speculative extension, ''The Creation of Duality'', asks whether space, time, objecthood, and gravity-like structure can themselves be read as features of a consistent finite-observer world-model, with a Bridge Ansatz ''E''&lt;sub&gt;G&lt;/sub&gt; = (π/2)ℏκ linking the deficit rate κ to a gravitational energy scale via Margolus–Levitin saturation. Its scientific status is contingent on the BLQC experimental discriminator; until then it is offered explicitly as speculation.

== Documents ==

The framework's documents are published at ignorantobserver.xyz. Direct links to the principal documents:

* '''Bandwidth-Limited Quantum Control''' — finite-rate phase-reference test in the Penrose-overlap regime. The framework's falsifiable experimental discriminator.
* '''The Ignorant Observer''' — main framework document. Physical formalization inspired by Advaita Vedanta's insight into ignorance.
* '''Comprehensive Experimental Protocol''' — preregistered prospective experiment discriminating a Penrose-style mass-geometry timescale from the BLQC capacity / instability timescale in the same mesoscopic apparatus.
* '''Forensic Signatures''' — retrospective screening of Chinese 63-qubit, Google Sycamore, and LIGO data for the double-exponential visibility decay signature predicted by BLQC. Motivating evidence for treating LIGO as a candidate regime; not causal attribution. Detailed findings and caveats are discussed in [[#Open objections|Open objections]].
* '''The Capacity–Backaction Frontier''' — application to cryogenic quantum error correction. Defines an operational coordinate ρ&lt;sub&gt;CB&lt;/sub&gt; = ε&lt;sub&gt;QEC&lt;/sub&gt; ''C''&lt;sub&gt;eff&lt;/sub&gt; ln 2 / ''h''&lt;sub&gt;eff&lt;/sub&gt;(''N'', ''C''&lt;sub&gt;eff&lt;/sub&gt;) comparing useful syndrome capacity against the physical instability induced by obtaining and using it.
* '''Concise Mathematical Summary''' — shortest formal map of the IOF variables and BLQC test regimes.
* '''Questions and Answers (IOF)''' — common questions on the framework addressed in depth.
* '''Scientific Editorial Assessment''' — overview of the project architecture, explaining why BLQC is the technical hinge and how the philosophical and cosmological documents should be read conditionally.

A full archival deposit of the framework's documents is also available on the Open Science Framework at doi.org/10.17605/OSF.IO/FCDSN.

== Open objections ==

The following objections to the framework are listed openly so that reviewers can engage with them directly. Several are diagnosed in the framework's own manuscripts; others reflect critiques the author has received in correspondence or anticipates from sophisticated readers. They are deliberately phrased from outside the framework's assumptions, not from within them.

# '''Useful capacity versus thermodynamic bound'''. The framework uses the Landauer expression ''C'' ≤ ''P'' / (''k''&lt;sub&gt;B&lt;/sub&gt; ''T'' ln 2) to relate controller input power ''P'' to channel capacity. Landauer is an ideal upper bound on bit-erasure cost; it does not guarantee that increased ''P'' actually translates to increased ''useful'' basis-tracking capacity. Additional power can equally well couple to actuator noise, electromagnetic leakage, vibration, or backaction channels that do not constrain the basis variable θ. Establishing that Δ''P'' → Δ''C''&lt;sub&gt;eff&lt;/sub&gt; in the predicted direction — with realistic loss budgets for the candidate apparatus — is a substantive engineering claim that the framework does not by itself establish.
# '''Existence of positive ''h''&lt;sub&gt;KS&lt;/sub&gt; in engineered apparatus'''. Many precision controllers (phase-locked loops, qubit readout chains, interferometer servo systems) are explicitly engineered to suppress chaotic dynamics. The basis-defining degrees of freedom may exhibit colored noise, slow drift, or stochastic control error rather than positive-''h''&lt;sub&gt;KS&lt;/sub&gt; chaos in the Pesin sense. If the relevant dynamics are not chaotic in this sense, the ''h''&lt;sub&gt;KS&lt;/sub&gt; framing may not apply at all, and a different rate-distortion accounting (or none) would be needed. Even where positive ''h''&lt;sub&gt;KS&lt;/sub&gt; can be identified, the operationally relevant rate may differ substantially from textbook surrogate estimates (kicked rotor, logistic map) used illustratively in the manuscripts.
# '''Rate-distortion extension to nonlinear / chaotic systems'''. The mapping from channel capacity ''C'' to angular tracking variance σ&lt;sub&gt;θ&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt; ≥ ''D''/(''C'' ln 2) assumes a high-rate coder model and the framework extends the Data-Rate Theorem from linear plants to nonlinear chaotic systems by substituting ''h''&lt;sub&gt;KS&lt;/sub&gt;. This extension is an explicit assumption, not a proven theorem. If the extension fails, the closed-form visibility law and the κ-regime structure both lose their derivation.
# '''Gaussian small-angle assumption'''. The visibility expression ''V''(''t'') = exp(−½ σ&lt;sub&gt;θ&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt;) requires σ&lt;sub&gt;θ&lt;/sub&gt; ≲ 1 rad and a Gaussian basis-tracking error distribution. Non-Gaussian, heavy-tailed, or state-dependent δθ would break the closed-form double-exponential law.
# '''Decoherence and control-noise confound'''. Distinguishing the predicted visibility loss from ordinary environmental dephasing, alignment drift, and detector systematics is the central experimental challenge. The framework's answer is the sign-reversal under power variation at clamped ''T'' — a conceptually clean discriminator that is engineering-hard to realise. Independent calibration of ''C''&lt;sub&gt;eff&lt;/sub&gt; may be the single largest practical hurdle.
# '''Prior-art and reparameterization risk'''. The proposed double-exponential visibility signature may already be expressible within existing frameworks: compound dephasing channels with two or more contributing rates, classical feedback-loop instability, or hidden-variable control-noise models with appropriate parameter choices. The framework should be able to show that its prediction is genuinely new rather than a reparameterization of one of these known phenomena. The author's adversarial-mimic analysis is in progress, and a positive result on that front would substantially strengthen the framework's empirical claim.
# '''Bell / locality consistency'''. The framework implies a structural violation of statistical measurement-independence. The author's response (common causal past plus global consistency, in place of fine-tuned initial conditions) is a philosophical reframing rather than a no-signalling lemma. A proper consistency proof has not been published.
# '''Forensic-signature interpretation'''. The Forensic Signatures preprint applies a screening protocol to existing data from Chinese 63-qubit processors, Google Sycamore, and LIGO glitch records. The paper's own domain-of-validity statement is that BLQC applies in observer-limited rather than plant-limited regimes, and the protocol finds power-law dominance on the qubit datasets (consistent with that statement) and 43% Gompertz-consistent events on LIGO (consistent with BLQC). The paper flags a controller-regime confound for the LIGO result and is explicit that retrospective findings do not establish causal attribution to BLQC; the case rests on the prospective controlled-capacity experiment. The objection here is the standard one for retrospective signal analyses: even where the predicted geometry is present, it remains compatible with alternative explanations until the controlled experiment runs.
# '''Observer language'''. The framework's &quot;observer&quot; plays two distinct roles: the physical apparatus / controller whose finite ''C''&lt;sub&gt;eff&lt;/sub&gt; and ''h''&lt;sub&gt;KS&lt;/sub&gt; appear in the equations, and the epistemic subject for whom measurement outcomes are or are not determinate. The framework treats these as connected but not identified, and the distinction is load-bearing. Critics will reasonably worry — especially given the framework's interpretive engagement with non-dual philosophy and the philosophy of mind — that consciousness is being smuggled into the foundations of measurement under physical vocabulary. The framework's defence is that the BLQC experimental claim is stated entirely in apparatus-level terms; whether that defence holds depends on the framework keeping the two senses of &quot;observer&quot; rigorously separate.
# '''Interpretive vocabulary'''. Some of the framework's documents draw on vocabulary from philosophy of mind and non-dual philosophy (notably Advaita Vedānta) alongside the physical derivations. Readers who find this vocabulary off-putting are invited to evaluate the empirical content from the BLQC manuscript, which uses only standard physics and control-theory language.
# '''Peer-review status and independent replication'''. The framework has not yet undergone peer review, and the experimental discriminator has not been independently replicated. This is the actual current epistemic status of the work. The framework's case must be evaluated on its merits in the documents linked above and on the conduct of the prospective experiment, not on any external imprimatur.

== Invitation for review ==

This page is offered as a venue for substantive critique. The author is particularly interested in engagement on the following:

* '''From physicists working on quantum control or precision interferometry''': is the proposed sign-reversal under controller-power variation at clamped temperature genuinely distinguishable from known instrumental artefacts (closed-loop resonances, thermal-noise mismodelling, photon-shot-noise rebalancing at higher gain), and what existing apparatus would be best positioned to perform the test?
* '''From decoherence theorists''': under what conditions does the proposed double-exponential visibility law overlap with compound-channel decoherence models in ways that would make the two empirically indistinguishable? Is there a parameter regime where the framework's prediction is genuinely new rather than a reparameterisation of existing models?
* '''From researchers in the foundations of quantum mechanics''': how should the framework's structural violation of measurement-independence be evaluated against the alternatives in the superdeterminism / retrocausality / many-worlds landscape, and what would constitute a satisfactory consistency proof?
* '''From philosophers of mind''': the Advaita / RQM interpretive layer is offered conditionally on the empirical core. Is the conditional structure (&quot;these readings are available ''if'' the empirical claim survives&quot;) presented clearly enough, or does it still amount to overreach?

Comments, references to prior or parallel work the author may not be aware of, and pointers to potential confounds or alternative explanations are all welcome. Substantive critique on the [[User talk:IgnorantObserver/sandbox|talk page]] will be acknowledged in subsequent revisions of the manuscripts.

== References ==

* Brukner, Č., &amp; Zeilinger, A. (1999). Operationally invariant information in quantum measurements. ''Physical Review Letters'', 83(17), 3354–3357.
* Nair, G. N., &amp; Evans, R. J. (2004). Stabilizability of stochastic linear systems with finite feedback data rates. ''SIAM Journal on Control and Optimization'', 43(2), 413–436.
* Penrose, R. (1996). On gravity's role in quantum state reduction. ''General Relativity and Gravitation'', 28(5), 581–600.
* Rovelli, C. (1996). Relational quantum mechanics. ''International Journal of Theoretical Physics'', 35(8), 1637–1678.
* Tatikonda, S., &amp; Mitter, S. (2004). Control under communication constraints. ''IEEE Transactions on Automatic Control'', 49(7), 1056–1068.

== See also ==

* [[w:Quantum decoherence|Decoherence]] (Wikipedia)
* [[w:Relational quantum mechanics|Relational quantum mechanics]] (Wikipedia)
* [[w:Penrose interpretation|Penrose interpretation]] (Wikipedia)
* [[w:Data-rate theorem|Data-rate theorem]] (Wikipedia)

&lt;!-- [[Category:Research projects]] --&gt;
&lt;!-- [[Category:Quantum mechanics]] --&gt;
&lt;!-- [[Category:Philosophy of physics]] --&gt;</text>
      <sha1>iwru9fvd8i1tzqzgmf27wlm720la4sp</sha1>
    </revision>
    <revision>
      <id>2809880</id>
      <parentid>2809879</parentid>
      <timestamp>2026-05-17T09:22:19Z</timestamp>
      <contributor>
        <username>IgnorantObserver</username>
        <id>3076980</id>
      </contributor>
      <comment>Update sandbox draft to full version with external links to source documents and references. Authored by Aernoud Dekker.</comment>
      <origin>2809880</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="26309" sha1="p11a07kozueggvoiine9w5kxyefobe9" xml:space="preserve">&lt;!-- SANDBOX DRAFT — under review by author before main-namespace publication. --&gt;
{{User sandbox}}
{{Research project}}

= The Ignorant Observer Framework =

''This research page is authored and maintained by [[User:IgnorantObserver|Aernoud Dekker]], an independent researcher and the originator of the framework described below. Page text is offered for review, critique, and collaborative refinement under [[Wikiversity:Copyrights|Wikiversity's standard licence]].''

== Status ==

Research project under active development. The framework consists of an interlinked set of technical and interpretive documents published at [https://ignorantobserver.xyz ignorantobserver.xyz] and archived on the [https://osf.io Open Science Framework]. The technical module ''Bandwidth-Limited Quantum Control'' (BLQC) sets out the framework's falsifiable experimental discriminator. The broader ''Ignorant Observer Framework'' (IOF) connects this technical core to questions in the foundations of quantum mechanics and the philosophy of mind. All work is single-authored.

== Summary ==

The Ignorant Observer Framework proposes that the conventional treatment of quantum measurement idealizes the measurement basis as stably available to the observer. The framework removes that idealization. It treats the measurement basis θ as a physical dynamical variable inside the apparatus, with its own causal history and its own information-production rate. Whether the apparatus can stably track θ is then a control-theoretic question, governed by an inequality between effective information-channel capacity and the basis-defining dynamics' entropy rate.

''Bandwidth-Limited Quantum Control'' (BLQC), the framework's technical module, derives — under the assumptions catalogued in the [[#Open objections|Open objections]] section below — a distinctive ''double-exponential'' visibility decay law and a corresponding falsifiable experimental signature: under variation of controller input power at clamped environmental temperature, the framework predicts that coherence time should ''lengthen'' with increasing power, the opposite of standard thermal decoherence. This sign-reversal is the central testable claim.

The framework as a whole also offers an interpretive extension that connects the technical proposal to existing positions in quantum foundations (Brukner, Rovelli's relational quantum mechanics) and to non-dual philosophy of mind (Advaita Vedānta). These interpretive elements are clearly fenced from the empirical core in [[#Philosophical interpretation|the relevant section below]]. What stands or falls with the experimental discriminator is the framework's specific physical mapping into these positions, not the positions themselves.

== Core question ==

''Can quantum visibility depend on finite observer or apparatus basis-tracking capacity, independently of, and distinguishably from, ordinary environmental decoherence?''

Phrased positively: if the classical degrees of freedom that define and maintain a measurement basis exhibit chaotic dynamics with positive Kolmogorov–Sinai entropy rate ''h''&lt;sub&gt;KS&lt;/sub&gt;, and if the effective information channel that constrains those degrees of freedom has capacity ''C''&lt;sub&gt;eff&lt;/sub&gt; insufficient to track them, does interference visibility decay in a functional form distinguishable from standard exponential or Gaussian dephasing — and does this decay respond to controller input power in a direction opposite to thermal decoherence?

== Technical proposal ==

The framework introduces the following quantities.

'''Effective channel capacity ''C''&lt;sub&gt;eff&lt;/sub&gt;''' (bits/s): the information rate available to the basis-tracking control loop, operationalised as
:''C''&lt;sub&gt;eff&lt;/sub&gt; = ''r'' · ''b'' · ''f''
with ''r'' the update rate (Hz), ''b'' the effective number of bits per update that constrain the basis variable θ, and ''f'' ∈ (0,1] the fraction of updates that genuinely constrain θ after overhead and latency. ''C''&lt;sub&gt;eff&lt;/sub&gt; is bounded above by the Landauer limit on the controller's actuation:
:''C''&lt;sub&gt;eff&lt;/sub&gt; ≤ ''P'' / (''k''&lt;sub&gt;B&lt;/sub&gt; ''T'' ln 2)
where ''P'' is controller input power and ''T'' is the temperature at which the controller operates.

'''Kolmogorov–Sinai entropy rate ''h''&lt;sub&gt;KS&lt;/sub&gt;''' (nats/s): the information-production rate of the classical degrees of freedom (voltage references, timing circuits, feedback loops) that define and maintain the measurement basis. For chaotic systems, ''h''&lt;sub&gt;KS&lt;/sub&gt; equals the sum of positive Lyapunov exponents (Pesin identity). It is estimated operationally from the exponential growth of one-step prediction error on logged controller states. The nats/s convention is used so that the deficit κ below combines ''h''&lt;sub&gt;KS&lt;/sub&gt; (nats/s) and ''C''&lt;sub&gt;eff&lt;/sub&gt; ln 2 (bits/s converted to nats/s) in consistent units; an equivalent all-bits form would be κ&lt;sub&gt;bits&lt;/sub&gt; = ''h''&lt;sub&gt;KS,bits&lt;/sub&gt; − ''C''&lt;sub&gt;eff&lt;/sub&gt;.

'''Ignorance rate κ''' (s&lt;sup&gt;−1&lt;/sup&gt;):
:κ = ''h''&lt;sub&gt;KS&lt;/sub&gt; − ''C''&lt;sub&gt;eff&lt;/sub&gt; · ln 2
The framework distinguishes two regimes. When κ &lt; 0 (''capacity-wins''), basis-tracking error stays bounded and standard quantum mechanics is recovered. When κ &gt; 0 (''chaos-wins''), the variance of the basis-tracking error grows exponentially in time as σ&lt;sub&gt;θ&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt;(''t'') = σ&lt;sub&gt;0&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt; e&lt;sup&gt;2κ''t''&lt;/sup&gt;.

'''Measured visibility ''V''(''t'')'''. Averaging the interference term cos(φ − θ) over a Gaussian distribution of basis-tracking error δθ ∼ ''N''(0, σ&lt;sub&gt;θ&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt;(''t'')) yields, in the small-angle regime,
:''V''(''t'') = exp(−½ σ&lt;sub&gt;0&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt; e&lt;sup&gt;2κ''t''&lt;/sup&gt;)
i.e. a ''double-exponential'' decay of visibility once the chaos-wins regime is entered.

'''Breakdown time ''t''&lt;sub&gt;break&lt;/sub&gt;'''. For a chosen visibility threshold ''V''*,
:''t''&lt;sub&gt;break&lt;/sub&gt; = (1 / 2κ) · ln(−2 ln ''V''* / σ&lt;sub&gt;0&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt;) for κ &gt; 0.
''t''&lt;sub&gt;break&lt;/sub&gt; is the framework's primary observable.

The technical derivation extends the Data-Rate Theorem of Nair &amp; Evans (2004) and Tatikonda &amp; Mitter (2004) from linear plants to nonlinear, chaotic systems by substituting ''h''&lt;sub&gt;KS&lt;/sub&gt; for the sum-of-positive-eigenvalues bound. This extension is an explicit assumption of the framework rather than a proven theorem (see [[#Open objections|Open objections]]).

== Experimental discriminator ==

The framework prescribes the following experimental protocol as its central falsifiable test.

'''Independent variable''': controller input power ''P''. The controller is the physical system whose state defines and maintains the measurement basis (e.g. an interferometer phase-locking loop, a qubit readout chain, the active feedback in a precision interferometer).

'''Held constant''': the environmental temperature ''T'' at which the controller operates, by independent active thermal feedback. Holding ''T'' constant while varying ''P'' is what distinguishes the framework's prediction from standard thermal decoherence (which depends on ''T'' and ignores ''P'').

'''Dependent variable''': the visibility-decay breakdown time ''t''&lt;sub&gt;break&lt;/sub&gt;, fitted to interference data at a chosen visibility threshold (e.g. ''V''* = 0.5).

'''Prediction''': ∂''t''&lt;sub&gt;break&lt;/sub&gt;/∂''P'' &gt; 0 at clamped ''T'', with the visibility curve ''V''(''t'') fitting the double-exponential form exp(−½ σ&lt;sub&gt;0&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt; e&lt;sup&gt;2κ''t''&lt;/sup&gt;) better than a standard exponential ''e''&lt;sup&gt;−Γ''t''&lt;/sup&gt; or Gaussian ''e''&lt;sup&gt;−γ''t''²&lt;/sup&gt;.

'''What would count as falsification'''. Any of the following null findings counts against the framework:
* ∂''t''&lt;sub&gt;break&lt;/sub&gt;/∂''P'' ≤ 0 at clamped ''T'' (i.e. increasing controller power does not extend, or shortens, coherence time);
* ''V''(''t'') fits a single-exponential or Gaussian dephasing law significantly better than the double-exponential form, in the regime where the framework predicts the double-exponential should dominate;
* ''t''&lt;sub&gt;break&lt;/sub&gt; scales with the gravitational self-energy timescale ''t''&lt;sub&gt;OR&lt;/sub&gt; ∝ ''s'' / ''m''&lt;sup&gt;2&lt;/sup&gt; (the [[Penrose interpretation of quantum mechanics|Penrose Objective Reduction]] prediction) rather than with ''C''&lt;sub&gt;eff&lt;/sub&gt;;
* ''C''&lt;sub&gt;eff&lt;/sub&gt; cannot be calibrated independently of ''t''&lt;sub&gt;break&lt;/sub&gt; (in which case the prediction would be unfalsifiable, which would itself count against the framework's experimental status).

The [https://www.qgemproject.com/ QGEM] pathfinder is cited in the BLQC manuscript as one candidate testbed; superconducting-qubit readout chains and precision interferometer phase-locking loops are others.

== Relation to quantum foundations ==

The framework is connected to, and partly draws from, several existing positions in the foundations of quantum mechanics.

* '''Brukner's information-theoretic reconstructions''' provide a precedent for treating information limits as structural constraints in quantum theory.
* '''Relational Quantum Mechanics''' (Rovelli) takes measurement outcomes to be relative to an observer-system; the framework provides one possible mechanism (finite ''C''&lt;sub&gt;eff&lt;/sub&gt;) for what makes one observer's frame physically inequivalent to another's.
* '''Decoherence theory''' is not opposed by the framework. The framework's prediction sits beside ordinary environmental decoherence and is intended to be ''distinguishable'' from it by the sign-reversal under power variation; in the capacity-wins regime (κ &lt; 0) standard decoherence theory is recovered.
* '''Measurement-independence'''. Because the framework treats the measurement basis as a dynamical variable with its own causal history, if extended to Bell-type set-ups it appears to imply a structural violation of statistical measurement-independence. The framework's response to the conventional &quot;conspiracy&quot; objection against superdeterminism is to attribute the correlation to common causal past plus a global consistency constraint rather than to fine-tuned initial conditions. This response is philosophical rather than mathematical and the formal extension (including a no-signalling treatment) is itself an open question (see [[#Open objections|Open objections]]).
* '''Penrose Objective Reduction''' is treated as an ''orthogonal'' competing mechanism whose predicted ''t''&lt;sub&gt;OR&lt;/sub&gt; ∝ ''s'' / ''m''&lt;sup&gt;2&lt;/sup&gt; scaling can be experimentally distinguished from the framework's ''C''&lt;sub&gt;eff&lt;/sub&gt;-driven ''t''&lt;sub&gt;break&lt;/sub&gt;. The numerical proximity of the two timescales in the mesoscopic regime motivates the protocol described in the next section but is treated as a coincidence pending experimental evidence.

== Philosophical interpretation ==

''This section describes interpretive extensions of the framework that go beyond the empirical core. Nothing in this section is a load-bearing element of the experimental claim. If the experimental discriminator returns a null result, the claimed physical realization of these interpretive readings within the framework would fall. The interpretive positions themselves — Advaita Vedānta, relational quantum mechanics — do not stand or fall on an interferometry experiment; what stands or falls is the framework's specific physical mapping into them.''

A direct statement of the framework's interpretive position appears in ''[https://ignorantobserver.xyz/documents/Hard_Problem_After_Deflation.pdf The Hard Problem Dissolved — But Into What? A Critical Response to Carlo Rovelli's &quot;There Is No 'Hard Problem of Consciousness'&quot;]'' (Dekker, May 2026). The response engages Rovelli's recent Noema essay, marks the substantial ground it shares with the framework, and identifies where the framework presses beyond Rovelli's deflationary physicalism toward a non-dual reading. Readers approaching the framework from philosophy of mind may find that essay the most accessible entry point.

The framework's interpretive layer is developed in dialogue with two existing positions.

The first is Carlo Rovelli's relational quantum mechanics. The framework can be read as supplying a candidate physical mechanism — the ''C''&lt;sub&gt;eff&lt;/sub&gt; versus ''h''&lt;sub&gt;KS&lt;/sub&gt; inequality — for what makes a measurement outcome relative to an observer rather than absolute. On this reading, the framework is a mechanistic specification of an idea that RQM leaves at the level of principle.

The second is the Advaita Vedānta tradition (Śaṅkara, Ramaṇa Mahaṛṣi), in which the apparent independence of the experiencing subject from the perceived world is treated as a structural feature of ignorance (''avidyā'') rather than a metaphysical fact. The framework's σ&lt;sub&gt;θ&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt;(''t'') — the growing basis-tracking error of an observer whose capacity is insufficient to track its own apparatus — admits a structural analogy with avidyā as the phenomenological self-opacity of an embodied subject. The framework neither asserts that this analogy is more than structural nor that any experimental result could confirm or refute Advaita as a philosophical position; it offers the analogy as a way of locating the framework within a non-dual reading of the measurement problem for readers who find that reading useful.

Readers who prefer to ignore both interpretive readings should be able to evaluate the framework's empirical content from the [[#Technical proposal|Technical proposal]] and [[#Experimental discriminator|Experimental discriminator]] sections alone.

A further speculative extension, ''[https://ignorantobserver.xyz/documents/Creation_of_Duality.pdf The Creation of Duality]'', asks whether space, time, objecthood, and gravity-like structure can themselves be read as features of a consistent finite-observer world-model, with a Bridge Ansatz ''E''&lt;sub&gt;G&lt;/sub&gt; = (π/2)ℏκ linking the deficit rate κ to a gravitational energy scale via Margolus–Levitin saturation. Its scientific status is contingent on the BLQC experimental discriminator; until then it is offered explicitly as speculation.

== Documents ==

The framework's documents are published at [https://ignorantobserver.xyz ignorantobserver.xyz]. Direct links to the principal documents:

* '''[https://ignorantobserver.xyz/documents/BLQC.pdf Bandwidth-Limited Quantum Control]''' — finite-rate phase-reference test in the Penrose-overlap regime. The framework's falsifiable experimental discriminator.
* '''[https://ignorantobserver.xyz/documents/The_Ignorant_Observer.pdf The Ignorant Observer]''' — main framework document. Physical formalization inspired by Advaita Vedanta's insight into ignorance.
* '''[https://ignorantobserver.xyz/documents/Comprehensive_Experimental_Protocol.pdf Comprehensive Experimental Protocol]''' — preregistered prospective experiment discriminating a Penrose-style mass-geometry timescale from the BLQC capacity / instability timescale in the same mesoscopic apparatus.
* '''[https://ignorantobserver.xyz/documents/Forensic_Signatures.pdf Forensic Signatures]''' — retrospective screening of Chinese 63-qubit, Google Sycamore, and LIGO data for the double-exponential visibility decay signature predicted by BLQC. Motivating evidence for treating LIGO as a candidate regime; not causal attribution. Detailed findings and caveats are discussed in [[#Open objections|Open objections]].
* '''[https://ignorantobserver.xyz/documents/Capacity_Backaction_Frontier.pdf The Capacity–Backaction Frontier]''' — application to cryogenic quantum error correction. Defines an operational coordinate ρ&lt;sub&gt;CB&lt;/sub&gt; = ε&lt;sub&gt;QEC&lt;/sub&gt; ''C''&lt;sub&gt;eff&lt;/sub&gt; ln 2 / ''h''&lt;sub&gt;eff&lt;/sub&gt;(''N'', ''C''&lt;sub&gt;eff&lt;/sub&gt;) comparing useful syndrome capacity against the physical instability induced by obtaining and using it.
* '''[https://ignorantobserver.xyz/documents/Concise_Summary.pdf Concise Mathematical Summary]''' — shortest formal map of the IOF variables and BLQC test regimes.
* '''[https://ignorantobserver.xyz/documents/Question_and_Answers_IOF.pdf Questions and Answers (IOF)]''' — common questions on the framework addressed in depth.
* '''[https://ignorantobserver.xyz/documents/IOF_Assessment.pdf Scientific Editorial Assessment]''' — overview of the project architecture, explaining why BLQC is the technical hinge and how the philosophical and cosmological documents should be read conditionally.

A full archival deposit of the framework's documents is also available on the Open Science Framework at [https://doi.org/10.17605/OSF.IO/FCDSN doi.org/10.17605/OSF.IO/FCDSN].

== Open objections ==

The following objections to the framework are listed openly so that reviewers can engage with them directly. Several are diagnosed in the framework's own manuscripts; others reflect critiques the author has received in correspondence or anticipates from sophisticated readers. They are deliberately phrased from outside the framework's assumptions, not from within them.

# '''Useful capacity versus thermodynamic bound'''. The framework uses the Landauer expression ''C'' ≤ ''P'' / (''k''&lt;sub&gt;B&lt;/sub&gt; ''T'' ln 2) to relate controller input power ''P'' to channel capacity. Landauer is an ideal upper bound on bit-erasure cost; it does not guarantee that increased ''P'' actually translates to increased ''useful'' basis-tracking capacity. Additional power can equally well couple to actuator noise, electromagnetic leakage, vibration, or backaction channels that do not constrain the basis variable θ. Establishing that Δ''P'' → Δ''C''&lt;sub&gt;eff&lt;/sub&gt; in the predicted direction — with realistic loss budgets for the candidate apparatus — is a substantive engineering claim that the framework does not by itself establish.
# '''Existence of positive ''h''&lt;sub&gt;KS&lt;/sub&gt; in engineered apparatus'''. Many precision controllers (phase-locked loops, qubit readout chains, interferometer servo systems) are explicitly engineered to suppress chaotic dynamics. The basis-defining degrees of freedom may exhibit colored noise, slow drift, or stochastic control error rather than positive-''h''&lt;sub&gt;KS&lt;/sub&gt; chaos in the Pesin sense. If the relevant dynamics are not chaotic in this sense, the ''h''&lt;sub&gt;KS&lt;/sub&gt; framing may not apply at all, and a different rate-distortion accounting (or none) would be needed. Even where positive ''h''&lt;sub&gt;KS&lt;/sub&gt; can be identified, the operationally relevant rate may differ substantially from textbook surrogate estimates (kicked rotor, logistic map) used illustratively in the manuscripts.
# '''Rate-distortion extension to nonlinear / chaotic systems'''. The mapping from channel capacity ''C'' to angular tracking variance σ&lt;sub&gt;θ&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt; ≥ ''D''/(''C'' ln 2) assumes a high-rate coder model and the framework extends the Data-Rate Theorem from linear plants to nonlinear chaotic systems by substituting ''h''&lt;sub&gt;KS&lt;/sub&gt;. This extension is an explicit assumption, not a proven theorem. If the extension fails, the closed-form visibility law and the κ-regime structure both lose their derivation.
# '''Gaussian small-angle assumption'''. The visibility expression ''V''(''t'') = exp(−½ σ&lt;sub&gt;θ&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt;) requires σ&lt;sub&gt;θ&lt;/sub&gt; ≲ 1 rad and a Gaussian basis-tracking error distribution. Non-Gaussian, heavy-tailed, or state-dependent δθ would break the closed-form double-exponential law.
# '''Decoherence and control-noise confound'''. Distinguishing the predicted visibility loss from ordinary environmental dephasing, alignment drift, and detector systematics is the central experimental challenge. The framework's answer is the sign-reversal under power variation at clamped ''T'' — a conceptually clean discriminator that is engineering-hard to realise. Independent calibration of ''C''&lt;sub&gt;eff&lt;/sub&gt; may be the single largest practical hurdle.
# '''Prior-art and reparameterization risk'''. The proposed double-exponential visibility signature may already be expressible within existing frameworks: compound dephasing channels with two or more contributing rates, classical feedback-loop instability, or hidden-variable control-noise models with appropriate parameter choices. The framework should be able to show that its prediction is genuinely new rather than a reparameterization of one of these known phenomena. The author's adversarial-mimic analysis is in progress, and a positive result on that front would substantially strengthen the framework's empirical claim.
# '''Bell / locality consistency'''. The framework implies a structural violation of statistical measurement-independence. The author's response (common causal past plus global consistency, in place of fine-tuned initial conditions) is a philosophical reframing rather than a no-signalling lemma. A proper consistency proof has not been published.
# '''Forensic-signature interpretation'''. The Forensic Signatures preprint applies a screening protocol to existing data from Chinese 63-qubit processors, Google Sycamore, and LIGO glitch records. The paper's own domain-of-validity statement is that BLQC applies in observer-limited rather than plant-limited regimes, and the protocol finds power-law dominance on the qubit datasets (consistent with that statement) and 43% Gompertz-consistent events on LIGO (consistent with BLQC). The paper flags a controller-regime confound for the LIGO result and is explicit that retrospective findings do not establish causal attribution to BLQC; the case rests on the prospective controlled-capacity experiment. The objection here is the standard one for retrospective signal analyses: even where the predicted geometry is present, it remains compatible with alternative explanations until the controlled experiment runs.
# '''Observer language'''. The framework's &quot;observer&quot; plays two distinct roles: the physical apparatus / controller whose finite ''C''&lt;sub&gt;eff&lt;/sub&gt; and ''h''&lt;sub&gt;KS&lt;/sub&gt; appear in the equations, and the epistemic subject for whom measurement outcomes are or are not determinate. The framework treats these as connected but not identified, and the distinction is load-bearing. Critics will reasonably worry — especially given the framework's interpretive engagement with non-dual philosophy and the philosophy of mind — that consciousness is being smuggled into the foundations of measurement under physical vocabulary. The framework's defence is that the BLQC experimental claim is stated entirely in apparatus-level terms; whether that defence holds depends on the framework keeping the two senses of &quot;observer&quot; rigorously separate.
# '''Interpretive vocabulary'''. Some of the framework's documents draw on vocabulary from philosophy of mind and non-dual philosophy (notably Advaita Vedānta) alongside the physical derivations. Readers who find this vocabulary off-putting are invited to evaluate the empirical content from the BLQC manuscript, which uses only standard physics and control-theory language.
# '''Peer-review status and independent replication'''. The framework has not yet undergone peer review, and the experimental discriminator has not been independently replicated. This is the actual current epistemic status of the work. The framework's case must be evaluated on its merits in the documents linked above and on the conduct of the prospective experiment, not on any external imprimatur.

== Invitation for review ==

This page is offered as a venue for substantive critique. The author is particularly interested in engagement on the following:

* '''From physicists working on quantum control or precision interferometry''': is the proposed sign-reversal under controller-power variation at clamped temperature genuinely distinguishable from known instrumental artefacts (closed-loop resonances, thermal-noise mismodelling, photon-shot-noise rebalancing at higher gain), and what existing apparatus would be best positioned to perform the test?
* '''From decoherence theorists''': under what conditions does the proposed double-exponential visibility law overlap with compound-channel decoherence models in ways that would make the two empirically indistinguishable? Is there a parameter regime where the framework's prediction is genuinely new rather than a reparameterisation of existing models?
* '''From researchers in the foundations of quantum mechanics''': how should the framework's structural violation of measurement-independence be evaluated against the alternatives in the superdeterminism / retrocausality / many-worlds landscape, and what would constitute a satisfactory consistency proof?
* '''From philosophers of mind''': the Advaita / RQM interpretive layer is offered conditionally on the empirical core. Is the conditional structure (&quot;these readings are available ''if'' the empirical claim survives&quot;) presented clearly enough, or does it still amount to overreach?

Comments, references to prior or parallel work the author may not be aware of, and pointers to potential confounds or alternative explanations are all welcome. Substantive critique on the [[User talk:IgnorantObserver/sandbox|talk page]] will be acknowledged in subsequent revisions of the manuscripts.

== References ==

* Brukner, Č., &amp; Zeilinger, A. (1999). Operationally invariant information in quantum measurements. ''Physical Review Letters'', 83(17), 3354–3357.
* Nair, G. N., &amp; Evans, R. J. (2004). Stabilizability of stochastic linear systems with finite feedback data rates. ''SIAM Journal on Control and Optimization'', 43(2), 413–436.
* Penrose, R. (1996). On gravity's role in quantum state reduction. ''General Relativity and Gravitation'', 28(5), 581–600.
* Rovelli, C. (1996). Relational quantum mechanics. ''International Journal of Theoretical Physics'', 35(8), 1637–1678.
* Tatikonda, S., &amp; Mitter, S. (2004). Control under communication constraints. ''IEEE Transactions on Automatic Control'', 49(7), 1056–1068.

== See also ==

* [[w:Quantum decoherence|Decoherence]] (Wikipedia)
* [[w:Relational quantum mechanics|Relational quantum mechanics]] (Wikipedia)
* [[w:Penrose interpretation|Penrose interpretation]] (Wikipedia)
* [[w:Data-rate theorem|Data-rate theorem]] (Wikipedia)

&lt;!-- [[Category:Research projects]] --&gt;
&lt;!-- [[Category:Quantum mechanics]] --&gt;
&lt;!-- [[Category:Philosophy of physics]] --&gt;</text>
      <sha1>p11a07kozueggvoiine9w5kxyefobe9</sha1>
    </revision>
    <revision>
      <id>2809884</id>
      <parentid>2809880</parentid>
      <timestamp>2026-05-17T09:54:02Z</timestamp>
      <contributor>
        <username>IgnorantObserver</username>
        <id>3076980</id>
      </contributor>
      <minor />
      <comment>Add __NOINDEX__ to suppress search-engine indexing of the sandbox (main namespace page is the canonical version).</comment>
      <origin>2809884</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="26321" sha1="765wkky3z7lgjgh34xtu041ec2dlf7u" xml:space="preserve">__NOINDEX__
&lt;!-- SANDBOX DRAFT — under review by author before main-namespace publication. --&gt;
{{User sandbox}}
{{Research project}}

= The Ignorant Observer Framework =

''This research page is authored and maintained by [[User:IgnorantObserver|Aernoud Dekker]], an independent researcher and the originator of the framework described below. Page text is offered for review, critique, and collaborative refinement under [[Wikiversity:Copyrights|Wikiversity's standard licence]].''

== Status ==

Research project under active development. The framework consists of an interlinked set of technical and interpretive documents published at [https://ignorantobserver.xyz ignorantobserver.xyz] and archived on the [https://osf.io Open Science Framework]. The technical module ''Bandwidth-Limited Quantum Control'' (BLQC) sets out the framework's falsifiable experimental discriminator. The broader ''Ignorant Observer Framework'' (IOF) connects this technical core to questions in the foundations of quantum mechanics and the philosophy of mind. All work is single-authored.

== Summary ==

The Ignorant Observer Framework proposes that the conventional treatment of quantum measurement idealizes the measurement basis as stably available to the observer. The framework removes that idealization. It treats the measurement basis θ as a physical dynamical variable inside the apparatus, with its own causal history and its own information-production rate. Whether the apparatus can stably track θ is then a control-theoretic question, governed by an inequality between effective information-channel capacity and the basis-defining dynamics' entropy rate.

''Bandwidth-Limited Quantum Control'' (BLQC), the framework's technical module, derives — under the assumptions catalogued in the [[#Open objections|Open objections]] section below — a distinctive ''double-exponential'' visibility decay law and a corresponding falsifiable experimental signature: under variation of controller input power at clamped environmental temperature, the framework predicts that coherence time should ''lengthen'' with increasing power, the opposite of standard thermal decoherence. This sign-reversal is the central testable claim.

The framework as a whole also offers an interpretive extension that connects the technical proposal to existing positions in quantum foundations (Brukner, Rovelli's relational quantum mechanics) and to non-dual philosophy of mind (Advaita Vedānta). These interpretive elements are clearly fenced from the empirical core in [[#Philosophical interpretation|the relevant section below]]. What stands or falls with the experimental discriminator is the framework's specific physical mapping into these positions, not the positions themselves.

== Core question ==

''Can quantum visibility depend on finite observer or apparatus basis-tracking capacity, independently of, and distinguishably from, ordinary environmental decoherence?''

Phrased positively: if the classical degrees of freedom that define and maintain a measurement basis exhibit chaotic dynamics with positive Kolmogorov–Sinai entropy rate ''h''&lt;sub&gt;KS&lt;/sub&gt;, and if the effective information channel that constrains those degrees of freedom has capacity ''C''&lt;sub&gt;eff&lt;/sub&gt; insufficient to track them, does interference visibility decay in a functional form distinguishable from standard exponential or Gaussian dephasing — and does this decay respond to controller input power in a direction opposite to thermal decoherence?

== Technical proposal ==

The framework introduces the following quantities.

'''Effective channel capacity ''C''&lt;sub&gt;eff&lt;/sub&gt;''' (bits/s): the information rate available to the basis-tracking control loop, operationalised as
:''C''&lt;sub&gt;eff&lt;/sub&gt; = ''r'' · ''b'' · ''f''
with ''r'' the update rate (Hz), ''b'' the effective number of bits per update that constrain the basis variable θ, and ''f'' ∈ (0,1] the fraction of updates that genuinely constrain θ after overhead and latency. ''C''&lt;sub&gt;eff&lt;/sub&gt; is bounded above by the Landauer limit on the controller's actuation:
:''C''&lt;sub&gt;eff&lt;/sub&gt; ≤ ''P'' / (''k''&lt;sub&gt;B&lt;/sub&gt; ''T'' ln 2)
where ''P'' is controller input power and ''T'' is the temperature at which the controller operates.

'''Kolmogorov–Sinai entropy rate ''h''&lt;sub&gt;KS&lt;/sub&gt;''' (nats/s): the information-production rate of the classical degrees of freedom (voltage references, timing circuits, feedback loops) that define and maintain the measurement basis. For chaotic systems, ''h''&lt;sub&gt;KS&lt;/sub&gt; equals the sum of positive Lyapunov exponents (Pesin identity). It is estimated operationally from the exponential growth of one-step prediction error on logged controller states. The nats/s convention is used so that the deficit κ below combines ''h''&lt;sub&gt;KS&lt;/sub&gt; (nats/s) and ''C''&lt;sub&gt;eff&lt;/sub&gt; ln 2 (bits/s converted to nats/s) in consistent units; an equivalent all-bits form would be κ&lt;sub&gt;bits&lt;/sub&gt; = ''h''&lt;sub&gt;KS,bits&lt;/sub&gt; − ''C''&lt;sub&gt;eff&lt;/sub&gt;.

'''Ignorance rate κ''' (s&lt;sup&gt;−1&lt;/sup&gt;):
:κ = ''h''&lt;sub&gt;KS&lt;/sub&gt; − ''C''&lt;sub&gt;eff&lt;/sub&gt; · ln 2
The framework distinguishes two regimes. When κ &lt; 0 (''capacity-wins''), basis-tracking error stays bounded and standard quantum mechanics is recovered. When κ &gt; 0 (''chaos-wins''), the variance of the basis-tracking error grows exponentially in time as σ&lt;sub&gt;θ&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt;(''t'') = σ&lt;sub&gt;0&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt; e&lt;sup&gt;2κ''t''&lt;/sup&gt;.

'''Measured visibility ''V''(''t'')'''. Averaging the interference term cos(φ − θ) over a Gaussian distribution of basis-tracking error δθ ∼ ''N''(0, σ&lt;sub&gt;θ&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt;(''t'')) yields, in the small-angle regime,
:''V''(''t'') = exp(−½ σ&lt;sub&gt;0&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt; e&lt;sup&gt;2κ''t''&lt;/sup&gt;)
i.e. a ''double-exponential'' decay of visibility once the chaos-wins regime is entered.

'''Breakdown time ''t''&lt;sub&gt;break&lt;/sub&gt;'''. For a chosen visibility threshold ''V''*,
:''t''&lt;sub&gt;break&lt;/sub&gt; = (1 / 2κ) · ln(−2 ln ''V''* / σ&lt;sub&gt;0&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt;) for κ &gt; 0.
''t''&lt;sub&gt;break&lt;/sub&gt; is the framework's primary observable.

The technical derivation extends the Data-Rate Theorem of Nair &amp; Evans (2004) and Tatikonda &amp; Mitter (2004) from linear plants to nonlinear, chaotic systems by substituting ''h''&lt;sub&gt;KS&lt;/sub&gt; for the sum-of-positive-eigenvalues bound. This extension is an explicit assumption of the framework rather than a proven theorem (see [[#Open objections|Open objections]]).

== Experimental discriminator ==

The framework prescribes the following experimental protocol as its central falsifiable test.

'''Independent variable''': controller input power ''P''. The controller is the physical system whose state defines and maintains the measurement basis (e.g. an interferometer phase-locking loop, a qubit readout chain, the active feedback in a precision interferometer).

'''Held constant''': the environmental temperature ''T'' at which the controller operates, by independent active thermal feedback. Holding ''T'' constant while varying ''P'' is what distinguishes the framework's prediction from standard thermal decoherence (which depends on ''T'' and ignores ''P'').

'''Dependent variable''': the visibility-decay breakdown time ''t''&lt;sub&gt;break&lt;/sub&gt;, fitted to interference data at a chosen visibility threshold (e.g. ''V''* = 0.5).

'''Prediction''': ∂''t''&lt;sub&gt;break&lt;/sub&gt;/∂''P'' &gt; 0 at clamped ''T'', with the visibility curve ''V''(''t'') fitting the double-exponential form exp(−½ σ&lt;sub&gt;0&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt; e&lt;sup&gt;2κ''t''&lt;/sup&gt;) better than a standard exponential ''e''&lt;sup&gt;−Γ''t''&lt;/sup&gt; or Gaussian ''e''&lt;sup&gt;−γ''t''²&lt;/sup&gt;.

'''What would count as falsification'''. Any of the following null findings counts against the framework:
* ∂''t''&lt;sub&gt;break&lt;/sub&gt;/∂''P'' ≤ 0 at clamped ''T'' (i.e. increasing controller power does not extend, or shortens, coherence time);
* ''V''(''t'') fits a single-exponential or Gaussian dephasing law significantly better than the double-exponential form, in the regime where the framework predicts the double-exponential should dominate;
* ''t''&lt;sub&gt;break&lt;/sub&gt; scales with the gravitational self-energy timescale ''t''&lt;sub&gt;OR&lt;/sub&gt; ∝ ''s'' / ''m''&lt;sup&gt;2&lt;/sup&gt; (the [[Penrose interpretation of quantum mechanics|Penrose Objective Reduction]] prediction) rather than with ''C''&lt;sub&gt;eff&lt;/sub&gt;;
* ''C''&lt;sub&gt;eff&lt;/sub&gt; cannot be calibrated independently of ''t''&lt;sub&gt;break&lt;/sub&gt; (in which case the prediction would be unfalsifiable, which would itself count against the framework's experimental status).

The [https://www.qgemproject.com/ QGEM] pathfinder is cited in the BLQC manuscript as one candidate testbed; superconducting-qubit readout chains and precision interferometer phase-locking loops are others.

== Relation to quantum foundations ==

The framework is connected to, and partly draws from, several existing positions in the foundations of quantum mechanics.

* '''Brukner's information-theoretic reconstructions''' provide a precedent for treating information limits as structural constraints in quantum theory.
* '''Relational Quantum Mechanics''' (Rovelli) takes measurement outcomes to be relative to an observer-system; the framework provides one possible mechanism (finite ''C''&lt;sub&gt;eff&lt;/sub&gt;) for what makes one observer's frame physically inequivalent to another's.
* '''Decoherence theory''' is not opposed by the framework. The framework's prediction sits beside ordinary environmental decoherence and is intended to be ''distinguishable'' from it by the sign-reversal under power variation; in the capacity-wins regime (κ &lt; 0) standard decoherence theory is recovered.
* '''Measurement-independence'''. Because the framework treats the measurement basis as a dynamical variable with its own causal history, if extended to Bell-type set-ups it appears to imply a structural violation of statistical measurement-independence. The framework's response to the conventional &quot;conspiracy&quot; objection against superdeterminism is to attribute the correlation to common causal past plus a global consistency constraint rather than to fine-tuned initial conditions. This response is philosophical rather than mathematical and the formal extension (including a no-signalling treatment) is itself an open question (see [[#Open objections|Open objections]]).
* '''Penrose Objective Reduction''' is treated as an ''orthogonal'' competing mechanism whose predicted ''t''&lt;sub&gt;OR&lt;/sub&gt; ∝ ''s'' / ''m''&lt;sup&gt;2&lt;/sup&gt; scaling can be experimentally distinguished from the framework's ''C''&lt;sub&gt;eff&lt;/sub&gt;-driven ''t''&lt;sub&gt;break&lt;/sub&gt;. The numerical proximity of the two timescales in the mesoscopic regime motivates the protocol described in the next section but is treated as a coincidence pending experimental evidence.

== Philosophical interpretation ==

''This section describes interpretive extensions of the framework that go beyond the empirical core. Nothing in this section is a load-bearing element of the experimental claim. If the experimental discriminator returns a null result, the claimed physical realization of these interpretive readings within the framework would fall. The interpretive positions themselves — Advaita Vedānta, relational quantum mechanics — do not stand or fall on an interferometry experiment; what stands or falls is the framework's specific physical mapping into them.''

A direct statement of the framework's interpretive position appears in ''[https://ignorantobserver.xyz/documents/Hard_Problem_After_Deflation.pdf The Hard Problem Dissolved — But Into What? A Critical Response to Carlo Rovelli's &quot;There Is No 'Hard Problem of Consciousness'&quot;]'' (Dekker, May 2026). The response engages Rovelli's recent Noema essay, marks the substantial ground it shares with the framework, and identifies where the framework presses beyond Rovelli's deflationary physicalism toward a non-dual reading. Readers approaching the framework from philosophy of mind may find that essay the most accessible entry point.

The framework's interpretive layer is developed in dialogue with two existing positions.

The first is Carlo Rovelli's relational quantum mechanics. The framework can be read as supplying a candidate physical mechanism — the ''C''&lt;sub&gt;eff&lt;/sub&gt; versus ''h''&lt;sub&gt;KS&lt;/sub&gt; inequality — for what makes a measurement outcome relative to an observer rather than absolute. On this reading, the framework is a mechanistic specification of an idea that RQM leaves at the level of principle.

The second is the Advaita Vedānta tradition (Śaṅkara, Ramaṇa Mahaṛṣi), in which the apparent independence of the experiencing subject from the perceived world is treated as a structural feature of ignorance (''avidyā'') rather than a metaphysical fact. The framework's σ&lt;sub&gt;θ&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt;(''t'') — the growing basis-tracking error of an observer whose capacity is insufficient to track its own apparatus — admits a structural analogy with avidyā as the phenomenological self-opacity of an embodied subject. The framework neither asserts that this analogy is more than structural nor that any experimental result could confirm or refute Advaita as a philosophical position; it offers the analogy as a way of locating the framework within a non-dual reading of the measurement problem for readers who find that reading useful.

Readers who prefer to ignore both interpretive readings should be able to evaluate the framework's empirical content from the [[#Technical proposal|Technical proposal]] and [[#Experimental discriminator|Experimental discriminator]] sections alone.

A further speculative extension, ''[https://ignorantobserver.xyz/documents/Creation_of_Duality.pdf The Creation of Duality]'', asks whether space, time, objecthood, and gravity-like structure can themselves be read as features of a consistent finite-observer world-model, with a Bridge Ansatz ''E''&lt;sub&gt;G&lt;/sub&gt; = (π/2)ℏκ linking the deficit rate κ to a gravitational energy scale via Margolus–Levitin saturation. Its scientific status is contingent on the BLQC experimental discriminator; until then it is offered explicitly as speculation.

== Documents ==

The framework's documents are published at [https://ignorantobserver.xyz ignorantobserver.xyz]. Direct links to the principal documents:

* '''[https://ignorantobserver.xyz/documents/BLQC.pdf Bandwidth-Limited Quantum Control]''' — finite-rate phase-reference test in the Penrose-overlap regime. The framework's falsifiable experimental discriminator.
* '''[https://ignorantobserver.xyz/documents/The_Ignorant_Observer.pdf The Ignorant Observer]''' — main framework document. Physical formalization inspired by Advaita Vedanta's insight into ignorance.
* '''[https://ignorantobserver.xyz/documents/Comprehensive_Experimental_Protocol.pdf Comprehensive Experimental Protocol]''' — preregistered prospective experiment discriminating a Penrose-style mass-geometry timescale from the BLQC capacity / instability timescale in the same mesoscopic apparatus.
* '''[https://ignorantobserver.xyz/documents/Forensic_Signatures.pdf Forensic Signatures]''' — retrospective screening of Chinese 63-qubit, Google Sycamore, and LIGO data for the double-exponential visibility decay signature predicted by BLQC. Motivating evidence for treating LIGO as a candidate regime; not causal attribution. Detailed findings and caveats are discussed in [[#Open objections|Open objections]].
* '''[https://ignorantobserver.xyz/documents/Capacity_Backaction_Frontier.pdf The Capacity–Backaction Frontier]''' — application to cryogenic quantum error correction. Defines an operational coordinate ρ&lt;sub&gt;CB&lt;/sub&gt; = ε&lt;sub&gt;QEC&lt;/sub&gt; ''C''&lt;sub&gt;eff&lt;/sub&gt; ln 2 / ''h''&lt;sub&gt;eff&lt;/sub&gt;(''N'', ''C''&lt;sub&gt;eff&lt;/sub&gt;) comparing useful syndrome capacity against the physical instability induced by obtaining and using it.
* '''[https://ignorantobserver.xyz/documents/Concise_Summary.pdf Concise Mathematical Summary]''' — shortest formal map of the IOF variables and BLQC test regimes.
* '''[https://ignorantobserver.xyz/documents/Question_and_Answers_IOF.pdf Questions and Answers (IOF)]''' — common questions on the framework addressed in depth.
* '''[https://ignorantobserver.xyz/documents/IOF_Assessment.pdf Scientific Editorial Assessment]''' — overview of the project architecture, explaining why BLQC is the technical hinge and how the philosophical and cosmological documents should be read conditionally.

A full archival deposit of the framework's documents is also available on the Open Science Framework at [https://doi.org/10.17605/OSF.IO/FCDSN doi.org/10.17605/OSF.IO/FCDSN].

== Open objections ==

The following objections to the framework are listed openly so that reviewers can engage with them directly. Several are diagnosed in the framework's own manuscripts; others reflect critiques the author has received in correspondence or anticipates from sophisticated readers. They are deliberately phrased from outside the framework's assumptions, not from within them.

# '''Useful capacity versus thermodynamic bound'''. The framework uses the Landauer expression ''C'' ≤ ''P'' / (''k''&lt;sub&gt;B&lt;/sub&gt; ''T'' ln 2) to relate controller input power ''P'' to channel capacity. Landauer is an ideal upper bound on bit-erasure cost; it does not guarantee that increased ''P'' actually translates to increased ''useful'' basis-tracking capacity. Additional power can equally well couple to actuator noise, electromagnetic leakage, vibration, or backaction channels that do not constrain the basis variable θ. Establishing that Δ''P'' → Δ''C''&lt;sub&gt;eff&lt;/sub&gt; in the predicted direction — with realistic loss budgets for the candidate apparatus — is a substantive engineering claim that the framework does not by itself establish.
# '''Existence of positive ''h''&lt;sub&gt;KS&lt;/sub&gt; in engineered apparatus'''. Many precision controllers (phase-locked loops, qubit readout chains, interferometer servo systems) are explicitly engineered to suppress chaotic dynamics. The basis-defining degrees of freedom may exhibit colored noise, slow drift, or stochastic control error rather than positive-''h''&lt;sub&gt;KS&lt;/sub&gt; chaos in the Pesin sense. If the relevant dynamics are not chaotic in this sense, the ''h''&lt;sub&gt;KS&lt;/sub&gt; framing may not apply at all, and a different rate-distortion accounting (or none) would be needed. Even where positive ''h''&lt;sub&gt;KS&lt;/sub&gt; can be identified, the operationally relevant rate may differ substantially from textbook surrogate estimates (kicked rotor, logistic map) used illustratively in the manuscripts.
# '''Rate-distortion extension to nonlinear / chaotic systems'''. The mapping from channel capacity ''C'' to angular tracking variance σ&lt;sub&gt;θ&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt; ≥ ''D''/(''C'' ln 2) assumes a high-rate coder model and the framework extends the Data-Rate Theorem from linear plants to nonlinear chaotic systems by substituting ''h''&lt;sub&gt;KS&lt;/sub&gt;. This extension is an explicit assumption, not a proven theorem. If the extension fails, the closed-form visibility law and the κ-regime structure both lose their derivation.
# '''Gaussian small-angle assumption'''. The visibility expression ''V''(''t'') = exp(−½ σ&lt;sub&gt;θ&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt;) requires σ&lt;sub&gt;θ&lt;/sub&gt; ≲ 1 rad and a Gaussian basis-tracking error distribution. Non-Gaussian, heavy-tailed, or state-dependent δθ would break the closed-form double-exponential law.
# '''Decoherence and control-noise confound'''. Distinguishing the predicted visibility loss from ordinary environmental dephasing, alignment drift, and detector systematics is the central experimental challenge. The framework's answer is the sign-reversal under power variation at clamped ''T'' — a conceptually clean discriminator that is engineering-hard to realise. Independent calibration of ''C''&lt;sub&gt;eff&lt;/sub&gt; may be the single largest practical hurdle.
# '''Prior-art and reparameterization risk'''. The proposed double-exponential visibility signature may already be expressible within existing frameworks: compound dephasing channels with two or more contributing rates, classical feedback-loop instability, or hidden-variable control-noise models with appropriate parameter choices. The framework should be able to show that its prediction is genuinely new rather than a reparameterization of one of these known phenomena. The author's adversarial-mimic analysis is in progress, and a positive result on that front would substantially strengthen the framework's empirical claim.
# '''Bell / locality consistency'''. The framework implies a structural violation of statistical measurement-independence. The author's response (common causal past plus global consistency, in place of fine-tuned initial conditions) is a philosophical reframing rather than a no-signalling lemma. A proper consistency proof has not been published.
# '''Forensic-signature interpretation'''. The Forensic Signatures preprint applies a screening protocol to existing data from Chinese 63-qubit processors, Google Sycamore, and LIGO glitch records. The paper's own domain-of-validity statement is that BLQC applies in observer-limited rather than plant-limited regimes, and the protocol finds power-law dominance on the qubit datasets (consistent with that statement) and 43% Gompertz-consistent events on LIGO (consistent with BLQC). The paper flags a controller-regime confound for the LIGO result and is explicit that retrospective findings do not establish causal attribution to BLQC; the case rests on the prospective controlled-capacity experiment. The objection here is the standard one for retrospective signal analyses: even where the predicted geometry is present, it remains compatible with alternative explanations until the controlled experiment runs.
# '''Observer language'''. The framework's &quot;observer&quot; plays two distinct roles: the physical apparatus / controller whose finite ''C''&lt;sub&gt;eff&lt;/sub&gt; and ''h''&lt;sub&gt;KS&lt;/sub&gt; appear in the equations, and the epistemic subject for whom measurement outcomes are or are not determinate. The framework treats these as connected but not identified, and the distinction is load-bearing. Critics will reasonably worry — especially given the framework's interpretive engagement with non-dual philosophy and the philosophy of mind — that consciousness is being smuggled into the foundations of measurement under physical vocabulary. The framework's defence is that the BLQC experimental claim is stated entirely in apparatus-level terms; whether that defence holds depends on the framework keeping the two senses of &quot;observer&quot; rigorously separate.
# '''Interpretive vocabulary'''. Some of the framework's documents draw on vocabulary from philosophy of mind and non-dual philosophy (notably Advaita Vedānta) alongside the physical derivations. Readers who find this vocabulary off-putting are invited to evaluate the empirical content from the BLQC manuscript, which uses only standard physics and control-theory language.
# '''Peer-review status and independent replication'''. The framework has not yet undergone peer review, and the experimental discriminator has not been independently replicated. This is the actual current epistemic status of the work. The framework's case must be evaluated on its merits in the documents linked above and on the conduct of the prospective experiment, not on any external imprimatur.

== Invitation for review ==

This page is offered as a venue for substantive critique. The author is particularly interested in engagement on the following:

* '''From physicists working on quantum control or precision interferometry''': is the proposed sign-reversal under controller-power variation at clamped temperature genuinely distinguishable from known instrumental artefacts (closed-loop resonances, thermal-noise mismodelling, photon-shot-noise rebalancing at higher gain), and what existing apparatus would be best positioned to perform the test?
* '''From decoherence theorists''': under what conditions does the proposed double-exponential visibility law overlap with compound-channel decoherence models in ways that would make the two empirically indistinguishable? Is there a parameter regime where the framework's prediction is genuinely new rather than a reparameterisation of existing models?
* '''From researchers in the foundations of quantum mechanics''': how should the framework's structural violation of measurement-independence be evaluated against the alternatives in the superdeterminism / retrocausality / many-worlds landscape, and what would constitute a satisfactory consistency proof?
* '''From philosophers of mind''': the Advaita / RQM interpretive layer is offered conditionally on the empirical core. Is the conditional structure (&quot;these readings are available ''if'' the empirical claim survives&quot;) presented clearly enough, or does it still amount to overreach?

Comments, references to prior or parallel work the author may not be aware of, and pointers to potential confounds or alternative explanations are all welcome. Substantive critique on the [[User talk:IgnorantObserver/sandbox|talk page]] will be acknowledged in subsequent revisions of the manuscripts.

== References ==

* Brukner, Č., &amp; Zeilinger, A. (1999). Operationally invariant information in quantum measurements. ''Physical Review Letters'', 83(17), 3354–3357.
* Nair, G. N., &amp; Evans, R. J. (2004). Stabilizability of stochastic linear systems with finite feedback data rates. ''SIAM Journal on Control and Optimization'', 43(2), 413–436.
* Penrose, R. (1996). On gravity's role in quantum state reduction. ''General Relativity and Gravitation'', 28(5), 581–600.
* Rovelli, C. (1996). Relational quantum mechanics. ''International Journal of Theoretical Physics'', 35(8), 1637–1678.
* Tatikonda, S., &amp; Mitter, S. (2004). Control under communication constraints. ''IEEE Transactions on Automatic Control'', 49(7), 1056–1068.

== See also ==

* [[w:Quantum decoherence|Decoherence]] (Wikipedia)
* [[w:Relational quantum mechanics|Relational quantum mechanics]] (Wikipedia)
* [[w:Penrose interpretation|Penrose interpretation]] (Wikipedia)
* [[w:Data-rate theorem|Data-rate theorem]] (Wikipedia)

&lt;!-- [[Category:Research projects]] --&gt;
&lt;!-- [[Category:Quantum mechanics]] --&gt;
&lt;!-- [[Category:Philosophy of physics]] --&gt;</text>
      <sha1>765wkky3z7lgjgh34xtu041ec2dlf7u</sha1>
    </revision>
  </page>
  <page>
    <title>The Ignorant Observer Framework</title>
    <ns>0</ns>
    <id>329703</id>
    <revision>
      <id>2809882</id>
      <timestamp>2026-05-17T09:36:09Z</timestamp>
      <contributor>
        <username>IgnorantObserver</username>
        <id>3076980</id>
      </contributor>
      <comment>Initial creation of research page (external links to be added in follow-up edit; workaround for new-account AbuseFilter rule on page-create with external links). Authored by Aernoud Dekker.</comment>
      <origin>2809882</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="25508" sha1="383co5336lgs5ep51fpk407kgg63sby" xml:space="preserve">&lt;!-- Step 1 of 2: page being created without external links to satisfy new-user AbuseFilter rule. Links will be added in a follow-up edit. --&gt;
{{Research project}}

= The Ignorant Observer Framework =

''This research page is authored and maintained by [[User:IgnorantObserver|Aernoud Dekker]], an independent researcher and the originator of the framework described below. Page text is offered for review, critique, and collaborative refinement under [[Wikiversity:Copyrights|Wikiversity's standard licence]].''

== Status ==

Research project under active development. The framework consists of an interlinked set of technical and interpretive documents published at ignorantobserver.xyz and archived on the Open Science Framework. The technical module ''Bandwidth-Limited Quantum Control'' (BLQC) sets out the framework's falsifiable experimental discriminator. The broader ''Ignorant Observer Framework'' (IOF) connects this technical core to questions in the foundations of quantum mechanics and the philosophy of mind. All work is single-authored.

== Summary ==

The Ignorant Observer Framework proposes that the conventional treatment of quantum measurement idealizes the measurement basis as stably available to the observer. The framework removes that idealization. It treats the measurement basis θ as a physical dynamical variable inside the apparatus, with its own causal history and its own information-production rate. Whether the apparatus can stably track θ is then a control-theoretic question, governed by an inequality between effective information-channel capacity and the basis-defining dynamics' entropy rate.

''Bandwidth-Limited Quantum Control'' (BLQC), the framework's technical module, derives — under the assumptions catalogued in the [[#Open objections|Open objections]] section below — a distinctive ''double-exponential'' visibility decay law and a corresponding falsifiable experimental signature: under variation of controller input power at clamped environmental temperature, the framework predicts that coherence time should ''lengthen'' with increasing power, the opposite of standard thermal decoherence. This sign-reversal is the central testable claim.

The framework as a whole also offers an interpretive extension that connects the technical proposal to existing positions in quantum foundations (Brukner, Rovelli's relational quantum mechanics) and to non-dual philosophy of mind (Advaita Vedānta). These interpretive elements are clearly fenced from the empirical core in [[#Philosophical interpretation|the relevant section below]]. What stands or falls with the experimental discriminator is the framework's specific physical mapping into these positions, not the positions themselves.

== Core question ==

''Can quantum visibility depend on finite observer or apparatus basis-tracking capacity, independently of, and distinguishably from, ordinary environmental decoherence?''

Phrased positively: if the classical degrees of freedom that define and maintain a measurement basis exhibit chaotic dynamics with positive Kolmogorov–Sinai entropy rate ''h''&lt;sub&gt;KS&lt;/sub&gt;, and if the effective information channel that constrains those degrees of freedom has capacity ''C''&lt;sub&gt;eff&lt;/sub&gt; insufficient to track them, does interference visibility decay in a functional form distinguishable from standard exponential or Gaussian dephasing — and does this decay respond to controller input power in a direction opposite to thermal decoherence?

== Technical proposal ==

The framework introduces the following quantities.

'''Effective channel capacity ''C''&lt;sub&gt;eff&lt;/sub&gt;''' (bits/s): the information rate available to the basis-tracking control loop, operationalised as
:''C''&lt;sub&gt;eff&lt;/sub&gt; = ''r'' · ''b'' · ''f''
with ''r'' the update rate (Hz), ''b'' the effective number of bits per update that constrain the basis variable θ, and ''f'' ∈ (0,1] the fraction of updates that genuinely constrain θ after overhead and latency. ''C''&lt;sub&gt;eff&lt;/sub&gt; is bounded above by the Landauer limit on the controller's actuation:
:''C''&lt;sub&gt;eff&lt;/sub&gt; ≤ ''P'' / (''k''&lt;sub&gt;B&lt;/sub&gt; ''T'' ln 2)
where ''P'' is controller input power and ''T'' is the temperature at which the controller operates.

'''Kolmogorov–Sinai entropy rate ''h''&lt;sub&gt;KS&lt;/sub&gt;''' (nats/s): the information-production rate of the classical degrees of freedom (voltage references, timing circuits, feedback loops) that define and maintain the measurement basis. For chaotic systems, ''h''&lt;sub&gt;KS&lt;/sub&gt; equals the sum of positive Lyapunov exponents (Pesin identity). It is estimated operationally from the exponential growth of one-step prediction error on logged controller states. The nats/s convention is used so that the deficit κ below combines ''h''&lt;sub&gt;KS&lt;/sub&gt; (nats/s) and ''C''&lt;sub&gt;eff&lt;/sub&gt; ln 2 (bits/s converted to nats/s) in consistent units; an equivalent all-bits form would be κ&lt;sub&gt;bits&lt;/sub&gt; = ''h''&lt;sub&gt;KS,bits&lt;/sub&gt; − ''C''&lt;sub&gt;eff&lt;/sub&gt;.

'''Ignorance rate κ''' (s&lt;sup&gt;−1&lt;/sup&gt;):
:κ = ''h''&lt;sub&gt;KS&lt;/sub&gt; − ''C''&lt;sub&gt;eff&lt;/sub&gt; · ln 2
The framework distinguishes two regimes. When κ &lt; 0 (''capacity-wins''), basis-tracking error stays bounded and standard quantum mechanics is recovered. When κ &gt; 0 (''chaos-wins''), the variance of the basis-tracking error grows exponentially in time as σ&lt;sub&gt;θ&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt;(''t'') = σ&lt;sub&gt;0&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt; e&lt;sup&gt;2κ''t''&lt;/sup&gt;.

'''Measured visibility ''V''(''t'')'''. Averaging the interference term cos(φ − θ) over a Gaussian distribution of basis-tracking error δθ ∼ ''N''(0, σ&lt;sub&gt;θ&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt;(''t'')) yields, in the small-angle regime,
:''V''(''t'') = exp(−½ σ&lt;sub&gt;0&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt; e&lt;sup&gt;2κ''t''&lt;/sup&gt;)
i.e. a ''double-exponential'' decay of visibility once the chaos-wins regime is entered.

'''Breakdown time ''t''&lt;sub&gt;break&lt;/sub&gt;'''. For a chosen visibility threshold ''V''*,
:''t''&lt;sub&gt;break&lt;/sub&gt; = (1 / 2κ) · ln(−2 ln ''V''* / σ&lt;sub&gt;0&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt;) for κ &gt; 0.
''t''&lt;sub&gt;break&lt;/sub&gt; is the framework's primary observable.

The technical derivation extends the Data-Rate Theorem of Nair &amp; Evans (2004) and Tatikonda &amp; Mitter (2004) from linear plants to nonlinear, chaotic systems by substituting ''h''&lt;sub&gt;KS&lt;/sub&gt; for the sum-of-positive-eigenvalues bound. This extension is an explicit assumption of the framework rather than a proven theorem (see [[#Open objections|Open objections]]).

== Experimental discriminator ==

The framework prescribes the following experimental protocol as its central falsifiable test.

'''Independent variable''': controller input power ''P''. The controller is the physical system whose state defines and maintains the measurement basis (e.g. an interferometer phase-locking loop, a qubit readout chain, the active feedback in a precision interferometer).

'''Held constant''': the environmental temperature ''T'' at which the controller operates, by independent active thermal feedback. Holding ''T'' constant while varying ''P'' is what distinguishes the framework's prediction from standard thermal decoherence (which depends on ''T'' and ignores ''P'').

'''Dependent variable''': the visibility-decay breakdown time ''t''&lt;sub&gt;break&lt;/sub&gt;, fitted to interference data at a chosen visibility threshold (e.g. ''V''* = 0.5).

'''Prediction''': ∂''t''&lt;sub&gt;break&lt;/sub&gt;/∂''P'' &gt; 0 at clamped ''T'', with the visibility curve ''V''(''t'') fitting the double-exponential form exp(−½ σ&lt;sub&gt;0&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt; e&lt;sup&gt;2κ''t''&lt;/sup&gt;) better than a standard exponential ''e''&lt;sup&gt;−Γ''t''&lt;/sup&gt; or Gaussian ''e''&lt;sup&gt;−γ''t''²&lt;/sup&gt;.

'''What would count as falsification'''. Any of the following null findings counts against the framework:
* ∂''t''&lt;sub&gt;break&lt;/sub&gt;/∂''P'' ≤ 0 at clamped ''T'' (i.e. increasing controller power does not extend, or shortens, coherence time);
* ''V''(''t'') fits a single-exponential or Gaussian dephasing law significantly better than the double-exponential form, in the regime where the framework predicts the double-exponential should dominate;
* ''t''&lt;sub&gt;break&lt;/sub&gt; scales with the gravitational self-energy timescale ''t''&lt;sub&gt;OR&lt;/sub&gt; ∝ ''s'' / ''m''&lt;sup&gt;2&lt;/sup&gt; (the [[Penrose interpretation of quantum mechanics|Penrose Objective Reduction]] prediction) rather than with ''C''&lt;sub&gt;eff&lt;/sub&gt;;
* ''C''&lt;sub&gt;eff&lt;/sub&gt; cannot be calibrated independently of ''t''&lt;sub&gt;break&lt;/sub&gt; (in which case the prediction would be unfalsifiable, which would itself count against the framework's experimental status).

The QGEM pathfinder is cited in the BLQC manuscript as one candidate testbed; superconducting-qubit readout chains and precision interferometer phase-locking loops are others.

== Relation to quantum foundations ==

The framework is connected to, and partly draws from, several existing positions in the foundations of quantum mechanics.

* '''Brukner's information-theoretic reconstructions''' provide a precedent for treating information limits as structural constraints in quantum theory.
* '''Relational Quantum Mechanics''' (Rovelli) takes measurement outcomes to be relative to an observer-system; the framework provides one possible mechanism (finite ''C''&lt;sub&gt;eff&lt;/sub&gt;) for what makes one observer's frame physically inequivalent to another's.
* '''Decoherence theory''' is not opposed by the framework. The framework's prediction sits beside ordinary environmental decoherence and is intended to be ''distinguishable'' from it by the sign-reversal under power variation; in the capacity-wins regime (κ &lt; 0) standard decoherence theory is recovered.
* '''Measurement-independence'''. Because the framework treats the measurement basis as a dynamical variable with its own causal history, if extended to Bell-type set-ups it appears to imply a structural violation of statistical measurement-independence. The framework's response to the conventional &quot;conspiracy&quot; objection against superdeterminism is to attribute the correlation to common causal past plus a global consistency constraint rather than to fine-tuned initial conditions. This response is philosophical rather than mathematical and the formal extension (including a no-signalling treatment) is itself an open question (see [[#Open objections|Open objections]]).
* '''Penrose Objective Reduction''' is treated as an ''orthogonal'' competing mechanism whose predicted ''t''&lt;sub&gt;OR&lt;/sub&gt; ∝ ''s'' / ''m''&lt;sup&gt;2&lt;/sup&gt; scaling can be experimentally distinguished from the framework's ''C''&lt;sub&gt;eff&lt;/sub&gt;-driven ''t''&lt;sub&gt;break&lt;/sub&gt;. The numerical proximity of the two timescales in the mesoscopic regime motivates the protocol described in the next section but is treated as a coincidence pending experimental evidence.

== Philosophical interpretation ==

''This section describes interpretive extensions of the framework that go beyond the empirical core. Nothing in this section is a load-bearing element of the experimental claim. If the experimental discriminator returns a null result, the claimed physical realization of these interpretive readings within the framework would fall. The interpretive positions themselves — Advaita Vedānta, relational quantum mechanics — do not stand or fall on an interferometry experiment; what stands or falls is the framework's specific physical mapping into them.''

A direct statement of the framework's interpretive position appears in ''The Hard Problem Dissolved — But Into What? A Critical Response to Carlo Rovelli's &quot;There Is No 'Hard Problem of Consciousness'&quot;'' (Dekker, May 2026). The response engages Rovelli's recent Noema essay, marks the substantial ground it shares with the framework, and identifies where the framework presses beyond Rovelli's deflationary physicalism toward a non-dual reading. Readers approaching the framework from philosophy of mind may find that essay the most accessible entry point.

The framework's interpretive layer is developed in dialogue with two existing positions.

The first is Carlo Rovelli's relational quantum mechanics. The framework can be read as supplying a candidate physical mechanism — the ''C''&lt;sub&gt;eff&lt;/sub&gt; versus ''h''&lt;sub&gt;KS&lt;/sub&gt; inequality — for what makes a measurement outcome relative to an observer rather than absolute. On this reading, the framework is a mechanistic specification of an idea that RQM leaves at the level of principle.

The second is the Advaita Vedānta tradition (Śaṅkara, Ramaṇa Mahaṛṣi), in which the apparent independence of the experiencing subject from the perceived world is treated as a structural feature of ignorance (''avidyā'') rather than a metaphysical fact. The framework's σ&lt;sub&gt;θ&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt;(''t'') — the growing basis-tracking error of an observer whose capacity is insufficient to track its own apparatus — admits a structural analogy with avidyā as the phenomenological self-opacity of an embodied subject. The framework neither asserts that this analogy is more than structural nor that any experimental result could confirm or refute Advaita as a philosophical position; it offers the analogy as a way of locating the framework within a non-dual reading of the measurement problem for readers who find that reading useful.

Readers who prefer to ignore both interpretive readings should be able to evaluate the framework's empirical content from the [[#Technical proposal|Technical proposal]] and [[#Experimental discriminator|Experimental discriminator]] sections alone.

A further speculative extension, ''The Creation of Duality'', asks whether space, time, objecthood, and gravity-like structure can themselves be read as features of a consistent finite-observer world-model, with a Bridge Ansatz ''E''&lt;sub&gt;G&lt;/sub&gt; = (π/2)ℏκ linking the deficit rate κ to a gravitational energy scale via Margolus–Levitin saturation. Its scientific status is contingent on the BLQC experimental discriminator; until then it is offered explicitly as speculation.

== Documents ==

The framework's documents are published at ignorantobserver.xyz. Direct links to the principal documents:

* '''Bandwidth-Limited Quantum Control''' — finite-rate phase-reference test in the Penrose-overlap regime. The framework's falsifiable experimental discriminator.
* '''The Ignorant Observer''' — main framework document. Physical formalization inspired by Advaita Vedanta's insight into ignorance.
* '''Comprehensive Experimental Protocol''' — preregistered prospective experiment discriminating a Penrose-style mass-geometry timescale from the BLQC capacity / instability timescale in the same mesoscopic apparatus.
* '''Forensic Signatures''' — retrospective screening of Chinese 63-qubit, Google Sycamore, and LIGO data for the double-exponential visibility decay signature predicted by BLQC. Motivating evidence for treating LIGO as a candidate regime; not causal attribution. Detailed findings and caveats are discussed in [[#Open objections|Open objections]].
* '''The Capacity–Backaction Frontier''' — application to cryogenic quantum error correction. Defines an operational coordinate ρ&lt;sub&gt;CB&lt;/sub&gt; = ε&lt;sub&gt;QEC&lt;/sub&gt; ''C''&lt;sub&gt;eff&lt;/sub&gt; ln 2 / ''h''&lt;sub&gt;eff&lt;/sub&gt;(''N'', ''C''&lt;sub&gt;eff&lt;/sub&gt;) comparing useful syndrome capacity against the physical instability induced by obtaining and using it.
* '''Concise Mathematical Summary''' — shortest formal map of the IOF variables and BLQC test regimes.
* '''Questions and Answers (IOF)''' — common questions on the framework addressed in depth.
* '''Scientific Editorial Assessment''' — overview of the project architecture, explaining why BLQC is the technical hinge and how the philosophical and cosmological documents should be read conditionally.

A full archival deposit of the framework's documents is also available on the Open Science Framework at doi.org/10.17605/OSF.IO/FCDSN.

== Open objections ==

The following objections to the framework are listed openly so that reviewers can engage with them directly. Several are diagnosed in the framework's own manuscripts; others reflect critiques the author has received in correspondence or anticipates from sophisticated readers. They are deliberately phrased from outside the framework's assumptions, not from within them.

# '''Useful capacity versus thermodynamic bound'''. The framework uses the Landauer expression ''C'' ≤ ''P'' / (''k''&lt;sub&gt;B&lt;/sub&gt; ''T'' ln 2) to relate controller input power ''P'' to channel capacity. Landauer is an ideal upper bound on bit-erasure cost; it does not guarantee that increased ''P'' actually translates to increased ''useful'' basis-tracking capacity. Additional power can equally well couple to actuator noise, electromagnetic leakage, vibration, or backaction channels that do not constrain the basis variable θ. Establishing that Δ''P'' → Δ''C''&lt;sub&gt;eff&lt;/sub&gt; in the predicted direction — with realistic loss budgets for the candidate apparatus — is a substantive engineering claim that the framework does not by itself establish.
# '''Existence of positive ''h''&lt;sub&gt;KS&lt;/sub&gt; in engineered apparatus'''. Many precision controllers (phase-locked loops, qubit readout chains, interferometer servo systems) are explicitly engineered to suppress chaotic dynamics. The basis-defining degrees of freedom may exhibit colored noise, slow drift, or stochastic control error rather than positive-''h''&lt;sub&gt;KS&lt;/sub&gt; chaos in the Pesin sense. If the relevant dynamics are not chaotic in this sense, the ''h''&lt;sub&gt;KS&lt;/sub&gt; framing may not apply at all, and a different rate-distortion accounting (or none) would be needed. Even where positive ''h''&lt;sub&gt;KS&lt;/sub&gt; can be identified, the operationally relevant rate may differ substantially from textbook surrogate estimates (kicked rotor, logistic map) used illustratively in the manuscripts.
# '''Rate-distortion extension to nonlinear / chaotic systems'''. The mapping from channel capacity ''C'' to angular tracking variance σ&lt;sub&gt;θ&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt; ≥ ''D''/(''C'' ln 2) assumes a high-rate coder model and the framework extends the Data-Rate Theorem from linear plants to nonlinear chaotic systems by substituting ''h''&lt;sub&gt;KS&lt;/sub&gt;. This extension is an explicit assumption, not a proven theorem. If the extension fails, the closed-form visibility law and the κ-regime structure both lose their derivation.
# '''Gaussian small-angle assumption'''. The visibility expression ''V''(''t'') = exp(−½ σ&lt;sub&gt;θ&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt;) requires σ&lt;sub&gt;θ&lt;/sub&gt; ≲ 1 rad and a Gaussian basis-tracking error distribution. Non-Gaussian, heavy-tailed, or state-dependent δθ would break the closed-form double-exponential law.
# '''Decoherence and control-noise confound'''. Distinguishing the predicted visibility loss from ordinary environmental dephasing, alignment drift, and detector systematics is the central experimental challenge. The framework's answer is the sign-reversal under power variation at clamped ''T'' — a conceptually clean discriminator that is engineering-hard to realise. Independent calibration of ''C''&lt;sub&gt;eff&lt;/sub&gt; may be the single largest practical hurdle.
# '''Prior-art and reparameterization risk'''. The proposed double-exponential visibility signature may already be expressible within existing frameworks: compound dephasing channels with two or more contributing rates, classical feedback-loop instability, or hidden-variable control-noise models with appropriate parameter choices. The framework should be able to show that its prediction is genuinely new rather than a reparameterization of one of these known phenomena. The author's adversarial-mimic analysis is in progress, and a positive result on that front would substantially strengthen the framework's empirical claim.
# '''Bell / locality consistency'''. The framework implies a structural violation of statistical measurement-independence. The author's response (common causal past plus global consistency, in place of fine-tuned initial conditions) is a philosophical reframing rather than a no-signalling lemma. A proper consistency proof has not been published.
# '''Forensic-signature interpretation'''. The Forensic Signatures preprint applies a screening protocol to existing data from Chinese 63-qubit processors, Google Sycamore, and LIGO glitch records. The paper's own domain-of-validity statement is that BLQC applies in observer-limited rather than plant-limited regimes, and the protocol finds power-law dominance on the qubit datasets (consistent with that statement) and 43% Gompertz-consistent events on LIGO (consistent with BLQC). The paper flags a controller-regime confound for the LIGO result and is explicit that retrospective findings do not establish causal attribution to BLQC; the case rests on the prospective controlled-capacity experiment. The objection here is the standard one for retrospective signal analyses: even where the predicted geometry is present, it remains compatible with alternative explanations until the controlled experiment runs.
# '''Observer language'''. The framework's &quot;observer&quot; plays two distinct roles: the physical apparatus / controller whose finite ''C''&lt;sub&gt;eff&lt;/sub&gt; and ''h''&lt;sub&gt;KS&lt;/sub&gt; appear in the equations, and the epistemic subject for whom measurement outcomes are or are not determinate. The framework treats these as connected but not identified, and the distinction is load-bearing. Critics will reasonably worry — especially given the framework's interpretive engagement with non-dual philosophy and the philosophy of mind — that consciousness is being smuggled into the foundations of measurement under physical vocabulary. The framework's defence is that the BLQC experimental claim is stated entirely in apparatus-level terms; whether that defence holds depends on the framework keeping the two senses of &quot;observer&quot; rigorously separate.
# '''Interpretive vocabulary'''. Some of the framework's documents draw on vocabulary from philosophy of mind and non-dual philosophy (notably Advaita Vedānta) alongside the physical derivations. Readers who find this vocabulary off-putting are invited to evaluate the empirical content from the BLQC manuscript, which uses only standard physics and control-theory language.
# '''Peer-review status and independent replication'''. The framework has not yet undergone peer review, and the experimental discriminator has not been independently replicated. This is the actual current epistemic status of the work. The framework's case must be evaluated on its merits in the documents linked above and on the conduct of the prospective experiment, not on any external imprimatur.

== Invitation for review ==

This page is offered as a venue for substantive critique. The author is particularly interested in engagement on the following:

* '''From physicists working on quantum control or precision interferometry''': is the proposed sign-reversal under controller-power variation at clamped temperature genuinely distinguishable from known instrumental artefacts (closed-loop resonances, thermal-noise mismodelling, photon-shot-noise rebalancing at higher gain), and what existing apparatus would be best positioned to perform the test?
* '''From decoherence theorists''': under what conditions does the proposed double-exponential visibility law overlap with compound-channel decoherence models in ways that would make the two empirically indistinguishable? Is there a parameter regime where the framework's prediction is genuinely new rather than a reparameterisation of existing models?
* '''From researchers in the foundations of quantum mechanics''': how should the framework's structural violation of measurement-independence be evaluated against the alternatives in the superdeterminism / retrocausality / many-worlds landscape, and what would constitute a satisfactory consistency proof?
* '''From philosophers of mind''': the Advaita / RQM interpretive layer is offered conditionally on the empirical core. Is the conditional structure (&quot;these readings are available ''if'' the empirical claim survives&quot;) presented clearly enough, or does it still amount to overreach?

Comments, references to prior or parallel work the author may not be aware of, and pointers to potential confounds or alternative explanations are all welcome. Substantive critique on the [[Talk:The Ignorant Observer Framework|talk page]] will be acknowledged in subsequent revisions of the manuscripts.

== References ==

* Brukner, Č., &amp; Zeilinger, A. (1999). Operationally invariant information in quantum measurements. ''Physical Review Letters'', 83(17), 3354–3357.
* Nair, G. N., &amp; Evans, R. J. (2004). Stabilizability of stochastic linear systems with finite feedback data rates. ''SIAM Journal on Control and Optimization'', 43(2), 413–436.
* Penrose, R. (1996). On gravity's role in quantum state reduction. ''General Relativity and Gravitation'', 28(5), 581–600.
* Rovelli, C. (1996). Relational quantum mechanics. ''International Journal of Theoretical Physics'', 35(8), 1637–1678.
* Tatikonda, S., &amp; Mitter, S. (2004). Control under communication constraints. ''IEEE Transactions on Automatic Control'', 49(7), 1056–1068.

== See also ==

* [[w:Quantum decoherence|Decoherence]] (Wikipedia)
* [[w:Relational quantum mechanics|Relational quantum mechanics]] (Wikipedia)
* [[w:Penrose interpretation|Penrose interpretation]] (Wikipedia)
* [[w:Data-rate theorem|Data-rate theorem]] (Wikipedia)

[[Category:Research projects]]
[[Category:Quantum mechanics]]
[[Category:Philosophy of physics]]</text>
      <sha1>383co5336lgs5ep51fpk407kgg63sby</sha1>
    </revision>
    <revision>
      <id>2809883</id>
      <parentid>2809882</parentid>
      <timestamp>2026-05-17T09:36:42Z</timestamp>
      <contributor>
        <username>IgnorantObserver</username>
        <id>3076980</id>
      </contributor>
      <comment>Add external links to source documents and references. Authored by Aernoud Dekker.</comment>
      <origin>2809883</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="26182" sha1="eurp7s3fqhlxvd6qe9usb3f66fv87sd" xml:space="preserve">{{Research project}}

= The Ignorant Observer Framework =

''This research page is authored and maintained by [[User:IgnorantObserver|Aernoud Dekker]], an independent researcher and the originator of the framework described below. Page text is offered for review, critique, and collaborative refinement under [[Wikiversity:Copyrights|Wikiversity's standard licence]].''

== Status ==

Research project under active development. The framework consists of an interlinked set of technical and interpretive documents published at [https://ignorantobserver.xyz ignorantobserver.xyz] and archived on the [https://osf.io Open Science Framework]. The technical module ''Bandwidth-Limited Quantum Control'' (BLQC) sets out the framework's falsifiable experimental discriminator. The broader ''Ignorant Observer Framework'' (IOF) connects this technical core to questions in the foundations of quantum mechanics and the philosophy of mind. All work is single-authored.

== Summary ==

The Ignorant Observer Framework proposes that the conventional treatment of quantum measurement idealizes the measurement basis as stably available to the observer. The framework removes that idealization. It treats the measurement basis θ as a physical dynamical variable inside the apparatus, with its own causal history and its own information-production rate. Whether the apparatus can stably track θ is then a control-theoretic question, governed by an inequality between effective information-channel capacity and the basis-defining dynamics' entropy rate.

''Bandwidth-Limited Quantum Control'' (BLQC), the framework's technical module, derives — under the assumptions catalogued in the [[#Open objections|Open objections]] section below — a distinctive ''double-exponential'' visibility decay law and a corresponding falsifiable experimental signature: under variation of controller input power at clamped environmental temperature, the framework predicts that coherence time should ''lengthen'' with increasing power, the opposite of standard thermal decoherence. This sign-reversal is the central testable claim.

The framework as a whole also offers an interpretive extension that connects the technical proposal to existing positions in quantum foundations (Brukner, Rovelli's relational quantum mechanics) and to non-dual philosophy of mind (Advaita Vedānta). These interpretive elements are clearly fenced from the empirical core in [[#Philosophical interpretation|the relevant section below]]. What stands or falls with the experimental discriminator is the framework's specific physical mapping into these positions, not the positions themselves.

== Core question ==

''Can quantum visibility depend on finite observer or apparatus basis-tracking capacity, independently of, and distinguishably from, ordinary environmental decoherence?''

Phrased positively: if the classical degrees of freedom that define and maintain a measurement basis exhibit chaotic dynamics with positive Kolmogorov–Sinai entropy rate ''h''&lt;sub&gt;KS&lt;/sub&gt;, and if the effective information channel that constrains those degrees of freedom has capacity ''C''&lt;sub&gt;eff&lt;/sub&gt; insufficient to track them, does interference visibility decay in a functional form distinguishable from standard exponential or Gaussian dephasing — and does this decay respond to controller input power in a direction opposite to thermal decoherence?

== Technical proposal ==

The framework introduces the following quantities.

'''Effective channel capacity ''C''&lt;sub&gt;eff&lt;/sub&gt;''' (bits/s): the information rate available to the basis-tracking control loop, operationalised as
:''C''&lt;sub&gt;eff&lt;/sub&gt; = ''r'' · ''b'' · ''f''
with ''r'' the update rate (Hz), ''b'' the effective number of bits per update that constrain the basis variable θ, and ''f'' ∈ (0,1] the fraction of updates that genuinely constrain θ after overhead and latency. ''C''&lt;sub&gt;eff&lt;/sub&gt; is bounded above by the Landauer limit on the controller's actuation:
:''C''&lt;sub&gt;eff&lt;/sub&gt; ≤ ''P'' / (''k''&lt;sub&gt;B&lt;/sub&gt; ''T'' ln 2)
where ''P'' is controller input power and ''T'' is the temperature at which the controller operates.

'''Kolmogorov–Sinai entropy rate ''h''&lt;sub&gt;KS&lt;/sub&gt;''' (nats/s): the information-production rate of the classical degrees of freedom (voltage references, timing circuits, feedback loops) that define and maintain the measurement basis. For chaotic systems, ''h''&lt;sub&gt;KS&lt;/sub&gt; equals the sum of positive Lyapunov exponents (Pesin identity). It is estimated operationally from the exponential growth of one-step prediction error on logged controller states. The nats/s convention is used so that the deficit κ below combines ''h''&lt;sub&gt;KS&lt;/sub&gt; (nats/s) and ''C''&lt;sub&gt;eff&lt;/sub&gt; ln 2 (bits/s converted to nats/s) in consistent units; an equivalent all-bits form would be κ&lt;sub&gt;bits&lt;/sub&gt; = ''h''&lt;sub&gt;KS,bits&lt;/sub&gt; − ''C''&lt;sub&gt;eff&lt;/sub&gt;.

'''Ignorance rate κ''' (s&lt;sup&gt;−1&lt;/sup&gt;):
:κ = ''h''&lt;sub&gt;KS&lt;/sub&gt; − ''C''&lt;sub&gt;eff&lt;/sub&gt; · ln 2
The framework distinguishes two regimes. When κ &lt; 0 (''capacity-wins''), basis-tracking error stays bounded and standard quantum mechanics is recovered. When κ &gt; 0 (''chaos-wins''), the variance of the basis-tracking error grows exponentially in time as σ&lt;sub&gt;θ&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt;(''t'') = σ&lt;sub&gt;0&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt; e&lt;sup&gt;2κ''t''&lt;/sup&gt;.

'''Measured visibility ''V''(''t'')'''. Averaging the interference term cos(φ − θ) over a Gaussian distribution of basis-tracking error δθ ∼ ''N''(0, σ&lt;sub&gt;θ&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt;(''t'')) yields, in the small-angle regime,
:''V''(''t'') = exp(−½ σ&lt;sub&gt;0&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt; e&lt;sup&gt;2κ''t''&lt;/sup&gt;)
i.e. a ''double-exponential'' decay of visibility once the chaos-wins regime is entered.

'''Breakdown time ''t''&lt;sub&gt;break&lt;/sub&gt;'''. For a chosen visibility threshold ''V''*,
:''t''&lt;sub&gt;break&lt;/sub&gt; = (1 / 2κ) · ln(−2 ln ''V''* / σ&lt;sub&gt;0&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt;) for κ &gt; 0.
''t''&lt;sub&gt;break&lt;/sub&gt; is the framework's primary observable.

The technical derivation extends the Data-Rate Theorem of Nair &amp; Evans (2004) and Tatikonda &amp; Mitter (2004) from linear plants to nonlinear, chaotic systems by substituting ''h''&lt;sub&gt;KS&lt;/sub&gt; for the sum-of-positive-eigenvalues bound. This extension is an explicit assumption of the framework rather than a proven theorem (see [[#Open objections|Open objections]]).

== Experimental discriminator ==

The framework prescribes the following experimental protocol as its central falsifiable test.

'''Independent variable''': controller input power ''P''. The controller is the physical system whose state defines and maintains the measurement basis (e.g. an interferometer phase-locking loop, a qubit readout chain, the active feedback in a precision interferometer).

'''Held constant''': the environmental temperature ''T'' at which the controller operates, by independent active thermal feedback. Holding ''T'' constant while varying ''P'' is what distinguishes the framework's prediction from standard thermal decoherence (which depends on ''T'' and ignores ''P'').

'''Dependent variable''': the visibility-decay breakdown time ''t''&lt;sub&gt;break&lt;/sub&gt;, fitted to interference data at a chosen visibility threshold (e.g. ''V''* = 0.5).

'''Prediction''': ∂''t''&lt;sub&gt;break&lt;/sub&gt;/∂''P'' &gt; 0 at clamped ''T'', with the visibility curve ''V''(''t'') fitting the double-exponential form exp(−½ σ&lt;sub&gt;0&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt; e&lt;sup&gt;2κ''t''&lt;/sup&gt;) better than a standard exponential ''e''&lt;sup&gt;−Γ''t''&lt;/sup&gt; or Gaussian ''e''&lt;sup&gt;−γ''t''²&lt;/sup&gt;.

'''What would count as falsification'''. Any of the following null findings counts against the framework:
* ∂''t''&lt;sub&gt;break&lt;/sub&gt;/∂''P'' ≤ 0 at clamped ''T'' (i.e. increasing controller power does not extend, or shortens, coherence time);
* ''V''(''t'') fits a single-exponential or Gaussian dephasing law significantly better than the double-exponential form, in the regime where the framework predicts the double-exponential should dominate;
* ''t''&lt;sub&gt;break&lt;/sub&gt; scales with the gravitational self-energy timescale ''t''&lt;sub&gt;OR&lt;/sub&gt; ∝ ''s'' / ''m''&lt;sup&gt;2&lt;/sup&gt; (the [[Penrose interpretation of quantum mechanics|Penrose Objective Reduction]] prediction) rather than with ''C''&lt;sub&gt;eff&lt;/sub&gt;;
* ''C''&lt;sub&gt;eff&lt;/sub&gt; cannot be calibrated independently of ''t''&lt;sub&gt;break&lt;/sub&gt; (in which case the prediction would be unfalsifiable, which would itself count against the framework's experimental status).

The [https://www.qgemproject.com/ QGEM] pathfinder is cited in the BLQC manuscript as one candidate testbed; superconducting-qubit readout chains and precision interferometer phase-locking loops are others.

== Relation to quantum foundations ==

The framework is connected to, and partly draws from, several existing positions in the foundations of quantum mechanics.

* '''Brukner's information-theoretic reconstructions''' provide a precedent for treating information limits as structural constraints in quantum theory.
* '''Relational Quantum Mechanics''' (Rovelli) takes measurement outcomes to be relative to an observer-system; the framework provides one possible mechanism (finite ''C''&lt;sub&gt;eff&lt;/sub&gt;) for what makes one observer's frame physically inequivalent to another's.
* '''Decoherence theory''' is not opposed by the framework. The framework's prediction sits beside ordinary environmental decoherence and is intended to be ''distinguishable'' from it by the sign-reversal under power variation; in the capacity-wins regime (κ &lt; 0) standard decoherence theory is recovered.
* '''Measurement-independence'''. Because the framework treats the measurement basis as a dynamical variable with its own causal history, if extended to Bell-type set-ups it appears to imply a structural violation of statistical measurement-independence. The framework's response to the conventional &quot;conspiracy&quot; objection against superdeterminism is to attribute the correlation to common causal past plus a global consistency constraint rather than to fine-tuned initial conditions. This response is philosophical rather than mathematical and the formal extension (including a no-signalling treatment) is itself an open question (see [[#Open objections|Open objections]]).
* '''Penrose Objective Reduction''' is treated as an ''orthogonal'' competing mechanism whose predicted ''t''&lt;sub&gt;OR&lt;/sub&gt; ∝ ''s'' / ''m''&lt;sup&gt;2&lt;/sup&gt; scaling can be experimentally distinguished from the framework's ''C''&lt;sub&gt;eff&lt;/sub&gt;-driven ''t''&lt;sub&gt;break&lt;/sub&gt;. The numerical proximity of the two timescales in the mesoscopic regime motivates the protocol described in the next section but is treated as a coincidence pending experimental evidence.

== Philosophical interpretation ==

''This section describes interpretive extensions of the framework that go beyond the empirical core. Nothing in this section is a load-bearing element of the experimental claim. If the experimental discriminator returns a null result, the claimed physical realization of these interpretive readings within the framework would fall. The interpretive positions themselves — Advaita Vedānta, relational quantum mechanics — do not stand or fall on an interferometry experiment; what stands or falls is the framework's specific physical mapping into them.''

A direct statement of the framework's interpretive position appears in ''[https://ignorantobserver.xyz/documents/Hard_Problem_After_Deflation.pdf The Hard Problem Dissolved — But Into What? A Critical Response to Carlo Rovelli's &quot;There Is No 'Hard Problem of Consciousness'&quot;]'' (Dekker, May 2026). The response engages Rovelli's recent Noema essay, marks the substantial ground it shares with the framework, and identifies where the framework presses beyond Rovelli's deflationary physicalism toward a non-dual reading. Readers approaching the framework from philosophy of mind may find that essay the most accessible entry point.

The framework's interpretive layer is developed in dialogue with two existing positions.

The first is Carlo Rovelli's relational quantum mechanics. The framework can be read as supplying a candidate physical mechanism — the ''C''&lt;sub&gt;eff&lt;/sub&gt; versus ''h''&lt;sub&gt;KS&lt;/sub&gt; inequality — for what makes a measurement outcome relative to an observer rather than absolute. On this reading, the framework is a mechanistic specification of an idea that RQM leaves at the level of principle.

The second is the Advaita Vedānta tradition (Śaṅkara, Ramaṇa Mahaṛṣi), in which the apparent independence of the experiencing subject from the perceived world is treated as a structural feature of ignorance (''avidyā'') rather than a metaphysical fact. The framework's σ&lt;sub&gt;θ&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt;(''t'') — the growing basis-tracking error of an observer whose capacity is insufficient to track its own apparatus — admits a structural analogy with avidyā as the phenomenological self-opacity of an embodied subject. The framework neither asserts that this analogy is more than structural nor that any experimental result could confirm or refute Advaita as a philosophical position; it offers the analogy as a way of locating the framework within a non-dual reading of the measurement problem for readers who find that reading useful.

Readers who prefer to ignore both interpretive readings should be able to evaluate the framework's empirical content from the [[#Technical proposal|Technical proposal]] and [[#Experimental discriminator|Experimental discriminator]] sections alone.

A further speculative extension, ''[https://ignorantobserver.xyz/documents/Creation_of_Duality.pdf The Creation of Duality]'', asks whether space, time, objecthood, and gravity-like structure can themselves be read as features of a consistent finite-observer world-model, with a Bridge Ansatz ''E''&lt;sub&gt;G&lt;/sub&gt; = (π/2)ℏκ linking the deficit rate κ to a gravitational energy scale via Margolus–Levitin saturation. Its scientific status is contingent on the BLQC experimental discriminator; until then it is offered explicitly as speculation.

== Documents ==

The framework's documents are published at [https://ignorantobserver.xyz ignorantobserver.xyz]. Direct links to the principal documents:

* '''[https://ignorantobserver.xyz/documents/BLQC.pdf Bandwidth-Limited Quantum Control]''' — finite-rate phase-reference test in the Penrose-overlap regime. The framework's falsifiable experimental discriminator.
* '''[https://ignorantobserver.xyz/documents/The_Ignorant_Observer.pdf The Ignorant Observer]''' — main framework document. Physical formalization inspired by Advaita Vedanta's insight into ignorance.
* '''[https://ignorantobserver.xyz/documents/Comprehensive_Experimental_Protocol.pdf Comprehensive Experimental Protocol]''' — preregistered prospective experiment discriminating a Penrose-style mass-geometry timescale from the BLQC capacity / instability timescale in the same mesoscopic apparatus.
* '''[https://ignorantobserver.xyz/documents/Forensic_Signatures.pdf Forensic Signatures]''' — retrospective screening of Chinese 63-qubit, Google Sycamore, and LIGO data for the double-exponential visibility decay signature predicted by BLQC. Motivating evidence for treating LIGO as a candidate regime; not causal attribution. Detailed findings and caveats are discussed in [[#Open objections|Open objections]].
* '''[https://ignorantobserver.xyz/documents/Capacity_Backaction_Frontier.pdf The Capacity–Backaction Frontier]''' — application to cryogenic quantum error correction. Defines an operational coordinate ρ&lt;sub&gt;CB&lt;/sub&gt; = ε&lt;sub&gt;QEC&lt;/sub&gt; ''C''&lt;sub&gt;eff&lt;/sub&gt; ln 2 / ''h''&lt;sub&gt;eff&lt;/sub&gt;(''N'', ''C''&lt;sub&gt;eff&lt;/sub&gt;) comparing useful syndrome capacity against the physical instability induced by obtaining and using it.
* '''[https://ignorantobserver.xyz/documents/Concise_Summary.pdf Concise Mathematical Summary]''' — shortest formal map of the IOF variables and BLQC test regimes.
* '''[https://ignorantobserver.xyz/documents/Question_and_Answers_IOF.pdf Questions and Answers (IOF)]''' — common questions on the framework addressed in depth.
* '''[https://ignorantobserver.xyz/documents/IOF_Assessment.pdf Scientific Editorial Assessment]''' — overview of the project architecture, explaining why BLQC is the technical hinge and how the philosophical and cosmological documents should be read conditionally.

A full archival deposit of the framework's documents is also available on the Open Science Framework at [https://doi.org/10.17605/OSF.IO/FCDSN doi.org/10.17605/OSF.IO/FCDSN].

== Open objections ==

The following objections to the framework are listed openly so that reviewers can engage with them directly. Several are diagnosed in the framework's own manuscripts; others reflect critiques the author has received in correspondence or anticipates from sophisticated readers. They are deliberately phrased from outside the framework's assumptions, not from within them.

# '''Useful capacity versus thermodynamic bound'''. The framework uses the Landauer expression ''C'' ≤ ''P'' / (''k''&lt;sub&gt;B&lt;/sub&gt; ''T'' ln 2) to relate controller input power ''P'' to channel capacity. Landauer is an ideal upper bound on bit-erasure cost; it does not guarantee that increased ''P'' actually translates to increased ''useful'' basis-tracking capacity. Additional power can equally well couple to actuator noise, electromagnetic leakage, vibration, or backaction channels that do not constrain the basis variable θ. Establishing that Δ''P'' → Δ''C''&lt;sub&gt;eff&lt;/sub&gt; in the predicted direction — with realistic loss budgets for the candidate apparatus — is a substantive engineering claim that the framework does not by itself establish.
# '''Existence of positive ''h''&lt;sub&gt;KS&lt;/sub&gt; in engineered apparatus'''. Many precision controllers (phase-locked loops, qubit readout chains, interferometer servo systems) are explicitly engineered to suppress chaotic dynamics. The basis-defining degrees of freedom may exhibit colored noise, slow drift, or stochastic control error rather than positive-''h''&lt;sub&gt;KS&lt;/sub&gt; chaos in the Pesin sense. If the relevant dynamics are not chaotic in this sense, the ''h''&lt;sub&gt;KS&lt;/sub&gt; framing may not apply at all, and a different rate-distortion accounting (or none) would be needed. Even where positive ''h''&lt;sub&gt;KS&lt;/sub&gt; can be identified, the operationally relevant rate may differ substantially from textbook surrogate estimates (kicked rotor, logistic map) used illustratively in the manuscripts.
# '''Rate-distortion extension to nonlinear / chaotic systems'''. The mapping from channel capacity ''C'' to angular tracking variance σ&lt;sub&gt;θ&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt; ≥ ''D''/(''C'' ln 2) assumes a high-rate coder model and the framework extends the Data-Rate Theorem from linear plants to nonlinear chaotic systems by substituting ''h''&lt;sub&gt;KS&lt;/sub&gt;. This extension is an explicit assumption, not a proven theorem. If the extension fails, the closed-form visibility law and the κ-regime structure both lose their derivation.
# '''Gaussian small-angle assumption'''. The visibility expression ''V''(''t'') = exp(−½ σ&lt;sub&gt;θ&lt;/sub&gt;&lt;sup&gt;2&lt;/sup&gt;) requires σ&lt;sub&gt;θ&lt;/sub&gt; ≲ 1 rad and a Gaussian basis-tracking error distribution. Non-Gaussian, heavy-tailed, or state-dependent δθ would break the closed-form double-exponential law.
# '''Decoherence and control-noise confound'''. Distinguishing the predicted visibility loss from ordinary environmental dephasing, alignment drift, and detector systematics is the central experimental challenge. The framework's answer is the sign-reversal under power variation at clamped ''T'' — a conceptually clean discriminator that is engineering-hard to realise. Independent calibration of ''C''&lt;sub&gt;eff&lt;/sub&gt; may be the single largest practical hurdle.
# '''Prior-art and reparameterization risk'''. The proposed double-exponential visibility signature may already be expressible within existing frameworks: compound dephasing channels with two or more contributing rates, classical feedback-loop instability, or hidden-variable control-noise models with appropriate parameter choices. The framework should be able to show that its prediction is genuinely new rather than a reparameterization of one of these known phenomena. The author's adversarial-mimic analysis is in progress, and a positive result on that front would substantially strengthen the framework's empirical claim.
# '''Bell / locality consistency'''. The framework implies a structural violation of statistical measurement-independence. The author's response (common causal past plus global consistency, in place of fine-tuned initial conditions) is a philosophical reframing rather than a no-signalling lemma. A proper consistency proof has not been published.
# '''Forensic-signature interpretation'''. The Forensic Signatures preprint applies a screening protocol to existing data from Chinese 63-qubit processors, Google Sycamore, and LIGO glitch records. The paper's own domain-of-validity statement is that BLQC applies in observer-limited rather than plant-limited regimes, and the protocol finds power-law dominance on the qubit datasets (consistent with that statement) and 43% Gompertz-consistent events on LIGO (consistent with BLQC). The paper flags a controller-regime confound for the LIGO result and is explicit that retrospective findings do not establish causal attribution to BLQC; the case rests on the prospective controlled-capacity experiment. The objection here is the standard one for retrospective signal analyses: even where the predicted geometry is present, it remains compatible with alternative explanations until the controlled experiment runs.
# '''Observer language'''. The framework's &quot;observer&quot; plays two distinct roles: the physical apparatus / controller whose finite ''C''&lt;sub&gt;eff&lt;/sub&gt; and ''h''&lt;sub&gt;KS&lt;/sub&gt; appear in the equations, and the epistemic subject for whom measurement outcomes are or are not determinate. The framework treats these as connected but not identified, and the distinction is load-bearing. Critics will reasonably worry — especially given the framework's interpretive engagement with non-dual philosophy and the philosophy of mind — that consciousness is being smuggled into the foundations of measurement under physical vocabulary. The framework's defence is that the BLQC experimental claim is stated entirely in apparatus-level terms; whether that defence holds depends on the framework keeping the two senses of &quot;observer&quot; rigorously separate.
# '''Interpretive vocabulary'''. Some of the framework's documents draw on vocabulary from philosophy of mind and non-dual philosophy (notably Advaita Vedānta) alongside the physical derivations. Readers who find this vocabulary off-putting are invited to evaluate the empirical content from the BLQC manuscript, which uses only standard physics and control-theory language.
# '''Peer-review status and independent replication'''. The framework has not yet undergone peer review, and the experimental discriminator has not been independently replicated. This is the actual current epistemic status of the work. The framework's case must be evaluated on its merits in the documents linked above and on the conduct of the prospective experiment, not on any external imprimatur.

== Invitation for review ==

This page is offered as a venue for substantive critique. The author is particularly interested in engagement on the following:

* '''From physicists working on quantum control or precision interferometry''': is the proposed sign-reversal under controller-power variation at clamped temperature genuinely distinguishable from known instrumental artefacts (closed-loop resonances, thermal-noise mismodelling, photon-shot-noise rebalancing at higher gain), and what existing apparatus would be best positioned to perform the test?
* '''From decoherence theorists''': under what conditions does the proposed double-exponential visibility law overlap with compound-channel decoherence models in ways that would make the two empirically indistinguishable? Is there a parameter regime where the framework's prediction is genuinely new rather than a reparameterisation of existing models?
* '''From researchers in the foundations of quantum mechanics''': how should the framework's structural violation of measurement-independence be evaluated against the alternatives in the superdeterminism / retrocausality / many-worlds landscape, and what would constitute a satisfactory consistency proof?
* '''From philosophers of mind''': the Advaita / RQM interpretive layer is offered conditionally on the empirical core. Is the conditional structure (&quot;these readings are available ''if'' the empirical claim survives&quot;) presented clearly enough, or does it still amount to overreach?

Comments, references to prior or parallel work the author may not be aware of, and pointers to potential confounds or alternative explanations are all welcome. Substantive critique on the [[Talk:The Ignorant Observer Framework|talk page]] will be acknowledged in subsequent revisions of the manuscripts.

== References ==

* Brukner, Č., &amp; Zeilinger, A. (1999). Operationally invariant information in quantum measurements. ''Physical Review Letters'', 83(17), 3354–3357.
* Nair, G. N., &amp; Evans, R. J. (2004). Stabilizability of stochastic linear systems with finite feedback data rates. ''SIAM Journal on Control and Optimization'', 43(2), 413–436.
* Penrose, R. (1996). On gravity's role in quantum state reduction. ''General Relativity and Gravitation'', 28(5), 581–600.
* Rovelli, C. (1996). Relational quantum mechanics. ''International Journal of Theoretical Physics'', 35(8), 1637–1678.
* Tatikonda, S., &amp; Mitter, S. (2004). Control under communication constraints. ''IEEE Transactions on Automatic Control'', 49(7), 1056–1068.

== See also ==

* [[w:Quantum decoherence|Decoherence]] (Wikipedia)
* [[w:Relational quantum mechanics|Relational quantum mechanics]] (Wikipedia)
* [[w:Penrose interpretation|Penrose interpretation]] (Wikipedia)
* [[w:Data-rate theorem|Data-rate theorem]] (Wikipedia)

[[Category:Research projects]]
[[Category:Quantum mechanics]]
[[Category:Philosophy of physics]]</text>
      <sha1>eurp7s3fqhlxvd6qe9usb3f66fv87sd</sha1>
    </revision>
  </page>
  <page>
    <title>User talk:~2026-29634-71</title>
    <ns>3</ns>
    <id>329704</id>
    <revision>
      <id>2809893</id>
      <timestamp>2026-05-17T10:25:52Z</timestamp>
      <contributor>
        <username>MathXplore</username>
        <id>2888076</id>
      </contributor>
      <comment>advert1 ([[m:User:ZbVl/VD|Vandoom]])</comment>
      <origin>2809893</origin>
      <model>wikitext</model>
      <format>text/x-wiki</format>
      <text bytes="814" sha1="ta1wf45f16x224c79cgsu925s7xueb7" xml:space="preserve">

== 2026-05-17 ==
&lt;div class=&quot;mw-content-ltr&quot; dir=&quot;ltr&quot; style=&quot;text-align: left&quot; lang=&quot;en&quot;&gt;[[File:Information.svg|25px|alt=Information icon]] Hello. Apologies for writing this in English, but I wanted to let you know that one or more of [[Special:Contributions/&amp;#126;2026-29634-71|your recent contributions]] have been undone because they appeared to be promotional. [[:m:en:WP:SOAPBOX|Advertising or using &lt;span style=&quot;white-space:nowrap&quot;&gt;Wikiversity&lt;/span&gt; as a &quot;soapbox&quot;]] are not permitted. Take a look at the welcome pages to learn more about &lt;span style=&quot;white-space:nowrap&quot;&gt;Wikiversity&lt;/span&gt;. Thanks. &lt;/div&gt;&lt;!-- Glow-advert1 @ 1779013555639.5s --&gt;&lt;nowiki&gt;&lt;/nowiki&gt; [[User:MathXplore|MathXplore]] ([[User talk:MathXplore|discuss]] • [[Special:Contributions/MathXplore|contribs]]) 10:25, 17 May 2026 (UTC)</text>
      <sha1>ta1wf45f16x224c79cgsu925s7xueb7</sha1>
    </revision>
  </page>
</mediawiki>