{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DUPNXL3MPZKGEIQ6SIKTVZILG3","short_pith_number":"pith:DUPNXL3M","canonical_record":{"source":{"id":"1404.0273","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-01T15:22:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ff1517855a76d30530a7980f3b8f2c131c074b4f46a876114eecb5bcec0b42a4","abstract_canon_sha256":"5d631d37333e75e06c04506921eea43df8687462306afd28d8147bb5b48eeffe"},"schema_version":"1.0"},"canonical_sha256":"1d1edbaf6c7e5462221e92153ae50b36e9dc80c4451f94bc939ca800d8863298","source":{"kind":"arxiv","id":"1404.0273","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.0273","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"arxiv_version","alias_value":"1404.0273v2","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0273","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"pith_short_12","alias_value":"DUPNXL3MPZKG","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DUPNXL3MPZKGEIQ6","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DUPNXL3M","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DUPNXL3MPZKGEIQ6SIKTVZILG3","target":"record","payload":{"canonical_record":{"source":{"id":"1404.0273","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-01T15:22:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ff1517855a76d30530a7980f3b8f2c131c074b4f46a876114eecb5bcec0b42a4","abstract_canon_sha256":"5d631d37333e75e06c04506921eea43df8687462306afd28d8147bb5b48eeffe"},"schema_version":"1.0"},"canonical_sha256":"1d1edbaf6c7e5462221e92153ae50b36e9dc80c4451f94bc939ca800d8863298","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:52.007724Z","signature_b64":"mo+wPxKrTOQag4E6OksOVm/tQdkF4gg7Z8aaIraOn2b49VjnZhXbrW+GTvuCLk5pSTxeZuNB78w07sJAJzN6BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d1edbaf6c7e5462221e92153ae50b36e9dc80c4451f94bc939ca800d8863298","last_reissued_at":"2026-05-18T00:57:52.007178Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:52.007178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.0273","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-18T00:57:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FxkfVAKmcr8oNK2iAQOws7BkEdMgB0xj9hAoMxWJ5KMOTnTQGjKGQmCqg8TPCI6c9vfWy0Itub7mQton3WQkDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T20:25:25.359622Z"},"content_sha256":"35e71cbef138e2868858444bdc3ba21fda0f97b4d02ceb285af1033315e6e64b","schema_version":"1.0","event_id":"sha256:35e71cbef138e2868858444bdc3ba21fda0f97b4d02ceb285af1033315e6e64b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DUPNXL3MPZKGEIQ6SIKTVZILG3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lattice Codes for Many-to-One Interference Channels With and Without Cognitive Messages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jingge Zhu, Michael Gastpar","submitted_at":"2014-04-01T15:22:09Z","abstract_excerpt":"A new achievable rate region is given for the Gaussian cognitive many-to-one interference channel. The proposed novel coding scheme is based on the compute-and-forward approach with lattice codes. Using the idea of decoding sums of codewords, our scheme improves considerably upon the conventional coding schemes which treat interference as noise or decode messages simultaneously. Our strategy also extends directly to the usual many-to-one interference channels without cognitive messages. Comparing to the usual compute-and-forward scheme where a fixed lattice is used for the code construction, t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0273","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-18T00:57:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wp01YKav1Fl0C5N89iA6VS9IgTpMNHM2cWgEoDtvb38wuJ+S1NM/cfHB4f7M+Lm2qA6LNe2uU1EI1A8WLVf5BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T20:25:25.360016Z"},"content_sha256":"9cd2be5759891d2a797cdaa2c7857e2c4f220a53b93b41af89b2f465b8de3a8f","schema_version":"1.0","event_id":"sha256:9cd2be5759891d2a797cdaa2c7857e2c4f220a53b93b41af89b2f465b8de3a8f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DUPNXL3MPZKGEIQ6SIKTVZILG3/bundle.json","state_url":"https://pith.science/pith/DUPNXL3MPZKGEIQ6SIKTVZILG3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DUPNXL3MPZKGEIQ6SIKTVZILG3/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-24T20:25:25Z","links":{"resolver":"https://pith.science/pith/DUPNXL3MPZKGEIQ6SIKTVZILG3","bundle":"https://pith.science/pith/DUPNXL3MPZKGEIQ6SIKTVZILG3/bundle.json","state":"https://pith.science/pith/DUPNXL3MPZKGEIQ6SIKTVZILG3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DUPNXL3MPZKGEIQ6SIKTVZILG3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DUPNXL3MPZKGEIQ6SIKTVZILG3","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":"5d631d37333e75e06c04506921eea43df8687462306afd28d8147bb5b48eeffe","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-01T15:22:09Z","title_canon_sha256":"ff1517855a76d30530a7980f3b8f2c131c074b4f46a876114eecb5bcec0b42a4"},"schema_version":"1.0","source":{"id":"1404.0273","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.0273","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"arxiv_version","alias_value":"1404.0273v2","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0273","created_at":"2026-05-18T00:57:52Z"},{"alias_kind":"pith_short_12","alias_value":"DUPNXL3MPZKG","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DUPNXL3MPZKGEIQ6","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DUPNXL3M","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:9cd2be5759891d2a797cdaa2c7857e2c4f220a53b93b41af89b2f465b8de3a8f","target":"graph","created_at":"2026-05-18T00:57:52Z","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":"A new achievable rate region is given for the Gaussian cognitive many-to-one interference channel. The proposed novel coding scheme is based on the compute-and-forward approach with lattice codes. Using the idea of decoding sums of codewords, our scheme improves considerably upon the conventional coding schemes which treat interference as noise or decode messages simultaneously. Our strategy also extends directly to the usual many-to-one interference channels without cognitive messages. Comparing to the usual compute-and-forward scheme where a fixed lattice is used for the code construction, t","authors_text":"Jingge Zhu, Michael Gastpar","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-01T15:22:09Z","title":"Lattice Codes for Many-to-One Interference Channels With and Without Cognitive Messages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0273","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:35e71cbef138e2868858444bdc3ba21fda0f97b4d02ceb285af1033315e6e64b","target":"record","created_at":"2026-05-18T00:57:52Z","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":"5d631d37333e75e06c04506921eea43df8687462306afd28d8147bb5b48eeffe","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-01T15:22:09Z","title_canon_sha256":"ff1517855a76d30530a7980f3b8f2c131c074b4f46a876114eecb5bcec0b42a4"},"schema_version":"1.0","source":{"id":"1404.0273","kind":"arxiv","version":2}},"canonical_sha256":"1d1edbaf6c7e5462221e92153ae50b36e9dc80c4451f94bc939ca800d8863298","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d1edbaf6c7e5462221e92153ae50b36e9dc80c4451f94bc939ca800d8863298","first_computed_at":"2026-05-18T00:57:52.007178Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:52.007178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mo+wPxKrTOQag4E6OksOVm/tQdkF4gg7Z8aaIraOn2b49VjnZhXbrW+GTvuCLk5pSTxeZuNB78w07sJAJzN6BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:52.007724Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.0273","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35e71cbef138e2868858444bdc3ba21fda0f97b4d02ceb285af1033315e6e64b","sha256:9cd2be5759891d2a797cdaa2c7857e2c4f220a53b93b41af89b2f465b8de3a8f"],"state_sha256":"6113e83a16534126477b85cbb020bff5e1e7db4b960e8558fbd4f6ab05f3f82d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DCdR8HLxs/jcASpvrJyDkK7w7kZtWcYIQdggHuu8bIOJ/e7r8OSHYz852af9u4jA2vEmJH26D3TuzYaM1+2CBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T20:25:25.363827Z","bundle_sha256":"a369651c7c7218ceb5f38d3a611d1216bbd8b1c419179a1c43faba6b84ebca0b"}}