aboutsummaryrefslogtreecommitdiffstats
path: root/proposals
diff options
context:
space:
mode:
authorMartin Czygan <martin.czygan@gmail.com>2021-07-08 18:54:08 +0200
committerMartin Czygan <martin.czygan@gmail.com>2021-07-08 18:54:08 +0200
commit0fc3417d91f1b0f717ec15421752abc41894c3d4 (patch)
tree2e736c139e27c39f68fcca830c12661b7bd36955 /proposals
parentd5fc1dacfec12430f2d05d16ab6f78494aba52ba (diff)
downloadrefcat-0fc3417d91f1b0f717ec15421752abc41894c3d4.tar.gz
refcat-0fc3417d91f1b0f717ec15421752abc41894c3d4.zip
update proposal status
Diffstat (limited to 'proposals')
-rw-r--r--proposals/2021_04_23_citation_graph_tooling.md4
1 files changed, 2 insertions, 2 deletions
diff --git a/proposals/2021_04_23_citation_graph_tooling.md b/proposals/2021_04_23_citation_graph_tooling.md
index 328dec7..ef36998 100644
--- a/proposals/2021_04_23_citation_graph_tooling.md
+++ b/proposals/2021_04_23_citation_graph_tooling.md
@@ -1,7 +1,7 @@
# Building a Citation Graph
* date: 2021-04-23
-* status: wip
+* status: implemented in [cgraph](https://gitlab.com/internetarchive/cgraph)
## Problem and Goal
@@ -31,7 +31,7 @@ implements data specific rules for matching.
## Implementation
A goal is to start small, and eventuelly move to a canonical data framework for
-processing, if approriate or necessary [3].
+processing, if appropriate or necessary [3].
Especially we would like to make it fast to analyze a few billion reference
entries in a reasonable amount of time with little setup and minimal resource