215:. Article was rewritten and recreated without solving this problem in any way, and hence we're back in an AFD again, not so very long after the previous one. Basically in the absence of a reliable source (with proper editorial control and peer review of the information) then the problem is that hash functions are two a penny, and there's no reason at all, under the Knowledge (XXG)'s policy that this should be kept. This is particularly so after we had a previous delete for the same reason. This article seems to me to be intended to be a form of advertising right now, the Knowledge (XXG) is not supposed to be here to create notability. -
1338:
merits inclusion in the project. As such, I cannot claim to be completely objective. Having said that, I gain no benefit, monetary or otherwise, from any increased exposure that MurmurHash may receive as a result of this article. I have not written about MurmurHash in any other forum, nor have I used it professionally, although I did spend an hour confirming the performance claims to my satisfaction. I should also remind you that I am not the original author of the article or of the algorithm, and I have been fully cleared of the sock puppetry charges that alleged the contrary.
801:, and what I found supports the notability of this article. I'm not going to copy and paste the whole thing here, but I will quote parts and refer to the rest in a way that assumes you have it up in another window. The basic requirement is that it must receive "significant coverage in reliable sources that are independent of the subject". I think the issue here is that these terms are being misunderstood in a way that inflates the difficulty of qualifying. Fortunately, the page does go into more detail, which I believe settles the issue.
721:, which includes the source code but also offers benchmark results that suggest the algorithm is substantially faster than alternatives. It would be entirely inappropriate for us to reference these self-published claims in the context of asserting them as true, and in fact, we do not. Rather, just as it's ok to quote someone's blog purely as a source for what that person has said, it's fine to point to Appleby's site for the exact code that he released into the public domain. In a similar way, we use
669:
experimental comparison of a spectrum of different hash functions trading off complexity, speed and collision resistance. The one that exhibited the best performance while matching the analytically forecast false positive probability turned out to be MurmurHash2 , a simple, multiplicative hash function whose excellent performances have been also confirmed by some recent benchmarking results ." This is simultaneously a "one word mention" and a
510:
MurmurHash because it was a better hash than the other two, which is itself notable. I do realize that you might not speak
Spanish, but anyone can get a decent translation through Google Language Tools, so can only can only conclude that you just didn't read this article, which means that your !VOTE here should be understood in that context. The goal here is not merely to give your opinion, but to give an
48:. No evident agreement as to whether or not the topic is sufficiently notable for inclusion. Currently the nominator is the only editor arguing for deletion, but they seem to provide a strong case which is backed up by relevant standards and policies. There are a number of keep "votes", but they are weak in nature and often don't address the main issue. Overall, I can't see any consensus either way. –
1321:- I still haven't !VOTED yet, so I might as well get that formality out of the way. For all the reasons I've explained above, I believe that the article in its current state should be left in place. As it does not appear as though Wolfkeeper has been able to garner any support here, I don't think there's a question about what the consensus is.
761:. In contrast, when we do speak of possibly controversial claims, such as the speed of the hash, we carefully rely on a combination of published academic papers and respected open-source projects. I suppose that, if we really wanted to, we could quote Appleby's speed claims as "according to the author", but we don't need to so we don't.
504:
I'm sorry, but this turns out not to be the case. As before, Google
Scholar search returned academic articles by Hammer and by Chouza et al., which discuss their reasons for using MurmurHash in the course of achieving their primary goal and reference it properly in their end notes. Contrary to what
414:
is viable, and Fowler Noll Vo Hash convinced in AFD based on google scholar and other criteria. Last time with MurmurHash the answer was no. I'm still not convinced on this; it still seems very, very thin indeed. There are only a tiny number of reliable sources, and this is not terribly substantive.-
573:
Thank you for evaluating this issue more carefully, whatever you conclude. To be clear, the links you mentioned were not provided primarily to establish notability, but to add value to the article. It is typical for articles on algorithms to link to available sample implementations, and unlike the
451:
As for your conclusion about the sources, it is just as hasty. I suggest that you read below about academic publications that provide clearly reliable sources for notability before you jump to repeating your conclusion. I would then encourage you to be specific about what you find lacking, instead
262:
and avoid impugning the motivations of editors. There is absolutely nothing in the article that constitutes advertising, and it's just an algorithm that was placed in the public domain for all to use freely, so there is no "product" to advertise. Instead, I would appreciate it if you could address
1151:
I'm on 25,000+ edits I don't think I have anything to prove. You suddenly appeared, two days after the previous article was deleted, and it turns out that that article was created by a known sock puppet of a banned user, and we had that sock puppet commenting in the deletion discussion as well, and
443:
initiated an AfD against it. In fact, the one on FNV was my first and only, and I now regret it because I was clearly too eager to delete instead of repair. I made the mistake of basing my argument for deletion on yours, and learned that it was flawed. That's why, after some reluctance, I worked
1337:
As required by the AfD process, I would like to reveal any and all potential conflicts of interest. In case it is not readily apparent, I should explicitly disclose that I worked with the two administrators who have deleted previous versions of this article to recreate it in a form that I believe
1016:
It has very poor notability, just 3 hits in google scholar, and none in google books. And two of those are one word or one sentence mentions. The other one liked it, it benchmarked well against just two other contenders in his application. I think it takes more than that; I don't think it's in the
624:
I realized that you were spot on about the Chouza reference not being in the article, so I've changed that. Rather than taking this RFD as something personal, I'm using it as an opportunity to get input to improve the article. As a result, I've also added an academic reference that confirms how
509:
compares MurmurHash to FNV-1a and
SuperfastHash a half dozen times, evaluating them on the basis of key size, speed and collisions. This is precisely the sort of analysis in an academic setting that establishes notability. Interestingly, the article goes on to explain that they chose to use
668:
Unfortunately, this PDF is all bitmaps, not text. I don't have the tools handy to OCR it, but using the end notes as an index made it easy enough to find that page 14 contains the mention. The exact text is: "The choice of the hashing algorithm to be employed within D2STM has been based on
315:
for Fowler Noll Vo Hash, you'll see that they found over 105 hits in google scholar alone. Last time we couldn't find any hits in google scholar on murmurHash, and you haven't quoted any. Indeed, it's the fact that you've recreated this article without fixing the problems with it that is so
255:, likewise references only Jenkins, although one of these references is in a published (industry but non-academic magazine) article by him. This leaves me to wonder why you hold this particular algorithm to a higher standard than the rest. Did MurmurHash do something bad to you once?
1212:
But what's sufficient notability? We have 4 hits in google scholar, 3 of which are basically 1 word mentions. Even the most significant google scholar hit isn't exactly the New York Times, does anything reference that? I'm still not getting warm fuzzies about it's notability here.-
983:
comments it does seem that the bar for notability for hashes is too low. Also, the argument from failure (or success) of Afd for other articles is an inherently weak one. For those who propose deletion, what would a reasonable notability guideline be for hash functions?
277:
Both of them are one word mentions. They don't in my opinion confer any significant notability. The Hammer mentions it once, and then never mentions it again in the
Conclusions. The NIST mentions it once at the bottom of the page. These are not substantive references.-
822:
Significant coverage: The source has to cover the topic "directly in detail", adding that this means "more than a trivial mention but it need not be the main topic of the source material". I would suggest that Chouza is a particularly fine example of this, as is
839:
Presumed: States that this is sufficient to support a presumption of notability, but it's still possible that we may decide for other reasons that it's not notable. Again, this doesn't seem to be an issue here. Rather, we seem to agree that, so long as
235:
Well, I anticipated this reaction, so I checked with both of the admins who had deleted the article previously and got their input and permission before restoring it. Both agreed that the Hammer academic article and the NIST listing are sufficient
452:
of simply stating that you're unimpressed. Such statements speak of your own unspecified personal criteria, not anything relevant to
Knowledge (XXG), so they are not particularly persuasive in the context of a !VOTE. 15:20, 15 November 2009 (UTC)
409:
I know that after MurmurHash got AFDd you AFDd at least two other hash function articles, but both were convincingly kept. Whether an article is kept or not is often more about whether AFD participants can establish that the encyclopedic
587:
Having said this, the fact that the algorithm is included in a number of significant open-source projects is an indirect indication of its notability, regardless of how little fanfare there is about it. If we put aside
349:
suffices. Hammer, NIST and Chouza are all good enough for that. There are also good industry and open-source citations, which you've arbitrarily chosen to ignore. Please don't poison the well or stack the deck.
439:, it did not deserve to be on Knowledge (XXG). The solution was to trim the article down so that it wasn't too big for its sources. I did the same for Jenkins, removing references to a long-dead website, but I
173:
1120:
are, but we do know who I am. While I put my name and personal credibility on the line with each edit I make, I would very much appreciate it if you kept the focus of this discussion where it belongs, on
1042:, you'll see it lists 4 academic publications, all found through Google Scholar. That's not all of them, either, but I made an effort to avoid duplicates from the same sources, based on advice from
592:
for a moment and just Google for insight, it's easy to find discussions about MurmurHash within these projects' forums, showing that it's genuinely being used, evaluated and discussed. For example,
80:
1137:, who has been entirely up front regarding his identity and role. I'm sorry I have to ask this, but is there something that you'd like to share with us at this time about your own identity?
641:
Articles should mainly contain reliable sources. Blogs, which can be published by anyone (no editorial oversight), do not belong in the article unless they meet the third paragraph of
1002:
Thank you for participating. If you don't mind, I'd like to ask you a related question: What would it take to convince you to change from Weak Keep to Strong Keep? What's missing?
725:
to point to the C# port that he published, not to repeat his opinion about MurmurHash. After all, who is Davy
Landman anyhow and why should we care? (Sorry, Davy, nothing personal.)
134:
894:
1099:. He seems uncommonly keen on this particular hash function; and has, since he created the account, mostly tried to get other competing hash function's articles deleted.-
836:
Independent of subject: Requires that secondary sources not be mouthpieces for the primary source. With papers from multiple countries, I don't believe this is an issue.
167:
484:
432:
I'm sorry, but I'm getting the impression that you're speaking hastily without checking your sources. In specific, what you're claiming is demonstrably false.
75:
1251:
The count of 5 at the top appears to be incorrect. I actually downloaded and read all 4 of these, and only one actually did more than a one word mention.-
1038:
Perhaps I'm mistaken, but it appears that you may well lack the ability to correctly use Google
Scholar, as your numbers are simply wrong. If you look at
552:
is passing mention in a code website. Because my old rationale no longer applies and because I am undecided about the notability of MurmurHash, I will
337:
found for MurmurHash are on par with the 1580 for FNV. There were apparently 105 Scholar "hits" for FNV, but not a single one made its way into
1248:
1074:
1046:. Likewise, I've already corrected your claim about "one sentence mentions", showing it to be both false and irrelevant, and addressed
370:
seen an article with this little in the way of reliable sources, and I've seen articles with much more than this fail multiple AFDs.-
243:
Keep in mind that the bar for notability for non-cryptographic hashes on
Knowledge (XXG) is not especially high. I was unable to get
17:
312:
107:
102:
1347:
1330:
1310:
1279:
1263:
1243:
1225:
1207:
1182:
1164:
1146:
1111:
1086:
1059:
1033:
1011:
993:
963:
945:
926:
909:
874:
770:
686:
660:
634:
609:
565:
523:
497:
427:
404:
382:
359:
328:
304:
290:
272:
263:
the conflict between your claim that there are no reliable sources and the presence of these demonstrably reliable sources.
227:
59:
596:
evaluates MurmurHash for use in Bloom filters under Hadoop and directly endorses it. And, yes, I know it's a blog and not
111:
642:
188:
713:. What I've learned is that whether something is a reliable source depends on what we're using it as a reliable source
1360:
155:
36:
94:
574:
now-deleted version, this one does not contain source code or even pseudocode (whereas some articles do one or both).
395:, which has no references except to Noll's site? I'm sorry, but what you're saying just doesn't fit the evidence.
722:
545:
1359:
Subsequent comments should be made on the appropriate discussion page (such as the article's talk page or in a
35:
Subsequent comments should be made on the appropriate discussion page (such as the article's talk page or in a
593:
149:
1169:
I don't know or care who else supported or opposed this article. What I do know is that you are attacking
1343:
1326:
1239:
1178:
1142:
1055:
1007:
959:
922:
870:
766:
757:. However, because of how we use them, these two are not only valuable additions to the article, but are
682:
630:
605:
531:
519:
506:
400:
355:
300:
268:
57:
1017:
top 3.5 million topics (which is what the
Knowledge (XXG) looks like it will reach eventually), not by a
865:
Having broken down the requirements and analyzed them piecemeal, I'm convinced that they are being met.
252:
1234:
wrong. Whatever your opinion might be, it would be more relevant to us if you got the facts straight.
208:
145:
1254:
1216:
1155:
1102:
1024:
418:
373:
341:, so why should we care? For that matter, you don't need 105 hits to be notable or even 2; a single
319:
281:
218:
212:
1275:
1203:
392:
338:
244:
181:
1293:
195:
1306:
1082:
1050:
on a point-by-point basis. I don't think any of your objections thus far have survived inquiry.
937:
652:
557:
489:
1339:
1322:
1235:
1174:
1138:
1126:
1051:
1003:
976:
955:
918:
905:
866:
762:
678:
626:
601:
515:
396:
351:
296:
264:
50:
29:
The following discussion is an archived debate of the proposed deletion of the article below.
480:
989:
941:
656:
561:
493:
1130:
1047:
841:
798:
754:
259:
980:
98:
758:
750:
710:
670:
597:
589:
472:
342:
237:
204:
Article was previously deleted for (although having plenty of references) for not having
1270:
I have purposely not provided an opinion on notability, because I don't have one yet. --
651:, but could not find which page(s) MurmurHash is on. Please provide the page number(s).
648:
161:
1271:
1199:
1073:. Unless there's some sort of conflict of interest, I don't see why we need to delete.
753:, we still reference two of them, one of which is a primary source that's got possible
1122:
794:
674:
476:
346:
1302:
1134:
1078:
1043:
334:
901:
625:
well the hash works in a Bloom filter, which is another indication of notability.
128:
479:. Searches in Google News Archive and Google Books come up with nothing, while a
985:
1039:
830:
445:
90:
65:
936:
I have notified the participants of the previous AfD about this discussion.
505:
Wolfkeeper has claimed, these were not all one-word mentions. For example,
534:
in the article, which is why I did not evaluate it. This source appears to
549:
311:
I don't really think you're comparing like with like, if you look at the
532:
http://laboratorios.fi.uba.ar/lsi/chouza-tesisingenieriainformatica.pdf
507:
http://laboratorios.fi.uba.ar/lsi/chouza-tesisingenieriainformatica.pdf
829:
Sources: Requires that they be secondary. All of the sources used in
211:
source references at all. The article's subject is thus not currently
718:
1296:
to generate a more thorough discussion so consensus may be reached.
538:
notability; however, the depth of coverage is not enough for it to
435:
I did launch an AfD on the FNV article, and I still believe that,
333:
If hits were all that mattered, then the 584 site:.edu hits that
1353:
The above discussion is preserved as an archive of the debate.
1095:
To be honest we don't know who Phil
Spectre is; the account was
1077:. It would be nice if the article could be expanded a bit. —
295:
See below for refutation of the "one word mentions" notion.
1173:
instead of the article. I will let that speak for itself.
487:
because no new sources have surfaced since September 2009.)
483:
returns unrelated results. (This rationale is the same as
251:
references Noll's own site. The other comparable hash,
1096:
124:
120:
116:
643:
Knowledge (XXG):Reliable sources#Statements of opinion
180:
826:
Reliable: Clearly includes published academic papers.
649:
http://www.inesc-id.pt/ficheiros/publicacoes/5453.pdf
1301:Please add new comments below this notice. Thanks,
544:Many of the sources in the article are unreliable:
194:
81:Articles for deletion/MurmurHash (2nd nomination)
39:). No further edits should be made to this page.
1363:). No further edits should be made to this page.
542:notability by itself — more sources are needed.
530:Very true; there are more sources. I don't see
895:list of Computing-related deletion discussions
8:
1198:A COI is not a valid reason for deletion. --
1097:created shortly after MurmurHash was deleted
746:So, in this case, even though blogs are not
240:for notability. For some reason, you don't.
844:was satisfied, this topic would be notable.
889:
893:: This debate has been included in the
1116:As a matter of fact, we don't know who
719:self-published official MurmurHash site
73:
833:to establish notability are secondary.
717:. For example, we link to Appleby's
18:Knowledge (XXG):Articles for deletion
7:
316:frustrating, and prompted the AFD.-
1129:. The only one I know of with any
647:I searched the academic reference,
72:
24:
76:Articles for deletion/MurmurHash
1075:WP:Knowledge (XXG) is not paper
1230:Wolfkeeper, these numbers are
1:
1348:01:23, 26 November 2009 (UTC)
1331:07:11, 23 November 2009 (UTC)
1311:00:37, 21 November 2009 (UTC)
1280:01:54, 21 November 2009 (UTC)
1264:02:55, 26 November 2009 (UTC)
1244:07:11, 23 November 2009 (UTC)
1226:04:26, 17 November 2009 (UTC)
1208:17:42, 15 November 2009 (UTC)
1183:19:29, 15 November 2009 (UTC)
1165:18:44, 15 November 2009 (UTC)
1147:18:38, 15 November 2009 (UTC)
1112:15:51, 15 November 2009 (UTC)
1087:15:42, 15 November 2009 (UTC)
1060:18:38, 15 November 2009 (UTC)
1034:15:46, 15 November 2009 (UTC)
1012:15:23, 15 November 2009 (UTC)
994:14:33, 15 November 2009 (UTC)
964:03:55, 15 November 2009 (UTC)
946:02:30, 15 November 2009 (UTC)
927:02:00, 15 November 2009 (UTC)
910:01:55, 15 November 2009 (UTC)
875:15:05, 15 November 2009 (UTC)
771:14:41, 15 November 2009 (UTC)
687:03:55, 15 November 2009 (UTC)
661:02:30, 15 November 2009 (UTC)
635:02:21, 15 November 2009 (UTC)
610:02:00, 15 November 2009 (UTC)
600:; I'm just offering insight.
566:01:48, 15 November 2009 (UTC)
524:01:27, 15 November 2009 (UTC)
498:01:14, 15 November 2009 (UTC)
428:02:40, 15 November 2009 (UTC)
405:01:40, 15 November 2009 (UTC)
383:01:03, 15 November 2009 (UTC)
360:01:40, 15 November 2009 (UTC)
329:01:03, 15 November 2009 (UTC)
305:01:40, 15 November 2009 (UTC)
291:01:03, 15 November 2009 (UTC)
273:00:31, 15 November 2009 (UTC)
228:21:15, 14 November 2009 (UTC)
60:00:33, 29 November 2009 (UTC)
1380:
1356:Please do not modify it.
1249:4 hits in Google scholar
709:I've been reading up on
32:Please do not modify it.
793:I've also been reading
247:deleted even though it
71:AfDs for this article:
1152:arguing against it.-
481:Google Scholar search
387:So you're saying you
253:Jenkins hash function
475:. This topic fails
393:Fowler Noll Vo hash
339:Fowler Noll Vo hash
245:Fowler Noll Vo hash
44:The result was
1313:
1262:
1224:
1163:
1127:User:Phil Spectre
1110:
1032:
912:
898:
426:
381:
327:
289:
226:
1371:
1358:
1300:
1298:
1261:
1259:
1252:
1223:
1221:
1214:
1162:
1160:
1153:
1109:
1107:
1100:
1031:
1029:
1022:
899:
473:reliable sources
471:per the lack of
425:
423:
416:
380:
378:
371:
326:
324:
317:
288:
286:
279:
225:
223:
216:
199:
198:
184:
132:
114:
53:
34:
1379:
1378:
1374:
1373:
1372:
1370:
1369:
1368:
1367:
1361:deletion review
1354:
1291:
1255:
1253:
1217:
1215:
1156:
1154:
1103:
1101:
1025:
1023:
797:, particularly
594:this blog entry
419:
417:
374:
372:
320:
318:
282:
280:
219:
217:
141:
105:
89:
86:
69:
51:
37:deletion review
30:
22:
21:
20:
12:
11:
5:
1377:
1375:
1366:
1365:
1350:
1334:
1333:
1315:
1314:
1299:
1288:
1287:
1286:
1285:
1284:
1283:
1282:
1268:
1267:
1266:
1193:
1192:
1191:
1190:
1189:
1188:
1187:
1186:
1185:
1090:
1089:
1067:
1066:
1065:
1064:
1063:
1062:
1014:
997:
996:
977:Phil Spectre's
969:
968:
967:
966:
949:
948:
930:
929:
914:
913:
886:
885:
884:
883:
882:
881:
880:
879:
878:
877:
854:
853:
852:
851:
850:
849:
848:
847:
846:
845:
837:
834:
827:
824:
811:
810:
809:
808:
807:
806:
805:
804:
803:
802:
782:
781:
780:
779:
778:
777:
776:
775:
774:
773:
735:
734:
733:
732:
731:
730:
729:
728:
727:
726:
723:Landman's blog
698:
697:
696:
695:
694:
693:
692:
691:
690:
689:
665:
664:
617:
616:
615:
614:
613:
612:
580:
579:
578:
577:
576:
575:
570:
569:
548:is a blog and
501:
500:
464:
463:
462:
461:
460:
459:
458:
457:
456:
455:
454:
453:
449:
437:as it was then
433:
364:
363:
362:
313:AFD discussion
309:
308:
307:
256:
241:
202:
201:
138:
85:
84:
83:
78:
70:
68:
63:
42:
41:
25:
23:
15:
14:
13:
10:
9:
6:
4:
3:
2:
1376:
1364:
1362:
1357:
1351:
1349:
1345:
1341:
1336:
1335:
1332:
1328:
1324:
1320:
1317:
1316:
1312:
1308:
1304:
1297:
1295:
1290:
1289:
1281:
1277:
1273:
1269:
1265:
1260:
1258:
1250:
1247:
1246:
1245:
1241:
1237:
1233:
1229:
1228:
1227:
1222:
1220:
1211:
1210:
1209:
1205:
1201:
1197:
1194:
1184:
1180:
1176:
1172:
1168:
1167:
1166:
1161:
1159:
1150:
1149:
1148:
1144:
1140:
1136:
1135:User:Aappleby
1132:
1128:
1124:
1119:
1115:
1114:
1113:
1108:
1106:
1098:
1094:
1093:
1092:
1091:
1088:
1084:
1080:
1076:
1072:
1069:
1068:
1061:
1057:
1053:
1049:
1045:
1044:User:Jclemens
1041:
1037:
1036:
1035:
1030:
1028:
1020:
1015:
1013:
1009:
1005:
1001:
1000:
999:
998:
995:
991:
987:
982:
978:
974:
971:
970:
965:
961:
957:
953:
952:
951:
950:
947:
943:
939:
935:
932:
931:
928:
924:
920:
916:
915:
911:
907:
903:
896:
892:
888:
887:
876:
872:
868:
864:
863:
862:
861:
860:
859:
858:
857:
856:
855:
843:
838:
835:
832:
828:
825:
821:
820:
819:
818:
817:
816:
815:
814:
813:
812:
800:
796:
792:
791:
790:
789:
788:
787:
786:
785:
784:
783:
772:
768:
764:
760:
756:
752:
749:
745:
744:
743:
742:
741:
740:
739:
738:
737:
736:
724:
720:
716:
712:
708:
707:
706:
705:
704:
703:
702:
701:
700:
699:
688:
684:
680:
676:
672:
667:
666:
663:
662:
658:
654:
650:
644:
640:
639:
638:
637:
636:
632:
628:
623:
622:
621:
620:
619:
618:
611:
607:
603:
599:
595:
591:
586:
585:
584:
583:
582:
581:
572:
571:
568:
567:
563:
559:
555:
551:
547:
541:
537:
533:
529:
528:
527:
526:
525:
521:
517:
513:
508:
503:
502:
499:
495:
491:
488:
486:
482:
478:
474:
470:
466:
465:
450:
447:
442:
438:
434:
431:
430:
429:
424:
422:
413:
408:
407:
406:
402:
398:
394:
390:
386:
385:
384:
379:
377:
369:
365:
361:
357:
353:
348:
344:
340:
336:
335:User:Gruntler
332:
331:
330:
325:
323:
314:
310:
306:
302:
298:
294:
293:
292:
287:
285:
276:
275:
274:
270:
266:
261:
258:Also, please
257:
254:
250:
246:
242:
239:
234:
233:
232:
231:
230:
229:
224:
222:
214:
210:
207:
197:
193:
190:
187:
183:
179:
175:
172:
169:
166:
163:
160:
157:
154:
151:
147:
144:
143:Find sources:
139:
136:
130:
126:
122:
118:
113:
109:
104:
100:
96:
92:
88:
87:
82:
79:
77:
74:
67:
64:
62:
61:
58:
55:
54:
47:
40:
38:
33:
27:
26:
19:
1355:
1352:
1340:Phil Spectre
1323:Phil Spectre
1318:
1292:
1256:
1236:Phil Spectre
1231:
1218:
1195:
1175:Phil Spectre
1170:
1157:
1139:Phil Spectre
1117:
1104:
1070:
1052:Phil Spectre
1026:
1018:
1004:Phil Spectre
981:Wolfkeeper's
972:
956:Phil Spectre
933:
919:Phil Spectre
890:
867:Phil Spectre
763:Phil Spectre
747:
714:
679:Phil Spectre
646:
627:Phil Spectre
602:Phil Spectre
553:
543:
539:
535:
516:Phil Spectre
511:
468:
467:
440:
436:
420:
411:
397:Phil Spectre
388:
375:
367:
352:Phil Spectre
321:
297:Phil Spectre
283:
265:Phil Spectre
248:
220:
205:
203:
191:
185:
177:
170:
164:
158:
152:
142:
52:Juliancolton
49:
46:no consensus
45:
43:
31:
28:
1319:Strong keep
917:Thank you.
444:to restore
209:wp:reliable
168:free images
1257:Wolfkeeper
1219:Wolfkeeper
1158:Wolfkeeper
1105:Wolfkeeper
1040:MurmurHash
1027:Wolfkeeper
975:From both
831:MurmurHash
446:MurmurHash
421:Wolfkeeper
376:Wolfkeeper
322:Wolfkeeper
284:Wolfkeeper
221:Wolfkeeper
213:wp:notable
91:MurmurHash
66:MurmurHash
1272:ThaddeusB
1200:ThaddeusB
973:Weak keep
902:• Gene93k
748:generally
556:for now.
540:establish
514:opinion.
485:last time
1303:Tim Song
1294:Relisted
1196:Comment:
1079:sligocki
934:Comment:
823:Coceiro.
536:indicate
512:informed
135:View log
554:abstain
174:WP refs
162:scholar
108:protect
103:history
1131:WP:COI
1048:WP:GNG
1021:way.-
986:Bejnar
954:Good.
938:Cunard
842:WP:GNG
799:WP:GNG
755:WP:COI
653:Cunard
558:Cunard
490:Cunard
469:Delete
260:WP:AGF
146:Google
112:delete
1232:still
759:WP:RS
751:WP:RS
711:WP:RS
671:WP:RS
598:WP:RS
590:WP:RS
441:never
412:topic
389:never
368:never
366:I've
343:WP:RS
238:WP:RS
189:JSTOR
150:books
129:views
121:watch
117:links
16:<
1344:talk
1327:talk
1307:talk
1276:talk
1240:talk
1204:talk
1179:talk
1143:talk
1125:not
1123:WP:N
1083:talk
1071:Keep
1056:talk
1019:long
1008:talk
990:talk
979:and
960:talk
942:talk
923:talk
906:talk
891:Note
871:talk
795:WP:N
767:talk
683:talk
675:WP:N
657:talk
631:talk
606:talk
562:talk
550:this
546:this
520:talk
494:talk
477:WP:N
401:talk
391:saw
356:talk
347:WP:N
301:talk
269:talk
249:only
182:FENS
156:news
125:logs
99:talk
95:edit
1133:is
1118:you
900:--
715:for
673:of
345:of
206:any
196:TWL
133:– (
1346:)
1329:)
1309:)
1278:)
1242:)
1206:)
1181:)
1171:me
1145:)
1085:)
1058:)
1010:)
992:)
984:--
962:)
944:)
925:)
908:)
897:.
873:)
769:)
685:)
677:.
659:)
633:)
608:)
564:)
522:)
496:)
403:)
358:)
303:)
271:)
176:)
127:|
123:|
119:|
115:|
110:|
106:|
101:|
97:|
56:|
1342:(
1325:(
1305:(
1274:(
1238:(
1202:(
1177:(
1141:(
1081:(
1054:(
1006:(
988:(
958:(
940:(
921:(
904:(
869:(
765:(
681:(
655:(
645:.
629:(
604:(
560:(
518:(
492:(
448:.
399:(
354:(
299:(
267:(
200:)
192:·
186:·
178:·
171:·
165:·
159:·
153:·
148:(
140:(
137:)
131:)
93:(
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.