{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:VSTLPJNX555ZJKHZSCR36Z4YQI","short_pith_number":"pith:VSTLPJNX","canonical_record":{"source":{"id":"1401.0892","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-05T14:03:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"55b28d7e954135c346f91ce7dbf310b85d44683d51953670557db978b607916a","abstract_canon_sha256":"e7df02c3278c116e8df5c4c718b9bda38765e33a5edbd38074bc3605f8dc8f9b"},"schema_version":"1.0"},"canonical_sha256":"aca6b7a5b7ef7b94a8f990a3bf6798823197ee94bcf6fd7245db1cbae1c7a787","source":{"kind":"arxiv","id":"1401.0892","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0892","created_at":"2026-05-18T02:38:29Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0892v3","created_at":"2026-05-18T02:38:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0892","created_at":"2026-05-18T02:38:29Z"},{"alias_kind":"pith_short_12","alias_value":"VSTLPJNX555Z","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VSTLPJNX555ZJKHZ","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VSTLPJNX","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:VSTLPJNX555ZJKHZSCR36Z4YQI","target":"record","payload":{"canonical_record":{"source":{"id":"1401.0892","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-05T14:03:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"55b28d7e954135c346f91ce7dbf310b85d44683d51953670557db978b607916a","abstract_canon_sha256":"e7df02c3278c116e8df5c4c718b9bda38765e33a5edbd38074bc3605f8dc8f9b"},"schema_version":"1.0"},"canonical_sha256":"aca6b7a5b7ef7b94a8f990a3bf6798823197ee94bcf6fd7245db1cbae1c7a787","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:29.776373Z","signature_b64":"JSoUVwwrozyKd97hA0Z0EJPu2uFarkKfPYHd9Dalt1uijFCAIKdUyxvLolMwCdT5ZjT+vH8DaDZzbmTvsAB2Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aca6b7a5b7ef7b94a8f990a3bf6798823197ee94bcf6fd7245db1cbae1c7a787","last_reissued_at":"2026-05-18T02:38:29.775733Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:29.775733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.0892","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-18T02:38:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W3k8QHvZjLBhD5ijxvPEUjyDELadTJs/XvorbUwJdlubCsIOlJCXVf4CL2Dqqy/g+M4VwM67OeZ4RWXAMVBsAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:50:02.196521Z"},"content_sha256":"aa875efac6ddd993a780a2cfc59164af8573ac9c3a18565f002a65261d73be87","schema_version":"1.0","event_id":"sha256:aa875efac6ddd993a780a2cfc59164af8573ac9c3a18565f002a65261d73be87"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:VSTLPJNX555ZJKHZSCR36Z4YQI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimum Trade-offs Between the Error Exponent and the Excess-Rate Exponent of Variable-Rate Slepian-Wolf Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Neri Merhav, Nir Weinberger","submitted_at":"2014-01-05T14:03:37Z","abstract_excerpt":"We analyze the optimal trade-off between the error exponent and the excess-rate exponent for variable-rate Slepian-Wolf codes. In particular, we first derive upper (converse) bounds on the optimal error and excess-rate exponents, and then lower (achievable) bounds, via a simple class of variable-rate codes which assign the same rate to all source blocks of the same type class. Then, using the exponent bounds, we derive bounds on the optimal rate functions, namely, the minimal rate assigned to each type class, needed in order to achieve a given target error exponent. The resulting excess-rate e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0892","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-18T02:38:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jb4ddRymwD6SPCyoDhz3Oh2y/aY+2ITIW0ximHmZ47P7L8APMJCWJGCPhMBquhplx/rCaZdyhb6Sv0b0j/v2Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:50:02.196863Z"},"content_sha256":"e5a45fd9d87c22f478cb5c8d1000e188fde73d3a35b5014acd2bcf57cc8211a8","schema_version":"1.0","event_id":"sha256:e5a45fd9d87c22f478cb5c8d1000e188fde73d3a35b5014acd2bcf57cc8211a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VSTLPJNX555ZJKHZSCR36Z4YQI/bundle.json","state_url":"https://pith.science/pith/VSTLPJNX555ZJKHZSCR36Z4YQI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VSTLPJNX555ZJKHZSCR36Z4YQI/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-06-01T21:50:02Z","links":{"resolver":"https://pith.science/pith/VSTLPJNX555ZJKHZSCR36Z4YQI","bundle":"https://pith.science/pith/VSTLPJNX555ZJKHZSCR36Z4YQI/bundle.json","state":"https://pith.science/pith/VSTLPJNX555ZJKHZSCR36Z4YQI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VSTLPJNX555ZJKHZSCR36Z4YQI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:VSTLPJNX555ZJKHZSCR36Z4YQI","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":"e7df02c3278c116e8df5c4c718b9bda38765e33a5edbd38074bc3605f8dc8f9b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-05T14:03:37Z","title_canon_sha256":"55b28d7e954135c346f91ce7dbf310b85d44683d51953670557db978b607916a"},"schema_version":"1.0","source":{"id":"1401.0892","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0892","created_at":"2026-05-18T02:38:29Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0892v3","created_at":"2026-05-18T02:38:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0892","created_at":"2026-05-18T02:38:29Z"},{"alias_kind":"pith_short_12","alias_value":"VSTLPJNX555Z","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VSTLPJNX555ZJKHZ","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VSTLPJNX","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:e5a45fd9d87c22f478cb5c8d1000e188fde73d3a35b5014acd2bcf57cc8211a8","target":"graph","created_at":"2026-05-18T02:38:29Z","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 analyze the optimal trade-off between the error exponent and the excess-rate exponent for variable-rate Slepian-Wolf codes. In particular, we first derive upper (converse) bounds on the optimal error and excess-rate exponents, and then lower (achievable) bounds, via a simple class of variable-rate codes which assign the same rate to all source blocks of the same type class. Then, using the exponent bounds, we derive bounds on the optimal rate functions, namely, the minimal rate assigned to each type class, needed in order to achieve a given target error exponent. The resulting excess-rate e","authors_text":"Neri Merhav, Nir Weinberger","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-05T14:03:37Z","title":"Optimum Trade-offs Between the Error Exponent and the Excess-Rate Exponent of Variable-Rate Slepian-Wolf Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0892","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:aa875efac6ddd993a780a2cfc59164af8573ac9c3a18565f002a65261d73be87","target":"record","created_at":"2026-05-18T02:38:29Z","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":"e7df02c3278c116e8df5c4c718b9bda38765e33a5edbd38074bc3605f8dc8f9b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-05T14:03:37Z","title_canon_sha256":"55b28d7e954135c346f91ce7dbf310b85d44683d51953670557db978b607916a"},"schema_version":"1.0","source":{"id":"1401.0892","kind":"arxiv","version":3}},"canonical_sha256":"aca6b7a5b7ef7b94a8f990a3bf6798823197ee94bcf6fd7245db1cbae1c7a787","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aca6b7a5b7ef7b94a8f990a3bf6798823197ee94bcf6fd7245db1cbae1c7a787","first_computed_at":"2026-05-18T02:38:29.775733Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:29.775733Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JSoUVwwrozyKd97hA0Z0EJPu2uFarkKfPYHd9Dalt1uijFCAIKdUyxvLolMwCdT5ZjT+vH8DaDZzbmTvsAB2Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:29.776373Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.0892","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa875efac6ddd993a780a2cfc59164af8573ac9c3a18565f002a65261d73be87","sha256:e5a45fd9d87c22f478cb5c8d1000e188fde73d3a35b5014acd2bcf57cc8211a8"],"state_sha256":"e67bbb9b44f296936d53c7225572aba4bdac87ba3234123f9495e88eb575f60f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"32EUHDI8Tkq/Wm/2AR3nByW2j9e9X4wpkZaokY1oUJJ+HpLjaibimkOSlfrEFhRuLHnbIfx1T7h0MRUBnBX+AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:50:02.198808Z","bundle_sha256":"304c306d8b8b06dc8ed500a9597d6bfdb0a69d0394632087a8b74305a565d1d2"}}