Pith. sign in

REVIEW 3 major objections 4 minor 34 references

A Tight Context-aware Privacy Bound for Histogram Publication

T0 review · 3 major / 4 minor · reviewed 2026-08-05 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read For histograms with bin probabilities certifiably bounded below by alpha, the Laplace mechanism leaks strictly less than its differential-privacy parameter suggests, by a bound independent of the number of bins.

desk verdict Genuinely new k-independent PML bound for histogram Laplace; the tightness claim is actually correct (though the paper doesn't show the construction), and the main soft spot is how much weight the α assumption carries. read the letter →

arxiv 2508.18832 v1 pith:QVC7DQWF submitted 2025-08-26 cs.CR cs.ITmath.IT

Sara Saeidian (1 , 2) , Ata Yavuzy{i}lmaz , Leonhard Grosse (1) , Georg Schuppe (3) , Tobias J. Oechtering (1) ((1) KTH Royal Institute of Technology , (2) Inria Saclay , (3) SEBx) This is my paper · ORCID
classification cs.CRcs.ITmath.IT MSC 94A17
keywords pointwisemaximalleakagedifferentialprivacyLaplacemechanismhistogrampublicationcontext-awareprivacy-utilitytradeoffcompositiontheoreminformation
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper proves that releasing a k-bin histogram with Laplace noise leaks strictly less than its differential-privacy certificate claims, provided the data distribution is known to give every bin probability at least alpha. The formal result, Theorem 4, bounds the pointwise maximal leakage (PML) — the worst-case ratio of an adversary's posterior gain to prior gain — of any single record by 2/b − log(1 − alpha + alpha exp(2/b)), a number that does not depend on the number of bins k. The bound interpolates cleanly: as alpha tends to 0 it recovers the standard DP parameter 2/b, and as alpha tends to 1 it approaches zero, so distributional knowledge is converted directly into privacy. Experiments compare the same mechanism under PML and DP accounting and find lower total variation distance from the true histogram under PML at equal privacy levels, with the gap largest in the high-privacy regime. The takeaway is that context-aware privacy measures let an analyst trade certified prior knowledge about the data for noise, improving the privacy-utility frontier without changing the mechanism.

What carries the argument

The object that carries the argument is the pointwise maximal leakage written as ℓ_M(X → y) = log sup_x M(y|x)/M(y): the worst-case ratio, over inputs x, of the release probability under x to the release probability under the prior. For the Laplace histogram mechanism this ratio factors over bins, and the proof's key move is to define S_j = y_j − Σ_{i≠1} h_j(D_i), the residual of bin j after removing the target record. Triangle inequalities |S_1| ≤ |S_1 − 1| + 1 and |S_t − 1| ≤ |S_t| + 1 collapse every bin-to-bin ratio into a single scalar 1/(p_1 exp(2/b) + 1 − p_1), where p_1 is the probability the target record sits in class 1; the assumption p_1 ≥ α then bounds that scalar uniformly over

What would settle it

Numerically compute the exact PML for a tiny database (e.g., n = 2, k = 2) whose record distribution sits in Q_alpha with a bin probability exactly alpha: evaluate log max_{d1} P(Y = y | D1 = d1)/P(Y = y) over a fine grid of outputs y and check that no value exceeds 2/b − log(1 − alpha + alpha exp(2/b)). Theorem 4 asserts this holds for all outputs and all such distributions, so a single exceeding ratio would refute it.

Watch

Extended reading notes

Core claim

The central result, Theorem 4: for any database with independent entries whose class probabilities all exceed alpha, and any output y^k of the Laplace histogram mechanism, the pointwise maximal leakage of each record satisfies ℓ(D_i → y^k) ≤ 2/b − log(1 − alpha + alpha exp(2/b)). The proof writes PML as the worst-case posterior-to-prior ratio, isolates the target record's contribution via residuals S_j, and collapses the ratio with triangle inequalities; the final expression depends only on the noise scale b and the probability p_1 of the class the record occupies. The bound is tight, attained at p_1 = alpha for some output. A corollary gives the simpler 2(1−alpha)/b + 2 alpha²/b², exposing

Load-bearing premise

The whole improvement rests on the analyst knowing a valid lower bound alpha on the probability that every record falls into every histogram bin; if any bin's true probability is below alpha, the bound does not apply and the guarantee falls back to the ordinary DP level.

Editorial extensions

If this is right

  • For a fixed noise scale b, histograms with more balanced class probabilities (larger alpha) leak strictly less; in the limit alpha → 1 the leakage bound goes to zero.
  • The bound is independent of the number of bins k, unlike the composition-based PML bound (k−1)·((1−alpha)/b + alpha²/(2b²)) that grows linearly with k.
  • Matching a target privacy level requires less noise under the PML account than under DP, which is why at equal ε the PML-accounted histograms have lower TVD to the true distribution, especially at small ε.
  • As alpha → 0 the bound degenerates to the DP level 2/b, making the PML guarantee a strict refinement of DP for the same Laplace mechanism.
  • The relative gain from the alpha term is largest when k is small — the regime where direct bin-wise Laplace noise is useful anyway (a scope the paper itself notes).

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The proof uses only the probability of the bin the target record occupies, so a per-bin margin vector (alpha_1, ..., alpha_k) would give a pointwise tighter guarantee than the scalar alpha the paper states.
  • The result turns certified prior knowledge into a directly usable privacy budget: an analyst who can publicly justify a margin alpha can claim a smaller epsilon than DP allows for the same noise; the unexamined risk is that the certified alpha itself becomes an information channel.
  • The argument only relies on Laplace densities factoring as exp(−|·|/b), so analogous alpha-refined bounds should hold for any mechanism with exponential output densities, such as the discrete Laplace or truncated geometric mechanisms.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 4 minor

Summary. The paper analyzes the privacy of releasing a k-bin histogram perturbed by i.i.d. Laplace noise, using pointwise maximal leakage (PML) rather than differential privacy. It assumes the database entries are independent and that each entry has probability at least alpha of falling into every bin. Under this assumption, Theorem 4 proves an upper bound on the PML of each record, namely 2/b - log(1 - alpha + alpha exp(2/b)), which is independent of k and interpolates between the DP level 2/b as alpha -> 0 and zero leakage as alpha -> 1. A looser bound is also derived, and experiments compare the utility of PML-calibrated and DP-calibrated Laplace noise at equalized privacy parameters.

Significance. If the claims are correct, the paper makes a useful contribution by showing that a standard mechanism can be analyzed in a context-aware privacy framework to obtain stronger per-record guarantees when distributional assumptions hold. The k-independence of the bound and the explicit dependence on the minimum bin probability alpha are attractive features, and the empirical comparison illustrates the potential utility gain. The proof of the upper bound is short and plausible, and it builds on established PML results. The main weakness is that the asserted tightness of the bound is not proved; this matters because the title and the experimental privacy-utility equalization treat the bound as the exact worst-case PML.

major comments (3)
  1. [Section III-A, proof of Theorem 4, step (a)] The claim that the bound in (1) is 'tight' is asserted without proof. This is load-bearing: the title promises a tight bound, and Section III-B uses epsilon_PML(b) as the privacy level to equalize with DP in Figure 1. If (1) is only an upper bound, the horizontal axis in Figure 1 compares DP guarantees with an upper bound on PML, not the worst-case PML; the comparison is then conservative for PML but the 'same privacy level' statement is not justified. Please provide an explicit construction. One such construction is: choose a class j with p_j = alpha, and choose an output y^k with y_j >= n and y_l <= 0 for all l != j. Then for every realization of the other entries, S_j >= 1 and S_l <= 0, so the triangle inequalities in step (a) are equalities; with p_j = alpha, step (b) is also an equality. This shows the sup over outputs and the max over record values attain the RHS of (1). The paper
  2. [Section III-B] The sign of the triangle-inequality step is easy to invert and should be displayed explicitly. From |S1| <= |S1 - 1| + 1 and |St - 1| <= |St| + 1, one obtains exp(-|S1|/b) >= exp(-1/b) exp(-|S1-1|/b) and exp(-|St-1|/b) >= exp(-1/b) exp(-|St|/b). Hence each ratio A_t in the proof is at least exp(-2/b), not at most exp(-2/b). The resulting lower bound on the denominator is what yields the desired upper bound on the leakage. Making this direction explicit will prevent the proof from being misread.
  3. [Section III-B] The empirical comparison relies on identifying epsilon_PML(b) with the RHS of (1). If the tightness construction is added as requested, this identification is correct for worst-case PML. Until then, the experimental claim should be phrased as comparing DP with a valid PML upper bound, and the precise sense in which the privacy levels are 'the same' should be stated. Additionally, the experiments set alpha from the known uniform distribution; the paper should discuss how an analyst obtains a valid alpha in practice and note that overestimating alpha invalidates the guarantee.
minor comments (4)
  1. [Section III-A] The derivation of (2) from (1) using e^x >= 1 + x and log(1+x) >= x - x^2/2 is not shown. The second-order term requires a bound on (e^{2/b} - 1)^2, which is not immediate from the cited inequalities. Please fill in the algebra or give a short proof of (2).
  2. [Theorem 4 proof] Typo: 'deceasing' should be 'decreasing' in the sentence after step (b).
  3. [Section IV] The composition bound displayed in the discussion is stated without derivation. It would be helpful to show explicitly how it follows from [6, Lemma 1] and [10, Prop. 4.6], and to state the required alpha for the counting-query result.
  4. [Figure 1] The figure reports mean TVD with error bars, but the caption does not specify whether the error bars denote standard deviation, standard error, or confidence intervals. Please clarify.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity; the histogram PML bound is derived from the PML definition, not from its own conclusion. The only concern is an unproven tightness assertion, which is a correctness gap, not circularity.

full rationale

The paper's central claim (Theorem 4) is an upper bound on pointwise maximal leakage (PML) for the Laplace histogram mechanism under a product distribution with each bin probability at least α. The derivation starts from the PML definition (simplified via the general result in [7]) and proceeds algebraically through exact expressions and triangle-inequality bounds, finally using the assumed lower bound α on the bin probability. This is a direct mathematical derivation, not a fit: α is an assumption input, not a parameter fitted to any data. The bound does not assume its own conclusion; it is derived from the mechanism and the distributional assumption. The paper does rely on the authors' own prior work for the PML simplification ([7]) and the counting-query result ([10, Prop. 4.6] used only in the composition comparison). These are independent mathematical results with stated assumptions that do not include the histogram query, so they are real evidence rather than circular self-citation. No 'uniqueness theorem' is imported, no ansatz is smuggled in via citation, and no known empirical pattern is merely renamed. The only notable issue is the assertion after Theorem 4 that the bound is tight ('there exists an outcome y^k such that the upper bound is attained'), which is stated without proof. This is an omitted proof that could affect the title's 'tight' and the empirical equalization in Section III-B, but it is a correctness/verification concern, not circularity: even if the bound is loose, the PML analysis remains a genuine upper bound and the empirical comparison would be conservative. Therefore, no circular step is found.

Assumptions & free parameters 1 free parameters · 5 assumptions · 0 invented entities

The only analyst-chosen quantity is alpha, a distributional lower bound. The remaining axioms are standard setting pieces: product distributions, public n, the PML formula, and the histogram partition. No new physical or mathematical entities are introduced.

free parameters (1)
  • alpha (minimum bin probability lower bound) = not fitted; assumed values 0.05, 0.1, 0.2, 0.3 in Figure 1
    The privacy bound and all utility comparisons depend on the analyst-chosen lower bound alpha for every bin probability. It is not estimated from data, and the stated guarantee is only valid if the true distribution satisfies it.
assumptions (5)
  • domain assumption Database entries are independent, drawn from a product distribution (P_X in Q).
    Used in the proof of Theorem 4 to factor the marginal M_Y and to condition on D1 separately.
  • domain assumption The number of records n is public, and the bounded DP model applies.
    Stated in Section II-C; needed to define neighboring databases and histogram counts.
  • domain assumption Every record has probability at least alpha for every histogram bin (P_X in Q_alpha).
    This is the main context-aware assumption driving the improved bound; if it fails, the privacy guarantee degrades toward the DP level.
  • standard math PML on the relevant alphabet satisfies ell(X -> y) = log sup_x M(y|x)/M(y).
    Taken from the authors' prior work [7, Def. 3]; used as the starting point of the proof and not re-derived here.
  • domain assumption The bin indicator functions define a partition of the domain, so each data point belongs to exactly one class.
    Histogram definition; used to justify the k-1 counting argument and the denominator normalization in the proof.

how reviews work

0 comments
Cite this review

Pith. "Pith review of A Tight Context-aware Privacy Bound for Histogram Publication." pith.science (2026). https://pith.science/paper/QVC7DQWF

@misc{pith2026250818832,
  author       = {Pith},
  title        = {Pith review of: A Tight Context-aware Privacy Bound for Histogram Publication},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/QVC7DQWF}},
  note         = {Machine review of arXiv:2508.18832}
}
read the original abstract

We analyze the privacy guarantees of the Laplace mechanism releasing the histogram of a dataset through the lens of pointwise maximal leakage (PML). While differential privacy is commonly used to quantify the privacy loss, it is a context-free definition that does not depend on the data distribution. In contrast, PML enables a more refined analysis by incorporating assumptions about the data distribution. We show that when the probability of each histogram bin is bounded away from zero, stronger privacy protection can be achieved for a fixed level of noise. Our results demonstrate the advantage of context-aware privacy measures and show that incorporating assumptions about the data can improve privacy-utility tradeoffs.

Figures

Figures reproduced from arXiv: 2508.18832 by the authors.

Figure 1
Figure 1. Comparison of PML-privatized and DP-privatized [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

34 extracted references · 31 canonical work pages

  1. [1]

    Privacy-preserving synthetic data generation using pointwise maximal leakage: Msc thesis in collaboration with SEBx,

    A. Yavuzyilmaz, “Privacy-preserving synthetic data generation using pointwise maximal leakage: Msc thesis in collaboration with SEBx,” Master’s thesis, KTH, School of Electrical Engineering and Computer Science (EECS), 2024

    work page 2024

  2. [2]

    Calibrating noise to sensitivity in private data analysis,

    C. Dwork, F. McSherry, K. Nissim, and A. Smith, “Calibrating noise to sensitivity in private data analysis,” in Theory of cryptography conference. Springer, 2006, pp. 265–284

    2006

  3. [3]

    The algorithmic foundations of differential privacy,

    C. Dwork and A. Roth, “The algorithmic foundations of differential privacy,” Foundations and Trends® in Theoretical Computer Science , vol. 9, no. 3–4, pp. 211–407, 2014

    work page 2014

  4. [4]

    Deep learning with differential privacy,

    M. Abadi, A. Chu, I. Goodfellow, H. B. McMahan, I. Mironov, K. Talwar, and L. Zhang, “Deep learning with differential privacy,” in Proceedings of the 2016 ACM SIGSAC conference on computer and communications security, 2016, pp. 308–318

    2016

  5. [5]

    Federated learning with differential privacy: Algorithms and performance analysis,

    K. Wei, J. Li, M. Ding, C. Ma, H. H. Yang, F. Farokhi, S. Jin, T. Q. Quek, and H. V . Poor, “Federated learning with differential privacy: Algorithms and performance analysis,” IEEE transactions on information forensics and security, vol. 15, pp. 3454–3469, 2020

    work page 2020

  6. [6]

    Pointwise maximal leakage,

    S. Saeidian, G. Cervia, T. J. Oechtering, and M. Skoglund, “Pointwise maximal leakage,” IEEE Transactions on Information Theory , vol. 69, no. 12, pp. 8054–8080, 2023

    work page 2023

  7. [7]

    Pointwise maximal leakage on general alphabets,

    ——, “Pointwise maximal leakage on general alphabets,” in 2023 IEEE International Symposium on Information Theory (ISIT) . IEEE, 2023, pp. 388–393

    work page 2023

  8. [8]

    Extremal mechanisms for pointwise maximal leakage,

    L. Grosse, S. Saeidian, and T. J. Oechtering, “Extremal mechanisms for pointwise maximal leakage,” IEEE Transactions on Information Forensics and Security, vol. 19, pp. 7952–7967, 2024

    work page 2024

Show all 34 references
  1. [9]

    On the difficulties of disclosure prevention in statistical databases or the case for differential privacy,

    C. Dwork and M. Naor, “On the difficulties of disclosure prevention in statistical databases or the case for differential privacy,” Journal of Privacy and Confidentiality , vol. 2, no. 1, 2010

    2010

  2. [10]

    Rethinking disclosure prevention with pointwise maximal leakage,

    S. Saeidian, G. Cervia, T. J. Oechtering, and M. Skoglund, “Rethinking disclosure prevention with pointwise maximal leakage,” Journal of Privacy and Confidentiality , vol. 15, no. 1, Mar. 2025

    2025

  3. [11]

    Evaluating differential privacy on correlated datasets using pointwise maximal leakage,

    S. Saeidian, T. J. Oechtering, and M. Skoglund, “Evaluating differential privacy on correlated datasets using pointwise maximal leakage,” in Privacy Technologies and Policy. Cham: Springer Nature Switzerland, 2024, pp. 73–86

    2024

  4. [12]

    Finite sample differentially private confidence intervals,

    V . Karwa and S. Vadhan, “Finite sample differentially private confidence intervals,” in 9th Innovations in Theoretical Computer Science Confer- ence (ITCS 2018) , vol. 94. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2018, p. 44

    2018

  5. [13]

    PrivBayes: Private data release via bayesian networks,

    J. Zhang, G. Cormode, C. M. Procopiuc, D. Srivastava, and X. Xiao, “PrivBayes: Private data release via bayesian networks,” ACM Transac- tions on Database Systems (TODS) , vol. 42, no. 4, pp. 1–41, 2017

    2017

  6. [14]

    Graphical-model based estimation and inference for differential privacy,

    R. McKenna, D. Sheldon, and G. Miklau, “Graphical-model based estimation and inference for differential privacy,” in International Con- ference on Machine Learning . PMLR, 2019, pp. 4435–4444

    2019

  7. [15]

    PrivSyn: Differentially private data synthesis,

    Z. Zhang, T. Wang, N. Li, J. Honorio, M. Backes, S. He, J. Chen, and Y . Zhang, “PrivSyn: Differentially private data synthesis,” in 30th USENIX Security Symposium (USENIX Security 21), 2021, pp. 929–946

    2021

  8. [16]

    Differ- entially private histogram publication,

    J. Xu, Z. Zhang, X. Xiao, Y . Yang, G. Yu, and M. Winslett, “Differ- entially private histogram publication,” The VLDB journal , vol. 22, pp. 797–822, 2013

    2013

  9. [17]

    Differentially private histogram publishing through lossy compression,

    G. Acs, C. Castelluccia, and R. Chen, “Differentially private histogram publishing through lossy compression,” in 2012 IEEE 12th International Conference on Data Mining . IEEE, 2012, pp. 1–10

    2012

  10. [18]

    Practical differential privacy via grouping and smoothing,

    G. Kellaris and S. Papadopoulos, “Practical differential privacy via grouping and smoothing,” Proceedings of the VLDB Endowment, vol. 6, no. 5, pp. 301–312, 2013

    2013

  11. [19]

    Towards accurate histogram publication under differential privacy,

    X. Zhang, R. Chen, J. Xu, X. Meng, and Y . Xie, “Towards accurate histogram publication under differential privacy,” in Proceedings of the 2014 SIAM international conference on data mining . SIAM, 2014, pp. 587–595

    2014

  12. [20]

    Privacy, accuracy, and consistency too: A holistic solution to contin- gency table release,

    B. Barak, K. Chaudhuri, C. Dwork, S. Kale, F. McSherry, and K. Talwar, “Privacy, accuracy, and consistency too: A holistic solution to contin- gency table release,” in Proceedings of the twenty-sixth ACM SIGMOD- SIGACT-SIGART symposium on Principles of database systems , 2007,...

    2007

  13. [21]

    Differential privacy via wavelet transforms,

    X. Xiao, G. Wang, and J. Gehrke, “Differential privacy via wavelet transforms,” IEEE Transactions on knowledge and data engineering , vol. 23, no. 8, pp. 1200–1214, 2010

    2010

  14. [22]

    Differential privacy for protecting multi-dimensional contingency table data: Extensions and applications,

    X. Yang, S. E. Fienberg, and A. Rinaldo, “Differential privacy for protecting multi-dimensional contingency table data: Extensions and applications,” Journal of Privacy and Confidentiality, vol. 4, no. 1, 2012

    2012

  15. [23]

    Differentially private distribution estima- tion using functional approximation,

    Y . Tao and A. D. Sarwate, “Differentially private distribution estima- tion using functional approximation,” in ICASSP 2025 - 2025 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2025, pp. 1–5

    2025

  16. [24]

    An operational approach to information leakage,

    I. Issa, A. B. Wagner, and S. Kamath, “An operational approach to information leakage,” IEEE Transactions on Information Theory, vol. 66, no. 3, pp. 1625–1657, 2019

    2019

  17. [25]

    Measuring information leakage using generalized gain functions,

    M. S. Alvim, K. Chatzikokolakis, C. Palamidessi, and G. Smith, “Measuring information leakage using generalized gain functions,” in 2012 IEEE 25th Computer Security Foundations Symposium , 2012, pp. 265–279

    2012

  18. [26]

    Additive and multiplicative notions of leakage, and their capacities,

    M. S. Alvim, K. Chatzikokolakis, A. McIver, C. Morgan, C. Palamidessi, and G. Smith, “Additive and multiplicative notions of leakage, and their capacities,” in 2014 IEEE 27th Computer Security Foundations Symposium, 2014, pp. 308–322

    2014

  19. [27]

    Our data, ourselves: Privacy via distributed noise generation,

    C. Dwork, K. Kenthapadi, F. McSherry, I. Mironov, and M. Naor, “Our data, ourselves: Privacy via distributed noise generation,” in Advances in Cryptology - EUROCRYPT 2006, S. Vaudenay, Ed. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, vol. 4004, pp. 486–503

    2006

  20. [28]

    Concentrated differential privacy: Simplifi- cations, extensions, and lower bounds,

    M. Bun and T. Steinke, “Concentrated differential privacy: Simplifi- cations, extensions, and lower bounds,” in Theory of Cryptography Conference. Springer, 2016, pp. 635–658

    2016

  21. [29]

    Concentrated differential privacy,

    C. Dwork and G. N. Rothblum, “Concentrated differential privacy,” arXiv preprint arXiv:1603.01887 , 2016

    2016 arXiv

  22. [30]

    R ´enyi differential privacy,

    I. Mironov, “R ´enyi differential privacy,” in 2017 IEEE 30th computer security foundations symposium (CSF) . IEEE, 2017, pp. 263–275

    2017

  23. [31]

    No free lunch in data privacy,

    D. Kifer and A. Machanavajjhala, “No free lunch in data privacy,” in Proceedings of the 2011 ACM SIGMOD International Conference on Management of data , ser. SIGMOD ’11. New York, NY , USA: Association for Computing Machinery, 2011, pp. 193–204

    2011

  24. [32]

    Extremal mechanisms for local differential privacy,

    P. Kairouz, S. Oh, and P. Viswanath, “Extremal mechanisms for local differential privacy,” Journal of Machine Learning Research , vol. 17, no. 17, pp. 1–51, 2016

    2016

  25. [33]

    Universally utility- maximizing privacy mechanisms,

    A. Ghosh, T. Roughgarden, and M. Sundararajan, “Universally utility- maximizing privacy mechanisms,” in Proceedings of the forty-first annual ACM symposium on Theory of computing , 2009, pp. 351–360

    2009

  26. [34]

    Improving the privacy loss under user-level dp composition for fixed estimation error,

    V . A. Rameshwar and A. Tandon, “Improving the privacy loss under user-level dp composition for fixed estimation error,” arXiv preprint arXiv:2405.06261, 2024

    2024 arXiv

Pith tools

Reviewed August 5, 2026 · model on record in the stance chip above.