Data Structures and Algorithms · arXiv:2609.28397 v1 · submitted 23 Sep 2026 · 16 references
Transposition achieves OPT+ O(1) in polynomial time for IID list update
The paper says
“In the classical list update problem, a set of items must be stored in a list-type structure, where accessing the i-th element costs i.”
more of the abstract
Items will be queried in an IID manner according to some probability distribution p on the items. We want to minimize the expected cost of each query. The optimal order is to place the items in decreasing order of probability p1 ≥ p2 ≥ ⋯ with expected cost OPT = ∑jjpj, but the probability vector p is generally unknown. Thus we use a self-organizing list following the transposition rule: an item is transposed 1 position forward whenever it is queried. Coester (2026) proved that, at stationarity measure for the transposition rule, the expected cost of a query is at most OPT + 1. However, this Markov chain may have arbitrarily slow mixing time. We prove that, for arbitrary p and arbitrary initial orderings σ, after polynomially many queries in the number of items, the expected cost of a query is at most OPT + O(1).
from the abstract
Pith says
Machine review · deepseek-v4-flash · 24 Sep 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, with conditions. Real result — resolves Coester's conjecture with genuinely new machinery — carrying one genuine constant slip in Lemma 4.1 that the slack absorbs; the flagged mixing concern does not survive the arithmetic. This line is wrong
2 major objections · 5 minor
How often objections from reviews like this one are right: not yet measured
Not checked: figures, code, what the 16 references say.
The paper says, at §4.1, Lemma 4.1
The review did not quote this passage.
Pith says: Objection 1 of 2 · major
The final displayed inequality of the proof is false. Re-deriving the line "(1+√e)/2 · √2 n² · √(2n⁶ E_P(√f,√f)) ∫ e^{x/2} dx ≤ (3/2)n⁵√(4E_P(√f,√f))": the left side equals 2(1+√e) n⁵ √(E_P(√f,√f)) ≈ 5.436 n⁵ √(E_P(√f,√f)), which is strictly larger than 3 n⁵ √(E_P(√f,√f)).
more of objection 1
The correct bound after the reduction 4E_P(√f,√f) ≤ E_P(f,log f) is (1+√e) n⁵ √(E_P(f,log f)) ≈ 2.65 n⁵, not (3/2)n⁵. This inflates the n⁵ coefficient inherited by (4.4) by a factor of about 1.77. I verified the numerical conclusion survives: 3C0 ≈ 1197.3, the entropy term in (4.4) is O(1) (on the order of 2.7 before and roughly 5 after the correction), and the coupling term (T+1)n²e^{−n} is exponentially small, so the total stays below 1250. The theorem is therefore unaffected, but Lemma 4.1's stated bound is wrong and must be corrected, with the corrected constant propagated through (4.4) and through the final display of the proof of Theorem 1.2.
This review says the paper's mathematics is wrong. Pith did not check that against the paper's source.
The paper says, at §4.2, (4.4) and proof of Theorem 1.2
The review did not quote this passage.
Pith says: Objection 2 of 2 · major
After fixing Lemma 4.1, the coefficient 9/2 in (4.4) must consistently become 3(1+√e) ≈ 7.95, and the displayed bound "3C0 + 3 < C" should be replaced by a display with the actual corrected constants. Since 3C0 ≈ 1197.3 and the corrected entropy term computed at t = T = n^29 with H_q ≤ n³/2 evaluates to an O(1) quantity …
more of objection 2
… well under 50, the slack in C = 1250 comfortably absorbs the correction; however, as printed the chain of inequalities (3/2 → 2.65) is not numerically transparent, and the paper should show the single-line evaluation 3C0 ≈ 1197.3 < 1250 − (corrected error terms) explicitly.
5 minor objections
The paper says, at Throughout, §3 and §4
Pith says: minor objection 1 of 5
The text refers to "Theorem 3.1", "Theorem 3.2", "Theorem 3.4", "Theorem 2.1", "Theorem 2.2", "Theorem 4.1", and "Theorem 4.2" where the corresponding objects are Definitions 3.1/3.3, Lemmas 2.1/2.2/3.2/4.1/4.2, and Proposition 3.4. The numbering conventions should be unified so that a reader can retrieve the exact statement invoked at each displayed step of Lemma 4.1.
The paper says, at Proof of Theorem 1.2, final step
Pith says: minor objection 2 of 5
The extension from t = T to all t ≥ T via the Markov property is unnecessary and, as written, slightly imprecise: one cannot conclude sup_σ (P^T g)(σ) ≤ sup_σ (P^T F)(σ) merely from g ≤ F. Since bound (4.4) applies directly to every t ≥ T with an even smaller entropy term, the Markov-property sentence should be deleted or replaced by the direct claim that (4.4) holds for all t ≥ T.
show 3 more
The paper says, at Lemma 3.2 / Proposition 3.4
Pith says: minor objection 3 of 5
The decisive quantitative scale t_mix(n^{−2}) ≤ 9N/θ²(4 log n + θN/2) ≤ n^4 is imported verbatim from [6, Theorem 10] and not derived. My arithmetic check confirms the displayed expression is consistent with ≤ n^4 under the stated hypotheses: for θ = 1/(2n), N = n the bound is ≈ 144 n³ log n, which is below n^4 for n ≥ 1024, and the quantity decreases in θ beyond that point.
more of objection 3
This is therefore not an internal inconsistency, but the paper is entirely opaque about the prefactor's provenance; the authors should quote the exact Levin–Peres theorem (including its scope conditions) or include a short derivation, since this estimate is the only source of the polynomial time-scale n^29.
The paper says, at Proof of Theorem 1.2, n < 1024 case
Pith says: minor objection 4 of 5
The line "use F_p ≤ n < C" should state explicitly that OPT ≥ 1 (every query costs at least 1), so F_p ≤ n − 1; the inequality as written is harmless but slightly imprecise for the reader checking tightness.
The paper says, at §4.1, definition of C0
Pith says: minor objection 5 of 5
The definition of C0 in (4.1) and the final claim "C = 1250 suffices" are never numerically evaluated. Since the whole proof's credibility rests on the gap between 3C0 and 1250, the authors should include the one-line evaluation 3C0 ≈ 1197.3 (or an upper bound) in the proof of Theorem 1.2.
What would settle it
Re-derive Lemma 4.1's constant by evaluating the Cauchy–Schwarz step with the correct inequality ν((1−K)J) ≤ (1/2)√2 n^2 sqrt(EK) and then simulate the final bound with the corrected coefficient (1+√e) in place of 3/2, for n = 1024 and t = n^29, to confirm the total stays below 1250. Independently, plug θ = 1/(2n), N = n into the Levin–Peres expression 9N/θ^2 (4 log n + θN/2) for n = 1024 and verify it is less than n^4, thereby checking the claimed mixing bound.
from the skeptic's reading
How the review went
4 readings by deepseek-v4-flash · 24 Sep 2026
- Reader holds up, with conditions
- Skeptic partly agrees
- Editor wrote the verdict above
- Referee major revision: 2 major objections, 5 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
Clay,
Bottom line: this is the first polynomial-time, distribution-uniform OPT+O(1) bound for the transposition rule under IID accesses, and it confirms Coester's conjecture. The machinery is new: an adaptive buffer around each log-probability scale, a coupling to a biased exclusion chain, and a discrete-time entropy-decay lemma in the spirit of Liu et al. The inversion decomposition of the excess cost, the buffer integrability (Lemma 2.1), the entropy decay (Lemma 4.2), and the closing arithmetic all check out.
Two soft spots, in proportion. First, the reader is right about Lemma 4.1: as displayed it is false. The Cauchy–Schwarz step ends at (3/2)n5·sqrt(4EP), but the preceding lines give 2(1+sqrt(e))·n5·sqrt(EP) — about 1.81x larger. After 4EP(sqrt f,sqrt f) ≤ EP(f,log f), the correct Lemma 4.1 constant is (1+sqrt(e)) ≈ 2.65, not 3/2. I traced the corrected version through (4.4): 3C0 ≈ 1197.3, entropy term ≈ 2.3, coupling error n31 e−n negligible, total ≈ 1199.6 < 1250. So the theorem survives with roughly 50 units of slack, but the displayed inequality is wrong and must be corrected.
Second, the reader's worry about Lemma 3.2 does not land. Worst case theta = 1/(2n), N = n: the cited Levin–Peres bound gives 36n3(4 log n + 1/4) ≈ 144 n3 log n, which is below n4 for n ≥ 1024 (144·6.93 ≈ 998 < 1024), and larger theta only shrinks the product. So the dependence on the external bound is a reproducibility concern, not an internal inconsistency; a referee should ask the author to spell out that verification.
Minor: the Markov-property extension from t = T to all t ≥ T is unnecessary, since (4.4) applies directly at every t ≥ T. Harmless. The AI-usage disclosure is honest and I take it without prejudice, but it does mean independent human checking of constants matters more than usual — and it paid off here, since the Lemma 4.1 slip is exactly what a human eye was needed for.
Clear thinking, honest engagement, no self-citation games. The paper deserves a serious referee: conditional acceptance, requiring the Lemma 4.1 fix and requesting the mixing verification. I'd bring it to reading group and cite it once the correction is in.
The strongest objection
The most concrete defect is in the Cauchy–Schwarz step of Lemma 4.1: the displayed inequality claiming the second factor is bounded by 3/2 n^5 sqrt(4 EP) is false. Re-deriving, the correct upper bound is 2(1+√e) n^5 sqrt(EP) ≈ 5.436 n^5, and after using 4 EP(√f,√f) ≤ EP(f,log f) the Lemma 4.1 constant becomes 1+√e ≈ 2.65 instead of 3/2. This inflates the n^5 coefficient in (4.4) by about 1.77, but the slack in C=1250 absorbs it: 3C0 ≈ 1197, the entropy-decay term is ≈ 2.7, and the coupling error e^{−n} is negligible, so the final conclusion still holds. The proof as written, however, contains a false intermediate inequality and must be corrected.
The reader's main worry about Lemma 3.2 does not appear to hold. For the worst case θ = 1/(2n), N = n, the quoted Levin–Peres bound gives 9N/θ^2 (4 log n + θN/2) ≈ 144 n^3 log n, which is < n^3 · n = n^4 for n ≥ 1024 (e.g., 144·6.93 ≈ 998 < 1024). For larger θ the product decreases because 1/θ^2 shrinks faster than the bracket grows, so the n^4 mixing bound is consistent with the stated formula. Thus the dependence on the external theorem is a reproducibility concern, but not an internal inconsistency.
The final step extending t = T to all t ≥ T via the Markov property is unnecessary and slightly misstated, since the bound (4.4) applies directly to every t ≥ T with an even smaller entropy term. No fatal mathematical gap is apparent.
The reader's conditional verdict is appropriate, but for a different reason than their weakest_assumption. The arithmetic in Lemma 3.2 is actually fine: the quoted Levin–Peres bound does yield t_mix(n^{-2}) ≤ n^4 for the relevant parameter range θ ≥ 1/(2n) and n ≥ 1024, so the reader's specific worry about the n^4 bound does not land. Instead, the more substantive issue is the false constant in Lemma 4.1's Cauchy–Schwarz step, which inflates the n^5 coefficient by about 1.77 but is absorbed by the slack in C = 1250. This is a genuine correctness defect in the exposition, though not in the theorem's conclusion. The proof is otherwise coherent: the adaptive buffer, coupling to the biased exclusion chain, and entropy-decay argument all check out. The final Markov-property step is unnecessary and slightly off, but (4.4) already gives the bound for all larger t. Therefore the paper should be conditionally accepted pending a corrected constant in Lemma 4.1.
The referee's report
If correct, the result resolves Coester's conjecture and is a genuine advance: it gives a worst-case, distribution-independent, arbitrary-start polynomial-time OPT+O(1) guarantee for transposition even though the underlying chain can mix arbitrarily slowly. The paper's structure is a strength: the adaptive-buffer decomposition is clean and hand-checkable, the comparison with a biased exclusion process plus canonical paths is explicit, and the entropy-decay step gives a transparent finite-time error in the spirit of the locally stationary framework of Liu et al. [7]. The final constants and exponents are fully displayed, so the claim is checkable in principle; the paper is also commendably explicit about its AI-assisted preparation. The main mathematical substance — the cost-to-Dirichlet conversion and the discrete-time entropy decay — is novel in this application and is not borrowed from the cited literature.
Pith's reading of the paper (a machine's summary, not the authors')
In the list update problem, the cost of a query is the position of the accessed item, and under independent identically distributed requests the best static order is by decreasing request probability, with optimal expected cost OPT. The transposition rule, which moves each queried item one position forward, was known to be within OPT + 1 of optimal once the process reaches its stationary distribution, but that distribution can take arbitrarily long to appear. This paper proves that the waiting is unnecessary: after $t \geq n^{29}$ queries, from any starting order and under any probability distribution, the expected query cost is at most OPT + 1250. The guarantee is uniform — the constant 1250 does not depend on the distribution, the initial list, or the time (beyond the stated threshold). The result confirms the conjecture attached to the earlier stationarity bound and removes the need for the underlying list chain to have mixed.
What carries the argument. The motor of the proof is the threshold decomposition $F(\sigma) = \int_{-\infty}^{0} e^{x} I_x(\sigma)\,dx$, where $y_i = \log p_i$ and $I_x(\sigma)$ counts inverted pairs $(i,j)$ with $\sigma(i) > \sigma(j)$ and $y_j \leq x < y_i$. Around each threshold the paper places an adaptive buffer $\theta(x)$, defined by $\sum_i (2\theta(x) - |x - y_i|)_+ = 1$ and capped at $1/2$; this ensures $\theta(x) \geq 1/(2n)$, makes $\theta$ Lipschitz, and forces the integral $\int_{-\infty}^{0} e^x / \theta(x)^2\,dx$ to be an absolute constant. Inversions split into unsurprising pairs inside the buffer window, whose number is deterministically at most $\theta^{-2}$, and surprising pairs separated by a probability ratio at least $e^{\theta}$. Surprising inversions are controlled by an auxiliary chain that freezes the intermediate-probability items and evolves the remaining low/high word as a biased exclusion process with bias $\tanh(\theta/2)$; a canonical-paths comparison bounds the auxiliary chain's Dirichlet form by $2n^2 e^{-x}$ times the original chain's, and a discrete-time entropy-decay lemma bounds that Dirichlet form at time $t$ by roughly $\sqrt{H/t}$ with $H \leq n^3/2$, where $H$ is the log of the reciprocal of the minimum stationary weight. A final perturbation of $p$ by $e^{-n}$ handles zero probabilities, and the quoted polynomial mixing bound for the exclusion process is what fixes the $n^{29}$ exponent.
Core claim. The central claim is Theorem 1.2: for every $n \geq 1$, every probability vector $p$ on the $n$ items, every initial permutation $\sigma_0$, and every integer $t \geq n^{29}$, the expected cost $\mathbb{E}[\mathrm{Cost}(\sigma_t)]$ is at most $\mathsf{OPT} + 1250$, where $\sigma_t$ is the list after $t$ steps of the transposition rule. The proof writes the excess cost $F(\sigma) = \mathrm{Cost}(\sigma) - \mathsf{OPT}$ as a sum of probability-weighted inversions, $\sum_{i<j}(p_i - p_j)\mathbf{1}\{\sigma(i) > \sigma(j)\}$, and then as an integral over logarithmic thresholds $x \in (-\infty, 0]$ of the count $I_x(\sigma)$ of inverted pairs whose log-probabilities straddle $x$. Inversions whose probabilities differ by less than a factor $e^{\theta(x)}$ are few and cheap; inversions whose probabilities differ more are handled by comparison with a biased exclusion process that provably sorts in polynomial time. The remaining error from the chain not being at stationarity is bounded by a discrete-time entropy-decay inequality that shrinks like a power of $1/t$, so the cost guarantee does not wait for mixing. Read in the most direct way, the result says the slow-mixing regimes of the transposition chain are exactly the regimes where the unmixed tail carries negligible expected cost.
The premise it rests on. The timing of the whole argument rests on a bound, quoted from a cited theorem and not re-derived in this paper, that a biased swapping process on $N \leq n$ items with bias $\tanh(\theta/2)$ reaches within $n^{-2}$ of stationarity in at most $n^4$ steps from any starting arrangement; if the true worst-case settling time were a higher power of $n$, the $n^{29}$ threshold would have to be rescaled.
If the paper is right (Pith's inferences, not the authors')
For any request distribution and any starting order, the transposition rule is within an additive constant 1250 of optimal expected query cost after at most $n^{29}$ requests, with no a priori estimate of the distribution needed.
Slow mixing of the full chain is no longer an obstacle to the cost guarantee: the distributions on which the chain mixes arbitrarily slowly are precisely handled because their unmixed tails are cheap.
The guarantee is time-uniform: by the Markov property the same bound holds at every $t \geq n^{29}$, not just at one checkpoint.
The result upgrades the earlier 'eventually at most OPT + 1' stationarity theorem to 'at most OPT + 1250 within polynomial time', confirming the conjecture attached to that theorem.
All constants in the proof are explicit, so the bound OPT + 1250 at $t \geq n^{29}$ is a fully quantitative claim about the transposition rule, not an asymptotic existence statement.
The paper declares the exponent 29 and the constant 1250 deliberately unoptimized; counting the polynomial factors in the proof — the $n^4$ exclusion mixing time, an $n^2$ comparison factor, and an $n^5$ Dirichlet-form factor against a $t^{-1/4}$ decay — suggests the real cost-stabilization threshold may be orders of magnitude smaller, and that OPT + O(1) may hold at $t = n^{O(1)}$ with exponent f
Because the adaptive buffer simply discards the slow-mixing tail, the argument suggests a transferable principle: for any data structure whose cost objective is concentrated on the high-probability items, polynomial mixing of the heavy subset might suffice for near-optimal cost, even if the full state space mixes arbitrarily slowly.
The same threshold-integral machinery could plausibly be aimed at other update rules, such as move-to-front, or at non-IID request streams, since nothing in the decomposition uses the one-position-forward update except the stationary measure and the comparison paths; this is a natural test of the method's scope, not something the paper claims.
A concrete experiment worth running is on the distribution $p_i \propto e^{-i/\sqrt{n}}$ that the development singled out as difficult: measuring the time at which expected excess cost first drops below a fixed constant would calibrate how much slack the $n^{29}$ bound carries, and the proof's structure predicts the observed threshold would be far smaller.
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
In the classical list update problem, a set of items must be stored in a list-type structure, where accessing the i-th element costs i. Items will be queried in an IID manner according to some probability distribution p on the items. We want to minimize the expected cost of each query. The optimal order is to place the items in decreasing order of probability p1 ≥ p2 ≥ ⋯ with expected cost OPT = ∑jjpj, but the probability vector p is generally unknown. Thus we use a self-organizing list following the transposition rule: an item is transposed 1 position forward whenever it is queried. Coester (2026) proved that, at stationarity measure for the transposition rule, the expected cost of a query is at most OPT + 1. However, this Markov chain may have arbitrarily slow mixing time. We prove that, for arbitrary p and arbitrary initial orderings σ, after polynomially many queries in the number of items, the expected cost of a query is at most OPT + O(1).
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-09-24
The authors' main claim, as the classifier picked it out 1.00
“We prove that, for arbitrary $p$ and arbitrary initial orderings $\sigma$, after polynomially many queries in the number of items, the expected cost of a query is at most $\mathsf{OPT} + O(1)$.”
How the main claim is stated: asserted 1.00
What the abstract itself states, as probabilities: claims first 0.07 · states limitation 0.19 · human participants 0.02 · controlled comparison 0.14 · randomized assignment 0.03 · states quantitative result 0.98 · compares with prior results 0.95 · 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 |
|---|---|---|---|---|
| In the classical list update problem, a set of items must be stored in a list-type structure, where accessing the $i$-th element costs $i$. | background 1.00 | 0.04 | 0.01 | asserted 1.00 |
| Items will be queried in an IID manner according to some probability distribution $p$ on the items. | background 0.99 | 0.07 | 0.01 | asserted 0.99 |
| We want to minimize the expected cost of each query. | background 1.00 | 0.07 | 0.02 | asserted 0.82 |
| The optimal order is to place the items in decreasing order of probability $p_1 \geq p_2 \geq \cdots$ with expected cost $\mathsf{OPT} = \sum_j j p_j$, but the probability vector $p$ is generally unknown. | background 0.88 | 0.09 | 0.03 | asserted 1.00 |
| Thus we use a self-organizing list following the transposition rule: an item is transposed 1 position forward whenever it is queried. | method 0.82 | 0.09 | 0.03 | asserted 0.95 |
| Coester (2026) proved that, at stationarity measure for the transposition rule, the expected cost of a query is at most $\mathsf{OPT} + 1$. | background 0.96 | 0.03 | 0.06 | asserted 1.00 |
| However, this Markov chain may have arbitrarily slow mixing time. | gap 0.82 | 0.08 | 0.02 | hedged possibility 0.95 |
| We prove that, for arbitrary $p$ and arbitrary initial orderings $\sigma$, after polynomially many queries in the number of items, the expected cost of a query is at most $\mathsf{OPT} + O(1)$. | result 0.89 | 0.96 | 0.95 | asserted 1.00 |
What kind of paper the classifier reports this is: theoretical result 1.00 · evidence from proof or derivation 1.00
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-09-24: 1 request, 6,320 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
References (16)
- [7] Indyk, Piotr and Quaye, Isabelle and Rubinfeld, Ronitt and Silwal, Sandeep , title=. Proceedings of the 36th International Conference on Algorithmic Learning Theory , series=. 2025 , url= on Pith
- [1] Coester, Christian , note=. Transposition is Nearly Optimal for. 2026 , doi= on Pith
- [2] McCabe, John , title=. Operations Research , volume=. 1965 , doi= on Pith
- [3] Rivest, Ronald L. , title=. Communications of the ACM , volume=. 1976 , doi= on Pith
- [4] Anderson, E. J. and Nash, P. and Weber, R. R. , title=. Journal of Applied Probability , volume=. 1982 , doi= on Pith
- [5] Bitner, James R. , title=. SIAM Journal on Computing , volume=. 1979 , doi= on Pith
- [6] Sleator, Daniel D. and Tarjan, Robert E. , title=. Communications of the ACM , volume=. 1985 , doi= on Pith
- [8] Haddadan, Shahrzad and Winkler, Peter , title=. Theory of Computing Systems , volume=. 2019 , doi= on Pith
- [9] Benjamini, Itai and Berger, Noam and Hoffman, Christopher and Mossel, Elchanan , title=. Transactions of the American Mathematical Society , volume=. 2005 , doi= on Pith
- [10] Wilson, David Bruce , title=. The Annals of Applied Probability , volume=. 2004 , doi= on Pith
- [11] Levin, David A. and Peres, Yuval , title=. Journal of Statistical Physics , volume=. 2016 , doi= on Pith
- [12] Gheissari, Reza and Lee, Holden and Vigoda, Eric , title=. Proceedings of the 58th Annual ACM Symposium on Theory of Computing , series=. 2026 , doi= on Pith
- [13] Diaconis, Persi and Saloff-Coste, Laurent , title =. The Annals of Applied Probability , volume =. 1993 , doi = on Pith
- [14] A transposition rule analysis based on a particle process , author=. Journal of Applied Probability , volume=. 2005 , publisher= on Pith
- [15] Makjamroen, Thanet , title =. Acta Cybernetica , volume=. 1992 , publisher= on Pith
- [16] Liu, Kuikui and Mohanty, Sidhanth and Raghavendra, Prasad and Rajaraman, Amit and Wu, David X. , booktitle=. Locally stationary distributions: A framework for analyzing slow-mixing. 2024 , organization= on Pith
Cited by 1 Pith paper
Reviewed papers on Pith that cite this one. The full citation record
- List Update with Time Windows and Delays without Batch-Serving cs.DS · Nov 2026
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