{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KAFBF2H7LAGI74MBWLI55YJ6LB","short_pith_number":"pith:KAFBF2H7","schema_version":"1.0","canonical_sha256":"500a12e8ff580c8ff181b2d1dee13e5844ff423b47072762813e0a2b907d4d0e","source":{"kind":"arxiv","id":"1811.04363","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1811.04363","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-11T07:00:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b469b41f84cfedff875d872a28428a31c9210908346af24b9d2b42126021a10f","abstract_canon_sha256":"303ef0154b4368908639d76ed9aa0ac6a156b8ac69b24bba8ff4e579f9af4185"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:05.409503Z","signature_b64":"2ndlU8KV6WAO+fOddWI0tBW4xzFvDn4+Gs74dhF+aWSkBzqxHR+mCO9bk4Xd0NbGJbR0jx5pyjAMEIazWOMiCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"500a12e8ff580c8ff181b2d1dee13e5844ff423b47072762813e0a2b907d4d0e","last_reissued_at":"2026-05-18T00:01:05.408817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:05.408817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.04363","created_at":"2026-05-18T00:01:05.408913+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.04363v1","created_at":"2026-05-18T00:01:05.408913+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04363","created_at":"2026-05-18T00:01:05.408913+00:00"},{"alias_kind":"pith_short_12","alias_value":"KAFBF2H7LAGI","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KAFBF2H7LAGI74MB","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KAFBF2H7","created_at":"2026-05-18T12:32:33.847187+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.00531","citing_title":"Mismatched Guesswork","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KAFBF2H7LAGI74MBWLI55YJ6LB","json":"https://pith.science/pith/KAFBF2H7LAGI74MBWLI55YJ6LB.json","graph_json":"https://pith.science/api/pith-number/KAFBF2H7LAGI74MBWLI55YJ6LB/graph.json","events_json":"https://pith.science/api/pith-number/KAFBF2H7LAGI74MBWLI55YJ6LB/events.json","paper":"https://pith.science/paper/KAFBF2H7"},"agent_actions":{"view_html":"https://pith.science/pith/KAFBF2H7LAGI74MBWLI55YJ6LB","download_json":"https://pith.science/pith/KAFBF2H7LAGI74MBWLI55YJ6LB.json","view_paper":"https://pith.science/paper/KAFBF2H7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.04363&json=true","fetch_graph":"https://pith.science/api/pith-number/KAFBF2H7LAGI74MBWLI55YJ6LB/graph.json","fetch_events":"https://pith.science/api/pith-number/KAFBF2H7LAGI74MBWLI55YJ6LB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KAFBF2H7LAGI74MBWLI55YJ6LB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KAFBF2H7LAGI74MBWLI55YJ6LB/action/storage_attestation","attest_author":"https://pith.science/pith/KAFBF2H7LAGI74MBWLI55YJ6LB/action/author_attestation","sign_citation":"https://pith.science/pith/KAFBF2H7LAGI74MBWLI55YJ6LB/action/citation_signature","submit_replication":"https://pith.science/pith/KAFBF2H7LAGI74MBWLI55YJ6LB/action/replication_record"}},"created_at":"2026-05-18T00:01:05.408913+00:00","updated_at":"2026-05-18T00:01:05.408913+00:00"}