Add history of the development of the c14n work

[philarcher]

It's important for both patent and person credit reasons to include the full history.

[[DesignIssues-Diff]]

TimBL's design note on problems with Diff.

[[eswc2014Kasten]]

A Framework for Iterative Signing of Graph Data on the Web.

[[Hogan-Canonical-RDF]]

Aiden Hogan's paper on canonicalizing RDF

[[HPL-2003-142]]

Jeremy J. Carroll's paper on signing RDF graphs.

Manu has offered to do this.

[gkellogg]

There's a limit to how far we can go back, it seems. The 3rd commit on the CCG version (https://github.com/w3c-ccg/rdf-dataset-canonicalization/commit/e43398b146138eeaea9432cbf6c93c4a44a764ea from 2015) is a copy from https://github.com/json-ld/json-ld.org.

There are about 65 commits from https://github.com/w3c-ccg/rdf-dataset-canonicalization with relevant history, and about xxx on https://github.com/json-ld/json-ld.org/blob/390be971490d4cc66af7ee7ff5529b9290fdbba3/spec/latest/rdf-dataset-normalization/index.html (history).

Before then, it was part of the JSON-LD API spec (history), which was itself split out from the original JSON-LD spec.

The first reference I see to Normalization was in https://github.com/json-ld/json-ld.org/commit/e68171b95f616cd5530a5e2357b4b995045716a0 from 2010-11-27, although that was a JSON-LD-centric normalization process.

[msporny]

List of other academic work, some of it dating back to the 1970s:

[1]Jesus Arias Fisteus ∗,1, Norberto Fernández García, Luis Sánchez Fernández, Carlos Delgado Kloos, Hashing and canonicalizing Notation 3 graphs, Journal of Computer and System Sciences, 2010 Elsevier Inc Depto. de Ingeniería Telemática, Universid [2] J.L. Gross, J. Yellen (Eds.), Handbook of Graph Theory, Discrete Mathematics and Its Applications, CRC Press, 2003. [3] M. Grohe, Isomorphism testing for embeddable graphs through definability, in: STOC ’00: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, ACM, New York, NY, USA, 2000, pp. 63–72, http://doi.acm.org/10.1145/335305.335313. [4] D.G. Corneil, C.C. Gotlieb, An efficient algorithm for graph isomorphism, J. ACM 17 (1970) 51–64. [5] B. Weistfeiler (Ed.), On Construction and Identification of Graphs, Lecture Notes in Math., Springer, 1976. [6] L. Babai, P. Erdös, S.M. Selkov, Random graph isomorphism, SIAM J. Comput. 9 (1980) 628–635. [7] C. Hoffmann, Group-Theoretic Algorithms and Graph Isomorphism, Lecture Notes in Comput. Sci., vol. 136, 1982. [8] D. Corneil, M. Goldberg, A non-factorial algorithm for canonical numbering of a graph, J. Algorithms 5 (1984) 345–362. [9] E. Oren, R. Delbru, M. Catasta, R. Cyganiak, H. Stenzhorn, G. Tummarello, Sindice.com: a document-oriented lookup index for open linked data, International Journal of Metadata, Semantics and Ontologies 3 (1) (2008) 37–52. [10] G. Tummarello, C. Morbidoni, R. Bachmann-Gmür, O. Erling, RDFSync: efficient remote synchronization of RDF models, in: The Semantic Web, 6th International Semantic Web Conference, Busan, Korea, November 11–15, 2007, in: Lecture Notes in Comput. Sci., vol. 4825, Springer, 2007. [13] G. Sutcliffe, C. Suttner, The TPTP problem library: CNF release v1.2.1, J. Automat. Reason. 21 (2) (1998) 177–203. [17] W.W. Tsang, Tuning the collision test for stringency, Tech. Rep. TR-2000-05, Computer Science and Information Systems, Hong Kong University, 2000. [19] J.J. Carroll, Signing RDF graphs, in: The Semantic Web – ISWC 2003, Second International Semantic Web Conference, in: Lecture Notes in Comput. Sci.,vol. 2870, Springer, 2003, pp. 369–384. [20] C. Sayers, A. Karp, Computing the digest of an RDF graph, Tech. Rep. HPL-2003-235 (R. 1), Hewlett Packard Laboratories, 2004

[domel]

Tomaszuk, D., Głąb, S., Turoboś, F., Pawlik, T., Kuziński, D., & Sopek, M. (2022, August). Interwoven Hash of Vicious Circle Free Graph. In 2022 IEEE International Conference on Blockchain (Blockchain) (pp. 449-454). IEEE.

[iherman]

s/Erdös/Erdős/ :-)

[msporny]

PR #199 has been raised to address this issue. This issue can be closed once PR #199 has been merged.

[pchampin]

Closing, as #199 has been merged.