On the public citation graph
Incorporating Condition Measures into the Complexity Theory of Linear Programming
0 signed · 161 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.1007/bf01581690openalex-snapshot
Some perturbation theory for linear programming
inferredcites →https://doi.org/10.1007/bf02123011openalex-snapshot
Computational complexity of norm-maximization
inferredcites →https://doi.org/10.1016/0041-5553(81)90148-8openalex-snapshot
Stability conditions for linear programming problems
inferredcites →https://doi.org/10.1137/s105262349223352xopenalex-snapshot
Ill-Posedness and the Complexity of Deciding Existence of Solutions to Linear Programs
inferredcites →https://doi.org/10.1287/opre.25.3.435openalex-snapshot
A Characterization of Stability in Linear Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rsa.20196openalex-snapshot
Sampling subproblems of heterogeneous Max‐Cut problems and approximation algorithms
inferred← citeshttps://doi.org/10.1002/zamm.200310113openalex-snapshot
On well‐posedness and conditioning in optimization
inferred← citeshttps://doi.org/10.1006/jcom.2001.0581openalex-snapshot
A Theory of Complexity for Continuous Time Systems
inferred← citeshttps://doi.org/10.1006/jcom.2001.0607openalex-snapshot
Real Computations with Fake Numbers
inferred← citeshttps://doi.org/10.1007/11537311_2openalex-snapshot
The Smoothed Analysis of Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-46769-6_19openalex-snapshot
Learning Real Polynomials with a Turing Machine
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_5openalex-snapshot
Real Computations with Fake Numbers
inferred← citeshttps://doi.org/10.1007/978-3-030-22996-2_1openalex-snapshot
Recent Advances in the Computation of the Homology of Semialgebraic Sets
inferred← citeshttps://doi.org/10.1007/978-3-030-61887-2_6openalex-snapshot
Structure and Optimisation in Computational Harmonic Analysis: On Key Aspects in Sparse Regularisation
inferred← citeshttps://doi.org/10.1007/978-3-319-00200-2_17openalex-snapshot
A Primal–Dual Smooth Perceptron–von Neumann Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-92775-6_3openalex-snapshot
Well-Posedness and Coderivative Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-60539-0_35openalex-snapshot
Ill-Posedness and Finite Precision Arithmetic: A Complexity Analysis for Interior Point Methods
inferred← citeshttps://doi.org/10.1007/b97521openalex-snapshot
Differentiable Optimization and Equation Solving: A Treatise on Algorithmic Science and the Karmarkar Revolution
inferred← citeshttps://doi.org/10.1007/bf01581689openalex-snapshot
Global convergence in infeasible-interior-point algorithms
inferred← citeshttps://doi.org/10.1007/bf01581690openalex-snapshot
Some perturbation theory for linear programming
inferred← citeshttps://doi.org/10.1007/bf01582132openalex-snapshot
On the complexity of linear programming under finite precision arithmetic
inferred← citeshttps://doi.org/10.1007/bf01585941openalex-snapshot
Linear programming, complexity theory and elementary functional analysis
inferred← citeshttps://doi.org/10.1007/bf01590957openalex-snapshot
On the complexity of solving feasible systems of linear inequalities specified with approximate data
inferred← citeshttps://doi.org/10.1007/bf02680548openalex-snapshot
Condition measures and properties of the central trajectory of a linear program
inferred← citeshttps://doi.org/10.1007/s10107-003-0393-7openalex-snapshot
Solving linear programs with finite precision: I. Condition numbers and random programs
inferred← citeshttps://doi.org/10.1007/s10107-003-0448-9openalex-snapshot
Smoothed analysis of termination of linear programming algorithms
inferred← citeshttps://doi.org/10.1007/s10107-004-0514-yopenalex-snapshot
On the block-structured distance to non-surjectivity of sublinear mappings
inferred← citeshttps://doi.org/10.1007/s10107-007-0095-7openalex-snapshot
A simple polynomial-time rescaling algorithm for solving linear programs
inferred← citeshttps://doi.org/10.1007/s10107-009-0278-5openalex-snapshot
Smoothed analysis of condition numbers and complexity implications for linear programming
inferred← citeshttps://doi.org/10.1007/s10107-010-0346-xopenalex-snapshot
Robust smoothed analysis of a condition number for linear programming
inferred← citeshttps://doi.org/10.1007/s10107-012-0577-0openalex-snapshot
A complementarity partition theorem for multifold conic systems
inferred← citeshttps://doi.org/10.1007/s10107-013-0709-1openalex-snapshot
Geometric measures of convex sets and bounds on problem sensitivity and robustness for conic linear optimization
inferred← citeshttps://doi.org/10.1007/s10107-016-1073-8openalex-snapshot
On the complexity of quadratic programming with two quadratic constraints
inferred← citeshttps://doi.org/10.1007/s10107-020-01473-6openalex-snapshot
New characterizations of Hoffman constants for systems of linear constraints
inferred← citeshttps://doi.org/10.1007/s10107-020-01510-4openalex-snapshot
The condition number of a function relative to a set
inferred← citeshttps://doi.org/10.1007/s10107-021-01663-wopenalex-snapshot
Status determination by interior-point methods for convex optimization problems in domain-driven form
inferred← citeshttps://doi.org/10.1007/s10107-022-01901-9openalex-snapshot
Faster first-order primal-dual methods for linear programming using restarts and sharpness
inferred← citeshttps://doi.org/10.1007/s10107-023-01956-2openalex-snapshot
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
inferred← citeshttps://doi.org/10.1007/s10107-024-02109-9openalex-snapshot
On the geometry and refined rate of primal–dual hybrid gradient for linear programming
inferred← citeshttps://doi.org/10.1007/s101070000136openalex-snapshot
Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
inferred← citeshttps://doi.org/10.1007/s101070050088openalex-snapshot
Some characterizations and properties of the “distance to ill-posedness” and the condition measure of a conic linear system
inferred← citeshttps://doi.org/10.1007/s101070050091openalex-snapshot
An infeasible-interior-point potential-reduction algorithm for linear programming
inferred← citeshttps://doi.org/10.1007/s101070100237openalex-snapshot
A new condition number for linear programming
inferred← citeshttps://doi.org/10.1007/s101070100265openalex-snapshot
A characterization of ill-posed data instances for convex programming
inferred← citeshttps://doi.org/10.1007/s10107980009aopenalex-snapshot
Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
inferred← citeshttps://doi.org/10.1007/s10208-008-9036-yopenalex-snapshot
Local Linear Convergence for Alternating and Averaged Nonconvex Projections
inferred← citeshttps://doi.org/10.1007/s10208-013-9178-4openalex-snapshot
Probabilistic Analysis of the Grassmann Condition Number
inferred← citeshttps://doi.org/10.1007/s10208-017-9358-8openalex-snapshot
Computing the Homology of Real Projective Sets
inferred← citeshttps://doi.org/10.1007/s10208-026-09743-zopenalex-snapshot
The radius of statistical efficiency
inferred← citeshttps://doi.org/10.1007/s10589-012-9480-0openalex-snapshot
Strong duality and minimal representations for cone optimization
inferred← citeshttps://doi.org/10.1007/s10994-012-5323-6openalex-snapshot
Computational complexity of kernel-based density-ratio estimation: a condition number analysis
inferred← citeshttps://doi.org/10.1007/s11067-012-9178-yopenalex-snapshot
An SOS1-Based Approach for Solving MPECs with a Natural Gas Market Application
inferred← citeshttps://doi.org/10.1007/s11228-012-0207-2openalex-snapshot
Some Results on Condition Numbers in Convex Multiobjective Optimization
inferred← citeshttps://doi.org/10.1007/s11401-018-1070-8openalex-snapshot
Grid Methods in Computational Real Algebraic (and Semialgebraic) Geometry
inferred← citeshttps://doi.org/10.1007/s11590-013-0721-7openalex-snapshot
Some preconditioners for systems of linear inequalities
inferred← citeshttps://doi.org/10.1007/s12532-013-0055-6openalex-snapshot
A hybrid branch-and-bound approach for exact rational mixed-integer programming
inferred← citeshttps://doi.org/10.1007/s12532-015-0092-4openalex-snapshot
CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization
inferred← citeshttps://doi.org/10.1007/s12532-015-0098-yopenalex-snapshot
Erratum to: CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization
inferred← citeshttps://doi.org/10.1016/j.amc.2019.124769openalex-snapshot
Quadrature rules with neighborhood of spherical designs on the two-sphere
inferred← citeshttps://doi.org/10.1016/j.ejco.2025.100105openalex-snapshot
Interior point methods in the year 2025
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.02.051openalex-snapshot
Improving the efficiency of the Branch and Bound algorithm for integer programming based on “flatness” information
inferred← citeshttps://doi.org/10.1016/j.ejor.2008.07.012openalex-snapshot
On strata of degenerate polyhedral cones I: Condition and distance to strata
inferred← citeshttps://doi.org/10.1016/j.jco.2004.06.004openalex-snapshot
A note on level-2 condition numbers
inferred← citeshttps://doi.org/10.1016/j.jco.2005.10.001openalex-snapshot
Solving linear programs with finite precision: II. Algorithms
inferred← citeshttps://doi.org/10.1016/j.jco.2009.11.001openalex-snapshot
On strata of degenerate polyhedral cones, II: Relations between condition measures
inferred← citeshttps://doi.org/10.1016/j.na.2007.12.025openalex-snapshot
Coderivative calculus and metric regularity for constraint and variational systems
inferred← citeshttps://doi.org/10.1016/j.na.2011.08.027openalex-snapshot
Local linear convergence of approximate projections onto regularized sets
inferred← citeshttps://doi.org/10.1016/j.orl.2003.11.006openalex-snapshot
Conic systems and sublinear mappings: equivalent approaches
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00269-2openalex-snapshot
Some aspects of studying an optimization or decision problem in different computational models
inferred← citeshttps://doi.org/10.1016/s0885-064x(03)00032-3openalex-snapshot
Probabilistic analysis of a differential equation for linear programming
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00015-4openalex-snapshot
Learning from rounded-off data
inferred← citeshttps://doi.org/10.1016/s1570-8659(02)11003-9openalex-snapshot
Linear Programming and Condition Numbers under the Real Number Computation Model
inferred← citeshttps://doi.org/10.1017/cbo9781107338579.003openalex-snapshot
Alan Turing and the other theory of computation (expanded)
inferred← citeshttps://doi.org/10.1017/cbo9781139107068.002openalex-snapshot
Smoothed Analysis of Condition Numbers
inferred← citeshttps://doi.org/10.1017/fms.2015.2openalex-snapshot
A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF
inferred← citeshttps://doi.org/10.1017/s0962492916000027openalex-snapshot
Probabilistic analyses of condition numbers
inferred← citeshttps://doi.org/10.1023/a:1015460004163openalex-snapshot
Probabilistic Analysis of Condition Numbers for Linear Programming
inferred← citeshttps://doi.org/10.1080/01630563.2011.594369openalex-snapshot
Condition Number Theorems in Linear-Quadratic Optimization
inferred← citeshttps://doi.org/10.1080/01630563.2019.1639729openalex-snapshot
Quantitative Stability Analysis of Two-Stage Stochastic Linear Programs with Full Random Recourse
inferred← citeshttps://doi.org/10.1080/02331930600662906openalex-snapshot
Extreme points of well-posed polytopes
inferred← citeshttps://doi.org/10.1080/02331934.2024.2313690openalex-snapshot
Feasibility problems via paramonotone operators in a convex setting
inferred← citeshttps://doi.org/10.1080/10556788.2015.1099652openalex-snapshot
Towards a deeper geometric, analytic and algorithmic understanding of margins
inferred← citeshttps://doi.org/10.1080/10556788.2024.2329590openalex-snapshot
Linear programming sensitivity measured by the optimal value worst-case analysis
inferred← citeshttps://doi.org/10.1090/conm/604/12069openalex-snapshot
The complexity and geometry of numerically solving polynomial systems.
inferred← citeshttps://doi.org/10.1093/imaiai/iay020openalex-snapshot
Computational complexity versus statistical performance on sparse recovery problems
inferred← citeshttps://doi.org/10.1109/cdc.2018.8619019openalex-snapshot
Efficient Algorithm for Large-and-Sparse LMI Feasibility Problems
inferred← citeshttps://doi.org/10.1109/focs.2006.52openalex-snapshot
Norm of the inverse of a random matrix
inferred← citeshttps://doi.org/10.1109/pesgm.2018.8586078openalex-snapshot
Strategic Generation Expansion Planning Using the Modified Benders Decomposition
inferred← citeshttps://doi.org/10.1109/tit.2020.2965720openalex-snapshot
Effective Condition Number Bounds for Convex Regularization
inferred← citeshttps://doi.org/10.1109/tpwrs.2017.2743823openalex-snapshot
Modified Benders Decomposition for Solving Transmission Investment Game With Risk Measure
inferred← citeshttps://doi.org/10.1137/040609264openalex-snapshot
Incorporating Condition Measures in the Context of Combinatorial Optimization
inferred← citeshttps://doi.org/10.1137/060665427openalex-snapshot
A Condition Number for Multifold Conic Systems
inferred← citeshttps://doi.org/10.1137/100786733openalex-snapshot
Applying Metric Regularity to Compute a Condition Measure of a Smoothing Algorithm for Matrix Games
inferred← citeshttps://doi.org/10.1137/110835177openalex-snapshot
A Coordinate-Free Condition Number for Convex Programming
inferred← citeshttps://doi.org/10.1137/15m1009937openalex-snapshot
On the von Neumann and Frank--Wolfe Algorithms with Away Steps
inferred← citeshttps://doi.org/10.1137/15m103114xopenalex-snapshot
On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming
inferred← citeshttps://doi.org/10.1137/15m1049415openalex-snapshot
Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach
inferred← citeshttps://doi.org/10.1137/18m1189464openalex-snapshot
A Data-Independent Distance to Infeasibility for Linear Conic Systems
inferred← citeshttps://doi.org/10.1137/18m1212331openalex-snapshot
Learning Paths from Signature Tensors
inferred← citeshttps://doi.org/10.1137/20m1323527openalex-snapshot
The Condition Number of Riemannian Approximation Problems
inferred← citeshttps://doi.org/10.1137/s0097539705447268openalex-snapshot
Typical Properties of Winners and Losers [0.2ex] in Discrete Optimization
inferred← citeshttps://doi.org/10.1137/s0895479803436202openalex-snapshot
Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices
inferred← citeshttps://doi.org/10.1137/s1052623400369235openalex-snapshot
Warm-Start Strategies in Interior-Point Methods for Linear Programming
inferred← citeshttps://doi.org/10.1137/s1052623400373829openalex-snapshot
A New Condition Measure, Preconditioners, and Relations Between Different Measures of Conditioning for Conic Linear Systems
inferred← citeshttps://doi.org/10.1137/s1052623402411885openalex-snapshot
Condition Number Theorems in Optimization
inferred← citeshttps://doi.org/10.1137/s105262340343470xopenalex-snapshot
Tail Decay and Moment Estimates of a Condition Number for Random Linear Conic Systems
inferred← citeshttps://doi.org/10.1137/s105262349223352xopenalex-snapshot
Ill-Posedness and the Complexity of Deciding Existence of Solutions to Linear Programs
inferred← citeshttps://doi.org/10.1137/s1052623494268467openalex-snapshot
On the Complexity of Solving Feasible Linear Programs Specified with Approximate Data
inferred← citeshttps://doi.org/10.1137/s105262349732829xopenalex-snapshot
Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
inferred← citeshttps://doi.org/10.1137/s105262349936063xopenalex-snapshot
Condition-Measure Bounds on the Behavior of the Central Trajectory of a Semidefinite Program
inferred← citeshttps://doi.org/10.1145/1007352.1007404openalex-snapshot
A simple polynomial-time rescaling algorithm for solving linear programs
inferred← citeshttps://doi.org/10.1145/1007352.1007409openalex-snapshot
Typical properties of winners and losers in discrete optimization
inferred← citeshttps://doi.org/10.1145/281508.281624openalex-snapshot
Efficient algorithms for computing the nearest polynomial with constrained roots
inferred← citeshttps://doi.org/10.1145/3326229.3326252openalex-snapshot
Plantinga-Vegter Algorithm takes Average Polynomial Time
inferred← citeshttps://doi.org/10.1145/3357713openalex-snapshot
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
inferred← citeshttps://doi.org/10.1145/3357713.3384326openalex-snapshot
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
inferred← citeshttps://doi.org/10.1145/380752.380813openalex-snapshot
Smoothed analysis of algorithms
inferred← citeshttps://doi.org/10.1145/990308.990310openalex-snapshot
Smoothed analysis of algorithms
inferred← citeshttps://doi.org/10.1155/s1110757x03301081openalex-snapshot
Convergence of a short‐step primal‐dual algorithm based on the Gauss‐Newton direction
inferred← citeshttps://doi.org/10.1184/r1/6702857openalex-snapshot
A Condition Number for Second Order Conic Systems
inferred← citeshttps://doi.org/10.1184/r1/6716213openalex-snapshot
Elementary Algorithms for Solving Convex Optimization Problems
inferred← citeshttps://doi.org/10.1287/moor.1040.0104openalex-snapshot
The Structured Distance to Ill-Posedness for Conic Systems
inferred← citeshttps://doi.org/10.1287/moor.1100.0456openalex-snapshot
Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
inferred← citeshttps://doi.org/10.1287/moor.2023.1353openalex-snapshot
An Oblivious Ellipsoid Algorithm for Solving a System of (In)Feasible Linear Inequalities
inferred← citeshttps://doi.org/10.1287/moor.22.4.769openalex-snapshot
On the Complexity of Solving Sparse Symmetric Linear Programs Specified with Approximate Data
inferred← citeshttps://doi.org/10.1287/moor.24.4.829openalex-snapshot
Ill-Conditioned Convex Processes and Conic Linear Systems
inferred← citeshttps://doi.org/10.1287/moor.26.2.206.10551openalex-snapshot
Conditioning of Convex Programs from a Primal-Dual Perspective
inferred← citeshttps://doi.org/10.1287/moor.28.4.625.20509openalex-snapshot
On the Complexity of Computing Estimates of Condition Measures of a Conic Linear System
inferred← citeshttps://doi.org/10.1287/opre.2018.0341openalex-snapshot
Least Squares Monte Carlo and Pathwise Optimization for Merchant Energy Production
inferred← citeshttps://doi.org/10.1365/s13291-015-0117-yopenalex-snapshot
The Unavoidable Condition… A Report on the Book
inferred← citeshttps://doi.org/10.1371/journal.pcbi.1013051openalex-snapshot
Optimization hardness constrains ecological transients
inferred← citeshttps://doi.org/10.1515/9783110889178.29openalex-snapshot
Three lectures on real computation
inferred← citeshttps://doi.org/10.15480/882.488openalex-snapshot
Rigorous Error Bounds for Finite Dimensional Linear Programming Problems
inferred← citeshttps://doi.org/10.1561/9781680831313openalex-snapshot
Scalable Algorithms for Data and Network Analysis
inferred← citeshttps://doi.org/10.1587/nolta.11.327openalex-snapshot
Verification methods for conic linear programming problems
inferred← citeshttps://doi.org/10.48550/arxiv.0803.0925openalex-snapshot
Robust Smoothed Analysis of a Condition Number for Linear Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1105.4049openalex-snapshot
A coordinate-free condition number for convex programming
inferred← citeshttps://doi.org/10.48550/arxiv.1112.2603openalex-snapshot
Probabilistic analysis of the Grassmann condition number
inferred← citeshttps://doi.org/10.48550/arxiv.1306.5287openalex-snapshot
Some preconditioners for systems of linear inequalities
inferred← citeshttps://doi.org/10.48550/arxiv.1408.3214openalex-snapshot
Improving the distance reduction step in the von Neumann algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.1505.04123openalex-snapshot
Margins, Kernels and Non-linear Smoothed Perceptrons
inferred← citeshttps://doi.org/10.48550/arxiv.1507.04073openalex-snapshot
On the von Neumann and Frank-Wolfe Algorithms with Away Steps
inferred← citeshttps://doi.org/10.48550/arxiv.1604.04637openalex-snapshot
On the Grassmann condition number
inferred← citeshttps://doi.org/10.48550/arxiv.1802.07712openalex-snapshot
Condition numbers of stochastic mean payoff games and what they say about nonarchimedean semidefinite programming
inferred← citeshttps://doi.org/10.48550/arxiv.1804.08418openalex-snapshot
An algorithm to compute the Hoffman constant of a system of linear constraints
inferred← citeshttps://doi.org/10.48550/arxiv.1805.09494openalex-snapshot
A data-independent distance to infeasibility for linear conic systems
inferred← citeshttps://doi.org/10.48550/arxiv.1806.02375openalex-snapshot
Understanding Batch Normalization
inferred← citeshttps://doi.org/10.48550/arxiv.1905.06366openalex-snapshot
Equivalence and invariance of the chi and Hoffman constants of a matrix
inferred← citeshttps://doi.org/10.48550/arxiv.2110.15734openalex-snapshot
The extended Smale's 9th problem -- On computational barriers and paradoxes in estimation, regularisation, computer-assisted proofs and learning
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0110056openalex-snapshot
Probabilistic analysis of a differential equation for linear programming
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0111050openalex-snapshot
Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0301019openalex-snapshot
Smoothed Analysis of Interior-Point Algorithms: Termination
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0302011openalex-snapshot
Smoothed Analysis of Interior-Point Algorithms: Condition Number
inferred← citeshttps://doi.org/10.48550/arxiv.math/0212413openalex-snapshot
Smoothed analysis of algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.math/0309278openalex-snapshot
On Tail Decay and Moment Estimates of a Condition Number for Random Linear Conic Systems
inferred← citeshttps://doi.org/10.5860/choice.51-6222openalex-snapshot
Condition: the geometry of numerical algorithms
inferred← citeshttps://doi.org/10.68381/jca09040openalex-snapshot
On the Distance Theorem in Quadratic Optimization
inferred← citeshttps://doi.org/10.7907/jzx4-qn41.openalex-snapshot
Robustness, complexity, validation and risk
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.