<h2>Welcome to the arxivist! </h2>
<p>
The table above shows the most recent batch of arXiv articles, sorted based on the arxivist's a-Score. For signed-in users, a personalized a-Score is calculated for each article, and estimates users's interest in the article. Click on an article to see its arXiv page in this pane.


<br><br>
Log in to sign up for daily emails with your top 5 suggestions, join us on <a href="https://www.facebook.com/thearxivist">Facebook</a> to see the arXiv Catch of the Day, and email us at support@arxivist.com if you have suggestions as we continue to develop the arxivist beta!
<!-- 
<h3>First-time users: </h3>
<h4>
To get started:</h4>
1. Log in using your Google account (button on top right).<br>
2. Give us some initial preferences:<br>
&nbsp;&nbsp;&nbsp;&nbsp;a) In the search bar at the top, enter your name, so for example "au:Lukyanenko_Anton".<br>
&nbsp;&nbsp;&nbsp;&nbsp;b) Click on "search".<br>
&nbsp;&nbsp;&nbsp;&nbsp;c) Click on "thumb up" for your articles.<br>
&nbsp;&nbsp;&nbsp;&nbsp;d) Repeat with a few other authors you upvote (the more the better).<br>
3. Reload the page to show the most recent arxiv articles, now rated based on your preferences.<br>
4. Have feedback? Take a look at the FAQ below and email us some ideas or compliments.
</p>
<h4>Some tips:</h4>
<p>
1. Click on an article to see its abstract and full text in this panel.<br>
2. Is an article's score too low? Use "thumb up" to increase the score of similar articles. (Clicking "thumbs up" again resets your rating of the article.)<br>
3. To receive <strong>daily email updates</strong>, add your email address in the settings panel.<br>
4. The panels on the top and side can be resized (drag the border) or hidden (click on the middle of the border).
</p>
<br> -->


<h4>How many articles do I need to rate?</h4>
<p>The system becomes effective after about 5 upvotes, but improves as you keep rating articles.</p>

<h4>Can I see just one category of articles? E.g. just "hep-tp"?</h4>
Not explicitly. However, if you only upvote articles in hep-tp, then they will have a much higher computed rating so the effect will be what you want
most of the time. On the other hand, if someone happens to upload a paper relevant to you in a different part of the arXiv, you will still be able to see it. 

<h4>Can I just upvote all the papers by a certain author?</h4>
<p>Most likely. Search for "au:last_first", for example "au:lukyanenko_anton", and then click the "upvote all" at the bottom of the table. Note
that searching for more complicated names (starting with d', de, le, etc) is tricky. If you figure out the arxiv's general pattern for this,
please let us know.</p>

<h4>How do rankings work?</h4>
<p>Loosley speaking, the arxivist skims the title, authors and categories of each article to see whether it matches up with your interests
 as indicated through upvotes/downvotes of previous articles.
<br><br>
More specifically, the arxivist keeps track of keywords for each article: the authors and categories, as well as words and phrases in the title.
When you upvote/downvote an article, the arxivist interprets that as a upvote/downvote of each keyword for that article. When the arxivist needs to
rate a new article for you, it looks at your preference for each of the article's keywords and sums them up to get the total score.
<br><br>
For example, if you click thumbs-up for 10 articles in the category "math.MG", then any article in the category "math.MG" will gain 10 points
towards its computed score. Likewise, if you upvote 10 articles with the word "hyperbolic" in the title, any other article with the word "hyperbolic" 
will gain 10 points. Because word pairs are keywords as well, phrases like "Heisenberg group" count more strongly: liking 10 articles with the phrase 
"Heisenberg group" will give add a score of 30 towards any article with that phrase in the title.

<h4>What are some upcoming features?</h4>
<p>New features will be added as time permits, and in a bigger update once we reach 1000 users. Email us with more ideas!
<br>
* Custom email preferences (frequency, number of articles).<br>
* Filter for excessive article updates (high version numbers, minor updates).<br>
* Mobile version.<br>
* Broader sourcing (e.g., MathSciNet, PubMed, JMM).<br>


<h4>Is the arxivist private and/or secure?</h4>
Mostly, but not fully, like most things in life. <br>
1. The arxivist does keep track of access to the system and, obviously, user preferences. We use cookies to keep track of the layout and Google login.<br>
2. We won't use this information maliciously.<br>
3. However, the system <strong>is not secure</strong>, so anyone who tries hard enough will be able to access your data.


<h4>Who maintains the arxivist?</h4>
<p>The arxivist was created in the Fall of 2016 by <a href="http://lukyanenko.net">Anton Lukyanenko</a> and entered the beta in January 2017. The arxivist is not associated with the arXiv.
</p>