{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:NDTXFOGI6EVHMF3ONS6WI5WKKD","short_pith_number":"pith:NDTXFOGI","canonical_record":{"source":{"id":"0901.3596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-01-23T04:06:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7d51faa02e5ba101a26f45327225dfdd362a522b969ea34a148644f45bdb1109","abstract_canon_sha256":"a056e46e8823f77360a015634c45f263fbc8e013e73e341cc408f8ea5f02a75f"},"schema_version":"1.0"},"canonical_sha256":"68e772b8c8f12a76176e6cbd6476ca50d50a0e776222c008242680998cd868f0","source":{"kind":"arxiv","id":"0901.3596","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0901.3596","created_at":"2026-07-04T15:36:44Z"},{"alias_kind":"arxiv_version","alias_value":"0901.3596v1","created_at":"2026-07-04T15:36:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.3596","created_at":"2026-07-04T15:36:44Z"},{"alias_kind":"pith_short_12","alias_value":"NDTXFOGI6EVH","created_at":"2026-07-04T15:36:44Z"},{"alias_kind":"pith_short_16","alias_value":"NDTXFOGI6EVHMF3O","created_at":"2026-07-04T15:36:44Z"},{"alias_kind":"pith_short_8","alias_value":"NDTXFOGI","created_at":"2026-07-04T15:36:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:NDTXFOGI6EVHMF3ONS6WI5WKKD","target":"record","payload":{"canonical_record":{"source":{"id":"0901.3596","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-01-23T04:06:25Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7d51faa02e5ba101a26f45327225dfdd362a522b969ea34a148644f45bdb1109","abstract_canon_sha256":"a056e46e8823f77360a015634c45f263fbc8e013e73e341cc408f8ea5f02a75f"},"schema_version":"1.0"},"canonical_sha256":"68e772b8c8f12a76176e6cbd6476ca50d50a0e776222c008242680998cd868f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:36:44.465682Z","signature_b64":"/mBwYm4+2UNBu9/boX9pUXq+qkOmMjihENj8QzWBrqWREiV1U8vbxZInk8zKpKV+HhZR/DJNx+4yUdkAB69BBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68e772b8c8f12a76176e6cbd6476ca50d50a0e776222c008242680998cd868f0","last_reissued_at":"2026-07-04T15:36:44.465320Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:36:44.465320Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0901.3596","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-07-04T15:36:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S0AQa6fcRLBQ8uHZs9eqraZw0jMyvLamCY1I9nHAVuyDadf1osfN/1g0YNq+4tf8S28gxegj2sYRYo23gqeCAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T11:39:13.580113Z"},"content_sha256":"a1df5cc8c564e41646e805f81295c5a4d1e57217c3b0fcd754a1baea3ef3e71f","schema_version":"1.0","event_id":"sha256:a1df5cc8c564e41646e805f81295c5a4d1e57217c3b0fcd754a1baea3ef3e71f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:NDTXFOGI6EVHMF3ONS6WI5WKKD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Joint source-channel with side information coding error exponents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cheng Chang","submitted_at":"2009-01-23T04:06:25Z","abstract_excerpt":"In this paper, we study the upper and the lower bounds on the joint source-channel coding error exponent with decoder side-information. The results in the paper are non-trivial extensions of the Csiszar's classical paper [5]. Unlike the joint source-channel coding result in [5], it is not obvious whether the lower bound and the upper bound are equivalent even if the channel coding error exponent is known. For a class of channels, including the symmetric channels, we apply a game-theoretic result to establish the existence of a saddle point and hence prove that the lower and upper bounds are th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.3596","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0901.3596/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"},"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-07-04T15:36:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ykbDST+fM7/uYV5o/gwCr2PucP3s6jhWG1SO+g9JqGdYfBTwoMDSo++euuD1GnXv979AcYCYCxw2OLCULLBtDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T11:39:13.580682Z"},"content_sha256":"44a61eb494fce8aa08bc1105f3b8474f2858d9253fd9e6280f63e3ce4bfec6f6","schema_version":"1.0","event_id":"sha256:44a61eb494fce8aa08bc1105f3b8474f2858d9253fd9e6280f63e3ce4bfec6f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NDTXFOGI6EVHMF3ONS6WI5WKKD/bundle.json","state_url":"https://pith.science/pith/NDTXFOGI6EVHMF3ONS6WI5WKKD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NDTXFOGI6EVHMF3ONS6WI5WKKD/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-08-05T11:39:13Z","links":{"resolver":"https://pith.science/pith/NDTXFOGI6EVHMF3ONS6WI5WKKD","bundle":"https://pith.science/pith/NDTXFOGI6EVHMF3ONS6WI5WKKD/bundle.json","state":"https://pith.science/pith/NDTXFOGI6EVHMF3ONS6WI5WKKD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NDTXFOGI6EVHMF3ONS6WI5WKKD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:NDTXFOGI6EVHMF3ONS6WI5WKKD","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":"a056e46e8823f77360a015634c45f263fbc8e013e73e341cc408f8ea5f02a75f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-01-23T04:06:25Z","title_canon_sha256":"7d51faa02e5ba101a26f45327225dfdd362a522b969ea34a148644f45bdb1109"},"schema_version":"1.0","source":{"id":"0901.3596","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0901.3596","created_at":"2026-07-04T15:36:44Z"},{"alias_kind":"arxiv_version","alias_value":"0901.3596v1","created_at":"2026-07-04T15:36:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0901.3596","created_at":"2026-07-04T15:36:44Z"},{"alias_kind":"pith_short_12","alias_value":"NDTXFOGI6EVH","created_at":"2026-07-04T15:36:44Z"},{"alias_kind":"pith_short_16","alias_value":"NDTXFOGI6EVHMF3O","created_at":"2026-07-04T15:36:44Z"},{"alias_kind":"pith_short_8","alias_value":"NDTXFOGI","created_at":"2026-07-04T15:36:44Z"}],"graph_snapshots":[{"event_id":"sha256:44a61eb494fce8aa08bc1105f3b8474f2858d9253fd9e6280f63e3ce4bfec6f6","target":"graph","created_at":"2026-07-04T15:36:44Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0901.3596/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we study the upper and the lower bounds on the joint source-channel coding error exponent with decoder side-information. The results in the paper are non-trivial extensions of the Csiszar's classical paper [5]. Unlike the joint source-channel coding result in [5], it is not obvious whether the lower bound and the upper bound are equivalent even if the channel coding error exponent is known. For a class of channels, including the symmetric channels, we apply a game-theoretic result to establish the existence of a saddle point and hence prove that the lower and upper bounds are th","authors_text":"Cheng Chang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-01-23T04:06:25Z","title":"Joint source-channel with side information coding error exponents"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0901.3596","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:a1df5cc8c564e41646e805f81295c5a4d1e57217c3b0fcd754a1baea3ef3e71f","target":"record","created_at":"2026-07-04T15:36:44Z","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":"a056e46e8823f77360a015634c45f263fbc8e013e73e341cc408f8ea5f02a75f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-01-23T04:06:25Z","title_canon_sha256":"7d51faa02e5ba101a26f45327225dfdd362a522b969ea34a148644f45bdb1109"},"schema_version":"1.0","source":{"id":"0901.3596","kind":"arxiv","version":1}},"canonical_sha256":"68e772b8c8f12a76176e6cbd6476ca50d50a0e776222c008242680998cd868f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68e772b8c8f12a76176e6cbd6476ca50d50a0e776222c008242680998cd868f0","first_computed_at":"2026-07-04T15:36:44.465320Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:36:44.465320Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/mBwYm4+2UNBu9/boX9pUXq+qkOmMjihENj8QzWBrqWREiV1U8vbxZInk8zKpKV+HhZR/DJNx+4yUdkAB69BBg==","signature_status":"signed_v1","signed_at":"2026-07-04T15:36:44.465682Z","signed_message":"canonical_sha256_bytes"},"source_id":"0901.3596","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a1df5cc8c564e41646e805f81295c5a4d1e57217c3b0fcd754a1baea3ef3e71f","sha256:44a61eb494fce8aa08bc1105f3b8474f2858d9253fd9e6280f63e3ce4bfec6f6"],"state_sha256":"757dfcf3a0d2b60080495a0109fa204a5f81eaedadb2b62ccb096082eceee124"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UijG9Cy+mdaHAmq3fiECfAXYkBa+jLZlsx7A+NQAmwbYkptSPraaA2j/N+mGsdBOynvVRadpDJvZosqV3yU/Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T11:39:13.587519Z","bundle_sha256":"34fbe72486374b86af5f22efb63ea0c35d7c6d12db4c0e40412c3adc39fce733"}}