{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RO6MUREWIID3XVHF5DSOIS67UO","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":"eb11a4e2b0f0b1a10e41d4d7ced63fbe3a125f1f75b272fa9fcd7c81b8c08f69","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-12T16:33:03Z","title_canon_sha256":"f14ad85bf7745a07fb2cdc9020e454a9ab8cde615df8e00542d9884d228432d6"},"schema_version":"1.0","source":{"id":"1703.04141","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.04141","created_at":"2026-05-18T00:48:49Z"},{"alias_kind":"arxiv_version","alias_value":"1703.04141v1","created_at":"2026-05-18T00:48:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04141","created_at":"2026-05-18T00:48:49Z"},{"alias_kind":"pith_short_12","alias_value":"RO6MUREWIID3","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RO6MUREWIID3XVHF","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RO6MUREW","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:0b70a76b1338389dc10e5b80ed1b30a9f79a4e4c171e43c8e316d326bf665589","target":"graph","created_at":"2026-05-18T00:48:49Z","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":"In bidirectional relaying using Physical Layer Network Coding (PLNC), it is generally assumed that users employ same modulation schemes in the Multiple Access phase. However, as observed by Zhang et al., it may not be desirable for the users to always use the same modulation schemes, particularly when user-relay channels are not equally strong. Such a scheme is called Heterogeneous PLNC. However, the approach in [1] uses the computationally intensive Closest Neighbour Clustering (CNC) algorithm to find the network coding maps to be applied at the relay. Also, the treatment is specific to certa","authors_text":"B. Sundar Rajan, Chinmayananda A., Saket D. Buch","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-12T16:33:03Z","title":"Wireless Bidirectional Relaying using Physical Layer Network Coding with Heterogeneous PSK Modulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04141","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:e9f3f68f19424c262d327976c3eacdc8ea1c264bd8f43974fd0d7462bd8ba6f0","target":"record","created_at":"2026-05-18T00:48:49Z","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":"eb11a4e2b0f0b1a10e41d4d7ced63fbe3a125f1f75b272fa9fcd7c81b8c08f69","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-12T16:33:03Z","title_canon_sha256":"f14ad85bf7745a07fb2cdc9020e454a9ab8cde615df8e00542d9884d228432d6"},"schema_version":"1.0","source":{"id":"1703.04141","kind":"arxiv","version":1}},"canonical_sha256":"8bbcca44964207bbd4e5e8e4e44bdfa38037ea31a6d5ef8033586586463e1529","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8bbcca44964207bbd4e5e8e4e44bdfa38037ea31a6d5ef8033586586463e1529","first_computed_at":"2026-05-18T00:48:49.640222Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:49.640222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JMjIEJR4O77VSLAUjfr91RMiZiNOwslMHgvHVsPt8P05YhbpoB9Xlb2k/BmM9tY6gWMt4N7ry1/g5DFQNvZ4Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:49.641019Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.04141","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9f3f68f19424c262d327976c3eacdc8ea1c264bd8f43974fd0d7462bd8ba6f0","sha256:0b70a76b1338389dc10e5b80ed1b30a9f79a4e4c171e43c8e316d326bf665589"],"state_sha256":"bc2b5d96d27df40cbbb01c6e4bec53eea6263fa779c17bd111f4f9520a4fe4f3"}