Game: Find the wikipedia article with the lowest view history

[beancounter]

This morning I checked out a couple of Wikipedia articles I had written to see if anyone was viewing them. The articles were on an obscure group of minerals, so I really didn't expect much activity.

It got me wondering if I could find other articles people had written with a smaller view history than my stuff.

So the game is to find a full article (not a stub) with the lowest view history and post a link to it here.

To find the view history, click "view history" in the upper right corner, then "page view statistics" on the next page. Select the 90 day view, and then post the link here.

I think you'll be surpised at how much activity some obscure topics get.

http://stats.grok.se/en/latest90/Carolingian_dynasty

34,116 views in the past 90 days. This should be an easy one to beat.

 

[Blobbenstein]

VeggieBoards has been viewed 539 times in the last 90 days.

 

[beancounter]

VeggieBoards has been viewed 539 times in the last 90 days.

Yea, but I think it's a stub.

 

[Blobbenstein]

what makes something a stub; is it just size?

Here's one, about the same size:
Adoration_of_the_Magi_(Perugino) has been viewed 417 times in the last 90 days.

I just found it using the Random Article function.....it is probably a stuff too..?

 

[beancounter]

Sometimes they specify a page as a stub, but from what I can tell, it's usually an article with a few short paragraphs.

 

[Blobbenstein]

so what you want is some obscure subject that has a few fanatics who will write huge pages. There are probably quite a few, but I don't know what they would be.

 

[beancounter]

so what you want is some obscure subject that has a few fanatics who will write huge pages. There are probably quite a few, but I don't know what they would be.

Well it's not hard to find a low page count on a subject that doesn't have a lot of information, as you've demonstrated.
I'm trying to make it somewhat challenging. Or maybe, you're just really good at this.

 

[Blobbenstein]

I suppose I could find an aspergers, OCD forum, and ask them...

 

[Blobbenstein]

I suppose some obscure maths theory might do it.

 

[beancounter]

I suppose I could find an aspergers, OCD forum, and ask them...

Hey personal attacks aren't allowed

 

[beancounter]

I suppose some obscure maths theory might do it.

I thought you were onto something, unfortuntely, no such luck...

http://stats.grok.se/en/latest90/Dynamical_system

Dynamical_system has been viewed 42,421 times in the last 90 days.

 

[Blobbenstein]

it would have to be more obscure than that.

 

[Spang]

Come at me: http://stats.grok.se/en/201405/La_Voisin

 

[beancounter]

Come at me: http://stats.grok.se/en/201405/La_Voisin

Excellent find!

 

[Spang]

Come at me: http://stats.grok.se/en/201405/La_Voisin

Done: http://stats.grok.se/en/latest90/lycaon