{"id":"f549b401-23a4-4b31-b7a2-c48cd5d6c94a","arxiv_id":"2607.12862","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":5.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"Two Ising formulations of ML channel decoding trade neuron count against locality and density, so the preferred form must be chosen jointly with the neuromorphic solver.","lead":"This paper compares two known Ising/QUBO ways to cast maximum-likelihood channel decoding for neuromorphic hardware. It argues the better formulation depends on the solver and that ground-state correctness alone is not enough for receiver design.","discovery_kind":"extension","skeptic_critique":{"model":"grok-4.5","headline":"Abstract-only review: no full-text evidence exists to verify the claimed tradeoffs or the insufficiency of ground-state correctness, so the central comparative claim cannot be load-tested.","rationale":"The Reader's verdict of UNVERDICTED with LOW confidence is the only defensible stance given an abstract-only review. The strongest claim is a comparative methods claim whose quantitative content (tradeoffs in neuron count, density, locality, convergence; insufficiency of ground-state correctness) cannot be checked without methods, results, or hardware models. The weakest assumption identified by the Reader—that both formulations place the ML codeword at the ground state under sufficient enforcement and that the listed neuromorphic metrics suffice for ranking—is exactly the load-bearing point that remains untestable. No internal contradiction can be demonstrated from the abstract alone, nor is there any machine-checked proof or shipped code to raise confidence. Consequently no verdict adjustment is warranted; the stress-test simply confirms that the paper must be read in full before any stronger judgment is possible.","tokens_in":2063,"tokens_out":531,"duration_ms":4443,"concrete_test":"Obtain the full manuscript (or arXiv PDF) and extract (i) the precise penalty/chain-strength schedules used to enforce ground-state correctness and (ii) any reported neuron-count, density, locality, or iteration-to-convergence numbers for both formulations on the same code. If those quantities are missing or if the schedules are not stated, the comparative ranking remains unsupported; if present, recompute the resource ratios under a simple additive-noise model on the local fields and check whether the ranking reverses.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper's central claim is that the squared-penalty and chain-product Ising formulations of ML decoding impose fundamentally different neuromorphic tradeoffs (neuron count, synaptic density, locality, convergence) and that ground-state correctness alone is an insufficient design criterion. Both formulations are asserted to place the ML codeword at the ground state under sufficient constraint enforcement, yet the abstract supplies no enforcement regime, no hardware noise/timing/precision model, no quantitative resource tables, and no convergence data. Without those, the ranking of formulations and the co-design conclusion rest on unexamined assumptions. Because only the abstract is available, this is not an internal inconsistency that can be isolated to a specific equation or table; it is simply that the load-bearing evidence is absent. The Reader correctly flags this as unverifiable.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.5","summary":"The manuscript claims to deliver the first systematic side-by-side comparison of two existing Ising/QUBO formulations of maximum-likelihood decoding for linear codes (squared-penalty versus chain-product) under neuromorphic hardware constraints. Both formulations are asserted to place the ML codeword at the ground state under sufficient constraint enforcement, yet they are said to impose fundamentally different tradeoffs in neuron count, synaptic density, locality and convergence behavior. The preferred formulation is therefore inseparable from the choice of neuromorphic solver, and ground-state correctness alone is argued to be an insufficient design criterion; signal-processing tasks should be co-formulated with their hardware models.","tokens_in":2246,"tokens_out":549,"duration_ms":13667,"significance":"If the claimed resource and dynamics tradeoffs are quantitatively substantiated, the work would supply concrete guidance for mapping combinatorial decoding problems onto neuromorphic platforms and would strengthen the case for hardware-aware co-design beyond pure machine-learning workloads. Explicit recognition that ground-state correctness is not a sufficient figure of merit for signal-processing tasks would be a useful methodological contribution to the neuromorphic optimization literature.","major_comments":[{"comment":"Abstract: The central comparative claim—that the two formulations impose fundamentally different tradeoffs in neuron count, synaptic density, locality and convergence—is asserted without any quantitative resource tables, experimental setup, error bars, convergence curves or hardware-noise/timing/precision model. Because only the abstract is available, these load-bearing results cannot be examined, so the ranking of formulations and the co-design conclusion remain unverifiable.","section":"Abstract"},{"comment":"Abstract: Both formulations are stated to place the ML codeword at the ground state “under sufficient constraint enforcement,” yet the abstract supplies neither the enforcement regime (penalty magnitudes, chain strengths, etc.) nor any verification that the property survives the dynamics and precision limits of the neuromorphic solvers under consideration. Without that regime the ground-state premise itself cannot be checked.","section":"Abstract"}],"minor_comments":[{"comment":"The abstract is clear and well-structured, but the absence of even a single numerical example or reference to a concrete code length/rate makes it difficult for a reader to gauge the practical scale of the claimed tradeoffs.","section":"Abstract"}],"recommendation":"uncertain","confidential_remarks":"Only the abstract was supplied for review. A full manuscript containing methods, quantitative tables and experimental evidence is required before any definitive recommendation can be issued. The present report is therefore necessarily provisional."},"author_rebuttal":null,"desk_editor":{"model":"grok-4.5","letter":"The one thing to know: this abstract claims the first systematic side-by-side of the two existing quantum-annealing Ising formulations for ML channel decoding (squared-penalty vs chain-product) under neuromorphic resource and dynamics constraints, and concludes that formulation and solver must be co-chosen and that ground-state correctness alone is not enough. That is a useful within-subfield point if the full paper delivers the numbers.\n\nWhat is actually new is not the formulations themselves—they are prior art—but the neuromorphic-aware tradeoff analysis (neuron count, synaptic density, locality, convergence) and the co-design conclusion. Framing ML decoding as a test case for how Ising problems should be written for neuromorphic hardware is sensible; the field has spent more energy on solvers than on formulation choice under hardware constraints. Circularity burden looks low: it is a comparative methods paper, not a fitted redefinition of the target.\n\nThe soft spot is structural and large given what we have: only the abstract is available. There are no equations, enforcement regimes, hardware noise/timing/precision models, resource tables, convergence curves, or code. Both formulations are asserted to put the ML codeword at the ground state under “sufficient constraint enforcement,” but without that regime or end-to-end metrics the ranking and the “ground-state is insufficient” claim cannot be checked. The stress-test is right that this is absence of evidence, not an isolated internal contradiction. Soundness is therefore provisional.\n\nWho it is for: people building neuromorphic Ising solvers or thinking about receivers on that hardware. A serious referee should see the full paper if the quantitative comparison is real; the claim is important enough inside the niche to deserve referee time rather than desk rejection. I would not cite from the abstract alone, and I would not bring it to reading group until methods and results exist. If the full text ships the tradeoff tables and a clear hardware model, it becomes a solid methods note; until then it is a plausible abstract.","headline":"Abstract-only comparative claim on two known Ising ML-decoding formulations under neuromorphic constraints; plausible and field-relevant, but currently unverifiable.","tokens_in":2830,"tokens_out":505,"would_cite":false,"duration_ms":4601,"reading_group":"no","serious_thinker":"unclear","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.5","headline":"Two Ising formulations of maximum-likelihood decoding create opposite neuromorphic tradeoffs; the better one depends on the solver.","keywords":["neuromorphic computing","Ising model","QUBO","maximum-likelihood decoding","channel decoding","linear codes","combinatorial optimization","hardware-aware formulation"],"falsifier":"A controlled side-by-side experiment on a concrete neuromorphic platform (or a cycle-accurate model of one) that measures end-to-end decoding frame-error rate, wall-clock time, and energy for both formulations under identical codes and channel conditions; if one formulation that the paper ranks inferior consistently wins on those metrics, the claimed tradeoff ranking collapses.","tokens_in":2947,"feed_emoji":"⚡","tokens_out":844,"duration_ms":9184,"temperature":0.7,"pith_summary":"This paper argues that maximum-likelihood channel decoding can be cast as an Ising or QUBO problem in two fundamentally different ways, and that those two ways impose opposite resource and dynamics costs on neuromorphic hardware. One formulation keeps the number of neurons small by using squared penalties but creates dense couplings inside each parity check; the other restores locality by introducing extra auxiliary spins that form chain products. Both place the true maximum-likelihood codeword at the ground state when constraints are enforced strongly enough, yet they differ sharply in neuron count, synaptic density, locality, and how quickly a neuromorphic solver converges. Because neuromorphic hardware is sensitive to exactly these quantities, the paper claims that the preferred formulation cannot be chosen independently of the solver, and that merely verifying ground-state correctness is not enough for signal-processing tasks. The practical consequence is that future neuromorphic receivers should co-design the mathematical formulation together with the hardware dynamics rather than treat them as separate steps.","feed_headline":"Two Ising maps of ML decoding create opposite neuromorphic costs","feed_subtitle":"Neuron count, density and locality trade off; the better map depends on the solver chosen","key_machinery":"Two competing QUBO/Ising encodings of the same ML decoding objective: a squared-penalty form that uses few spins but dense intra-check couplings, and a chain-product form that improves locality by adding auxiliary spins. Both map the ML codeword to the ground state under sufficient constraint enforcement; the paper’s contribution is the systematic side-by-side comparison of the resource and dynamics consequences of that mapping under neuromorphic constraints.","core_discovery":"The squared-penalty and chain-product Ising formulations of maximum-likelihood decoding for linear codes impose fundamentally different tradeoffs in neuron count, synaptic density, locality, and convergence behavior; the preferred formulation is inseparable from the choice of neuromorphic solver, and ground-state correctness alone is an insufficient design criterion for placing such tasks on neuromorphic hardware.","pith_inferences":["The same locality-versus-size tension is likely to appear in other receiver blocks that can be cast as sparse constraint-satisfaction problems (e.g., detection, equalisation).","Hardware vendors that expose only dense or only sparse connectivity will effectively force system designers toward one of the two formulations.","A hybrid formulation that switches between squared-penalty and chain-product encodings on a per-check basis could be a natural next design point once both have been characterised."],"forward_implications":["Neuron count, synaptic density and locality become first-class design axes when mapping channel decoding onto neuromorphic hardware.","Choice of Ising formulation must be made jointly with the choice of neuromorphic solver rather than sequentially.","Ground-state correctness is necessary but not sufficient for signal-processing tasks; convergence dynamics and resource footprints must also be considered.","Neuromorphic receivers will require co-formulation of the mathematical problem with the hardware model if they are to enter the digital-signal-processing pipeline."],"fun_headline_variants":["Two Ising maps of ML decoding impose opposite neuromorphic tradeoffs","Squared-penalty vs chain-product Ising: opposite costs in neuromorphic ML decoding","Ising formulation choice for ML decoding inseparable from neuromorphic solver","Ground-state correctness alone fails for neuromorphic ML channel decoding","Neuron count density locality trade off in Ising forms of ML decoding"],"cache_read_input_tokens":128,"weakest_assumption_plain":"Both formulations place the true maximum-likelihood codeword at the ground state once constraints are enforced strongly enough, and that this ground-state property plus the listed neuromorphic resource metrics are sufficient to rank the formulations without a full end-to-end hardware noise, timing and precision model.","fun_headline_variants_meta":{"raw":{"variants":["Two Ising maps of ML decoding impose opposite neuromorphic tradeoffs","Squared-penalty vs chain-product Ising: opposite costs in neuromorphic ML decoding","Ising formulation choice for ML decoding inseparable from neuromorphic solver","Ground-state correctness alone fails for neuromorphic ML channel decoding","Neuron count density locality trade off in Ising forms of ML decoding"]},"model":"grok-4.5","effort":"low","cost_usd":0.00479,"raw_usage":{"total_tokens":1365,"prompt_tokens":802,"num_sources_used":0,"completion_tokens":95,"cost_in_usd_ticks":47900000,"prompt_tokens_details":{"text_tokens":802,"audio_tokens":0,"image_tokens":0,"cached_tokens":128},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":468,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":802,"tokens_out":95,"duration_ms":4916,"temperature":1.0,"reasoning_tokens":468,"cache_read_input_tokens":128,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-07-15T02:46:39.445409+00:00","model_set":{"reader":"grok-4.5"},"falsifier":"A controlled side-by-side experiment on a concrete neuromorphic platform (or a cycle-accurate model of one) that measures end-to-end decoding frame-error rate, wall-clock time, and energy for both formulations under identical codes and channel conditions; if one formulation that the paper ranks inferior consistently wins on those metrics, the claimed tradeoff ranking collapses.","supporting_citations":[],"review_version":1}