{"total":20,"items":[{"citing_arxiv_id":"2606.27997","ref_index":17,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Benchmarking on Tasks That Matter: Dataset Selection for Preserving Model Rankings","primary_cat":"cs.LG","submitted_at":"2026-06-26T11:50:22+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":4.0,"formal_verification":"none","one_line_summary":"Framework for dataset subset selection via clustering, A/D-optimality, and FAFI with bootstrap intervals to preserve model rankings, showing high Spearman correlation (0.95 with 5 datasets) in TSC but limited gains in recommender systems.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.22133","ref_index":17,"ref_count":2,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Field-tunable quadruple-$Q$ states driven by momentum-space frustration","primary_cat":"cond-mat.str-el","submitted_at":"2026-06-20T16:23:24+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Simulations of a square-lattice spin model with bilinear and biquadratic interactions reveal successive field-driven transitions to single-Q, double-Q, and multiple inequivalent quadruple-Q states with distinct phase locking, amplitude distributions, and scalar spin chirality.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.19822","ref_index":21,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Learning Alternating Real-Time Automata","primary_cat":"cs.FL","submitted_at":"2026-06-18T05:55:43+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"AL*RTA learns alternating real-time automata, terminates, and produces smaller models than NL*RTA at the expense of more queries while preserving expressive power.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.08101","ref_index":17,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Automatic actions I. Bounded automata and orbits","primary_cat":"math.GR","submitted_at":"2026-06-06T11:06:57+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"For bounded automatic actions of inverse semigroups the orbit relation is ω-regular, making first-order statements about orbits and actions decidable, including computability of Fatou component encodings for post-critically finite polynomials.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.04561","ref_index":15,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"A GPH-Filtered Hannan--Rissanen Information Criterion for ARFIMA Order Selection","primary_cat":"math.ST","submitted_at":"2026-06-03T07:49:16+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"A consistent two-stage GPH-filtered Hannan-Rissanen generalized information criterion for selecting finite AR and MA orders in ARFIMA models with growing candidate sets.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.01175","ref_index":7,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"On the Complexity of Recurrence Evaluation","primary_cat":"cs.CC","submitted_at":"2026-05-31T11:29:59+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Establishes PSPACE/EXP-completeness for offset-input recurrence evaluation and PP-hardness for 3D NAND recurrences with coordinate offsets and arbitrary boundaries.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.31395","ref_index":45,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Direct Observation of Chemical Short-Range Order in CoCrNi Alloy Using Neutron Diffraction","primary_cat":"cond-mat.mtrl-sci","submitted_at":"2026-05-29T15:00:20+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Neutron diffraction detects intrinsic chemical short-range order in CoCrNi via a diffuse peak at 1.85 Å^{-1}, enhanced by aging, with simulations and SANS confirming nanoscale Ni-rich domains.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.29102","ref_index":1,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Implying Volatility: How Fast Can We Go?","primary_cat":"q-fin.CP","submitted_at":"2026-05-27T21:03:43+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":4.0,"formal_verification":"none","one_line_summary":"FlashIV is a new Black-Scholes implied volatility solver using input normalization, erfcx residual, and fixed Householder refinement that runs faster than Jäckel's Let's Be Rational while staying close to its reference price.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.28263","ref_index":17,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Existence and Optimality of Envy-Free random allocations","primary_cat":"econ.TH","submitted_at":"2026-05-27T10:12:32+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"A unified framework establishes existence of weak Pareto efficient envy-free random allocations as probability measures under continuous concave utilities, nesting classic problems and extending to new ones like timed allocations.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.22427","ref_index":1,"ref_count":2,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Faster Monotone Implied Volatility Solver","primary_cat":"q-fin.CP","submitted_at":"2026-05-21T12:48:56+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"ThiopheneIV is a monotone implied-volatility solver using Choi-Huh-Su seed, Euler-Chebyshev and Halley iterations, proven to converge monotonically in exact arithmetic, with double-precision boundary handling and comparisons to Jäckel's solver.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.21542","ref_index":15,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Discovering Entity-Conditioned Lag Heterogeneity: A Lag-Gated Neural Audit Framework for Panel Time Series","primary_cat":"cs.LG","submitted_at":"2026-05-20T09:09:15+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"AC-GATE is a lag-gated neural encoder that conditions lag-weight distributions on entity proxies to recover heterogeneous lags as structural model outputs in panel time series.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.04351","ref_index":6,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Radial Integration in Continuous Dimension: A Mellin-Gamma Classification of Euclidean Ball Volume","primary_cat":"math.CA","submitted_at":"2026-05-05T23:15:48+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Positive linear functionals on C_c(R>0) with scaling covariance of degree x/2 and Gaussian normalization are uniquely the Mellin-Gamma measures, recovering V(x) = π^{x/2}/Γ(x/2 + 1) as the mass of the unit interval.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.26198","ref_index":8,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Pricing Global Macroeconomic Risk in Equity Markets: Evidence from Selected G20 Economies","primary_cat":"stat.AP","submitted_at":"2026-04-29T01:00:51+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":3.0,"formal_verification":"none","one_line_summary":"A four-factor dynamic factor model from global macro variables explains cross-sectional equity returns in ten G20 countries better than the single-factor CAPM.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.24489","ref_index":3,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Property, Interest, and Money: Is Heinsohn and Steiger's Property Premium a Determinant of Interest?","primary_cat":"econ.GN","submitted_at":"2026-04-27T13:55:52+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"Heinsohn and Steiger's property premium fails to supplant time preference and fits within conventional interest rate decompositions, contributing a third term only for money-issuing banks.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.16030","ref_index":25,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Hardness, Tractability and Density Thresholds of finite Pinwheel Scheduling Variants","primary_cat":"cs.DS","submitted_at":"2026-04-17T13:00:32+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"2-Visits is strongly NP-complete for multiplicity 2 but in RP for constant distinct deadlines, with a 0.9142 density lower bound for 2-Visits and thresholds approaching 5/6 for large k.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"Pinwheel Schedulingis a fundamental problem in scheduling theory, introduced by Holte, Mok, Rosier, Tulchinsky and Varvel [24] in 1989. Given the deadlines ofntasks, the problem asks whether it is possible to perpetually execute one task at a time, in a way such that no deadline expires between consecutive executions of the same task. Since its introduction, this problem has been extensively studied; for instance, [25] and [34] study the problem for constant amounts of distinct deadlines, [27] studies its complexity and [18] introduces an optimization version known asBamboo Garden Trimming.Pinwheel Schedulinghas received significant attention in recent years, in particular after Kawamura's breakthrough paper [30] in STOC 2024, in which a computer-assisted proof of thedensity threshold conjecture(i."},{"citing_arxiv_id":"2602.11041","ref_index":9,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Exploiting the Structure in Tensor Decompositions for Matrix Multiplication","primary_cat":"cs.SC","submitted_at":"2026-02-11T17:12:34+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"Exploits special structural features in tensor decompositions to lower the matrix multiplication exponent for 6x6 matrices from 2.8075 to 2.8019.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2510.15712","ref_index":18,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"PLS-complete problems with lexicographic cost functions: Max-$k$-SAT and Abelian Permutation Orbit Minimization","primary_cat":"cs.CC","submitted_at":"2025-10-17T14:56:50+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Establishes PLS-completeness for lexicographic local search in 4-CNF and 3-CNF (double flips), and for Abelian permutation orbit minimization even when groups are cyclic or consist of involutions, with applications to bounded congestion games.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2306.16330","ref_index":4,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Proving Confluence in the Confluence Framework with CONFident","primary_cat":"cs.LO","submitted_at":"2023-06-28T16:08:03+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"The Confluence Framework provides a modular strategy to automatically prove and disprove confluence for a broad class of generalized term rewriting systems.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2302.06248","ref_index":6,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Decision Problems on Copying and Shuffling","primary_cat":"cs.FL","submitted_at":"2023-02-13T10:37:48+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":4.0,"formal_verification":"none","one_line_summary":"Investigates decidability of existence of words with copy-, marked-copy-, and shuffle-based forms inside regular and linear context-free languages.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2301.10311","ref_index":43,"ref_count":1,"confidence":0.5,"is_internal_anchor":false,"paper_title":"Relation-Algebraic Verification of Disjoint-Set Forests","primary_cat":"cs.LO","submitted_at":"2023-01-24T21:23:13+00:00","verdict":"ACCEPT","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"full","one_line_summary":"Relation algebras gain semantics for associative arrays that integrate with while-programs, enabling Isabelle/HOL proofs of correctness for disjoint-set forest implementations using union-by-rank and path compression, splitting or halving.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null}],"limit":50,"offset":0}