{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:6T7DKYZMTTZYEEH5AKPZOYEMT4","short_pith_number":"pith:6T7DKYZM","canonical_record":{"source":{"id":"1212.1198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-05T22:48:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a3cb3aabd705ce45c23ea7a411e6ea78164cfaa4ecd2179430eceabbaded2359","abstract_canon_sha256":"cd06be3eb9228d77d544a83b42a6b41890cfbe13d3f8f9a7985f46182d283d07"},"schema_version":"1.0"},"canonical_sha256":"f4fe35632c9cf38210fd029f97608c9f16ccd37fb3d7a1edf1332b192c060736","source":{"kind":"arxiv","id":"1212.1198","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.1198","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"arxiv_version","alias_value":"1212.1198v1","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1198","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"pith_short_12","alias_value":"6T7DKYZMTTZY","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6T7DKYZMTTZYEEH5","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6T7DKYZM","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:6T7DKYZMTTZYEEH5AKPZOYEMT4","target":"record","payload":{"canonical_record":{"source":{"id":"1212.1198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-05T22:48:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a3cb3aabd705ce45c23ea7a411e6ea78164cfaa4ecd2179430eceabbaded2359","abstract_canon_sha256":"cd06be3eb9228d77d544a83b42a6b41890cfbe13d3f8f9a7985f46182d283d07"},"schema_version":"1.0"},"canonical_sha256":"f4fe35632c9cf38210fd029f97608c9f16ccd37fb3d7a1edf1332b192c060736","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:42.758217Z","signature_b64":"JYG0JeBvqNsgSicPWk1YB3+SYlit3bVtFwS7m+cZ0TlXZlhXyfBWQ/lHfhBlke3drr+tAhG1pF7nt7ZhdUnvDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4fe35632c9cf38210fd029f97608c9f16ccd37fb3d7a1edf1332b192c060736","last_reissued_at":"2026-05-18T00:58:42.757845Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:42.757845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.1198","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-18T00:58:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j5SMVo6jJpF8zsdVcMQ4faMRL5QuraNpzjBm2LKelUOrF4iUpGPDb/4w5Hn1vZMAiPBB0CuTTlMcNPrqy+KlDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:36:07.569643Z"},"content_sha256":"f313155b4068601a8f7710331a0871261948e119735966ca0f75bf634972eb70","schema_version":"1.0","event_id":"sha256:f313155b4068601a8f7710331a0871261948e119735966ca0f75bf634972eb70"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:6T7DKYZMTTZYEEH5AKPZOYEMT4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lattice Coding for the Two-way Two-relay Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chiu Ngo, Huai-Rong Shao, Natasha Devroye, Yiwei Song","submitted_at":"2012-12-05T22:48:39Z","abstract_excerpt":"Lattice coding techniques may be used to derive achievable rate regions which outperform known independent, identically distributed (i.i.d.) random codes in multi-source relay networks and in particular the two-way relay channel. Gains stem from the ability to decode the sum of codewords (or messages) using lattice codes at higher rates than possible with i.i.d. random codes. Here we develop a novel lattice coding scheme for the Two-way Two-relay Channel: 1 <-> 2 <-> 3 <-> 4, where Node 1 and 4 simultaneously communicate with each other through two relay nodes 2 and 3. Each node only communica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.1198","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-18T00:58:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9R9Y4CNWFthh2u/CJlTidb5joDYmX42A5twakrn8TSwCqZcVNsYuqT4MpwIJz7Qwt587yT+udaSVCgzEVQvgCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:36:07.570331Z"},"content_sha256":"d6061747be2ade54131d01ff0dedacf5fadf0c95a4432543d7113f049591faaa","schema_version":"1.0","event_id":"sha256:d6061747be2ade54131d01ff0dedacf5fadf0c95a4432543d7113f049591faaa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6T7DKYZMTTZYEEH5AKPZOYEMT4/bundle.json","state_url":"https://pith.science/pith/6T7DKYZMTTZYEEH5AKPZOYEMT4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6T7DKYZMTTZYEEH5AKPZOYEMT4/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-05-28T18:36:07Z","links":{"resolver":"https://pith.science/pith/6T7DKYZMTTZYEEH5AKPZOYEMT4","bundle":"https://pith.science/pith/6T7DKYZMTTZYEEH5AKPZOYEMT4/bundle.json","state":"https://pith.science/pith/6T7DKYZMTTZYEEH5AKPZOYEMT4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6T7DKYZMTTZYEEH5AKPZOYEMT4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:6T7DKYZMTTZYEEH5AKPZOYEMT4","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":"cd06be3eb9228d77d544a83b42a6b41890cfbe13d3f8f9a7985f46182d283d07","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-05T22:48:39Z","title_canon_sha256":"a3cb3aabd705ce45c23ea7a411e6ea78164cfaa4ecd2179430eceabbaded2359"},"schema_version":"1.0","source":{"id":"1212.1198","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.1198","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"arxiv_version","alias_value":"1212.1198v1","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1198","created_at":"2026-05-18T00:58:42Z"},{"alias_kind":"pith_short_12","alias_value":"6T7DKYZMTTZY","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6T7DKYZMTTZYEEH5","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6T7DKYZM","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:d6061747be2ade54131d01ff0dedacf5fadf0c95a4432543d7113f049591faaa","target":"graph","created_at":"2026-05-18T00:58:42Z","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":"Lattice coding techniques may be used to derive achievable rate regions which outperform known independent, identically distributed (i.i.d.) random codes in multi-source relay networks and in particular the two-way relay channel. Gains stem from the ability to decode the sum of codewords (or messages) using lattice codes at higher rates than possible with i.i.d. random codes. Here we develop a novel lattice coding scheme for the Two-way Two-relay Channel: 1 <-> 2 <-> 3 <-> 4, where Node 1 and 4 simultaneously communicate with each other through two relay nodes 2 and 3. Each node only communica","authors_text":"Chiu Ngo, Huai-Rong Shao, Natasha Devroye, Yiwei Song","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-05T22:48:39Z","title":"Lattice Coding for the Two-way Two-relay Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.1198","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:f313155b4068601a8f7710331a0871261948e119735966ca0f75bf634972eb70","target":"record","created_at":"2026-05-18T00:58:42Z","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":"cd06be3eb9228d77d544a83b42a6b41890cfbe13d3f8f9a7985f46182d283d07","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-05T22:48:39Z","title_canon_sha256":"a3cb3aabd705ce45c23ea7a411e6ea78164cfaa4ecd2179430eceabbaded2359"},"schema_version":"1.0","source":{"id":"1212.1198","kind":"arxiv","version":1}},"canonical_sha256":"f4fe35632c9cf38210fd029f97608c9f16ccd37fb3d7a1edf1332b192c060736","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4fe35632c9cf38210fd029f97608c9f16ccd37fb3d7a1edf1332b192c060736","first_computed_at":"2026-05-18T00:58:42.757845Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:42.757845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JYG0JeBvqNsgSicPWk1YB3+SYlit3bVtFwS7m+cZ0TlXZlhXyfBWQ/lHfhBlke3drr+tAhG1pF7nt7ZhdUnvDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:42.758217Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.1198","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f313155b4068601a8f7710331a0871261948e119735966ca0f75bf634972eb70","sha256:d6061747be2ade54131d01ff0dedacf5fadf0c95a4432543d7113f049591faaa"],"state_sha256":"cbe76999707cfc934e99a5f5d6694a27f9db9addb2038ca0288fb501e21459ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iEvxSjaZYbPRZnqMezLvtk4xVqyXHToUDc6aS+9M18tM8LDv6P3APk7XLFJJ11b8tn2+zVq9e9+CzDlYKITSCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T18:36:07.574111Z","bundle_sha256":"650f939d584967fcbb93e5cc63ba11b61161d4d88643342f07a188bb5a62f08c"}}