{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:2RL7NRSS6IL4JT5D2KMPGFBTAP","short_pith_number":"pith:2RL7NRSS","schema_version":"1.0","canonical_sha256":"d457f6c652f217c4cfa3d298f3143303e501b5b618b24bd8ead45238f04ceddd","source":{"kind":"arxiv","id":"2602.09176","version":2},"attestation_state":"computed","paper":{"title":"Dispersion of Gaussian Sources with Memory and an Extension to Abstract Sources","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eyyup Tasci, Victoria Kostina","submitted_at":"2026-02-09T20:33:18Z","abstract_excerpt":"We consider finite blocklength lossy compression of information sources whose components are independent but non-identically distributed. Crucially, Gaussian sources with memory can be cast in this form. We show that under the operational constraint of exceeding distortion $d$ with probability at most $\\epsilon$, the minimum achievable rate at blocklength $n$ satisfies $R(n, d, \\epsilon)=\\mathbb{R}_n(d)+\\sqrt{\\frac{\\mathbb{V}_n(d)}{n}}Q^{-1}(\\epsilon)+O \\left(\\frac{\\log n}{n}\\right)$, where $Q^{-1}(\\cdot)$ is the inverse $ Q$-function, while $\\mathbb{R}_n(d)$ and $\\mathbb{V}_n(d)$ are fundamen"},"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":"2602.09176","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-02-09T20:33:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6d87de55ee7685ff2560b172dd5f722acfa6868163554d349577bd74473e6b36","abstract_canon_sha256":"2cbe702216a0c3e718c7314c8eb5b12662fa9b65182af5345aa2157daf10fba1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-29T01:15:04.065417Z","signature_b64":"wtcMguOnU/tffxhW+mwW4PIvrJOSyTsB4RLLR8kM2gtSt6LArddwdazckgUsFQBoXt6MjyK20qA6uBqF2rqvAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d457f6c652f217c4cfa3d298f3143303e501b5b618b24bd8ead45238f04ceddd","last_reissued_at":"2026-06-29T01:15:04.064873Z","signature_status":"signed_v1","first_computed_at":"2026-06-29T01:15:04.064873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dispersion of Gaussian Sources with Memory and an Extension to Abstract Sources","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Eyyup Tasci, Victoria Kostina","submitted_at":"2026-02-09T20:33:18Z","abstract_excerpt":"We consider finite blocklength lossy compression of information sources whose components are independent but non-identically distributed. Crucially, Gaussian sources with memory can be cast in this form. We show that under the operational constraint of exceeding distortion $d$ with probability at most $\\epsilon$, the minimum achievable rate at blocklength $n$ satisfies $R(n, d, \\epsilon)=\\mathbb{R}_n(d)+\\sqrt{\\frac{\\mathbb{V}_n(d)}{n}}Q^{-1}(\\epsilon)+O \\left(\\frac{\\log n}{n}\\right)$, where $Q^{-1}(\\cdot)$ is the inverse $ Q$-function, while $\\mathbb{R}_n(d)$ and $\\mathbb{V}_n(d)$ are fundamen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.09176","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2602.09176/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2602.09176","created_at":"2026-06-29T01:15:04.064960+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.09176v2","created_at":"2026-06-29T01:15:04.064960+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.09176","created_at":"2026-06-29T01:15:04.064960+00:00"},{"alias_kind":"pith_short_12","alias_value":"2RL7NRSS6IL4","created_at":"2026-06-29T01:15:04.064960+00:00"},{"alias_kind":"pith_short_16","alias_value":"2RL7NRSS6IL4JT5D","created_at":"2026-06-29T01:15:04.064960+00:00"},{"alias_kind":"pith_short_8","alias_value":"2RL7NRSS","created_at":"2026-06-29T01:15:04.064960+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.25085","citing_title":"Polynomial Context-Truncation Sensitivity in Autoregressive Language Models: Sequential Wyner-Ziv Bounds for KV Cache Compression","ref_index":48,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2RL7NRSS6IL4JT5D2KMPGFBTAP","json":"https://pith.science/pith/2RL7NRSS6IL4JT5D2KMPGFBTAP.json","graph_json":"https://pith.science/api/pith-number/2RL7NRSS6IL4JT5D2KMPGFBTAP/graph.json","events_json":"https://pith.science/api/pith-number/2RL7NRSS6IL4JT5D2KMPGFBTAP/events.json","paper":"https://pith.science/paper/2RL7NRSS"},"agent_actions":{"view_html":"https://pith.science/pith/2RL7NRSS6IL4JT5D2KMPGFBTAP","download_json":"https://pith.science/pith/2RL7NRSS6IL4JT5D2KMPGFBTAP.json","view_paper":"https://pith.science/paper/2RL7NRSS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.09176&json=true","fetch_graph":"https://pith.science/api/pith-number/2RL7NRSS6IL4JT5D2KMPGFBTAP/graph.json","fetch_events":"https://pith.science/api/pith-number/2RL7NRSS6IL4JT5D2KMPGFBTAP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2RL7NRSS6IL4JT5D2KMPGFBTAP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2RL7NRSS6IL4JT5D2KMPGFBTAP/action/storage_attestation","attest_author":"https://pith.science/pith/2RL7NRSS6IL4JT5D2KMPGFBTAP/action/author_attestation","sign_citation":"https://pith.science/pith/2RL7NRSS6IL4JT5D2KMPGFBTAP/action/citation_signature","submit_replication":"https://pith.science/pith/2RL7NRSS6IL4JT5D2KMPGFBTAP/action/replication_record"}},"created_at":"2026-06-29T01:15:04.064960+00:00","updated_at":"2026-06-29T01:15:04.064960+00:00"}