{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YLRGDLVUZBALPNBDU5MEEVVB3E","short_pith_number":"pith:YLRGDLVU","schema_version":"1.0","canonical_sha256":"c2e261aeb4c840b7b423a7584256a1d9059ad1905a6dcc3677bb486372c4c016","source":{"kind":"arxiv","id":"1311.4500","version":4},"attestation_state":"computed","paper":{"title":"Time series prediction via aggregation : an oracle bound including numerical cost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Andres Sanchez-Perez (LTCI)","submitted_at":"2013-11-18T19:26:01Z","abstract_excerpt":"We address the problem of forecasting a time series meeting the Causal Bernoulli Shift model, using a parametric set of predictors. The aggregation technique provides a predictor with well established and quite satisfying theoretical properties expressed by an oracle inequality for the prediction risk. The numerical computation of the aggregated predictor usually relies on a Markov chain Monte Carlo method whose convergence should be evaluated. In particular, it is crucial to bound the number of simulations needed to achieve a numerical precision of the same order as the prediction risk. In th"},"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":"1311.4500","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2013-11-18T19:26:01Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"e53881db96c821af79a2472f9b907f276decbfbbf61a7254a97b5eae9e83f64a","abstract_canon_sha256":"d9e8a4916ca560fa6cbd3f62f891559d388fd741221d98b1becc0344a669fa8d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:08.276561Z","signature_b64":"Uye1fNBLleeUyHvo4J01mLZhkPIoo5HQFHmRqx7hbyz5gEIEYlQmlavWG81kSxeQGcWIuvSflEktWgJat/U+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2e261aeb4c840b7b423a7584256a1d9059ad1905a6dcc3677bb486372c4c016","last_reissued_at":"2026-05-18T02:51:08.276177Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:08.276177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Time series prediction via aggregation : an oracle bound including numerical cost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Andres Sanchez-Perez (LTCI)","submitted_at":"2013-11-18T19:26:01Z","abstract_excerpt":"We address the problem of forecasting a time series meeting the Causal Bernoulli Shift model, using a parametric set of predictors. The aggregation technique provides a predictor with well established and quite satisfying theoretical properties expressed by an oracle inequality for the prediction risk. The numerical computation of the aggregated predictor usually relies on a Markov chain Monte Carlo method whose convergence should be evaluated. In particular, it is crucial to bound the number of simulations needed to achieve a numerical precision of the same order as the prediction risk. In th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4500","kind":"arxiv","version":4},"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":"1311.4500","created_at":"2026-05-18T02:51:08.276233+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.4500v4","created_at":"2026-05-18T02:51:08.276233+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4500","created_at":"2026-05-18T02:51:08.276233+00:00"},{"alias_kind":"pith_short_12","alias_value":"YLRGDLVUZBAL","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"YLRGDLVUZBALPNBD","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"YLRGDLVU","created_at":"2026-05-18T12:28:06.772260+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/YLRGDLVUZBALPNBDU5MEEVVB3E","json":"https://pith.science/pith/YLRGDLVUZBALPNBDU5MEEVVB3E.json","graph_json":"https://pith.science/api/pith-number/YLRGDLVUZBALPNBDU5MEEVVB3E/graph.json","events_json":"https://pith.science/api/pith-number/YLRGDLVUZBALPNBDU5MEEVVB3E/events.json","paper":"https://pith.science/paper/YLRGDLVU"},"agent_actions":{"view_html":"https://pith.science/pith/YLRGDLVUZBALPNBDU5MEEVVB3E","download_json":"https://pith.science/pith/YLRGDLVUZBALPNBDU5MEEVVB3E.json","view_paper":"https://pith.science/paper/YLRGDLVU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.4500&json=true","fetch_graph":"https://pith.science/api/pith-number/YLRGDLVUZBALPNBDU5MEEVVB3E/graph.json","fetch_events":"https://pith.science/api/pith-number/YLRGDLVUZBALPNBDU5MEEVVB3E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YLRGDLVUZBALPNBDU5MEEVVB3E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YLRGDLVUZBALPNBDU5MEEVVB3E/action/storage_attestation","attest_author":"https://pith.science/pith/YLRGDLVUZBALPNBDU5MEEVVB3E/action/author_attestation","sign_citation":"https://pith.science/pith/YLRGDLVUZBALPNBDU5MEEVVB3E/action/citation_signature","submit_replication":"https://pith.science/pith/YLRGDLVUZBALPNBDU5MEEVVB3E/action/replication_record"}},"created_at":"2026-05-18T02:51:08.276233+00:00","updated_at":"2026-05-18T02:51:08.276233+00:00"}