{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:G53G554YEIXGJXBOFL3ZEWST5P","short_pith_number":"pith:G53G554Y","canonical_record":{"source":{"id":"1708.04778","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-16T05:51:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6a7cfce56829f1df9df941c4feaf2f2ac9d04736fb17ac0ede9d2a8abfe5713c","abstract_canon_sha256":"9ebdc8cbbea0c1261255e7dd455b91f97153e606b8412ce873f03163efd73dfe"},"schema_version":"1.0"},"canonical_sha256":"37766ef798222e64dc2e2af7925a53ebd95bbd111fa18a7c6ef29aeba1745ae8","source":{"kind":"arxiv","id":"1708.04778","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04778","created_at":"2026-05-18T00:06:48Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04778v3","created_at":"2026-05-18T00:06:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04778","created_at":"2026-05-18T00:06:48Z"},{"alias_kind":"pith_short_12","alias_value":"G53G554YEIXG","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"G53G554YEIXGJXBO","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"G53G554Y","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:G53G554YEIXGJXBOFL3ZEWST5P","target":"record","payload":{"canonical_record":{"source":{"id":"1708.04778","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-16T05:51:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6a7cfce56829f1df9df941c4feaf2f2ac9d04736fb17ac0ede9d2a8abfe5713c","abstract_canon_sha256":"9ebdc8cbbea0c1261255e7dd455b91f97153e606b8412ce873f03163efd73dfe"},"schema_version":"1.0"},"canonical_sha256":"37766ef798222e64dc2e2af7925a53ebd95bbd111fa18a7c6ef29aeba1745ae8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:48.468360Z","signature_b64":"hj14Jt77V/cu8TK9Rh4LuyjarQBhmzBz/BHC2bJslQEFb5M4+ivgyYq3vV24kV4i6rkuXwdCp+SpeshaBgIJBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37766ef798222e64dc2e2af7925a53ebd95bbd111fa18a7c6ef29aeba1745ae8","last_reissued_at":"2026-05-18T00:06:48.467739Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:48.467739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.04778","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-18T00:06:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rc4JcjyLeCiHNiYlUzlGCruTtWc/g74BkRWFFp1bl0evkl73nzk4PpsXd6nkIVx5ANgWpMZPotHHkfqQMlrzCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:40:59.773723Z"},"content_sha256":"bc7cb24e67e9ac5290da05dd5fffeb3cb028d6d31479f6b1f3b487699084da4f","schema_version":"1.0","event_id":"sha256:bc7cb24e67e9ac5290da05dd5fffeb3cb028d6d31479f6b1f3b487699084da4f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:G53G554YEIXGJXBOFL3ZEWST5P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Refined Asymptotics for Rate-Distortion using Gaussian Codebooks for Arbitrary Sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lin Zhou, Mehul Motani, Vincent Y. F. Tan","submitted_at":"2017-08-16T05:51:22Z","abstract_excerpt":"The rate-distortion saddle-point problem considered by Lapidoth (1997) consists in finding the minimum rate to compress an arbitrary ergodic source when one is constrained to use a random Gaussian codebook and minimum (Euclidean) distance encoding is employed. We extend Lapidoth's analysis in several directions in this paper. Firstly, we consider refined asymptotics. In particular, when the source is stationary and memoryless, we establish the second-order, moderate, and large deviation asymptotics of the problem. Secondly, by \"random Gaussian codebook\", Lapidoth referred to a collection of ra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04778","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-18T00:06:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jN5osHYBdSmYrudq5EVPQltSZ+bmTgWOIfh1Q1IzQO1D5AxHsCfuaIwO9sjqZxfoA7sdq86s/kTGSNKPWvL8Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:40:59.774421Z"},"content_sha256":"2ccc2f54c1065c5509846b3bdd0586cffb04ed5aa4807e1559d2c0ecbcf77527","schema_version":"1.0","event_id":"sha256:2ccc2f54c1065c5509846b3bdd0586cffb04ed5aa4807e1559d2c0ecbcf77527"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G53G554YEIXGJXBOFL3ZEWST5P/bundle.json","state_url":"https://pith.science/pith/G53G554YEIXGJXBOFL3ZEWST5P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G53G554YEIXGJXBOFL3ZEWST5P/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-31T05:40:59Z","links":{"resolver":"https://pith.science/pith/G53G554YEIXGJXBOFL3ZEWST5P","bundle":"https://pith.science/pith/G53G554YEIXGJXBOFL3ZEWST5P/bundle.json","state":"https://pith.science/pith/G53G554YEIXGJXBOFL3ZEWST5P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G53G554YEIXGJXBOFL3ZEWST5P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:G53G554YEIXGJXBOFL3ZEWST5P","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":"9ebdc8cbbea0c1261255e7dd455b91f97153e606b8412ce873f03163efd73dfe","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-16T05:51:22Z","title_canon_sha256":"6a7cfce56829f1df9df941c4feaf2f2ac9d04736fb17ac0ede9d2a8abfe5713c"},"schema_version":"1.0","source":{"id":"1708.04778","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04778","created_at":"2026-05-18T00:06:48Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04778v3","created_at":"2026-05-18T00:06:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04778","created_at":"2026-05-18T00:06:48Z"},{"alias_kind":"pith_short_12","alias_value":"G53G554YEIXG","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"G53G554YEIXGJXBO","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"G53G554Y","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:2ccc2f54c1065c5509846b3bdd0586cffb04ed5aa4807e1559d2c0ecbcf77527","target":"graph","created_at":"2026-05-18T00:06:48Z","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 rate-distortion saddle-point problem considered by Lapidoth (1997) consists in finding the minimum rate to compress an arbitrary ergodic source when one is constrained to use a random Gaussian codebook and minimum (Euclidean) distance encoding is employed. We extend Lapidoth's analysis in several directions in this paper. Firstly, we consider refined asymptotics. In particular, when the source is stationary and memoryless, we establish the second-order, moderate, and large deviation asymptotics of the problem. Secondly, by \"random Gaussian codebook\", Lapidoth referred to a collection of ra","authors_text":"Lin Zhou, Mehul Motani, Vincent Y. F. Tan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-16T05:51:22Z","title":"Refined Asymptotics for Rate-Distortion using Gaussian Codebooks for Arbitrary Sources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04778","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:bc7cb24e67e9ac5290da05dd5fffeb3cb028d6d31479f6b1f3b487699084da4f","target":"record","created_at":"2026-05-18T00:06:48Z","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":"9ebdc8cbbea0c1261255e7dd455b91f97153e606b8412ce873f03163efd73dfe","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-08-16T05:51:22Z","title_canon_sha256":"6a7cfce56829f1df9df941c4feaf2f2ac9d04736fb17ac0ede9d2a8abfe5713c"},"schema_version":"1.0","source":{"id":"1708.04778","kind":"arxiv","version":3}},"canonical_sha256":"37766ef798222e64dc2e2af7925a53ebd95bbd111fa18a7c6ef29aeba1745ae8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37766ef798222e64dc2e2af7925a53ebd95bbd111fa18a7c6ef29aeba1745ae8","first_computed_at":"2026-05-18T00:06:48.467739Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:48.467739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hj14Jt77V/cu8TK9Rh4LuyjarQBhmzBz/BHC2bJslQEFb5M4+ivgyYq3vV24kV4i6rkuXwdCp+SpeshaBgIJBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:48.468360Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.04778","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc7cb24e67e9ac5290da05dd5fffeb3cb028d6d31479f6b1f3b487699084da4f","sha256:2ccc2f54c1065c5509846b3bdd0586cffb04ed5aa4807e1559d2c0ecbcf77527"],"state_sha256":"502d04812766531e64e035413031c14210541dd257e2106a3927b2b69213f400"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zliNt8vcvAUpCOdBMMQoKXrZSkv/eUm7FmEYxL+gH0EYXwWiD71as8PJbsjwOFVue7uAsS7PXslCy0a+JlbRDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:40:59.778467Z","bundle_sha256":"aea3c2962a3dc6fac041486d22034f21a853b3318e386f51849df36d266aae82"}}