{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:EVDEQMSKN6TU24TCZGKFF2GAVA","short_pith_number":"pith:EVDEQMSK","schema_version":"1.0","canonical_sha256":"254648324a6fa74d7262c99452e8c0a827f8b28e6e62f06b3c115564ad032678","source":{"kind":"arxiv","id":"1304.4693","version":2},"attestation_state":"computed","paper":{"title":"Structured Lattice Codes for Some Two-User Gaussian Networks with Cognition, Coordination and Two Hops","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-04-17T05:31:46Z","abstract_excerpt":"We study a number of two-user interference networks with multiple-antenna transmitters/receivers, transmitter side information in the form of linear combinations (over finite-field) of the information messages, and two-hop relaying. We start with a Cognitive Interference Channel (CIC) where one of the transmitters (non-cognitive) has knowledge of a rank-1 linear combination of the two information messages, while the other transmitter (cognitive) has access to a rank-2 linear combination of the same messages. This is referred to as the Network-Coded CIC, since such linear combination may be the"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1304.4693","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-17T05:31:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b78639538a9fe93b9df5948e2ab2525d7c699cee8ac1e5bd95a8c920fd92a02d","abstract_canon_sha256":"d53d3f9b7c7950753c6131ada9444fa5139c63f9eea2ed9df1367212d09fa07b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:42.436929Z","signature_b64":"nxMI/uNcwVXKwr4kBfxX58kFspL6rVAwuOuzGYLbwj+v3W+CIawplE32rzPk6CBG5q/dNxB5AhIuLohQ2vA1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"254648324a6fa74d7262c99452e8c0a827f8b28e6e62f06b3c115564ad032678","last_reissued_at":"2026-05-18T02:41:42.435857Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:42.435857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structured Lattice Codes for Some Two-User Gaussian Networks with Cognition, Coordination and Two Hops","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-04-17T05:31:46Z","abstract_excerpt":"We study a number of two-user interference networks with multiple-antenna transmitters/receivers, transmitter side information in the form of linear combinations (over finite-field) of the information messages, and two-hop relaying. We start with a Cognitive Interference Channel (CIC) where one of the transmitters (non-cognitive) has knowledge of a rank-1 linear combination of the two information messages, while the other transmitter (cognitive) has access to a rank-2 linear combination of the same messages. This is referred to as the Network-Coded CIC, since such linear combination may be the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4693","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1304.4693","created_at":"2026-05-18T02:41:42.436224+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.4693v2","created_at":"2026-05-18T02:41:42.436224+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4693","created_at":"2026-05-18T02:41:42.436224+00:00"},{"alias_kind":"pith_short_12","alias_value":"EVDEQMSKN6TU","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"EVDEQMSKN6TU24TC","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"EVDEQMSK","created_at":"2026-05-18T12:27:43.054852+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EVDEQMSKN6TU24TCZGKFF2GAVA","json":"https://pith.science/pith/EVDEQMSKN6TU24TCZGKFF2GAVA.json","graph_json":"https://pith.science/api/pith-number/EVDEQMSKN6TU24TCZGKFF2GAVA/graph.json","events_json":"https://pith.science/api/pith-number/EVDEQMSKN6TU24TCZGKFF2GAVA/events.json","paper":"https://pith.science/paper/EVDEQMSK"},"agent_actions":{"view_html":"https://pith.science/pith/EVDEQMSKN6TU24TCZGKFF2GAVA","download_json":"https://pith.science/pith/EVDEQMSKN6TU24TCZGKFF2GAVA.json","view_paper":"https://pith.science/paper/EVDEQMSK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.4693&json=true","fetch_graph":"https://pith.science/api/pith-number/EVDEQMSKN6TU24TCZGKFF2GAVA/graph.json","fetch_events":"https://pith.science/api/pith-number/EVDEQMSKN6TU24TCZGKFF2GAVA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EVDEQMSKN6TU24TCZGKFF2GAVA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EVDEQMSKN6TU24TCZGKFF2GAVA/action/storage_attestation","attest_author":"https://pith.science/pith/EVDEQMSKN6TU24TCZGKFF2GAVA/action/author_attestation","sign_citation":"https://pith.science/pith/EVDEQMSKN6TU24TCZGKFF2GAVA/action/citation_signature","submit_replication":"https://pith.science/pith/EVDEQMSKN6TU24TCZGKFF2GAVA/action/replication_record"}},"created_at":"2026-05-18T02:41:42.436224+00:00","updated_at":"2026-05-18T02:41:42.436224+00:00"}