{"total":19,"items":[{"citing_arxiv_id":"2605.22728","ref_index":19,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"A $\\operatorname{prox}$-Based Semi-Smooth Newton Method for TV-Minimization","primary_cat":"math.NA","submitted_at":"2026-05-21T17:00:56+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"A prox-based semi-smooth Newton method for TV-minimization that is globally well-posed and locally superlinearly convergent under finite element discretization, extending to broader convex problems.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.20452","ref_index":2,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"On the Limits of Recursive Characterizations in the Refined $A$-Translation","primary_cat":"math.LO","submitted_at":"2026-05-19T20:05:56+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"None of the four properties in the refined A-translation admits a recursive characterization; the framework is extended with conjunction and a Rust prover is presented as a case study.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.19903","ref_index":87,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"New NanoSIMS Multielement Isotope Data Reveal CO Novae As Key Sources Of 13C-rich Presolar Silicon Carbide Grains","primary_cat":"astro-ph.SR","submitted_at":"2026-05-19T14:33:23+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"New isotopic data from presolar SiC grains are best reproduced by hydrodynamic models of CO novae, establishing them as the primary source for 1-2% of such grains.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.13313","ref_index":31,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"A Guide to Applications of $k$-Contact Geometry in Dissipative Field Equations","primary_cat":"math-ph","submitted_at":"2026-05-13T10:26:21+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"k-contact geometry supplies explicit Hamiltonian descriptions for multiple dissipative PDEs including damped Klein-Gordon, Allen-Cahn, Fisher-KPP, and complex Ginzburg-Landau equations.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"M. El-Sayed. \"A numerical simulation and explicit solutions of the generalized Burgers-Fisher equation\". In:Appl. Math. Comput.152.2 (2004), pp. 403- 413.doi:10.1016/S0096-3003(03)00565-4. [30] J. Kijowski. \"A finite-dimensional canonical formalism in the classical field theory\". In:Comm. Math. Phys.30.2 (1973), pp. 99-128.doi:10.1007/BF01645975. [31] J. Kijowski and W. M. Tulczyjew.A symplectic framework for field theories. Vol. 107. Lecture Notes in Physics. Berlin Heidelberg: Springer-Verlag, 1979.doi:10.1007/3- 540-09538-1. [32] T. J. Kippenberg, A. L. Gaeta, M. Lipson, and M. L. Gorodetsky. \"Dissipative Kerr Solitons in Optical Microresonators\". In:Science361 (2018), p. 6402.doi:10.1126/ science."},{"citing_arxiv_id":"2605.10232","ref_index":5,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Bulk-Edge Correspondence via Higher Gauge Theory","primary_cat":"hep-th","submitted_at":"2026-05-11T09:09:43+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Bulk-edge correspondence for fractional quantum Hall systems is realized as relative higher gauge theory from the complex Hopf fibration, geometrically engineered via M2/M5-branes and TED Cohomotopy flux quantization.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"exactly the observed anyon braiding phase in FQH systems at filling fractionν= 1/k (cf. Fig. 2). This shows that and howB≡CP 1 ≃S2 is indeed a classifying space for the topology of FQH systems deep in their bulk. 3.1.2.FQH Order on the Torus.Next, consider the case that the bulk domain is the torus Σ = T 2 :=S 1×S1. By a remarkable result going back to [Han74] we have: Proposition 3.1([LT80, Thm 1; Kal01, Prop. 1.5; KSS26, Thm. 3.3]).The fundamental group of maps from the torus to the 2-sphere is the integer Heisenberg group at level=2: π1Map(T 2,S2)≃Heis3(Z)≡⟨Wb,Wb,ζ⟩ / ([Wa,Wb] =ζ2,[ζ,−] = e).(33) BULK-EDGE CORRESPONDENCE VIA HIGHER GAUGE THEORY 11 The corresponding group algebra,C [Heis3(Z)], is exactly the algebra of Wilson loop observables in abelian Chern-Simons theory on the torus, hence of FQH anyon observables on the torus (cf."},{"citing_arxiv_id":"2605.04718","ref_index":5,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"On Minimum CADs for Algebraic Sets in Dimension Three","primary_cat":"cs.SC","submitted_at":"2026-05-06T10:05:59+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":8.0,"formal_verification":"none","one_line_summary":"A specific class of subsets of R^3 containing all algebraic sets admits minimum adapted CADs, giving the first positive existence theorem for such decompositions in dimension three.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.02124","ref_index":5,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Soft-to-Hard Routing in Sparse Mixture-of-Experts Models","primary_cat":"cs.LG","submitted_at":"2026-05-04T01:07:21+00:00","verdict":null,"verdict_confidence":null,"novelty_score":null,"formal_verification":null,"one_line_summary":null,"context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.00184","ref_index":24,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Introducing WARM-VR: Benchmark Dataset for Multimodal Wearable Affect Recognition in Virtual Reality","primary_cat":"cs.LG","submitted_at":"2026-04-30T20:00:56+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"WARM-VR provides a new public dataset of wristband and ECG signals from 31 people in VR stress-relaxation experiences with olfactory cues, plus baseline ML classification results for valence and arousal.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"A Benchmark Dataset for Multimodal Wearable Affect Recognition in Virtual Reality. InProceedings of Make sure to enter the correct conference title from your rights confirmation emai (Conference acronym 'XX).ACM, New York, NY, USA, 16 pages. https: //doi.org/XXXXXXX.XXXXXXX 1 Introduction Human-computer interaction has become integral to daily life, particularly with the rapid advancement of machine learning technologies [24]. To further improve the quality of these interactions, the field of affective computing has emerged, an interdisciplinary domain focused on designing systems that can recognize, interpret, and respond to human emotions [38]. Specifically, Affective Computing in Multimedia (ACM) focuses on recognizing the emotional responses that a particular stimuli is likely to elicit in users [40]."},{"citing_arxiv_id":"2604.26474","ref_index":23,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Templates in Rewriting Induction","primary_cat":"cs.LO","submitted_at":"2026-04-29T09:32:11+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"A template-based lemma generation method integrated into bounded rewriting induction for higher-order LCSTRSs enables proving program equivalences previously out of reach.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.18936","ref_index":191,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Fine-Tuning Small Reasoning Models for Quantum Field Theory","primary_cat":"cs.LG","submitted_at":"2026-04-21T00:21:05+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Small 7B reasoning models were fine-tuned on synthetic and curated QFT problems using RL and SFT, yielding performance gains, error analysis, and public release of data and traces.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"\"Microscopic Formulation of Black Holes in String Theory\". In: (2002).doi:10.1016/S0370-1573(02)00271-5. eprint:arXiv:hep-th/0203048. [189] Erick J. Weinberg and Piljin Yi. \"Magnetic Monopole Dynamics, Supersymmetry, and Duality\". In: (2006).doi:10.1016/j.physrep.2006.11.002. eprint:arXiv:hep-th/0609055. [190] James M. Cline.String Cosmology. 2006. eprint:arXiv:hep-th/0612129. 40 [191] Iosif Bena and Nicholas P. Warner. \"Black Holes, Black Rings and their Microstates\". In: (2007).doi: 10.1007/978-3-540-79523-0. eprint:arXiv:hep-th/0701216. [192] Alexander A. Migdal. \"Loop Equation and Area Law in Turbulence\". In: (1993).doi:10 . 1142 / S0217751X94000558. eprint:arXiv:hep-th/9310088. [193] Koichi Yamawaki.Zero-Mode Problem on the Light Front."},{"citing_arxiv_id":"2604.09355","ref_index":20,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Spectral convergence of empirical integral operators with discontinuous kernels","primary_cat":"math.SP","submitted_at":"2026-04-10T14:29:38+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Empirical integral operators with discontinuous non-negative symmetric kernels converge spectrally to their population versions with explicit rates as sample size grows to infinity.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.03541","ref_index":1,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Choosing the Right Regularizer for Applied ML: Simulation Benchmarks of Popular Scikit-learn Regularization Frameworks","primary_cat":"cs.LG","submitted_at":"2026-04-04T01:33:41+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":4.0,"formal_verification":"none","one_line_summary":"Simulations show Ridge, Lasso, and ElasticNet perform similarly for prediction at high sample-to-feature ratios, but Lasso feature selection recall drops to 0.18 under high multicollinearity and low SNR while ElasticNet holds at 0.93.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"the introduction of the parameterρthat governs the relative influence of theℓ 1 andℓ 2 norms. We use the parameterizations described in Table 1 when evaluating these three regularization procedures. For the L1 /ρparameter we use the values recommended in the documentation. Scikit-learn Regularization Frameworks Evaluated LassoCV Post-Lasso OLS ElasticNetCV RidgeCV Candidate Regularization Parameter Values Allowed V alues forα: [105,10 4,10 3,10 2,10 1,10 0,10 −1,10 −2,10 −3] Cross-Validation (CV) 5-fold (n=100); 4-fold (n=1,000); 3-fold (n=10,000); 2-fold (n=100,000) Test Set Holdout 20% L1 Ratio Values n/a n/a [0.0, 0.1, 0.5, 0.7, 0.9, 0.95, 0.99, 1.0] n/a CV Fits per Configuration 18-45 18-45 144-360 18-45 Table 1:Regularization parameters for the four methods evaluated. All methods use identical alpha grid with no scaling-this respects scikit-learn's design where Lasso has built-in (1/2n) normalization"},{"citing_arxiv_id":"2602.23464","ref_index":19,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"2G2T: Constant-Size, Statistically Sound MSM Outsourcing","primary_cat":"cs.CR","submitted_at":"2026-02-26T19:44:37+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":8.0,"formal_verification":"none","one_line_summary":"2G2T enables constant-size, statistically sound outsourcing of MSM with verification up to 300x faster than local computation and error probability at most 1/q.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2602.06209","ref_index":40,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Computing a holonomic submodule of the partial Weyl closure","primary_cat":"cs.SC","submitted_at":"2026-02-05T21:38:33+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"New algorithm computes holonomic submodule of partial Weyl closure via non-commutative Rabinowitsch trick, implemented in Julia with reported speedups over Singular and Macaulay2.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2506.22436","ref_index":40,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Is Lindblad for me?","primary_cat":"quant-ph","submitted_at":"2025-06-27T17:59:59+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":3.0,"formal_verification":"none","one_line_summary":"A review that contrasts common assumptions about the Lindblad equation with refined expectations drawn from examples, culminating in a checklist for assessing its breakdown.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"Equation (10) makes it apparent that the actual objects governing the perturbation theory in the Born master equation are the factors Bα(t)Bβ (s) eiΩ′(t−s). Their magnitude is limited by two independent timescales. One of them is the typical decay time of the bath correlation functions τB, which makes Bα(t)Bβ (s) highly localized in time. The other is a timescale 14 arising from the system's transition frequencies, τH = 1/Ω′ [40]. This timescale defines the period of coherent oscillations between two levels separated by an energy ħhΩ′ in the unper- turbed system. The exponential factor ei(t−s)/τH contributes to the convergence of the integral on the right-hand side of equation (10) by averaging out to zero the contributions coming from times t −s ≫ τH. Hence, the smaller the τH, the shorter the support of the time-integral,"},{"citing_arxiv_id":"2406.19206","ref_index":31,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Quantum Thermodynamics","primary_cat":"quant-ph","submitted_at":"2024-06-27T14:28:35+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":2.0,"formal_verification":"none","one_line_summary":"Lecture notes on quantum thermodynamics showing emergence of thermodynamic laws from quantum theory via Markovian master equations for small systems.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"17 SciPost Physics Lecture Notes Submission 2.1.1 Subsystem of an isolated system The first motivation considers the system of interest to be a small part of a very large \"super- system\" that is described as an isolated system, see Fig. 6. This motivation for the Gibbs state can be found in many textbooks, see e.g., Landau & Lifshitz[30] or Schwabl [31]. We start by assuming that the supersystem has a fixed energy and particle number given by Etot and Ntot respectively . In this case, it is described by the so-called micro-canonical ensemble ˆρtot = X E,N ptot(E, N) |E, N〉 〈E, N| , (69) where ptot(E, N) is nonzero only if the energy and particle number are close to Etot and Ntot, i.e., for Etot ≤ E < Etot + δE and Ntot ≤ N < Ntot + δN."},{"citing_arxiv_id":"2404.04552","ref_index":3,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Fast and Simple Sorting Using Partial Information","primary_cat":"cs.DS","submitted_at":"2024-04-06T08:29:44+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":8.0,"formal_verification":"none","one_line_summary":"A simple deterministic algorithm sorts n items with m given comparisons in O(m + log T) time using O(log T) comparisons by combining topological sort, heapsort, and binary search.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2211.11856","ref_index":15,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"String Covering: A Survey","primary_cat":"cs.DS","submitted_at":"2022-11-21T21:21:30+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":0.0,"formal_verification":"none","one_line_summary":"A survey of string covering techniques including covers and seeds, with proposals for future research directions in combinatorial string algorithms.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"practical matter, its construction is much slower. Moreove r, the tree structure, due to the requirement for pointers and other auxiliary information, normally con sumes much more space in computer mem- ory. However, suffix trees are still used in many applications because the basic tree can be \"annotated\" in various ways with information useful for processing. See however [15]. The suffix tree was first proposed and computed almost half a ce ntury ago [16], the suffix array 30 years ago [9]. Surveys of their computation and use are avail able in [14, 17, 18]. For definitions of the RSF x (Repeating Substring Frequency) and OLP x (Overlapping Posi- tions) arrays, see Subsection 3.4. 3. Covers in strings Before discussing the various forms of cover of a string, we p ause to say a little more about the"},{"citing_arxiv_id":"2211.10540","ref_index":17,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Waiting Nets: State Classes and Taxonomy","primary_cat":"cs.FL","submitted_at":"2022-11-19T00:01:08+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Waiting nets extend time Petri nets by decoupling time measurement from control, admit finite state class graphs for bounded instances, and are strictly more expressive than TPNs under timed language equivalence.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null}],"limit":50,"offset":0}