{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NBVARUWGKKQMKLHH2CVIJ3THLX","short_pith_number":"pith:NBVARUWG","canonical_record":{"source":{"id":"1509.07776","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-25T16:23:26Z","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"title_canon_sha256":"3ee4b45fa543a14a0d6ca3e0cba306293e2981b5d82eb6e3e7e197433c00a1da","abstract_canon_sha256":"275c1522e9831d9e2cd359b70ad802bebe73424fa5a7574fbd0e6d91a1bfd373"},"schema_version":"1.0"},"canonical_sha256":"686a08d2c652a0c52ce7d0aa84ee675df74be7f978c2d7e53115d5697ddcad52","source":{"kind":"arxiv","id":"1509.07776","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07776","created_at":"2026-05-18T01:32:01Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07776v1","created_at":"2026-05-18T01:32:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07776","created_at":"2026-05-18T01:32:01Z"},{"alias_kind":"pith_short_12","alias_value":"NBVARUWGKKQM","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NBVARUWGKKQMKLHH","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NBVARUWG","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NBVARUWGKKQMKLHH2CVIJ3THLX","target":"record","payload":{"canonical_record":{"source":{"id":"1509.07776","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-25T16:23:26Z","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"title_canon_sha256":"3ee4b45fa543a14a0d6ca3e0cba306293e2981b5d82eb6e3e7e197433c00a1da","abstract_canon_sha256":"275c1522e9831d9e2cd359b70ad802bebe73424fa5a7574fbd0e6d91a1bfd373"},"schema_version":"1.0"},"canonical_sha256":"686a08d2c652a0c52ce7d0aa84ee675df74be7f978c2d7e53115d5697ddcad52","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:01.970645Z","signature_b64":"h65v0g6dJcB9hOn3mYMQbMkWG2q28LAZ9ZtFr6Rr5gsHNh+as3TKeI87qeT2AgBiLC338s6Du5qCInWS8fKJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"686a08d2c652a0c52ce7d0aa84ee675df74be7f978c2d7e53115d5697ddcad52","last_reissued_at":"2026-05-18T01:32:01.970227Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:01.970227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.07776","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-18T01:32:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xwRnARN23XpldurXXfoLsY2KO/7ix68LBgK+VtQqKT7BG5iVidN85A3m+eXNdwcSjUnqECxQH1r27UC92I4xBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:58:10.797925Z"},"content_sha256":"6fc30ccba3bc4373b783e704c8b43e4870a670516f7cab6395f58f2e02b940b1","schema_version":"1.0","event_id":"sha256:6fc30ccba3bc4373b783e704c8b43e4870a670516f7cab6395f58f2e02b940b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NBVARUWGKKQMKLHH2CVIJ3THLX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Predicting the outcomes of every process for which an asymptotically accurate stationary predictor exists is impossible","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Boris Ryabko, Daniil Ryabko","submitted_at":"2015-09-25T16:23:26Z","abstract_excerpt":"The problem of prediction consists in forecasting the conditional distribution of the next outcome given the past. Assume that the source generating the data is such that there is a stationary ergodic predictor whose error converges to zero (in a certain sense). The question is whether there is a universal predictor for all such sources, that is, a predictor whose error goes to zero if any of the sources that have this property is chosen to generate the data. This question is answered in the negative, contrasting a number of previously established positive results concerning related but smalle"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07776","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-18T01:32:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6e83zvkTL6Ihy3hVZXJufauypEr5473krq/UiUJEJKVXYQrObDElEf3Gy2SQz5mRkLFEGlzRklptHhpk1ysUDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:58:10.798722Z"},"content_sha256":"19adbc0058685347d1df92f212319104cafb617e2760b10cc57fcf2242a061ac","schema_version":"1.0","event_id":"sha256:19adbc0058685347d1df92f212319104cafb617e2760b10cc57fcf2242a061ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NBVARUWGKKQMKLHH2CVIJ3THLX/bundle.json","state_url":"https://pith.science/pith/NBVARUWGKKQMKLHH2CVIJ3THLX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NBVARUWGKKQMKLHH2CVIJ3THLX/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-31T09:58:10Z","links":{"resolver":"https://pith.science/pith/NBVARUWGKKQMKLHH2CVIJ3THLX","bundle":"https://pith.science/pith/NBVARUWGKKQMKLHH2CVIJ3THLX/bundle.json","state":"https://pith.science/pith/NBVARUWGKKQMKLHH2CVIJ3THLX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NBVARUWGKKQMKLHH2CVIJ3THLX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NBVARUWGKKQMKLHH2CVIJ3THLX","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":"275c1522e9831d9e2cd359b70ad802bebe73424fa5a7574fbd0e6d91a1bfd373","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-25T16:23:26Z","title_canon_sha256":"3ee4b45fa543a14a0d6ca3e0cba306293e2981b5d82eb6e3e7e197433c00a1da"},"schema_version":"1.0","source":{"id":"1509.07776","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07776","created_at":"2026-05-18T01:32:01Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07776v1","created_at":"2026-05-18T01:32:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07776","created_at":"2026-05-18T01:32:01Z"},{"alias_kind":"pith_short_12","alias_value":"NBVARUWGKKQM","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NBVARUWGKKQMKLHH","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NBVARUWG","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:19adbc0058685347d1df92f212319104cafb617e2760b10cc57fcf2242a061ac","target":"graph","created_at":"2026-05-18T01:32:01Z","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":"The problem of prediction consists in forecasting the conditional distribution of the next outcome given the past. Assume that the source generating the data is such that there is a stationary ergodic predictor whose error converges to zero (in a certain sense). The question is whether there is a universal predictor for all such sources, that is, a predictor whose error goes to zero if any of the sources that have this property is chosen to generate the data. This question is answered in the negative, contrasting a number of previously established positive results concerning related but smalle","authors_text":"Boris Ryabko, Daniil Ryabko","cross_cats":["math.IT","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-25T16:23:26Z","title":"Predicting the outcomes of every process for which an asymptotically accurate stationary predictor exists is impossible"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07776","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:6fc30ccba3bc4373b783e704c8b43e4870a670516f7cab6395f58f2e02b940b1","target":"record","created_at":"2026-05-18T01:32:01Z","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":"275c1522e9831d9e2cd359b70ad802bebe73424fa5a7574fbd0e6d91a1bfd373","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-25T16:23:26Z","title_canon_sha256":"3ee4b45fa543a14a0d6ca3e0cba306293e2981b5d82eb6e3e7e197433c00a1da"},"schema_version":"1.0","source":{"id":"1509.07776","kind":"arxiv","version":1}},"canonical_sha256":"686a08d2c652a0c52ce7d0aa84ee675df74be7f978c2d7e53115d5697ddcad52","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"686a08d2c652a0c52ce7d0aa84ee675df74be7f978c2d7e53115d5697ddcad52","first_computed_at":"2026-05-18T01:32:01.970227Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:01.970227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h65v0g6dJcB9hOn3mYMQbMkWG2q28LAZ9ZtFr6Rr5gsHNh+as3TKeI87qeT2AgBiLC338s6Du5qCInWS8fKJDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:01.970645Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.07776","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6fc30ccba3bc4373b783e704c8b43e4870a670516f7cab6395f58f2e02b940b1","sha256:19adbc0058685347d1df92f212319104cafb617e2760b10cc57fcf2242a061ac"],"state_sha256":"f8811274819ebac7a60fa02d3a55e61b6aa6acb0d326d023d05754c1dc308369"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zWHjKg0/Yqe4TOXcunqGWG+sF/Hvb7OqEv5MPD8rzEzAte3o3fBjZ9mwUj1hnaHiAS2dxT9J0P8Btro3MEwPAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:58:10.803137Z","bundle_sha256":"5ac1c3d9e462ad3ea876a481ac5a521674ed10b9a93d6c49ff7a7774ceddbf49"}}