{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:ZWBSBIHFNL3IP3HIUG676ERELQ","short_pith_number":"pith:ZWBSBIHF","schema_version":"1.0","canonical_sha256":"cd8320a0e56af687ece8a1bdff12245c15c8bf373c2bae0fdb1a177ff21e3eff","source":{"kind":"arxiv","id":"0708.2566","version":1},"attestation_state":"computed","paper":{"title":"Discrete Denoising with Shifts","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Taesup Moon, Tsachy Weissman","submitted_at":"2007-08-20T03:00:20Z","abstract_excerpt":"We introduce S-DUDE, a new algorithm for denoising DMC-corrupted data. The algorithm, which generalizes the recently introduced DUDE (Discrete Universal DEnoiser) of Weissman et al., aims to compete with a genie that has access, in addition to the noisy data, also to the underlying clean data, and can choose to switch, up to $m$ times, between sliding window denoisers in a way that minimizes the overall loss. When the underlying data form an individual sequence, we show that the S-DUDE performs essentially as well as this genie, provided that $m$ is sub-linear in the size of the data. When the"},"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":"0708.2566","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2007-08-20T03:00:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6f7edcbe4ed632058fabc616d0d0827b1a1b2ca0181714393b099a9ea9430601","abstract_canon_sha256":"988596831c324f5437f12b4ff705089749582a31b49e51b0215bc90e1ce6287e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:48.862059Z","signature_b64":"CItOtf3ACsBsia6dl8JgUKsgTAd0qIsE442/L8leu0Rx3WlsW3Y5w/qfC7CJHKruPfbI05hkCSFQMtzl6+vtBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd8320a0e56af687ece8a1bdff12245c15c8bf373c2bae0fdb1a177ff21e3eff","last_reissued_at":"2026-05-18T00:58:48.861365Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:48.861365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discrete Denoising with Shifts","license":"","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Taesup Moon, Tsachy Weissman","submitted_at":"2007-08-20T03:00:20Z","abstract_excerpt":"We introduce S-DUDE, a new algorithm for denoising DMC-corrupted data. The algorithm, which generalizes the recently introduced DUDE (Discrete Universal DEnoiser) of Weissman et al., aims to compete with a genie that has access, in addition to the noisy data, also to the underlying clean data, and can choose to switch, up to $m$ times, between sliding window denoisers in a way that minimizes the overall loss. When the underlying data form an individual sequence, we show that the S-DUDE performs essentially as well as this genie, provided that $m$ is sub-linear in the size of the data. When the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0708.2566","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0708.2566","created_at":"2026-05-18T00:58:48.861470+00:00"},{"alias_kind":"arxiv_version","alias_value":"0708.2566v1","created_at":"2026-05-18T00:58:48.861470+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0708.2566","created_at":"2026-05-18T00:58:48.861470+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZWBSBIHFNL3I","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZWBSBIHFNL3IP3HI","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZWBSBIHF","created_at":"2026-05-18T12:25:56.245647+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/ZWBSBIHFNL3IP3HIUG676ERELQ","json":"https://pith.science/pith/ZWBSBIHFNL3IP3HIUG676ERELQ.json","graph_json":"https://pith.science/api/pith-number/ZWBSBIHFNL3IP3HIUG676ERELQ/graph.json","events_json":"https://pith.science/api/pith-number/ZWBSBIHFNL3IP3HIUG676ERELQ/events.json","paper":"https://pith.science/paper/ZWBSBIHF"},"agent_actions":{"view_html":"https://pith.science/pith/ZWBSBIHFNL3IP3HIUG676ERELQ","download_json":"https://pith.science/pith/ZWBSBIHFNL3IP3HIUG676ERELQ.json","view_paper":"https://pith.science/paper/ZWBSBIHF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0708.2566&json=true","fetch_graph":"https://pith.science/api/pith-number/ZWBSBIHFNL3IP3HIUG676ERELQ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZWBSBIHFNL3IP3HIUG676ERELQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZWBSBIHFNL3IP3HIUG676ERELQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZWBSBIHFNL3IP3HIUG676ERELQ/action/storage_attestation","attest_author":"https://pith.science/pith/ZWBSBIHFNL3IP3HIUG676ERELQ/action/author_attestation","sign_citation":"https://pith.science/pith/ZWBSBIHFNL3IP3HIUG676ERELQ/action/citation_signature","submit_replication":"https://pith.science/pith/ZWBSBIHFNL3IP3HIUG676ERELQ/action/replication_record"}},"created_at":"2026-05-18T00:58:48.861470+00:00","updated_at":"2026-05-18T00:58:48.861470+00:00"}