{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:HSL62E2BVQTHMFNLLASSIMYEWW","short_pith_number":"pith:HSL62E2B","schema_version":"1.0","canonical_sha256":"3c97ed1341ac267615ab5825243304b5910adab8335d90305d5f228055bfd73f","source":{"kind":"arxiv","id":"1206.0197","version":2},"attestation_state":"computed","paper":{"title":"The Approximate Sum Capacity of the Symmetric Gaussian K-User Interference Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bobak Nazer, Or Ordentlich, Uri Erez","submitted_at":"2012-06-01T14:32:14Z","abstract_excerpt":"Interference alignment has emerged as a powerful tool in the analysis of multi-user networks. Despite considerable recent progress, the capacity region of the Gaussian K-user interference channel is still unknown in general, in part due to the challenges associated with alignment on the signal scale using lattice codes. This paper develops a new framework for lattice interference alignment, based on the compute-and-forward approach. Within this framework, each receiver decodes by first recovering two or more linear combinations of the transmitted codewords with integer-valued coefficients and "},"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":"1206.0197","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-01T14:32:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d34dc3d8f31c2d9544ea7caed0d23dbe15723b04ecd91338f5c7a425a232602a","abstract_canon_sha256":"e0516efd58566b6a8d2c8557b63c394ebe82f06dd23c33ae89125df8bc05837a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:09.664529Z","signature_b64":"e11pPA3sCTFoYMKc+8mCWthUS29utorHKwAJJz8esj8guUYagI1Dwa/FhLAybr4EbLK4qDKYwXRM2/e1WdDNBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c97ed1341ac267615ab5825243304b5910adab8335d90305d5f228055bfd73f","last_reissued_at":"2026-05-18T00:59:09.663885Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:09.663885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Approximate Sum Capacity of the Symmetric Gaussian K-User Interference Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bobak Nazer, Or Ordentlich, Uri Erez","submitted_at":"2012-06-01T14:32:14Z","abstract_excerpt":"Interference alignment has emerged as a powerful tool in the analysis of multi-user networks. Despite considerable recent progress, the capacity region of the Gaussian K-user interference channel is still unknown in general, in part due to the challenges associated with alignment on the signal scale using lattice codes. This paper develops a new framework for lattice interference alignment, based on the compute-and-forward approach. Within this framework, each receiver decodes by first recovering two or more linear combinations of the transmitted codewords with integer-valued coefficients and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.0197","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":"1206.0197","created_at":"2026-05-18T00:59:09.664006+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.0197v2","created_at":"2026-05-18T00:59:09.664006+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.0197","created_at":"2026-05-18T00:59:09.664006+00:00"},{"alias_kind":"pith_short_12","alias_value":"HSL62E2BVQTH","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"HSL62E2BVQTHMFNL","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"HSL62E2B","created_at":"2026-05-18T12:27:09.501522+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/HSL62E2BVQTHMFNLLASSIMYEWW","json":"https://pith.science/pith/HSL62E2BVQTHMFNLLASSIMYEWW.json","graph_json":"https://pith.science/api/pith-number/HSL62E2BVQTHMFNLLASSIMYEWW/graph.json","events_json":"https://pith.science/api/pith-number/HSL62E2BVQTHMFNLLASSIMYEWW/events.json","paper":"https://pith.science/paper/HSL62E2B"},"agent_actions":{"view_html":"https://pith.science/pith/HSL62E2BVQTHMFNLLASSIMYEWW","download_json":"https://pith.science/pith/HSL62E2BVQTHMFNLLASSIMYEWW.json","view_paper":"https://pith.science/paper/HSL62E2B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.0197&json=true","fetch_graph":"https://pith.science/api/pith-number/HSL62E2BVQTHMFNLLASSIMYEWW/graph.json","fetch_events":"https://pith.science/api/pith-number/HSL62E2BVQTHMFNLLASSIMYEWW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HSL62E2BVQTHMFNLLASSIMYEWW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HSL62E2BVQTHMFNLLASSIMYEWW/action/storage_attestation","attest_author":"https://pith.science/pith/HSL62E2BVQTHMFNLLASSIMYEWW/action/author_attestation","sign_citation":"https://pith.science/pith/HSL62E2BVQTHMFNLLASSIMYEWW/action/citation_signature","submit_replication":"https://pith.science/pith/HSL62E2BVQTHMFNLLASSIMYEWW/action/replication_record"}},"created_at":"2026-05-18T00:59:09.664006+00:00","updated_at":"2026-05-18T00:59:09.664006+00:00"}