![]() Background and history Ī citation is a reference to a published or unpublished source (not always the original source). ![]() Exceptions might occur when papers are withdrawn from circulation. Īs citation links are meant to be permanent, the bulk of a citation graph should be static, and only the leading edge of the graph should change. Such "backward" citations seem to constitute less than 1% of the total number of links. The timing of asynchronous updates to bibliographies may lead to edges that apparently point backward in time. This is not always the case in practice, since an academic paper goes through several versions in the publishing process. This means that an ideal citation graph is not only directed but acyclic that is, there are no loops in the graph. In principle, each document should have a unique publication date and can only refer to earlier documents. However, there is a long history of creating citation databases, also known as citation indexes, so there is a lot of information about such problems. Furthermore, citation errors can occur at any stage of the publishing process. ![]() There is no standard format for the citations in bibliographies, and the record linkage of citations can be a time-consuming and complicated process. They are predicted to become more relevant and useful in the future as the body of published research grows. Ĭitation graphs have been utilised in various ways, including forms of citation analysis, academic search tools and court judgements. In this example, document b cites document d, and is cited by document a.Ī citation graph (or citation network), in information science and bibliometrics, is a directed graph that describes the citations within a collection of documents.Įach vertex (or node) in the graph represents a document in the collection, and each edge is directed from one document toward another that it cites (or vice versa depending on the specific implementation).
0 Comments
Leave a Reply. |