{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:CLCREDICHYFREJ6Z22YSPCM3MF","short_pith_number":"pith:CLCREDIC","canonical_record":{"source":{"id":"1311.6396","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-25T18:36:26Z","cross_cats_sorted":[],"title_canon_sha256":"edf141f6c442ccf7f009456800af256dd2b9c474b7d9b63f150ae6ee46446a39","abstract_canon_sha256":"b32370e39699c5fd688afb63b0e892629581b4355c2e831f11f9a2d96d3a0f16"},"schema_version":"1.0"},"canonical_sha256":"12c5120d023e0b1227d9d6b127899b6152cc8a3454b8d3f41f6204ca2ef21afb","source":{"kind":"arxiv","id":"1311.6396","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.6396","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"arxiv_version","alias_value":"1311.6396v2","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6396","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"pith_short_12","alias_value":"CLCREDICHYFR","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CLCREDICHYFREJ6Z","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CLCREDIC","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:CLCREDICHYFREJ6Z22YSPCM3MF","target":"record","payload":{"canonical_record":{"source":{"id":"1311.6396","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-25T18:36:26Z","cross_cats_sorted":[],"title_canon_sha256":"edf141f6c442ccf7f009456800af256dd2b9c474b7d9b63f150ae6ee46446a39","abstract_canon_sha256":"b32370e39699c5fd688afb63b0e892629581b4355c2e831f11f9a2d96d3a0f16"},"schema_version":"1.0"},"canonical_sha256":"12c5120d023e0b1227d9d6b127899b6152cc8a3454b8d3f41f6204ca2ef21afb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:23.952754Z","signature_b64":"ieDSlp83osWCHfhGqo4dmnW/OHpwwHSMJeMdlA/8w+/YxegwXZ3YPrc/iJ6jr2soZD5cLcgMisgo+7vmd6yoDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12c5120d023e0b1227d9d6b127899b6152cc8a3454b8d3f41f6204ca2ef21afb","last_reissued_at":"2026-05-18T03:01:23.952077Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:23.952077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.6396","source_version":2,"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-18T03:01:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WLs64gio9/h28Sjf16oFoJmcYiq/8Tjn8ni9V1iIwycd4siXAIUnOPWBzzIyKI4zQCyKywcr61wVHYXe4P+dCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T02:37:05.615249Z"},"content_sha256":"ed701c500e4a89c6657213606bb3562d4520359bf788d3e30750a97463dbd6f9","schema_version":"1.0","event_id":"sha256:ed701c500e4a89c6657213606bb3562d4520359bf788d3e30750a97463dbd6f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:CLCREDICHYFREJ6Z22YSPCM3MF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Unified Approach to Universal Prediction: Generalized Upper and Lower Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"N. Denizcan Vanli, Suleyman S. Kozat","submitted_at":"2013-11-25T18:36:26Z","abstract_excerpt":"We study sequential prediction of real-valued, arbitrary and unknown sequences under the squared error loss as well as the best parametric predictor out of a large, continuous class of predictors. Inspired by recent results from computational learning theory, we refrain from any statistical assumptions and define the performance with respect to the class of general parametric predictors. In particular, we present generic lower and upper bounds on this relative performance by transforming the prediction task into a parameter learning problem. We first introduce the lower bounds on this relative"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6396","kind":"arxiv","version":2},"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-18T03:01:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Afx6ugBlYDQD7UiFrFxeY4lDnK/1dd8xrrnLbyuHb2Ey4phfFoRPwbOn4G4XP8ACS2CRnZQyJPs7WTzCEWsLCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T02:37:05.615614Z"},"content_sha256":"59a7b2d693a3c32e53ac3a0d2ed48e8f95a038fccd255892be67e9661637c8a5","schema_version":"1.0","event_id":"sha256:59a7b2d693a3c32e53ac3a0d2ed48e8f95a038fccd255892be67e9661637c8a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CLCREDICHYFREJ6Z22YSPCM3MF/bundle.json","state_url":"https://pith.science/pith/CLCREDICHYFREJ6Z22YSPCM3MF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CLCREDICHYFREJ6Z22YSPCM3MF/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-06-26T02:37:05Z","links":{"resolver":"https://pith.science/pith/CLCREDICHYFREJ6Z22YSPCM3MF","bundle":"https://pith.science/pith/CLCREDICHYFREJ6Z22YSPCM3MF/bundle.json","state":"https://pith.science/pith/CLCREDICHYFREJ6Z22YSPCM3MF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CLCREDICHYFREJ6Z22YSPCM3MF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CLCREDICHYFREJ6Z22YSPCM3MF","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":"b32370e39699c5fd688afb63b0e892629581b4355c2e831f11f9a2d96d3a0f16","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-25T18:36:26Z","title_canon_sha256":"edf141f6c442ccf7f009456800af256dd2b9c474b7d9b63f150ae6ee46446a39"},"schema_version":"1.0","source":{"id":"1311.6396","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.6396","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"arxiv_version","alias_value":"1311.6396v2","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6396","created_at":"2026-05-18T03:01:23Z"},{"alias_kind":"pith_short_12","alias_value":"CLCREDICHYFR","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CLCREDICHYFREJ6Z","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CLCREDIC","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:59a7b2d693a3c32e53ac3a0d2ed48e8f95a038fccd255892be67e9661637c8a5","target":"graph","created_at":"2026-05-18T03:01:23Z","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":"We study sequential prediction of real-valued, arbitrary and unknown sequences under the squared error loss as well as the best parametric predictor out of a large, continuous class of predictors. Inspired by recent results from computational learning theory, we refrain from any statistical assumptions and define the performance with respect to the class of general parametric predictors. In particular, we present generic lower and upper bounds on this relative performance by transforming the prediction task into a parameter learning problem. We first introduce the lower bounds on this relative","authors_text":"N. Denizcan Vanli, Suleyman S. Kozat","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-25T18:36:26Z","title":"A Unified Approach to Universal Prediction: Generalized Upper and Lower Bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6396","kind":"arxiv","version":2},"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:ed701c500e4a89c6657213606bb3562d4520359bf788d3e30750a97463dbd6f9","target":"record","created_at":"2026-05-18T03:01:23Z","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":"b32370e39699c5fd688afb63b0e892629581b4355c2e831f11f9a2d96d3a0f16","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-11-25T18:36:26Z","title_canon_sha256":"edf141f6c442ccf7f009456800af256dd2b9c474b7d9b63f150ae6ee46446a39"},"schema_version":"1.0","source":{"id":"1311.6396","kind":"arxiv","version":2}},"canonical_sha256":"12c5120d023e0b1227d9d6b127899b6152cc8a3454b8d3f41f6204ca2ef21afb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12c5120d023e0b1227d9d6b127899b6152cc8a3454b8d3f41f6204ca2ef21afb","first_computed_at":"2026-05-18T03:01:23.952077Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:23.952077Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ieDSlp83osWCHfhGqo4dmnW/OHpwwHSMJeMdlA/8w+/YxegwXZ3YPrc/iJ6jr2soZD5cLcgMisgo+7vmd6yoDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:23.952754Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.6396","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed701c500e4a89c6657213606bb3562d4520359bf788d3e30750a97463dbd6f9","sha256:59a7b2d693a3c32e53ac3a0d2ed48e8f95a038fccd255892be67e9661637c8a5"],"state_sha256":"ad7320549989b5d6be6dc3120be4ad2142f09929075642aef5b2ea38876f4cc2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pk02TNziPMN5NZH4X8+HWSJYAgOB2guEJ6PfNk+4gE4VjJp6K1PiTbE8/Yx+HI64suJzak3XeIE8ubl8OtUoDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T02:37:05.617806Z","bundle_sha256":"1c861afd89047a1126aa272d421ee0fdc2ad4346f30c81e514271f40c4762984"}}