{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7JXYW7ROQIAEKMDOU45TSOUV73","short_pith_number":"pith:7JXYW7RO","canonical_record":{"source":{"id":"1301.6453","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-28T05:56:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b820518f13fa3b814bc1b3d2f25ea3da88c76b45c2bc02ea2921bd429249bc1b","abstract_canon_sha256":"953feaf1e6578bc73ac5befead248a95dbfd6bdf9e63d10c69fcb8b2a3a93a77"},"schema_version":"1.0"},"canonical_sha256":"fa6f8b7e2e820045306ea73b393a95feef3664282b3f7b0644fb6b8971d8c7ae","source":{"kind":"arxiv","id":"1301.6453","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6453","created_at":"2026-05-18T03:35:15Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6453v1","created_at":"2026-05-18T03:35:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6453","created_at":"2026-05-18T03:35:15Z"},{"alias_kind":"pith_short_12","alias_value":"7JXYW7ROQIAE","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7JXYW7ROQIAEKMDO","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7JXYW7RO","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7JXYW7ROQIAEKMDOU45TSOUV73","target":"record","payload":{"canonical_record":{"source":{"id":"1301.6453","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-28T05:56:12Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b820518f13fa3b814bc1b3d2f25ea3da88c76b45c2bc02ea2921bd429249bc1b","abstract_canon_sha256":"953feaf1e6578bc73ac5befead248a95dbfd6bdf9e63d10c69fcb8b2a3a93a77"},"schema_version":"1.0"},"canonical_sha256":"fa6f8b7e2e820045306ea73b393a95feef3664282b3f7b0644fb6b8971d8c7ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:15.310083Z","signature_b64":"A66tNPwt0QkTN1wOjSbPFmNjdZtuZXQdTFG2+GSMzXFfsRjoRIcS11g8wiTqRj8gyY02zfI6+rUISonprrh8Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa6f8b7e2e820045306ea73b393a95feef3664282b3f7b0644fb6b8971d8c7ae","last_reissued_at":"2026-05-18T03:35:15.309563Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:15.309563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.6453","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:35:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I1Ni9aNmK9qBcYw/F554fugZzkOerc032GJTvn2l01CxG2RlmscuR6Cr8ZVpMmzAlpirhZ49XukeCzMWfkoXCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T22:25:12.520982Z"},"content_sha256":"2921760f9f5dda32b13c02308d1a4b4a6641e02170c5a3241ce2a3a539c88079","schema_version":"1.0","event_id":"sha256:2921760f9f5dda32b13c02308d1a4b4a6641e02170c5a3241ce2a3a539c88079"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7JXYW7ROQIAEKMDOU45TSOUV73","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structured Lattice Codes for 2 \\times 2 \\times 2 MIMO Interference Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Giuseppe Caire, Song-Nam Hong","submitted_at":"2013-01-28T05:56:12Z","abstract_excerpt":"We consider the 2\\times 2\\times 2 multiple-input multipleoutput interference channel where two source-destination pairs wish to communicate with the aid of two intermediate relays. In this paper, we propose a novel lattice strategy called Aligned Precoded Compute-and-Forward (PCoF). This scheme consists of two phases: 1) Using the CoF framework based on signal alignment we transform the Gaussian network into a deterministic finite field network. 2) Using linear precoding (over finite field) we eliminate the end-to-end interference in the finite field domain. Further, we exploit the algebraic s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6453","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:35:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7NF5JEFWyiD03RvC6IBEFgg2K7BjrbrqgF5J7asfAA9sarKNQ0+iFEuSFddlCoHjq6epSf/spT1xu2+/f72iCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T22:25:12.521564Z"},"content_sha256":"cd7927cb51e0fd9dfff5dafe8b3324cc20fe7117795f3611cf3a0129be50fa33","schema_version":"1.0","event_id":"sha256:cd7927cb51e0fd9dfff5dafe8b3324cc20fe7117795f3611cf3a0129be50fa33"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7JXYW7ROQIAEKMDOU45TSOUV73/bundle.json","state_url":"https://pith.science/pith/7JXYW7ROQIAEKMDOU45TSOUV73/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7JXYW7ROQIAEKMDOU45TSOUV73/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-21T22:25:12Z","links":{"resolver":"https://pith.science/pith/7JXYW7ROQIAEKMDOU45TSOUV73","bundle":"https://pith.science/pith/7JXYW7ROQIAEKMDOU45TSOUV73/bundle.json","state":"https://pith.science/pith/7JXYW7ROQIAEKMDOU45TSOUV73/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7JXYW7ROQIAEKMDOU45TSOUV73/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7JXYW7ROQIAEKMDOU45TSOUV73","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":"953feaf1e6578bc73ac5befead248a95dbfd6bdf9e63d10c69fcb8b2a3a93a77","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-28T05:56:12Z","title_canon_sha256":"b820518f13fa3b814bc1b3d2f25ea3da88c76b45c2bc02ea2921bd429249bc1b"},"schema_version":"1.0","source":{"id":"1301.6453","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6453","created_at":"2026-05-18T03:35:15Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6453v1","created_at":"2026-05-18T03:35:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6453","created_at":"2026-05-18T03:35:15Z"},{"alias_kind":"pith_short_12","alias_value":"7JXYW7ROQIAE","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7JXYW7ROQIAEKMDO","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7JXYW7RO","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:cd7927cb51e0fd9dfff5dafe8b3324cc20fe7117795f3611cf3a0129be50fa33","target":"graph","created_at":"2026-05-18T03:35:15Z","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 2\\times 2\\times 2 multiple-input multipleoutput interference channel where two source-destination pairs wish to communicate with the aid of two intermediate relays. In this paper, we propose a novel lattice strategy called Aligned Precoded Compute-and-Forward (PCoF). This scheme consists of two phases: 1) Using the CoF framework based on signal alignment we transform the Gaussian network into a deterministic finite field network. 2) Using linear precoding (over finite field) we eliminate the end-to-end interference in the finite field domain. Further, we exploit the algebraic s","authors_text":"Giuseppe Caire, Song-Nam Hong","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-28T05:56:12Z","title":"Structured Lattice Codes for 2 \\times 2 \\times 2 MIMO Interference Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6453","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:2921760f9f5dda32b13c02308d1a4b4a6641e02170c5a3241ce2a3a539c88079","target":"record","created_at":"2026-05-18T03:35:15Z","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":"953feaf1e6578bc73ac5befead248a95dbfd6bdf9e63d10c69fcb8b2a3a93a77","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-28T05:56:12Z","title_canon_sha256":"b820518f13fa3b814bc1b3d2f25ea3da88c76b45c2bc02ea2921bd429249bc1b"},"schema_version":"1.0","source":{"id":"1301.6453","kind":"arxiv","version":1}},"canonical_sha256":"fa6f8b7e2e820045306ea73b393a95feef3664282b3f7b0644fb6b8971d8c7ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa6f8b7e2e820045306ea73b393a95feef3664282b3f7b0644fb6b8971d8c7ae","first_computed_at":"2026-05-18T03:35:15.309563Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:15.309563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A66tNPwt0QkTN1wOjSbPFmNjdZtuZXQdTFG2+GSMzXFfsRjoRIcS11g8wiTqRj8gyY02zfI6+rUISonprrh8Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:15.310083Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.6453","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2921760f9f5dda32b13c02308d1a4b4a6641e02170c5a3241ce2a3a539c88079","sha256:cd7927cb51e0fd9dfff5dafe8b3324cc20fe7117795f3611cf3a0129be50fa33"],"state_sha256":"99d2d7aa28a19f10dce270902ada181ed59bf5919ffc88db8fae09f28534977f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y3FZ12eV7ZAoxGKRKER2opNbTM5/+3jUlJ/KcD+ieBVTkepD4et4mYHWAMUD0VAQKyAHRHtcAgbcpckubvSACA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T22:25:12.524466Z","bundle_sha256":"546362c6a694be369fb6485db04892f83a54e3c516bf26364728ca2a15225925"}}