{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:M6XTJ65J3HGC6LBM2IRKIPDA56","short_pith_number":"pith:M6XTJ65J","canonical_record":{"source":{"id":"1210.0490","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-01T18:08:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bfbb06ff9be4c05aa584feb36d63ee4f8c5888744e11ff27c2234fc329d27d6d","abstract_canon_sha256":"803c65a514189524406198fdfaef730db2a2e05d3c1502fd58e403f8feef28b6"},"schema_version":"1.0"},"canonical_sha256":"67af34fba9d9cc2f2c2cd222a43c60ef81dfde9c10c9d807b37f9713ef9374cf","source":{"kind":"arxiv","id":"1210.0490","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0490","created_at":"2026-05-18T03:42:45Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0490v2","created_at":"2026-05-18T03:42:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0490","created_at":"2026-05-18T03:42:45Z"},{"alias_kind":"pith_short_12","alias_value":"M6XTJ65J3HGC","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"M6XTJ65J3HGC6LBM","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"M6XTJ65J","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:M6XTJ65J3HGC6LBM2IRKIPDA56","target":"record","payload":{"canonical_record":{"source":{"id":"1210.0490","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-01T18:08:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bfbb06ff9be4c05aa584feb36d63ee4f8c5888744e11ff27c2234fc329d27d6d","abstract_canon_sha256":"803c65a514189524406198fdfaef730db2a2e05d3c1502fd58e403f8feef28b6"},"schema_version":"1.0"},"canonical_sha256":"67af34fba9d9cc2f2c2cd222a43c60ef81dfde9c10c9d807b37f9713ef9374cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:45.829202Z","signature_b64":"z8tNryeYAYibp0hDtXcgLkG6ChCfB4QNn4VDEH6U6tK9H+5fYs5XaS23P8XT95yxDCH6zqFdRw9kvLqJD7cBAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67af34fba9d9cc2f2c2cd222a43c60ef81dfde9c10c9d807b37f9713ef9374cf","last_reissued_at":"2026-05-18T03:42:45.828728Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:45.828728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.0490","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-18T03:42:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BL+KOb2jILfs0KZwrTZs0T1pSPPjtQ9sXdnxh4ii9LcXFfb/ihfxyAB5LuRTv8cV4dKyu3XhtjeSRI2C/2IQBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:28:36.710332Z"},"content_sha256":"b295bcb0cfe86e9234a72488737d58573c59258550db81d9c3c084817638d254","schema_version":"1.0","event_id":"sha256:b295bcb0cfe86e9234a72488737d58573c59258550db81d9c3c084817638d254"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:M6XTJ65J3HGC6LBM2IRKIPDA56","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Physical Layer Network Coding for the Multiple Access Relay Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"B. Sundar Rajan, Vijayvaradharaj T. Muralidharan","submitted_at":"2012-10-01T18:08:35Z","abstract_excerpt":"We consider the two user wireless Multiple Access Relay Channel (MARC), in which nodes $A$ and $B$ want to transmit messages to a destination node $D$ with the help of a relay node $R$. For the MARC, Wang and Giannakis proposed a Complex Field Network Coding (CFNC) scheme. As an alternative, we propose a scheme based on Physical layer Network Coding (PNC), which has so far been studied widely only in the context of two-way relaying. For the proposed PNC scheme, transmission takes place in two phases: (i) Phase 1 during which $A$ and $B$ simultaneously transmit and, $R$ and $D$ receive, (ii) Ph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0490","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-18T03:42:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zLS6NnVwju/QQfRHyBuZfjQpruq2CSXvRbMENdqQy36AAvq//GDqLIXi8/pbThY5Qz1yW+57r1U4OrZcCZ/OBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:28:36.710987Z"},"content_sha256":"29844a7be2bae08799d626c8d6d5c690183a23a9129e13bdc06668cd54445c8b","schema_version":"1.0","event_id":"sha256:29844a7be2bae08799d626c8d6d5c690183a23a9129e13bdc06668cd54445c8b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M6XTJ65J3HGC6LBM2IRKIPDA56/bundle.json","state_url":"https://pith.science/pith/M6XTJ65J3HGC6LBM2IRKIPDA56/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M6XTJ65J3HGC6LBM2IRKIPDA56/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-05T00:28:36Z","links":{"resolver":"https://pith.science/pith/M6XTJ65J3HGC6LBM2IRKIPDA56","bundle":"https://pith.science/pith/M6XTJ65J3HGC6LBM2IRKIPDA56/bundle.json","state":"https://pith.science/pith/M6XTJ65J3HGC6LBM2IRKIPDA56/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M6XTJ65J3HGC6LBM2IRKIPDA56/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:M6XTJ65J3HGC6LBM2IRKIPDA56","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":"803c65a514189524406198fdfaef730db2a2e05d3c1502fd58e403f8feef28b6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-01T18:08:35Z","title_canon_sha256":"bfbb06ff9be4c05aa584feb36d63ee4f8c5888744e11ff27c2234fc329d27d6d"},"schema_version":"1.0","source":{"id":"1210.0490","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0490","created_at":"2026-05-18T03:42:45Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0490v2","created_at":"2026-05-18T03:42:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0490","created_at":"2026-05-18T03:42:45Z"},{"alias_kind":"pith_short_12","alias_value":"M6XTJ65J3HGC","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"M6XTJ65J3HGC6LBM","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"M6XTJ65J","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:29844a7be2bae08799d626c8d6d5c690183a23a9129e13bdc06668cd54445c8b","target":"graph","created_at":"2026-05-18T03:42:45Z","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 consider the two user wireless Multiple Access Relay Channel (MARC), in which nodes $A$ and $B$ want to transmit messages to a destination node $D$ with the help of a relay node $R$. For the MARC, Wang and Giannakis proposed a Complex Field Network Coding (CFNC) scheme. As an alternative, we propose a scheme based on Physical layer Network Coding (PNC), which has so far been studied widely only in the context of two-way relaying. For the proposed PNC scheme, transmission takes place in two phases: (i) Phase 1 during which $A$ and $B$ simultaneously transmit and, $R$ and $D$ receive, (ii) Ph","authors_text":"B. Sundar Rajan, Vijayvaradharaj T. Muralidharan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-01T18:08:35Z","title":"Physical Layer Network Coding for the Multiple Access Relay Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0490","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:b295bcb0cfe86e9234a72488737d58573c59258550db81d9c3c084817638d254","target":"record","created_at":"2026-05-18T03:42:45Z","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":"803c65a514189524406198fdfaef730db2a2e05d3c1502fd58e403f8feef28b6","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-01T18:08:35Z","title_canon_sha256":"bfbb06ff9be4c05aa584feb36d63ee4f8c5888744e11ff27c2234fc329d27d6d"},"schema_version":"1.0","source":{"id":"1210.0490","kind":"arxiv","version":2}},"canonical_sha256":"67af34fba9d9cc2f2c2cd222a43c60ef81dfde9c10c9d807b37f9713ef9374cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67af34fba9d9cc2f2c2cd222a43c60ef81dfde9c10c9d807b37f9713ef9374cf","first_computed_at":"2026-05-18T03:42:45.828728Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:45.828728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z8tNryeYAYibp0hDtXcgLkG6ChCfB4QNn4VDEH6U6tK9H+5fYs5XaS23P8XT95yxDCH6zqFdRw9kvLqJD7cBAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:45.829202Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.0490","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b295bcb0cfe86e9234a72488737d58573c59258550db81d9c3c084817638d254","sha256:29844a7be2bae08799d626c8d6d5c690183a23a9129e13bdc06668cd54445c8b"],"state_sha256":"ef144fbfcbab902fafc598b0faff8f730932027ab7e2b0c1ebb01a88d9ac7154"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zl/dACLbZxQc/ROcK6PYxwtL5xBFWe1eV/oqa5IG7JQmtlgAuaB8sgMhLme8j5tAVp1UerYJGPM4eJh1eVZVCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T00:28:36.714139Z","bundle_sha256":"5b52eaf6a30fd01578831a03921967b1d2cf5555625fb4ba2dd5e76f4860c015"}}