TL;DR
Paper available through the Elsevier webpage of the Journal of Theoretical Computer Science.
Expected log-posterior agreement allows to quantify the robustness of the Gibbs maximum-entropy posteriors for the given data.
Want to discuss anything? Comments are welcome via e-mail alexey@gronskiy.com, Telegram @agronskiy or any other social media.