On the public citation graph
EmptyHeaded
0 signed · 183 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/spe.2203openalex-snapshot
Decoding billions of integers per second through vectorization
inferredcites →https://doi.org/10.1007/11427186_54openalex-snapshot
Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study
inferredcites →https://doi.org/10.1007/11604686_1openalex-snapshot
Hypertree Decompositions: Structure, Algorithms, and Applications
inferredcites →https://doi.org/10.1007/3-540-62222-5_36openalex-snapshot
Conjunctive query containment revisited
inferredcites →https://doi.org/10.1007/s00778-009-0165-yopenalex-snapshot
The RDF-3X engine for scalable management of RDF data
inferredcites →https://doi.org/10.1007/s00778-015-0405-2openalex-snapshot
NScale: neighborhood-centric large-scale graph analytics in the cloud
inferredcites →https://doi.org/10.1016/j.websem.2005.06.005openalex-snapshot
LUBM: A benchmark for OWL knowledge base systems
inferredcites →https://doi.org/10.1109/dcc.2015.8openalex-snapshot
Smaller and Faster: Parallel Processing of Compressed Graphs with Ligra+
inferredcites →https://doi.org/10.1109/icde.2011.5767867openalex-snapshot
HyPer: A hybrid OLTP&OLAP main memory database system based on virtual memory snapshots
inferredcites →https://doi.org/10.1109/icde.2013.6544812openalex-snapshot
The adaptive radix tree: ARTful indexing for main-memory databases
inferredcites →https://doi.org/10.1109/icde.2013.6544832openalex-snapshot
SociaLite: Datalog extensions for efficient social network analysis
inferredcites →https://doi.org/10.1109/icdew.2016.7495625openalex-snapshot
Old techniques for new join algorithms: A case study in RDF processing
inferredcites →https://doi.org/10.1109/sc.2012.50openalex-snapshot
Direction-optimizing Breadth-First Search
inferredcites →https://doi.org/10.1109/tkde.2014.2345408openalex-snapshot
An Iterative MapReduce Based Frequent Subgraph Mining Algorithm
inferredcites →https://doi.org/10.1126/science.298.5594.824openalex-snapshot
Network Motifs: Simple Building Blocks of Complex Networks
inferredcites →https://doi.org/10.1137/0214017openalex-snapshot
Arboricity and Subgraph Listing Algorithms
inferredcites →https://doi.org/10.1137/110859440openalex-snapshot
Size Bounds and Query Plans for Relational Joins
inferredcites →https://doi.org/10.1137/s003614450342480openalex-snapshot
The Structure and Function of Complex Networks
inferredcites →https://doi.org/10.1145/1298306.1298311openalex-snapshot
Measurement and analysis of online social networks
inferredcites →https://doi.org/10.1145/1367497.1367591openalex-snapshot
Statistical properties of community structure in large social and information networks
inferredcites →https://doi.org/10.1145/1557019.1557049openalex-snapshot
On compressing social networks
inferredcites →https://doi.org/10.1145/1772690.1772751openalex-snapshot
What is Twitter, a social network or a news media?
inferredcites →https://doi.org/10.1145/2213556.2213565openalex-snapshot
Worst-Case Optimal Join Algorithms
inferredcites →https://doi.org/10.1145/2517349.2522739openalex-snapshot
A lightweight infrastructure for graph analytics
inferredcites →https://doi.org/10.1145/2656335openalex-snapshot
Size Bounds for Factorised Representations of Query Results
inferredcites →https://doi.org/10.1145/2723372.2742796openalex-snapshot
Design and Implementation of the LogicBlox System
inferredcites →https://doi.org/10.1145/356924.356928openalex-snapshot
Query Optimization in Database Systems
inferredcites →https://doi.org/10.1145/564691.564709openalex-snapshot
Implementing database operations using SIMD instructions
inferredcites →https://doi.org/10.14778/2002938.2002940openalex-snapshot
Efficiently compiling efficient query plans for modern hardware
inferredcites →https://doi.org/10.14778/2140436.2140442openalex-snapshot
Densest subgraph in streaming and MapReduce
inferredcites →https://doi.org/10.14778/2735508.2735518openalex-snapshot
Faster set intersection with SIMD instructions by reducing branch mispredictions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-30793-6_15openalex-snapshot
A Worst-Case Optimal Join Algorithm for SPARQL
inferred← citeshttps://doi.org/10.1007/978-3-030-60067-9_8openalex-snapshot
Knowledge Graphs: Research Directions
inferred← citeshttps://doi.org/10.1007/978-3-030-88358-4_1openalex-snapshot
Mapping Multidimensional Schemas to Property Graph Models
inferred← citeshttps://doi.org/10.1007/978-981-99-7254-8_35openalex-snapshot
FastAGEDs: Fast Approximate Graph Entity Dependency Discovery
inferred← citeshttps://doi.org/10.1007/s00778-021-00708-yopenalex-snapshot
Accelerating multi-way joins on the GPU
inferred← citeshttps://doi.org/10.1007/s00778-022-00749-xopenalex-snapshot
Fast subgraph query processing and subgraph matching via static and dynamic equivalences
inferred← citeshttps://doi.org/10.1007/s00778-023-00781-5openalex-snapshot
Learned sketch for subgraph counting: a holistic approach
inferred← citeshttps://doi.org/10.1007/s00778-024-00881-wopenalex-snapshot
A powerful reducing framework for accelerating set intersections over graphs
inferred← citeshttps://doi.org/10.1007/s00778-025-00945-5openalex-snapshot
CompactLTJ: Space & Time Efficient Leapfrog Triejoin on Graph Databases
inferred← citeshttps://doi.org/10.1007/s00778-026-00963-xopenalex-snapshot
On topology and time: efficient evaluation for temporal-clique subgraph queries
inferred← citeshttps://doi.org/10.1007/s10044-019-00841-zopenalex-snapshot
PathQuery Pregel: high-performance graph query with bulk synchronous processing
inferred← citeshttps://doi.org/10.1007/s41019-025-00325-7openalex-snapshot
SieveJoin: Boosting Multi-way Joins by Filtering Unneeded Intermediate Results
inferred← citeshttps://doi.org/10.1016/j.is.2025.102647openalex-snapshot
New compressed indices for multijoins on graph databases
inferred← citeshttps://doi.org/10.1017/s1471068421000387openalex-snapshot
Defeasible Reasoning via Datalog¬
inferred← citeshttps://doi.org/10.1109/access.2025.3560405openalex-snapshot
Low-Power Subgraph Isomorphism at the Edge Using FPGAs
inferred← citeshttps://doi.org/10.1109/dac56929.2023.10247902openalex-snapshot
PSMiner: A Pattern-Aware Accelerator for High-Performance Streaming Graph Pattern Mining
inferred← citeshttps://doi.org/10.1109/hipc56025.2022.00026openalex-snapshot
High-Performance Truss Analytics in Arkouda
inferred← citeshttps://doi.org/10.1109/hpec.2018.8547569openalex-snapshot
Preliminary Exploration of Large-Scale Triangle Counting on Shared-Memory Multicore System
inferred← citeshttps://doi.org/10.1109/icde.2019.00029openalex-snapshot
Efficient Parallel Subgraph Enumeration on a Single Machine
inferred← citeshttps://doi.org/10.1109/icde51399.2021.00064openalex-snapshot
Leveraging Temporal and Topological Selectivities in Temporal-clique Subgraph Query Processing
inferred← citeshttps://doi.org/10.1109/icde51399.2021.00130openalex-snapshot
A+ Indexes: Tunable and Space-Efficient Adjacency Lists in Graph Database Management Systems
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00247openalex-snapshot
Exploration of Knowledge Graphs via Online Aggregation
inferred← citeshttps://doi.org/10.1109/icde53745.2022.00282openalex-snapshot
How Learning Can Help Complex Cyclic Join Decomposition
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00012openalex-snapshot
AFaVS: Accurate Yet Fast Version Switching for Graph Processing Systems
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00163openalex-snapshot
FASI: FPGA-friendly Subgraph Isomorphism on Massive Graphs
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00159openalex-snapshot
Authenticated Subgraph Matching in Hybrid-Storage Blockchains
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00206openalex-snapshot
LearnSC: An Efficient and Unified Learning-Based Framework for Subgraph Counting Problem
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00231openalex-snapshot
Large Subgraph Matching: A Comprehensive and Efficient Approach for Heterogeneous Graphs
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00256openalex-snapshot
Variable-Length Path Query Evaluation Based on Worst-Case Optimal Joins
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00257openalex-snapshot
NewSP: A New Search Process for Continuous Subgraph Matching over Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00082openalex-snapshot
TeMatch: A Fast Temporal Subgraph Matching Framework with Temporal-Aware Subgraph Matching Algorithms
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00192openalex-snapshot
MuSha: Subgraph Matching by Multilevel Sharing
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00204openalex-snapshot
ShareFlow: An Efficient Framework for Multi-Query Continuous Subgraph Matching
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00248openalex-snapshot
Efficient Graph Matching with Pattern Reduction
inferred← citeshttps://doi.org/10.1109/ipdps57955.2024.00097openalex-snapshot
GCSM: GPU-Accelerated Continuous Subgraph Matching for Large Graphs
inferred← citeshttps://doi.org/10.1109/ipdps64566.2025.00105openalex-snapshot
Matcha: A Language and Compiler for Backtracking-Based Subgraph Matching
inferred← citeshttps://doi.org/10.1109/isca52012.2021.00052openalex-snapshot
FlexMiner: A Pattern-Aware Accelerator for Graph Pattern Mining
inferred← citeshttps://doi.org/10.1109/pact52795.2021.00028openalex-snapshot
Dryadic: Flexible and Fast Graph Pattern Matching at Scale
inferred← citeshttps://doi.org/10.1109/pact58117.2023.00026openalex-snapshot
GraphMini: Accelerating Graph Pattern Matching Using Auxiliary Graphs
inferred← citeshttps://doi.org/10.1109/tcasai.2024.3476237openalex-snapshot
Efficient Orchestrated AI Workflows Execution on Scale-Out Spatial Architecture
inferred← citeshttps://doi.org/10.1109/tkde.2021.3093200openalex-snapshot
A Dual-Store Structure for Knowledge Graphs
inferred← citeshttps://doi.org/10.1109/tkde.2022.3223471openalex-snapshot
On the Substructure Countability of Graph Neural Networks
inferred← citeshttps://doi.org/10.1109/tkde.2025.3598850openalex-snapshot
Authenticated Subgraph Matching on Large-Scale Graphs in Hybrid-Storage Blockchains
inferred← citeshttps://doi.org/10.1109/tkde.2025.3624574openalex-snapshot
BLITZ: A Flexible and Efficient Graph Mining System
inferred← citeshttps://doi.org/10.1109/tkde.2026.3702627openalex-snapshot
Accelerating Top-K Subgraph Matching With Topology-Aware Pruning and Parallel Processing
inferred← citeshttps://doi.org/10.1111/exsy.70152openalex-snapshot
FastAGEDs+: Fast Approximate Graph Entity Dependency Discovery
inferred← citeshttps://doi.org/10.1145/2213556.2213565openalex-snapshot
Worst-Case Optimal Join Algorithms
inferred← citeshttps://doi.org/10.1145/3183713.3196924openalex-snapshot
Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions
inferred← citeshttps://doi.org/10.1145/3210377.3210414openalex-snapshot
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
inferred← citeshttps://doi.org/10.1145/3315507.3330200openalex-snapshot
Towards compiling graph queries in relational engines
inferred← citeshttps://doi.org/10.1145/3318464.3380581openalex-snapshot
In-Memory Subgraph Matching: An In-depth Study
inferred← citeshttps://doi.org/10.1145/3318464.3383132openalex-snapshot
Optimal Join Algorithms Meet Top-k
inferred← citeshttps://doi.org/10.1145/3337821.3337917openalex-snapshot
Accelerating All-Edge Common Neighbor Counting on Three Processors
inferred← citeshttps://doi.org/10.1145/3385412.3385963openalex-snapshot
Automatic generation of efficient sparse tensor format conversion routines
inferred← citeshttps://doi.org/10.1145/3434393openalex-snapshot
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
inferred← citeshttps://doi.org/10.1145/3446980openalex-snapshot
Optimizing One-time and Continuous Subgraph Queries using Worst-case Optimal Joins
inferred← citeshttps://doi.org/10.1145/3447548.3467219openalex-snapshot
Accelerating Set Intersections over Graphs by Reducing-Merging
inferred← citeshttps://doi.org/10.1145/3447879.3447883openalex-snapshot
Approximate computation for big data analytics
inferred← citeshttps://doi.org/10.1145/3448016.3457256openalex-snapshot
Worst-Case Optimal Graph Joins in Almost No Space
inferred← citeshttps://doi.org/10.1145/3448016.3457265openalex-snapshot
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching
inferred← citeshttps://doi.org/10.1145/3448016.3457289openalex-snapshot
A Learned Sketch for Subgraph Counting
inferred← citeshttps://doi.org/10.1145/3448016.3457290openalex-snapshot
PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration
inferred← citeshttps://doi.org/10.1145/3448016.3457314openalex-snapshot
Vertex-centric Parallel Computation of SQL Queries
inferred← citeshttps://doi.org/10.1145/3466752.3480133openalex-snapshot
SISA: Set-Centric Instruction Set Architecture for Graph Mining on Processing-in-Memory Systems
inferred← citeshttps://doi.org/10.1145/3472883.3486991openalex-snapshot
Fast and Accurate Optimizer for Query Processing over Knowledge Graphs
inferred← citeshttps://doi.org/10.1145/3514231openalex-snapshot
Optimal Joins Using Compressed Quadtrees
inferred← citeshttps://doi.org/10.1145/3517804.3524153openalex-snapshot
Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth
inferred← citeshttps://doi.org/10.1145/3555041.3589715openalex-snapshot
SparkSQL+: Next-generation Query Planning over Spark
inferred← citeshttps://doi.org/10.1145/3584372.3588676openalex-snapshot
Guaranteeing the Õ(AGM/OUT) Runtime for Uniform Sampling and Size Estimation over Joins
inferred← citeshttps://doi.org/10.1145/3589295openalex-snapshot
Free Join: Unifying Worst-Case Optimal and Traditional Joins
inferred← citeshttps://doi.org/10.1145/3589312openalex-snapshot
GuP: Fast Subgraph Matching by Guard-based Pruning
inferred← citeshttps://doi.org/10.1145/3591268openalex-snapshot
Indexed Streams: A Formal Intermediate Representation for Fused Contraction Programs
inferred← citeshttps://doi.org/10.1145/3604932openalex-snapshot
Demystifying Graph Databases: Analysis and Taxonomy of Data Organization, System Designs, and Graph Queries
inferred← citeshttps://doi.org/10.1145/3626735openalex-snapshot
Lightweight Materialization for Fast Dashboards Over Joins
inferred← citeshttps://doi.org/10.1145/3627535.3638507openalex-snapshot
Exploiting Fine-Grained Redundancy in Set-Centric Graph Pattern Mining
inferred← citeshttps://doi.org/10.1145/3627673.3679790openalex-snapshot
Efficient Pruned Top-K Subgraph Matching with Topology-Aware Bounds
inferred← citeshttps://doi.org/10.1145/3632928openalex-snapshot
Flan: An Expressive and Efficient Datalog Compiler for Program Analysis
inferred← citeshttps://doi.org/10.1145/3638758openalex-snapshot
Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth
inferred← citeshttps://doi.org/10.1145/3639284openalex-snapshot
HERO: A Hierarchical Set Partitioning and Join Framework for Speeding up the Set Intersection Over Graphs
inferred← citeshttps://doi.org/10.1145/3639288openalex-snapshot
gSWORD: GPU-accelerated Sampling for Subgraph Counting
inferred← citeshttps://doi.org/10.1145/3639315openalex-snapshot
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction
inferred← citeshttps://doi.org/10.1145/3644824openalex-snapshot
The Ring: Worst-case Optimal Joins in Graph Databases using (Almost) No Extra Space
inferred← citeshttps://doi.org/10.1145/3653314openalex-snapshot
Tackling Challenges in Implementing Large-Scale Graph Databases
inferred← citeshttps://doi.org/10.1145/3654950openalex-snapshot
In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework
inferred← citeshttps://doi.org/10.1145/3661304.3661898openalex-snapshot
Space & Time Efficient Leapfrog Triejoin
inferred← citeshttps://doi.org/10.1145/3665252.3665259openalex-snapshot
From Binary Join to Free Join
inferred← citeshttps://doi.org/10.1145/3696410.3714695openalex-snapshot
Worst-Case-Optimal Joins on Graphs with Topological Relations
inferred← citeshttps://doi.org/10.1145/3709665openalex-snapshot
BⓈ X : Subgraph Matching with Batch Backtracking Search
inferred← citeshttps://doi.org/10.1145/3709720openalex-snapshot
Revisiting the Design of In-Memory Dynamic Graph Storage
inferred← citeshttps://doi.org/10.1145/3711896.3737170openalex-snapshot
UnG-MoCha: Neural Motif Counting in Uncertain Graphs
inferred← citeshttps://doi.org/10.1145/3722212.3724425openalex-snapshot
A Modular Graph-Native Query Optimization Framework
inferred← citeshttps://doi.org/10.1145/3725398openalex-snapshot
cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns
inferred← citeshttps://doi.org/10.1145/3725423openalex-snapshot
Yannakakis+: Practical Acyclic Query Evaluation with Theoretical Guarantees
inferred← citeshttps://doi.org/10.1145/3749159openalex-snapshot
BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching
inferred← citeshttps://doi.org/10.1145/3767719openalex-snapshot
The Space-Time Complexity of Sum-Product Queries
inferred← citeshttps://doi.org/10.1145/3769797openalex-snapshot
GraphMatch: Subgraph Query Processing on Steroids
inferred← citeshttps://doi.org/10.1145/3771791openalex-snapshot
A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis]
inferred← citeshttps://doi.org/10.1145/3786623openalex-snapshot
An Extensive Experimental Study of Indexes in Continuous Subgraph Matching: [Experiments & Analysis]
inferred← citeshttps://doi.org/10.1145/3786646openalex-snapshot
Enabling Efficient Update on Rule-Based Compressed Graph
inferred← citeshttps://doi.org/10.1145/3797905.3807860openalex-snapshot
HoloGraph: Bridging the Throughput Gap in Heterogeneous Graph Pattern Matching via Workload-Aware Steering
inferred← citeshttps://doi.org/10.1145/3802022openalex-snapshot
Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching
inferred← citeshttps://doi.org/10.1145/3805712.3809567openalex-snapshot
GNN-based Anchor Embedding for Efficient Subgraph Retrieval
inferred← citeshttps://doi.org/10.1145/3808283openalex-snapshot
A Compiler for Fused Relational Operations on Multisets
inferred← citeshttps://doi.org/10.1145/3810460.3812779openalex-snapshot
Boosting Graph Joins and Matrix Multiplications in Little Space
inferred← citeshttps://doi.org/10.14778/3342263.3342643openalex-snapshot
Optimizing subgraph queries by combining binary and worst-case optimal joins
inferred← citeshttps://doi.org/10.14778/3407790.3407797openalex-snapshot
Adopting worst-case optimal joins in relational database systems
inferred← citeshttps://doi.org/10.14778/3407790.3407840openalex-snapshot
Distributed subgraph counting
inferred← citeshttps://doi.org/10.14778/3415478.3415531openalex-snapshot
Towards multi-way join aware optimizer in SAP HANA
inferred← citeshttps://doi.org/10.14778/3415478.3415572openalex-snapshot
The relational data borg is learning
inferred← citeshttps://doi.org/10.14778/3476311.3476410openalex-snapshot
Evolution of a compiling query engine
inferred← citeshttps://doi.org/10.14778/3579075.3579090openalex-snapshot
High-Performance Row Pattern Recognition Using Joins
inferred← citeshttps://doi.org/10.14778/3598581.3598591openalex-snapshot
BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification
inferred← citeshttps://doi.org/10.14778/3611479.3611509openalex-snapshot
JoinBoost: Grow Trees over Normalized Data Using Only SQL
inferred← citeshttps://doi.org/10.14778/3654621.3654630openalex-snapshot
Efficient Exact Subgraph Matching via GNN-Based Path Dominance Embedding
inferred← citeshttps://doi.org/10.14778/3704965.3704973openalex-snapshot
A Branch-&-Bound Algorithm for Fractional Hypertree Decomposition
inferred← citeshttps://doi.org/10.14778/3718057.3718068openalex-snapshot
Avoiding Materialisation for Guarded Aggregate Queries
inferred← citeshttps://doi.org/10.14778/3742728.3742737openalex-snapshot
Instance-Optimal Acyclic Join Processing Without Regret: Engineering the Yannakakis Algorithm in Column Stores
inferred← citeshttps://doi.org/10.14778/3748191.3748217openalex-snapshot
RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries
inferred← citeshttps://doi.org/10.14778/3749646.3749662openalex-snapshot
Accelerating Subgraph Matching through Fine-Grained and Powerful Equivalences
inferred← citeshttps://doi.org/10.14778/3797919.3797932openalex-snapshot
TurboLynx: Schemaless Graph Engine Strikes Back for General-Purpose Analytics
inferred← citeshttps://doi.org/10.14778/3819518.3819533openalex-snapshot
One Join Order Does Not Fit All: Reducing Intermediate Results with Per-Split Query Plans
inferred← citeshttps://doi.org/10.14778/3819518.3819567openalex-snapshot
BaCon: Efficient Batch Processing of Counting Queries
inferred← citeshttps://doi.org/10.14778/3836663.3836681openalex-snapshot
Worst-Case Optimal BGPs on Temporal Graphs
inferred← citeshttps://doi.org/10.3390/electronics8030292openalex-snapshot
A State-of-the-Art Survey on Deep Learning Theory and Architectures
inferred← citeshttps://doi.org/10.4204/eptcs.385.35openalex-snapshot
Nemo: First Glimpse of a New Rule Engine
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.