{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:VGNBNKPQ6QLSXN5Z6EZTQBEKLP","short_pith_number":"pith:VGNBNKPQ","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"},"canonical_sha256":"a99a16a9f0f4172bb7b9f13338048a5bc2aec5bd737f94900e83626399db2a18","source":{"kind":"arxiv","id":"1002.3188","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.3188","created_at":"2026-05-18T02:24:38Z"},{"alias_kind":"arxiv_version","alias_value":"1002.3188v2","created_at":"2026-05-18T02:24:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.3188","created_at":"2026-05-18T02:24:38Z"},{"alias_kind":"pith_short_12","alias_value":"VGNBNKPQ6QLS","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VGNBNKPQ6QLSXN5Z","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VGNBNKPQ","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:VGNBNKPQ6QLSXN5Z6EZTQBEKLP","target":"record","payload":{"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"},"canonical_sha256":"a99a16a9f0f4172bb7b9f13338048a5bc2aec5bd737f94900e83626399db2a18","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"},"source_kind":"arxiv","source_id":"1002.3188","source_version":2,"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:24:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6LX8C5wCAFV4HYoyFGfztfBCUUh4DHrOypawSXOFqPXlBUmRMjW78TPP2w/+6cLIYgu9la/gdmikIyi72jCNBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:57:25.456121Z"},"content_sha256":"42ba4c07aa39bd595e2c2cee993458d8d46df6c2e0877b678d3f2bc3902f74a2","schema_version":"1.0","event_id":"sha256:42ba4c07aa39bd595e2c2cee993458d8d46df6c2e0877b678d3f2bc3902f74a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:VGNBNKPQ6QLSXN5Z6EZTQBEKLP","target":"graph","payload":{"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"},"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:24:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kR4Yzp1xhWo9ve0useb8PMZLrcZvl8WoUsgmPlxS1bOnQANsWFdZHaFbcvCdCNW7MSQMgASOmzG3sYPx1e+bDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:57:25.456489Z"},"content_sha256":"a4fc27594936dd8eef121f93173527f333190f91de194cb1eac899490a6b0006","schema_version":"1.0","event_id":"sha256:a4fc27594936dd8eef121f93173527f333190f91de194cb1eac899490a6b0006"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VGNBNKPQ6QLSXN5Z6EZTQBEKLP/bundle.json","state_url":"https://pith.science/pith/VGNBNKPQ6QLSXN5Z6EZTQBEKLP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VGNBNKPQ6QLSXN5Z6EZTQBEKLP/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-02T19:57:25Z","links":{"resolver":"https://pith.science/pith/VGNBNKPQ6QLSXN5Z6EZTQBEKLP","bundle":"https://pith.science/pith/VGNBNKPQ6QLSXN5Z6EZTQBEKLP/bundle.json","state":"https://pith.science/pith/VGNBNKPQ6QLSXN5Z6EZTQBEKLP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VGNBNKPQ6QLSXN5Z6EZTQBEKLP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:VGNBNKPQ6QLSXN5Z6EZTQBEKLP","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":"6cde8862f188aa63a7de6cdb5a1dcde61d2fd10025da4fa2da3132c99bd40261","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-02-16T23:48:31Z","title_canon_sha256":"ab2e8ff43ccce18d70caa20338dba531f7844c69229d693ca41e9c39c8460e11"},"schema_version":"1.0","source":{"id":"1002.3188","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.3188","created_at":"2026-05-18T02:24:38Z"},{"alias_kind":"arxiv_version","alias_value":"1002.3188v2","created_at":"2026-05-18T02:24:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.3188","created_at":"2026-05-18T02:24:38Z"},{"alias_kind":"pith_short_12","alias_value":"VGNBNKPQ6QLS","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VGNBNKPQ6QLSXN5Z","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VGNBNKPQ","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:a4fc27594936dd8eef121f93173527f333190f91de194cb1eac899490a6b0006","target":"graph","created_at":"2026-05-18T02:24:38Z","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 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,","authors_text":"Abbas El Gamal, Sae-Young Chung, Sung Hoon Lim, Young-Han Kim","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-02-16T23:48:31Z","title":"Noisy Network Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.3188","kind":"arxiv","version":2},"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:42ba4c07aa39bd595e2c2cee993458d8d46df6c2e0877b678d3f2bc3902f74a2","target":"record","created_at":"2026-05-18T02:24:38Z","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":"6cde8862f188aa63a7de6cdb5a1dcde61d2fd10025da4fa2da3132c99bd40261","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-02-16T23:48:31Z","title_canon_sha256":"ab2e8ff43ccce18d70caa20338dba531f7844c69229d693ca41e9c39c8460e11"},"schema_version":"1.0","source":{"id":"1002.3188","kind":"arxiv","version":2}},"canonical_sha256":"a99a16a9f0f4172bb7b9f13338048a5bc2aec5bd737f94900e83626399db2a18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a99a16a9f0f4172bb7b9f13338048a5bc2aec5bd737f94900e83626399db2a18","first_computed_at":"2026-05-18T02:24:38.823432Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:38.823432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"13ZgPwV1OPkwcRcacXfVe6yRQpMna8kK9zFXmyuKHeaqPlXuL4kodv7gJY3C8rSF11J68BFAs1hPJJOkxGltAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:38.823892Z","signed_message":"canonical_sha256_bytes"},"source_id":"1002.3188","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:42ba4c07aa39bd595e2c2cee993458d8d46df6c2e0877b678d3f2bc3902f74a2","sha256:a4fc27594936dd8eef121f93173527f333190f91de194cb1eac899490a6b0006"],"state_sha256":"60d30d98328dcda52a9c11f1d217337297240b9cfb27102bd49f700e11812164"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DZhSCl2qme0z/6dfo/8jSqvfaSlQ0EOUgoXigESpJAubcCnCr9oLJY12irGR6K3xeheODr+BVL0rGN6G6FNOAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T19:57:25.458485Z","bundle_sha256":"ac3944ea42326f0296c6ad192f22dcc0880a1ffbf7406534cf7947bfa29b088f"}}