- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies reissuable image provenance: distinguishing current, superseded, and unissued copies, with abstention when evidence is insufficient, and recovering regional last-authorized-revision labels. GSF combines a trusted current-issue reference with image-embedded evidence, refreshing the entire field at each issuance while preserving inherited labels. Two-bit keyed fingerprints and a candidate-equivariant spatial reader recover regional history. Across 480 lineages containing four issued versions, the method reports 99.67% clean issued-state accuracy, 94.09% unissued-edit recall, and 93.13% median regional accuracy after three reissues.
Critical strengths
- The paper clearly distinguishes current authorization from historical authenticity and presents a coherent problem formulation and reissuance protocol.
- The evaluation covers complete editor outputs, multiple editors, and lifecycle events. Reader ablations and explicit failure reporting make the empirical analysis informative.
Critical weaknesses
W1. Evidence against stronger task-matched alternatives remains limited. Table 3 scores global-message carriers as constant regional maps, while the WAM adapter refreshes only committed field cells and relies on older marks for inherited history. This limits the evidence for GSF’s advantage over an optimized full-field-refresh regional baseline. Appendix M.7 also shows that correctly identifying an issued version allows exact map reconstruction from full registry records. Avoiding full registry reads is valuable, but stronger comparisons under matched registry-access assumptions are needed to establish GSF’s incremental advantage.
W2. Scalability to longer revision histories remains unvalidated. The end-to-end histories contain only four issued versions, where direct two-bit labels can represent all versions without codebook collisions. However, growing candidate sets are a central motivation for the keyed design. Appendices K and L analyze collision and width trade-offs but do not demonstrate longer-history recovery. Candidate-equivariance establishes interface compatibility, not recovery accuracy as unique anchors become scarcer, especially for small or fragmented older regions.
W3. Issued-state recognition deteriorates sharply under some benign delivery transformations. Table 53 reports CURRENT retention of 35.0% under JPEG quality 50 and 2.5% under composite delivery proxy B, versus 98.5% and 99.4% for TrustMark-Q with the same protocol. Readable regional maps do not eliminate this issued-state error. Appendix E explains these failures, and the paper includes limited operating-point comparisons, but does not quantify the trade-off between benign-delivery tolerance and false acceptance of unissued edits across operating points under these delivery conditions.
Questions for authors
- Regarding W1: Can the authors evaluate an optimized full-field-refresh regional baseline at comparable payload and image-quality budgets, explicitly distinguishing deployments with and without full registry-history access?
- Regarding W2: How do regional accuracy and mIoU change beyond four issued versions, especially for small or fragmented older regions? How does the two-bit design compare with wider codes under a fixed total carrier budget?
- Regarding W3: Can the authors quantify the issued-state retention/false-acceptance trade-off under these delivery transformations and clarify the intended deployment envelope?
5 comments
Part 2
(i) Beyond four versions. Ambiguous cells grow as App. L predicts (Table R6), yet are still read at 84.8% (88.3% at four versions). Labels at least four issues older than the current one, which a direct two-bit code cannot distinguish from a later label (App. K), keep a median IoU of 75.0 / 61.5 / 50.0 / 50.0% at five to eight versions.
(ii) Small or fragmented older regions. The loss follows fragment size. At five to eight versions, older-label cells are read correctly at 42.9% when isolated and 62.2% in fragments of 2–4 cells (together 15.5% of these cells), against 85.3% and 92.4% in fragments of 5–16 and ≥ 17 cells; at 5–16 cells a fragmented region scores below a contiguous one (median IoU 60.0 against 71.4%). The paper names this mechanism: "because older slices become small and fragmented" (Sec. 5.3).
(iii) Two bits against wider codes. Under the same 320-slot budget a three-bit code buys unique anchors with 106 coarser cells instead of 160 (App. K). Within the declared depth, the measured two-bit field exceeds even the error-free ceiling of that code (Table R6, last row), and the four- and eight-bit ceilings stay below the measured field at every depth. Beyond it the three-bit ceiling takes over, in mIoU from five versions and in accuracy from six. Sec. 4.2 states both: "two bits maximize the worst-case expected number of uniquely identifying cells over d ∈ {1,2,3} … deeper histories gradually favor wider codes".
Q3. Retention against false acceptance under JPEG 50 and Platform B; the intended envelope
Your numbers are right, and so is your remark that a readable map does not remove this error: under JPEG 50 the map is unchanged (App. E.3); the status is lost because the default rule reads any disrupted cluster as evidence of an unissued change. But retention is one coordinate of an operating point; the other is what the system accepts under the same conditions.
The trade-off. With every other rule fixed (Table 10, App. B.5), we swept C_cc, the size a disrupted cluster must exceed to count as such evidence, and re-decided all 61,440 delivery queries at 10 values. TrustMark-Q's delivered unissued outputs were decoded under the same protocol (≈ 10 GPU-hours): from the images saved in the paper's run for 398 lineages and, for the other 82, from lineages regenerated with the same instructions, which moves its retention by one lineage per condition from the paper's 98.5 / 99.4% (Table 53, App. M.6).
Table R7. CURRENT issues kept ↑ / unissued edits accepted as issues ↓ (%)
| Operating point | JPEG 50 | Platform B | Clean |
|---|---|---|---|
| GSF, C_cc = 1 (the paper's default) | 35.0 / 0.5 | 2.5 / 0.0 | 99.0 / 2.5 |
| GSF, C_cc = 6 | 84.8 / 2.2 | 68.3 / 0.8 | 99.4 / 6.1 |
| GSF, C_cc = 12 | 93.8 / 3.4 | 90.4 / 2.1 | 99.4 / 8.4 |
| TrustMark-Q, same protocol | 98.3 / 24.0 | 99.2 / 26.1 | 99.8 / 29.6 |
TrustMark-Q keeps 98.3 / 99.2% because its global message survives, and so accepts 24.0 / 26.1% of the unissued edits there. C_cc = 12 is the first swept value at which retention under JPEG 50 passes 93%; the price is paid on clean copies (false acceptance 2.5% → 8.4%, OPEN recall 93.1% → 82.7%). We show it as a point on the curve, not as a recommended setting.
The intended envelope is that of the default point, whose thresholds were placed on development data before the evaluation: the 18 conditions of App. E.3 in which all three statuses stay above 93% (clean; JPEG down to quality 75, including double JPEG 75; downscaling to 256 px; blur up to σ = 1.0; darkening to ×0.85; contrast ×0.80). JPEG 50 and Platform B lie outside it, and, as the sweep shows in hindsight, no swept value keeps all three statuses above 93% on clean copies and under either of them at once. Outside it, a damaged issue and an unissued edit can produce the same evidence (App. E.5), and the threshold moves errors from one to the other without separating them.
Outside the envelope, two facts. None of 30,720 issued-image queries over 32 conditions is given the other issued status, at any swept value; an issue that fails reads OPEN or UNKNOWN (Sec. 5.4). Unissued outputs are accepted at 2.5% on clean copies and at most 2.6% under any transformation at the default point.
In closing. The experiments leave the paper's conclusions in place: "locating the latest change is not keeping the history behind it" (Sec. 5.5) holds against the stronger baseline; two bits remain the right width for the declared depth, and three bits can do better beyond it (Sec. 4.2); under harsh delivery the cost falls on retention (Sec. 5.4). In the revision, Table 3 (Sec. 5.5) will report the full-field-refresh baseline at both budgets, with its construction and tuning detailed in App. M; the eight-version results go to App. G and L, the sweep to App. D and E, where the App. E.3 sentence on unissued outputs becomes these two facts. We would be grateful if you would reconsider your assessment.
Sincerely, The Authors
Follow-up on the additional experimental results
Dear Reviewer TCKy,
Thank you again for your helpful questions. We would appreciate any further feedback on the full-field-refresh baseline, longer-history evaluation, and delivery trade-offs reported in Tables R5–R7.
In particular, could you please let us know whether these results address your main concerns, or whether any points remain unresolved? We would be happy to provide further clarification during the remaining discussion period.
Thank you for your time.
Best regards, The Authors
Part 1
Dear Reviewer TCKy,
Thank you for your careful and constructive review, and for finding the formulation clear, the protocol coherent and the failure reporting informative. We ran each experiment your questions ask for on all 480 lineages.
Our response in brief (Tables R5–R7 are new; R1–R4 are in our reply to Reviewer qA8C.)
Q1. Full-field-refresh regional baseline, with and without full registry-history access
The paper's WAM row rewrites only committed cells, as you note (coexisting WAM messages interfere, App. M), whereas GSF "rewrites every field cell" at each reissue (Sec. 4.2). No regional watermark we know of defines a reissue step, so we built the baseline from the closest released one, WAM, with every choice in its favor (≈ 47 GPU-hours): all 256 cells re-embedded at every reissue; GSF's payload per cell; two quality budgets, matched to GSF and at WAM's released strength; the reader most favorable to it, selected on the test lineages, and status thresholds tuned on a 2,268-point grid.
Table R5. Inherited regional history read from the copy (mIoU, %)
Without full registry-history access, full refresh helps the baseline, as you expected, and makes it a working one: tuned, it reaches CURRENT / SUPERSEDED 90.9 / 95.7% at released strength (GSF: 99.5 / 99.8%; Table 3, Sec. 5.5). Yet on inherited history it stays below GSF at both budgets, for a structural reason: on older regions of at most 16 cells its median IoU is 0 (GSF: 40.0% and 66.7% for regions of 1–4 and 5–16 cells), also on control images with no earlier mark to interfere. A region-level message needs a large contiguous area to decode; GSF's keyed field is addressable cell by cell.
With full registry-history access, any carrier replays the map of an issued image exactly from the records, as the paper states: such a deployment "needs no field on issued images" (App. M.7). The comparison reduces to identifying the issue: 94.1% / 97.1% for the baseline at the two budgets, its tolerance widened in its favor, against 99.97% for GSF. For an unissued copy the target is its parent's field (Sec. 3), so a replayed record is right whenever the parent is identified. Our reply to Reviewer qA8C measures what that takes: a hash-keyed lookup with the complete record matches 0.1–42.0% (by tolerance) of 960 locally edited copies, each match certifying an unissued copy as an issue; GSF recognizes 99.8% of them as unissued and reads their untouched regions at Map acc 93.7% / mIoU 79.4%, against 93.6 / 79.7% on the issued image.
Q2. Longer histories; small or fragmented older regions; two bits against wider codes
The submission stops at four versions (App. F.2). We extended every lineage to eight (1,920 further reissues; ≈ 23 GPU-hours) with writer, decoder and reader frozen.
Table R6. Regional history from four to eight issued versions (medians, %)