{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:IJXF2PC3AJRQZDR3ZUTCZLNGWQ","short_pith_number":"pith:IJXF2PC3","canonical_record":{"source":{"id":"1005.0117","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-02T01:35:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0e469d5b580fec1d9638f688bfdfafa4837fd93fa38d12a24ce5fa4b5cd5faf5","abstract_canon_sha256":"04fbcb51ba60aec83a3a03998632ce1a9c2d009ee8ec83247bb9471008522024"},"schema_version":"1.0"},"canonical_sha256":"426e5d3c5b02630c8e3bcd262cada6b40fd2b60882ed3e331f3b59ae0776af0d","source":{"kind":"arxiv","id":"1005.0117","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.0117","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"1005.0117v1","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.0117","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"IJXF2PC3AJRQ","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"IJXF2PC3AJRQZDR3","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"IJXF2PC3","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:IJXF2PC3AJRQZDR3ZUTCZLNGWQ","target":"record","payload":{"canonical_record":{"source":{"id":"1005.0117","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-02T01:35:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0e469d5b580fec1d9638f688bfdfafa4837fd93fa38d12a24ce5fa4b5cd5faf5","abstract_canon_sha256":"04fbcb51ba60aec83a3a03998632ce1a9c2d009ee8ec83247bb9471008522024"},"schema_version":"1.0"},"canonical_sha256":"426e5d3c5b02630c8e3bcd262cada6b40fd2b60882ed3e331f3b59ae0776af0d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:19.587821Z","signature_b64":"BXzr8MrlA6w4NEyjOMXR1RLET8pXSG2+iI+5NRNgE4NbqiWm3TnoKg1nb7te+URhs4EqdD3qQBG9Ob86sSg8CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"426e5d3c5b02630c8e3bcd262cada6b40fd2b60882ed3e331f3b59ae0776af0d","last_reissued_at":"2026-05-18T00:58:19.587173Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:19.587173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1005.0117","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:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aZjCsC0SP+YfcfRu89oEWPelAcHkgM1JW5ICBpw7VVuV0vv+8MS/idGNK4XvbD3wzuGUuit71W4MzOCs5x7yCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T05:12:53.831495Z"},"content_sha256":"e9f5f454947944fa22aa7a5bc44f08c2910b94fc321370549b80eb8008f361ed","schema_version":"1.0","event_id":"sha256:e9f5f454947944fa22aa7a5bc44f08c2910b94fc321370549b80eb8008f361ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:IJXF2PC3AJRQZDR3ZUTCZLNGWQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Separation of Lossy Source-Network Coding and Channel Coding in Wireline Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Michelle Effros, Shirin Jalali","submitted_at":"2010-05-02T01:35:08Z","abstract_excerpt":"This paper proves the separation between source-network coding and channel coding in networks of noisy, discrete, memoryless channels. We show that the set of  achievable distortion matrices in delivering a family of dependent sources across such a network  equals the set of achievable distortion matrices for delivering the same sources across a distinct network which is built by replacing each channel  by a noiseless, point-to-point bit-pipe of the corresponding capacity. Thus a code that applies source-network coding across links that are made almost lossless through the application of indep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.0117","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:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lpSeBLKFs6OkUOZQkBNDCYQzziTlRC5pbNjaNIqXmRsRDe3JU0caayHBnrI4qgixQAwlhgBtEKAPp/I9utmrBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T05:12:53.832183Z"},"content_sha256":"d739d3b441dd239850cd23a076ea71e9ab4c7ec8c818d9d549eed45d514b2bbe","schema_version":"1.0","event_id":"sha256:d739d3b441dd239850cd23a076ea71e9ab4c7ec8c818d9d549eed45d514b2bbe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IJXF2PC3AJRQZDR3ZUTCZLNGWQ/bundle.json","state_url":"https://pith.science/pith/IJXF2PC3AJRQZDR3ZUTCZLNGWQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IJXF2PC3AJRQZDR3ZUTCZLNGWQ/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-10T05:12:53Z","links":{"resolver":"https://pith.science/pith/IJXF2PC3AJRQZDR3ZUTCZLNGWQ","bundle":"https://pith.science/pith/IJXF2PC3AJRQZDR3ZUTCZLNGWQ/bundle.json","state":"https://pith.science/pith/IJXF2PC3AJRQZDR3ZUTCZLNGWQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IJXF2PC3AJRQZDR3ZUTCZLNGWQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:IJXF2PC3AJRQZDR3ZUTCZLNGWQ","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":"04fbcb51ba60aec83a3a03998632ce1a9c2d009ee8ec83247bb9471008522024","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-02T01:35:08Z","title_canon_sha256":"0e469d5b580fec1d9638f688bfdfafa4837fd93fa38d12a24ce5fa4b5cd5faf5"},"schema_version":"1.0","source":{"id":"1005.0117","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.0117","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"1005.0117v1","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.0117","created_at":"2026-05-18T00:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"IJXF2PC3AJRQ","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"IJXF2PC3AJRQZDR3","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"IJXF2PC3","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:d739d3b441dd239850cd23a076ea71e9ab4c7ec8c818d9d549eed45d514b2bbe","target":"graph","created_at":"2026-05-18T00:58:19Z","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":"This paper proves the separation between source-network coding and channel coding in networks of noisy, discrete, memoryless channels. We show that the set of  achievable distortion matrices in delivering a family of dependent sources across such a network  equals the set of achievable distortion matrices for delivering the same sources across a distinct network which is built by replacing each channel  by a noiseless, point-to-point bit-pipe of the corresponding capacity. Thus a code that applies source-network coding across links that are made almost lossless through the application of indep","authors_text":"Michelle Effros, Shirin Jalali","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-02T01:35:08Z","title":"On the Separation of Lossy Source-Network Coding and Channel Coding in Wireline Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.0117","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:e9f5f454947944fa22aa7a5bc44f08c2910b94fc321370549b80eb8008f361ed","target":"record","created_at":"2026-05-18T00:58:19Z","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":"04fbcb51ba60aec83a3a03998632ce1a9c2d009ee8ec83247bb9471008522024","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-02T01:35:08Z","title_canon_sha256":"0e469d5b580fec1d9638f688bfdfafa4837fd93fa38d12a24ce5fa4b5cd5faf5"},"schema_version":"1.0","source":{"id":"1005.0117","kind":"arxiv","version":1}},"canonical_sha256":"426e5d3c5b02630c8e3bcd262cada6b40fd2b60882ed3e331f3b59ae0776af0d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"426e5d3c5b02630c8e3bcd262cada6b40fd2b60882ed3e331f3b59ae0776af0d","first_computed_at":"2026-05-18T00:58:19.587173Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:19.587173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BXzr8MrlA6w4NEyjOMXR1RLET8pXSG2+iI+5NRNgE4NbqiWm3TnoKg1nb7te+URhs4EqdD3qQBG9Ob86sSg8CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:19.587821Z","signed_message":"canonical_sha256_bytes"},"source_id":"1005.0117","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9f5f454947944fa22aa7a5bc44f08c2910b94fc321370549b80eb8008f361ed","sha256:d739d3b441dd239850cd23a076ea71e9ab4c7ec8c818d9d549eed45d514b2bbe"],"state_sha256":"62bd6eda08480dee4dfeeb883ee4388e45ead3710bce3164378c29b5bcb3efa9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"heNPAe8+TC1oV1dRNpdpbm+T6u+zIM8QObDgkGuf/raMXyrErNztnAcmtgQQ5w598qfs0gfFO2C6khN1n0ylBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T05:12:53.835868Z","bundle_sha256":"07b09eeb20424fe583726c2673f03ce25a0da2a3c3c1af93384cc2b01545833d"}}