{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:EVDEQMSKN6TU24TCZGKFF2GAVA","short_pith_number":"pith:EVDEQMSK","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"},"canonical_sha256":"254648324a6fa74d7262c99452e8c0a827f8b28e6e62f06b3c115564ad032678","source":{"kind":"arxiv","id":"1304.4693","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.4693","created_at":"2026-05-18T02:41:42Z"},{"alias_kind":"arxiv_version","alias_value":"1304.4693v2","created_at":"2026-05-18T02:41:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4693","created_at":"2026-05-18T02:41:42Z"},{"alias_kind":"pith_short_12","alias_value":"EVDEQMSKN6TU","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EVDEQMSKN6TU24TC","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EVDEQMSK","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:EVDEQMSKN6TU24TCZGKFF2GAVA","target":"record","payload":{"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"},"canonical_sha256":"254648324a6fa74d7262c99452e8c0a827f8b28e6e62f06b3c115564ad032678","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"},"source_kind":"arxiv","source_id":"1304.4693","source_version":2,"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-18T02:41:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O2Mpldrs07vYz9wYKq5WOUJnWqUwk5xHkB2pdC+7un4HddEEkcyJSvnQjdeTtmvEhQh1OrehCVMTVIfds2NmDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T05:00:54.391144Z"},"content_sha256":"835e4a4b8afdbae4b9df23dfb584aaf4bbe99cfb9d13d9b9e876f717d5abdd2c","schema_version":"1.0","event_id":"sha256:835e4a4b8afdbae4b9df23dfb584aaf4bbe99cfb9d13d9b9e876f717d5abdd2c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:EVDEQMSKN6TU24TCZGKFF2GAVA","target":"graph","payload":{"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"},"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-18T02:41:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iZPPJomzgx+o4ntwAF367XMD6sS3qz8bjtf+sQDz6yekNUutANodb/jWeTJr2fFgssJhxCz+d+xJSP4oA2AmAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T05:00:54.391864Z"},"content_sha256":"965853f78d0d96c0bc9d472c15483275e792163190af12a0464f2e37fe97bbd0","schema_version":"1.0","event_id":"sha256:965853f78d0d96c0bc9d472c15483275e792163190af12a0464f2e37fe97bbd0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EVDEQMSKN6TU24TCZGKFF2GAVA/bundle.json","state_url":"https://pith.science/pith/EVDEQMSKN6TU24TCZGKFF2GAVA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EVDEQMSKN6TU24TCZGKFF2GAVA/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-22T05:00:54Z","links":{"resolver":"https://pith.science/pith/EVDEQMSKN6TU24TCZGKFF2GAVA","bundle":"https://pith.science/pith/EVDEQMSKN6TU24TCZGKFF2GAVA/bundle.json","state":"https://pith.science/pith/EVDEQMSKN6TU24TCZGKFF2GAVA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EVDEQMSKN6TU24TCZGKFF2GAVA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:EVDEQMSKN6TU24TCZGKFF2GAVA","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":"d53d3f9b7c7950753c6131ada9444fa5139c63f9eea2ed9df1367212d09fa07b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-17T05:31:46Z","title_canon_sha256":"b78639538a9fe93b9df5948e2ab2525d7c699cee8ac1e5bd95a8c920fd92a02d"},"schema_version":"1.0","source":{"id":"1304.4693","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.4693","created_at":"2026-05-18T02:41:42Z"},{"alias_kind":"arxiv_version","alias_value":"1304.4693v2","created_at":"2026-05-18T02:41:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4693","created_at":"2026-05-18T02:41:42Z"},{"alias_kind":"pith_short_12","alias_value":"EVDEQMSKN6TU","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EVDEQMSKN6TU24TC","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EVDEQMSK","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:965853f78d0d96c0bc9d472c15483275e792163190af12a0464f2e37fe97bbd0","target":"graph","created_at":"2026-05-18T02:41: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":"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","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-04-17T05:31:46Z","title":"Structured Lattice Codes for Some Two-User Gaussian Networks with Cognition, Coordination and Two Hops"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4693","kind":"arxiv","version":2},"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:835e4a4b8afdbae4b9df23dfb584aaf4bbe99cfb9d13d9b9e876f717d5abdd2c","target":"record","created_at":"2026-05-18T02:41: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":"d53d3f9b7c7950753c6131ada9444fa5139c63f9eea2ed9df1367212d09fa07b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-17T05:31:46Z","title_canon_sha256":"b78639538a9fe93b9df5948e2ab2525d7c699cee8ac1e5bd95a8c920fd92a02d"},"schema_version":"1.0","source":{"id":"1304.4693","kind":"arxiv","version":2}},"canonical_sha256":"254648324a6fa74d7262c99452e8c0a827f8b28e6e62f06b3c115564ad032678","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"254648324a6fa74d7262c99452e8c0a827f8b28e6e62f06b3c115564ad032678","first_computed_at":"2026-05-18T02:41:42.435857Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:42.435857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nxMI/uNcwVXKwr4kBfxX58kFspL6rVAwuOuzGYLbwj+v3W+CIawplE32rzPk6CBG5q/dNxB5AhIuLohQ2vA1CA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:42.436929Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.4693","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:835e4a4b8afdbae4b9df23dfb584aaf4bbe99cfb9d13d9b9e876f717d5abdd2c","sha256:965853f78d0d96c0bc9d472c15483275e792163190af12a0464f2e37fe97bbd0"],"state_sha256":"393ac2496e8c7caa5c323e8021d191274a33138ad9edaf47e5f3a601ad966f97"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1GigwBr7Pr0ch1qpVGz5O2bRAzvIeteFHWyTMc095oAb0rsf+ncTUia5b/uYZQfn/fAgaAFzSbBO06INMcxxAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T05:00:54.396092Z","bundle_sha256":"36a78973e2cc82880b9dc1826a924b65f5eaa435b3d54071209891cf7578434b"}}