{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:SLJMOE4PI5VYF7ONA325QZYI7P","short_pith_number":"pith:SLJMOE4P","schema_version":"1.0","canonical_sha256":"92d2c7138f476b82fdcd06f5d86708fbd75298656495e674e18be4fc358c056b","source":{"kind":"arxiv","id":"1011.3588","version":2},"attestation_state":"computed","paper":{"title":"Distributed Interference Cancellation in Multiple Access Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"I-Hsiang Wang","submitted_at":"2010-11-16T06:05:37Z","abstract_excerpt":"In this paper, we consider a Gaussian multiple access channel with multiple independent additive white Gaussian interferences. Each interference is known to exactly one transmitter non-causally. The capacity region is characterized to within a constant gap regardless of channel parameters. These results are based on a layered modulo-lattice scheme which realizes distributed interference cancellation."},"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":"1011.3588","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-16T06:05:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"63e2cf025ad3b60e571ee0aadc9751c8ac5454bed5e1a00cc9974e7b615b03ff","abstract_canon_sha256":"ba97ff1b8c9a48e9a1ea0c457ada17084182d1e2e72adaf55608fffdd6687ae1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:58.655249Z","signature_b64":"Mn/nLJhi+UU/Mr/rsKyhfb5mML5YzDYCOlnty6TSbsh1XFyVGlrXlsM+kquawX93dDw+p/TrBURSi29ZxQkXAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92d2c7138f476b82fdcd06f5d86708fbd75298656495e674e18be4fc358c056b","last_reissued_at":"2026-05-18T04:27:58.654754Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:58.654754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Interference Cancellation in Multiple Access Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"I-Hsiang Wang","submitted_at":"2010-11-16T06:05:37Z","abstract_excerpt":"In this paper, we consider a Gaussian multiple access channel with multiple independent additive white Gaussian interferences. Each interference is known to exactly one transmitter non-causally. The capacity region is characterized to within a constant gap regardless of channel parameters. These results are based on a layered modulo-lattice scheme which realizes distributed interference cancellation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3588","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":"1011.3588","created_at":"2026-05-18T04:27:58.654832+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.3588v2","created_at":"2026-05-18T04:27:58.654832+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3588","created_at":"2026-05-18T04:27:58.654832+00:00"},{"alias_kind":"pith_short_12","alias_value":"SLJMOE4PI5VY","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"SLJMOE4PI5VYF7ON","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"SLJMOE4P","created_at":"2026-05-18T12:26:13.927090+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/SLJMOE4PI5VYF7ONA325QZYI7P","json":"https://pith.science/pith/SLJMOE4PI5VYF7ONA325QZYI7P.json","graph_json":"https://pith.science/api/pith-number/SLJMOE4PI5VYF7ONA325QZYI7P/graph.json","events_json":"https://pith.science/api/pith-number/SLJMOE4PI5VYF7ONA325QZYI7P/events.json","paper":"https://pith.science/paper/SLJMOE4P"},"agent_actions":{"view_html":"https://pith.science/pith/SLJMOE4PI5VYF7ONA325QZYI7P","download_json":"https://pith.science/pith/SLJMOE4PI5VYF7ONA325QZYI7P.json","view_paper":"https://pith.science/paper/SLJMOE4P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.3588&json=true","fetch_graph":"https://pith.science/api/pith-number/SLJMOE4PI5VYF7ONA325QZYI7P/graph.json","fetch_events":"https://pith.science/api/pith-number/SLJMOE4PI5VYF7ONA325QZYI7P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SLJMOE4PI5VYF7ONA325QZYI7P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SLJMOE4PI5VYF7ONA325QZYI7P/action/storage_attestation","attest_author":"https://pith.science/pith/SLJMOE4PI5VYF7ONA325QZYI7P/action/author_attestation","sign_citation":"https://pith.science/pith/SLJMOE4PI5VYF7ONA325QZYI7P/action/citation_signature","submit_replication":"https://pith.science/pith/SLJMOE4PI5VYF7ONA325QZYI7P/action/replication_record"}},"created_at":"2026-05-18T04:27:58.654832+00:00","updated_at":"2026-05-18T04:27:58.654832+00:00"}