{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OE2FS4MZDSWIR5G6P5RCT6L6AJ","short_pith_number":"pith:OE2FS4MZ","schema_version":"1.0","canonical_sha256":"71345971991cac88f4de7f6229f97e0240de388511c0bc0d38b44f605bae43fd","source":{"kind":"arxiv","id":"1906.10857","version":1},"attestation_state":"computed","paper":{"title":"Guessing Individual Sequences: Generating Randomized Guesses Using Finite-State Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Neri Merhav","submitted_at":"2019-06-26T06:10:57Z","abstract_excerpt":"Motivated by earlier results on universal randomized guessing, we consider an individual-sequence approach to the guessing problem: in this setting, the goal is to guess a secret, individual (deterministic) vector $x^n=(x_1,\\ldots,x_n)$, by using a finite-state machine that sequentially generates randomized guesses from a stream of purely random bits. We define the finite-state guessing exponent as the asymptotic normalized logarithm of the minimum achievable moment of the number of randomized guesses, generated by any finite-state machine, until $x^n$ is guessed successfully. We show that the"},"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":"1906.10857","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-26T06:10:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b52712a44f4c07922f80dd2af90099c61a1d0f535a6378d4fe268a2b6b4811aa","abstract_canon_sha256":"65c0281495e913161949c2a2a2fda8632255186c4330ddf8b9e96e32bad57fd8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:13.044868Z","signature_b64":"9ep66tIroKlY5xYR4ykzwBNg0TMGQ6ATyGjXDAQmZ+diTQrdt5UMcC8/tEwHSpl5ppePq/x6oF2MMhLpQxiyCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71345971991cac88f4de7f6229f97e0240de388511c0bc0d38b44f605bae43fd","last_reissued_at":"2026-05-17T23:42:13.044202Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:13.044202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Guessing Individual Sequences: Generating Randomized Guesses Using Finite-State Machines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Neri Merhav","submitted_at":"2019-06-26T06:10:57Z","abstract_excerpt":"Motivated by earlier results on universal randomized guessing, we consider an individual-sequence approach to the guessing problem: in this setting, the goal is to guess a secret, individual (deterministic) vector $x^n=(x_1,\\ldots,x_n)$, by using a finite-state machine that sequentially generates randomized guesses from a stream of purely random bits. We define the finite-state guessing exponent as the asymptotic normalized logarithm of the minimum achievable moment of the number of randomized guesses, generated by any finite-state machine, until $x^n$ is guessed successfully. We show that the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10857","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":"1906.10857","created_at":"2026-05-17T23:42:13.044302+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.10857v1","created_at":"2026-05-17T23:42:13.044302+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10857","created_at":"2026-05-17T23:42:13.044302+00:00"},{"alias_kind":"pith_short_12","alias_value":"OE2FS4MZDSWI","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"OE2FS4MZDSWIR5G6","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"OE2FS4MZ","created_at":"2026-05-18T12:33:24.271573+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OE2FS4MZDSWIR5G6P5RCT6L6AJ","json":"https://pith.science/pith/OE2FS4MZDSWIR5G6P5RCT6L6AJ.json","graph_json":"https://pith.science/api/pith-number/OE2FS4MZDSWIR5G6P5RCT6L6AJ/graph.json","events_json":"https://pith.science/api/pith-number/OE2FS4MZDSWIR5G6P5RCT6L6AJ/events.json","paper":"https://pith.science/paper/OE2FS4MZ"},"agent_actions":{"view_html":"https://pith.science/pith/OE2FS4MZDSWIR5G6P5RCT6L6AJ","download_json":"https://pith.science/pith/OE2FS4MZDSWIR5G6P5RCT6L6AJ.json","view_paper":"https://pith.science/paper/OE2FS4MZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.10857&json=true","fetch_graph":"https://pith.science/api/pith-number/OE2FS4MZDSWIR5G6P5RCT6L6AJ/graph.json","fetch_events":"https://pith.science/api/pith-number/OE2FS4MZDSWIR5G6P5RCT6L6AJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OE2FS4MZDSWIR5G6P5RCT6L6AJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OE2FS4MZDSWIR5G6P5RCT6L6AJ/action/storage_attestation","attest_author":"https://pith.science/pith/OE2FS4MZDSWIR5G6P5RCT6L6AJ/action/author_attestation","sign_citation":"https://pith.science/pith/OE2FS4MZDSWIR5G6P5RCT6L6AJ/action/citation_signature","submit_replication":"https://pith.science/pith/OE2FS4MZDSWIR5G6P5RCT6L6AJ/action/replication_record"}},"created_at":"2026-05-17T23:42:13.044302+00:00","updated_at":"2026-05-17T23:42:13.044302+00:00"}