{"paper":{"title":"Universal Randomized Guessing with Application to Asynchronous Decentralized Brute-Force Attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Asaf Cohen, Neri Merhav","submitted_at":"2018-11-11T07:00:19Z","abstract_excerpt":"Consider the problem of guessing the realization of a random vector $\\textbf{X}$ by repeatedly submitting queries (guesses) of the form \"Is $\\textbf{X}$ equal to $\\textbf{x}$?\" until an affirmative answer is obtained. In this setup, a key figure of merit is the number of queries required until the right vector is identified, a number that is termed the \\emph{guesswork}. Typically, one wishes to devise a guessing strategy which minimizes a certain guesswork moment.\n  In this work, we study a universal, decentralized scenario where the guesser does not know the distribution of $\\textbf{X}$, and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04363","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}