- Rating
- 4(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
PACER studies linguistic steganography under asymmetric receiver access, where the receiver may lack the sender’s prompt, model, or both. It separates distribution-preserving generation from the evidence used for recovery. Maximal coupling exploits an available receiver-side distribution, while token-class coupling extracts additional evidence from residual probability mass and supports token-only decoding. An e-process accumulates evidence for candidate payload blocks and certifies a block upon a unique threshold crossing. The paper establishes distribution preservation and a per-certification error bound under idealized randomness and exact sampling and arithmetic, and reports substantial embedding-rate improvements across three model families and four datasets.
Critical strengths
-
A clear problem and a well motivated construction.The receiver’s inability to reproduce the sender’s distribution is a meaningful limitation of high-capacity steganography. PACER addresses this limitation by exploiting information that remains available rather than requiring exact distribution reconstruction. The combination of maximal coupling, residual token-class coupling, and sequential certification is a creative design: it uses overlapping probability mass for proposal evidence and the remaining mass for class evidence while preserving the generation distribution. The same framework also supports receivers without a model.
-
Substantial gains under matched receiver resources. The token-only comparison is particularly convincing because the improvement does not depend on additional receiver-side model access. On Llama3/C4, PACER-TO achieves 213.7 bits per 1,000 tokens compared with 13.2 for PRSSA, with zero observed BER for both. Table 3 further supports the proposed mechanism: residual token-class coupling generally provides larger gains when sender and receiver distributions overlap less.
Critical weaknesses
-
The full recovery comparison needs a clearer evaluation protocol. Section 4 excludes unrecovered suffixes from the BER denominator. This measures the correctness of recovered bits, but does not by itself establish delivery of a prespecified message. In Table 5, the watermarking baselines use fixed payloads of 4, 16, and 64 bits, whereas the corresponding prespecified payload length for PACER is not equally clear. Consequently, it is difficult to determine whether PACER’s reported 100% full recovery uses the same success criterion. Please specify its payload length and the denominator of this metric, and report full recovery, noncompletion, and incorrect output under matched payload lengths and token budgets. This concern affects the interpretation of Table 5 rather than directly invalidating the main embedding-rate gains.
-
Retokenization results need a clearer connection to the protocol.Table 4 reports a modest average rate reduction and no observed bit errors after retokenization, which is encouraging. However, retokenization can change token positions and certification times, while the sender advances between payload blocks by reproducing receiver certification decisions. The paper should explain how block alignment is maintained or recovered, and what the reported sender synchronization operation actually does. The proof of Corollary 3.1 should also explicitly connect its independence argument to this end-to-end decoding procedure. This is a request to clarify a potentially important gap in exposition and justification, not a claim that the corollary is necessarily incorrect.
Questions for authors
-
What is PACER’s prespecified payload length in Table 5? Does 100% full recovery require recovery of the entire prespecified message? Can you provide a matched comparison using a 64-bit payload and a 300-token budget?
-
In a fixed-payload experiment, how often does recovery remain incomplete because of insufficient evidence, and how are those samples included in the reported metrics?
-
Please describe sender synchronization under retokenization and explain how the protocol handles differences in certification times and payload-block boundaries between the endpoints.
2 comments
Rebuttal to Weakness 2 & Question 3: Sender Synchronization and Corollary 3.1
Thank you for your suggestions on synchronization and Corollary 3.1. We would like to clarify that sender synchronization in PACER confirms the payload prefix ultimately certified by the receiver. Certification positions and payload-block boundaries after retokenization may differ from those during generation. The sender replays the receiver’s decoder on the final text to determine which blocks have been recovered and which remain to be transmitted. Below, we illustrate this process and explain its connection to Corollary 3.1.
During generation, the sender runs the receiver’s certification algorithm alongside embedding and uses its decisions to determine when to embed the next block. If receiver-side retokenization produces the same token sequence, both endpoints make the same certification decisions. If the sequence changes, the sender reruns the receiver’s decoder on the final text to confirm the actual recovery progress. Sender Synchronization in Table 4 reports the cost of this additional check.
Replay itself is a simple operation. For many steganographic methods that rely on exact token sequences for decoding, retokenization can produce incorrect bits or cause later decoding states to become misaligned. Even if the sender detects these errors through replay, the receiver may not be able to determine on its own which information it can reliably accept.
Replay is effective because PACER certifies and recovers the payload block by block. The receiver outputs the current block and advances to the next one only after a unique certification. Blocks with insufficient evidence remain unrecovered. This lets the receiver determine its recovery progress while controlling the probability of incorrect output. The sender then confirms this progress through replay.
Consider PACER-TO sample 24. The sender locally certifies three 16-bit payload blocks at positions 94, 192, and 224 in the generated token sequence, for a total of 48 bits. It starts embedding the next block after each certification.
When the receiver retokenizes the final text, the first difference occurs in the text corresponding to position 172 in the generated token sequence. The original sequence splits saramar into two tokens, sar and amar. Retokenization instead gives three tokens, s, aram, and ar. The text is unchanged, but the changed token sequence affects the subsequent accumulation of certification evidence.
The first block has already been certified at position 94, before this change. The receiver outputs these 16 bits and enters the second block. Even after the sender has started embedding the third block during generation, the receiver continues certification using its state for the second block. In this sample, the second block does not accumulate enough evidence before the text ends, so the receiver produces no further output. Replaying the receiver’s decoder on the same final text also recovers only the first 16-bit block, confirming that the second and later blocks still need to be transmitted.
Incorrect recovery occurs when an incorrect candidate happens to accumulate enough evidence, is the only candidate to reach the threshold, and is output. Corollary 3.1 uses the independence between the random values for an incorrect candidate and the generated text to extend certification error control to the deterministically retokenized sequence. The receiver computes the wrong-candidate baseline and updates the evidence from the retokenized history, so the analysis applies to the decoding process that the receiver actually runs. Under the theoretical assumptions in the paper, the probability of outputting an incorrect block in each certification process remains at most . Its default value is , or one in a million. This guarantee allows the receiver’s certification positions to differ from those during generation.
Neither the retokenization experiment in the original Table 4 nor the new fixed 64-bit experiment produced any observed incorrect PACER outputs. In addition, independent replay checks on 4,000 texts across the four modes found complete agreement between sender replay and the receiver’s final certification results.
Changes to the paper
We have updated the original Table 5, now Table 6 in the revised paper, with the new fixed 64-bit results and clarified how incomplete samples are counted. We have also clarified synchronization under retokenization and its connection to the certification error guarantee in Section 3.2 and Appendix C.2.
Thank you again for your constructive suggestions.
Thank you for describing PACER’s construction as “a creative design”, recognizing its “Substantial gains under matched receiver resources”, and finding the token-only comparison “particularly convincing”. Below, we add an evaluation of full recovery and explain synchronization and its connection to Corollary 3.1.
Rebuttal to Weakness 1 & Questions 1–2: Full Recovery and Incomplete Messages
Our original experiments mainly evaluated PACER’s embedding rate and bit error rate. The sender continuously embedded a secret bitstream during generation. We measured how many bits could be recovered within a given text length and whether those bits were correct, without specifying a fixed message length that had to be delivered in full. PACER’s 100% recovery in the original Table 5 corresponds to this setting.
You suggested distinguishing the correctness of recovered bits from full recovery of a prespecified message, and using matched payload lengths and token budgets. Following this suggestion, we completed a comparison using a fixed payload of 64 bits and a budget of 300 tokens on Llama-3.1-8B/C4.
The comparison includes all four PACER modes, PRSSA, Disreo, USLM, and the two watermarking methods MPAC and BiMark.
Full recovery requires all 64 bits to be output correctly. Any unrecovered suffix counts as a failure to recover the complete message. Each sample is classified as full correct recovery, incomplete recovery without errors, or incorrect output. The results are shown below.
These results directly answer your question about incomplete messages. For PACER-PD, MD, DD, and TO, respectively, 2.6%, 4.3%, 9.2%, and 28.3% of samples do not complete all certifications within the budget. All of these samples count as failures to recover the full message. No incorrect outputs were observed in any of the four modes.
PACER retains a clear advantage in the evaluation with a fixed message length. PACER-PD achieves 97.4% full correct recovery. PACER-TO, which you highlighted in your review, achieves 71.7% without any receiver-side model. In comparison, PRSSA, Disreo, and USLM never recover the full message correctly within this budget. MPAC and BiMark achieve full recovery rates of 18.1% and 1.3%, respectively. MPAC also has a PPL of 14.65, indicating a larger loss in text quality. These results further show PACER’s advantages in full recovery and text quality.
The new experiment further supports PACER’s performance in recovering messages of a fixed length and complements the original results on embedding rate that you recognized.