{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6HW546DMVCAR27VPYFOD6TIINY","short_pith_number":"pith:6HW546DM","canonical_record":{"source":{"id":"1301.0935","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-05T19:48:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"48d6670fd964fe08d488c7ee106756e314a6e610dde7508c03e26b94476971ea","abstract_canon_sha256":"eacd40be3edc456133a9d248970f9f36cf7b9f215f3c58a50137f944f4712b9e"},"schema_version":"1.0"},"canonical_sha256":"f1edde786ca8811d7eafc15c3f4d086e0467144392d47bb70891593f96d6e410","source":{"kind":"arxiv","id":"1301.0935","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0935","created_at":"2026-05-18T03:37:07Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0935v1","created_at":"2026-05-18T03:37:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0935","created_at":"2026-05-18T03:37:07Z"},{"alias_kind":"pith_short_12","alias_value":"6HW546DMVCAR","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6HW546DMVCAR27VP","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6HW546DM","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6HW546DMVCAR27VPYFOD6TIINY","target":"record","payload":{"canonical_record":{"source":{"id":"1301.0935","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-05T19:48:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"48d6670fd964fe08d488c7ee106756e314a6e610dde7508c03e26b94476971ea","abstract_canon_sha256":"eacd40be3edc456133a9d248970f9f36cf7b9f215f3c58a50137f944f4712b9e"},"schema_version":"1.0"},"canonical_sha256":"f1edde786ca8811d7eafc15c3f4d086e0467144392d47bb70891593f96d6e410","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:07.295259Z","signature_b64":"bJ1ek9qOXMfTgkZ06VwePf4x4nURRPrNL3nd1v31o2e2VAxp/EmaYrRkH4Gydna9Efs1591nso8r7GIQLQNfAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1edde786ca8811d7eafc15c3f4d086e0467144392d47bb70891593f96d6e410","last_reissued_at":"2026-05-18T03:37:07.294493Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:07.294493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.0935","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-18T03:37:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VDNTZwySpst1TXqR5gmtpYBoe7pIbj2xnUvwqktJQi9O7oNFFAEsgwh25iqRim7hjeVoHOq9MBfo1ree+r8bBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:31:40.116359Z"},"content_sha256":"f21cd0a514769c3904d33a89267c982139a88633fb8ef809d1fc50825251642a","schema_version":"1.0","event_id":"sha256:f21cd0a514769c3904d33a89267c982139a88633fb8ef809d1fc50825251642a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6HW546DMVCAR27VPYFOD6TIINY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-user lattice 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":"Chung-Pi Lee, Hsuan-Jung Su, H. Vincent Poor, Shih-Chun Lin","submitted_at":"2013-01-05T19:48:48Z","abstract_excerpt":"This paper considers the multi-antenna multiple access relay channel (MARC), in which multiple users transmit messages to a common destination with the assistance of a relay. In a variety of MARC settings, the dynamic decode and forward (DDF) protocol is very useful due to its outstanding rate performance. However, the lack of good structured codebooks so far hinders practical applications of DDF for MARC. In this work, two classes of structured MARC codes are proposed: 1) one-to-one relay-mapper aided multiuser lattice coding (O-MLC), and 2) modulo-sum relay-mapper aided multiuser lattice cod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0935","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-18T03:37:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oK6AsM+xfS7m1A5oz9FmF2xc+x7bCs1SmNOYEYqx40SRxz0Y75dfcqji0yvRHIFQm8pqNqC8azukWQCAjiXWCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:31:40.116725Z"},"content_sha256":"7da7764686fed613a9dbb2a1978ea1667fe9a0f08fc719db37eb3e96d418df94","schema_version":"1.0","event_id":"sha256:7da7764686fed613a9dbb2a1978ea1667fe9a0f08fc719db37eb3e96d418df94"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6HW546DMVCAR27VPYFOD6TIINY/bundle.json","state_url":"https://pith.science/pith/6HW546DMVCAR27VPYFOD6TIINY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6HW546DMVCAR27VPYFOD6TIINY/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-02T06:31:40Z","links":{"resolver":"https://pith.science/pith/6HW546DMVCAR27VPYFOD6TIINY","bundle":"https://pith.science/pith/6HW546DMVCAR27VPYFOD6TIINY/bundle.json","state":"https://pith.science/pith/6HW546DMVCAR27VPYFOD6TIINY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6HW546DMVCAR27VPYFOD6TIINY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6HW546DMVCAR27VPYFOD6TIINY","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":"eacd40be3edc456133a9d248970f9f36cf7b9f215f3c58a50137f944f4712b9e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-05T19:48:48Z","title_canon_sha256":"48d6670fd964fe08d488c7ee106756e314a6e610dde7508c03e26b94476971ea"},"schema_version":"1.0","source":{"id":"1301.0935","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0935","created_at":"2026-05-18T03:37:07Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0935v1","created_at":"2026-05-18T03:37:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0935","created_at":"2026-05-18T03:37:07Z"},{"alias_kind":"pith_short_12","alias_value":"6HW546DMVCAR","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6HW546DMVCAR27VP","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6HW546DM","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:7da7764686fed613a9dbb2a1978ea1667fe9a0f08fc719db37eb3e96d418df94","target":"graph","created_at":"2026-05-18T03:37: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":"This paper considers the multi-antenna multiple access relay channel (MARC), in which multiple users transmit messages to a common destination with the assistance of a relay. In a variety of MARC settings, the dynamic decode and forward (DDF) protocol is very useful due to its outstanding rate performance. However, the lack of good structured codebooks so far hinders practical applications of DDF for MARC. In this work, two classes of structured MARC codes are proposed: 1) one-to-one relay-mapper aided multiuser lattice coding (O-MLC), and 2) modulo-sum relay-mapper aided multiuser lattice cod","authors_text":"Chung-Pi Lee, Hsuan-Jung Su, H. Vincent Poor, Shih-Chun Lin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-05T19:48:48Z","title":"Multi-user lattice coding for the multiple-access relay channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0935","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:f21cd0a514769c3904d33a89267c982139a88633fb8ef809d1fc50825251642a","target":"record","created_at":"2026-05-18T03:37: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":"eacd40be3edc456133a9d248970f9f36cf7b9f215f3c58a50137f944f4712b9e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-05T19:48:48Z","title_canon_sha256":"48d6670fd964fe08d488c7ee106756e314a6e610dde7508c03e26b94476971ea"},"schema_version":"1.0","source":{"id":"1301.0935","kind":"arxiv","version":1}},"canonical_sha256":"f1edde786ca8811d7eafc15c3f4d086e0467144392d47bb70891593f96d6e410","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1edde786ca8811d7eafc15c3f4d086e0467144392d47bb70891593f96d6e410","first_computed_at":"2026-05-18T03:37:07.294493Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:07.294493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bJ1ek9qOXMfTgkZ06VwePf4x4nURRPrNL3nd1v31o2e2VAxp/EmaYrRkH4Gydna9Efs1591nso8r7GIQLQNfAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:07.295259Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.0935","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f21cd0a514769c3904d33a89267c982139a88633fb8ef809d1fc50825251642a","sha256:7da7764686fed613a9dbb2a1978ea1667fe9a0f08fc719db37eb3e96d418df94"],"state_sha256":"0e14a7b665af74da38cafd4729d63d99d8abcec0c7d54ddd7118987336bf4272"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FCSr6LmIf3U62bsqQIplyhwkfawRmI/fD/yH2wSjELPTKA5Ht6zDFUf7A2Y3aeLV0aJgMGmatsbnAho6iQAOCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T06:31:40.118860Z","bundle_sha256":"aa016bb505093d6cd66fd0c174c390c179747ae274cb7a68c735352b03f4d820"}}