Systems and Control · arXiv:2611.16796 v1 · submitted 12 Nov 2026 · 32 references
Structure-Preserving Learning for Nonlinear Nonholonomic Dynamics
The paper says
“Learning the dynamics of mechanical systems subject to nonlinear nonholonomic constraints is challenging, as data-driven models may violate the underlying physical constraints, leading to inconsistent predictions.”
more of the abstract
To address this problem, we develop a constraint-preserving learning framework based on the Lagrange-d'Alembert-Chetaev equations and tangency to the constraint submanifold, which together define an affine space of admissible accelerations. Using the kinetic-energy metric and the Moore-Penrose pseudoinverse, we construct a metric projector and the corresponding Chetaev correction. Embedding this geometric structure directly into a Gaussian process prior ensures that both prior and posterior dynamics satisfy the acceleration constraints exactly. We characterize the resulting reproducing kernel Hilbert space (RKHS), derive an adapted-coordinate representation, and establish nonexpansiveness and consistency transfer. Numerical experiments on a three-dimensional directional flocking system with up to 50 agents demonstrate exact constraint preservation and robustness to constraint-incompatible observations.
from the abstract
Pith says
Machine review · deepseek-v4-flash · 13 Nov 2026 · what was read was not recorded · not checked by a person
It can be wrong. Challenge this review or reply to it.
Holds up. Solid extension of linear nonholonomic GP to nonlinear constraints; the geometry is handled cleanly and the Chetaev projector construction is the right tool. The flocking benchmark is well chosen and the robustness experiment is convincing. The paper is what it says it is. This line is wrong
5 major objections · 10 minor
How often objections from reviews like this one are right: not yet measured
Not checked: figures, code, what the 32 references say.
The paper says, at Section 2, after equation (1)
The review did not quote this passage.
Pith says: Objection 1 of 5 · major
The assumption that A(q,v) = D_v Φ(q,v) has constant rank r ≤ m on C and that D_q Φ(q,v) v ∈ Im A(q,v) is stated as a regularity condition. However, the paper later acknowledges that constraint functions need not be independent, and the Moore-Penrose formulation handles rank-deficient cases.
more of objection 1
The constant rank assumption is standard in nonholonomic mechanics, but it is load-bearing for the smoothness of the projector and the pseudoinverse. The authors should discuss whether this assumption can be relaxed or verified for the flocking application. In the flocking example, the rank of A_G(v) is 2(N-1) on V+_al, which is constant, so it holds. But for more general nonlinear constraints, the constant rank condition may fail at points where the Jacobian drops rank. The paper should address this limitation more explicitly, perhaps noting that the construction still yields a valid projector (via the pseudoinverse) even if the rank varies, but the smoothness may be lost. This is a minor concern given the scope, but it deserves a comment.
The paper says, at Section 3.1, Theorem 2
The review did not quote this passage.
Pith says: Objection 2 of 5 · major
Theorem 2 states that the posterior mean and covariance satisfy A(x) â_Φ(x) + b(x) = 0 and A(x) K_Φ,N(x,x') = 0. The proof relies on the fact that A(x) K_Φ(x,X) = 0, which follows from A(x) Π_Φ(x) = 0. However, the posterior mean formula involves K_Φ(x,X) Q_X^{-1} (Y - m_Φ(X)).
more of objection 2
The authors claim that left multiplication by A(x) gives the posterior identities. This is correct if A(x) K_Φ(x,X) = 0. But note that Q_X = K_Φ(X,X) + Σ, and Σ is positive definite. The inverse Q_X^{-1} does not necessarily commute with A(x) because A(x) acts on the left of K_Φ(x,X), not on Q_X^{-1}. However, since A(x) K_Φ(x,X) = 0, the product A(x) K_Φ(x,X) Q_X^{-1} = 0 regardless of Q_X^{-1}. So the argument is valid. The proof is sound.
The paper says, at Section 3.1, equation (4) and surrounding text
The review did not quote this passage.
Pith says: Objection 3 of 5 · major
The rejection of constraint-incompatible observation components is a key advantage claimed over post-projection. The authors show that for a perturbation η satisfying P_X^T η = 0, the posterior mean from the constrained prior is unchanged, while the post-projected estimator changes.
more of objection 3
However, the condition P_X^T η = 0 means that η is in the nullspace of P_X^T, i.e., each η_i is orthogonal to the range of Π_Φ(x_i)^T. Since Π_Φ is an orthogonal projector (in the M-metric), this means η_i is in the orthogonal complement of the admissible space, i.e., normal to ker A(x_i). The authors state that this means η_i is normal to admissible acceleration directions. This is correct. The example is illustrative, but the practical relevance depends on whether such perturbations are realistic. The authors could strengthen this by discussing scenarios where measurement noise may have components normal to the constraint manifold, e.g., due to sensor biases or model misspecification. The numerical experiments with controlled contamination address this to some extent.
The paper says, at Section 4.2, Table 1 and Figures 1-2
The review did not quote this passage.
Pith says: Objection 4 of 5 · major
The numerical experiments show that the NH GP achieves exact constraint preservation (to numerical precision) and robustness to normal contamination. However, the comparison with standard and projected GPs is based on fixed hyperparameters calibrated from an uncontaminated dataset. The authors state that kernel and noise hyperparameters are calibrated once from an independent uncontaminated data set and kept fixed throughout the ρ_⊥ sweep.
more of objection 4
This is a fair comparison for the fixed-hyperparameter setting, but in practice one might tune hyperparameters on the contaminated data. The authors should discuss whether the advantage of NH GP persists if hyperparameters are re-estimated on contaminated data. Additionally, the paper reports relative field errors but does not provide uncertainty quantification (e.g., credible intervals) for the predictions. The NH GP provides posterior covariances, but the evaluation focuses on point predictions. A brief discussion of how the posterior uncertainty is affected by the constraint would be informative.
The paper says, at Section 4.2, Table 1
The review did not quote this passage.
A classifier read this sentence of the paper as acknowledging the concern (probability 0.92):
“The larger-Ncases are structural scalability tests rather than sample-complexity comparisons, since the number of training states is reduced asNincreases. 5.”
Pith says: Objection 5 of 5 · major
The number of training states N_tr decreases as N increases (from 160 for N=4 to 60 for N=50). The authors acknowledge that larger-N cases are structural scalability tests rather than sample-complexity comparisons. This is appropriate, but it limits the conclusions that can be drawn about performance in data-rich regimes. The paper should clarify that the experiments are designed to test the structural properties (exact constraint preservation, robustness) rather than sample efficiency. The results are still valuable.
10 minor objections
The paper says, at Abstract
Pith says: minor objection 1 of 10
The abstract mentions 'nonexpansiveness and consistency transfer' but does not define these terms. Consider adding a brief explanation.
The paper says, at Section 1, Introduction
Pith says: minor objection 2 of 10
The phrase 'the projection construction used for linear nonholonomic constraints in (Beckers et al., 2026) does not apply directly' could be clarified: the linear case uses a constant projector, while the nonlinear case requires a state-dependent projector and an affine correction.
show 8 more
The paper says, at Section 2, after equation (2)
Pith says: minor objection 3 of 10
The notation S^{⊥_M}_x is introduced but not explicitly defined. It is clear from context, but a brief definition would help.
The paper says, at Section 3.1, after Proposition 1
Pith says: minor objection 4 of 10
The sentence 'Consequently, m_Φ and K_Φ depend only on A_x, and not on the particular choice of constraint equations' is important. Consider adding a brief justification or reference to the invariance of the projector.
The paper says, at Section 3.2, Theorem 3
Pith says: minor objection 5 of 10
The proof of Theorem 3 uses the fact that point evaluation is continuous in an RKHS. This is standard, but a brief justification or reference would be helpful for readers less familiar with RKHS theory.
The paper says, at Section 3.3, Proposition 5
Pith says: minor objection 6 of 10
The proof uses the Pythagorean identity for the M-orthogonal decomposition. It might be helpful to explicitly state that Π_Φ is symmetric with respect to the M-inner product, i.e., M Π_Φ = Π_Φ^T M.
The paper says, at Section 4.1, after Proposition 7
Pith says: minor objection 7 of 10
The sentence 'The map Φ_G contains 3|E| scalar constraint functions, while its Jacobian has rank only 2(N-1) on V+_al' is clear. However, it might be useful to note that the pseudoinverse formulation automatically handles this redundancy.
The paper says, at Section 4.2, paragraph 2
Pith says: minor objection 8 of 10
The description of the translation-invariant input z = (eq, α, d) is clear, but the scaling of the squared-exponential kernel (division by N for eq and α) could be motivated briefly.
The paper says, at Section 5, Conclusions
Pith says: minor objection 9 of 10
The conclusions mention 'learning away from the constraint manifold' as future work. This is an important limitation: the current method assumes that training data lie on the constraint manifold C. The paper should explicitly state this assumption earlier, perhaps in Section 2 or 3.
The paper says, at References
Pith says: minor objection 10 of 10
Reference (Beckers et al., 2026) is listed as 'arXiv preprint arXiv:2603.27580, 2026'. This is acceptable, but if the paper has been published or accepted, the reference should be updated.
What would settle it
Verify that the constant-rank condition holds for the flocking constraint Jacobian A_G(v) at states near but not exactly on V+_al (e.g., with small angular deviations). If the rank drops or becomes ill-conditioned, the smoothness of the projector and the theoretical guarantees may degrade. This test would confirm the practical robustness of the method beyond the ideal aligned manifold.
from the skeptic's reading
How the review went
4 readings by deepseek-v4-flash · 13 Nov 2026
- Reader holds up
- Skeptic agrees
- Editor wrote the verdict above
- Referee minor revision: 5 major objections, 10 minor
Not run on this paper: the simulated authors' defence.
Pith did not check this review's objections against the paper.
The review in full
The review in brief, machine-written
This paper extends the authors' earlier linear-nonholonomic GP framework (Beckers et al., 2026) to nonlinear constraints. The core idea is to embed the Chetaev projector—the M-orthogonal projector onto ker A derived from the Lagrange-d'Alembert-Chetaev equations—directly into a GP prior. This is geometrically the right thing to do, and the paper works it out carefully. The main theoretical results (exact constraint preservation for prior and posterior, RKHS characterization, nonexpansiveness, consistency transfer) are cleanly proved and hang together.
The flocking application is a good stress test: the cross-product constraints are genuinely nonlinear, the Jacobian is rank-deficient, and the Moore-Penrose formulation handles the redundancy naturally. The numerical experiment that adds normal contamination to the observations and shows the NH posterior is unchanged (to machine precision) while the projected GP drifts is a nice empirical demonstration of the difference between conditioning and post-projection. The paper is well written and the claims are supported.
Soft spots are minor. The constant-rank assumption on A(q,v) is standard but not trivial; the paper acknowledges it. The method assumes the constraint geometry is known—learning the constraints from data is left for future work, which is fine for a methods paper. The larger-N experiments are structural scalability tests rather than sample-complexity comparisons, as the authors note. The hyperparameter tuning is done once on clean data and held fixed, which is reasonable for the robustness experiment but leaves open how sensitive the method is to hyperparameter choice in practice.
Who this is for: researchers working on structure-preserving learning for mechanical systems, especially nonholonomic robotics. The paper deserves a serious referee; the math is sound and the experiments support the claims. I would cite it if I worked in this area.
Recommendation: accept with minor revisions. The authors should clarify the scope of the constant-rank condition and discuss what happens when it fails (e.g., at singular configurations). The comparison with post-projection could be sharpened by a brief discussion of computational cost. Otherwise solid.
The strongest objection
The paper's central claim—that embedding the Chetaev projector into a GP prior yields exact constraint preservation—is well-supported by the theoretical construction (Proposition 1, Theorem 2) and the numerical experiments. The weakest assumption identified by the reader (constant rank of A(q,v) on C) is standard in nonholonomic mechanics and is explicitly stated by the authors (Section 2, after equation (1)). The paper acknowledges that constraint functions need not be independent, and the Moore-Penrose formulation handles rank-deficient cases. The numerical benchmark uses a flocking system where the rank condition holds on the aligned manifold V+_al. The paper also clearly distinguishes its method from post-projection and demonstrates robustness to constraint-incompatible observations. No internal inconsistency or missing step in the argument was found. The paper's own limitations (learning away from the constraint manifold, time-varying topologies) are stated in the conclusions and do not undermine the central claim. Therefore, no load-bearing concern that would change the verdict is identified.
The reader's verdict is ACCEPT with HIGH confidence, and the weakest assumption identified is the constant-rank condition on A(q,v). This is indeed a standard regularity condition in nonholonomic mechanics, and the paper explicitly states it (Section 2, after equation (1)). The paper also handles the case where constraint functions are not independent via the Moore-Penrose pseudoinverse, which is a strength. The numerical experiments on flocking use a system where the rank condition holds on the aligned manifold. The paper's theoretical contributions (Theorem 2, Proposition 1, RKHS characterization, nonexpansiveness, consistency transfer) are clearly proven and logically sound. The distinction between conditioning and post-projection is well-explained and experimentally validated. The paper acknowledges its limitations (learning away from the constraint manifold, time-varying topologies) in the conclusions. No internal inconsistency, missing step, or unsupported claim was found. The stress-test did not identify a load-bearing concern that would weaken the central claim. Therefore, the verdict should remain UNCHANGED, and the agreement with the reader is 'agree'.
The referee's report
If the claims hold, this work provides a principled way to incorporate nonlinear nonholonomic constraints into GP-based learning, which is relevant for robotics, autonomous systems, and multi-agent coordination. The theoretical contributions—exact constraint preservation, RKHS characterization, nonexpansiveness, and consistency transfer—are solid and clearly presented. The numerical experiments on flocking with cross-product constraints are well-designed and demonstrate the practical benefits. The paper is likely to be of interest to the machine learning and control communities.
Pith's reading of the paper (a machine's summary, not the authors')
Many mechanical systems, such as wheeled robots or flocking birds, are subject to nonholonomic constraints that restrict their motion. For example, a car cannot move sideways, and birds in a flock tend to align their velocities. Learning such dynamics from data is challenging because standard machine learning models may violate these constraints, leading to physically inconsistent predictions. This paper introduces a method that builds the constraint geometry directly into a Gaussian process (GP) model. The key idea is to use the Lagrange-d'Alembert-Chetaev equations from mechanics to define an affine space of admissible accelerations. By projecting the GP's predictions onto this space using a metric projector, the model guarantees that both its prior and posterior predictions satisfy the constraints exactly. The authors prove that this projection does not amplify errors and preserves consistency. They apply the method to a three-dimensional flocking system where the constraint is that neighboring agents' velocities must be parallel. The results show that the proposed GP outperforms standard and post-projection baselines, especially when training data contains noise components that violate the constraints. The method is invariant to how the constraints are represented, making it robust to redundant or dependent constraint equations.
Core claim. The paper claims that embedding the nonlinear nonholonomic constraint geometry (via the Chetaev projector) directly into a Gaussian process prior ensures that both prior and posterior predictions satisfy the acceleration constraints exactly (Theorem 2). This is supported by the construction a_Phi = c_Phi + Pi_Phi g, where Pi_Phi is the M-orthogonal projector onto ker A, and the proof that A(x) a_Phi(x) + b(x) = 0 almost surely for prior and posterior.
The premise it rests on. The assumption that the constraint submanifold C is smooth and that the Jacobian A(q,v) = D_v Phi(q,v) has constant rank r on C (Section 2, after equation (1)). This is a standard regularity condition in nonholonomic mechanics, but it may not hold for all real-world constraint functions, especially those with singularities or bifurcations. The paper acknowledges that constraint functions need not be independent, but the constant rank assumption is still required for the smoothness of the projector and the pseudoinverse.
Check this review
Pith stored no record of this review's passes and took no fingerprint of it. Reviews made by code from 13 Nov 2026 on carry both.
How often reviews like this one are right
Reviews like this one: written by deepseek-v4-flash, where what was read was not recorded.
How often objections from reviews like this one are right: not yet measured
Reviews by people
This review was written by a machine. No person has reviewed this paper on Pith yet. A scientist listed on Pith can review it for a fee, and their review is published here whatever it concludes.
The paper
Abstract
Learning the dynamics of mechanical systems subject to nonlinear nonholonomic constraints is challenging, as data-driven models may violate the underlying physical constraints, leading to inconsistent predictions. To address this problem, we develop a constraint-preserving learning framework based on the Lagrange-d'Alembert-Chetaev equations and tangency to the constraint submanifold, which together define an affine space of admissible accelerations. Using the kinetic-energy metric and the Moore-Penrose pseudoinverse, we construct a metric projector and the corresponding Chetaev correction. Embedding this geometric structure directly into a Gaussian process prior ensures that both prior and posterior dynamics satisfy the acceleration constraints exactly. We characterize the resulting reproducing kernel Hilbert space (RKHS), derive an adapted-coordinate representation, and establish nonexpansiveness and consistency transfer. Numerical experiments on a three-dimensional directional flocking system with up to 50 agents demonstrate exact constraint preservation and robustness to constraint-incompatible observations.
The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. No sentence in this record was written by a model.
abstract compiled · 2026-11-13
The authors' main claim, as the classifier picked it out 0.84
“Numerical experiments on a three-dimensional directional flocking system with up to 50 agents demonstrate exact constraint preservation and robustness to constraint-incompatible observations.”
How the main claim is stated: asserted 1.00
What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.12 · human participants 0.01 · controlled comparison 0.07 · randomized assignment 0.01 · states quantitative result 0.76 · compares with prior results 0.12 · mentions code or data availability 0.02
The abstract, sentence by sentence
This table labels the abstract only (arXiv listing abstract v1). The number is the probability the classifier gave the label.
| Sentence | Role | The authors' own work | States the main conclusion | Strength |
|---|---|---|---|---|
| Learning the dynamics of mechanical systems subject to nonlinear nonholonomic constraints is challenging, as data-driven models may violate the underlying physical constraints, leading to inconsistent predictions. | background 0.99 | 0.07 | 0.03 | asserted 0.72 |
| To address this problem, we develop a constraint-preserving learning framework based on the Lagrange-d'Alembert-Chetaev equations and tangency to the constraint submanifold, which together define an affine space of admissible accelerations. | contribution 0.60 | 0.95 | 0.11 | asserted 1.00 |
| Using the kinetic-energy metric and the Moore-Penrose pseudoinverse, we construct a metric projector and the corresponding Chetaev correction. | method 0.98 | 0.94 | 0.04 | asserted 1.00 |
| Embedding this geometric structure directly into a Gaussian process prior ensures that both prior and posterior dynamics satisfy the acceleration constraints exactly. | method 0.76 | 0.91 | 0.34 | asserted 1.00 |
| We characterize the resulting reproducing kernel Hilbert space (RKHS), derive an adapted-coordinate representation, and establish nonexpansiveness and consistency transfer. | contribution 0.85 | 0.95 | 0.11 | asserted 1.00 |
| Numerical experiments on a three-dimensional directional flocking system with up to 50 agents demonstrate exact constraint preservation and robustness to constraint-incompatible observations. | result 1.00 | 0.96 | 0.49 | asserted 1.00 |
What kind of paper the classifier reports this is: method or tool 1.00 · evidence from simulation or computation 0.68
What was examined, and what was not
Sources read
- arXiv listing abstract v1
Not examined
- full text
- figures and tables
- references and citing sentences
- relations to other papers
Levels run
- P abstract
Not run
- S sections
- T body sentences
- C citations
- R cross-paper relations
How the labels were made
Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-11-13: 1 request, 5,001 input tokens.
Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. This record as JSON
Figures (2)
Figures are the authors', reproduced from the paper.
References (32)
- [1] de Le. Mechanical Systems with Nonlinear Constraints , journal = on Pith
- [2] Cendra, Hern. A Generalization of. Journal of Mathematical Physics , volume =. 2004 , doi = on Pith
- [3] Rasmussen, Carl Edward and Williams, Christopher K. I. , title = on Pith
- [4] Carmeli, Claudio and De Vito, Ernesto and Toigo, Alessandro and Umanit. Vector Valued Reproducing Kernel Hilbert Spaces and Universality , journal = on Pith
- [5] Brunton, Steven L. and Kutz, J. Nathan , year=. Data-Driven Science and Engineering: Machine Learning, Dynamical Systems, and Control , publisher= on Pith
- [6] Guaranteed margins for LQG regulators , author=. IEEE Transactions on automatic Control , volume=. 2003 , publisher= on Pith
- [7] Greydanus, Samuel and Dzamba, Misko and Yosinski, Jason , title =. Advances in Neural Information Processing Systems , volume = on Pith
- [8] Cranmer, Miles and Greydanus, Sam and Hoyer, Stephan and Battaglia, Peter and Spergel, David and Ho, Shirley , title =. ICLR 2020 Workshop on Integration of Deep Neural Models and Differential Equations , year = on Pith
- [9] Finzi, Marc and Stanton, Samuel and Izmailov, Pavel and Wilson, Andrew Gordon , title =. Proceedings of the 37th International Conference on Machine Learning , series = on Pith
- [10] Vaquero, Miguel and Cort. Symmetry Preservation in Hamiltonian Systems: Simulation and Learning , journal = on Pith
- [11] Beckers, Thomas and Seidman, Jacob and Perdikaris, Paris and Pappas, George J. , title =. 2022 IEEE 61st Conference on Decision and Control (CDC) , pages = on Pith
- [12] Jidling, Carl and Wahlstr. Linearly Constrained. Advances in Neural Information Processing Systems , volume = on Pith
- [13] de Le. A historical review on nonholomic mechanics , journal =. 2012 , doi = on Pith
- [14] Anthony M. Bloch and Alberto G. Rojo , title =. Physical Review E , volume =. 2016 , doi = on Pith
- [15] Nonholonomic mechanics and control , author=. Appl. Mech. Rev. , volume= on Pith
- [16] Learning Nonholonomic Dynamics with Constraint Discovery , author =. Proceedings of the 8th Annual Learning for Dynamics and Control Conference , pages =. 2026 , volume = on Pith
- [17] D. Lagrangian Neural Networks for Nonholonomic Mechanics , journal = on Pith
- [18] Beckers, Thomas and Bloch, Anthony M. and Colombo, Leonardo J. , title =. arXiv preprint arXiv:2603.27580 , year = on PitharXiv
- [19] Beckers, Thomas and Pappas, George J. and Colombo, Leonardo J. , title =. 2022 IEEE 61st Conference on Decision and Control (CDC) , pages = on Pith
- [20] Craig W. Reynolds , title =. Proceedings of the 14th Annual Conference on Computer Graphics and Interactive Techniques , pages =. 1987 , doi = on Pith
show 12 more
- [21] Structured learning of rigid-body dynamics: A survey and unified view from a robotics perspective , author=. GAMM-Mitteilungen , volume=. 2021 , publisher= on Pith
- [22] Geist, Andreas and Trimpe, Sebastian , booktitle =. Learning Constrained Dynamics with. 2020 , volume = on Pith
- [23] Tam. Novel Type of Phase Transition in a System of Self-Driven Particles , journal =. 1995 , doi = on Pith
- [24] Reza Olfati-Saber , title =. IEEE Transactions on Automatic Control , volume =. 2006 , doi = on Pith
- [25] Felipe Cucker and Steve Smale , title =. IEEE Transactions on Automatic Control , volume =. 2007 , doi = on Pith
- [26] Mihir Durve and Fernando Peruani and Antonio Celani , title =. Physical Review E , volume =. 2020 , doi = on Pith
- [27] Tom Z. Jiahao and Lishuo Pan and M. Ani Hsieh , title =. 2022 International Conference on Robotics and Automation (ICRA) , pages =. 2022 , doi = on Pith
- [28] Thomas Beckers and Leonardo J. Colombo , title =. arXiv preprint arXiv:2505.01569 , year = on PithPith's reviewarXiv
- [29] Thomas Beckers and Sandra Hirche and Leonardo Colombo , title =. Proceedings of the 60th IEEE Conference on Decision and Control (CDC) , pages = on Pith
- [30] Stratoglou, Efstratios and Anahory Simoes, Alexandre and Bloch, Anthony M. and Colombo, Leonardo J. , title =. IEEE Transactions on Automatic Control , volume =. 2025 , doi = on Pith
- [31] End-to-end training of deep visuomotor policies , author=. Journal of Machine Learning Research , volume= on Pith
- [32] High-dimensional probability: An introduction with applications in data science , author=. 2018 , publisher= on Pith
Challenges and discussion
Disagree with the review, or know something it missed? Leave a comment, or challenge this review formally: a challenge becomes a permanent entry in this paper's record, and its decision is published here.
Come back by email
A short list of the week's newly reviewed papers. Nothing is sent until you confirm from your inbox, and every email has a link that stops it. No account.
No comments yet.
Sign in to comment