{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6O3OCWXIM4JZZPGNDCIGLM5IGA","short_pith_number":"pith:6O3OCWXI","canonical_record":{"source":{"id":"1801.07695","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-23T18:33:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"46e2d26cb3b7074956d27ab99e26391da07202230e4fb9d7dacca1603a87f340","abstract_canon_sha256":"00285d8bff2dec3aae7bcd0d30b74f60c3bdc6f7ef6925e46c75fa383393589e"},"schema_version":"1.0"},"canonical_sha256":"f3b6e15ae867139cbccd189065b3a83014adb5194bfe175103f1f0149336ac34","source":{"kind":"arxiv","id":"1801.07695","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07695","created_at":"2026-05-18T00:25:12Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07695v1","created_at":"2026-05-18T00:25:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07695","created_at":"2026-05-18T00:25:12Z"},{"alias_kind":"pith_short_12","alias_value":"6O3OCWXIM4JZ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"6O3OCWXIM4JZZPGN","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"6O3OCWXI","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6O3OCWXIM4JZZPGNDCIGLM5IGA","target":"record","payload":{"canonical_record":{"source":{"id":"1801.07695","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-23T18:33:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"46e2d26cb3b7074956d27ab99e26391da07202230e4fb9d7dacca1603a87f340","abstract_canon_sha256":"00285d8bff2dec3aae7bcd0d30b74f60c3bdc6f7ef6925e46c75fa383393589e"},"schema_version":"1.0"},"canonical_sha256":"f3b6e15ae867139cbccd189065b3a83014adb5194bfe175103f1f0149336ac34","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:12.278383Z","signature_b64":"fKzSyzbiPM7nZjM3SI1r+untt8Gv9t8k6ym5pkiAdQdWPf+qLMeh/APV7YuC+41dr7X6A6NTRXFhRuKABVMGCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3b6e15ae867139cbccd189065b3a83014adb5194bfe175103f1f0149336ac34","last_reissued_at":"2026-05-18T00:25:12.277879Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:12.277879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.07695","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:25:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bGaQos6dVa+x0WTor1y5Uu3YTMQiv/u9K7A6EoksyC9g0e51TzGJGAzzBUNKg+7c0wZsyyeOcmr9if3HBwDABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:44:05.596269Z"},"content_sha256":"16bed27c03e9b42ad1ba01b3a42547f003416e811274ae1636eec7a1f9119827","schema_version":"1.0","event_id":"sha256:16bed27c03e9b42ad1ba01b3a42547f003416e811274ae1636eec7a1f9119827"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6O3OCWXIM4JZZPGNDCIGLM5IGA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Homologous Codes for Multiple Access Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Pinar Sen, Young-Han Kim","submitted_at":"2018-01-23T18:33:43Z","abstract_excerpt":"Building on recent development by Padakandla and Pradhan, and by Lim, Feng, Pastore, Nazer, and Gastpar, this paper studies the potential of structured nested coset coding as a complete replacement for random coding in network information theory. The roles of two techniques used in nested coset coding to generate nonuniform codewords, namely, shaping and channel transformation, are clarified and illustrated via the simple example of the two-sender multiple access channel. While individually deficient, the optimal combination of shaping and channel transformation is shown to achieve the same pe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07695","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:25:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F3VqL8mbNEQ5OGzdiLkyd1A+4H1QnjzhstFUNsVerOVj/5CHf2a+UtTtlavGdmr0w1owvFHEF17RwXpvZ7pXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T05:44:05.596630Z"},"content_sha256":"e4b752ff0b39f2e9b3acdc8b9ac429d19f244ba12039d7a94c9b83b2b5234daa","schema_version":"1.0","event_id":"sha256:e4b752ff0b39f2e9b3acdc8b9ac429d19f244ba12039d7a94c9b83b2b5234daa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6O3OCWXIM4JZZPGNDCIGLM5IGA/bundle.json","state_url":"https://pith.science/pith/6O3OCWXIM4JZZPGNDCIGLM5IGA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6O3OCWXIM4JZZPGNDCIGLM5IGA/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-06-03T05:44:05Z","links":{"resolver":"https://pith.science/pith/6O3OCWXIM4JZZPGNDCIGLM5IGA","bundle":"https://pith.science/pith/6O3OCWXIM4JZZPGNDCIGLM5IGA/bundle.json","state":"https://pith.science/pith/6O3OCWXIM4JZZPGNDCIGLM5IGA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6O3OCWXIM4JZZPGNDCIGLM5IGA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6O3OCWXIM4JZZPGNDCIGLM5IGA","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":"00285d8bff2dec3aae7bcd0d30b74f60c3bdc6f7ef6925e46c75fa383393589e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-23T18:33:43Z","title_canon_sha256":"46e2d26cb3b7074956d27ab99e26391da07202230e4fb9d7dacca1603a87f340"},"schema_version":"1.0","source":{"id":"1801.07695","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07695","created_at":"2026-05-18T00:25:12Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07695v1","created_at":"2026-05-18T00:25:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07695","created_at":"2026-05-18T00:25:12Z"},{"alias_kind":"pith_short_12","alias_value":"6O3OCWXIM4JZ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"6O3OCWXIM4JZZPGN","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"6O3OCWXI","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:e4b752ff0b39f2e9b3acdc8b9ac429d19f244ba12039d7a94c9b83b2b5234daa","target":"graph","created_at":"2026-05-18T00:25:12Z","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":"Building on recent development by Padakandla and Pradhan, and by Lim, Feng, Pastore, Nazer, and Gastpar, this paper studies the potential of structured nested coset coding as a complete replacement for random coding in network information theory. The roles of two techniques used in nested coset coding to generate nonuniform codewords, namely, shaping and channel transformation, are clarified and illustrated via the simple example of the two-sender multiple access channel. While individually deficient, the optimal combination of shaping and channel transformation is shown to achieve the same pe","authors_text":"Pinar Sen, Young-Han Kim","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-23T18:33:43Z","title":"Homologous Codes for Multiple Access Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07695","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:16bed27c03e9b42ad1ba01b3a42547f003416e811274ae1636eec7a1f9119827","target":"record","created_at":"2026-05-18T00:25:12Z","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":"00285d8bff2dec3aae7bcd0d30b74f60c3bdc6f7ef6925e46c75fa383393589e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-23T18:33:43Z","title_canon_sha256":"46e2d26cb3b7074956d27ab99e26391da07202230e4fb9d7dacca1603a87f340"},"schema_version":"1.0","source":{"id":"1801.07695","kind":"arxiv","version":1}},"canonical_sha256":"f3b6e15ae867139cbccd189065b3a83014adb5194bfe175103f1f0149336ac34","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f3b6e15ae867139cbccd189065b3a83014adb5194bfe175103f1f0149336ac34","first_computed_at":"2026-05-18T00:25:12.277879Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:12.277879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fKzSyzbiPM7nZjM3SI1r+untt8Gv9t8k6ym5pkiAdQdWPf+qLMeh/APV7YuC+41dr7X6A6NTRXFhRuKABVMGCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:12.278383Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.07695","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16bed27c03e9b42ad1ba01b3a42547f003416e811274ae1636eec7a1f9119827","sha256:e4b752ff0b39f2e9b3acdc8b9ac429d19f244ba12039d7a94c9b83b2b5234daa"],"state_sha256":"53f2317f4ff5d137becfccd04953ca79d2f8500879dd90222e5c45362b80a975"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vXg8mC20Lt5SyqvwuUwLCNYp6+bNBCDi4ktGfcecOzRiZeCsG6gkpLMGlX95TLmBNZTb01G7FOpHPa8ScfEdCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T05:44:05.598562Z","bundle_sha256":"628c60b56e4f3f5cc3dbf5c6a53a465f906afc85314e4d331b3aae74a519d292"}}