{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OBST34UPJFKV4UUGZKNZ42BH6S","short_pith_number":"pith:OBST34UP","schema_version":"1.0","canonical_sha256":"70653df28f49555e5286ca9b9e6827f4980d9122802f70863cbfdf9746ef7aa0","source":{"kind":"arxiv","id":"1701.02345","version":1},"attestation_state":"computed","paper":{"title":"Sliding-Window Superposition Coding:Two-User Interference Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chiao-Yi Chen, Eren Sasoglu, Hosung Park, Lele Wang, Young-Han Kim","submitted_at":"2017-01-09T20:50:09Z","abstract_excerpt":"A low-complexity coding scheme is developed to achieve the rate region of maximum likelihood decoding for interference channels. As in the classical rate-splitting multiple access scheme by Grant, Rimoldi, Urbanke, and Whiting, the proposed coding scheme uses superposition of multiple codewords with successive cancellation decoding, which can be implemented using standard point-to-point encoders and decoders. Unlike rate-splitting multiple access, which is not rate-optimal for multiple receivers, the proposed coding scheme transmits codewords over multiple blocks in a staggered manner and reco"},"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":"1701.02345","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-09T20:50:09Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d58db29928b03f37c677eca8f4fa1a48bedeb5f725b06858fadf79120e6fdeae","abstract_canon_sha256":"af7360fe72870e149f5cb207c0d6021b351f7365f33cd9d6bc8acecccc08f854"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:04.475160Z","signature_b64":"uOaThi2MWgOdSx0CMo+cKXFc8dIap4EsXcWFyWf8dUB38/CTJzwMn3M5VfSCOKQUTwjNlpN/WYimPD/BOFzWDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70653df28f49555e5286ca9b9e6827f4980d9122802f70863cbfdf9746ef7aa0","last_reissued_at":"2026-05-18T00:53:04.474554Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:04.474554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sliding-Window Superposition Coding:Two-User Interference Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chiao-Yi Chen, Eren Sasoglu, Hosung Park, Lele Wang, Young-Han Kim","submitted_at":"2017-01-09T20:50:09Z","abstract_excerpt":"A low-complexity coding scheme is developed to achieve the rate region of maximum likelihood decoding for interference channels. As in the classical rate-splitting multiple access scheme by Grant, Rimoldi, Urbanke, and Whiting, the proposed coding scheme uses superposition of multiple codewords with successive cancellation decoding, which can be implemented using standard point-to-point encoders and decoders. Unlike rate-splitting multiple access, which is not rate-optimal for multiple receivers, the proposed coding scheme transmits codewords over multiple blocks in a staggered manner and reco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02345","kind":"arxiv","version":1},"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":"1701.02345","created_at":"2026-05-18T00:53:04.474642+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.02345v1","created_at":"2026-05-18T00:53:04.474642+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02345","created_at":"2026-05-18T00:53:04.474642+00:00"},{"alias_kind":"pith_short_12","alias_value":"OBST34UPJFKV","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OBST34UPJFKV4UUG","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OBST34UP","created_at":"2026-05-18T12:31:34.259226+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/OBST34UPJFKV4UUGZKNZ42BH6S","json":"https://pith.science/pith/OBST34UPJFKV4UUGZKNZ42BH6S.json","graph_json":"https://pith.science/api/pith-number/OBST34UPJFKV4UUGZKNZ42BH6S/graph.json","events_json":"https://pith.science/api/pith-number/OBST34UPJFKV4UUGZKNZ42BH6S/events.json","paper":"https://pith.science/paper/OBST34UP"},"agent_actions":{"view_html":"https://pith.science/pith/OBST34UPJFKV4UUGZKNZ42BH6S","download_json":"https://pith.science/pith/OBST34UPJFKV4UUGZKNZ42BH6S.json","view_paper":"https://pith.science/paper/OBST34UP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.02345&json=true","fetch_graph":"https://pith.science/api/pith-number/OBST34UPJFKV4UUGZKNZ42BH6S/graph.json","fetch_events":"https://pith.science/api/pith-number/OBST34UPJFKV4UUGZKNZ42BH6S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OBST34UPJFKV4UUGZKNZ42BH6S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OBST34UPJFKV4UUGZKNZ42BH6S/action/storage_attestation","attest_author":"https://pith.science/pith/OBST34UPJFKV4UUGZKNZ42BH6S/action/author_attestation","sign_citation":"https://pith.science/pith/OBST34UPJFKV4UUGZKNZ42BH6S/action/citation_signature","submit_replication":"https://pith.science/pith/OBST34UPJFKV4UUGZKNZ42BH6S/action/replication_record"}},"created_at":"2026-05-18T00:53:04.474642+00:00","updated_at":"2026-05-18T00:53:04.474642+00:00"}