{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:N5E6NBFRVVTVUGTR6ZNH5R6YTF","short_pith_number":"pith:N5E6NBFR","canonical_record":{"source":{"id":"1102.4646","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-23T01:02:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6184fea84cfce244bd2eac9a7f3b60d079035dec231394c334d1eb67cb14d5ee","abstract_canon_sha256":"282f53cfd16f2e3906c7036f244ddc059dca4904f58f93495cf03ae0432cc840"},"schema_version":"1.0"},"canonical_sha256":"6f49e684b1ad675a1a71f65a7ec7d8996d6704d5a622c188dde44e3bc5e250d6","source":{"kind":"arxiv","id":"1102.4646","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.4646","created_at":"2026-05-18T04:28:07Z"},{"alias_kind":"arxiv_version","alias_value":"1102.4646v1","created_at":"2026-05-18T04:28:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4646","created_at":"2026-05-18T04:28:07Z"},{"alias_kind":"pith_short_12","alias_value":"N5E6NBFRVVTV","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"N5E6NBFRVVTVUGTR","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"N5E6NBFR","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:N5E6NBFRVVTVUGTR6ZNH5R6YTF","target":"record","payload":{"canonical_record":{"source":{"id":"1102.4646","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-23T01:02:10Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6184fea84cfce244bd2eac9a7f3b60d079035dec231394c334d1eb67cb14d5ee","abstract_canon_sha256":"282f53cfd16f2e3906c7036f244ddc059dca4904f58f93495cf03ae0432cc840"},"schema_version":"1.0"},"canonical_sha256":"6f49e684b1ad675a1a71f65a7ec7d8996d6704d5a622c188dde44e3bc5e250d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:07.705861Z","signature_b64":"VpxxHbHx2AsxbU9p2slOXblFKvB8JRrfCf7X22Sej4sTVg1ifqywi5beJLJ5eiMEBnXLV0OfOueXbNFk9CmnDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f49e684b1ad675a1a71f65a7ec7d8996d6704d5a622c188dde44e3bc5e250d6","last_reissued_at":"2026-05-18T04:28:07.705266Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:07.705266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.4646","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-18T04:28:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2dDOum2vpQGa9tUCZkvNNge8VZEFabxYqgazo7QCgdHSyEqmQe4PzNkPPHqAOiumFBlzcNTLjnyX1Y5TKym8Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T12:49:45.434803Z"},"content_sha256":"bf8763cca79b746cb06029cef54bf72ee36e94f89420b35bfac38b16f8e70522","schema_version":"1.0","event_id":"sha256:bf8763cca79b746cb06029cef54bf72ee36e94f89420b35bfac38b16f8e70522"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:N5E6NBFRVVTVUGTR6ZNH5R6YTF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Superposition Noisy Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Neevan Ramalingam, Zhengdao Wang","submitted_at":"2011-02-23T01:02:10Z","abstract_excerpt":"We present a superposition coding scheme for communication over a network, which combines partial decode and forward and noisy network coding. This hybrid scheme is termed as superposition noisy network coding. The scheme is designed and analyzed for single relay channel, single source multicast network and multiple source multicast network. The achievable rate region is determined for each case. The special cases of Gaussian single relay channel and two way relay channel are analyzed for superposition noisy network coding. The achievable rate of the proposed scheme is higher than the existing"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4646","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-18T04:28:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GqPFwa3EAwFQO/v5YBQ1RIFtWULbiX8aIqFx5emkZa6NfpgW+EA9HbEO/a/lqH2vOGuJCU6ZZFK+pnckD2x1Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T12:49:45.435144Z"},"content_sha256":"c860fce90ecc2dbd3db8744cca6284d7dc66238644396aed4c1fe811bdb6dacd","schema_version":"1.0","event_id":"sha256:c860fce90ecc2dbd3db8744cca6284d7dc66238644396aed4c1fe811bdb6dacd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N5E6NBFRVVTVUGTR6ZNH5R6YTF/bundle.json","state_url":"https://pith.science/pith/N5E6NBFRVVTVUGTR6ZNH5R6YTF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N5E6NBFRVVTVUGTR6ZNH5R6YTF/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-26T12:49:45Z","links":{"resolver":"https://pith.science/pith/N5E6NBFRVVTVUGTR6ZNH5R6YTF","bundle":"https://pith.science/pith/N5E6NBFRVVTVUGTR6ZNH5R6YTF/bundle.json","state":"https://pith.science/pith/N5E6NBFRVVTVUGTR6ZNH5R6YTF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N5E6NBFRVVTVUGTR6ZNH5R6YTF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:N5E6NBFRVVTVUGTR6ZNH5R6YTF","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":"282f53cfd16f2e3906c7036f244ddc059dca4904f58f93495cf03ae0432cc840","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-23T01:02:10Z","title_canon_sha256":"6184fea84cfce244bd2eac9a7f3b60d079035dec231394c334d1eb67cb14d5ee"},"schema_version":"1.0","source":{"id":"1102.4646","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.4646","created_at":"2026-05-18T04:28:07Z"},{"alias_kind":"arxiv_version","alias_value":"1102.4646v1","created_at":"2026-05-18T04:28:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4646","created_at":"2026-05-18T04:28:07Z"},{"alias_kind":"pith_short_12","alias_value":"N5E6NBFRVVTV","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"N5E6NBFRVVTVUGTR","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"N5E6NBFR","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:c860fce90ecc2dbd3db8744cca6284d7dc66238644396aed4c1fe811bdb6dacd","target":"graph","created_at":"2026-05-18T04:28:07Z","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":"We present a superposition coding scheme for communication over a network, which combines partial decode and forward and noisy network coding. This hybrid scheme is termed as superposition noisy network coding. The scheme is designed and analyzed for single relay channel, single source multicast network and multiple source multicast network. The achievable rate region is determined for each case. The special cases of Gaussian single relay channel and two way relay channel are analyzed for superposition noisy network coding. The achievable rate of the proposed scheme is higher than the existing","authors_text":"Neevan Ramalingam, Zhengdao Wang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-23T01:02:10Z","title":"Superposition Noisy Network Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4646","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:bf8763cca79b746cb06029cef54bf72ee36e94f89420b35bfac38b16f8e70522","target":"record","created_at":"2026-05-18T04:28:07Z","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":"282f53cfd16f2e3906c7036f244ddc059dca4904f58f93495cf03ae0432cc840","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-23T01:02:10Z","title_canon_sha256":"6184fea84cfce244bd2eac9a7f3b60d079035dec231394c334d1eb67cb14d5ee"},"schema_version":"1.0","source":{"id":"1102.4646","kind":"arxiv","version":1}},"canonical_sha256":"6f49e684b1ad675a1a71f65a7ec7d8996d6704d5a622c188dde44e3bc5e250d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f49e684b1ad675a1a71f65a7ec7d8996d6704d5a622c188dde44e3bc5e250d6","first_computed_at":"2026-05-18T04:28:07.705266Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:28:07.705266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VpxxHbHx2AsxbU9p2slOXblFKvB8JRrfCf7X22Sej4sTVg1ifqywi5beJLJ5eiMEBnXLV0OfOueXbNFk9CmnDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:28:07.705861Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.4646","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf8763cca79b746cb06029cef54bf72ee36e94f89420b35bfac38b16f8e70522","sha256:c860fce90ecc2dbd3db8744cca6284d7dc66238644396aed4c1fe811bdb6dacd"],"state_sha256":"9efa5ae80f25e7c2810e9b6eef01fa9265e7e4086fb98a572fd878c7c532a87f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/NKIdWWR3fLdugRM0hIQcfO3lhQO8KtCvPP6EoW6m1XNR41kf7/iVS+D8uyIPwxDNLg8YzKv0gHPw+00PzyDBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T12:49:45.437072Z","bundle_sha256":"47689cf714c2bc6c74210ec53e42ac55eae5cd3ba096e29749a022f34af2e8d7"}}