Very large directed acyclic graph (DAG) of US patent citations. Patents can only cite patents filed earlier, creating a strict temporal ordering. Edge direction goes from citing patent to cited patent. One of the largest real-world DAGs available. Useful for evaluating algorithms on massive acyclic graphs and temporal graphs.
npx keepset fetch citation-patent
Nodes
4,894,081
Edges
16,518,948
Size
81.2 MiB
Fetch and preview this dataset on this page, or download the result as JSON. The command line fetches it without a browser.
Leskovec et al. (2005). Graphs over time: densification laws, shrinking diameters and possible explanations. ACM SIGKDD Explorations Newsletter 7, 4-13.
Recipe
Source
#0
Archive
gzip
Parser format
"edge-list"
Parser encoding
"utf-8"
Parser delimiter
"detect"
Parser skipLines
0
Parser commentPrefixes
["#","%"]
Parser sourceColumn
0
Parser targetColumn
1
Crosswalk
keepset/topology to graph/v1, as a crossmap crosswalk.