{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OBST34UPJFKV4UUGZKNZ42BH6S","short_pith_number":"pith:OBST34UP","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"},"canonical_sha256":"70653df28f49555e5286ca9b9e6827f4980d9122802f70863cbfdf9746ef7aa0","source":{"kind":"arxiv","id":"1701.02345","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02345","created_at":"2026-05-18T00:53:04Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02345v1","created_at":"2026-05-18T00:53:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02345","created_at":"2026-05-18T00:53:04Z"},{"alias_kind":"pith_short_12","alias_value":"OBST34UPJFKV","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OBST34UPJFKV4UUG","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OBST34UP","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OBST34UPJFKV4UUGZKNZ42BH6S","target":"record","payload":{"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"},"canonical_sha256":"70653df28f49555e5286ca9b9e6827f4980d9122802f70863cbfdf9746ef7aa0","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"},"source_kind":"arxiv","source_id":"1701.02345","source_version":1,"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:53:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n/jN81QVV0PFRpxWStptLhguFjif74fKghftGnks4TMGgDCEgDaxq1TsnyteFbdDTuQBehoBtz9Y324c2PD2CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:22:41.772165Z"},"content_sha256":"73442db84b8c457f2763d34b1276b639588d0d176de5155159a7b613b7acbbc6","schema_version":"1.0","event_id":"sha256:73442db84b8c457f2763d34b1276b639588d0d176de5155159a7b613b7acbbc6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OBST34UPJFKV4UUGZKNZ42BH6S","target":"graph","payload":{"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"},"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:53:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A6qkNil9yQvuFKYa6/rnKcYjzPsqQfnE5TSn8AT7E90/bQ6R0lcoqPdRc0wT0ZGhgUe5XB+p1j6BacNYPTrjBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:22:41.772903Z"},"content_sha256":"9687d5bb1ee9b4a7b08e39364e9670393365193cc2716b5564efc1815aa9d5e8","schema_version":"1.0","event_id":"sha256:9687d5bb1ee9b4a7b08e39364e9670393365193cc2716b5564efc1815aa9d5e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OBST34UPJFKV4UUGZKNZ42BH6S/bundle.json","state_url":"https://pith.science/pith/OBST34UPJFKV4UUGZKNZ42BH6S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OBST34UPJFKV4UUGZKNZ42BH6S/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-31T18:22:41Z","links":{"resolver":"https://pith.science/pith/OBST34UPJFKV4UUGZKNZ42BH6S","bundle":"https://pith.science/pith/OBST34UPJFKV4UUGZKNZ42BH6S/bundle.json","state":"https://pith.science/pith/OBST34UPJFKV4UUGZKNZ42BH6S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OBST34UPJFKV4UUGZKNZ42BH6S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OBST34UPJFKV4UUGZKNZ42BH6S","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":"af7360fe72870e149f5cb207c0d6021b351f7365f33cd9d6bc8acecccc08f854","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-09T20:50:09Z","title_canon_sha256":"d58db29928b03f37c677eca8f4fa1a48bedeb5f725b06858fadf79120e6fdeae"},"schema_version":"1.0","source":{"id":"1701.02345","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.02345","created_at":"2026-05-18T00:53:04Z"},{"alias_kind":"arxiv_version","alias_value":"1701.02345v1","created_at":"2026-05-18T00:53:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02345","created_at":"2026-05-18T00:53:04Z"},{"alias_kind":"pith_short_12","alias_value":"OBST34UPJFKV","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OBST34UPJFKV4UUG","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OBST34UP","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:9687d5bb1ee9b4a7b08e39364e9670393365193cc2716b5564efc1815aa9d5e8","target":"graph","created_at":"2026-05-18T00:53:04Z","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":"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","authors_text":"Chiao-Yi Chen, Eren Sasoglu, Hosung Park, Lele Wang, Young-Han Kim","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-09T20:50:09Z","title":"Sliding-Window Superposition Coding:Two-User Interference Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02345","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:73442db84b8c457f2763d34b1276b639588d0d176de5155159a7b613b7acbbc6","target":"record","created_at":"2026-05-18T00:53:04Z","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":"af7360fe72870e149f5cb207c0d6021b351f7365f33cd9d6bc8acecccc08f854","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-01-09T20:50:09Z","title_canon_sha256":"d58db29928b03f37c677eca8f4fa1a48bedeb5f725b06858fadf79120e6fdeae"},"schema_version":"1.0","source":{"id":"1701.02345","kind":"arxiv","version":1}},"canonical_sha256":"70653df28f49555e5286ca9b9e6827f4980d9122802f70863cbfdf9746ef7aa0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70653df28f49555e5286ca9b9e6827f4980d9122802f70863cbfdf9746ef7aa0","first_computed_at":"2026-05-18T00:53:04.474554Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:04.474554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uOaThi2MWgOdSx0CMo+cKXFc8dIap4EsXcWFyWf8dUB38/CTJzwMn3M5VfSCOKQUTwjNlpN/WYimPD/BOFzWDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:04.475160Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.02345","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73442db84b8c457f2763d34b1276b639588d0d176de5155159a7b613b7acbbc6","sha256:9687d5bb1ee9b4a7b08e39364e9670393365193cc2716b5564efc1815aa9d5e8"],"state_sha256":"830807fcb4e0c555452826d0d8f4e1240f4e71ffb9419cc0f1fc89b9b22a0c07"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AbmMTeps5yY9e0ceHNkRB2LE2W/FNXgIaGc8z3KhMdVy7oSAJbRqzfN11q/wTVdCLBaJlJY0iSRx/omId6ChBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T18:22:41.777271Z","bundle_sha256":"8d9b059ce804c339495e23d1afbbee3d5c1bdb0be259f1e3ba44448afd3486c5"}}