{"id":"f12f27f2-0004-4389-94b0-1df55b9e7dbe","arxiv_id":"2606.27849","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":6.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"Optimal codeword arrangement in Hamming codes for BSC transmission of counting queries strictly improves differential privacy without added obfuscation or utility loss.","lead":"The paper claims that an optimal arrangement of codewords in Hamming codes allows strictly better differential privacy for counting query outputs sent over a binary symmetric channel, without adding noise or raising decoding error rates. A smart generalist might read it to see if channel noise can be turned into a no-cost privacy tool for data transmission systems.","discovery_kind":"new_application","skeptic_critique":{"model":"grok-4.3","headline":"No significant objection identified","rationale":"The reader's weakest assumption flags the existence of an arrangement that improves privacy without harming utility. The code properties (identical per-codeword error probability, variable inter-codeword distances) make such an arrangement possible in principle; the abstract states the authors derive one. No internal contradiction appears from the given description, so the assumption is not load-bearing in the sense that would invalidate the claim.","tokens_in":1595,"tokens_out":314,"duration_ms":59828,"concrete_test":"Extract the explicit message-to-codeword mapping derived in the paper; for every pair of consecutive count values compute the Hamming distance of their assigned codewords and compare the resulting worst-case or average distance against the standard linear encoding of the same Hamming code. If the derived mapping yields smaller distances while preserving the code, the privacy improvement holds.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim is internally consistent. Hamming codes are perfect with fixed minimum distance 3; under BSC and ML decoding, every codeword has identical correct-decoding probability equal to the volume of its decoding sphere. Consequently any bijection from query outputs to codewords leaves end-to-end error probability unchanged. Differential privacy is governed by the output distributions induced by BSC centered at the assigned codewords; assigning minimum-distance pairs to neighboring count values therefore yields strictly smaller likelihood ratios (hence better ε) than assignments that place neighbors farther apart, with no extra noise or runtime cost.","agreement_with_reader":"disagree"},"referee_report":{"model":"grok-4.3","summary":"The manuscript considers transmission of counting-query outputs over a BSC using Hamming codes as channel encoders. It derives an optimal bijection from query outputs to codewords that strictly improves the resulting differential-privacy parameter while leaving the end-to-end block-error probability unchanged and incurring no additional real-time computation.","tokens_in":1687,"tokens_out":335,"duration_ms":26493,"significance":"The result shows that the fixed geometry of a perfect code under ML decoding can be exploited to tighten the output likelihood ratios that govern DP without altering the per-codeword correct-decoding probability. This yields a parameter-free privacy improvement that is obtained solely by a static relabeling of codewords.","major_comments":[],"minor_comments":[{"comment":"The abstract states that the arrangement 'strictly improves differential privacy guarantees'; a concrete comparison of the resulting ε values (or the maximum likelihood ratio) for the optimal versus a random arrangement would make the improvement explicit.","section":"Abstract"},{"comment":"The proof that every codeword has identical correct-decoding probability under BSC and ML decoding relies on the sphere-packing property of the Hamming code; this should be stated as a short lemma with the explicit volume calculation.","section":null},{"comment":"Notation for the mapping from neighboring count values to minimum-distance codeword pairs is introduced without an accompanying small example (e.g., the [7,4] Hamming code); adding one would clarify the construction.","section":null}],"recommendation":"minor_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for their careful reading, positive summary, and significance assessment of our manuscript on differential privacy over Hamming codes. The recommendation of minor revision is noted. No major comments were provided in the report, so we have no specific points to address point-by-point. We will incorporate any minor suggestions during revision.","responses":[],"tokens_in":1064,"tokens_out":83,"duration_ms":20393,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The main thing to know is that the authors answer their stated open question in the affirmative: there exists a bijection from count values to Hamming codewords that improves the differential privacy parameter while leaving both the end-to-end error probability and the real-time computation unchanged.\n\nWhat the paper does well is exploit the fact that Hamming codes are perfect. Every codeword has an identical decoding sphere, so any permutation of the assignment keeps the utility metric fixed. The privacy gain then comes purely from placing codewords that are close in Hamming distance next to neighboring count values; the BSC likelihood ratios become smaller in the worst case. The stress-test note confirms this geometry works without contradiction.\n\nThe derivation appears to rest on standard properties of the code and channel rather than on fitted parameters or self-referential definitions. No invented entities or circular arguments are visible from the abstract and the consistency check.\n\nSoft spots are limited. The abstract is brief, so the explicit optimal arrangement and the full proof steps are not visible here; a referee would need to verify that the claimed strict improvement holds for the chosen parameters and that the bound is tight. That is a normal check rather than a load-bearing flaw.\n\nThe work is aimed at people who already work on privacy-preserving communication and coding for queries. A reader comfortable with Hamming codes, BSC, and the standard DP definition will see the value immediately. It is narrow but cleanly executed.\n\nI would send this to peer review. The central observation is internally consistent and addresses a concrete question without overclaiming.","headline":"The paper shows a codeword re-arrangement in Hamming codes tightens DP for counting queries over BSC with no extra cost or error penalty.","tokens_in":2153,"tokens_out":389,"would_cite":false,"duration_ms":28408,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"An optimal codeword arrangement for Hamming codes over BSC strictly improves differential privacy without added overhead or utility loss.","keywords":["differential privacy","Hamming codes","binary symmetric channel","counting queries","channel coding","privacy utility tradeoff"],"falsifier":"Direct comparison of the differential privacy parameter achieved by the optimal arrangement versus a standard one, measured at identical end-to-end decoding error probability.","tokens_in":2499,"feed_emoji":"🔐","tokens_out":523,"duration_ms":45135,"temperature":0.7,"pith_summary":"The paper examines sending outputs of counting queries over a binary symmetric channel encoded with Hamming codes. Channel noise already supplies some privacy protection, though at the price of decoding errors that reduce utility. It shows that a carefully chosen arrangement of the codewords can raise the level of differential privacy protection further. This gain requires neither extra real-time noise injection nor any rise in the overall error rate after decoding. A reader would care if the claim holds because it points to a way of strengthening privacy in noisy transmission without the usual added costs.","feed_headline":"Codeword rearrangement lifts privacy in Hamming-coded queries","feed_subtitle":"Optimal mapping over BSC improves differential privacy without extra noise or higher error rates.","key_machinery":"The optimal codeword arrangement that re-maps messages to codewords to extract more privacy from the existing channel noise.","core_discovery":"Deriving an optimal codeword arrangement allows the transmission of counting query outputs over BSC with Hamming codes to achieve strictly better differential privacy guarantees while incurring no real-time computational overhead and no degradation in utility.","pith_inferences":["Code mapping choices may serve as an additional lever for privacy in other noisy-channel settings.","The same rearrangement idea could be tested on different linear codes or channel models.","Protocol designers might incorporate such static mappings to reduce reliance on separate privacy layers."],"forward_implications":["Privacy level rises solely through the choice of how messages map to codewords.","No additional real-time data obfuscation is required for the improvement.","End-to-end error probability after decoding remains unchanged.","The improvement applies to the transmission of counting query outputs."],"fun_headline_variants":["Optimal codeword arrangement improves privacy in Hamming BSC","Hamming code arrangement raises privacy for counting queries","Better differential privacy via optimal Hamming code mapping","Codeword arrangement yields higher privacy in BSC Hamming setup"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"An optimal codeword arrangement exists for Hamming codes over BSC that improves differential privacy without requiring additional real-time obfuscation or increasing end-to-end error probability.","fun_headline_variants_meta":{"raw":{"variants":["Optimal codeword arrangement improves privacy in Hamming BSC","Hamming code arrangement raises privacy for counting queries","Better differential privacy via optimal Hamming code mapping","Codeword arrangement yields higher privacy in BSC Hamming setup"]},"model":"grok-4.3","cost_usd":0.006715,"raw_usage":{"total_tokens":3054,"prompt_tokens":521,"num_sources_used":0,"completion_tokens":60,"cost_in_usd_ticks":67149500,"prompt_tokens_details":{"text_tokens":521,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":2473,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":521,"tokens_out":60,"duration_ms":43145,"temperature":1.0,"reasoning_tokens":2473,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-06-29T02:57:32.049918+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"Direct comparison of the differential privacy parameter achieved by the optimal arrangement versus a standard one, measured at identical end-to-end decoding error probability.","supporting_citations":[],"review_version":1}