{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:Y6T57PXWANFFOA5K6P56H4NWW5","short_pith_number":"pith:Y6T57PXW","schema_version":"1.0","canonical_sha256":"c7a7dfbef6034a5703aaf3fbe3f1b6b75a5b9901612f2a942e3b23c5f533a8fd","source":{"kind":"arxiv","id":"1901.01356","version":2},"attestation_state":"computed","paper":{"title":"Exponential Strong Converse for Successive Refinement with Causal Decoder Side Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alfred Hero, Lin Zhou","submitted_at":"2019-01-05T02:49:37Z","abstract_excerpt":"We consider the $k$-user successive refinement problem with causal decoder side information and derive an exponential strong converse theorem. The rate-distortion region for the problem can be derived as a straightforward extension of the two-user case by Maor and Merhav (2008). We show that for any rate-distortion tuple outside the rate-distortion region of the $k$-user successive refinement problem with causal decoder side information, the joint excess-distortion probability approaches one exponentially fast. Our proof follows by judiciously adapting the recently proposed strong converse tec"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1901.01356","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-01-05T02:49:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"91e73a5d606b74f5ba3859a028bfc8dad17043db1654d22a5dbbf964da198dc9","abstract_canon_sha256":"087de2d555533af78acc8f8cfd6faf787be4728927514e337fc590afe19a700e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:31.167555Z","signature_b64":"zk/Jpwt2p0C6pVsjvvFxPdnIMcf6ATPshgTmYWlSJmV16aGOkdONOVUdL2D5y8u5jKq/8yZ4HGRM8ZFfh4RbAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7a7dfbef6034a5703aaf3fbe3f1b6b75a5b9901612f2a942e3b23c5f533a8fd","last_reissued_at":"2026-05-17T23:45:31.166760Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:31.166760Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exponential Strong Converse for Successive Refinement with Causal Decoder Side Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alfred Hero, Lin Zhou","submitted_at":"2019-01-05T02:49:37Z","abstract_excerpt":"We consider the $k$-user successive refinement problem with causal decoder side information and derive an exponential strong converse theorem. The rate-distortion region for the problem can be derived as a straightforward extension of the two-user case by Maor and Merhav (2008). We show that for any rate-distortion tuple outside the rate-distortion region of the $k$-user successive refinement problem with causal decoder side information, the joint excess-distortion probability approaches one exponentially fast. Our proof follows by judiciously adapting the recently proposed strong converse tec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.01356","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.01356","created_at":"2026-05-17T23:45:31.166872+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.01356v2","created_at":"2026-05-17T23:45:31.166872+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.01356","created_at":"2026-05-17T23:45:31.166872+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y6T57PXWANFF","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y6T57PXWANFFOA5K","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y6T57PXW","created_at":"2026-05-18T12:33:33.725879+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y6T57PXWANFFOA5K6P56H4NWW5","json":"https://pith.science/pith/Y6T57PXWANFFOA5K6P56H4NWW5.json","graph_json":"https://pith.science/api/pith-number/Y6T57PXWANFFOA5K6P56H4NWW5/graph.json","events_json":"https://pith.science/api/pith-number/Y6T57PXWANFFOA5K6P56H4NWW5/events.json","paper":"https://pith.science/paper/Y6T57PXW"},"agent_actions":{"view_html":"https://pith.science/pith/Y6T57PXWANFFOA5K6P56H4NWW5","download_json":"https://pith.science/pith/Y6T57PXWANFFOA5K6P56H4NWW5.json","view_paper":"https://pith.science/paper/Y6T57PXW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.01356&json=true","fetch_graph":"https://pith.science/api/pith-number/Y6T57PXWANFFOA5K6P56H4NWW5/graph.json","fetch_events":"https://pith.science/api/pith-number/Y6T57PXWANFFOA5K6P56H4NWW5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y6T57PXWANFFOA5K6P56H4NWW5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y6T57PXWANFFOA5K6P56H4NWW5/action/storage_attestation","attest_author":"https://pith.science/pith/Y6T57PXWANFFOA5K6P56H4NWW5/action/author_attestation","sign_citation":"https://pith.science/pith/Y6T57PXWANFFOA5K6P56H4NWW5/action/citation_signature","submit_replication":"https://pith.science/pith/Y6T57PXWANFFOA5K6P56H4NWW5/action/replication_record"}},"created_at":"2026-05-17T23:45:31.166872+00:00","updated_at":"2026-05-17T23:45:31.166872+00:00"}