{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OE2FS4MZDSWIR5G6P5RCT6L6AJ","short_pith_number":"pith:OE2FS4MZ","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"},"canonical_sha256":"71345971991cac88f4de7f6229f97e0240de388511c0bc0d38b44f605bae43fd","source":{"kind":"arxiv","id":"1906.10857","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.10857","created_at":"2026-05-17T23:42:13Z"},{"alias_kind":"arxiv_version","alias_value":"1906.10857v1","created_at":"2026-05-17T23:42:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10857","created_at":"2026-05-17T23:42:13Z"},{"alias_kind":"pith_short_12","alias_value":"OE2FS4MZDSWI","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OE2FS4MZDSWIR5G6","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OE2FS4MZ","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OE2FS4MZDSWIR5G6P5RCT6L6AJ","target":"record","payload":{"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"},"canonical_sha256":"71345971991cac88f4de7f6229f97e0240de388511c0bc0d38b44f605bae43fd","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"},"source_kind":"arxiv","source_id":"1906.10857","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:42:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V2w+q3WDOBIpuwEfbgD+1mbbg6w/WX9IdNu/yW+U5vvJHtBg6c5b7fzsCEuzuvrYcePld/+DVf4dLiAEmOzuDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:00:03.114068Z"},"content_sha256":"3ee693dd6689ad4e37ef621eb92acf9113ce332a7178a861a6cd9f8d36637165","schema_version":"1.0","event_id":"sha256:3ee693dd6689ad4e37ef621eb92acf9113ce332a7178a861a6cd9f8d36637165"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OE2FS4MZDSWIR5G6P5RCT6L6AJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:42:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wu6Ez1YxvckrgOqurhJmtpaFvjD3F5XN7QeFGE7fmSG3nluMxbHWwaFyhkgAvhih9az5+H3NGAsrukFOCaVeCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:00:03.114499Z"},"content_sha256":"e11e9c9268b2d8b14ec5fc5cf937e6b1bc8e5572a56cbc0dc691a97b46e029a4","schema_version":"1.0","event_id":"sha256:e11e9c9268b2d8b14ec5fc5cf937e6b1bc8e5572a56cbc0dc691a97b46e029a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OE2FS4MZDSWIR5G6P5RCT6L6AJ/bundle.json","state_url":"https://pith.science/pith/OE2FS4MZDSWIR5G6P5RCT6L6AJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OE2FS4MZDSWIR5G6P5RCT6L6AJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T13:00:03Z","links":{"resolver":"https://pith.science/pith/OE2FS4MZDSWIR5G6P5RCT6L6AJ","bundle":"https://pith.science/pith/OE2FS4MZDSWIR5G6P5RCT6L6AJ/bundle.json","state":"https://pith.science/pith/OE2FS4MZDSWIR5G6P5RCT6L6AJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OE2FS4MZDSWIR5G6P5RCT6L6AJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OE2FS4MZDSWIR5G6P5RCT6L6AJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"65c0281495e913161949c2a2a2fda8632255186c4330ddf8b9e96e32bad57fd8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-26T06:10:57Z","title_canon_sha256":"b52712a44f4c07922f80dd2af90099c61a1d0f535a6378d4fe268a2b6b4811aa"},"schema_version":"1.0","source":{"id":"1906.10857","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.10857","created_at":"2026-05-17T23:42:13Z"},{"alias_kind":"arxiv_version","alias_value":"1906.10857v1","created_at":"2026-05-17T23:42:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10857","created_at":"2026-05-17T23:42:13Z"},{"alias_kind":"pith_short_12","alias_value":"OE2FS4MZDSWI","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OE2FS4MZDSWIR5G6","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OE2FS4MZ","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:e11e9c9268b2d8b14ec5fc5cf937e6b1bc8e5572a56cbc0dc691a97b46e029a4","target":"graph","created_at":"2026-05-17T23:42:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Neri Merhav","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-26T06:10:57Z","title":"Guessing Individual Sequences: Generating Randomized Guesses Using Finite-State Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10857","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3ee693dd6689ad4e37ef621eb92acf9113ce332a7178a861a6cd9f8d36637165","target":"record","created_at":"2026-05-17T23:42:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"65c0281495e913161949c2a2a2fda8632255186c4330ddf8b9e96e32bad57fd8","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-26T06:10:57Z","title_canon_sha256":"b52712a44f4c07922f80dd2af90099c61a1d0f535a6378d4fe268a2b6b4811aa"},"schema_version":"1.0","source":{"id":"1906.10857","kind":"arxiv","version":1}},"canonical_sha256":"71345971991cac88f4de7f6229f97e0240de388511c0bc0d38b44f605bae43fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"71345971991cac88f4de7f6229f97e0240de388511c0bc0d38b44f605bae43fd","first_computed_at":"2026-05-17T23:42:13.044202Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:13.044202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9ep66tIroKlY5xYR4ykzwBNg0TMGQ6ATyGjXDAQmZ+diTQrdt5UMcC8/tEwHSpl5ppePq/x6oF2MMhLpQxiyCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:13.044868Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.10857","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ee693dd6689ad4e37ef621eb92acf9113ce332a7178a861a6cd9f8d36637165","sha256:e11e9c9268b2d8b14ec5fc5cf937e6b1bc8e5572a56cbc0dc691a97b46e029a4"],"state_sha256":"0071ca73d221bbb6bab864a89d32fe91d5bd05bd3cd401b1dcf9228c2d455a94"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SHJdyGUaDHiLuIcgz3y87fud0U6oPSjT3uMSPIXl3tGdFyxph9sQTa1+mpI6hgOwxRLNQ+t7KxmBaQNhj0aOBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:00:03.117991Z","bundle_sha256":"0e1c9ef5b95f1c88d8f8b60b9bfa399845916799707611a3460baf60e0683421"}}