{"id":"830459df-c08a-4557-a66f-1197e1f8a46c","arxiv_id":"2508.07487","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":6.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":3,"one_line_summary":"The paper introduces structured, subblock-based autoencoder codes for unequal error protection that reportedly beat randomized superposition coding with successive interference cancellation at intermediate blocklengths.","lead":"An autoencoder-based scheme is proposed for unequal error protection, where important message bits get higher reliability at intermediate blocklengths. It splits encoding and decoding into smaller subblocks, and the authors report gains over a known superposition-coding bound.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Numerical comparison against the [8] achievability bound is unverifiable: the central claim depends on matching rate, SNR, blocklength, and decoding order, none of which are shown in the provided text.","rationale":"I read the abstract and Section I. The paper proposes a structured AE UEP code with SIC decoding and claims numerical improvement over a theoretical achievability bound from [8]. The most load-bearing concern is not the subblock architecture itself but the validity of the benchmark comparison: achievability bounds are loose, and an optimized trained code can beat them without fundamentally expanding the achievable region. The provided text contains no numerical section, so the comparison cannot be checked. This aligns with the reader's secondary note about the [8] benchmark, though the reader's primary weakest assumption was about subblock decomposition preserving the error region. My concern is narrower and more central to the empirical claim. I agree with the UNVERDICTED verdict because the central claim is unsupported by the visible material; I do not see a reason to move to reject given the absence of evidence. The proposed concrete test would settle whether the comparison is fair and whether the claim should stand.","tokens_in":2153,"tokens_out":5356,"duration_ms":60135,"concrete_test":"From the full text, extract the exact parameters used to compute the [8] bound (blocklength, rate vector, Eb/N0, segment lengths) and the parameters used for AE training/evaluation. Re-implement the [8] achievability bound to reproduce its predicted error probability region, then overlay the AE's reported error pairs at the same operating point. If the AE pairs lie outside the bound's region with parameters matched, the claim holds; if parameters differ or the pairs fall inside the bound, the claim fails.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim (abstract and Section I) is that the structured AE UEP code 'outperforms randomized superposition coding-based UEP schemes with SIC decoding [8], expanding the achievable error probability region.' The only support offered is 'numerical results,' but the supplied full text contains no methods, simulation setup, error curves, or training details. For this claim to be load-bearing, the AE evaluation must be compared with the [8] bound at identical system parameters: the same blocklength n, the same overall rate, the same Eb/N0, the same message segment lengths, and the same SIC decoding order. If the AE is trained at a higher SNR or uses a lower effective rate, the reported improvement is an artifact. Moreover, because [8] is an achievability (inner) bound, a trained code can often beat it; 'expanding the achievable region' then reflects looseness of the bound, not a fundamental advance. Without the numerical section, the fairness of the benchmark cannot be checked, so the empirical claim is unsupported by the visible evidence.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The manuscript proposes a structured autoencoder (AE) architecture for bit-wise unequal error protection (UEP) at intermediate blocklengths. The central architectural idea is to decompose encoding and decoding into smaller AE subblocks transmitted as a superposition and decoded with successive interference cancellation, using a compound loss introduced in the authors' prior work. The abstract and introduction claim that this approach outperforms the randomized superposition coding achievability bound of [8] at intermediate blocklengths, while remaining trainable. The text supplied for review contains only the abstract, introduction, and notation conventions; no model definition, training details, simulation setup, numerical tables, or error-probability curves are present.","tokens_in":2415,"tokens_out":4199,"duration_ms":56568,"significance":"If the numerical claim holds, the paper would offer a practical learned UEP design that scales to intermediate blocklengths and can be benchmarked against information-theoretic bounds. The conceptual link between superposition coding, SIC decoding, and structured AEs is plausible and relevant. However, as submitted, the visible text provides no reproducible artifacts, no falsifiable numerical predictions, and no derivations beyond notation. The significance of the claimed improvement depends entirely on the fairness of the comparison with [8] and on the precise system parameters, none of which can be checked. The contribution is therefore currently not assessable.","major_comments":[{"comment":"The central claim that the proposed approach 'improves over established achievability bounds' is supported only by the phrase 'Numerical results show...' No numerical results are included anywhere in the visible text. I cannot verify that the data support the claim. A complete experimental section is required, including error-probability curves for each UEP message class, the selected blocklength n, overall code rate, SNR/Eb/N0 values, segment lengths, and training hyperparameters.","section":"Abstract; Section I, paragraph 4"},{"comment":"The comparison against [8] is an achievability (inner) bound. For the claimed improvement to be meaningful, the learned code and the bound must be evaluated at the same blocklength, overall rate, SNR, message segment lengths, channel model, and SIC decoding order; none of these are stated. Moreover, a trained code beating an inner bound may simply reflect looseness of that bound, not an expansion of the fundamental achievable region. The paper should clarify how much of the gain is due to bound looseness and should report the corresponding converse or normal approximation wherever available.","section":"Section I, paragraph 4"},{"comment":"The proposed method is only described qualitatively. 'Structuring encoding and decoding into smaller AE subblocks' is not defined: no equations for the encoder/decoder structure, no description of the constituent AE architectures, no definition of the superposition operation, and no expression for the compound loss function 'originally introduced in [12]'. The training procedure, including how SIC is executed inside the learned decoder and how the reliability classes are balanced, is absent. Without these details, the scalability claim and the reported trade-off cannot be reproduced or evaluated.","section":"Section I, paragraphs 3-5"}],"minor_comments":[{"comment":"The mathematical notation is garbled in the rendering, e.g., 'γ� 0' and 'x� 0 � y'. The authors should resubmit a cleanly compiled version and check the integral and Q-function definitions.","section":"Section I, notation"},{"comment":"The term 'intermediate blocklengths' is never quantified. The reader needs a concrete range of n, or at least the values used in the numerical experiments, to assess the scalability claim.","section":"Section I, first paragraph"},{"comment":"The statement that capacity with SNR γ = Eb/N0 is C(γ) = 1/2 ln(1+γ) conflates Eb/N0 with the SNR per real channel use. This relation should be clarified, especially because the numerical comparison with [8] will depend on how rate, energy per bit, and noise variance are normalized.","section":"Section I, notation"},{"comment":"The assertion that larger blocklengths demand 'models of exponential complexity' should be supported by a precise statement or reference; as written it is too broad and could be misleading.","section":"Section I, first paragraph"}],"recommendation":"major_revision","confidential_remarks":"To the editor: the visible submission is an extended abstract at most; there is no methods section, no results section, and no simulation details. If this is the complete manuscript, it is not reviewable in its current form. I recommend requiring the authors to submit the full paper with the experimental section before assigning it to a referee, rather than judging the present text on its merits."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: the architecture proposal is reasonable, but the portion you sent only has the abstract and intro, so the advertised gain over the [8] achievability bound is a promise, not a result. I'd still send it to referees, because the idea is plausible and, if true, useful.\n\nWhat's new: the paper splits encoding/decoding into small AE subblocks arranged as a superposition code with SIC, which is a clean way to dodge the exponential complexity of single-AE UEP codes at intermediate blocklengths. That's a real engineering step beyond [11] and [12]. The compound loss is borrowed from their own earlier work, but that's fine; the new part is the structure.\n\nThe soft spot is the evaluation claim. The abstract says numerical results show improvement over achievability bounds, but we see no numbers, training details, or even the benchmark setup. The stress-test note is right: beating an achievability (inner) bound can just mean the bound is loose, not that the code is fundamentally better. A good referee will want to see the same n, rate, Eb/N0, message lengths, and SIC order in both the AE and the bound. If that's missing, the paper's main claim collapses. That said, it's missing from what we saw; the full paper may include it. I'm not calling it a flaw yet, just an unverified claim.\n\nAlso, 'expanding the achievable error probability region' is strong language. If you beat a specific inner bound, you have a better code, not necessarily a larger region in the asymptotic sense. The authors should either temper that or give the matched error curves.\n\nOverall: the paper looks like it's written by people who know the area and cite the right prior work. The idea deserves scrutiny, not dismissal. I'd send it to reviewers who know both learned codes and finite-blocklength bounds and ask them to check the simulation fairness and whether the subblock decomposition loses any UEP trade-offs.\n\nReading group: maybe, if we want to argue about whether the benchmark is fair.","headline":"The structured subblock idea is a sensible answer to the AE scalability problem, but the headline numerical claim is unverifiable from the text we got.","tokens_in":2895,"tokens_out":1943,"would_cite":false,"duration_ms":22772,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"Structured autoencoder subblocks push learned UEP codes past randomized superposition achievability bounds at intermediate blocklengths.","keywords":["autoencoder","unequal error protection","superposition coding","successive interference cancellation","finite blocklength","learned communication codes","Gaussian channel","achievable error region"],"falsifier":"Run the proposed structured AE UEP design and the randomized superposition UEP scheme from [8] at the same rates, blocklength, and SNR, and compare each message segment's error probability. If the structured design's error-probability region does not contain the bound from [8] across the reported blocklength range, the central claim fails. A monolithic AE with matched parameters achieving the same region at the same blocklength would also show the subblock decomposition is unnecessary.","tokens_in":2042,"feed_emoji":"📡","tokens_out":3885,"duration_ms":44745,"temperature":0.7,"pith_summary":"This paper proposes a way to design unequal error protection (UEP) codes—codes that give different reliability to different parts of a message—using autoencoders at blocklengths that were previously too large for learned coding. The method splits encoding and decoding into small autoencoder subblocks, transmits them as a superposition, and cancels interference successively at the receiver. The authors claim this structured design reaches error-probability regions beyond the established achievability bounds for randomized superposition UEP schemes with SIC decoding, while keeping training tractable. If true, it makes learned UEP coding a practical option for intermediate blocklengths and for systems like 5G/6G that need differentiated reliability.","feed_headline":"Autoencoder subblocks beat UEP coding bounds","feed_subtitle":"By splitting codes into small autoencoder subblocks, learned UEP codes scale and outperform randomized superposition bounds.","key_machinery":"The central mechanism is a structured UEP encoding/decoding process: instead of one large autoencoder, the code is organized into a set of smaller constituent autoencoder subblocks, whose outputs are superposed and decoded via successive interference cancellation. A compound loss function tunes the trade-off between reliability classes. This decomposition is what keeps training feasible and allows benchmarking against theoretical finite-blocklength bounds.","core_discovery":"The paper claims that structuring an autoencoder-based UEP code as a superposition of smaller constituent AE subblocks, decoded with successive interference cancellation, expands the achievable error-probability region compared with randomized superposition coding-based UEP schemes with SIC decoding. The authors report numerical results showing that the proposed approach improves over the established achievability bound, while avoiding the exponential complexity that makes monolithic AE designs impractical at intermediate blocklengths. The design also incorporates a compound loss function to fine-tune the reliability trade-off between different bit classes.","pith_inferences":["The subblock decomposition idea may transfer to other learned code families, including equal-error-protection codes, because the complexity bottleneck it removes is generic.","If the comparison were extended to converse bounds as well as achievability bounds, the results could show whether structured learned codes are closer to fundamental limits than random superposition codes.","Testing on fading or non-Gaussian channels would clarify whether the reported gains depend on the superposition-SIC structure itself or on the Gaussian channel assumption."],"forward_implications":["AE-based UEP codes can be extended to substantially larger blocklengths without the exponential complexity of a monolithic autoencoder.","The achievable error-probability region for learned UEP codes can dominate the randomized superposition coding bound under SIC decoding at intermediate blocklengths.","Reliability trade-offs between message segments can be fine-tuned by adjusting subblock composition and the compound loss weights.","The approach offers a scalable learned alternative for UEP regimes relevant to 5G/6G services such as URLLC and eMBB."],"supporting_citations":[{"why":"Provides the randomized superposition coding-based UEP achievability bound that the proposed method numerically improves upon.","marker":"[8]"},{"why":"Introduces the compound loss function used to optimize the trade-off between reliability classes.","marker":"[12]"},{"why":"Establishes the superposition of random Gaussian codes as an earlier UEP scheme that the cited bounds surpass.","marker":"[10]"},{"why":"Prior AE-based UEP work by the authors that the structured design extends to larger blocklengths.","marker":"[11]"},{"why":"Identifies the curse of dimensionality that makes monolithic AE training impractical at intermediate and long blocklengths.","marker":"[5]"},{"why":"Defines the bit-wise UEP setting and its error-probability region framework used in the paper.","marker":"[6]"}],"fun_headline_variants":["Structured autoencoders push UEP codes past bounds","Subblock autoencoders outdo UEP achievability limits","Scalable learned UEP codes beat random superposition","Splitting AEs yields better UEP at mid blocklengths","Superposed autoencoder subblocks lift UEP performance"],"cache_read_input_tokens":2816,"weakest_assumption_plain":"The approach assumes that splitting a UEP code into small independent autoencoder subblocks, superposing them, and decoding by successive interference cancellation preserves the reliability region that a single monolithic or theoretical superposition code could achieve; if inter-subblock interference is not cancelled well enough, or the split restricts the trade-off, the reported gain over the bound will not generalize.","fun_headline_variants_meta":{"raw":{"variants":["Structured autoencoders push UEP codes past bounds","Subblock autoencoders outdo UEP achievability limits","Scalable learned UEP codes beat random superposition","Splitting AEs yields better UEP at mid blocklengths","Superposed autoencoder subblocks lift UEP performance"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000554,"raw_usage":{"total_tokens":2438,"prompt_tokens":668,"completion_tokens":1770,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":412,"completion_tokens_details":{"reasoning_tokens":1697}},"tokens_in":412,"tokens_out":1770,"duration_ms":13365,"temperature":1.0,"reasoning_tokens":1697,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-05T22:04:41.283855+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run the proposed structured AE UEP design and the randomized superposition UEP scheme from [8] at the same rates, blocklength, and SNR, and compare each message segment's error probability. If the structured design's error-probability region does not contain the bound from [8] across the reported blocklength range, the central claim fails. A monolithic AE with matched parameters achieving the same region at the same blocklength would also show the subblock decomposition is unnecessary.","supporting_citations":[{"cited_title":"A Finite Blocklength Analysis of Unequal Bit Protection for the AWGN Channel,","cited_arxiv_id":null,"evidence_quote":"Provides the randomized superposition coding-based UEP achievability bound that the proposed method numerically improves upon."},{"cited_title":"Autoencoder-Based Unequal Error Protection Codes,","cited_arxiv_id":null,"evidence_quote":"Introduces the compound loss function used to optimize the trade-off between reliability classes."},{"cited_title":"Karimzadeh and M","cited_arxiv_id":null,"evidence_quote":"Establishes the superposition of random Gaussian codes as an earlier UEP scheme that the cited bounds surpass."},{"cited_title":"A Weighted Autoencoder-Based Approach to Downlink NOMA Constellation Design,","cited_arxiv_id":null,"evidence_quote":"Prior AE-based UEP work by the authors that the structured design extends to larger blocklengths."},{"cited_title":"Neural Belief Propagation Auto-Encoder for Linear Block Code Design,","cited_arxiv_id":null,"evidence_quote":"Identifies the curse of dimensionality that makes monolithic AE training impractical at intermediate and long blocklengths."},{"cited_title":"Borade, B","cited_arxiv_id":null,"evidence_quote":"Defines the bit-wise UEP setting and its error-probability region framework used in the paper."}],"review_version":1}