{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:XFH7UNDFA5HBTRN5O3T2NJRXKR","short_pith_number":"pith:XFH7UNDF","canonical_record":{"source":{"id":"1012.3059","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-14T15:30:35Z","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"title_canon_sha256":"39aa7b71c43faae94c32da91fb463a5cc269730bfb0b8a7f4c5883fb37b37234","abstract_canon_sha256":"8195a8174dd4f6a2af4f9831f4d5d529e5911f4121ef01a8c82ceeb6035a37a9"},"schema_version":"1.0"},"canonical_sha256":"b94ffa3465074e19c5bd76e7a6a6375466c7abaf65789de56a2ede496d37844c","source":{"kind":"arxiv","id":"1012.3059","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.3059","created_at":"2026-05-18T03:51:36Z"},{"alias_kind":"arxiv_version","alias_value":"1012.3059v3","created_at":"2026-05-18T03:51:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.3059","created_at":"2026-05-18T03:51:36Z"},{"alias_kind":"pith_short_12","alias_value":"XFH7UNDFA5HB","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"XFH7UNDFA5HBTRN5","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"XFH7UNDF","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:XFH7UNDFA5HBTRN5O3T2NJRXKR","target":"record","payload":{"canonical_record":{"source":{"id":"1012.3059","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-14T15:30:35Z","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"title_canon_sha256":"39aa7b71c43faae94c32da91fb463a5cc269730bfb0b8a7f4c5883fb37b37234","abstract_canon_sha256":"8195a8174dd4f6a2af4f9831f4d5d529e5911f4121ef01a8c82ceeb6035a37a9"},"schema_version":"1.0"},"canonical_sha256":"b94ffa3465074e19c5bd76e7a6a6375466c7abaf65789de56a2ede496d37844c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:36.043254Z","signature_b64":"3xq1Bbvr6oeIP/gAWQ5Ud1Lx+pdC4IMV4vEvcMgmWI4KXC/0+G0Pbi8BD0J2DQ6dCkJiVjaLPv3ig31E6YpjAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b94ffa3465074e19c5bd76e7a6a6375466c7abaf65789de56a2ede496d37844c","last_reissued_at":"2026-05-18T03:51:36.042401Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:36.042401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1012.3059","source_version":3,"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:51:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M37EqLPWRvgHJE7r6EnXncggpOKGhrwgFvvf7nyRA/kTQ89OKwBwf5uihwREFj7Rr8bW07Ot7mzvnygwaDgqBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:03:59.231168Z"},"content_sha256":"a60e63f94a95b3b7446ba03690c6ae205c5c5bc88a5bde74cff4d2b8a9842fce","schema_version":"1.0","event_id":"sha256:a60e63f94a95b3b7446ba03690c6ae205c5c5bc88a5bde74cff4d2b8a9842fce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:XFH7UNDFA5HBTRN5O3T2NJRXKR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Confidence Sets in Time-Series Filtering","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":"2010-12-14T15:30:35Z","abstract_excerpt":"The problem of filtering of finite-alphabet stationary ergodic time series is considered. A method for constructing a confidence set for the (unknown) signal is proposed, such that the resulting set has the following properties: First, it includes the unknown signal with probability $\\gamma$, where $\\gamma$ is a parameter supplied to the filter. Second, the size of the confidence sets grows exponentially with the rate that is asymptotically equal to the conditional entropy of the signal given the data. Moreover, it is shown that this rate is optimal."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.3059","kind":"arxiv","version":3},"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:51:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1g2tmgx9SA3F3rw70ECkOZYHWhlFZQFuKKPb3x2Xx2IXagg5SMrGrqRGoDCwHXAgnmfLedrddY4eStQmW21jAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:03:59.231874Z"},"content_sha256":"578eb29f46a38c6de1888cb2d7e6946df9c607b90f9b363bf16451717cce59c4","schema_version":"1.0","event_id":"sha256:578eb29f46a38c6de1888cb2d7e6946df9c607b90f9b363bf16451717cce59c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XFH7UNDFA5HBTRN5O3T2NJRXKR/bundle.json","state_url":"https://pith.science/pith/XFH7UNDFA5HBTRN5O3T2NJRXKR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XFH7UNDFA5HBTRN5O3T2NJRXKR/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-31T11:03:59Z","links":{"resolver":"https://pith.science/pith/XFH7UNDFA5HBTRN5O3T2NJRXKR","bundle":"https://pith.science/pith/XFH7UNDFA5HBTRN5O3T2NJRXKR/bundle.json","state":"https://pith.science/pith/XFH7UNDFA5HBTRN5O3T2NJRXKR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XFH7UNDFA5HBTRN5O3T2NJRXKR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:XFH7UNDFA5HBTRN5O3T2NJRXKR","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":"8195a8174dd4f6a2af4f9831f4d5d529e5911f4121ef01a8c82ceeb6035a37a9","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-14T15:30:35Z","title_canon_sha256":"39aa7b71c43faae94c32da91fb463a5cc269730bfb0b8a7f4c5883fb37b37234"},"schema_version":"1.0","source":{"id":"1012.3059","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.3059","created_at":"2026-05-18T03:51:36Z"},{"alias_kind":"arxiv_version","alias_value":"1012.3059v3","created_at":"2026-05-18T03:51:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.3059","created_at":"2026-05-18T03:51:36Z"},{"alias_kind":"pith_short_12","alias_value":"XFH7UNDFA5HB","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"XFH7UNDFA5HBTRN5","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"XFH7UNDF","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:578eb29f46a38c6de1888cb2d7e6946df9c607b90f9b363bf16451717cce59c4","target":"graph","created_at":"2026-05-18T03:51:36Z","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 filtering of finite-alphabet stationary ergodic time series is considered. A method for constructing a confidence set for the (unknown) signal is proposed, such that the resulting set has the following properties: First, it includes the unknown signal with probability $\\gamma$, where $\\gamma$ is a parameter supplied to the filter. Second, the size of the confidence sets grows exponentially with the rate that is asymptotically equal to the conditional entropy of the signal given the data. Moreover, it is shown that this rate is optimal.","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":"2010-12-14T15:30:35Z","title":"Confidence Sets in Time-Series Filtering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.3059","kind":"arxiv","version":3},"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:a60e63f94a95b3b7446ba03690c6ae205c5c5bc88a5bde74cff4d2b8a9842fce","target":"record","created_at":"2026-05-18T03:51:36Z","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":"8195a8174dd4f6a2af4f9831f4d5d529e5911f4121ef01a8c82ceeb6035a37a9","cross_cats_sorted":["math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-14T15:30:35Z","title_canon_sha256":"39aa7b71c43faae94c32da91fb463a5cc269730bfb0b8a7f4c5883fb37b37234"},"schema_version":"1.0","source":{"id":"1012.3059","kind":"arxiv","version":3}},"canonical_sha256":"b94ffa3465074e19c5bd76e7a6a6375466c7abaf65789de56a2ede496d37844c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b94ffa3465074e19c5bd76e7a6a6375466c7abaf65789de56a2ede496d37844c","first_computed_at":"2026-05-18T03:51:36.042401Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:36.042401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3xq1Bbvr6oeIP/gAWQ5Ud1Lx+pdC4IMV4vEvcMgmWI4KXC/0+G0Pbi8BD0J2DQ6dCkJiVjaLPv3ig31E6YpjAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:36.043254Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.3059","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a60e63f94a95b3b7446ba03690c6ae205c5c5bc88a5bde74cff4d2b8a9842fce","sha256:578eb29f46a38c6de1888cb2d7e6946df9c607b90f9b363bf16451717cce59c4"],"state_sha256":"2cfbd57a4c2ff86296ee0829cf21e425c49c84ca2961adf6f63435f76a2cc350"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RnAjwlDLK1ve6b0uXRDOllxS/H00wORusTAwyEjH8sHEpuK6tc0hvXbxkb2UhXzdOyphHGxiQJ73Vyocjt2ADg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T11:03:59.235500Z","bundle_sha256":"c901fba52a2cce5fe97c8d70e35c960c82b730da14c4e61ec833d6bb4e9b8485"}}