{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:NGD7KVQFBA4KTGRE4XEFWI3LNT","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":"86df1a4eace6e12f3b023f778edd4e32db0ed6dccf7a4c0bee329b4b34349aed","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-02-14T07:21:55Z","title_canon_sha256":"04f2ef422948b4bcdac24de27a94b2720bb41e6d8ed95ed78c837f3803d5f339"},"schema_version":"1.0","source":{"id":"0902.2436","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0902.2436","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"arxiv_version","alias_value":"0902.2436v1","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0902.2436","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"pith_short_12","alias_value":"NGD7KVQFBA4K","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"NGD7KVQFBA4KTGRE","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"NGD7KVQF","created_at":"2026-05-18T12:26:00Z"}],"graph_snapshots":[{"event_id":"sha256:69f420f080397df19c49cb3c07663b55aec14e917bd910729a0c48fa5e84daa6","target":"graph","created_at":"2026-05-18T00:58:20Z","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":"In this paper, a class of relay networks is considered. We assume that, at a node, outgoing channels to its neighbors are orthogonal, while incoming signals from neighbors can interfere with each other. We are interested in the multicast capacity of these networks. As a subclass, we first focus on Gaussian relay networks with interference and find an achievable rate using a lattice coding scheme. It is shown that there is a constant gap between our achievable rate and the information theoretic cut-set bound. This is similar to the recent result by Avestimehr, Diggavi, and Tse, who showed such ","authors_text":"Sae-Young Chung, Wooseok Nam, Yong H. Lee","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-02-14T07:21:55Z","title":"Nested Lattice Codes for Gaussian Relay Networks with Interference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0902.2436","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:2eb878b434ebb9bfa7a7a64ca9b190593dc56e9ca60610e8ab205b8890dd7ccb","target":"record","created_at":"2026-05-18T00:58:20Z","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":"86df1a4eace6e12f3b023f778edd4e32db0ed6dccf7a4c0bee329b4b34349aed","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-02-14T07:21:55Z","title_canon_sha256":"04f2ef422948b4bcdac24de27a94b2720bb41e6d8ed95ed78c837f3803d5f339"},"schema_version":"1.0","source":{"id":"0902.2436","kind":"arxiv","version":1}},"canonical_sha256":"6987f556050838a99a24e5c85b236b6cf8f30e24cc552ed66637944727cf2225","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6987f556050838a99a24e5c85b236b6cf8f30e24cc552ed66637944727cf2225","first_computed_at":"2026-05-18T00:58:20.368032Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:20.368032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ja6xffcBhXFroavJI/Z+iuym69xlw/f5YSQtfpxdV+Aqw5/iHi4h0g7vuvohVdF36O2+pn57wcd4sLm/cX6nCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:20.368766Z","signed_message":"canonical_sha256_bytes"},"source_id":"0902.2436","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2eb878b434ebb9bfa7a7a64ca9b190593dc56e9ca60610e8ab205b8890dd7ccb","sha256:69f420f080397df19c49cb3c07663b55aec14e917bd910729a0c48fa5e84daa6"],"state_sha256":"875f9edcf67ae376340a22a08b0bd2d7799bffacbf3b13b992dffdc8fea925c3"}