HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
JeffreyBenjaminBrown
digraphs-with-text
Haskell2017–2020
JeffreyBenjaminBrown / digraphs-with-text

digraphs-with-text

Discover this repository through its Hacker News conversations.

Explore on GitHubRead Hacker News discussions
2Distinct people
9Mentions
0Explicit recommenders
63GitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

A public description has not been verified.

Where it is used

No documented product use has been verified yet.

What people are saying

No recommendation phrase was found in the indexed comments.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

Mentioned in the same Hacker News threads. That is not proof they are substitutes.

This week on Hacker News

Nov 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 3:56:07 PM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by month9 dated mentions

Observed mentions: 2017-11-11 22:48:10 UTC to 2020-01-18 22:09:25 UTC.

01232017-11-01 00:00:00 UTC to 2017-12-01 00:00:00 UTC (exclusive): 3 mentions; 1 submissions, 2 commentsNov 20172017-12-01 00:00:00 UTC to 2018-01-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-01-01 00:00:00 UTC to 2018-02-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-02-01 00:00:00 UTC to 2018-03-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-03-01 00:00:00 UTC to 2018-04-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-04-01 00:00:00 UTC to 2018-05-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-05-01 00:00:00 UTC to 2018-06-01 00:00:00 UTC (exclusive): 2 mentions; 0 submissions, 2 comments2018-06-01 00:00:00 UTC to 2018-07-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-07-01 00:00:00 UTC to 2018-08-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-08-01 00:00:00 UTC to 2018-09-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-09-01 00:00:00 UTC to 2018-10-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-10-01 00:00:00 UTC to 2018-11-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-11-01 00:00:00 UTC to 2018-12-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-12-01 00:00:00 UTC to 2019-01-01 00:00:00 UTC (exclusive): 2 mentions; 0 submissions, 2 commentsDec 20182019-01-01 00:00:00 UTC to 2019-02-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-02-01 00:00:00 UTC to 2019-03-01 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 comments2019-03-01 00:00:00 UTC to 2019-04-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-04-01 00:00:00 UTC to 2019-05-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-05-01 00:00:00 UTC to 2019-06-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-06-01 00:00:00 UTC to 2019-07-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-07-01 00:00:00 UTC to 2019-08-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-08-01 00:00:00 UTC to 2019-09-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-09-01 00:00:00 UTC to 2019-10-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-10-01 00:00:00 UTC to 2019-11-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-11-01 00:00:00 UTC to 2019-12-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-12-01 00:00:00 UTC to 2020-01-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2020-01-01 00:00:00 UTC to 2020-02-01 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsJan 2020

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges
UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
PeriodStart (UTC)End (exclusive, UTC)MentionsSubmissionsComments
Nov 20172017-11-01 00:00:00 UTC2017-12-01 00:00:00 UTC312
Dec 20172017-12-01 00:00:00 UTC2018-01-01 00:00:00 UTC000
Jan 20182018-01-01 00:00:00 UTC2018-02-01 00:00:00 UTC000
Feb 20182018-02-01 00:00:00 UTC2018-03-01 00:00:00 UTC000
Mar 20182018-03-01 00:00:00 UTC2018-04-01 00:00:00 UTC000
Apr 20182018-04-01 00:00:00 UTC2018-05-01 00:00:00 UTC000
May 20182018-05-01 00:00:00 UTC2018-06-01 00:00:00 UTC202
Jun 20182018-06-01 00:00:00 UTC2018-07-01 00:00:00 UTC000
Jul 20182018-07-01 00:00:00 UTC2018-08-01 00:00:00 UTC000
Aug 20182018-08-01 00:00:00 UTC2018-09-01 00:00:00 UTC000
Sep 20182018-09-01 00:00:00 UTC2018-10-01 00:00:00 UTC000
Oct 20182018-10-01 00:00:00 UTC2018-11-01 00:00:00 UTC000
Nov 20182018-11-01 00:00:00 UTC2018-12-01 00:00:00 UTC000
Dec 20182018-12-01 00:00:00 UTC2019-01-01 00:00:00 UTC202
Jan 20192019-01-01 00:00:00 UTC2019-02-01 00:00:00 UTC000
Feb 20192019-02-01 00:00:00 UTC2019-03-01 00:00:00 UTC101
Mar 20192019-03-01 00:00:00 UTC2019-04-01 00:00:00 UTC000
Apr 20192019-04-01 00:00:00 UTC2019-05-01 00:00:00 UTC000
May 20192019-05-01 00:00:00 UTC2019-06-01 00:00:00 UTC000
Jun 20192019-06-01 00:00:00 UTC2019-07-01 00:00:00 UTC000
Jul 20192019-07-01 00:00:00 UTC2019-08-01 00:00:00 UTC000
Aug 20192019-08-01 00:00:00 UTC2019-09-01 00:00:00 UTC000
Sep 20192019-09-01 00:00:00 UTC2019-10-01 00:00:00 UTC000
Oct 20192019-10-01 00:00:00 UTC2019-11-01 00:00:00 UTC000
Nov 20192019-11-01 00:00:00 UTC2019-12-01 00:00:00 UTC000
Dec 20192019-12-01 00:00:00 UTC2020-01-01 00:00:00 UTC000
Jan 20202020-01-01 00:00:00 UTC2020-02-01 00:00:00 UTC101

What Hacker News says

9 sources
no_identd·Jan 18, 2020
I think the point most guides overlook consists of the internal semantics of using a Zettelkasten, Luhmann essentially used it to create a paragraph (Zettel) & subchapter (Zettel Sequence, but note they of course sometimes he'd not manage to fit an entire paragraph on one Zettel due to margin limitations) branching & branchable, recursively self-referential choose your own adventure hypertextbook, from which he'd then generate regular textbooks. Hence why he said that his books basically wrote themselves — to write a book, he'd 'just' enter the Zettelkasten, and copy out everything he'd already written there on the topic, picking between branches & branchings as he went back, forth & side-to-side within it. Hence why if one looks close, one can find Luhmann seemingly self-plagiarising paragraphs from books he'd previously written. I suspe
Read the rest
ct a similar mechanic sits behind the (in this sense very ignorant) accusations of self-plagiarism against Slavoj Zizek. As such, one might wish to instead consider using Hypertext Fiction tools for creating a Zettelkasten, such these two (proprietary software, Mac OS X only, unfortunately): http://www.eastgate.com/Tinderbox/ http://www.eastgate.com/storyspace/ Note that there exists an EXTREMELY useful plugin for Tinderbox which implements Stretchtext: https://natematias.com/stretchtext/ Now gimme a combination of what roamresearch.com does with the above, but using the data structure of Hode: https://github.com/JeffreyBenjaminBrown/hode But with support for zzstructure like hyperthogonality: https://github.com/JeffreyBenjaminBrown/digraphs-with-text/i... And secretly use the patching patches feature of pijul.org in the background so version control actually becomes sanely doable, throw in elastic tab stop support, and maybe an entire kitchensink in which someone let a mixture of ChrysaLisp, SmallTalk, Hazel, Scala 3, /r/nosyntax, Inferno, RINA, GNUnet, & every single proof assistant and theorem prover sit for a tad bit long, and then MAYBE we can stop living in the dark ages of computing. (Yes I'm bitter) P.S.: Identity Transclusion ≠ Instance Transclusion P.P.S.: Birth & Death of Javascript, anyone?
In Luhmann's Zettelkasten
no_identd·Dec 9, 2018
> it sounds like the real goal is just No. I suspect you have the kind of point of view where we might better first discuss the proposed data structure and THEN what we'll do with it. First, you'll want to learn about zzstructure/hyperthogonal structure: http://xanadu.com/zigzag/ https://scholar.google.com/scholar?q=zzstructure for a comparison of the above with Ubergraphs (a generalization of Ultragraphs, themselves a generalization of Hypergraphs), you'll want to check here: https://github.com/JeffreyBenjaminBrown/digraphs-with-text/i... Once you think you comprehend the above, consider spending some time thinking about how you could come up with a 'canonical', graphical user interface AND user experience for a Ubergraph that uses hyperthogonal structure. Then imagine how you'd implement such a data structure in a distributed, peer to p
Read the rest
eer, UNCENTRALIZABLE (not just decentralized!), secure manner. If you can imagine all of that and think you comprehend at least one tiny part of the implications of such a thing, then you comprehend about 1/10 of "the real goal" of Xanadu, and I invite you to consider continuing to ponder the possibilities.
In Getting to Xanadu
no_identd·Dec 8, 2018
Some things people interested in Xanadu likely would wish to look into: https://github.com/JeffreyBenjaminBrown/digraphs-with-text Why? See here: https://github.com/JeffreyBenjaminBrown/digraphs-with-text/i... See also here: https://en.wikipedia.org/wiki/Topic_map#RDF_relationship (Why the W3C didn't standardize on this, a bloody ISO standard, and instead decided to roll their own, weaker system, well... I'll leave you to boggle your mind about this one.) See also this video by Ted Nelson on transcopyright: https://www.youtube.com/watch?v=x3l7CpnpyGw See also: https://en.wikipedia.org/wiki/Miller_columns (Previous HN discussion: https://news.ycombinator.com/item?id=18118798) See also this: https://en.wikipedia.org/wiki/Tumbler_(Project_Xanadu) Which, as an addressing scheme, strongly resembles the enumeration scheme Niklas Luhmann used fo
Read the rest
r his infamous Zettelkasten, which I'd strongly encourage you to look into if Xanadu interests you at all. And to stick with the Zettelkasten comparision for a moment, see also "Martha Stewart’s File Cabinet" here: http://bit-player.org/wp-content/extras/bph-publications/AmS... (Note that the information, like most information, about "Radix economy" [an extremely ill-defined concept] given there by Hayes ignores the fact that Balanced Ternary in fact has a higher capacity than unsigned ternary, for a demonstration of this basically ignored-everywhere fact, see here: https://web.archive.org/web/20090312094241/http://abhijit.in..., and before you think that page looks weird, here, have Marvin Minsky commenting positively on it: https://archive.fo/gL2Bv; OR simply try to think about how digit sums & digital roots work in Balanced Ternary vs. in Ternary) Why bring up "Martha Stewart's File Cabinet"? Because one of the mistakes with the Xanadu Tumbler scheme consists, in my opinion, of the fact that it doesn't use balanced ternary for the addressing, making the addresses unnecessarily long AND more difficult to handle in general. (Cf. the properties of the file cabinet as outlined by Hayes in the article) See also here: https://en.wikipedia.org/wiki/Enfilade_(Xanadu) And here: https://en.wikipedia.org/wiki/Docuverse My current hope for a Xanadu-like system rests, in a way, on this new feature of Pijul 0.11, which basically "solves" transclusion & versioning: https://discourse.pijul.org/t/patching-patches/212 For a newer status on the above issue, see here: https://discourse.pijul.org/t/preparing-pijul-0-11-0/203
In Getting to Xanadu
Jeff_Brown·May 28, 2018
Google's (now public) PageRank algorithm isn't that complicated, and it brought an astounding improvement in our ability to find what we wanted. There might in fact be a simple algorithm for determining who to trust -- but a closed-source algorithm seems like it cannot by definition go very far to improve media transparency. If we had more kinds of metadata publicly available -- "[person] trusts [person]", "[person] found [article] helpful for understanding [topic]", "[person] testifies that [person] wrote a good PhD dissertation on [topic]", etc. -- we could publicly experiment with algorithms like, "restrict results to people whose writings have been contradicted fewer times than they have been endorsed", or "to people trusted by people I trust," or "to persons X for whom at least 50 other persons Y testify that X helped them understand
Read the rest
[topic]," or whatever. Hypergraph databases (e.g. Grakn, HypergraphDb) and logic programming languages (e.g. Datalog) already let us express arbitrary metadata -- anything expressible, as far as I am aware. Getting ordinary users to state their thoughts (and their search queries over those thoughts) in an easily machine-readable manner might be tough. For that purpose I wrote a language[1,2], extremely close to natural language, that allows such machine-readable expression of higher-order relationship information. [1] Why use Hash: https://github.com/JeffreyBenjaminBrown/digraphs-with-text/b... [2] How to use Hash: https://github.com/JeffreyBenjaminBrown/digraphs-with-text/b...
In An Airline Geek Trying to Build a Media Giant with No Reporters
Jeff_Brown·May 26, 2018
This good idea does not go far enough. There's a clear need to crowdsource judgment. The judgment could be much more expressive than "this is true". A hypergraph database would allow collection of arbitrary metadata -- "this helped me understand plate tectonics", "this contradicts that", etc. And it would enable more targeted search: not just "show me true things", but, say, "show me articles about voting that are highly discussed among the economic faculty at Michigan State". I've written about this here: https://github.com/synchrony/smsn-why/blob/master/noise-vs-s... I also wrote a language -- very, very close to natural language, but machine-readable -- designed to facilitate such higher-order queries: https://github.com/JeffreyBenjaminBrown/digraphs-with-text/b...
In Elon Musk's latest company: Pravda
Jeff_Brown·Nov 29, 2017
Graphs (networks, webs) are a data structure we have not exploited enough. Tons of research is going into using graphs for artificial intelligence, and for understanding human intelligence (as in this article). But what about using knowledge graphs to augment human intelligence, like a prosthetic? This is the power of Google search. It uses a knowledge graph that models the world (with an emphasis on the internet). The graph is big, but the view of it offered to users is minuscule -- in part to keep the interface as simple as possible, and in part for economic reasons. There is open source software that lets people keep their own knowledge graphs. In Semantic Synchrony [1] you can keep a knowledge graph and merge it with others' knowledge graph. Joshua Shinavier (who wrote Semantic Synchrony) and I share a graph with over 400,000 nodes, a
Read the rest
nd most views load in the blink of an eye. A sister project, Digraphs with Text[2], offers a more flexible system of expression: It generalizes the graph, allowing relationships to involve more than two members, and allowing relationships to be members of other relationships. It also offers a search facility very much like natural language: To search, for instance, for reasons neurons need vitamin B, you would use a query like "(neurons #need vitamin B) #because /it". (The # mark indicates a joint between members of a relationship.) [1] https://github.com/synchrony/smsn/wiki/ [2] https://github.com/JeffreyBenjaminBrown/digraphs-with-text
In Network Neuroscience Theory of Human Intelligence
Jeff_Brown·Nov 29, 2017
Rather than a sharp distinction between trusted users and everyone else, or content and non-content, or even between reading and writing, I believe what we need is the more quantum experience of a knowledge graph. One with an easy semantics for creating and navigating nested relationships. It would let users search for, say, "Statements about [topic] which [set of users] agrees on," or "Arguments against [hypothesis]," or "Examples of, stories about, and implications of [principle]", or "Statements which readers judged useful for [goal]." I wrote a demonstration program[1] that does this. I hope to attract more developers. [1] https://github.com/JeffreyBenjaminBrown/digraphs-with-text
In Hello, world: this is WikiTribune

MAKE YOURSELF AT HOME

A few shortcuts

/
Search the collection
?
Open this guide
Esc
Close dialogs and navigation

Your saved repositories and interests stay in this browser.