{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:IJXF2PC3AJRQZDR3ZUTCZLNGWQ","short_pith_number":"pith:IJXF2PC3","schema_version":"1.0","canonical_sha256":"426e5d3c5b02630c8e3bcd262cada6b40fd2b60882ed3e331f3b59ae0776af0d","source":{"kind":"arxiv","id":"1005.0117","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1005.0117","created_at":"2026-05-18T00:58:19.587275+00:00"},{"alias_kind":"arxiv_version","alias_value":"1005.0117v1","created_at":"2026-05-18T00:58:19.587275+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.0117","created_at":"2026-05-18T00:58:19.587275+00:00"},{"alias_kind":"pith_short_12","alias_value":"IJXF2PC3AJRQ","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"IJXF2PC3AJRQZDR3","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"IJXF2PC3","created_at":"2026-05-18T12:26:09.077623+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/IJXF2PC3AJRQZDR3ZUTCZLNGWQ","json":"https://pith.science/pith/IJXF2PC3AJRQZDR3ZUTCZLNGWQ.json","graph_json":"https://pith.science/api/pith-number/IJXF2PC3AJRQZDR3ZUTCZLNGWQ/graph.json","events_json":"https://pith.science/api/pith-number/IJXF2PC3AJRQZDR3ZUTCZLNGWQ/events.json","paper":"https://pith.science/paper/IJXF2PC3"},"agent_actions":{"view_html":"https://pith.science/pith/IJXF2PC3AJRQZDR3ZUTCZLNGWQ","download_json":"https://pith.science/pith/IJXF2PC3AJRQZDR3ZUTCZLNGWQ.json","view_paper":"https://pith.science/paper/IJXF2PC3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1005.0117&json=true","fetch_graph":"https://pith.science/api/pith-number/IJXF2PC3AJRQZDR3ZUTCZLNGWQ/graph.json","fetch_events":"https://pith.science/api/pith-number/IJXF2PC3AJRQZDR3ZUTCZLNGWQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IJXF2PC3AJRQZDR3ZUTCZLNGWQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IJXF2PC3AJRQZDR3ZUTCZLNGWQ/action/storage_attestation","attest_author":"https://pith.science/pith/IJXF2PC3AJRQZDR3ZUTCZLNGWQ/action/author_attestation","sign_citation":"https://pith.science/pith/IJXF2PC3AJRQZDR3ZUTCZLNGWQ/action/citation_signature","submit_replication":"https://pith.science/pith/IJXF2PC3AJRQZDR3ZUTCZLNGWQ/action/replication_record"}},"created_at":"2026-05-18T00:58:19.587275+00:00","updated_at":"2026-05-18T00:58:19.587275+00:00"}