Add list of previous work that contributed to the science.

spec/index.html

@@ -2494,7 +2494,7 @@ <h3>Algorithm</h3>
             <p>
               Each path is represented by the concatenation of the
               identifiers for each related blank node
-              – either the issued identifier,
+              - either the issued identifier,
               or a temporary identifier created using a copy of <var>issuer</var>.
               Those for which temporary identifiers were issued are later
               recursed over using this algorithm.
@@ -3775,6 +3775,107 @@ <h2>Acknowledgements</h2>
     not necessarily reflect the position or the policy of the U.S. Government and no
     official endorsement should be inferred.
   </p>
+
+  <p>
+    The Working Group acknowledges that the success of this specification is
+    dependent on a long history of work performed over multiple decades in both
+    academia and industry. We thank the individuals that iterated on the science
+    which led to the completion of this specification. Some of these papers
+    include, but are not limited to, the following works listed below:
+  </p>
+
+  <ul>
+    <li>
+      D.G. Corneil, C.C. Gotlieb, An efficient algorithm for graph isomorphism,
+      J. ACM 17 (1970) 51-64.
+    </li>
+    <li>
+      B. Weistfeiler (Ed.), On Construction and Identification of Graphs,
+      Lecture Notes in Math., Springer, 1976.
+    </li>
+    <li>
+      L. Babai, P. Erdős, S.M. Selkov, Random graph isomorphism, SIAM J. Comput.
+      9 (1980) 628-635.
+    </li>
+    <li>
+      C. Hoffmann, Group-Theoretic Algorithms and Graph Isomorphism, Lecture
+      Notes in Comput. Sci., vol. 136, 1982.
+    </li>
+    <li>
+      D. Corneil, M. Goldberg, A non-factorial algorithm for canonical numbering
+      of a graph, J. Algorithms 5 (1984) 345-362.
+    </li>
+    <li>
+      G. Sutcliffe, C. Suttner, The TPTP problem library: CNF release v1.2.1, J.
+      Automat. Reason. 21 (2) (1998) 177-203.
+    </li>
+    <li>
+      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.
+    </li>
+    <li>
+      W.W. Tsang, Tuning the collision test for stringency, Tech. Rep.
+      TR-2000-05, Computer Science and Information Systems, Hong Kong
+      University, 2000.
+    </li>
+    <li>
+      Tim Berners-Lee and Dan Connolly, [[[DesignIssues-Diff]]]
+      [[DesignIssues-Diff]] (2001)
+    </li>
+    <li>
+      Jeremy J. Carroll, [[[HPL-2003-142]]] [[HPL-2003-142]] (2003)
+    </li>
+    <li>
+      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.
+    </li>
+    <li>
+      J.L. Gross, J. Yellen (Eds.), Handbook of Graph Theory, Discrete
+      Mathematics and Its Applications, CRC Press, 2003.
+    </li>
+    <li>
+      C. Sayers, A. Karp, Computing the digest of an RDF graph, Tech. Rep.
+      HPL-2003-235 (R. 1), Hewlett Packard Laboratories, 2004
+    </li>
+    <li>
+      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.
+    </li>
+    <li>
+      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.
+    </li>
+    <li>
+      Jesus Arias Fisteus, 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
+    </li>
+    <li>
+      Kasten, A., Scherp, A., Schauß, P. (2014). [[[eswc2014Kasten]]]. In:
+      Presutti, V., d’Amato, C., Gandon, F., d’Aquin, M., Staab, S., Tordai, A.
+      (eds) The Semantic Web: Trends and Challenges. ESWC 2014. Lecture Notes in
+      Computer Science, vol 8465. Springer, Cham.
+      https://doi.org/10.1007/978-3-319-07443-6_11 [[eswc2014Kasten]]
+    </li>
+    <li>
+      Aidan Hogan. 2017. Canonical Forms for Isomorphic and Equivalent RDF
+      Graphs: Algorithms for Leaning and Labelling Blank Nodes. ACM Trans. Web
+      0, 0, Article 00 (January 2017), 61 pages. [[Hogan-Canonical-RDF]]
+    </li>
+    <li>
+      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.
+    </li>
+  </ul>
 </section>
 
 </body>