<!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>
      <journal-title-group>
        <journal-title>March</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Efective queries for mega-analysis in cognitive neuroscience</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Anna Ravenschlag</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Monique Denissen</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Bianca Löhnert</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Mateusz Pawlik</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Nicole Himmelstoß</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Florian Hutzler</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Paris-Lodron-University of Salzburg, Department of Computer Sciences</institution>
          ,
          <addr-line>Jakob-Haringer-Straße 2, 5020 Salzburg</addr-line>
          ,
          <country country="AT">Austria</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Paris-Lodron-University of Salzburg, Department of Psychology, Centre for Cognitive Neuroscience</institution>
          ,
          <addr-line>Hellbrunnerstraße 34, 5020 Salzburg</addr-line>
          ,
          <country country="AT">Austria</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2023</year>
      </pub-date>
      <volume>31</volume>
      <issue>2023</issue>
      <fpage>0000</fpage>
      <lpage>0002</lpage>
      <abstract>
        <p>Functional neuroimaging investigates the neural correlates of performing cognitive tasks. The empirical evidence in this field is constantly growing and gave rise to methods for assessment and integration of the results across diferent studies. A promising and suitable technique is the so-called mega-analysis. Performing mega-analysis is, however, challenging. It is a multi-step process which connects a researcher's implicit reasoning about information processing in the brain with complex analysis of heterogenous data. Although the process of mega-analysis is well understood, it comprises many concepts and queries that lack a formal definition. Therefore, it is dificult to choose a suitable data model, design a data schema, and implement the relevant queries. A prerequisite for a successful mega-analysis is a set of studies conforming to a carefully defined experimental setting. Finding such datasets is, however, a laborious and error-prone task of keywordbased literature search. To aid understanding of the underlying issues, we propose a conceptual model of mega-analysis. The model integrates a researcher's implicit knowledge with a systematic definition of relevant data. The nature of the data suggests a graph data model for efectively querying datasets. Consequently, we define a knowledge graph integrating the data associated with experimental setting, formally define the queries over the knowledge graph, and showcase their implementation in a graph database.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;mega-analysis</kwd>
        <kwd>conceptual modeling</kwd>
        <kwd>knowledge graph</kwd>
        <kwd>graph queries</kwd>
        <kwd>graph database</kwd>
        <kwd>cognitive neuroscience</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        low researchers to share their data with each other. cessing the sex of male and female faces and does
OpenNeuro requires data to be stored according to this difer between men and women? The desired
BIDS, and currently houses more than 800 datasets. experimental settings for qualifying datasets are:
HED annotations are part of the BIDS specification. While recording a fMRI signal (acquisition
parameDespite these eforts, identifying the studies relevant ters), men and women (participant demographics)
to a mega-analysis remains a challenging task. were asked to identify the sex of faces presented in a
series of images (activity details). In this paper, we
Mega-analysis workflow. A mega-analysis typi- focus on the details of the activity the participants
cally investigates a particular cognitive process or were tasked to perform.
functionality of a brain region. The respective
research question usually involves contrasting two or Problem statement. The goal of this paper is a
more carefully defined experimental setting condi- querying framework for mega-analysis in functional
tions [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. The criteria for a desired condition [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] can neuroimaging. We focus on solving the following
be arbitrarily complex. We exemplify three aspects problem: From a collection of datasets return those
of experimental settings: specifics of an activity the comprising a given experimental setting condition.
participants were tasked to perform, demographics
and other characteristics of participants, and data Challenges of querying experimental settings.
acquisition parameters specific to a measuring de- Querying experimental settings efectively and
transvice (see Example 1.1). Note that for a particular parently is essential, not only in the context of
mega-analysis additional properties may also be of mega-analysis, but also to related work search or
importance. methodologies like reverse inference [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ].
Unfortu
      </p>
      <p>
        Ideally, the experimental settings should be nately, it currently faces three main challenges.
queried directly in the datasets. This, however, is 1. The experimental setting is not systematically
currently not possible due to poor data availability defined. A fundamental part of verifying the
releand annotation. Therefore, to find relevant datasets, vance of a dataset is matching its experimental
seta researcher starts with a keyword-based literature ting to the desired conditions for the mega-analysis.
search followed by data requests. Keyword search Despite this, experimental settings lack a formal
is error-prone because it strongly depends on the definition, which makes comparing studies dificult.
presence of keywords in an article text and is bi- The annotations provided in the data use arbitrary
ased by the choice of keywords [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. We argue that terminology making it impossible to infer the
reintroducing more frameworks similar to the one pre- quired details. More information can be found only
sented here may incentivize a higher availability of in the publications describing the studies. At the
data and their more accurate annotation. same time, researchers focus their annotations on
      </p>
      <p>
        Once the qualifying datasets are collected, they the study they conducted and not on possible future
undergo a signal analysis. The existing techniques analysis scenarios.
vary, and their choice depends on the research ques- 2. The data is heterogenous in its format. The
tion. The data acquired by fMRI can be interpreted commonly applied BIDS format [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] specifies how
as the changes in the intensity of brain activation at datasets should be organized in a file system,
includa specific brain location, called voxel, over time. A ing directory structure, file names and their formats.
common analysis method models an expected brain However, the relevant information is spread among
activation on the basis of the specified experimental tabular (TSV) and structured (JSON) files and has
setting conditions, which in turn is compared to the only a partial schema, which can be arbitrarily
exrecorded signal in each voxel. This analysis allows tended by user-defined columns and keys. Querying
to explore whether the variation of conditions can information in a file system is complicated and may
explain an intensified brain activation at any loca- be ineficient. Furthermore, it is hard to choose a
tion in the brain. The results for each participant of suitable data model without fully understanding
a study are aggregated, compared between diferent the data.
participant groups, and extrapolated to the whole 3. Querying experimental settings is limited to
population. keyword search. The experimental settings are either
      </p>
      <p>
        To better illustrate the concepts throughout this narratively described in the corresponding
publicapaper, we introduce the following example. tions or they are poorly annotated with arbitrary
Example 1.1. Running example. A cognitive neuro- labels in the data. The custom and unstructured
scientist investigates the following research question: annotations vary between datasets and researchers,
Is there a diference in brain activation between pro- limiting the queries to imprecise keyword
matching. Curated taxonomies like HED [
        <xref ref-type="bibr" rid="ref5 ref6">5, 6</xref>
        ] solve the by identifying its constituent entities and how they
problem of inconsistent terminology. The HED relate to each other. Importantly, the resulting
taxonomy consist of terms designed to describe ex- model represents a conceptualization that is
taiperimental events on a level relevant to the study lored towards the requirements of our use case, i.e.
of human action, perception and cognition. HED it abstracts from reality to focus on the elements
terms can be grouped together to form a description that are essential for our queries. As basis for the
of a particular aspect of an event. The experiment ontological analysis, we leveraged the environment
events can be annotated with one or more of these of theories and tools provided by the Unified
Foungroups. However, the result is a collection of com- dational Ontology (UFO) which formally defines
plex string labels, which cannot be queried directly. fundamental conceptual modeling notions such as
entity and relationship types [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. For the
purContributions. To address the challenges of build- pose of our current contribution, we employed the
ing an efective querying framework for mega- core categories of UFO (UFO-A) which describe
analysis, this paper makes the following contribu- endurant types such as objects, taxonomic relations,
tions. and associations. In future iterations we may
further specify the conceptualization of mega-analysis
• We propose a novel comprehensive model for by incorporating more recent developments on
permega-analysis that integrates the complex durant types (UFO-B) or intentional and social
endata with the researcher’s reasoning. Our tities (UFO-C). The model was implemented using
model captures the essential concepts down the ontology-driven conceptual modeling language
to the level of data types. This helps to OntoUML [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] which is based on the Unified
Modeldetermine the data model and a possible ing Language. Compared to traditional conceptual
solution to the problem statement query. modeling languages, OntoUML ofers two main
ad• We propose a novel graph definition of exper- vantages for modeling our use case scenario: First, it
imental settings which is suitable for both allows for conceptual clarification by reflecting the
querying conditions and data annotation. ontological distinctions put forward by UFO. In
traSuch a representation allows us to simplify ditional modeling languages such as OWL or UML,
ifnding qualifying datasets with an elemen- the ontologically distinctive types of entities and
tary subgraph query. relations (which are made explicit in OntoUML) are
• We showcase our solution by building a collapsed to one single type of entity (e.g. class) and
knowledge graph for the running example relation (e.g. association). Consequently, OntoUML
in Neo4j and implementing the queries with provides means to diferentiate various object and
Cypher MATCH statements. relationship types that reflect real-world semantics.
      </p>
      <sec id="sec-1-1">
        <title>Second, OntoUML introduces constraints which ex</title>
        <p>Thus, these contributions demonstrate a proof- clude the creation of models that would break the
of-concept for ontologically conceptualizing mega- axiomatization of UFO, thus allowing researchers
analysis, translating the elements critical for dataset to explicate their domain specific knowledge within
queries into a graph representation, and implement- syntactically and semantically valid models.
ing a queriable prototype using Neo4j. The targeted The entities in our model are conceptualized as
user group for subsequent large-scale implementa- kinds, i.e. basic types of objects that exist in the
tions are cognitive neuroscientists in need of efec- real world and provide a uniform principle of
identive and easy-to-use solutions for finding datasets tity for their instances. To represent the intrinsic
suitable for mega-analysis. properties of kinds, we employ quality types and
subkinds of quality types, i.e. functions that take
elements in the extension of an object type and map
2. Modeling mega-analysis them to a respective quality structure. These
quality structures form either one-dimensional (quality
We present a conceptual model of a mega-analysis dimension) or multi-dimensional (quality domain)
use case in Figure 1. It serves the purpose of clari- conceptual spaces. In OntoUML, quality structures
fying relevant concepts in mega-analysis, their re- are represented as datatypes that organize the
possilations, and value spaces to derive an appropriate ble values which can be attributed to the respective
graph representation of the elements critical for quality types. The relationships between kinds are
querying datasets (see Section 3). For building the modeled as material relations that are existentially
conceptual model, we ontologically analyzed the dependent on both their bearer and an external
process of mega-analysis in cognitive neuroscience entity, i.e. they link two kinds by establishing a
..*
1
&lt;&lt;kind&gt;&gt;</p>
        <p>Predictor
&lt;&lt;material&gt;&gt;
defines
&lt;&lt;material&gt;&gt;
/ comprises
1..*
&lt;&lt;kind&gt;&gt;</p>
        <p>Event
&lt;&lt;subkind&gt;&gt;
HED Grouping
Graph Event Quality
&gt;
&gt;
itraon luea
tu v
trcu sha
s&lt;
&lt;
&lt;&lt;datatype&gt;&gt;</p>
        <p>HED Grouping 1
1 Graph Dimension
-g : HEDGraph
&lt;&lt;kind&gt;&gt; 1..*
Event File</p>
        <p>1
&gt;
&gt;
f
tnO tr
e a
n p
poom sah
c&lt;
&lt; *
..
1
&gt;
&gt;
n
o
i
tza isn
ir
tce ree
raa inh
h
c&lt;&lt; ..*</p>
        <p>1
&lt;&lt;quality&gt;&gt;
Event
Quality
disjoint
&gt;
&gt;
itrona leua
tu v
trcu sha
s&lt;
&lt;</p>
        <p>1
&lt;&lt;datatype&gt;&gt;
Duration Quality</p>
        <p>Dimension
-d : DurationValue
&lt;&lt;subkind&gt;&gt;
Temporal
Event Quality
disjoint
&gt;
&gt;
itrona leau
tu v
trcu sha
s&lt;
&lt;
Researcher's reasoning</p>
        <p>Analysis</p>
        <p>Data
&lt;&lt;material&gt;&gt;
input to
&lt;&lt;material&gt;&gt;
1 &lt;&lt;kind&gt;&gt; 1..* answers</p>
        <p>Research
1 Question
&lt;&lt;kind&gt;&gt;</p>
        <p>Signal
1..* Analysis
litrae&gt;&gt; irsnem iltrae&gt;&gt; irsnem
a te a te
&lt;&lt;m /de &lt;&lt;m /de
1
1
1
1
1
1
1
&lt;&lt;subkind&gt;&gt;
Event Duration</p>
        <p>Quality
&lt;&lt;subkind&gt;&gt;
Event Onset
Quality
&lt;&lt;subkind&gt;&gt;
Age Quality
&lt;&lt;subkind&gt;&gt;</p>
        <p>Sex Quality
1</p>
        <p>1
1
1
semantically meaningful connection between them. can take.</p>
      </sec>
      <sec id="sec-1-2">
        <title>Qualities inhere in their bearer entities via charac</title>
        <p>
          As outlined in Figure 1, performing a
megaterization relations, i.e. they represent the features analysis necessitates to connect i) the researcher’s
intrinsic to the object type they existentially depend reasoning (top left) with ii.) the planned analysis
on. Qualities, in turn, are structured via structura- (top middle), iii.) the datasets that qualify for this
tion relations, connecting them to the datatypes analysis by means of a particular experimental
setthat define the space of possible values a quality ting (top right), and iv.) the diferent data types
n5
n8
n9
comprised in the datasets (bottom). Since events
are the essential building blocks of the
experimental setting, our current work focuses exclusively on
the connection between the researcher’s reasoning
and event data via a common, queriable datatype n3 n1 n7 n6
(colored entities). For a standardized description of
event data, we employ the HED taxonomy [
          <xref ref-type="bibr" rid="ref5 ref6">5, 6</xref>
          ]. n2 n4
        </p>
      </sec>
      <sec id="sec-1-3">
        <title>Whether a dataset qualifies for a mega-analysis de</title>
        <p>pends on whether it matches the desired experimen- Figure 2: HED Grouping Graph ℋ 1
tal setting. In terms of events, the experimental
setting of a dataset is captured in the HED annotations.</p>
        <p>In order to query the data for our mega-analysis we
also define our conditions in HED annotations, thus
establishing a common data format between the
conditions derived from the researcher’s reasoning
and HED annotated event data.
dependent on the same information that we use for
querying. Finding the conditions in a dataset is
thus not only relevant during the searching stage
of a mega-analysis, but also for the analysis part,
which we aim to address in future work.</p>
      </sec>
      <sec id="sec-1-4">
        <title>The following sections formally define how to</title>
        <p>Example 2.1. The research question defined in our computationally derive the link between relevant
running example (Example 1.1) determines one or conditions for a mega-analysis, specified by the
remore contrasts that would qualify to assess this searcher’s reasoning, and events in a dataset (blue
question, e.g. male faces presented with an instruc- relationship in Figure 1). Subsequently, we
demontion to identify sex versus female faces presented strate an implementation of data and queries in a
with an instruction to identify sex. In neuroimaging graph database.
research, such a contrast is commonly defined as a
function of two or more experimental setting
conditions, in this case male face identification and female 3. Experimental setting conditions
face identification . We can express these conditions
in HED annotations strings using ((Face, Human- Our conceptual model indicates that datasets
qualiagent, Female), (Task, (Discriminate, Sex))) and fying for a mega-analysis can be found by matching
((Face, Human-agent, Male), (Task, (Discriminate, the HED annotations of experimental setting
conSex))). These condition qualities can be represented ditions and events (blue relationship in Figure 1).
within the space of a HED grouping graph dimension HED annotations are stored in the data as long
(see Section 3 for a formal definition). Experimental string values that are dificult to query. In fact,
setting conditions, in turn, comprise the specific they can form arbitrarily nested groups of terms,
events that need to be stored in the event files of a i.e., a graph. A graph of a single HED annotation
dataset so that it qualifies for use in the researcher’s is called a HED grouping graph and the set of all
mega-analysis. By projecting event qualities into terms from the HED taxonomy is depicted by HED.
the same value space of the HED grouping graph Definition 3.1 (HED grouping graph). A HED
groupdimension, we guarantee a mutual data type be- ing graph ℋ with nodes  (ℋ ) and edges  (ℋ ) is
tween the events that are i.) present in a dataset a directed, connected, acyclic graph with exactly
and ii.) required by the desired conditions for the one node without incoming edges,  (ℋ ), called the
mega-analysis, thus enabling efective querying. root. Nodes without outgoing edges are called leaves.</p>
        <sec id="sec-1-4-1">
          <title>Each leaf node  has a label  ( ) ∈ HED.</title>
          <p>Although it is beyond the scope of the current
paper, we incorporated the remaining parts of mega- Example 3.1. Figure 2 shows a HED grouping graph
analysis as greyed-out entities in the model for com- ℋ 1 with the following leaf node labels:
pleteness. For example, qualities and datatypes  ( 1) = Face  ( 2) = Rotated
associated with the participants of datasets can
determine additional aspects of the desired experi-  ( 3) = Male  ( 4) = Downward
mental setting, e.g. with respect to a specific age  ( 5) = Task  ( 6) = Discriminate
range. Since performing a full neuroimaging mega-  ( 7) = Detect  ( 8) = Sex
analysis involves a complex, multi-step analysis,
our conceptual model also includes a representation  ( 9) = Press  ( 10) = Push-button
of the acquired signal with its qualities and value Using the HED grouping graphs, we define the
spaces as these are pertinent to ultimately answer data concepts of our model (red entities in the
topthe research question. Note that the analysis is right data section of Figure 1).
• edges between the dataset node and all event annotations for the conditions that are relevant to
 ∈  ∧ ℋ ∈  ( )}.
 } and edges {(  ,   ) |  ∈  } ∪ {(  ,  (ℋ )) | from Example 3.2 and  ( ′) is the dataset graph
Definition 3.2 (Event, event file, dataset) . An event
 is a triple of the form ( ( ),  ( ), ℋ ( )), where
 ( ) ∈ R is the onset (the timepoint when the event
 started),  ( ) ∈ R</p>
          <p>+ is the duration of  and ℋ ( )
is a HED grouping graph. An event file  is a set
of events and a dataset  is a set of event files.
which is composed of:</p>
          <p>To facilitate returning datasets as the results of
the queries, we introduce a dataset graph  ( )
• a dataset node   ,
• one event file node   for every event file
• all HED grouping graphs in the event files of
 ∈  ,
 ,
ifle nodes,
graphs.
• edges between the event file nodes and the</p>
          <p>root nodes of all respective HED grouping
 ∈
︀⋃
︀⋃
Definition 3.3</p>
          <p>(Dataset graph). Let  ( ) =
 ∈ ℋ ( ) be the union of all HED grouping graphs
from an event file</p>
          <p>in a dataset  . The dataset
graph  ( ) is the union of all HED grouping graphs
  ( ) with additional nodes  
∪ {  |</p>
          <p>∈</p>
        </sec>
      </sec>
      <sec id="sec-1-5">
        <title>Example 3.2. Consider a dataset</title>
        <p>with a single
event file</p>
        <p>= {(1, 1.5, ℋ 1)}, where ℋ 1 is the HED
{(  ,   ), (  ,  (ℋ 1))} ∪  (ℋ 1).
grouping graph in Figure 2.</p>
      </sec>
      <sec id="sec-1-6">
        <title>Then, the dataset</title>
        <p>graph  ( ) has nodes {  ,   } ∪  (ℋ 1) and edges</p>
        <p>To perform a mega-analysis, the researcher
deifnes a set of experimental setting conditions. For
a dataset to qualify for the mega-analysis, it must
contain at least one event for each of the specified
conditions. We define an experimental setting
condition as a HED grouping graph. Thus, the matching
between events and conditions can be resolved over</p>
      </sec>
      <sec id="sec-1-7">
        <title>HED grouping graphs.</title>
        <p>collection S of dataset graphs containing a subgraph
which matches exactly the HED grouping graph
of the specified condition. In this paper we are
we plan to make the condition query more flexible.
query  (S, ℋ ) is defined as follows:</p>
      </sec>
      <sec id="sec-1-8">
        <title>Definition 3.4 (Condition query). Given a set S of</title>
        <p>dataset graphs and a condition ℋ , the condition
 (S, ℋ )={ |  ( ) ∈ S∧ℋ is subgraph of  ( )}</p>
        <p>
          A condition query returns all datasets from a type data graph and the queries in Neo4j [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ] graph
interested in exact subgraph matches. In the future, graph in Neo4j has around 720k nodes, 1.7M
relanD0
nF 0
n6
n8
n6
        </p>
        <p>n8
n5</p>
        <p>Example 3.3. In Example 2.1 we identified HED
the research question of our running example. For
demonstration purposes we consider a simplified
version of one of these conditions, namely (Task,
(Discriminate, Sex)). In other words, the researcher
is interested in all datasets from a collection S that
contain this particular condition.</p>
        <p>The resulting
datasets compose the input to the mega-analysis of
interest. The HED grouping graph ℋ  of the above
condition is shown in Figure 4 and let S be the set
{ ( ),  ( ′)}, where  ( ) is the dataset graph
in Figure 3. The leaf node labels of  ( ),  ( ′)
and ℋ  are as in Example 3.1. Then the condition
query  (S, ℋ  ) = { } returns only the dataset  ,
since ℋ  is a subgraph of  ( ), but not of  ( ′).</p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>4. Implementation in Neo4j</title>
      <sec id="sec-2-1">
        <title>In this section we demonstrate a prototype imple</title>
        <p>
          mentation which enables cognitive neuroscientists
with efective querying for datasets relevant to the
desired mega-analysis. For this purpose, we
manually annotated 35 datasets from Openneuro[
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] and
acquired at the Centre for Cognitive Neuroscience,
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>University of Salzburg. We implemented a protodatabase management system.</title>
      </sec>
      <sec id="sec-2-3">
        <title>The datasets are loaded into Neo4j as dataset graphs (cf. Section 3) using our custom indexer [15]. The resulting data tionships and 254 unique HED grouping graphs.</title>
        <p>Cypher queries.</p>
      </sec>
      <sec id="sec-2-4">
        <title>The querying language of the</title>
      </sec>
      <sec id="sec-2-5">
        <title>Neo4j database system is Cypher [16]. In order</title>
        <p>to execute a condition query (cf. Definition 3.4) on
the graph in Neo4j, we need to translate it into</p>
      </sec>
      <sec id="sec-2-6">
        <title>Cypher. Given a condition HED grouping graph</title>
        <p>ℋ  , Algorithm 1 generates the respective Cypher
query. For the pattern matching that is necessary
to return the required datasets Algorithm 1 uses</p>
      </sec>
      <sec id="sec-2-7">
        <title>MATCH clause of Cypher.</title>
        <p>verify whether the resulting datasets are
appropriate without reading the related publications as well
as modify the condition query when necessary.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>5. Related work</title>
      <sec id="sec-3-1">
        <title>Input : Condition HED grouping graph ℋ  Output : Cypher query  (ℋ  )</title>
        <p>1 begin
2  (ℋ  ) ={MATCH (D:Dataset)}
3 foreach leaf   ∈  (ℋ  ) do
4  (ℋ  ) =  (ℋ  ) ∪ {(  :  (  ))}
5 end
6 foreach (,  ′) ∈  (ℋ  ) do
7  (ℋ  ) =  (ℋ  ) ∪ {( ) → ( ′)}
8 end
9  (ℋ  ) =  (ℋ  ) ∪ {(D)-[*]-&gt;( (ℋ  ))}
10  (ℋ  ) =  (ℋ  ) ∪ {RETURN D }
11 return  (ℋ  )
12 end</p>
      </sec>
      <sec id="sec-3-2">
        <title>Algorithm 1: Generate Cypher query  (ℋ ) for the condition ℋ  .</title>
        <sec id="sec-3-2-1">
          <title>Assessment and integration of the results across dif</title>
          <p>ferent studies in the field of cognitive neuroscience
have, until now, mainly relied on aggregated results
of previously performed analyses. Several systems
have been designed to store and query such results.</p>
        </sec>
        <sec id="sec-3-2-2">
          <title>Moreover, there have been eforts to improve data</title>
          <p>annotation along with the development of systems
for data storage. We list a selection of particularly
influential systems and summarize their features in
Table 1. These eforts, however, only ofer partial
solutions with respect to our use case of efective data
querying for mega-analysis. To enable a
successful mega-analysis, we identify the following three
aspects of system requirements.</p>
        </sec>
        <sec id="sec-3-2-3">
          <title>Data: The original data acquired in a study must</title>
          <p>
            be available. In contrast, aggregated data
derivaExample 4.1. Consider the condition HED grouping tives resulting from analysis, e.g., so-called peak
coordinates and statistical maps, are not suficient
tghraapthreℋ sideosf iEnxtahme pNleeo34.j3daantdabaasseet. oTfodeantaasbelte gtrhaepehxs- for mega-analysis [
            <xref ref-type="bibr" rid="ref2">2</xref>
            ]. Although data availability
ecution of the query in Neo4j we apply Algorithm 1 is not the focus of this paper, it is a prerequisite
and translate it to Cypher, the respective query for the mega-analysis use case. Our solutions can
be applied to querying original data from various
 (ℋ  ) looks as follows: repositories.
 (ℋ  ) = {MATCH (D:Dataset), ( 5 : Task), Experimental setting: A suitable annotation
schema uses a controlled taxonomy of terms and
( 6 : Discriminate), ( 8 : Sex), allows to describe all relevant aspects of an
experi( ) → ( 5), ( ) → ( 68), mental setting, especially at the level of events. An
( 68) → ( 6), ( 68) → ( 8), example of such a taxonomy is HED [
            <xref ref-type="bibr" rid="ref5 ref6">5, 6</xref>
            ]. Arbitrary
(D)-[*]-&gt;( ) labels not only dramatically reduce the number of
qualifying datasets that can be found by a query
          </p>
        </sec>
      </sec>
      <sec id="sec-3-3">
        <title>RETURN D} but may also cause false positives. The descrip</title>
        <p>tions must be available on an event level, not just
Note that the node identifier ,  5,  6,  8 and  68 to ensure precision of the query, but also to
exeemerge from line 7 of Algorithm 1 and are arbitrary cute the analysis once datasets have been identified.
Cypher variable names. Executing this query on Datasets that lack this level of annotation cannot
our data graph in Neo4j returns three datasets. The be processed for the purpose of a mega-analysis.
researcher can then perform mega-analysis proce- Queries: Ideally, a researcher can define custom
dures with these three datasets and interpret the experimental setting conditions in a systematic way
results of the analysis to answer the research ques- and find all qualifying datasets. Querying arbitrary,
tion. This demonstrates that our approach allows non-standardized string labels requires guessing the
the researcher to find all datasets that are rele- right label and potentially results in missing
relevant to the research question. We achieve this vant datasets. Moreover, querying aspects other
based on HED annotations at the level of individual than experimental setting conditions requires
furevents, in contrast to other approaches (cf. Sec- ther investigation of the resulting datasets.
tion 5), where researchers must limit themselves to In Table 1 we show that none of the existing
using keywords or predefined labels to find relevant systems satisfies all requirements that we defined.
datasets for mega-analysis. Another advantage is BrainMap, NeuroSynth, and NeuroVault focus on
that researchers know the context of the query re- storing data derivatives. Brainmap and NeuroSynth
sult, i.e. why a dataset is returned, and thus can</p>
        <p>
          System
OpenNeuro [
          <xref ref-type="bibr" rid="ref7 ref8">7, 8</xref>
          ]
BrainMap [
          <xref ref-type="bibr" rid="ref17">17, 18, 19</xref>
          ]
NeuroVault [20, 21]
NeuroSynth [22, 23]
NeuroScout [24, 25]
PubMed [26]
        </p>
        <p>Data
original
derivatives only
derivatives only
derivatives only
original
publications</p>
        <p>Experimental setting
HED (few datasets only)
BrainMap taxonomy
arbitrary labels
keywords from publication texts
ML classifier labels
publication text</p>
        <p>Queries
store so-called peak coordinates, which are a sig- experimental setting is a form of a continuous
narnificant reduction from original data. NeuroVault rative, e.g. a movie or an audio recording.
Experistores statistical maps of the brain, which carry mental settings are automatically annotated using
more information than peak coordinates, yet they various machine learning feature extraction
techstill only represent derivations of the original data. niques which also predefine the available querying</p>
        <p>
          Data stored in Brainmap has been manually ex- terms. NeuroScout is a valuable resource, but the
tracted and annotated from the literature. It con- data is a limited sample of what is collected in the
sists of over 4000 scientific publications and 21000 ifeld of cognitive neuroscience.
contrast analyses. It uses a custom annotation Although PubMed is a repository of scientific
pubschema [
          <xref ref-type="bibr" rid="ref17">17, 19, 18</xref>
          ]that only allows to describe ex- lications, we decided to list it, as it is a frequently
perimental settings at the level of conditions, which used tool for finding relevant publications for
analyis suficient for peak coordinates data. The schema sis across studies [26]. Keywords are queried in the
prevents querying arbitrary conditions which is nec- publication texts and data can be obtained only by
essary for specifying a desired mega-analysis. Ad- using information available in the publications.
ditionally, the descriptions mix the standardized To minimize the efort and maximize the amount
terms with free text annotations and querying is of annotations, several of the systems listed in
Talimited to choosing from a list of existing labels. ble 1 automatically label the data. We briefly
de
        </p>
        <p>NeuroSynth data has been extracted and anno- scribe them and explain why they are insuficient
tated from the literature using automated text anal- for the use case of mega-analysis. NeuroSynth
autoysis [22, 23]. It accumulates results in form of peak matically extracts terms from scientific publication
coordinates from over 13000 publications. Users texts which are subsequently manually filtered for
can query the data with single terms or their sets relevance in the field of neuroscience. Unfortunately,
organized into topics. the publications primarily describe analyses, their</p>
        <p>The data stored in NeuroVault is annotated man- results and how they contribute to the field.
Inforually with arbitrary labels. There is no schema and mation about the data, in particular the events that
the annotations often contain abbreviations and occurred during data acquisition, is often not
prostudy specific terms. Additionally, the statistical vided, especially if it is not directly relevant for the
maps are stored as part of a collection, which has a analysis. Consequently, the adequacy of datasets
general description. Both the description and label returned by NeuroSynth is evaluated based on the
can be queried using keyword search. original purpose of data collection, thus limiting the</p>
        <p>
          OpenNeuro [
          <xref ref-type="bibr" rid="ref7 ref8">7, 8</xref>
          ] and NeuroScout [24, 25] fo- capacity of potential data-reuse. Note that none
cus on original data. OpenNeuro is a data repos- of the datasets that were returned by the query
itory that stores a wide variety of neuroimaging in Example 4.1 were originally collected to study
data. NeuroScout is a portal to a small number processing of face sex, which is the focus of our
of curated datasets from OpenNeuro that share an example mega-analysis. Accordingly, this
corrobexperimental setting [24, 25]. OpenNeuro stores orates that our solution is capable of identifying
original data in BIDS format which allows for HED datasets based on the events they comprise, hence
annotations [
          <xref ref-type="bibr" rid="ref7 ref8">7, 8</xref>
          ]. Unfortunately, the datasets are efectively extrapolating the usability beyond the
not curated and the majority does not include HED original intention.
annotations. Moreover, the querying features of NeuroScout uses machine learning classifiers to
OpenNeuro are limited to keywords extracted from automatically annotate experimental settings in a
dataset descriptions. complete recording of an experiment. However, this
In all the datasets stored by NeuroScout, the is currently only applicable to a limited sample of
datasets where such recordings are available. More
commonly, the software responsible for executing
experiments provides only textual log files. A
majority of the log files contain only abbreviations
or numeric codes that cannot be understood
without input from the original researchers. The BIDS
specification and HED taxonomy allow for more
comprehensive and structured annotation than can
be achieved with automated approaches, and we
hope to incentivize more widespread use of these
tools.
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>6. Conclusion and future work</title>
      <p>In this paper, we proposed a conceptual model for
neuroimaging mega-analysis. We formally defined
the parts of the model that are essential for finding
qualifying datasets and implemented the resulting
queries in Neo4j graph database. In a next step,
we will demonstrate our solutions on a larger scale
including more datasets and the remaining aspects
of experimental settings. We plan to integrate the
entire HED taxonomy into our knowledge graph and
thus enrich the experimental setting annotations
with otherwise implicit knowledge. An interesting
extension of our work is to make the condition query
more flexible by relaxing the subgraph constraint.</p>
      <sec id="sec-4-1">
        <title>Our long-term objective is to not only query the</title>
        <p>relevant datasets for a mega-analysis, but also to
enable the execution of mega-analysis. To that
extent, we will include the neuroimaging data, analysis
workflows and their results into our framework, as
highlighted in Section 2.</p>
      </sec>
      <sec id="sec-4-2">
        <title>Acknowledgements. This work was supported by:</title>
        <p>the Austrian Federal Ministry of Education,
Science and Research (BMBWF) under grant number
2920 (Austrian NeuroCloud); the Federal State of</p>
      </sec>
      <sec id="sec-4-3">
        <title>Salzburg under grant number 20102-F2101143-FPR</title>
        <p>(Digital Neuroscience Initiative); the Austrian
Science Fund (FWF) under grant number W1233-B
(Doctoral College “Imaging the Mind”). We thank</p>
      </sec>
      <sec id="sec-4-4">
        <title>Magdalena Ortiz and Fabio Richlan for their feedback and Ben Engler for annotating the datasets.</title>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>Y.-D.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Dong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.-H.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Yu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Yao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <surname>C.</surname>
          </string-name>
          <article-title>JiménezMesa</article-title>
          , J.
          <string-name>
            <surname>Ramirez</surname>
            ,
            <given-names>F. J.</given-names>
          </string-name>
          <string-name>
            <surname>Martinez</surname>
            ,
            <given-names>J. M.</given-names>
          </string-name>
          <string-name>
            <surname>Gorriz</surname>
          </string-name>
          ,
          <article-title>Advances in multimodal data fusion in neuroimaging: Overview, challenges, and novel orientation</article-title>
          ,
          <source>Information Fusion</source>
          <volume>64</volume>
          (
          <year>2020</year>
          )
          <fpage>149</fpage>
          -
          <lpage>187</lpage>
          . doi:
          <volume>10</volume>
          .1016/j.inffus.
          <year>2020</year>
          .
          <volume>07</volume>
          .006.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>S. G.</given-names>
            <surname>Costafreda</surname>
          </string-name>
          ,
          <article-title>Pooling FMRI data: Metaanalysis, mega-analysis and multi-center studies, Frontiers in Neuroinformatics 3 (</article-title>
          <year>2009</year>
          )
          <article-title>33</article-title>
          . doi:
          <volume>10</volume>
          .3389/neuro.11.033.
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>P. S. W.</given-names>
            <surname>Boedhoe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. W.</given-names>
            <surname>Heymans</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Schmaal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Abe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Alonso</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. H.</given-names>
            <surname>Ameis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Anticevic</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. D.</given-names>
            <surname>Arnold</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. C.</given-names>
            <surname>Batistuzzo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Benedetti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. C.</given-names>
            <surname>Beucke</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Bollettini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bose</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Brem</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Calvo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Calvo</surname>
          </string-name>
          , Y. Cheng,
          <string-name>
            <given-names>K. I. K.</given-names>
            <surname>Cho</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Ciullo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Dallaspezia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Denys</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. D.</given-names>
            <surname>Feusner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. D.</given-names>
            <surname>Fitzgerald</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-P.</given-names>
            <surname>Fouche</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. A.</given-names>
            <surname>Fridgeirsson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Gruner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. L.</given-names>
            <surname>Hanna</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. P.</given-names>
            <surname>Hibar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. Q.</given-names>
            <surname>Hoexter</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Huyser</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Jahanshad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>James</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Kathmann</surname>
          </string-name>
          , C. Kaufmann,
          <string-name>
            <given-names>K.</given-names>
            <surname>Koch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. S.</given-names>
            <surname>Kwon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Lazaro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Lochner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Marsh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Martínez-Zalacaín</surname>
          </string-name>
          , D. MataixCols,
          <string-name>
            <surname>J. M. Menchón</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Minuzzi</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Morer</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Nakamae</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Nakao</surname>
            ,
            <given-names>J. C.</given-names>
          </string-name>
          <string-name>
            <surname>Narayanaswamy</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Nishida</surname>
            ,
            <given-names>E. L.</given-names>
          </string-name>
          <string-name>
            <surname>Nurmi</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. O'Neill</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Piacentini</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Piras</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Piras</surname>
            ,
            <given-names>Y. C. J.</given-names>
          </string-name>
          <string-name>
            <surname>Reddy</surname>
            ,
            <given-names>T. J.</given-names>
          </string-name>
          <string-name>
            <surname>Reess</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Sakai</surname>
            ,
            <given-names>J. R.</given-names>
          </string-name>
          <string-name>
            <surname>Sato</surname>
            ,
            <given-names>H. B.</given-names>
          </string-name>
          <string-name>
            <surname>Simpson</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Soreni</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Soriano-Mas</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <string-name>
            <surname>Spalletta</surname>
            ,
            <given-names>M. C.</given-names>
          </string-name>
          <string-name>
            <surname>Stevens</surname>
            ,
            <given-names>P. R.</given-names>
          </string-name>
          <string-name>
            <surname>Szeszko</surname>
            ,
            <given-names>D. F.</given-names>
          </string-name>
          <string-name>
            <surname>Tolin</surname>
            ,
            <given-names>G. A. van Wingen</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Venkatasubramanian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Walitza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wang</surname>
          </string-name>
          , J.-Y. Yun,
          <string-name>
            <surname>ENIGMA-OCD</surname>
            <given-names>WorkingGroup</given-names>
          </string-name>
          ,
          <string-name>
            <surname>P. M. Thompson</surname>
            ,
            <given-names>D. J.</given-names>
          </string-name>
          <string-name>
            <surname>Stein</surname>
            ,
            <given-names>O. A. van den Heuvel</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>J. W. R.</given-names>
            <surname>Twisk</surname>
          </string-name>
          ,
          <article-title>An Empirical Comparison of Meta-</article-title>
          and
          <string-name>
            <surname>Mega-Analysis With Data From the ENIGMA ObsessiveCompulsive Disorder Working Group</surname>
          </string-name>
          , Frontiers in Neuroinformatics 12 (
          <year>2018</year>
          )
          <article-title>102</article-title>
          . doi:
          <volume>10</volume>
          . 3389/fninf.
          <year>2018</year>
          .
          <volume>00102</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>K. J.</given-names>
            <surname>Gorgolewski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Auer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V. D.</given-names>
            <surname>Calhoun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. C.</given-names>
            <surname>Craddock</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Das</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. P.</given-names>
            <surname>Duf</surname>
          </string-name>
          , G. Flandin,
          <string-name>
            <given-names>S. S.</given-names>
            <surname>Ghosh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Glatard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y. O.</given-names>
            <surname>Halchenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. A.</given-names>
            <surname>Handwerker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hanke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Keator</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Michael</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Maumet</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. N.</given-names>
            <surname>Nichols</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. E.</given-names>
            <surname>Nichols</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Pellman</surname>
          </string-name>
          ,
          <string-name>
            <surname>J.-B. Poline</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Rokem</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <string-name>
            <surname>Schaefer</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Sochat</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          <string-name>
            <surname>Triplett</surname>
            ,
            <given-names>J. A.</given-names>
          </string-name>
          <string-name>
            <surname>Turner</surname>
            , G. Varoquaux,
            <given-names>R. A.</given-names>
          </string-name>
          <string-name>
            <surname>Poldrack</surname>
          </string-name>
          ,
          <article-title>The brain imaging data structure, a format for organizing and describing outputs of neuroimaging experiments</article-title>
          ,
          <source>Scientific Data</source>
          <volume>3</volume>
          (
          <year>2016</year>
          )
          <fpage>160044</fpage>
          -
          <lpage>160044</lpage>
          . doi:
          <volume>10</volume>
          .1038/sdata.
          <year>2016</year>
          .
          <volume>44</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>K.</given-names>
            <surname>Robbins</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Truong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Appelhof</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Delorme</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Makeig</surname>
          </string-name>
          ,
          <article-title>Capturing the nature of events and event context using hierarchical event descriptors (HED)</article-title>
          ,
          <source>NeuroImage</source>
          <volume>245</volume>
          (
          <year>2021</year>
          )
          <article-title>118766</article-title>
          . doi:
          <volume>10</volume>
          .1016/j. neuroimage.
          <year>2021</year>
          .
          <volume>118766</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>K.</given-names>
            <surname>Robbins</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Truong</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Jones</surname>
          </string-name>
          , I. Callanan,
          <string-name>
            <given-names>S.</given-names>
            <surname>Makeig</surname>
          </string-name>
          , Building FAIR functionality:
          <article-title>Annotating events in time series data using hierarchical event descriptors (HED)</article-title>
          ,
          <source>Neuroinformatics</source>
          <volume>20</volume>
          (
          <year>2022</year>
          )
          <fpage>463</fpage>
          -
          <lpage>481</lpage>
          . doi:
          <volume>10</volume>
          .1007/ [18]
          <string-name>
            <given-names>P. T.</given-names>
            <surname>Fox</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. L.</given-names>
            <surname>Lancaster</surname>
          </string-name>
          ,
          <source>Mapping context s12021-021-09537-4</source>
          .
          <article-title>and content: The BrainMap model</article-title>
          , Nature
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Openneuro</surname>
          </string-name>
          ,
          <year>2023</year>
          . URL: https://openneuro.
          <source>Reviews Neuroscience</source>
          <volume>3</volume>
          (
          <year>2002</year>
          )
          <fpage>319</fpage>
          -
          <lpage>321</lpage>
          . doi:10. org/. 1038/nrn789.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>C. J.</given-names>
            <surname>Markiewicz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. J.</given-names>
            <surname>Gorgolewski</surname>
          </string-name>
          , F. Fein- [19]
          <string-name>
            <given-names>P. T.</given-names>
            <surname>Fox</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. R.</given-names>
            <surname>Laird</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. P.</given-names>
            <surname>Fox</surname>
          </string-name>
          , P. M. gold, R. Blair,
          <string-name>
            <given-names>Y. O.</given-names>
            <surname>Halchenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Miller</surname>
          </string-name>
          ,
          <string-name>
            <surname>Fox</surname>
            ,
            <given-names>A. M.</given-names>
          </string-name>
          <string-name>
            <surname>Uecker</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Crank</surname>
            ,
            <given-names>S. F.</given-names>
          </string-name>
          <string-name>
            <surname>Koenig</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          <string-name>
            <surname>Hardcastle</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Wexler</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          <string-name>
            <surname>Esteban</surname>
            ,
            <given-names>J. L.</given-names>
          </string-name>
          <string-name>
            <surname>Lancaster</surname>
            , Brainmap taxonomy of exM. Goncavles,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Jwa</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Poldrack</surname>
          </string-name>
          ,
          <article-title>The Open- perimental design: description and evaluaNeuro resource for sharing of neuroscience tion</article-title>
          ,
          <source>Human Brain Mapping</source>
          <volume>25</volume>
          (
          <year>2005</year>
          )
          <fpage>185</fpage>
          -
          <lpage>98</lpage>
          . data, eLife
          <volume>10</volume>
          (
          <year>2021</year>
          )
          <article-title>e71774</article-title>
          . doi:
          <volume>10</volume>
          .7554/ doi:10.1002/hbm.20141. eLife.
          <volume>71774</volume>
          . [20]
          <string-name>
            <surname>Neurovault</surname>
          </string-name>
          ,
          <year>2023</year>
          . URL: https://neurovault.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>V. I.</given-names>
            <surname>Müller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. C.</given-names>
            <surname>Cieslik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. R.</given-names>
            <surname>Laird</surname>
          </string-name>
          , P. T. org/. Fox,
          <string-name>
            <given-names>J.</given-names>
            <surname>Radua</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Mataix-Cols</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. R.</given-names>
            <surname>Tench</surname>
          </string-name>
          , [21]
          <string-name>
            <surname>K. J. Gorgolewski</surname>
            , G. Varoquaux, G. Rivera,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Yarkoni</surname>
            ,
            <given-names>T. E.</given-names>
          </string-name>
          <string-name>
            <surname>Nichols</surname>
            ,
            <given-names>P. E.</given-names>
          </string-name>
          <string-name>
            <surname>Turkeltaub</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Schwarz</surname>
            ,
            <given-names>S. S.</given-names>
          </string-name>
          <string-name>
            <surname>Ghosh</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <string-name>
            <surname>Maumet</surname>
          </string-name>
          , V. V.
          <string-name>
            <surname>T. D. Wager</surname>
            ,
            <given-names>S. B.</given-names>
          </string-name>
          <string-name>
            <surname>Eickhof</surname>
            , Ten simple rules Sochat,
            <given-names>T. E.</given-names>
          </string-name>
          <string-name>
            <surname>Nichols</surname>
            ,
            <given-names>R. A.</given-names>
          </string-name>
          <string-name>
            <surname>Poldrack</surname>
          </string-name>
          , J.-B.
          <article-title>for neuroimaging meta-analysis,</article-title>
          <string-name>
            <surname>Neuroscience Poline</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Yarkoni</surname>
            ,
            <given-names>D. S.</given-names>
          </string-name>
          <string-name>
            <surname>Margulies</surname>
          </string-name>
          ,
          <source>Neuand Biobehavioral Reviews</source>
          <volume>84</volume>
          (
          <year>2018</year>
          )
          <fpage>151</fpage>
          -
          <lpage>161</lpage>
          . roVault.
          <article-title>org: A web-based repository for coldoi</article-title>
          :
          <volume>10</volume>
          .1016/j.neubiorev.
          <year>2017</year>
          .
          <volume>11</volume>
          .012. lecting and sharing unthresholded statistical
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>F.</given-names>
            <surname>Hutzler</surname>
          </string-name>
          ,
          <article-title>Reverse inference is not a fallacy maps of the human brain, Frontiers in Neuper se: Cognitive processes can be inferred roinformatics 9 (2015). from functional imaging data</article-title>
          ,
          <source>NeuroImage</source>
          <volume>84</volume>
          [22]
          <string-name>
            <surname>Neurosynth</surname>
          </string-name>
          ,
          <year>2023</year>
          . URL: https://neurosynth. (
          <year>2014</year>
          )
          <fpage>1061</fpage>
          -
          <lpage>1069</lpage>
          . doi:
          <volume>10</volume>
          .1016/j.neuroimage. org/.
          <year>2012</year>
          .
          <volume>12</volume>
          .075. [23]
          <string-name>
            <given-names>T.</given-names>
            <surname>Yarkoni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. A.</given-names>
            <surname>Poldrack</surname>
          </string-name>
          , T. E. Nichols,
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>M.</given-names>
            <surname>Tahmasian</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. A.</given-names>
            <surname>Sepehry</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Samea</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. C.</given-names>
            <surname>Van Essen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. D.</given-names>
            <surname>Wager</surname>
          </string-name>
          , Large-scale
          <string-name>
            <given-names>T.</given-names>
            <surname>Khodadadifar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Soltaninejad</surname>
          </string-name>
          ,
          <string-name>
            <surname>N.</surname>
          </string-name>
          <article-title>Java- automated synthesis of human functional neuheripour, H</article-title>
          . Khazaie,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zarei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. B.</given-names>
            <surname>Eickhof</surname>
          </string-name>
          , roimaging data,
          <source>Nature Methods 8</source>
          (
          <year>2011</year>
          )
          <fpage>665</fpage>
          -
          <string-name>
            <surname>C. R. Eickhof</surname>
          </string-name>
          , Practical recommendations to 670. doi:
          <volume>10</volume>
          .1038/nmeth.1635.
          <article-title>conduct a neuroimaging meta-analysis for neu-</article-title>
          [24]
          <string-name>
            <surname>Neuroscout</surname>
          </string-name>
          ,
          <year>2023</year>
          . URL: https://neuroscout. ropsychiatric disorders,
          <source>Human Brain Mapping org/</source>
          .
          <volume>40</volume>
          (
          <year>2019</year>
          )
          <fpage>5142</fpage>
          -
          <lpage>5154</lpage>
          . doi:
          <volume>10</volume>
          .1002/hbm.24746. [25]
          <string-name>
            <surname>A. de la Vega</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Rocca</surname>
            ,
            <given-names>R. W.</given-names>
          </string-name>
          <string-name>
            <surname>Blair</surname>
          </string-name>
          , C. J.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>G.</given-names>
            <surname>Guizzardi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. B.</given-names>
            <surname>Benevides</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. M.</given-names>
            <surname>Fonseca</surname>
          </string-name>
          , Markiewicz,
          <string-name>
            <given-names>J.</given-names>
            <surname>Mentch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. D.</given-names>
            <surname>Kent</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>HerD. Porello</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. P. A.</given-names>
            <surname>Almeida</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. P.</given-names>
            <surname>Sales</surname>
          </string-name>
          , UFO: holz,
          <string-name>
            <given-names>S. S.</given-names>
            <surname>Ghosh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. A.</given-names>
            <surname>Poldrack</surname>
          </string-name>
          , T. Yarkoni, unified foundational ontology, Appl. Ontology Neuroscout,
          <article-title>a unified platform for generaliz17 (</article-title>
          <year>2022</year>
          )
          <fpage>167</fpage>
          -
          <lpage>210</lpage>
          . doi:
          <volume>10</volume>
          .3233/AO-210256. able and reproducible fMRI research,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>G.</given-names>
            <surname>Guizzardi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. M.</given-names>
            <surname>Fonseca</surname>
          </string-name>
          , A. B. Benev- doi:10.1101/
          <year>2022</year>
          .04.05.487222. ides,
          <string-name>
            <given-names>J. P. A.</given-names>
            <surname>Almeida</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Porello</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. P.</given-names>
            <surname>Sales</surname>
          </string-name>
          , [
          <volume>26</volume>
          ]
          <string-name>
            <surname>Pubmed</surname>
          </string-name>
          ,
          <year>2023</year>
          . URL: https://pubmed.ncbi.
          <article-title>Endurant types in ontology-driven conceptual nlm</article-title>
          .nih.gov/.
          <source>modeling: Towards ontouml 2</source>
          .0, in: Conceptual Modeling - 37th International Conference, ER 2018,
          <article-title>Xi'an, China</article-title>
          ,
          <source>October 22-25</source>
          ,
          <year>2018</year>
          , Proceedings, volume
          <volume>11157</volume>
          of Lecture Notes in Computer Science, Springer,
          <year>2018</year>
          , pp.
          <fpage>136</fpage>
          -
          <lpage>150</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>030</fpage>
          -00847-5\_
          <fpage>12</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <issue>Neo4j</issue>
          ,
          <year>2023</year>
          . URL: https://neo4j.com/.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>BIDS</given-names>
            <surname>Indexer</surname>
          </string-name>
          ,
          <year>2023</year>
          . URL: https: //gitlab.com/ccns/neurocog/neurodataops/ dni/bids-indexer.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>N.</given-names>
            <surname>Francis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Green</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Guagliardo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Libkin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Lindaaker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Marsault</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Plantikow</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Rydberg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Selmer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Taylor</surname>
          </string-name>
          , Cypher:
          <article-title>An evolving query language for property graphs</article-title>
          ,
          <source>in: Proceedings of the 2018 International Conference on Management of Data</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>1433</fpage>
          -
          <lpage>1445</lpage>
          . doi:
          <volume>10</volume>
          .1145/3183713.3190657.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>Brainmap</surname>
          </string-name>
          ,
          <year>2023</year>
          . URL: http://brainmap.org/.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>