{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:HSL62E2BVQTHMFNLLASSIMYEWW","short_pith_number":"pith:HSL62E2B","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"},"canonical_sha256":"3c97ed1341ac267615ab5825243304b5910adab8335d90305d5f228055bfd73f","source":{"kind":"arxiv","id":"1206.0197","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.0197","created_at":"2026-05-18T00:59:09Z"},{"alias_kind":"arxiv_version","alias_value":"1206.0197v2","created_at":"2026-05-18T00:59:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.0197","created_at":"2026-05-18T00:59:09Z"},{"alias_kind":"pith_short_12","alias_value":"HSL62E2BVQTH","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HSL62E2BVQTHMFNL","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HSL62E2B","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:HSL62E2BVQTHMFNLLASSIMYEWW","target":"record","payload":{"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"},"canonical_sha256":"3c97ed1341ac267615ab5825243304b5910adab8335d90305d5f228055bfd73f","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"},"source_kind":"arxiv","source_id":"1206.0197","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:59:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xGBEvzg8QEep/R0M3fipmjkSvTfiK0f55Grj3miwQ6R5aG87yKGMNOmL0ud/QMCgBzStETa3F0MGq1GOGZT/DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:09:15.547507Z"},"content_sha256":"d6af4a99b0d6f990dd065a6de19beebc2cf6af8c2de13e14f54355b5b8995f02","schema_version":"1.0","event_id":"sha256:d6af4a99b0d6f990dd065a6de19beebc2cf6af8c2de13e14f54355b5b8995f02"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:HSL62E2BVQTHMFNLLASSIMYEWW","target":"graph","payload":{"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"},"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:59:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O9aq5OfBojArFwK2l7BjPzMloA/Dum2oF4S6+yPTy33tI+nrTXve1rHw6NLbPLIRf+6kvg+1YKphs5lGkAX3CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:09:15.548165Z"},"content_sha256":"052f9be33c1c0f45cf75d67e9ac669ca1182e162aa7200fa918217b44c067809","schema_version":"1.0","event_id":"sha256:052f9be33c1c0f45cf75d67e9ac669ca1182e162aa7200fa918217b44c067809"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HSL62E2BVQTHMFNLLASSIMYEWW/bundle.json","state_url":"https://pith.science/pith/HSL62E2BVQTHMFNLLASSIMYEWW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HSL62E2BVQTHMFNLLASSIMYEWW/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-31T00:09:15Z","links":{"resolver":"https://pith.science/pith/HSL62E2BVQTHMFNLLASSIMYEWW","bundle":"https://pith.science/pith/HSL62E2BVQTHMFNLLASSIMYEWW/bundle.json","state":"https://pith.science/pith/HSL62E2BVQTHMFNLLASSIMYEWW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HSL62E2BVQTHMFNLLASSIMYEWW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:HSL62E2BVQTHMFNLLASSIMYEWW","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":"e0516efd58566b6a8d2c8557b63c394ebe82f06dd23c33ae89125df8bc05837a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-01T14:32:14Z","title_canon_sha256":"d34dc3d8f31c2d9544ea7caed0d23dbe15723b04ecd91338f5c7a425a232602a"},"schema_version":"1.0","source":{"id":"1206.0197","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.0197","created_at":"2026-05-18T00:59:09Z"},{"alias_kind":"arxiv_version","alias_value":"1206.0197v2","created_at":"2026-05-18T00:59:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.0197","created_at":"2026-05-18T00:59:09Z"},{"alias_kind":"pith_short_12","alias_value":"HSL62E2BVQTH","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"HSL62E2BVQTHMFNL","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"HSL62E2B","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:052f9be33c1c0f45cf75d67e9ac669ca1182e162aa7200fa918217b44c067809","target":"graph","created_at":"2026-05-18T00:59:09Z","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":"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 ","authors_text":"Bobak Nazer, Or Ordentlich, Uri Erez","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-01T14:32:14Z","title":"The Approximate Sum Capacity of the Symmetric Gaussian K-User Interference Channel"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.0197","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:d6af4a99b0d6f990dd065a6de19beebc2cf6af8c2de13e14f54355b5b8995f02","target":"record","created_at":"2026-05-18T00:59:09Z","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":"e0516efd58566b6a8d2c8557b63c394ebe82f06dd23c33ae89125df8bc05837a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-01T14:32:14Z","title_canon_sha256":"d34dc3d8f31c2d9544ea7caed0d23dbe15723b04ecd91338f5c7a425a232602a"},"schema_version":"1.0","source":{"id":"1206.0197","kind":"arxiv","version":2}},"canonical_sha256":"3c97ed1341ac267615ab5825243304b5910adab8335d90305d5f228055bfd73f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c97ed1341ac267615ab5825243304b5910adab8335d90305d5f228055bfd73f","first_computed_at":"2026-05-18T00:59:09.663885Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:09.663885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e11pPA3sCTFoYMKc+8mCWthUS29utorHKwAJJz8esj8guUYagI1Dwa/FhLAybr4EbLK4qDKYwXRM2/e1WdDNBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:09.664529Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.0197","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6af4a99b0d6f990dd065a6de19beebc2cf6af8c2de13e14f54355b5b8995f02","sha256:052f9be33c1c0f45cf75d67e9ac669ca1182e162aa7200fa918217b44c067809"],"state_sha256":"6aef2144f0353c38bda0a21b957ea7558acc52a33a386ef76df238ca5cfc8fa0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BNG8RtNRXQbO3/AfkW8t8ufmwLZNIzq1nmMSsmBoH81UwOyf2sF/T46lTkZBzbBmiOHBXrSOJ3YJbQ1gpmoEAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:09:15.551477Z","bundle_sha256":"4ab138b0f49924a2991ecfc02ee46dc7e31f0a50a16064a3830a9e18e1676c05"}}