{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:VGNBNKPQ6QLSXN5Z6EZTQBEKLP","short_pith_number":"pith:VGNBNKPQ","schema_version":"1.0","canonical_sha256":"a99a16a9f0f4172bb7b9f13338048a5bc2aec5bd737f94900e83626399db2a18","source":{"kind":"arxiv","id":"1002.3188","version":2},"attestation_state":"computed","paper":{"title":"Noisy Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abbas El Gamal, Sae-Young Chung, Sung Hoon Lim, Young-Han Kim","submitted_at":"2010-02-16T23:48:31Z","abstract_excerpt":"A noisy network coding scheme for sending multiple sources over a general noisy network is presented. For multi-source multicast networks, the scheme naturally extends both network coding over noiseless networks by Ahlswede, Cai, Li, and Yeung, and compress-forward coding for the relay channel by Cover and El Gamal to general discrete memoryless and Gaussian networks. The scheme also recovers as special cases the results on coding for wireless relay networks and deterministic networks by Avestimehr, Diggavi, and Tse, and coding for wireless erasure networks by Dana, Gowaikar, Palanki, Hassibi,"},"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":"1002.3188","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-02-16T23:48:31Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ab2e8ff43ccce18d70caa20338dba531f7844c69229d693ca41e9c39c8460e11","abstract_canon_sha256":"6cde8862f188aa63a7de6cdb5a1dcde61d2fd10025da4fa2da3132c99bd40261"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:38.823892Z","signature_b64":"13ZgPwV1OPkwcRcacXfVe6yRQpMna8kK9zFXmyuKHeaqPlXuL4kodv7gJY3C8rSF11J68BFAs1hPJJOkxGltAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a99a16a9f0f4172bb7b9f13338048a5bc2aec5bd737f94900e83626399db2a18","last_reissued_at":"2026-05-18T02:24:38.823432Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:38.823432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Noisy Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Abbas El Gamal, Sae-Young Chung, Sung Hoon Lim, Young-Han Kim","submitted_at":"2010-02-16T23:48:31Z","abstract_excerpt":"A noisy network coding scheme for sending multiple sources over a general noisy network is presented. For multi-source multicast networks, the scheme naturally extends both network coding over noiseless networks by Ahlswede, Cai, Li, and Yeung, and compress-forward coding for the relay channel by Cover and El Gamal to general discrete memoryless and Gaussian networks. The scheme also recovers as special cases the results on coding for wireless relay networks and deterministic networks by Avestimehr, Diggavi, and Tse, and coding for wireless erasure networks by Dana, Gowaikar, Palanki, Hassibi,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.3188","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":"1002.3188","created_at":"2026-05-18T02:24:38.823492+00:00"},{"alias_kind":"arxiv_version","alias_value":"1002.3188v2","created_at":"2026-05-18T02:24:38.823492+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.3188","created_at":"2026-05-18T02:24:38.823492+00:00"},{"alias_kind":"pith_short_12","alias_value":"VGNBNKPQ6QLS","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"VGNBNKPQ6QLSXN5Z","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"VGNBNKPQ","created_at":"2026-05-18T12:26:15.391820+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/VGNBNKPQ6QLSXN5Z6EZTQBEKLP","json":"https://pith.science/pith/VGNBNKPQ6QLSXN5Z6EZTQBEKLP.json","graph_json":"https://pith.science/api/pith-number/VGNBNKPQ6QLSXN5Z6EZTQBEKLP/graph.json","events_json":"https://pith.science/api/pith-number/VGNBNKPQ6QLSXN5Z6EZTQBEKLP/events.json","paper":"https://pith.science/paper/VGNBNKPQ"},"agent_actions":{"view_html":"https://pith.science/pith/VGNBNKPQ6QLSXN5Z6EZTQBEKLP","download_json":"https://pith.science/pith/VGNBNKPQ6QLSXN5Z6EZTQBEKLP.json","view_paper":"https://pith.science/paper/VGNBNKPQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1002.3188&json=true","fetch_graph":"https://pith.science/api/pith-number/VGNBNKPQ6QLSXN5Z6EZTQBEKLP/graph.json","fetch_events":"https://pith.science/api/pith-number/VGNBNKPQ6QLSXN5Z6EZTQBEKLP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VGNBNKPQ6QLSXN5Z6EZTQBEKLP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VGNBNKPQ6QLSXN5Z6EZTQBEKLP/action/storage_attestation","attest_author":"https://pith.science/pith/VGNBNKPQ6QLSXN5Z6EZTQBEKLP/action/author_attestation","sign_citation":"https://pith.science/pith/VGNBNKPQ6QLSXN5Z6EZTQBEKLP/action/citation_signature","submit_replication":"https://pith.science/pith/VGNBNKPQ6QLSXN5Z6EZTQBEKLP/action/replication_record"}},"created_at":"2026-05-18T02:24:38.823492+00:00","updated_at":"2026-05-18T02:24:38.823492+00:00"}