{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:XC5DMHCDPCSCRZ5LFT2E642F6L","short_pith_number":"pith:XC5DMHCD","canonical_record":{"source":{"id":"1001.2488","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-14T15:40:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"45caa3bf02d8cd468772aa10d2156b36528c9fe2e8f5baf3d058e45e35aafd66","abstract_canon_sha256":"91c36073f6002f288b65779ce5abcd68484bb149c15646c71086151f7959d29d"},"schema_version":"1.0"},"canonical_sha256":"b8ba361c4378a428e7ab2cf44f7345f2f394655e2fbeb631d90076da38541935","source":{"kind":"arxiv","id":"1001.2488","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.2488","created_at":"2026-05-18T00:58:47Z"},{"alias_kind":"arxiv_version","alias_value":"1001.2488v1","created_at":"2026-05-18T00:58:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.2488","created_at":"2026-05-18T00:58:47Z"},{"alias_kind":"pith_short_12","alias_value":"XC5DMHCDPCSC","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"XC5DMHCDPCSCRZ5L","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"XC5DMHCD","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:XC5DMHCDPCSCRZ5LFT2E642F6L","target":"record","payload":{"canonical_record":{"source":{"id":"1001.2488","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-14T15:40:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"45caa3bf02d8cd468772aa10d2156b36528c9fe2e8f5baf3d058e45e35aafd66","abstract_canon_sha256":"91c36073f6002f288b65779ce5abcd68484bb149c15646c71086151f7959d29d"},"schema_version":"1.0"},"canonical_sha256":"b8ba361c4378a428e7ab2cf44f7345f2f394655e2fbeb631d90076da38541935","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:47.784460Z","signature_b64":"PMYdTkNblkQzquEdAJUSkQ23oz2IuOlFG2G32DLZw63l6jfawCta9emE5RlfZk5xrXEukv2F6eMM+lW/s7hPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8ba361c4378a428e7ab2cf44f7345f2f394655e2fbeb631d90076da38541935","last_reissued_at":"2026-05-18T00:58:47.783953Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:47.783953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1001.2488","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:58:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ohAtEhM5hoFciDUDAb0hazY0Mme7eNOCy1UTjuO90deTNUj+mS1nx2rs+kT04AJ/QKivXCs8SDgVM/RqDMWKDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T06:27:21.223401Z"},"content_sha256":"679ebd6be3a7201f87c3c36f0505270b11fbd864a978c9fb867ec443aca15d4f","schema_version":"1.0","event_id":"sha256:679ebd6be3a7201f87c3c36f0505270b11fbd864a978c9fb867ec443aca15d4f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:XC5DMHCDPCSCRZ5LFT2E642F6L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Tight Bound on the Performance of a Minimal-Delay Joint Source-Channel Coding Scheme","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bixio Rimoldi, Marius Kleiner","submitted_at":"2010-01-14T15:40:54Z","abstract_excerpt":"An analog source is to be transmitted across a Gaussian channel in more than one channel use per source symbol. This paper derives a lower bound on the asymptotic mean squared error for a strategy that consists of repeatedly quantizing the source, transmitting the quantizer outputs in the first channel uses, and sending the remaining quantization error uncoded in the last channel use. The bound coincides with the performance achieved by a suboptimal decoder studied by the authors in a previous paper, thereby establishing that the bound is tight."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.2488","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:58:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Z6DUFqZx6e04p8GnCkH9gVeCiehO+lf3T5cFWyq0K14BN5lcR1MRqdE8GEOBasY07Lgg/9Xmum8VHPabBUeCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T06:27:21.223756Z"},"content_sha256":"846e82452fcb8a17ca4b98330f70f5a7a7b06c71ef6a2a62134565dc007a7fc3","schema_version":"1.0","event_id":"sha256:846e82452fcb8a17ca4b98330f70f5a7a7b06c71ef6a2a62134565dc007a7fc3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XC5DMHCDPCSCRZ5LFT2E642F6L/bundle.json","state_url":"https://pith.science/pith/XC5DMHCDPCSCRZ5LFT2E642F6L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XC5DMHCDPCSCRZ5LFT2E642F6L/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-07-03T06:27:21Z","links":{"resolver":"https://pith.science/pith/XC5DMHCDPCSCRZ5LFT2E642F6L","bundle":"https://pith.science/pith/XC5DMHCDPCSCRZ5LFT2E642F6L/bundle.json","state":"https://pith.science/pith/XC5DMHCDPCSCRZ5LFT2E642F6L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XC5DMHCDPCSCRZ5LFT2E642F6L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:XC5DMHCDPCSCRZ5LFT2E642F6L","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":"91c36073f6002f288b65779ce5abcd68484bb149c15646c71086151f7959d29d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-14T15:40:54Z","title_canon_sha256":"45caa3bf02d8cd468772aa10d2156b36528c9fe2e8f5baf3d058e45e35aafd66"},"schema_version":"1.0","source":{"id":"1001.2488","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.2488","created_at":"2026-05-18T00:58:47Z"},{"alias_kind":"arxiv_version","alias_value":"1001.2488v1","created_at":"2026-05-18T00:58:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.2488","created_at":"2026-05-18T00:58:47Z"},{"alias_kind":"pith_short_12","alias_value":"XC5DMHCDPCSC","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"XC5DMHCDPCSCRZ5L","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"XC5DMHCD","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:846e82452fcb8a17ca4b98330f70f5a7a7b06c71ef6a2a62134565dc007a7fc3","target":"graph","created_at":"2026-05-18T00:58:47Z","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":"An analog source is to be transmitted across a Gaussian channel in more than one channel use per source symbol. This paper derives a lower bound on the asymptotic mean squared error for a strategy that consists of repeatedly quantizing the source, transmitting the quantizer outputs in the first channel uses, and sending the remaining quantization error uncoded in the last channel use. The bound coincides with the performance achieved by a suboptimal decoder studied by the authors in a previous paper, thereby establishing that the bound is tight.","authors_text":"Bixio Rimoldi, Marius Kleiner","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-14T15:40:54Z","title":"A Tight Bound on the Performance of a Minimal-Delay Joint Source-Channel Coding Scheme"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.2488","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:679ebd6be3a7201f87c3c36f0505270b11fbd864a978c9fb867ec443aca15d4f","target":"record","created_at":"2026-05-18T00:58:47Z","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":"91c36073f6002f288b65779ce5abcd68484bb149c15646c71086151f7959d29d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-14T15:40:54Z","title_canon_sha256":"45caa3bf02d8cd468772aa10d2156b36528c9fe2e8f5baf3d058e45e35aafd66"},"schema_version":"1.0","source":{"id":"1001.2488","kind":"arxiv","version":1}},"canonical_sha256":"b8ba361c4378a428e7ab2cf44f7345f2f394655e2fbeb631d90076da38541935","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8ba361c4378a428e7ab2cf44f7345f2f394655e2fbeb631d90076da38541935","first_computed_at":"2026-05-18T00:58:47.783953Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:47.783953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PMYdTkNblkQzquEdAJUSkQ23oz2IuOlFG2G32DLZw63l6jfawCta9emE5RlfZk5xrXEukv2F6eMM+lW/s7hPAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:47.784460Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.2488","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:679ebd6be3a7201f87c3c36f0505270b11fbd864a978c9fb867ec443aca15d4f","sha256:846e82452fcb8a17ca4b98330f70f5a7a7b06c71ef6a2a62134565dc007a7fc3"],"state_sha256":"cca0ff26ad4489010a764d01cfcae5288ba59106d53e5ffe55f39af6cc86562b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PgxDg10wCwcKFYNoKXPVzK4rExTbZYpDopGDOB3uT4HnOBDHLf/kVu86cXKYa0HNcYkFOV/3RiiHB8HlnJNFBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T06:27:21.225687Z","bundle_sha256":"9d3c34d643fabd7433b6554329a41f63b9f0f11fc9d80c931964caa619dbbb74"}}