{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HHRFR42THWMB7GXSFGCKX57DQX","short_pith_number":"pith:HHRFR42T","canonical_record":{"source":{"id":"1803.06786","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-19T02:27:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7b0dc17a080c08ac286af1e975f71c6425ca511a26540fb94f78efb66768b37c","abstract_canon_sha256":"5c5aa9c627977044587984dbbb166fbb8616170d9ad41e16b2f3b231c63d5f38"},"schema_version":"1.0"},"canonical_sha256":"39e258f3533d981f9af22984abf7e385e239d55ef2c454eddd934ede56ce6fc1","source":{"kind":"arxiv","id":"1803.06786","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06786","created_at":"2026-05-18T00:20:43Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06786v1","created_at":"2026-05-18T00:20:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06786","created_at":"2026-05-18T00:20:43Z"},{"alias_kind":"pith_short_12","alias_value":"HHRFR42THWMB","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HHRFR42THWMB7GXS","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HHRFR42T","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HHRFR42THWMB7GXSFGCKX57DQX","target":"record","payload":{"canonical_record":{"source":{"id":"1803.06786","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-19T02:27:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7b0dc17a080c08ac286af1e975f71c6425ca511a26540fb94f78efb66768b37c","abstract_canon_sha256":"5c5aa9c627977044587984dbbb166fbb8616170d9ad41e16b2f3b231c63d5f38"},"schema_version":"1.0"},"canonical_sha256":"39e258f3533d981f9af22984abf7e385e239d55ef2c454eddd934ede56ce6fc1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:43.748788Z","signature_b64":"IiuJaO4eyj01yq4WP39ms59zzI1d2wLlZwEuPG46ncNZ/j2hyHX7daYlEQaXEZ8GUNd2TuI6S6BhB7jntfelBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39e258f3533d981f9af22984abf7e385e239d55ef2c454eddd934ede56ce6fc1","last_reissued_at":"2026-05-18T00:20:43.748227Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:43.748227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.06786","source_version":1,"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:20:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Ah8740iMijoEwLT7VRKiKT0Efeazut9/nsgmL6qZM2yCtuQKQr+q5ROd8yQao/KzTGGEIEm8NVBuWQ4MNveDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T20:30:39.461843Z"},"content_sha256":"637efebf57dbc08d9f0ec9515b107e4aeaba9b712dbc85ffd5839522157154eb","schema_version":"1.0","event_id":"sha256:637efebf57dbc08d9f0ec9515b107e4aeaba9b712dbc85ffd5839522157154eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HHRFR42THWMB7GXSFGCKX57DQX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Optimal Compression Rate of Variable-to-Fixed Length Source Coding with a Non-Vanishing Excess-Distortion Probability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Lan V. Truong, Vincent Y. F. Tan","submitted_at":"2018-03-19T02:27:46Z","abstract_excerpt":"We consider the variable-to-fixed length lossy source coding (VFSC) problem. The optimal compression rate of the average length of variable-to-fixed source coding, allowing a non-vanishing probability of excess-distortion $\\varepsilon$, is shown to be equal to $(1-\\varepsilon)R(D)$, where $R(D)$ is the rate-distortion function of the source. In comparison to the related results of Koga and Yamamoto as well as Kostina, Polyanskiy, and Verd\\'{u} for fixed-to-variable length source coding, our results demonstrate an interesting feature that variable-to-fixed length source coding has the same firs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06786","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"},"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:20:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yJZYZs6TGwxUtiq6+Mqv1fe0WSpNzO37OR4vngEsf/y8c8+KbYwO7tEy9GByKUxon6GaoK0oLpIl6PPXccb+BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T20:30:39.462512Z"},"content_sha256":"fe1062b1f9f2050e5d711316a8f44673cf857bf7b23a71b3cd8e80d5362289b4","schema_version":"1.0","event_id":"sha256:fe1062b1f9f2050e5d711316a8f44673cf857bf7b23a71b3cd8e80d5362289b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HHRFR42THWMB7GXSFGCKX57DQX/bundle.json","state_url":"https://pith.science/pith/HHRFR42THWMB7GXSFGCKX57DQX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HHRFR42THWMB7GXSFGCKX57DQX/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-29T20:30:39Z","links":{"resolver":"https://pith.science/pith/HHRFR42THWMB7GXSFGCKX57DQX","bundle":"https://pith.science/pith/HHRFR42THWMB7GXSFGCKX57DQX/bundle.json","state":"https://pith.science/pith/HHRFR42THWMB7GXSFGCKX57DQX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HHRFR42THWMB7GXSFGCKX57DQX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HHRFR42THWMB7GXSFGCKX57DQX","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":"5c5aa9c627977044587984dbbb166fbb8616170d9ad41e16b2f3b231c63d5f38","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-19T02:27:46Z","title_canon_sha256":"7b0dc17a080c08ac286af1e975f71c6425ca511a26540fb94f78efb66768b37c"},"schema_version":"1.0","source":{"id":"1803.06786","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06786","created_at":"2026-05-18T00:20:43Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06786v1","created_at":"2026-05-18T00:20:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06786","created_at":"2026-05-18T00:20:43Z"},{"alias_kind":"pith_short_12","alias_value":"HHRFR42THWMB","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HHRFR42THWMB7GXS","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HHRFR42T","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:fe1062b1f9f2050e5d711316a8f44673cf857bf7b23a71b3cd8e80d5362289b4","target":"graph","created_at":"2026-05-18T00:20:43Z","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":"We consider the variable-to-fixed length lossy source coding (VFSC) problem. The optimal compression rate of the average length of variable-to-fixed source coding, allowing a non-vanishing probability of excess-distortion $\\varepsilon$, is shown to be equal to $(1-\\varepsilon)R(D)$, where $R(D)$ is the rate-distortion function of the source. In comparison to the related results of Koga and Yamamoto as well as Kostina, Polyanskiy, and Verd\\'{u} for fixed-to-variable length source coding, our results demonstrate an interesting feature that variable-to-fixed length source coding has the same firs","authors_text":"Lan V. Truong, Vincent Y. F. Tan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-19T02:27:46Z","title":"The Optimal Compression Rate of Variable-to-Fixed Length Source Coding with a Non-Vanishing Excess-Distortion Probability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06786","kind":"arxiv","version":1},"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:637efebf57dbc08d9f0ec9515b107e4aeaba9b712dbc85ffd5839522157154eb","target":"record","created_at":"2026-05-18T00:20:43Z","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":"5c5aa9c627977044587984dbbb166fbb8616170d9ad41e16b2f3b231c63d5f38","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-19T02:27:46Z","title_canon_sha256":"7b0dc17a080c08ac286af1e975f71c6425ca511a26540fb94f78efb66768b37c"},"schema_version":"1.0","source":{"id":"1803.06786","kind":"arxiv","version":1}},"canonical_sha256":"39e258f3533d981f9af22984abf7e385e239d55ef2c454eddd934ede56ce6fc1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39e258f3533d981f9af22984abf7e385e239d55ef2c454eddd934ede56ce6fc1","first_computed_at":"2026-05-18T00:20:43.748227Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:43.748227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IiuJaO4eyj01yq4WP39ms59zzI1d2wLlZwEuPG46ncNZ/j2hyHX7daYlEQaXEZ8GUNd2TuI6S6BhB7jntfelBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:43.748788Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.06786","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:637efebf57dbc08d9f0ec9515b107e4aeaba9b712dbc85ffd5839522157154eb","sha256:fe1062b1f9f2050e5d711316a8f44673cf857bf7b23a71b3cd8e80d5362289b4"],"state_sha256":"48863776795a9db079bb12fdd5dbc4458eda82cf3429db70c916a291260597e2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4bZ/0O4GLiJVWO1US860n4PbtVgeALnhMlnBz2id53CMo4a3r2N33TJSrMS0tZa7kG++ExsOrmNHVucCneS5Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T20:30:39.465182Z","bundle_sha256":"116f9097d517898c2a346c9a31816a2f977d437c9b1c3df15bd135b7ade7bf23"}}