{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:OM7LULCBBSLGS2IMIWLVMOJHQM","short_pith_number":"pith:OM7LULCB","canonical_record":{"source":{"id":"1505.05481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-20T18:30:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"69f8b370811df81322b55809d975e2e3458fc71f58577c070574faa10f5289cf","abstract_canon_sha256":"df03498a70c6a4b6c1705afb2bbb1f02703bef219f302736874a8efd38abb1e2"},"schema_version":"1.0"},"canonical_sha256":"733eba2c410c9669690c4597563927831e7e8e054be485749a30e2045545aa6a","source":{"kind":"arxiv","id":"1505.05481","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.05481","created_at":"2026-05-18T02:03:56Z"},{"alias_kind":"arxiv_version","alias_value":"1505.05481v1","created_at":"2026-05-18T02:03:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05481","created_at":"2026-05-18T02:03:56Z"},{"alias_kind":"pith_short_12","alias_value":"OM7LULCBBSLG","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OM7LULCBBSLGS2IM","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OM7LULCB","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:OM7LULCBBSLGS2IMIWLVMOJHQM","target":"record","payload":{"canonical_record":{"source":{"id":"1505.05481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-20T18:30:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"69f8b370811df81322b55809d975e2e3458fc71f58577c070574faa10f5289cf","abstract_canon_sha256":"df03498a70c6a4b6c1705afb2bbb1f02703bef219f302736874a8efd38abb1e2"},"schema_version":"1.0"},"canonical_sha256":"733eba2c410c9669690c4597563927831e7e8e054be485749a30e2045545aa6a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:56.177877Z","signature_b64":"u/oUWyYwGa91l4a47oFMl3Hg70LL1ryPW15DLoolxkrZDIYvGW1+xrnpozCW5iMef3DO16xmB3443cBv9UBTBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"733eba2c410c9669690c4597563927831e7e8e054be485749a30e2045545aa6a","last_reissued_at":"2026-05-18T02:03:56.177206Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:56.177206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.05481","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-18T02:03:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CLFhVqXvaU1lxYY+QG2m2iJETfkO65Nz9yrWq7mF61x5N+gC7esuSyhpoZ4/JLg5GM+m5CFI3ZC6xeJQ7QGnBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:55:17.485925Z"},"content_sha256":"09dc11383f1288a39e052e7451faa956a0c659c7d4e886e06857ee87c57464bc","schema_version":"1.0","event_id":"sha256:09dc11383f1288a39e052e7451faa956a0c659c7d4e886e06857ee87c57464bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:OM7LULCBBSLGS2IMIWLVMOJHQM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Expansion Coding for Channel and Source Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hongbo Si, Kumar Appaiah, O. Ozan Koyluoglu, Sriram Vishwanath","submitted_at":"2015-05-20T18:30:20Z","abstract_excerpt":"A general method of coding over expansion is proposed,which allows one to reduce the highly non-trivial problems of coding over analog channels and compressing analog sources to a set of much simpler subproblems, coding over discrete channels and compressing discrete sources. More specifically, the focus of this paper is on the additive exponential noise (AEN) channel, and lossy compression of exponential sources. Taking advantage of the essential decomposable property of these channels (sources), the proposed expansion method allows for mapping of these problems to coding over parallel channe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05481","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-18T02:03:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u7gJYm+01fEYiHZ6xLr5HVmXenP42B2Qvqiuhxgb8za9diLA5cLNQCyja4/gGyGGDPAOWj6A40sLdV0ipRqJAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:55:17.486266Z"},"content_sha256":"3f6da57222c768271c182c2aa30ab7cded31354e92cbbe83eb0662533f8c4d48","schema_version":"1.0","event_id":"sha256:3f6da57222c768271c182c2aa30ab7cded31354e92cbbe83eb0662533f8c4d48"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OM7LULCBBSLGS2IMIWLVMOJHQM/bundle.json","state_url":"https://pith.science/pith/OM7LULCBBSLGS2IMIWLVMOJHQM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OM7LULCBBSLGS2IMIWLVMOJHQM/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-02T22:55:17Z","links":{"resolver":"https://pith.science/pith/OM7LULCBBSLGS2IMIWLVMOJHQM","bundle":"https://pith.science/pith/OM7LULCBBSLGS2IMIWLVMOJHQM/bundle.json","state":"https://pith.science/pith/OM7LULCBBSLGS2IMIWLVMOJHQM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OM7LULCBBSLGS2IMIWLVMOJHQM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:OM7LULCBBSLGS2IMIWLVMOJHQM","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":"df03498a70c6a4b6c1705afb2bbb1f02703bef219f302736874a8efd38abb1e2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-20T18:30:20Z","title_canon_sha256":"69f8b370811df81322b55809d975e2e3458fc71f58577c070574faa10f5289cf"},"schema_version":"1.0","source":{"id":"1505.05481","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.05481","created_at":"2026-05-18T02:03:56Z"},{"alias_kind":"arxiv_version","alias_value":"1505.05481v1","created_at":"2026-05-18T02:03:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.05481","created_at":"2026-05-18T02:03:56Z"},{"alias_kind":"pith_short_12","alias_value":"OM7LULCBBSLG","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OM7LULCBBSLGS2IM","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OM7LULCB","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:3f6da57222c768271c182c2aa30ab7cded31354e92cbbe83eb0662533f8c4d48","target":"graph","created_at":"2026-05-18T02:03:56Z","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":"A general method of coding over expansion is proposed,which allows one to reduce the highly non-trivial problems of coding over analog channels and compressing analog sources to a set of much simpler subproblems, coding over discrete channels and compressing discrete sources. More specifically, the focus of this paper is on the additive exponential noise (AEN) channel, and lossy compression of exponential sources. Taking advantage of the essential decomposable property of these channels (sources), the proposed expansion method allows for mapping of these problems to coding over parallel channe","authors_text":"Hongbo Si, Kumar Appaiah, O. Ozan Koyluoglu, Sriram Vishwanath","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-20T18:30:20Z","title":"Expansion Coding for Channel and Source Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.05481","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:09dc11383f1288a39e052e7451faa956a0c659c7d4e886e06857ee87c57464bc","target":"record","created_at":"2026-05-18T02:03:56Z","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":"df03498a70c6a4b6c1705afb2bbb1f02703bef219f302736874a8efd38abb1e2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-20T18:30:20Z","title_canon_sha256":"69f8b370811df81322b55809d975e2e3458fc71f58577c070574faa10f5289cf"},"schema_version":"1.0","source":{"id":"1505.05481","kind":"arxiv","version":1}},"canonical_sha256":"733eba2c410c9669690c4597563927831e7e8e054be485749a30e2045545aa6a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"733eba2c410c9669690c4597563927831e7e8e054be485749a30e2045545aa6a","first_computed_at":"2026-05-18T02:03:56.177206Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:03:56.177206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u/oUWyYwGa91l4a47oFMl3Hg70LL1ryPW15DLoolxkrZDIYvGW1+xrnpozCW5iMef3DO16xmB3443cBv9UBTBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:03:56.177877Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.05481","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09dc11383f1288a39e052e7451faa956a0c659c7d4e886e06857ee87c57464bc","sha256:3f6da57222c768271c182c2aa30ab7cded31354e92cbbe83eb0662533f8c4d48"],"state_sha256":"fcea19063ffdd88b83ec34dd0e40b0c272282225a75429f0512627deca000413"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ZKXom8lTGc/Z2bLLVYgG5PCAOw+FENQEh7rOcHnttw3CPnOOD0RicjTaJx+BCniaaQzdaqxuXAYAydTA1RwCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:55:17.488204Z","bundle_sha256":"79de59067e69dcbe8aac57e85f9c0ded2d41a286e5d35888e000dd11987d3509"}}