Pith. sign in

REVIEW 3 major objections 1 minor 27 references

Simultaneous Rational Function Codes: Improved Analysis Beyond Half the Minimum Distance with Multiplicities and Poles

T0 review · 3 major / 1 minor · reviewed 2026-08-05 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read This paper claims rigorous failure-probability bounds for decoding simultaneous rational function codes with multiplicities and poles, improving earlier results and extending them to the hybrid error model.

desk verdict The submitted manuscript's full text is an unrelated CS-education survey, so the coding-theory claims in the abstract have no supporting content; this needs to be sent back, not peer-reviewed. read the letter →

arxiv 2508.05284 v1 pith:N7YNXM5R submitted 2025-08-07 cs.IT cs.SCmath.IT

Matteo Abbondati , Eleonora Guerrini , Romain Lebreton This is my paper
classification cs.ITcs.SCmath.IT MSC 94B3594B65
keywords simultaneousrationalfunctioncodesmultiplicitiespoleshybriderrormodelfailureprobabilitydecodingerror-correcting
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper is about error-correcting codes built from simultaneous rational functions — vectors of rational functions evaluated at sample points. It extends a previous decoding analysis to two harder settings: evaluations taken with multiplicities (multi-precision), and rational functions that may have poles at the evaluation points. Using the hybrid error model, in which errors are split into a random part and an adversarial part, the authors derive bounds on the probability that the decoder fails to reconstruct the transmitted message. The claim is that these bounds are rigorous, generalize earlier results, and in some cases improve on them, reaching beyond the classical half-the-minimum-distance correction radius. If correct, the result would give tighter guarantees for rational-function codes in settings where not all noise is random.

What carries the argument

The central object is the simultaneous rational function code together with its decoding algorithm, analyzed as a probabilistic reconstruction problem. The key mechanism is the hybrid error model from Guerrini et al. (2023), which partitions error positions into a random subset and an adversarial subset; the analysis tracks how the failure event survives or fails under this split. The extension to multiplicities uses evaluation with multi-precision, and the pole scenario treats zeros of denominators as part of the code's evaluation structure. These are combined into a proof that bounds the reconstruction failure probability.

What would settle it

Take a concrete simultaneous rational function code with prescribed multiplicities and pole locations, simulate the decoding algorithm under the hybrid error model over many random error splits, and compare the empirical failure frequency with the paper's claimed bound; if any configuration's failure frequency significantly exceeds the bound, the analysis is falsified.

Watch

Extended reading notes

Core claim

The central discovery is that the decoding failure probability for simultaneous rational function codes can be analyzed rigorously and tightly when evaluations are taken with multiplicities and when the rational functions are allowed to have poles, provided the error pattern is modeled as a hybrid of random and adversarial errors. The analysis covers the pole scenario within multiplicities, meaning the denominator zeros of the rational functions are treated directly rather than excluded. It generalizes and improves previous failure-probability bounds, and the improvement is said to hold beyond half the minimum distance — that is, the decoder corrects more errors than the classical unique-dec

Load-bearing premise

The entire analysis relies on the hybrid error model's assumption that an error pattern can be split into an independent random component and a bounded adversarial component; if real error patterns do not admit such a split, the claimed failure-probability bounds do not follow.

Editorial extensions

If this is right

  • The decoder's failure probability bounds now apply to rational codes with multiplicities, which include many interpolation-based code constructions.
  • Under the hybrid model, the bounds hold when some errors are adversarial rather than all random, widening the practical error patterns the code is guaranteed against.
  • The pole scenario shows that rational functions with denominator zeros can be decoded with the same kind of guarantee, removing a previous restriction.
  • The improvement beyond half the minimum distance suggests the decoder corrects more errors than the classical unique-decoding radius while keeping failure probability provably small.
  • These results generalize the earlier analysis of Abbondati et al. (2024) and the hybrid model of Guerrini et al. (2023), giving a unified probabilistic treatment of multiplicities and poles.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The technique likely transfers to other evaluation-based code families, such as algebraic-geometric or folded codes, which also rely on multiplicity evaluations; one could test whether the same failure-bound method gives beyond-half-distance guarantees there.
  • In a practical channel with a known mix of random bit errors and adversarial bursts, the hybrid-model bound could be inverted to choose code parameters that meet a target failure probability, trading off random-error rate against adversarial-error count.
  • The pole handling suggests a way to treat rational interpolation where the target function has poles at known sample points; the failure analysis may extend to decoding of rational-rate codes in network coding scenarios.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 1 minor

Summary. The abstract of arXiv:2508.05284 claims a rigorous analysis of the failure probability of decoding simultaneous rational function codes with multiplicities and poles, building on Abbondati et al. (2024) and the hybrid error model of Guerrini et al. (2023), with claimed improvements over prior results. The full text supplied, however, is a completely different manuscript: a large-scale computer science education survey by Dzialets et al., submitted to ACM ICER 2025. None of the coding-theory concepts named in the abstract—simultaneous rational function codes, multiplicities, poles, hybrid error model, failure probability—appear anywhere in the body. There are no definitions, theorem statements, proofs, equations, or simulations matching the abstract's claims.

Significance. If the abstract's claims were established, they would potentially tighten error-correction guarantees for rational function codes and extend them to hybrid error models. However, the submitted manuscript contains none of the claimed technical content. The significance of the claimed results therefore cannot be assessed from this submission. The manuscript also provides no accompanying code, machine-checked proofs, or detailed derivations that would allow independent verification. In its current form, the submission is not a coding-theory paper, and its abstract-level claims are entirely unsupported.

major comments (3)
  1. [Full text (entire body)] The body of the manuscript is a CS-education survey titled 'Everything You Need to Know About CS Education: Open Results from a Survey of More Than 18,000 Participants' by Dzialets et al. It contains no treatment of simultaneous rational function codes, multiplicities, poles, decoding algorithms, or failure probabilities. The central claim of the abstract—a rigorous analysis of the decoding algorithm's failure probability—is therefore unsupported by any definitions, lemmas, or proofs. This is a load-bearing mismatch: the reviewed object does not contain the research described in the abstract.
  2. [References and related work] The abstract cites Abbondati et al. (2024) and Guerrini et al. (2023) as foundations of the claimed work. The full text's bibliography is entirely in the CS-education literature, with no references to coding theory, rational function codes, or hybrid error models. Thus the claimed connections to prior work cannot be checked, and the premise that this paper extends those results is unverified.
  3. [Abstract vs. author and title metadata] The arXiv metadata lists a coding-theory title and (implicitly) corresponding authors, while the full text is by Dzialets, Makeeva, Vlasov, Potriasaeva, Rostovskii, Golubev, and Birillo. The mismatch between the advertised subject and the actual content is not a local presentation issue; it affects the identity of the submission and prevents any meaningful technical evaluation.
minor comments (1)
  1. [General] The abstract and full text are inconsistent in topic, authors, and references. If this is a submission error, the correct PDF should be deposited; otherwise the abstract must be rewritten to describe the actual CS-education content.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity identifiable; manuscript body is unrelated to abstract.

full rationale

The supplied full text is a completely different paper: it is a CS education survey by Dzialets et al., with the arXiv stamp 'arXiv:2508.05286v1 [cs.CY] 7 Aug 2025' at the end, whereas the abstract under review is for arXiv:2508.05284 (cs.IT) on simultaneous rational function codes. The body contains none of the abstract's key terms — 'simultaneous rational function codes,' 'hybrid error model,' 'multiplicities,' 'poles,' 'failure probability' — and no definitions, algorithms, lemmas, or proofs related to the claimed derivation. Consequently, there is no derivation chain to audit for circularity. The abstract's self-references (Abbondati et al. 2024; Guerrini et al. 2023) cannot be evaluated as load-bearing without the missing theoretical content. This is a manuscript integrity/completeness issue, not a circularity issue. Per the hard rule requiring quoted reductions, no circular step can be identified. Score 0.

Assumptions & free parameters 0 free parameters · 1 assumptions · 0 invented entities

From the abstract alone, the only identifiable load-bearing assumption is the applicability of the prior hybrid model. No free parameters or invented entities can be enumerated because the actual derivation is not present.

assumptions (1)
  • domain assumption The hybrid model of Guerrini et al. (2023) applies to the error scenarios with multiplicities and poles.
    Invoked in the abstract where the approach is extended 'using the hybrid model from Guerrini et al. (2023)'.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Simultaneous Rational Function Codes: Improved Analysis Beyond Half the Minimum Distance with Multiplicities and Poles." pith.science (2026). https://pith.science/paper/N7YNXM5R

@misc{pith2026250805284,
  author       = {Pith},
  title        = {Pith review of: Simultaneous Rational Function Codes: Improved Analysis Beyond Half the Minimum Distance with Multiplicities and Poles},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/N7YNXM5R}},
  note         = {Machine review of arXiv:2508.05284}
}
read the original abstract

In this paper, we extend the work of Abbondati et al. (2024) on decoding simultaneous rational function codes by addressing two important scenarios: multiplicities and poles (zeros of denominators). First, we generalize previous results to rational codes with multiplicities by considering evaluations with multi-precision. Then, using the hybrid model from Guerrini et al. (2023), we extend our approach to vectors of rational functions that may present poles. Our contributions include: a rigorous analysis of the decoding algorithm's failure probability that generalizes and improves several previous results, an extension to a hybrid model handling situations where not all errors can be assumed random, and a new improved analysis in the more general context handling poles within multiplicities. The theoretical results provide a comprehensive probabilistic analysis of reconstruction failure in these more complex scenarios, advancing the state of the art in error correction for rational function codes.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

27 extracted references · 27 canonical work pages

  1. [1]

    Probabilistic analysis of LLL -based decoder of interleaved C hinese remainder codes

    Matteo Abbondati, Antoine Afflatet, Eleonora Guerrini, and Romain Lebreton. Probabilistic analysis of LLL -based decoder of interleaved C hinese remainder codes. In ITW 2023-IEEE Information Theory Workshop , 2023

    work page 2023

  2. [2]

    Decoding simultaneous rational evaluation codes

    Matteo Abbondati, Eleonora Guerrini, and Romain Lebreton. Decoding simultaneous rational evaluation codes. In Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation , pages 153--161, 2024

    work page 2024

  3. [3]

    Simultaneous Rational Number Codes: Decoding Beyond Half the Minimum Distance with Multiplicities and Bad Primes

    Matteo Abbondati, Eleonora Guerrini, and Romain Lebreton. Simultaneous rational number codes: Decoding beyond half the minimum distance with multiplicities and bad primes. arXiv preprint arXiv:2504.08472 , 2025

    work page Pith review arXiv 2025

  4. [4]

    Unique Decoding of Reed-Solomon and Related Codes for Semi-Adversarial Errors

    Joshua Brakensiek, Yeyuan Chen, Manik Dhar, and Zihan Zhang. Unique decoding of reed-solomon and related codes for semi-adversarial errors. arXiv preprint arXiv:2504.10399 , 2025

    work page Pith review arXiv 2025

  5. [5]

    Numerical linear system solving with parametric entries by error correction

    Brice Boyer and Erich L Kaltofen. Numerical linear system solving with parametric entries by error correction. In Proceedings of the 2014 Symposium on Symbolic-Numeric Computation , pages 33--38, 2014

    work page 2014

  6. [6]

    Decoding of interleaved R eed S olomon codes over noisy data

    Daniel Bleichenbacher, Aggelos Kiayias, and Moti Yung. Decoding of interleaved R eed S olomon codes over noisy data. In Automata, Languages and Programming: 30th International Colloquium, ICALP 2003 Eindhoven, The Netherlands, June 30--July 4, 2003 Proceedings 30 , pages 97--108. Springer, 2003

    work page 2003

  7. [7]

    Exact solution of linear equations

    Stanley Cabay. Exact solution of linear equations. In Proceedings of the second ACM symposium on Symbolic and algebraic manipulation , pages 392--398, 1971

    work page 1971

  8. [8]

    The multiple subset sum problem

    Alberto Caprara, Hans Kellerer, and Ulrich Pferschy. The multiple subset sum problem. SIAM Journal on Optimization , 11(2):308--319, 2000

    work page 2000

Show all 27 references
  1. [9]

    John D. Dixon. Exact solution of linear equations usingP -adic expansions. Numerische Mathematik , 40(1):137--141, February 1982

    1982

  2. [10]

    Simultaneous rational function reconstruction with errors: Handling multiplicities and poles

    Eleonora Guerrini, Kamel Lairedj, Romain Lebreton, and Ilaria Zappatore. Simultaneous rational function reconstruction with errors: Handling multiplicities and poles. Journal of Symbolic Computation , 116:345--364, 2023

    2023

  3. [11]

    Polynomial linear system solving with errors by simultaneous polynomial reconstruction of interleaved R eed- S olomon codes

    Eleonora Guerrini, Romain Lebreton, and Ilaria Zappatore. Polynomial linear system solving with errors by simultaneous polynomial reconstruction of interleaved R eed- S olomon codes. In 2019 IEEE International Symposium on Information Theory (ISIT) , pages 1542--1546. IEEE, 2019

    2019

  4. [12]

    Early termination in parametric linear system solving and rational function vector recovery with error correction

    Erich L Kaltofen, Cl \'e ment Pernet, Arne Storjohann, and Cleveland Waddell. Early termination in parametric linear system solving and rational function vector recovery with error correction. In Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic ...

    2017

  5. [13]

    Hermite rational function interpolation with error correction

    Erich L Kaltofen, Cl \'e ment Pernet, and Zhi-Hong Yang. Hermite rational function interpolation with error correction. In Computer Algebra in Scientific Computing: 22nd International Workshop, CASC 2020, Linz, Austria, September 14--18, 2020, Proceedings 22 , pages 335--357. ...

    2020

  6. [14]

    Contributions à l'algorithmique détendue et à la résolution des systèmes polynomiaux

    Romain Lebreton. Contributions à l'algorithmique détendue et à la résolution des systèmes polynomiaux . These de doctorat, Palaiseau, Ecole polytechnique, January 2012

    2012

  7. [15]

    Chinese remainder and interpolation algorithms

    John D Lipson. Chinese remainder and interpolation algorithms. In Proceedings of the second ACM symposium on Symbolic and algebraic manipulation , pages 372--391, 1971

    1971

  8. [16]

    On decoding interleaved C hinese remainder codes

    Wenhui Li, Vladimir Sidorenko, and Johan SR Nielsen. On decoding interleaved C hinese remainder codes. In 2013 IEEE International Symposium on Information Theory , pages 1052--1056. IEEE, 2013

    2013

  9. [17]

    R. T. Moenck and J. H. Carter. Approximate algorithms to derive exact solutions to systems of linear equations. In EUROSAM '79 , volume 72, pages 65--73. Springer, 1979

    1979

  10. [18]

    The exact solution of linear equations with rational function coefficients

    Michael T McClellan. The exact solution of linear equations with rational function coefficients. ACM Transactions on Mathematical Software (TOMS) , 3(1):1--25, 1977

    1977

  11. [19]

    Maximal quotient rational reconstruction: an almost optimal algorithm for rational reconstruction

    Michael Monagan. Maximal quotient rational reconstruction: an almost optimal algorithm for rational reconstruction. In Proceedings of the 2004 international symposium on Symbolic and algebraic computation , pages 243--249, 2004

    2004

  12. [20]

    The vector rational function reconstruction problem

    Zach Olesh and Arne Storjohann. The vector rational function reconstruction problem. In Computer Algebra 2006: Latest Advances in Symbolic Algorithms , pages 137--149. World Scientific, 2007

    2006

  13. [21]

    High performance and reliable algebraic computing

    Cl \'e ment Pernet. High performance and reliable algebraic computing . PhD thesis, Universit \'e Joseph Fourier, Grenoble 1, 2014

    2014

  14. [22]

    Polynomial codes over certain finite fields

    Irving S Reed and Gustave Solomon. Polynomial codes over certain finite fields. Journal of the society for industrial and applied mathematics , 8(2):300--304, 1960

    1960

  15. [23]

    Algorithms for simultaneous P ad \'e approximations

    Johan Rosenkilde n \'e Nielsen and Arne Storjohann. Algorithms for simultaneous P ad \'e approximations. In Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation , pages 405--412, 2016

    2016

  16. [24]

    Collaborative decoding of interleaved R eed-- S olomon codes and concatenated code designs

    Georg Schmidt, Vladimir R Sidorenko, and Martin Bossert. Collaborative decoding of interleaved R eed-- S olomon codes and concatenated code designs. IEEE Transactions on Information Theory , 55(7):2991--3012, 2009

    2009

  17. [25]

    The shifted number system for fast linear algebra on integer matrices

    Arne Storjohann. The shifted number system for fast linear algebra on integer matrices. Journal of Complexity , 21(4):609--650, August 2005

    2005

  18. [26]

    A study of C oppersmith's block W iedemann algorithm using matrix polynomials

    Gilles Villard. A study of C oppersmith's block W iedemann algorithm using matrix polynomials. Technical report, IMAG, 1997

    1997

  19. [27]

    Simultaneous Rational Function Reconstruction and applications to Algebraic Coding Theory

    Ilaria Zappatore. Simultaneous Rational Function Reconstruction and applications to Algebraic Coding Theory . PhD thesis, Universit \'e Montpellier, 2020

    2020

Pith tools

Reviewed August 5, 2026 · model on record in the stance chip above.