<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Technology assisted analysis of timeline and connections in digital forensic investigations</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Hans Henseler∗</string-name>
          <email>hans.henseler@magnetforensics.com</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Digital Forensics, AI, Link analysis, Timeline, Technology Assisted</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jessica Hyde</string-name>
          <email>jessica.hyde@magnetforensics.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Discovery</institution>
          ,
          <addr-line>Graph databases, Text Mining</addr-line>
          ,
          <country>Graph Neural Networks</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Magnet Forensics, Waterloo, Canada and George Mason, University</institution>
          ,
          <addr-line>Fairfax VA</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Magnet Forensics, Waterloo, Canada and University of</institution>
          ,
          <addr-line>Applied Sciences Leiden</addr-line>
          ,
          <country country="NL">The Netherlands</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>This article describes ongoing research on the application of AI techniques such as Graph Neural Networks to assist investigators with the discovery of relations and patterns in digital forensic evidence. Digital forensic analysis of smartphones and computers reveals forensic artifacts that are extracted from structured databases maintained by the operating system and applications. Such forensic artifacts are part of a forensic ontology which can be used to build a relational graph of identifiers (e.g. users, documents) and a timeline of events. This information can assist with answering key investigation questions such as who, when, where etc. We propose to use a graph database and query language to assist in this analysis. Further, using key identifiers and aliases we want to augment digital forensic artifacts with entities, relations and events by extraction from the full-text of unstructured electronic contents such as emails and documents.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>CCS CONCEPTS</title>
      <p>• Computing methodologies → Semantic networks; Neural
networks; • Applied computing → Law; Investigation
techniques; • Information systems → Users and interactive retrieval;
• Human-centered computing → Visualization toolkits.</p>
    </sec>
    <sec id="sec-2">
      <title>INTRODUCTION</title>
      <p>
        Digital evidence continues to grow exponentially in investigations
and prosecution of suspects in both criminal as well as civil cases.
Not only in advanced cybercrime investigations, as in, ransomware
investigations or as part of incident response, but also through
the use of digital forensics in homicide cases or internal
(corporate) investigations where the suspect’s smartphone and/or laptop
needs to be examined. Smartphones and other portable "wearable"
electronics leave digital traces that can be linked to persons and
locations. The exponential growth of digital traces, as well as the
expansion of cybercrime, and digitization of investigative methods
represent significant changes to society and lead to a broadening
horizon of digital investigation [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ].
      </p>
      <p>
        This article presents work in progress on research that focuses
on the use of Artificial Intelligence (AI) as an emerging technology
that can assist forensic examiners in the discovery of patterns and
relations in digital evidence. It builds further on the ideas presented
in earlier work on computer assisted extraction of identities in
digital forensics [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ], on Semantic Search for E-Discovery [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ] and
[
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], on finding digital evidence in mobile devices [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] and on the
link and timeline analysis that is present in modern digital forensic
tools [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
      <p>
        Our vision difers from existing applications of AI in E-Discovery
that typically rely on machine learning for classifying digital
content such as predictive coding and active learning [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] that filter
and cluster emails, chats and documents or classification of pictures
with weapons, drugs and nudity. In stead we attempt to apply AI in
the discovery of relevant relations in temporal connection graphs
that are derived from extracted digital forensic artifacts.
      </p>
      <p>Smartphones and Internet of Things (IoT) devices contain many
other digital traces that are a treasure trove in a forensic
investigation. Such traces can prove to be more personal than written
communication because they do not only reveal our conscious but
also our unconscious behavior. Also smartphones have become
very personal because of their link with social media and biometric
protection (e.g. fingerprint, iris). However, this type of information
is machine generated and grows at an even faster pace than our
personal communication. Forensic investigations are in need of
more efective search strategies that can leverage the richness of
detailed forensic in modern digital evidence (e.g. from smartphones,
cloud, IoT devices etc.). We propose that investigators are assisted
with discovery through using semantic nets that are obtained from
digital evidence. We refer to this as technology assisted discovery
as opposed to technology assisted review that is very common in
E-Discovery investigations.</p>
      <p>This paper is structured as follows. Section 2 describes digital
forensic investigations and the key questions that are relevant when
investigating a case. It also describes related work on a digital
forensics ontology that can assist when taking a semantic AI approach
and explains some use cases why this is helpful when investigating
digital evidence. In section 3 we explain modern digital forensic
investigations and illustrate how link analysis and time line
visualisation are currently assisting forensic examiners in digital forensic
investigations. Section 4 presents our vision on how AI techniques
such as graph databases and entity extraction can help
discovering patterns and relations in these semantic networks of digital
artifacts. Finally, in section 5 we present conclusions and identify
future research opportunities.
2</p>
    </sec>
    <sec id="sec-3">
      <title>DIGITAL FORENSIC INVESTIGATION</title>
      <p>Digital forensic investigation typically has three phases: data
collection, data examination and data analysis. Data collection involves
the correct preservation and copying of digital data sources. Data
examination relates to the investigation of copies of digital data
sources to find files, extract fragments etc. without interpreting
the resultant findings in the context of the case. Data analysis
involves the analysis, reconstruction, interpretation and qualification
of the evidence which is obtained from the digital data sources. The
research proposed here focuses on the analysis of digital evidence.
2.1</p>
    </sec>
    <sec id="sec-4">
      <title>Investigation Questions</title>
      <p>In any investigation the investigators, regardless if they are senior
legal counsel in legal E-Discovery or senior investigating oficers or
detectives in a criminal investigation, try to answer the following
’golden’ investigation questions:
1 Who–was involved?
2 What–happened?
3 Where–did it happen?
4 How–was the crime committed?
5 When–did the crime take place?
6 With what–was the crime committed?
7 Why–was the crime committed?</p>
      <p>
        The analysis of digital evidence in E-Discovery investigations
typically focuses on document review and analysis where reviewers
and senior investigators analyse textual content. They are assisted
by machine learning (also known as predictive coding and
continuous active learning [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]) to identify relevant emails and documents
to speed up their investigation. Digital forensic investigations on
smartphones and computers are a bit diferent. Here investigators
go beyond email and document analysis and study digital artifacts
that can be quite pertinent when trying to answer these questions
[
        <xref ref-type="bibr" rid="ref14">14</xref>
        ].
      </p>
      <p>Who-questions can often be answered by investigating which
person is using an e-mail address, user account or phone number.
Communication via text messages, chat and email may help to
understand what has happened. Call details records, GPS-locations
and WiFi-network tell something about the location of a
smartphone and consequently of it’s user. Pictures and video can provide
visual clues how a crime was committed and with what kind of
weapon. Date and time of a file or trace, tell when data was last
accessed, modified or created. Computers and smartphone
maintain detailed records when apps and users were active and which
ifles were involved. Besides messages that a user communicated via
emails and chat messages, search history from a browser or specific
apps can help understand motive and premeditation.
2.2</p>
    </sec>
    <sec id="sec-5">
      <title>Digital Forensics Ontology</title>
      <p>
        Document analysis in E-Discovery heavily relies on the review and
analysis of unstructured information that is contained in emails and
documents. The analysis of digital forensic artifacts described above
is more structured. In order to understand this structure and to be
able to analyse it, it is useful to have a digital forensics ontology.
The Cyber-investigation Analysis Standard Expression (CASE) [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]
provides such an ontology. CASE is an open standard that is
currently under development. It can be used to describe diferent types
of digital evidence from various domains such as incident response,
counter terrorism, criminal investigations, forensic investigations
and gathering of intelligence. CASE enables better coordination of
investigations in diferent jurisdictions so that criminal individuals
and organisations are discovered faster while generating a more
complete overall view on their criminal activities.
      </p>
      <p>Once a semantic network has been formed based on a digital
forensics ontology, it can assist with identifying possible crime
scenarios and with testing hypothesis which is becoming
increasingly important in investigations. Sometimes it’s more important
to know with who a victim, suspect or witness communicated, and
where these persons were than actually knowing what has been
communicated. AI can assist investigators with detecting
correlations that can lead to the discovery of relationships that were
not known. This is called link analysis. Analysing a social network
from a collection of emails is not new but link analysis based on
digital forensic artifacts relies on a much richer set of data.
2.3</p>
    </sec>
    <sec id="sec-6">
      <title>Use cases</title>
      <p>Modern digital forensic tools have a feature that performs link
analysis to assist forensic examiners with their investigations. Axiom
is a commercial digital forensics processing tool created by
Magnet Forensics that build a connections database from relationships
between discovered artifacts (e.g. users, files etc.). Triples (subject,
predicate, object) are extracted following the forensic ontology
similar to the CASE ontology introduced in the previous section.
These triples define a forensics ontology that is used by Axiom to
automatically generate relationship graphs.</p>
      <p>Subject Predicate Object
ifle accessed on system
ifle accessed on USB
ifle accessed by user id
ifle transferred with program name
ifle transferred by user id
ifle related cloud
ifle emailed to email address
ifle downloaded with program name
ifle downloaded by user id
contact name contacted with device
contact name contacted by person
picture hit similar to picture hit
ifle/msg contains key words
ifle/msg references ifle name
call log call to contact name
user id used program name
user id searched for key words
Table 1: Subset of triples of the forensic ontology that is used
in Axiom</p>
      <p>Link analysis has interesting use cases for forensic examiners:
(1) Given a hit the examiner needs to see a visual representation
of all related evidence. Where the ’related’ links are one of
the concepts identified in the forensics ontology.
(2) Given a link to related evidence the examiner should be able
to follow the link and may want to pivot the data around the
destination or choose a diferent visualisation. For example,
the examiner identified a search query in browser history
and then wants to review all events on the system before
and event this query was executed.</p>
    </sec>
    <sec id="sec-7">
      <title>EXPERIMENT</title>
      <p>
        To validate the idea and explore the potential of AI for assisting
with the discovery of patterns and relations in digital forensics data,
we have processed the M57-Jean scenario [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] in Axiom (version
3.0).
      </p>
      <p>The M57-Jean scenario is a single disk image scenario involving
the ex-filtration of corporate documents from the laptop of a senior
executive. The scenario involves a small start-up company, M57.Biz.
A few weeks into inception a confidential spreadsheet that contains
the names and salaries of the company’s key employees was found
posted to the "comments" section of one of the firm’s competitors.</p>
      <p>The spreadsheet ’m57bis.xls’ only existed on one of M57’s
oficersJean. Jean says that she has no idea how the data left her laptop and
that she must have been hacked. The investigator has been given a
disk image of Jean’s laptop and is asked to figure out how the data
was stolen, or, if Jean isn’t as innocent as she claims.
3.1</p>
    </sec>
    <sec id="sec-8">
      <title>Axiom Link analysis</title>
      <p>
        Link analysis in itself is not a new concept in digital forensics as is
reflected by work published in 2015 [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] and was introduced earlier
in 2005 in the field of network forensics [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ]. However, it tends to
focus on traditional ’call chain analysis’-focusing on phone calls,
text messages, and/or social media connections or IP addresses
between people or computers rather than the artifacts they create
[
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
      <p>Artifact relationship analysis goes beyond visualizing
relationships between people and computers. It applies the link analysis
concept to files and operating system artifacts, helping a
forensic examiner to visualize relationships within artifacts and across
evidence sources, such as, computers, mobile devices, and even
cloud-based accounts.</p>
      <p>
        Figure 1 above presents an example of link analysis in Axiom.
This example was discussed in a Magnet Forensics webinar [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. The
tree like structure on the left side shows the file name of a
spreadsheet "m57biz.xls". It shows various relations to other elements, e.g.,
"Transferred by" and identifier "Jean User &lt;jean@m57.biz&gt;", "Hash
hash" with a md5 as well as a sha1 hash value, "Application name"
relation with an application named "Outlook" etc. The right side of
the picture displays matching results. This overview lists records
from the Windows MRU (Most Recently Used) list, file system last
accessed date, Outlook email record etc. Axiom allows the user to
navigate the graph manuall by selecting an end node and making
it the center node by double clicking.
      </p>
    </sec>
    <sec id="sec-9">
      <title>Axiom Timeline analysis</title>
      <p>
        In [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] an overview is presented of the evolution of timeline analysis
in digital forensics. Initially, timeline analysis was focused on
filebased dates and times. Around 2010 the first tools became available
that started using times from inside files. Modern digital forensic
tools (both open source as well as commercial) have advanced
timeline capabilities that visualise digital forensic artifacts.
      </p>
      <p>Figure 2 presents a screenshot of the new timeline visualisation
and analysis feature in Axiom 3.0. The top section shows a timeline
reflecting artifact counts for a period of 6 minutes starting from
July 20, 2008 1:24:40am and ending 1:30:40am. The table below the
timeline presents a detailed view of the artifacts presented in the
graph. At the top is a "File download" record from email, followed
by "File/folder opening", then the "File knowledge" reflecting the
creation of a new file "m57biz.xls". Such a sequence of artifacts may
help understand how a file came into existence on a computer and
if it was opened on that computer.</p>
      <p>
        Generation of timelines has also received much attention outside
the field of digital forensics. Many applications exist that allow for
creation of time lines in an investigation. For example, building case
chronologies with CaseFleet [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], create a timeline for your court
case with TrialLine [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] and assembling case facts in a chronological
order with CaseMap [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. However, our first impression is that each
one of these tools relies on manual development of case timelines
without the help of artificial intelligence.
      </p>
      <p>Both timeline analysis as well as link analysis are (separately
from each other) considered powerful instruments in an
investigation. However, we propose that in combination these features
become even more powerful enabling an examiner to analyse links
in the relation graph in a chronological order which provides more
meaning and context then when simply filtering a timeline for
selected entities or filtering the relation graph for a particular time
frame.
4</p>
    </sec>
    <sec id="sec-10">
      <title>PROPOSED RESEARCH</title>
      <p>Our research focuses on the combination of timeline and link
analysis. In order to accomplish this we propose to use a graph database
with a graph query language. The graph can initially be constructed
from forensic artifacts. With modern graph databases and graph
query languages it becomes easy to augment this graph with
additional data. This could include data from non-digital sources but
also by text mining the full-text of electronic documents and emails,
new relations might be uncovered that previously would have
required human inspection of the contents of such documents.
4.1</p>
    </sec>
    <sec id="sec-11">
      <title>Graph database and language</title>
      <p>Visualisation of traces in a network, on a map or on a timeline can
assist a forensic investigator to understand the story that is behind
the data. By ingesting the information that is extracted by Axiom
in the M57-Jean case in a graph database, it becomes possible to
experiment further with visualisations and discovering relations.</p>
      <p>
        Cypher is a graph query language that allows for expressive
and eficient querying of graph data [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. It lets developers write
graph queries by describing patterns in the data. If we have a graph
describing our digital forensic artifacts, Cypher is designed to be a
human readable query language and is suitable for both developers
as well as forensic examiners.
      </p>
      <p>Cypher describes nodes, relationships and properties as ASCII art
directly in the language, making queries easy to read and recognize
as part of your graph data. Figure 3 below presents an example of a
simple Cypher query.</p>
      <p>
        Cypher is supported by a variety of graph databases. We intend
to use Neo4j [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] for our experiments which will start with
modeling a relational graph based on a selection of the digital forensics
ontology that is used by Axiom. Then we’ll investigate how easy it
is for examiners to formulate Cypher queries and which standard
queries can be formulated to identify interesting relationships that
can be prioritized for review.
      </p>
    </sec>
    <sec id="sec-12">
      <title>Integration with other information sources</title>
      <p>Once the digital artifacts from a case have been imported in the
graph database, it becomes quite simple to add relations and objects
in the same case that were discovered through other sources. These
can either be other sources of digital evidence, e.g., other cases,
call detail records, or from non-digital sources such as witness and
victim statements, lawful interception, observation, open source
intelligence or case time lines that were manually created assisted
by software such as mentioned in paragraph 3.</p>
      <p>
        By leveraging the scalability of modern graph databases a great
variety of additional information can be included in the automated
analysis [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. Further research is required to investigate what other
information (that is typically available in a criminal investigation)
can be combined with the digital forensics graph in a useful way.
We expect that to some extent even scenarios and hypothesis can be
formulated as (a set of) graph queries which can be tested against
the graph containing all known information on the case.
4.3
      </p>
    </sec>
    <sec id="sec-13">
      <title>Extracting relations and timelines from full text</title>
      <p>More than 90% of the information around us is mostly
unstructured, e.g., documents, emails and chat messages. Text mining can
help investigators by turning this unstructured information into
structured data. Entity extraction can extract entities (e.g. names
of people, organisations, places etc) and events from full text.
Unfortunately the extraction of entities is error prone and generates
many false positives making the results useless. By using identifiers
that have been discovered from digital forensic analysis the entity
extraction can be targeted reducing the number of false positive
identities.</p>
      <p>
        Some interesting work in the field of entity-centric timeline
extraction has been reported in [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. A prototype tool is being
developed that can extract structured information on events for a
given entity of interest and place anchors on a time line for these
events. It uses massive streams of textual documents as input (e.g.
online news, social media posts or any crawled web documents).
      </p>
      <p>
        With digital forensics it is already possible to extract identities
from structured information through digital forensic analysis [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ].
When an examiner identifies an interesting identity probably this
identity will have associated email aliases, accounts, phone numbers
etc. Once this information is known it can be added to the relation
graph and will help in extracting a timeline of events that are related
to these identities.
4.4
      </p>
    </sec>
    <sec id="sec-14">
      <title>Using AI to understand graphs and timelines</title>
      <p>Analysing a graph using a visualisation tool seems simple enough.
As graphs get bigger, traditional mathematics can help with the
analysis of the graph but these methods also have their limitations.
One of the problems is that there is no clear beginning or ending of
a graph (assuming it’s cyclic) and that large scale matrix operations
that are typically required for graph analysis do not compute due
to memory and time restrictions.</p>
      <p>Ontologies, graph database and graph query language are well
established and are hardly considered AI techniques. Extracting
relations and timelines from full text are well established AI
techniques that we hope to leverage in our research but we have no
intention of improving this. The core idea in our innovation is to
use Graph Neural Networks (GNNs) as a new AI technique that
can assist with the analysis of large time-based graphs of relations.</p>
      <p>
        GNNs were first introduced in 2009 [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] and have recently gained
increasing popularity in various domains, including including social
science (social networks), natural science and knowledge graphs
[
        <xref ref-type="bibr" rid="ref22">22</xref>
        ]. Similar to the successful application of Convolutional Neural
Networks (CNNs) in image classification and Recurrent Neural
Networks (RNNs) in natural language processing, variations of
GNNs have have demonstrated ground-breaking performance on
many tasks.
      </p>
      <p>Our research hypothesis is that we can use GNNs to model
interesting relation graphs which can assist investigators with the
identification of relevant subgraphs from a highly complex case
graph that is automatically constructed from digital forensic
artifacts combined with other case data.
5</p>
    </sec>
    <sec id="sec-15">
      <title>CONCLUSIONS</title>
      <p>We propose to use a graph database and query language to assist
in digital forensic investigations. We start with a relation graph
that is based on connections from digital forensic artifacts. Further
research and experiments are needed to study how forensic
examiners can interact with this graph and how to extend the graph with
other data sources. In particular we intend to study how events
on a timeline can be added to the graph, how information from
non-digital evidence can be added and how we can improve the
performance of existing entity extraction techniques on unstructured
data from emails and documents. Finally, we want to research if new
machine learning techniques such as GNNs can be used to learn
from investigators what link and event patterns are interesting
from an investigator perspective.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1] [n. d.].
          <source>About Cypher</source>
          . Adapted from https://www.opencypher.org/about, Accessed:
          <fpage>2019</fpage>
          -04-22.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2] [n. d.].
          <source>CaseFleet: Building Powerful Case Chronologies with CaseFleet</source>
          . Company website, https://www.casefleet.
          <article-title>com/timelines-case-timeline-</article-title>
          <string-name>
            <surname>software</surname>
          </string-name>
          , Accessed:
          <fpage>2019</fpage>
          -05-22.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3] [n. d.].
          <source>CaseMap: Chronology best Practices</source>
          . Product pagee, https://www. casesoft.com/download/chrons.pdf, Accessed:
          <fpage>2019</fpage>
          -05-22.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4] [n. d.].
          <article-title>Neo4j: The Internet-Scale Graph platform</article-title>
          .
          <source>Neo4J website</source>
          , https://neo4j. com/product/, Accessed:
          <fpage>2019</fpage>
          -04-23.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5] [n. d.].
          <source>TrialLine: Legal Timelines for Your Court Case. Company blog</source>
          , https: //blog.trialline.
          <article-title>net/legal-timelines-for-your-case-in-court</article-title>
          , Accessed:
          <fpage>2019</fpage>
          -05-22.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <year>2012</year>
          .
          <article-title>M57-Jean Scenario</article-title>
          . In Digital Corpora.
          <article-title>Scenario published at the Digital Corpora website</article-title>
          , https://digitalcorpora.org/corpora/scenarios/m57-jean, Accessed:
          <fpage>2019</fpage>
          -04-15.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <fpage>2018</fpage>
          .
          <article-title>Telling the Story of Digital Evidence</article-title>
          . (
          <year>2018</year>
          ).
          <article-title>Magnet Forensics blog</article-title>
          , https://www.magnetforensics.com/blog/telling
          <article-title>-the-story-of-digitalevidence/</article-title>
          , Accessed:
          <fpage>2019</fpage>
          -04-22.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Fergal</given-names>
            <surname>Brennan</surname>
          </string-name>
          , Martins Udris, and
          <string-name>
            <given-names>Pavel</given-names>
            <surname>Gladyshev</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>An Automated Link Analysis Solution Applied to Digital Forensic Investigations</article-title>
          . https://doi.org/10. 1007/978-3-
          <fpage>319</fpage>
          -14289-0_
          <fpage>13</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>E.</given-names>
            <surname>Casey</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>The broadening horizons of digital investigation</article-title>
          .
          <source>Editorial of Digital Investigation</source>
          <volume>21</volume>
          (
          <year>2017</year>
          ),
          <fpage>1</fpage>
          -
          <lpage>2</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>E.</given-names>
            <surname>Casey</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Barnum</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Grifith</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Snyder</surname>
          </string-name>
          ,
          <string-name>
            <surname>H. Van Beek</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Nelson</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Advancing coordinated cyber-investigations and tool interoperability using a community developed specification language</article-title>
          .
          <source>Digital Investigation</source>
          <volume>22</volume>
          (
          <year>2017</year>
          ),
          <fpage>14</fpage>
          -
          <lpage>15</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Gordon</surname>
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Cormack</surname>
          </string-name>
          and
          <string-name>
            <surname>Maura R. Grossman</surname>
          </string-name>
          .
          <year>2015</year>
          .
          <article-title>Multi-Faceted Recall of Continuous Active Learning for Technology-Assisted Review</article-title>
          .
          <source>In SIGIR 2015 Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval.</source>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>David</given-names>
            <surname>Graus</surname>
          </string-name>
          .
          <year>2017</year>
          . Entities of Interest.
          <source>Ph.D. Dissertation</source>
          . Informatics Institute, University of Amsterdam.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>C.</given-names>
            <surname>Hargreaves</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Patterson</surname>
          </string-name>
          .
          <year>2012</year>
          .
          <article-title>An automated timeline reconstruction approach for digital forensic investigations</article-title>
          .
          <source>Digital Investigation</source>
          <volume>9</volume>
          (
          <year>2012</year>
          ),
          <fpage>S69</fpage>
          -
          <lpage>S879</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>H.</given-names>
            <surname>Henseler</surname>
          </string-name>
          and
          <string-name>
            <given-names>V.</given-names>
            <surname>Noort</surname>
          </string-name>
          .
          <year>2017</year>
          .
          <article-title>Finding Digital Evidence in Mobile Devices</article-title>
          . (
          <year>2017</year>
          ).
          <article-title>Presentation at DFRWS US 2017 conference</article-title>
          , https://www.dfrws.org/conferences/ dfrws-usa
          <article-title>-2017/sessions/finding-digital-evidence-mobile-</article-title>
          <string-name>
            <surname>devices</surname>
          </string-name>
          , Accessed:
          <fpage>2019</fpage>
          -04-03.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>Jop</surname>
            <given-names>Hofste</given-names>
          </string-name>
          , Hans Henseler, and Maurice van Keulen.
          <year>2013</year>
          .
          <article-title>Computer assisted extraction, merging and correlation of identities with Tracks Inspector</article-title>
          .
          <source>In Proceedings of the International Conference on Artificial Intelligence and Law (ICAIL</source>
          <year>2013</year>
          ).
          <fpage>247</fpage>
          -
          <lpage>248</lpage>
          . https://doi.org/10.1145/2514601.2514639 Demo-paper.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>J.</given-names>
            <surname>Hyde</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>Connecting the Dots Between Artifacts and User Activity</article-title>
          .
          <article-title>(</article-title>
          <year>2018</year>
          ).
          <article-title>Recorded webinar</article-title>
          , https://www.magnetforensics.com/resources/connectingartifacts-property
          <string-name>
            <surname>-</surname>
          </string-name>
          theft-webinar/, Accessed:
          <fpage>2019</fpage>
          -04-23.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>Jakub</surname>
            <given-names>Piskorski</given-names>
          </string-name>
          , Vanni Zavarella, and
          <string-name>
            <given-names>Martin</given-names>
            <surname>Atkinson</surname>
          </string-name>
          .
          <year>2018</year>
          .
          <article-title>On the Development of an Entity-Centric Timeline Extraction Tool</article-title>
          .
          <fpage>821</fpage>
          -
          <lpage>824</lpage>
          . https://doi.org/10.1109/ ASONAM.
          <year>2018</year>
          .8508798
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>G.</given-names>
            <surname>Sadowski</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.</given-names>
            <surname>Rathle</surname>
          </string-name>
          .
          <year>2016</year>
          .
          <article-title>Why Modern Fraud Detection Needs Graph Database Technology</article-title>
          . (
          <year>2016</year>
          ).
          <article-title>Neo4j blog</article-title>
          , https://neo4j.com/blog/fraud-detectiongraph
          <string-name>
            <surname>-</surname>
          </string-name>
          database-technology/, Accessed:
          <fpage>2019</fpage>
          -04-22.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <surname>Franco</surname>
            <given-names>Scarselli</given-names>
          </string-name>
          , Marco Gori, Ah Chung Tsoi, Markus Hagenbuchner, and
          <string-name>
            <given-names>Gabriele</given-names>
            <surname>Monfardini</surname>
          </string-name>
          .
          <year>2009</year>
          .
          <article-title>The Graph Neural Network Model</article-title>
          .
          <source>Trans. Neur. Netw</source>
          .
          <volume>20</volume>
          ,
          <issue>1</issue>
          (Jan.
          <year>2009</year>
          ),
          <fpage>61</fpage>
          -
          <lpage>80</lpage>
          . https://doi.org/10.1109/TNN.
          <year>2008</year>
          .2005605
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <surname>David van Dijk</surname>
          </string-name>
          ,
          <string-name>
            <surname>David Graus</surname>
            ,
            <given-names>Zhaochun</given-names>
          </string-name>
          <string-name>
            <surname>Ren</surname>
          </string-name>
          , Hans Henseler, and Maarten de Rijke.
          <year>2015</year>
          .
          <article-title>Who is involved? Semantic search for e-discovery</article-title>
          .
          <source>In ICAIL 2015 Workshop on Using Machine Learning and Other Advanced</source>
          Techniques to Address Legal Problems in E-Discovery and
          <string-name>
            <given-names>Information</given-names>
            <surname>Governance (DESI VI Workshop</surname>
          </string-name>
          <article-title>)</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>W.</given-names>
            <surname>Wang</surname>
          </string-name>
          and
          <string-name>
            <given-names>T.</given-names>
            <surname>Daniels</surname>
          </string-name>
          .
          <year>2005</year>
          .
          <article-title>Network Forensics Analysis with Evidence Graphs</article-title>
          . (
          <year>2005</year>
          ).
          <article-title>Published in the proceedings of the DFRWS US 2005 conference</article-title>
          , https://www.dfrws.org/sites/default/files/session-files/
          <article-title>paper-network_ forensics_analysis_with_evidence_graphs</article-title>
          .pdf, Accessed:
          <fpage>2019</fpage>
          -04-22.
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <surname>Jie</surname>
            <given-names>Zhou</given-names>
          </string-name>
          , Ganqu Cui, Zhengyan Zhang, Cheng Yang, Zhiyuan Liu, and
          <string-name>
            <given-names>Maosong</given-names>
            <surname>Sun</surname>
          </string-name>
          .
          <year>2018</year>
          . (12
          <year>2018</year>
          ). Research gate, https://www.researchgate.net/ publication/329841448_Graph_
          <article-title>Neural_Networks_A_Review_of_Methods_</article-title>
          and_Applications, accessed:
          <fpage>2019</fpage>
          -05-31.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>