[{"data":1,"prerenderedAt":402},["ShallowReactive",2],{"project-35572434":3},{"id":4,"name":5,"line":6,"line_source":7,"title":8,"url":9,"domain":10,"maker":11,"posted_at":12,"year":13,"points":14,"comments":15,"rank_in_year":16,"shown_in_year":17,"top":18,"tier":19,"category":20,"subcategory":21,"format":22,"keywords":23,"reception":29,"sentiment":30,"stance_mix":31,"scored_comments":36,"aspects":37,"strip":43,"post_text":45,"what":46,"said":61,"maker_in_thread":172,"shape":183,"grid":187,"attempts":364,"same_week":365,"maker_shows":44,"maker_hidden":394,"reader_version":395,"card":396},"35572434","WikiBinge","discover how all things are vaguely connected","title","Show HN: WikiBinge – discover how all things are vaguely connected","https:\u002F\u002Fwww.wikibinge.com\u002F","wikibinge.com","jamez",1681494530,2023,246,61,200,3109,7,"notable","games","wikipedia path explorer","web_app",[24,25,26,27,28],"wikipedia","pagerank","wikipedia game","six degrees of separation","random article","curious",0.118,{"positive":32,"neutral":33,"mixed":34,"critical":35},12,21,0,8,41,{"idea":38,"execution":41,"design":42},{"positive":39,"critical":40},3,1,{"positive":40,"critical":18},{"positive":34,"critical":34},[44,34,39,39,39,39,39,40,40,34,44,39,44,39,40,44,40,39,44,34,34,44,39,39,39,40,34,40,39,39,39,39,39,44,34,34,44,39,44,34],5,"Connect two articles on Wikipedia, but do it the long way. I've always been a fan of the theory of six degree of separation, but it's an overused concept when exploring the Wiki-graph.\n\nInstead of showing the shortest path, which in my opinion is \"boring\" and ends up connecting super-important central articles, I came up with my own method: WikiBinge selects the smaller, less represented articles on Wikipedia. In a WikiBinge path, the underdogs are the kings!\n\nHow does it work? It's pretty straightforward! Compute PageRank on the Wiki-graph and assign as weight of each edge the PageRank value ",{"problem":47,"audience":53,"pricing":53,"motivation":54,"time_to_build":53,"stack":58,"openness":59,"stage":60,"team_size":59},{"value":48,"source":49,"evidence":50},"Finding long, winding connections between Wikipedia articles instead of shortest paths","maker",[51],{"id":52},"post",null,{"value":55,"source":49,"evidence":56},"Dislike of overused shortest-path six degrees; wanted serendipitous exploration",[57],{"id":52},[],"unknown","launched",{"praise":62,"objections":83,"requests":118,"questions":138,"alternatives":146},[63],{"value":64,"source":65,"evidence":66},"Fun for discovering unexpected connections between articles","commenter",[67,71,75,79],{"id":68,"by":69,"text":70},"35573878","r3trohack3r","This is absolutely amazing. I built wikiscroll.blankenship.io for myself to scratch my neophile itch. You might be displacing it in my daily routine, a nice pre-built rabbit hole…",{"id":72,"by":73,"text":74},"35573653","Kerrick","This is pretty neat! I tried https:\u002F\u002Fwww.wikibinge.com\u002F#Moray_eel\u002FSony_Alpha and I was pleased with the path it took me for first big chunk of the path. The last bit was a tour…",{"id":76,"by":77,"text":78},"35574532","adrianh","This is excellent. The path from \"George Barnes (Musician)\" to \"Django Reinhardt\" somehow managed to pass through Hysterectomy, 5-Bromouracil, Glucuronidation and Port Bannatyne…",{"id":80,"by":81,"text":82},"35575898","ArekDymalski","it's nice that it highlights less popular and obvious - i've discovered a lot linking potato to the Millenium Falcon :) https:\u002F\u002Fwww.wikibinge.com\u002F#Potato\u002FMillennium_Falcon",[84,99],{"value":85,"source":65,"evidence":86},"Paths are too long and loose to feel meaningful",[87,91,95],{"id":88,"by":89,"text":90},"35575812","munro","The chains are so long, it's really not that impressive :\u002F",{"id":92,"by":93,"text":94},"35580048","denton-scratch","Unimpressed - I tried to get a chain from \"Mocca, Yemen\" to \"Jimma\". I got a whole long list of stuff about aircraft engines (I do get that the author was trying to make…",{"id":96,"by":97,"text":98},"35576063","dopidopHN","Asked to connect two small town on different continent. One of those town manufacture car parts. Then I got 10ish car model from various brand. An actor that did a commercial for…",{"value":100,"source":65,"evidence":101},"Search fails for non-canonical names, parentheses, uppercase and commas",[102,106,110,114],{"id":103,"by":104,"text":105},"35574732","mcint","My first attempt I can't search donut (Doughnut is the canonical), can't type the \"()\" parenthesis that appear in page names, and can't use any of France, La France, or French…",{"id":107,"by":108,"text":109},"35573716","raybb","Pretty cool project! FYI for some reason search doesn't seem to work that well. hackNY won't come up and if you try try to add a place with a comma (Lowell, Massachusetts) you…",{"id":111,"by":112,"text":113},"35582438","culi","I couldn't get NODAPL either. Seems to have trouble with uppercased letters?",{"id":115,"by":116,"text":117},"35577797","Paul-Craft","Not \"all things.\" I can't enter arbitrary titles of wiki articles, like \"mathematics\" and \"poetry.\"",[119,128],{"value":120,"source":65,"evidence":121},"Show the shortest path alongside the long path",[122,123,127],{"id":68,"by":69,"text":70},{"id":124,"by":125,"text":126},"35577701","saltminer","> Since it seems like you are computing both the shortest and the \"most interesting\" path between the two articles, it would be cool to give me a way to see both on the final…",{"id":72,"by":73,"text":74},{"value":129,"source":65,"evidence":130},"Customizable weighting or category exclusions",[131,134],{"id":132,"by":112,"text":133},"35582404","I'd love to be able to customize the algorithm. I'm curious what would happen if you placed various weights to optimize for shortest path AND most niche path (or however you'd…",{"id":135,"by":136,"text":137},"35579536","anonu","Would be great to be able to customize the randomness on the graph. Granted it's a hard problem to solve. I picked two unrelated topics and it seems like most of the bridge is…",[139],{"value":140,"source":65,"evidence":141},"Is there a tool that finds the shortest path?",[142],{"id":143,"by":144,"text":145},"35576757","tobyjsullivan","This might be the first time I wish I’d read the comments before visiting the link. Assuming it would find the shortest path, I gave it two very unrelated concepts. I spent way…",[147,157,168],{"value":148,"source":65,"evidence":149},"Six Degrees of Wikipedia",[150,154],{"id":151,"by":152,"text":153},"35578014","codetrotter","> is there a similar tool that does shortest path? Yes very many of them, like OP said. Here’s a popular one: https:\u002F\u002Fwww.sixdegreesofwikipedia.com\u002F",{"id":155,"by":152,"text":156},"35578028","If you want the shortest path just use one of the very many websites that does that. For example https:\u002F\u002Fwww.sixdegreesofwikipedia.com\u002F",{"value":158,"source":65,"evidence":159},"The Wiki Game \u002F wiki-race",[160,164],{"id":161,"by":162,"text":163},"35573734","ramesh1994","It is a pretty fun game https:\u002F\u002Fwiki-race.com\u002F",{"id":165,"by":166,"text":167},"35574239","MattGaiser","https:\u002F\u002Fwww.thewikigame.com\u002F",{"value":169,"source":65,"evidence":170},"Wikiscroll",[171],{"id":68,"by":69,"text":70},{"comments":44,"answered":40,"key":173},[174,177,180],{"id":175,"text":176},"35580693","Thank you both, this is a good suggestion. I'll leave the short connection on screen, comparing it with the long and windy path is fun.",{"id":178,"text":179},"35574474","TF-idf would definitely be something very interesting to try, though I also treasure the serendipity brought by the \"blindness\" to the content.",{"id":181,"text":182},"35573740","Cool path! The last bit of the tour you described is fairly common - the algorithm is just doing its job, getting closer to the target, avoiding articles with larger PageRank.…",{"commenters":184,"max_depth":185,"maker_replies":44,"first_comment_mins":186,"lifespan_hours":184},52,4,101,[188,190,192,194,198,201,203,207,208,211,213,214,216,217,221,225,228,231,235,236,239,242,243,245,248,251,253,257,258,263,264,267,268,272,276,280,282,285,288,290,291,295,298,300,304,307,309,313,315,319,323,327,331,335,338,340,344,346,350,352,356,360],[68,34,44,189,69,34],"project\u002Fpositive\u002Fnone",[124,34,34,191,125,34],"commenter\u002Fneutral\u002Fnone",[175,34,34,193,11,40],"maker\u002Fneutral\u002Fnone",[195,40,39,196,197,34],"35573960","project\u002Fneutral\u002Fnone","armandososa",[199,40,39,196,200,34],"35574146","delecti",[202,40,39,196,166,34],"35574157",[204,40,39,205,206,34],"35576127","project\u002Fneutral\u002Fidea","chillage",[132,40,39,205,112,34],[209,40,39,196,210,34],"35577449","asdfman123",[143,212,39,205,144,34],2,[151,212,34,191,152,34],[103,39,40,215,104,34],"project\u002Fcritical\u002Fexecution",[92,185,40,215,93,34],[218,44,34,219,220,34],"35577251","other\u002Fneutral\u002Fnone","notesinthefield",[222,223,34,219,224,34],"35577085",6,"pelagicAustral",[226,18,44,189,227,34],"35574809","jonathankoren",[229,35,44,189,230,34],"35573692","Anduia",[232,233,39,205,234,34],"35574347",9,"foota",[178,233,34,205,11,40],[72,237,44,238,73,34],10,"project\u002Fpositive\u002Fexecution",[240,237,39,205,241,34],"35573688","jchw",[181,237,34,193,11,40],[96,244,40,215,97,34],11,[246,32,44,189,247,34],"35577149","m0llusk",[88,249,40,250,89,34],13,"project\u002Fcritical\u002Fidea",[252,249,34,191,69,34],"35575887",[254,249,39,255,256,34],"35577308","project\u002Fneutral\u002Fdesign","cglong",[155,249,34,191,152,34],[259,260,44,261,262,34],"35573700",14,"project\u002Fpositive\u002Fidea","passwordoops",[161,260,34,219,162,34],[265,260,34,219,266,34],"35573924","birdyrooster",[165,260,34,219,166,34],[269,270,44,189,271,34],"35574447",15,"CyborgCabbage",[273,274,44,189,275,34],"35581819",16,"StockHuman",[277,278,39,196,279,34],"35573863",17,"kirubakaran",[281,278,39,196,152,34],"35573947",[283,278,39,196,284,34],"35574772","layman51",[286,278,39,196,287,34],"35575868","vallanceroad",[107,289,40,215,108,34],18,[111,289,40,215,112,34],[292,293,34,219,294,34],"35574487",19,"dzink",[296,293,34,297,11,40],"35574651","maker\u002Fneutral\u002Fidea",[115,299,40,215,116,34],20,[301,33,39,302,303,34],"35574307","project\u002Fneutral\u002Fexecution","throwaway9131",[305,33,39,196,306,34],"35575411","ape4",[135,308,39,205,136,34],22,[310,311,40,215,312,34],"35576978",23,"warent",[76,314,44,261,77,34],24,[316,317,39,196,318,34],"35582825",25,"great_psy",[320,321,39,205,322,34],"35579559",26,"ricardo81",[324,325,34,219,326,34],"35577312",27,"omginternets",[328,329,44,189,330,34],"35578938",28,"ggm",[332,333,34,219,334,34],"35579385",29,"samus",[336,333,34,191,337,34],"35579426","dorkwood",[339,333,34,191,112,34],"35582427",[341,342,39,205,343,34],"35586007",30,"blt",[80,345,44,261,81,34],31,[347,348,39,196,349,34],"35573921",32,"stevenking86l",[351,348,34,193,11,40],"35573972",[353,354,44,189,355,34],"35580795",33,"xcombelle",[357,358,34,219,359,34],"35574517",34,"cocodill",[361,362,34,219,363,34],"35594614",35,"DrNosferatu",[],[366,371,376,381,386,390],{"id":367,"name":368,"points":369,"category":370},"35621417","AI Playground",249,"ai",{"id":372,"name":373,"points":374,"category":375},"35580959","IPython-GPT",144,"dev_tools",{"id":377,"name":378,"points":379,"category":380},"35620314","Tesseract Analytics",113,"data",{"id":382,"name":383,"points":384,"category":385},"35628642","Kratos",88,"security_privacy",{"id":387,"name":388,"points":389,"category":370},"35568799","Debate Devil",84,{"id":391,"name":392,"points":393,"category":375},"35629050","Checksum",78,false,"v2",{"id":397,"name":5,"line":6,"ai":394,"cat":20,"year":13,"points":14,"comments":15,"rec":29,"s":398,"top":18,"kw":399,"maker":11,"domain":10,"tier":19,"attempts":34,"strip":400,"url":9,"mix":401,"praise":64,"objection":85,"sub":21},35572434,0.12,[24,25,26,27,28],"5033333110535315135005333101333335005350",[32,33,34,35],1793991063849]